UNPKG

2.37 MBSource Map (JSON)View Raw
1{
2 "version": 3,
3 "sources": ["../node_modules/localforage/dist/localforage.js", "../node_modules/base64-js/index.js", "../node_modules/ieee754/index.js", "../node_modules/buffer/index.js", "(disabled):crypto", "../node_modules/noble-ed25519/index.js", "../node_modules/src/types.ts", "../node_modules/src/constants.ts", "../node_modules/src/utils.ts", "../node_modules/src/errors.ts", "../node_modules/src/rsa/keys.ts", "../node_modules/src/rsa/operations.ts", "../node_modules/src/idb.ts", "../node_modules/src/ecc/keys.ts", "../node_modules/src/config.ts", "../node_modules/src/aes/keys.ts", "../node_modules/src/aes/operations.ts", "../node_modules/src/aes/index.ts", "../node_modules/src/keystore/base.ts", "../node_modules/src/rsa/keystore.ts", "../node_modules/src/rsa/index.ts", "../node_modules/node_modules/@ungap/global-this/cjs/index.js", "../node_modules/node_modules/localforage/dist/localforage.js", "../node_modules/src/types.ts", "../node_modules/src/errors.ts", "../node_modules/src/idb.ts", "../node_modules/node_modules/rollup-plugin-node-polyfills/polyfills/global.js", "../node_modules/node_modules/rollup-plugin-node-polyfills/polyfills/buffer-es6.js", "../node_modules/src/utils.ts", "../node_modules/src/constants.ts", "../node_modules/src/ecc/keys.ts", "../node_modules/src/aes/keys.ts", "../node_modules/src/aes/operations.ts", "../node_modules/src/aes/index.ts", "../node_modules/src/ecc/operations.ts", "../node_modules/src/config.ts", "../node_modules/src/keystore/base.ts", "../node_modules/src/ecc/keystore.ts", "../node_modules/src/rsa/keys.ts", "../node_modules/src/rsa/operations.ts", "../node_modules/src/rsa/keystore.ts", "../node_modules/src/keystore/index.ts", "../node_modules/src/ecc/index.ts", "../node_modules/src/rsa/index.ts", "../node_modules/src/index.ts", "../node_modules/ipfs-message-port-protocol/src/error.js", "../node_modules/ipfs-message-port-protocol/src/buffer.js", "../node_modules/ipfs-message-port-client/src/client/error.js", "../node_modules/ipfs-message-port-client/src/client/transport.js", "../node_modules/ipfs-message-port-client/src/client/query.js", "../node_modules/ipfs-message-port-client/src/client/service.js", "../node_modules/ipfs-message-port-client/src/client.js", "../node_modules/@multiformats/base-x/src/index.js", "../node_modules/multibase/src/util.js", "../node_modules/multibase/src/base.js", "../node_modules/multibase/src/rfc4648.js", "../node_modules/multibase/src/constants.js", "../node_modules/multibase/src/index.js", "../node_modules/multihashes/node_modules/varint/encode.js", "../node_modules/multihashes/node_modules/varint/decode.js", "../node_modules/multihashes/node_modules/varint/length.js", "../node_modules/multihashes/node_modules/varint/index.js", "../node_modules/multihashes/src/constants.js", "../node_modules/uint8arrays/to-string.js", "../node_modules/uint8arrays/from-string.js", "../node_modules/uint8arrays/concat.js", "../node_modules/multihashes/src/index.js", "../node_modules/multicodec/node_modules/varint/encode.js", "../node_modules/multicodec/node_modules/varint/decode.js", "../node_modules/multicodec/node_modules/varint/length.js", "../node_modules/multicodec/node_modules/varint/index.js", "../node_modules/multicodec/src/util.js", "../node_modules/multicodec/src/generated-table.js", "../node_modules/multicodec/src/maps.js", "../node_modules/multicodec/src/index.js", "../node_modules/cids/src/cid-util.js", "../node_modules/uint8arrays/equals.js", "../node_modules/cids/src/index.js", "../node_modules/ipfs-message-port-protocol/src/cid.js", "../node_modules/ipld-block/src/index.js", "../node_modules/ipfs-message-port-protocol/src/block.js", "../node_modules/ipfs-message-port-client/src/block.js", "../node_modules/ipfs-message-port-protocol/src/dag.js", "../node_modules/ipfs-message-port-client/src/dag.js", "../node_modules/ipfs-message-port-protocol/src/core.js", "../node_modules/browser-readablestream-to-it/index.js", "../node_modules/ipfs-message-port-client/src/core.js", "../node_modules/ipfs-message-port-client/src/files.js", "../node_modules/ipfs-message-port-client/src/pin.js", "../node_modules/ipfs-message-port-client/src/index.js", "../node_modules/@protobufjs/aspromise/index.js", "../node_modules/@protobufjs/base64/index.js", "../node_modules/@protobufjs/eventemitter/index.js", "../node_modules/@protobufjs/float/index.js", "../node_modules/@protobufjs/inquire/index.js", "../node_modules/@protobufjs/utf8/index.js", "../node_modules/@protobufjs/pool/index.js", "../node_modules/protobufjs/src/util/longbits.js", "../node_modules/protobufjs/src/util/minimal.js", "../node_modules/protobufjs/src/writer.js", "../node_modules/protobufjs/src/writer_buffer.js", "../node_modules/protobufjs/src/reader.js", "../node_modules/protobufjs/src/reader_buffer.js", "../node_modules/protobufjs/src/rpc/service.js", "../node_modules/protobufjs/src/rpc.js", "../node_modules/protobufjs/src/roots.js", "../node_modules/protobufjs/src/index-minimal.js", "../node_modules/protobufjs/minimal.js", "../node_modules/ipld-dag-pb/src/dag.js", "../node_modules/ipld-dag-pb/src/dag-link/dagLink.js", "../node_modules/stable/stable.js", "../node_modules/uint8arrays/compare.js", "../node_modules/ipld-dag-pb/src/dag-node/sortLinks.js", "../node_modules/ipld-dag-pb/src/dag-link/util.js", "../node_modules/ipld-dag-pb/src/serialize.js", "../node_modules/err-code/index.js", "../node_modules/js-sha3/src/sha3.js", "../node_modules/murmurhash3js-revisited/lib/murmurHash3js.js", "../node_modules/murmurhash3js-revisited/index.js", "../node_modules/multihashing-async/src/sha.browser.js", "../node_modules/multihashing-async/src/utils.js", "../node_modules/blakejs/util.js", "../node_modules/blakejs/blake2b.js", "../node_modules/blakejs/blake2s.js", "../node_modules/blakejs/index.js", "../node_modules/multihashing-async/src/blake.js", "../node_modules/multihashing-async/src/crypto.js", "../node_modules/multihashing-async/src/index.js", "../node_modules/ipld-dag-pb/src/genCid.js", "../node_modules/ipld-dag-pb/src/dag-node/toDagLink.js", "../node_modules/ipld-dag-pb/src/dag-node/addLink.js", "../node_modules/ipld-dag-pb/src/dag-node/rmLink.js", "../node_modules/ipld-dag-pb/src/dag-node/dagNode.js", "../node_modules/ipld-dag-pb/src/util.js", "../node_modules/ipld-dag-pb/src/resolver.js", "../node_modules/ipld-dag-pb/src/index.js", "../node_modules/base58-universal/dist/baseN.js", "../node_modules/base58-universal/dist/index.js", "../node_modules/cuint/lib/uint32.js", "../node_modules/cuint/lib/uint64.js", "../node_modules/cuint/index.js", "../node_modules/xxhashjs/lib/xxhash.js", "../node_modules/xxhashjs/lib/xxhash64.js", "../node_modules/xxhashjs/lib/index.js", "../node_modules/fission-bloom-filters/dist/utils.js", "../node_modules/seedrandom/lib/alea.js", "../node_modules/seedrandom/lib/xor128.js", "../node_modules/seedrandom/lib/xorwow.js", "../node_modules/seedrandom/lib/xorshift7.js", "../node_modules/seedrandom/lib/xor4096.js", "../node_modules/seedrandom/lib/tychei.js", "../node_modules/seedrandom/seedrandom.js", "../node_modules/seedrandom/index.js", "../node_modules/fission-bloom-filters/dist/base-filter.js", "../node_modules/reflect-metadata/Reflect.js", "../node_modules/fission-bloom-filters/dist/exportable.js", "../node_modules/fission-bloom-filters/dist/formulas.js", "../node_modules/fission-bloom-filters/dist/bloom/bloom-filter.js", "../node_modules/fission-bloom-filters/dist/bloom/counting-bloom-filter.js", "../node_modules/fission-bloom-filters/dist/bloom/partitioned-bloom-filter.js", "../node_modules/fission-bloom-filters/dist/sketch/count-min-sketch.js", "../node_modules/fission-bloom-filters/dist/sketch/hyperloglog.js", "../node_modules/lodash/lodash.js", "../node_modules/fission-bloom-filters/dist/sketch/topk.js", "../node_modules/fission-bloom-filters/dist/sketch/min-hash.js", "../node_modules/fission-bloom-filters/dist/sketch/min-hash-factory.js", "../node_modules/lodash.eq/index.js", "../node_modules/lodash.indexof/index.js", "../node_modules/fission-bloom-filters/dist/cuckoo/bucket.js", "../node_modules/fission-bloom-filters/dist/cuckoo/cuckoo-filter.js", "../node_modules/fission-bloom-filters/dist/iblt/cell.js", "../node_modules/fission-bloom-filters/dist/iblt/invertible-bloom-lookup-tables.js", "../node_modules/fission-bloom-filters/dist/api.js", "../src/index.ts", "../src/common/index.ts", "../src/common/api.ts", "../src/dns/index.ts", "../src/common/async.ts", "../src/setup/internal.ts", "../src/common/arrbufs.ts", "../src/common/base64.ts", "../src/common/blob.ts", "../src/crypto/browser.ts", "../src/common/browser.ts", "../src/keystore.ts", "../src/storage/browser.ts", "../src/setup/dependencies.ts", "../src/storage/index.ts", "../src/common/type-checks.ts", "../src/common/util.ts", "../src/common/version.ts", "../src/crypto/index.ts", "../src/common/hex.ts", "../src/path.ts", "../src/common/identifiers.ts", "../src/ipfs/index.ts", "../src/ipfs/config.ts", "../src/ipfs/basic.ts", "../src/ipfs/util.ts", "../src/ipfs/constants.ts", "../src/ipfs/encoded.ts", "../node_modules/cborg/esm/cborg.js", "../node_modules/cborg/esm/lib/is.js", "../node_modules/cborg/esm/lib/token.js", "../node_modules/cborg/esm/lib/byte-utils.js", "../node_modules/cborg/esm/lib/bl.js", "../node_modules/cborg/esm/lib/common.js", "../node_modules/cborg/esm/lib/0uint.js", "../node_modules/cborg/esm/lib/1negint.js", "../node_modules/cborg/esm/lib/2bytes.js", "../node_modules/cborg/esm/lib/3string.js", "../node_modules/cborg/esm/lib/4array.js", "../node_modules/cborg/esm/lib/5map.js", "../node_modules/cborg/esm/lib/6tag.js", "../node_modules/cborg/esm/lib/7float.js", "../node_modules/cborg/esm/lib/jump.js", "../node_modules/cborg/esm/lib/encode.js", "../node_modules/cborg/esm/lib/decode.js", "../src/ucan/permissions.ts", "../src/ucan/dictionary.ts", "../node_modules/base58-universal/dist/esm/index.js", "../src/did/transformers.ts", "../src/did/types.ts", "../src/did/util.ts", "../src/did/local.ts", "../src/did/validation.ts", "../src/ucan/token.ts", "../src/ucan/store.ts", "../src/ucan/internal.ts", "../src/did/index.ts", "../src/did/getters.ts", "../node_modules/throttle-debounce/throttle.js", "../node_modules/throttle-debounce/debounce.js", "../src/fs/link.ts", "../src/fs/semver.ts", "../src/fs/metadata.ts", "../src/fs/protocol/basic.ts", "../src/fs/protocol/public/index.ts", "../src/fs/types/check.ts", "../src/fs/protocol/private/index.ts", "../src/fs/protocol/private/types/check.ts", "../src/fs/protocol/private/namefilter.ts", "../src/fs/base/file.ts", "../src/fs/bare/file.ts", "../src/fs/base/tree.ts", "../src/fs/bare/tree.ts", "../src/fs/protocol/private/mmpt.ts", "../src/fs/v1/PublicHistory.ts", "../src/fs/v1/PublicFile.ts", "../src/fs/protocol/public/skeleton.ts", "../src/fs/v1/PublicTree.ts", "../src/fs/v1/PrivateHistory.ts", "../src/fs/v1/PrivateFile.ts", "../src/fs/v1/PrivateTree.ts", "../src/fs/root/tree.ts", "../src/common/cid-log.ts", "../src/data-root.ts", "../src/common/debug.ts", "../src/ucan/index.ts", "../src/errors.ts", "../src/fs/filesystem.ts", "../src/fs/index.ts", "../src/filesystem.ts", "../src/auth.ts", "../src/apps/index.ts", "../src/lobby/index.ts", "../src/lobby/blocklist.ts", "../src/lobby/username.ts", "../src/setup.ts"],
4 "sourcesContent": ["/*!\n localForage -- Offline Storage, Improved\n Version 1.9.0\n https://localforage.github.io/localForage\n (c) 2013-2017 Mozilla, Apache License 2.0\n*/\n(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof window!==\"undefined\"){g=window}else if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.localforage = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw (f.code=\"MODULE_NOT_FOUND\", f)}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){\n(function (global){\n'use strict';\nvar Mutation = global.MutationObserver || global.WebKitMutationObserver;\n\nvar scheduleDrain;\n\n{\n if (Mutation) {\n var called = 0;\n var observer = new Mutation(nextTick);\n var element = global.document.createTextNode('');\n observer.observe(element, {\n characterData: true\n });\n scheduleDrain = function () {\n element.data = (called = ++called % 2);\n };\n } else if (!global.setImmediate && typeof global.MessageChannel !== 'undefined') {\n var channel = new global.MessageChannel();\n channel.port1.onmessage = nextTick;\n scheduleDrain = function () {\n channel.port2.postMessage(0);\n };\n } else if ('document' in global && 'onreadystatechange' in global.document.createElement('script')) {\n scheduleDrain = function () {\n\n // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n var scriptEl = global.document.createElement('script');\n scriptEl.onreadystatechange = function () {\n nextTick();\n\n scriptEl.onreadystatechange = null;\n scriptEl.parentNode.removeChild(scriptEl);\n scriptEl = null;\n };\n global.document.documentElement.appendChild(scriptEl);\n };\n } else {\n scheduleDrain = function () {\n setTimeout(nextTick, 0);\n };\n }\n}\n\nvar draining;\nvar queue = [];\n//named nextTick for less confusing stack traces\nfunction nextTick() {\n draining = true;\n var i, oldQueue;\n var len = queue.length;\n while (len) {\n oldQueue = queue;\n queue = [];\n i = -1;\n while (++i < len) {\n oldQueue[i]();\n }\n len = queue.length;\n }\n draining = false;\n}\n\nmodule.exports = immediate;\nfunction immediate(task) {\n if (queue.push(task) === 1 && !draining) {\n scheduleDrain();\n }\n}\n\n}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{}],2:[function(_dereq_,module,exports){\n'use strict';\nvar immediate = _dereq_(1);\n\n/* istanbul ignore next */\nfunction INTERNAL() {}\n\nvar handlers = {};\n\nvar REJECTED = ['REJECTED'];\nvar FULFILLED = ['FULFILLED'];\nvar PENDING = ['PENDING'];\n\nmodule.exports = Promise;\n\nfunction Promise(resolver) {\n if (typeof resolver !== 'function') {\n throw new TypeError('resolver must be a function');\n }\n this.state = PENDING;\n this.queue = [];\n this.outcome = void 0;\n if (resolver !== INTERNAL) {\n safelyResolveThenable(this, resolver);\n }\n}\n\nPromise.prototype[\"catch\"] = function (onRejected) {\n return this.then(null, onRejected);\n};\nPromise.prototype.then = function (onFulfilled, onRejected) {\n if (typeof onFulfilled !== 'function' && this.state === FULFILLED ||\n typeof onRejected !== 'function' && this.state === REJECTED) {\n return this;\n }\n var promise = new this.constructor(INTERNAL);\n if (this.state !== PENDING) {\n var resolver = this.state === FULFILLED ? onFulfilled : onRejected;\n unwrap(promise, resolver, this.outcome);\n } else {\n this.queue.push(new QueueItem(promise, onFulfilled, onRejected));\n }\n\n return promise;\n};\nfunction QueueItem(promise, onFulfilled, onRejected) {\n this.promise = promise;\n if (typeof onFulfilled === 'function') {\n this.onFulfilled = onFulfilled;\n this.callFulfilled = this.otherCallFulfilled;\n }\n if (typeof onRejected === 'function') {\n this.onRejected = onRejected;\n this.callRejected = this.otherCallRejected;\n }\n}\nQueueItem.prototype.callFulfilled = function (value) {\n handlers.resolve(this.promise, value);\n};\nQueueItem.prototype.otherCallFulfilled = function (value) {\n unwrap(this.promise, this.onFulfilled, value);\n};\nQueueItem.prototype.callRejected = function (value) {\n handlers.reject(this.promise, value);\n};\nQueueItem.prototype.otherCallRejected = function (value) {\n unwrap(this.promise, this.onRejected, value);\n};\n\nfunction unwrap(promise, func, value) {\n immediate(function () {\n var returnValue;\n try {\n returnValue = func(value);\n } catch (e) {\n return handlers.reject(promise, e);\n }\n if (returnValue === promise) {\n handlers.reject(promise, new TypeError('Cannot resolve promise with itself'));\n } else {\n handlers.resolve(promise, returnValue);\n }\n });\n}\n\nhandlers.resolve = function (self, value) {\n var result = tryCatch(getThen, value);\n if (result.status === 'error') {\n return handlers.reject(self, result.value);\n }\n var thenable = result.value;\n\n if (thenable) {\n safelyResolveThenable(self, thenable);\n } else {\n self.state = FULFILLED;\n self.outcome = value;\n var i = -1;\n var len = self.queue.length;\n while (++i < len) {\n self.queue[i].callFulfilled(value);\n }\n }\n return self;\n};\nhandlers.reject = function (self, error) {\n self.state = REJECTED;\n self.outcome = error;\n var i = -1;\n var len = self.queue.length;\n while (++i < len) {\n self.queue[i].callRejected(error);\n }\n return self;\n};\n\nfunction getThen(obj) {\n // Make sure we only access the accessor once as required by the spec\n var then = obj && obj.then;\n if (obj && (typeof obj === 'object' || typeof obj === 'function') && typeof then === 'function') {\n return function appyThen() {\n then.apply(obj, arguments);\n };\n }\n}\n\nfunction safelyResolveThenable(self, thenable) {\n // Either fulfill, reject or reject with error\n var called = false;\n function onError(value) {\n if (called) {\n return;\n }\n called = true;\n handlers.reject(self, value);\n }\n\n function onSuccess(value) {\n if (called) {\n return;\n }\n called = true;\n handlers.resolve(self, value);\n }\n\n function tryToUnwrap() {\n thenable(onSuccess, onError);\n }\n\n var result = tryCatch(tryToUnwrap);\n if (result.status === 'error') {\n onError(result.value);\n }\n}\n\nfunction tryCatch(func, value) {\n var out = {};\n try {\n out.value = func(value);\n out.status = 'success';\n } catch (e) {\n out.status = 'error';\n out.value = e;\n }\n return out;\n}\n\nPromise.resolve = resolve;\nfunction resolve(value) {\n if (value instanceof this) {\n return value;\n }\n return handlers.resolve(new this(INTERNAL), value);\n}\n\nPromise.reject = reject;\nfunction reject(reason) {\n var promise = new this(INTERNAL);\n return handlers.reject(promise, reason);\n}\n\nPromise.all = all;\nfunction all(iterable) {\n var self = this;\n if (Object.prototype.toString.call(iterable) !== '[object Array]') {\n return this.reject(new TypeError('must be an array'));\n }\n\n var len = iterable.length;\n var called = false;\n if (!len) {\n return this.resolve([]);\n }\n\n var values = new Array(len);\n var resolved = 0;\n var i = -1;\n var promise = new this(INTERNAL);\n\n while (++i < len) {\n allResolver(iterable[i], i);\n }\n return promise;\n function allResolver(value, i) {\n self.resolve(value).then(resolveFromAll, function (error) {\n if (!called) {\n called = true;\n handlers.reject(promise, error);\n }\n });\n function resolveFromAll(outValue) {\n values[i] = outValue;\n if (++resolved === len && !called) {\n called = true;\n handlers.resolve(promise, values);\n }\n }\n }\n}\n\nPromise.race = race;\nfunction race(iterable) {\n var self = this;\n if (Object.prototype.toString.call(iterable) !== '[object Array]') {\n return this.reject(new TypeError('must be an array'));\n }\n\n var len = iterable.length;\n var called = false;\n if (!len) {\n return this.resolve([]);\n }\n\n var i = -1;\n var promise = new this(INTERNAL);\n\n while (++i < len) {\n resolver(iterable[i]);\n }\n return promise;\n function resolver(value) {\n self.resolve(value).then(function (response) {\n if (!called) {\n called = true;\n handlers.resolve(promise, response);\n }\n }, function (error) {\n if (!called) {\n called = true;\n handlers.reject(promise, error);\n }\n });\n }\n}\n\n},{\"1\":1}],3:[function(_dereq_,module,exports){\n(function (global){\n'use strict';\nif (typeof global.Promise !== 'function') {\n global.Promise = _dereq_(2);\n}\n\n}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{\"2\":2}],4:[function(_dereq_,module,exports){\n'use strict';\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction getIDB() {\n /* global indexedDB,webkitIndexedDB,mozIndexedDB,OIndexedDB,msIndexedDB */\n try {\n if (typeof indexedDB !== 'undefined') {\n return indexedDB;\n }\n if (typeof webkitIndexedDB !== 'undefined') {\n return webkitIndexedDB;\n }\n if (typeof mozIndexedDB !== 'undefined') {\n return mozIndexedDB;\n }\n if (typeof OIndexedDB !== 'undefined') {\n return OIndexedDB;\n }\n if (typeof msIndexedDB !== 'undefined') {\n return msIndexedDB;\n }\n } catch (e) {\n return;\n }\n}\n\nvar idb = getIDB();\n\nfunction isIndexedDBValid() {\n try {\n // Initialize IndexedDB; fall back to vendor-prefixed versions\n // if needed.\n if (!idb || !idb.open) {\n return false;\n }\n // We mimic PouchDB here;\n //\n // We test for openDatabase because IE Mobile identifies itself\n // as Safari. Oh the lulz...\n var isSafari = typeof openDatabase !== 'undefined' && /(Safari|iPhone|iPad|iPod)/.test(navigator.userAgent) && !/Chrome/.test(navigator.userAgent) && !/BlackBerry/.test(navigator.platform);\n\n var hasFetch = typeof fetch === 'function' && fetch.toString().indexOf('[native code') !== -1;\n\n // Safari <10.1 does not meet our requirements for IDB support\n // (see: https://github.com/pouchdb/pouchdb/issues/5572).\n // Safari 10.1 shipped with fetch, we can use that to detect it.\n // Note: this creates issues with `window.fetch` polyfills and\n // overrides; see:\n // https://github.com/localForage/localForage/issues/856\n return (!isSafari || hasFetch) && typeof indexedDB !== 'undefined' &&\n // some outdated implementations of IDB that appear on Samsung\n // and HTC Android devices <4.4 are missing IDBKeyRange\n // See: https://github.com/mozilla/localForage/issues/128\n // See: https://github.com/mozilla/localForage/issues/272\n typeof IDBKeyRange !== 'undefined';\n } catch (e) {\n return false;\n }\n}\n\n// Abstracts constructing a Blob object, so it also works in older\n// browsers that don't support the native Blob constructor. (i.e.\n// old QtWebKit versions, at least).\n// Abstracts constructing a Blob object, so it also works in older\n// browsers that don't support the native Blob constructor. (i.e.\n// old QtWebKit versions, at least).\nfunction createBlob(parts, properties) {\n /* global BlobBuilder,MSBlobBuilder,MozBlobBuilder,WebKitBlobBuilder */\n parts = parts || [];\n properties = properties || {};\n try {\n return new Blob(parts, properties);\n } catch (e) {\n if (e.name !== 'TypeError') {\n throw e;\n }\n var Builder = typeof BlobBuilder !== 'undefined' ? BlobBuilder : typeof MSBlobBuilder !== 'undefined' ? MSBlobBuilder : typeof MozBlobBuilder !== 'undefined' ? MozBlobBuilder : WebKitBlobBuilder;\n var builder = new Builder();\n for (var i = 0; i < parts.length; i += 1) {\n builder.append(parts[i]);\n }\n return builder.getBlob(properties.type);\n }\n}\n\n// This is CommonJS because lie is an external dependency, so Rollup\n// can just ignore it.\nif (typeof Promise === 'undefined') {\n // In the \"nopromises\" build this will just throw if you don't have\n // a global promise object, but it would throw anyway later.\n _dereq_(3);\n}\nvar Promise$1 = Promise;\n\nfunction executeCallback(promise, callback) {\n if (callback) {\n promise.then(function (result) {\n callback(null, result);\n }, function (error) {\n callback(error);\n });\n }\n}\n\nfunction executeTwoCallbacks(promise, callback, errorCallback) {\n if (typeof callback === 'function') {\n promise.then(callback);\n }\n\n if (typeof errorCallback === 'function') {\n promise[\"catch\"](errorCallback);\n }\n}\n\nfunction normalizeKey(key) {\n // Cast the key to a string, as that's all we can set as a key.\n if (typeof key !== 'string') {\n console.warn(key + ' used as a key, but it is not a string.');\n key = String(key);\n }\n\n return key;\n}\n\nfunction getCallback() {\n if (arguments.length && typeof arguments[arguments.length - 1] === 'function') {\n return arguments[arguments.length - 1];\n }\n}\n\n// Some code originally from async_storage.js in\n// [Gaia](https://github.com/mozilla-b2g/gaia).\n\nvar DETECT_BLOB_SUPPORT_STORE = 'local-forage-detect-blob-support';\nvar supportsBlobs = void 0;\nvar dbContexts = {};\nvar toString = Object.prototype.toString;\n\n// Transaction Modes\nvar READ_ONLY = 'readonly';\nvar READ_WRITE = 'readwrite';\n\n// Transform a binary string to an array buffer, because otherwise\n// weird stuff happens when you try to work with the binary string directly.\n// It is known.\n// From http://stackoverflow.com/questions/14967647/ (continues on next line)\n// encode-decode-image-with-base64-breaks-image (2013-04-21)\nfunction _binStringToArrayBuffer(bin) {\n var length = bin.length;\n var buf = new ArrayBuffer(length);\n var arr = new Uint8Array(buf);\n for (var i = 0; i < length; i++) {\n arr[i] = bin.charCodeAt(i);\n }\n return buf;\n}\n\n//\n// Blobs are not supported in all versions of IndexedDB, notably\n// Chrome <37 and Android <5. In those versions, storing a blob will throw.\n//\n// Various other blob bugs exist in Chrome v37-42 (inclusive).\n// Detecting them is expensive and confusing to users, and Chrome 37-42\n// is at very low usage worldwide, so we do a hacky userAgent check instead.\n//\n// content-type bug: https://code.google.com/p/chromium/issues/detail?id=408120\n// 404 bug: https://code.google.com/p/chromium/issues/detail?id=447916\n// FileReader bug: https://code.google.com/p/chromium/issues/detail?id=447836\n//\n// Code borrowed from PouchDB. See:\n// https://github.com/pouchdb/pouchdb/blob/master/packages/node_modules/pouchdb-adapter-idb/src/blobSupport.js\n//\nfunction _checkBlobSupportWithoutCaching(idb) {\n return new Promise$1(function (resolve) {\n var txn = idb.transaction(DETECT_BLOB_SUPPORT_STORE, READ_WRITE);\n var blob = createBlob(['']);\n txn.objectStore(DETECT_BLOB_SUPPORT_STORE).put(blob, 'key');\n\n txn.onabort = function (e) {\n // If the transaction aborts now its due to not being able to\n // write to the database, likely due to the disk being full\n e.preventDefault();\n e.stopPropagation();\n resolve(false);\n };\n\n txn.oncomplete = function () {\n var matchedChrome = navigator.userAgent.match(/Chrome\\/(\\d+)/);\n var matchedEdge = navigator.userAgent.match(/Edge\\//);\n // MS Edge pretends to be Chrome 42:\n // https://msdn.microsoft.com/en-us/library/hh869301%28v=vs.85%29.aspx\n resolve(matchedEdge || !matchedChrome || parseInt(matchedChrome[1], 10) >= 43);\n };\n })[\"catch\"](function () {\n return false; // error, so assume unsupported\n });\n}\n\nfunction _checkBlobSupport(idb) {\n if (typeof supportsBlobs === 'boolean') {\n return Promise$1.resolve(supportsBlobs);\n }\n return _checkBlobSupportWithoutCaching(idb).then(function (value) {\n supportsBlobs = value;\n return supportsBlobs;\n });\n}\n\nfunction _deferReadiness(dbInfo) {\n var dbContext = dbContexts[dbInfo.name];\n\n // Create a deferred object representing the current database operation.\n var deferredOperation = {};\n\n deferredOperation.promise = new Promise$1(function (resolve, reject) {\n deferredOperation.resolve = resolve;\n deferredOperation.reject = reject;\n });\n\n // Enqueue the deferred operation.\n dbContext.deferredOperations.push(deferredOperation);\n\n // Chain its promise to the database readiness.\n if (!dbContext.dbReady) {\n dbContext.dbReady = deferredOperation.promise;\n } else {\n dbContext.dbReady = dbContext.dbReady.then(function () {\n return deferredOperation.promise;\n });\n }\n}\n\nfunction _advanceReadiness(dbInfo) {\n var dbContext = dbContexts[dbInfo.name];\n\n // Dequeue a deferred operation.\n var deferredOperation = dbContext.deferredOperations.pop();\n\n // Resolve its promise (which is part of the database readiness\n // chain of promises).\n if (deferredOperation) {\n deferredOperation.resolve();\n return deferredOperation.promise;\n }\n}\n\nfunction _rejectReadiness(dbInfo, err) {\n var dbContext = dbContexts[dbInfo.name];\n\n // Dequeue a deferred operation.\n var deferredOperation = dbContext.deferredOperations.pop();\n\n // Reject its promise (which is part of the database readiness\n // chain of promises).\n if (deferredOperation) {\n deferredOperation.reject(err);\n return deferredOperation.promise;\n }\n}\n\nfunction _getConnection(dbInfo, upgradeNeeded) {\n return new Promise$1(function (resolve, reject) {\n dbContexts[dbInfo.name] = dbContexts[dbInfo.name] || createDbContext();\n\n if (dbInfo.db) {\n if (upgradeNeeded) {\n _deferReadiness(dbInfo);\n dbInfo.db.close();\n } else {\n return resolve(dbInfo.db);\n }\n }\n\n var dbArgs = [dbInfo.name];\n\n if (upgradeNeeded) {\n dbArgs.push(dbInfo.version);\n }\n\n var openreq = idb.open.apply(idb, dbArgs);\n\n if (upgradeNeeded) {\n openreq.onupgradeneeded = function (e) {\n var db = openreq.result;\n try {\n db.createObjectStore(dbInfo.storeName);\n if (e.oldVersion <= 1) {\n // Added when support for blob shims was added\n db.createObjectStore(DETECT_BLOB_SUPPORT_STORE);\n }\n } catch (ex) {\n if (ex.name === 'ConstraintError') {\n console.warn('The database \"' + dbInfo.name + '\"' + ' has been upgraded from version ' + e.oldVersion + ' to version ' + e.newVersion + ', but the storage \"' + dbInfo.storeName + '\" already exists.');\n } else {\n throw ex;\n }\n }\n };\n }\n\n openreq.onerror = function (e) {\n e.preventDefault();\n reject(openreq.error);\n };\n\n openreq.onsuccess = function () {\n resolve(openreq.result);\n _advanceReadiness(dbInfo);\n };\n });\n}\n\nfunction _getOriginalConnection(dbInfo) {\n return _getConnection(dbInfo, false);\n}\n\nfunction _getUpgradedConnection(dbInfo) {\n return _getConnection(dbInfo, true);\n}\n\nfunction _isUpgradeNeeded(dbInfo, defaultVersion) {\n if (!dbInfo.db) {\n return true;\n }\n\n var isNewStore = !dbInfo.db.objectStoreNames.contains(dbInfo.storeName);\n var isDowngrade = dbInfo.version < dbInfo.db.version;\n var isUpgrade = dbInfo.version > dbInfo.db.version;\n\n if (isDowngrade) {\n // If the version is not the default one\n // then warn for impossible downgrade.\n if (dbInfo.version !== defaultVersion) {\n console.warn('The database \"' + dbInfo.name + '\"' + \" can't be downgraded from version \" + dbInfo.db.version + ' to version ' + dbInfo.version + '.');\n }\n // Align the versions to prevent errors.\n dbInfo.version = dbInfo.db.version;\n }\n\n if (isUpgrade || isNewStore) {\n // If the store is new then increment the version (if needed).\n // This will trigger an \"upgradeneeded\" event which is required\n // for creating a store.\n if (isNewStore) {\n var incVersion = dbInfo.db.version + 1;\n if (incVersion > dbInfo.version) {\n dbInfo.version = incVersion;\n }\n }\n\n return true;\n }\n\n return false;\n}\n\n// encode a blob for indexeddb engines that don't support blobs\nfunction _encodeBlob(blob) {\n return new Promise$1(function (resolve, reject) {\n var reader = new FileReader();\n reader.onerror = reject;\n reader.onloadend = function (e) {\n var base64 = btoa(e.target.result || '');\n resolve({\n __local_forage_encoded_blob: true,\n data: base64,\n type: blob.type\n });\n };\n reader.readAsBinaryString(blob);\n });\n}\n\n// decode an encoded blob\nfunction _decodeBlob(encodedBlob) {\n var arrayBuff = _binStringToArrayBuffer(atob(encodedBlob.data));\n return createBlob([arrayBuff], { type: encodedBlob.type });\n}\n\n// is this one of our fancy encoded blobs?\nfunction _isEncodedBlob(value) {\n return value && value.__local_forage_encoded_blob;\n}\n\n// Specialize the default `ready()` function by making it dependent\n// on the current database operations. Thus, the driver will be actually\n// ready when it's been initialized (default) *and* there are no pending\n// operations on the database (initiated by some other instances).\nfunction _fullyReady(callback) {\n var self = this;\n\n var promise = self._initReady().then(function () {\n var dbContext = dbContexts[self._dbInfo.name];\n\n if (dbContext && dbContext.dbReady) {\n return dbContext.dbReady;\n }\n });\n\n executeTwoCallbacks(promise, callback, callback);\n return promise;\n}\n\n// Try to establish a new db connection to replace the\n// current one which is broken (i.e. experiencing\n// InvalidStateError while creating a transaction).\nfunction _tryReconnect(dbInfo) {\n _deferReadiness(dbInfo);\n\n var dbContext = dbContexts[dbInfo.name];\n var forages = dbContext.forages;\n\n for (var i = 0; i < forages.length; i++) {\n var forage = forages[i];\n if (forage._dbInfo.db) {\n forage._dbInfo.db.close();\n forage._dbInfo.db = null;\n }\n }\n dbInfo.db = null;\n\n return _getOriginalConnection(dbInfo).then(function (db) {\n dbInfo.db = db;\n if (_isUpgradeNeeded(dbInfo)) {\n // Reopen the database for upgrading.\n return _getUpgradedConnection(dbInfo);\n }\n return db;\n }).then(function (db) {\n // store the latest db reference\n // in case the db was upgraded\n dbInfo.db = dbContext.db = db;\n for (var i = 0; i < forages.length; i++) {\n forages[i]._dbInfo.db = db;\n }\n })[\"catch\"](function (err) {\n _rejectReadiness(dbInfo, err);\n throw err;\n });\n}\n\n// FF doesn't like Promises (micro-tasks) and IDDB store operations,\n// so we have to do it with callbacks\nfunction createTransaction(dbInfo, mode, callback, retries) {\n if (retries === undefined) {\n retries = 1;\n }\n\n try {\n var tx = dbInfo.db.transaction(dbInfo.storeName, mode);\n callback(null, tx);\n } catch (err) {\n if (retries > 0 && (!dbInfo.db || err.name === 'InvalidStateError' || err.name === 'NotFoundError')) {\n return Promise$1.resolve().then(function () {\n if (!dbInfo.db || err.name === 'NotFoundError' && !dbInfo.db.objectStoreNames.contains(dbInfo.storeName) && dbInfo.version <= dbInfo.db.version) {\n // increase the db version, to create the new ObjectStore\n if (dbInfo.db) {\n dbInfo.version = dbInfo.db.version + 1;\n }\n // Reopen the database for upgrading.\n return _getUpgradedConnection(dbInfo);\n }\n }).then(function () {\n return _tryReconnect(dbInfo).then(function () {\n createTransaction(dbInfo, mode, callback, retries - 1);\n });\n })[\"catch\"](callback);\n }\n\n callback(err);\n }\n}\n\nfunction createDbContext() {\n return {\n // Running localForages sharing a database.\n forages: [],\n // Shared database.\n db: null,\n // Database readiness (promise).\n dbReady: null,\n // Deferred operations on the database.\n deferredOperations: []\n };\n}\n\n// Open the IndexedDB database (automatically creates one if one didn't\n// previously exist), using any options set in the config.\nfunction _initStorage(options) {\n var self = this;\n var dbInfo = {\n db: null\n };\n\n if (options) {\n for (var i in options) {\n dbInfo[i] = options[i];\n }\n }\n\n // Get the current context of the database;\n var dbContext = dbContexts[dbInfo.name];\n\n // ...or create a new context.\n if (!dbContext) {\n dbContext = createDbContext();\n // Register the new context in the global container.\n dbContexts[dbInfo.name] = dbContext;\n }\n\n // Register itself as a running localForage in the current context.\n dbContext.forages.push(self);\n\n // Replace the default `ready()` function with the specialized one.\n if (!self._initReady) {\n self._initReady = self.ready;\n self.ready = _fullyReady;\n }\n\n // Create an array of initialization states of the related localForages.\n var initPromises = [];\n\n function ignoreErrors() {\n // Don't handle errors here,\n // just makes sure related localForages aren't pending.\n return Promise$1.resolve();\n }\n\n for (var j = 0; j < dbContext.forages.length; j++) {\n var forage = dbContext.forages[j];\n if (forage !== self) {\n // Don't wait for itself...\n initPromises.push(forage._initReady()[\"catch\"](ignoreErrors));\n }\n }\n\n // Take a snapshot of the related localForages.\n var forages = dbContext.forages.slice(0);\n\n // Initialize the connection process only when\n // all the related localForages aren't pending.\n return Promise$1.all(initPromises).then(function () {\n dbInfo.db = dbContext.db;\n // Get the connection or open a new one without upgrade.\n return _getOriginalConnection(dbInfo);\n }).then(function (db) {\n dbInfo.db = db;\n if (_isUpgradeNeeded(dbInfo, self._defaultConfig.version)) {\n // Reopen the database for upgrading.\n return _getUpgradedConnection(dbInfo);\n }\n return db;\n }).then(function (db) {\n dbInfo.db = dbContext.db = db;\n self._dbInfo = dbInfo;\n // Share the final connection amongst related localForages.\n for (var k = 0; k < forages.length; k++) {\n var forage = forages[k];\n if (forage !== self) {\n // Self is already up-to-date.\n forage._dbInfo.db = dbInfo.db;\n forage._dbInfo.version = dbInfo.version;\n }\n }\n });\n}\n\nfunction getItem(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.get(key);\n\n req.onsuccess = function () {\n var value = req.result;\n if (value === undefined) {\n value = null;\n }\n if (_isEncodedBlob(value)) {\n value = _decodeBlob(value);\n }\n resolve(value);\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Iterate over all items stored in database.\nfunction iterate(iterator, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.openCursor();\n var iterationNumber = 1;\n\n req.onsuccess = function () {\n var cursor = req.result;\n\n if (cursor) {\n var value = cursor.value;\n if (_isEncodedBlob(value)) {\n value = _decodeBlob(value);\n }\n var result = iterator(value, cursor.key, iterationNumber++);\n\n // when the iterator callback returns any\n // (non-`undefined`) value, then we stop\n // the iteration immediately\n if (result !== void 0) {\n resolve(result);\n } else {\n cursor[\"continue\"]();\n }\n } else {\n resolve();\n }\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n\n return promise;\n}\n\nfunction setItem(key, value, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n var dbInfo;\n self.ready().then(function () {\n dbInfo = self._dbInfo;\n if (toString.call(value) === '[object Blob]') {\n return _checkBlobSupport(dbInfo.db).then(function (blobSupport) {\n if (blobSupport) {\n return value;\n }\n return _encodeBlob(value);\n });\n }\n return value;\n }).then(function (value) {\n createTransaction(self._dbInfo, READ_WRITE, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n\n // The reason we don't _save_ null is because IE 10 does\n // not support saving the `null` type in IndexedDB. How\n // ironic, given the bug below!\n // See: https://github.com/mozilla/localForage/issues/161\n if (value === null) {\n value = undefined;\n }\n\n var req = store.put(value, key);\n\n transaction.oncomplete = function () {\n // Cast to undefined so the value passed to\n // callback/promise is the same as what one would get out\n // of `getItem()` later. This leads to some weirdness\n // (setItem('foo', undefined) will return `null`), but\n // it's not my fault localStorage is our baseline and that\n // it's weird.\n if (value === undefined) {\n value = null;\n }\n\n resolve(value);\n };\n transaction.onabort = transaction.onerror = function () {\n var err = req.error ? req.error : req.transaction.error;\n reject(err);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction removeItem(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_WRITE, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n // We use a Grunt task to make this safe for IE and some\n // versions of Android (including those used by Cordova).\n // Normally IE won't like `.delete()` and will insist on\n // using `['delete']()`, but we have a build step that\n // fixes this for us now.\n var req = store[\"delete\"](key);\n transaction.oncomplete = function () {\n resolve();\n };\n\n transaction.onerror = function () {\n reject(req.error);\n };\n\n // The request will be also be aborted if we've exceeded our storage\n // space.\n transaction.onabort = function () {\n var err = req.error ? req.error : req.transaction.error;\n reject(err);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction clear(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_WRITE, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.clear();\n\n transaction.oncomplete = function () {\n resolve();\n };\n\n transaction.onabort = transaction.onerror = function () {\n var err = req.error ? req.error : req.transaction.error;\n reject(err);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction length(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.count();\n\n req.onsuccess = function () {\n resolve(req.result);\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction key(n, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n if (n < 0) {\n resolve(null);\n\n return;\n }\n\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var advanced = false;\n var req = store.openKeyCursor();\n\n req.onsuccess = function () {\n var cursor = req.result;\n if (!cursor) {\n // this means there weren't enough keys\n resolve(null);\n\n return;\n }\n\n if (n === 0) {\n // We have the first key, return it if that's what they\n // wanted.\n resolve(cursor.key);\n } else {\n if (!advanced) {\n // Otherwise, ask the cursor to skip ahead n\n // records.\n advanced = true;\n cursor.advance(n);\n } else {\n // When we get here, we've got the nth key.\n resolve(cursor.key);\n }\n }\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction keys(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.openKeyCursor();\n var keys = [];\n\n req.onsuccess = function () {\n var cursor = req.result;\n\n if (!cursor) {\n resolve(keys);\n return;\n }\n\n keys.push(cursor.key);\n cursor[\"continue\"]();\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction dropInstance(options, callback) {\n callback = getCallback.apply(this, arguments);\n\n var currentConfig = this.config();\n options = typeof options !== 'function' && options || {};\n if (!options.name) {\n options.name = options.name || currentConfig.name;\n options.storeName = options.storeName || currentConfig.storeName;\n }\n\n var self = this;\n var promise;\n if (!options.name) {\n promise = Promise$1.reject('Invalid arguments');\n } else {\n var isCurrentDb = options.name === currentConfig.name && self._dbInfo.db;\n\n var dbPromise = isCurrentDb ? Promise$1.resolve(self._dbInfo.db) : _getOriginalConnection(options).then(function (db) {\n var dbContext = dbContexts[options.name];\n var forages = dbContext.forages;\n dbContext.db = db;\n for (var i = 0; i < forages.length; i++) {\n forages[i]._dbInfo.db = db;\n }\n return db;\n });\n\n if (!options.storeName) {\n promise = dbPromise.then(function (db) {\n _deferReadiness(options);\n\n var dbContext = dbContexts[options.name];\n var forages = dbContext.forages;\n\n db.close();\n for (var i = 0; i < forages.length; i++) {\n var forage = forages[i];\n forage._dbInfo.db = null;\n }\n\n var dropDBPromise = new Promise$1(function (resolve, reject) {\n var req = idb.deleteDatabase(options.name);\n\n req.onerror = req.onblocked = function (err) {\n var db = req.result;\n if (db) {\n db.close();\n }\n reject(err);\n };\n\n req.onsuccess = function () {\n var db = req.result;\n if (db) {\n db.close();\n }\n resolve(db);\n };\n });\n\n return dropDBPromise.then(function (db) {\n dbContext.db = db;\n for (var i = 0; i < forages.length; i++) {\n var _forage = forages[i];\n _advanceReadiness(_forage._dbInfo);\n }\n })[\"catch\"](function (err) {\n (_rejectReadiness(options, err) || Promise$1.resolve())[\"catch\"](function () {});\n throw err;\n });\n });\n } else {\n promise = dbPromise.then(function (db) {\n if (!db.objectStoreNames.contains(options.storeName)) {\n return;\n }\n\n var newVersion = db.version + 1;\n\n _deferReadiness(options);\n\n var dbContext = dbContexts[options.name];\n var forages = dbContext.forages;\n\n db.close();\n for (var i = 0; i < forages.length; i++) {\n var forage = forages[i];\n forage._dbInfo.db = null;\n forage._dbInfo.version = newVersion;\n }\n\n var dropObjectPromise = new Promise$1(function (resolve, reject) {\n var req = idb.open(options.name, newVersion);\n\n req.onerror = function (err) {\n var db = req.result;\n db.close();\n reject(err);\n };\n\n req.onupgradeneeded = function () {\n var db = req.result;\n db.deleteObjectStore(options.storeName);\n };\n\n req.onsuccess = function () {\n var db = req.result;\n db.close();\n resolve(db);\n };\n });\n\n return dropObjectPromise.then(function (db) {\n dbContext.db = db;\n for (var j = 0; j < forages.length; j++) {\n var _forage2 = forages[j];\n _forage2._dbInfo.db = db;\n _advanceReadiness(_forage2._dbInfo);\n }\n })[\"catch\"](function (err) {\n (_rejectReadiness(options, err) || Promise$1.resolve())[\"catch\"](function () {});\n throw err;\n });\n });\n }\n }\n\n executeCallback(promise, callback);\n return promise;\n}\n\nvar asyncStorage = {\n _driver: 'asyncStorage',\n _initStorage: _initStorage,\n _support: isIndexedDBValid(),\n iterate: iterate,\n getItem: getItem,\n setItem: setItem,\n removeItem: removeItem,\n clear: clear,\n length: length,\n key: key,\n keys: keys,\n dropInstance: dropInstance\n};\n\nfunction isWebSQLValid() {\n return typeof openDatabase === 'function';\n}\n\n// Sadly, the best way to save binary data in WebSQL/localStorage is serializing\n// it to Base64, so this is how we store it to prevent very strange errors with less\n// verbose ways of binary <-> string data storage.\nvar BASE_CHARS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n\nvar BLOB_TYPE_PREFIX = '~~local_forage_type~';\nvar BLOB_TYPE_PREFIX_REGEX = /^~~local_forage_type~([^~]+)~/;\n\nvar SERIALIZED_MARKER = '__lfsc__:';\nvar SERIALIZED_MARKER_LENGTH = SERIALIZED_MARKER.length;\n\n// OMG the serializations!\nvar TYPE_ARRAYBUFFER = 'arbf';\nvar TYPE_BLOB = 'blob';\nvar TYPE_INT8ARRAY = 'si08';\nvar TYPE_UINT8ARRAY = 'ui08';\nvar TYPE_UINT8CLAMPEDARRAY = 'uic8';\nvar TYPE_INT16ARRAY = 'si16';\nvar TYPE_INT32ARRAY = 'si32';\nvar TYPE_UINT16ARRAY = 'ur16';\nvar TYPE_UINT32ARRAY = 'ui32';\nvar TYPE_FLOAT32ARRAY = 'fl32';\nvar TYPE_FLOAT64ARRAY = 'fl64';\nvar TYPE_SERIALIZED_MARKER_LENGTH = SERIALIZED_MARKER_LENGTH + TYPE_ARRAYBUFFER.length;\n\nvar toString$1 = Object.prototype.toString;\n\nfunction stringToBuffer(serializedString) {\n // Fill the string into a ArrayBuffer.\n var bufferLength = serializedString.length * 0.75;\n var len = serializedString.length;\n var i;\n var p = 0;\n var encoded1, encoded2, encoded3, encoded4;\n\n if (serializedString[serializedString.length - 1] === '=') {\n bufferLength--;\n if (serializedString[serializedString.length - 2] === '=') {\n bufferLength--;\n }\n }\n\n var buffer = new ArrayBuffer(bufferLength);\n var bytes = new Uint8Array(buffer);\n\n for (i = 0; i < len; i += 4) {\n encoded1 = BASE_CHARS.indexOf(serializedString[i]);\n encoded2 = BASE_CHARS.indexOf(serializedString[i + 1]);\n encoded3 = BASE_CHARS.indexOf(serializedString[i + 2]);\n encoded4 = BASE_CHARS.indexOf(serializedString[i + 3]);\n\n /*jslint bitwise: true */\n bytes[p++] = encoded1 << 2 | encoded2 >> 4;\n bytes[p++] = (encoded2 & 15) << 4 | encoded3 >> 2;\n bytes[p++] = (encoded3 & 3) << 6 | encoded4 & 63;\n }\n return buffer;\n}\n\n// Converts a buffer to a string to store, serialized, in the backend\n// storage library.\nfunction bufferToString(buffer) {\n // base64-arraybuffer\n var bytes = new Uint8Array(buffer);\n var base64String = '';\n var i;\n\n for (i = 0; i < bytes.length; i += 3) {\n /*jslint bitwise: true */\n base64String += BASE_CHARS[bytes[i] >> 2];\n base64String += BASE_CHARS[(bytes[i] & 3) << 4 | bytes[i + 1] >> 4];\n base64String += BASE_CHARS[(bytes[i + 1] & 15) << 2 | bytes[i + 2] >> 6];\n base64String += BASE_CHARS[bytes[i + 2] & 63];\n }\n\n if (bytes.length % 3 === 2) {\n base64String = base64String.substring(0, base64String.length - 1) + '=';\n } else if (bytes.length % 3 === 1) {\n base64String = base64String.substring(0, base64String.length - 2) + '==';\n }\n\n return base64String;\n}\n\n// Serialize a value, afterwards executing a callback (which usually\n// instructs the `setItem()` callback/promise to be executed). This is how\n// we store binary data with localStorage.\nfunction serialize(value, callback) {\n var valueType = '';\n if (value) {\n valueType = toString$1.call(value);\n }\n\n // Cannot use `value instanceof ArrayBuffer` or such here, as these\n // checks fail when running the tests using casper.js...\n //\n // TODO: See why those tests fail and use a better solution.\n if (value && (valueType === '[object ArrayBuffer]' || value.buffer && toString$1.call(value.buffer) === '[object ArrayBuffer]')) {\n // Convert binary arrays to a string and prefix the string with\n // a special marker.\n var buffer;\n var marker = SERIALIZED_MARKER;\n\n if (value instanceof ArrayBuffer) {\n buffer = value;\n marker += TYPE_ARRAYBUFFER;\n } else {\n buffer = value.buffer;\n\n if (valueType === '[object Int8Array]') {\n marker += TYPE_INT8ARRAY;\n } else if (valueType === '[object Uint8Array]') {\n marker += TYPE_UINT8ARRAY;\n } else if (valueType === '[object Uint8ClampedArray]') {\n marker += TYPE_UINT8CLAMPEDARRAY;\n } else if (valueType === '[object Int16Array]') {\n marker += TYPE_INT16ARRAY;\n } else if (valueType === '[object Uint16Array]') {\n marker += TYPE_UINT16ARRAY;\n } else if (valueType === '[object Int32Array]') {\n marker += TYPE_INT32ARRAY;\n } else if (valueType === '[object Uint32Array]') {\n marker += TYPE_UINT32ARRAY;\n } else if (valueType === '[object Float32Array]') {\n marker += TYPE_FLOAT32ARRAY;\n } else if (valueType === '[object Float64Array]') {\n marker += TYPE_FLOAT64ARRAY;\n } else {\n callback(new Error('Failed to get type for BinaryArray'));\n }\n }\n\n callback(marker + bufferToString(buffer));\n } else if (valueType === '[object Blob]') {\n // Conver the blob to a binaryArray and then to a string.\n var fileReader = new FileReader();\n\n fileReader.onload = function () {\n // Backwards-compatible prefix for the blob type.\n var str = BLOB_TYPE_PREFIX + value.type + '~' + bufferToString(this.result);\n\n callback(SERIALIZED_MARKER + TYPE_BLOB + str);\n };\n\n fileReader.readAsArrayBuffer(value);\n } else {\n try {\n callback(JSON.stringify(value));\n } catch (e) {\n console.error(\"Couldn't convert value into a JSON string: \", value);\n\n callback(null, e);\n }\n }\n}\n\n// Deserialize data we've inserted into a value column/field. We place\n// special markers into our strings to mark them as encoded; this isn't\n// as nice as a meta field, but it's the only sane thing we can do whilst\n// keeping localStorage support intact.\n//\n// Oftentimes this will just deserialize JSON content, but if we have a\n// special marker (SERIALIZED_MARKER, defined above), we will extract\n// some kind of arraybuffer/binary data/typed array out of the string.\nfunction deserialize(value) {\n // If we haven't marked this string as being specially serialized (i.e.\n // something other than serialized JSON), we can just return it and be\n // done with it.\n if (value.substring(0, SERIALIZED_MARKER_LENGTH) !== SERIALIZED_MARKER) {\n return JSON.parse(value);\n }\n\n // The following code deals with deserializing some kind of Blob or\n // TypedArray. First we separate out the type of data we're dealing\n // with from the data itself.\n var serializedString = value.substring(TYPE_SERIALIZED_MARKER_LENGTH);\n var type = value.substring(SERIALIZED_MARKER_LENGTH, TYPE_SERIALIZED_MARKER_LENGTH);\n\n var blobType;\n // Backwards-compatible blob type serialization strategy.\n // DBs created with older versions of localForage will simply not have the blob type.\n if (type === TYPE_BLOB && BLOB_TYPE_PREFIX_REGEX.test(serializedString)) {\n var matcher = serializedString.match(BLOB_TYPE_PREFIX_REGEX);\n blobType = matcher[1];\n serializedString = serializedString.substring(matcher[0].length);\n }\n var buffer = stringToBuffer(serializedString);\n\n // Return the right type based on the code/type set during\n // serialization.\n switch (type) {\n case TYPE_ARRAYBUFFER:\n return buffer;\n case TYPE_BLOB:\n return createBlob([buffer], { type: blobType });\n case TYPE_INT8ARRAY:\n return new Int8Array(buffer);\n case TYPE_UINT8ARRAY:\n return new Uint8Array(buffer);\n case TYPE_UINT8CLAMPEDARRAY:\n return new Uint8ClampedArray(buffer);\n case TYPE_INT16ARRAY:\n return new Int16Array(buffer);\n case TYPE_UINT16ARRAY:\n return new Uint16Array(buffer);\n case TYPE_INT32ARRAY:\n return new Int32Array(buffer);\n case TYPE_UINT32ARRAY:\n return new Uint32Array(buffer);\n case TYPE_FLOAT32ARRAY:\n return new Float32Array(buffer);\n case TYPE_FLOAT64ARRAY:\n return new Float64Array(buffer);\n default:\n throw new Error('Unkown type: ' + type);\n }\n}\n\nvar localforageSerializer = {\n serialize: serialize,\n deserialize: deserialize,\n stringToBuffer: stringToBuffer,\n bufferToString: bufferToString\n};\n\n/*\n * Includes code from:\n *\n * base64-arraybuffer\n * https://github.com/niklasvh/base64-arraybuffer\n *\n * Copyright (c) 2012 Niklas von Hertzen\n * Licensed under the MIT license.\n */\n\nfunction createDbTable(t, dbInfo, callback, errorCallback) {\n t.executeSql('CREATE TABLE IF NOT EXISTS ' + dbInfo.storeName + ' ' + '(id INTEGER PRIMARY KEY, key unique, value)', [], callback, errorCallback);\n}\n\n// Open the WebSQL database (automatically creates one if one didn't\n// previously exist), using any options set in the config.\nfunction _initStorage$1(options) {\n var self = this;\n var dbInfo = {\n db: null\n };\n\n if (options) {\n for (var i in options) {\n dbInfo[i] = typeof options[i] !== 'string' ? options[i].toString() : options[i];\n }\n }\n\n var dbInfoPromise = new Promise$1(function (resolve, reject) {\n // Open the database; the openDatabase API will automatically\n // create it for us if it doesn't exist.\n try {\n dbInfo.db = openDatabase(dbInfo.name, String(dbInfo.version), dbInfo.description, dbInfo.size);\n } catch (e) {\n return reject(e);\n }\n\n // Create our key/value table if it doesn't exist.\n dbInfo.db.transaction(function (t) {\n createDbTable(t, dbInfo, function () {\n self._dbInfo = dbInfo;\n resolve();\n }, function (t, error) {\n reject(error);\n });\n }, reject);\n });\n\n dbInfo.serializer = localforageSerializer;\n return dbInfoPromise;\n}\n\nfunction tryExecuteSql(t, dbInfo, sqlStatement, args, callback, errorCallback) {\n t.executeSql(sqlStatement, args, callback, function (t, error) {\n if (error.code === error.SYNTAX_ERR) {\n t.executeSql('SELECT name FROM sqlite_master ' + \"WHERE type='table' AND name = ?\", [dbInfo.storeName], function (t, results) {\n if (!results.rows.length) {\n // if the table is missing (was deleted)\n // re-create it table and retry\n createDbTable(t, dbInfo, function () {\n t.executeSql(sqlStatement, args, callback, errorCallback);\n }, errorCallback);\n } else {\n errorCallback(t, error);\n }\n }, errorCallback);\n } else {\n errorCallback(t, error);\n }\n }, errorCallback);\n}\n\nfunction getItem$1(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT * FROM ' + dbInfo.storeName + ' WHERE key = ? LIMIT 1', [key], function (t, results) {\n var result = results.rows.length ? results.rows.item(0).value : null;\n\n // Check to see if this is serialized content we need to\n // unpack.\n if (result) {\n result = dbInfo.serializer.deserialize(result);\n }\n\n resolve(result);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction iterate$1(iterator, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT * FROM ' + dbInfo.storeName, [], function (t, results) {\n var rows = results.rows;\n var length = rows.length;\n\n for (var i = 0; i < length; i++) {\n var item = rows.item(i);\n var result = item.value;\n\n // Check to see if this is serialized content\n // we need to unpack.\n if (result) {\n result = dbInfo.serializer.deserialize(result);\n }\n\n result = iterator(result, item.key, i + 1);\n\n // void(0) prevents problems with redefinition\n // of `undefined`.\n if (result !== void 0) {\n resolve(result);\n return;\n }\n }\n\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction _setItem(key, value, callback, retriesLeft) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n // The localStorage API doesn't return undefined values in an\n // \"expected\" way, so undefined is always cast to null in all\n // drivers. See: https://github.com/mozilla/localForage/pull/42\n if (value === undefined) {\n value = null;\n }\n\n // Save the original value to pass to the callback.\n var originalValue = value;\n\n var dbInfo = self._dbInfo;\n dbInfo.serializer.serialize(value, function (value, error) {\n if (error) {\n reject(error);\n } else {\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'INSERT OR REPLACE INTO ' + dbInfo.storeName + ' ' + '(key, value) VALUES (?, ?)', [key, value], function () {\n resolve(originalValue);\n }, function (t, error) {\n reject(error);\n });\n }, function (sqlError) {\n // The transaction failed; check\n // to see if it's a quota error.\n if (sqlError.code === sqlError.QUOTA_ERR) {\n // We reject the callback outright for now, but\n // it's worth trying to re-run the transaction.\n // Even if the user accepts the prompt to use\n // more storage on Safari, this error will\n // be called.\n //\n // Try to re-run the transaction.\n if (retriesLeft > 0) {\n resolve(_setItem.apply(self, [key, originalValue, callback, retriesLeft - 1]));\n return;\n }\n reject(sqlError);\n }\n });\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction setItem$1(key, value, callback) {\n return _setItem.apply(this, [key, value, callback, 1]);\n}\n\nfunction removeItem$1(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'DELETE FROM ' + dbInfo.storeName + ' WHERE key = ?', [key], function () {\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Deletes every item in the table.\n// TODO: Find out if this resets the AUTO_INCREMENT number.\nfunction clear$1(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'DELETE FROM ' + dbInfo.storeName, [], function () {\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Does a simple `COUNT(key)` to get the number of items stored in\n// localForage.\nfunction length$1(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n // Ahhh, SQL makes this one soooooo easy.\n tryExecuteSql(t, dbInfo, 'SELECT COUNT(key) as c FROM ' + dbInfo.storeName, [], function (t, results) {\n var result = results.rows.item(0).c;\n resolve(result);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Return the key located at key index X; essentially gets the key from a\n// `WHERE id = ?`. This is the most efficient way I can think to implement\n// this rarely-used (in my experience) part of the API, but it can seem\n// inconsistent, because we do `INSERT OR REPLACE INTO` on `setItem()`, so\n// the ID of each key will change every time it's updated. Perhaps a stored\n// procedure for the `setItem()` SQL would solve this problem?\n// TODO: Don't change ID on `setItem()`.\nfunction key$1(n, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT key FROM ' + dbInfo.storeName + ' WHERE id = ? LIMIT 1', [n + 1], function (t, results) {\n var result = results.rows.length ? results.rows.item(0).key : null;\n resolve(result);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction keys$1(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT key FROM ' + dbInfo.storeName, [], function (t, results) {\n var keys = [];\n\n for (var i = 0; i < results.rows.length; i++) {\n keys.push(results.rows.item(i).key);\n }\n\n resolve(keys);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// https://www.w3.org/TR/webdatabase/#databases\n// > There is no way to enumerate or delete the databases available for an origin from this API.\nfunction getAllStoreNames(db) {\n return new Promise$1(function (resolve, reject) {\n db.transaction(function (t) {\n t.executeSql('SELECT name FROM sqlite_master ' + \"WHERE type='table' AND name <> '__WebKitDatabaseInfoTable__'\", [], function (t, results) {\n var storeNames = [];\n\n for (var i = 0; i < results.rows.length; i++) {\n storeNames.push(results.rows.item(i).name);\n }\n\n resolve({\n db: db,\n storeNames: storeNames\n });\n }, function (t, error) {\n reject(error);\n });\n }, function (sqlError) {\n reject(sqlError);\n });\n });\n}\n\nfunction dropInstance$1(options, callback) {\n callback = getCallback.apply(this, arguments);\n\n var currentConfig = this.config();\n options = typeof options !== 'function' && options || {};\n if (!options.name) {\n options.name = options.name || currentConfig.name;\n options.storeName = options.storeName || currentConfig.storeName;\n }\n\n var self = this;\n var promise;\n if (!options.name) {\n promise = Promise$1.reject('Invalid arguments');\n } else {\n promise = new Promise$1(function (resolve) {\n var db;\n if (options.name === currentConfig.name) {\n // use the db reference of the current instance\n db = self._dbInfo.db;\n } else {\n db = openDatabase(options.name, '', '', 0);\n }\n\n if (!options.storeName) {\n // drop all database tables\n resolve(getAllStoreNames(db));\n } else {\n resolve({\n db: db,\n storeNames: [options.storeName]\n });\n }\n }).then(function (operationInfo) {\n return new Promise$1(function (resolve, reject) {\n operationInfo.db.transaction(function (t) {\n function dropTable(storeName) {\n return new Promise$1(function (resolve, reject) {\n t.executeSql('DROP TABLE IF EXISTS ' + storeName, [], function () {\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n }\n\n var operations = [];\n for (var i = 0, len = operationInfo.storeNames.length; i < len; i++) {\n operations.push(dropTable(operationInfo.storeNames[i]));\n }\n\n Promise$1.all(operations).then(function () {\n resolve();\n })[\"catch\"](function (e) {\n reject(e);\n });\n }, function (sqlError) {\n reject(sqlError);\n });\n });\n });\n }\n\n executeCallback(promise, callback);\n return promise;\n}\n\nvar webSQLStorage = {\n _driver: 'webSQLStorage',\n _initStorage: _initStorage$1,\n _support: isWebSQLValid(),\n iterate: iterate$1,\n getItem: getItem$1,\n setItem: setItem$1,\n removeItem: removeItem$1,\n clear: clear$1,\n length: length$1,\n key: key$1,\n keys: keys$1,\n dropInstance: dropInstance$1\n};\n\nfunction isLocalStorageValid() {\n try {\n return typeof localStorage !== 'undefined' && 'setItem' in localStorage &&\n // in IE8 typeof localStorage.setItem === 'object'\n !!localStorage.setItem;\n } catch (e) {\n return false;\n }\n}\n\nfunction _getKeyPrefix(options, defaultConfig) {\n var keyPrefix = options.name + '/';\n\n if (options.storeName !== defaultConfig.storeName) {\n keyPrefix += options.storeName + '/';\n }\n return keyPrefix;\n}\n\n// Check if localStorage throws when saving an item\nfunction checkIfLocalStorageThrows() {\n var localStorageTestKey = '_localforage_support_test';\n\n try {\n localStorage.setItem(localStorageTestKey, true);\n localStorage.removeItem(localStorageTestKey);\n\n return false;\n } catch (e) {\n return true;\n }\n}\n\n// Check if localStorage is usable and allows to save an item\n// This method checks if localStorage is usable in Safari Private Browsing\n// mode, or in any other case where the available quota for localStorage\n// is 0 and there wasn't any saved items yet.\nfunction _isLocalStorageUsable() {\n return !checkIfLocalStorageThrows() || localStorage.length > 0;\n}\n\n// Config the localStorage backend, using options set in the config.\nfunction _initStorage$2(options) {\n var self = this;\n var dbInfo = {};\n if (options) {\n for (var i in options) {\n dbInfo[i] = options[i];\n }\n }\n\n dbInfo.keyPrefix = _getKeyPrefix(options, self._defaultConfig);\n\n if (!_isLocalStorageUsable()) {\n return Promise$1.reject();\n }\n\n self._dbInfo = dbInfo;\n dbInfo.serializer = localforageSerializer;\n\n return Promise$1.resolve();\n}\n\n// Remove all keys from the datastore, effectively destroying all data in\n// the app's key/value store!\nfunction clear$2(callback) {\n var self = this;\n var promise = self.ready().then(function () {\n var keyPrefix = self._dbInfo.keyPrefix;\n\n for (var i = localStorage.length - 1; i >= 0; i--) {\n var key = localStorage.key(i);\n\n if (key.indexOf(keyPrefix) === 0) {\n localStorage.removeItem(key);\n }\n }\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Retrieve an item from the store. Unlike the original async_storage\n// library in Gaia, we don't modify return values at all. If a key's value\n// is `undefined`, we pass that value to the callback function.\nfunction getItem$2(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var result = localStorage.getItem(dbInfo.keyPrefix + key);\n\n // If a result was found, parse it from the serialized\n // string into a JS object. If result isn't truthy, the key\n // is likely undefined and we'll pass it straight to the\n // callback.\n if (result) {\n result = dbInfo.serializer.deserialize(result);\n }\n\n return result;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Iterate over all items in the store.\nfunction iterate$2(iterator, callback) {\n var self = this;\n\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var keyPrefix = dbInfo.keyPrefix;\n var keyPrefixLength = keyPrefix.length;\n var length = localStorage.length;\n\n // We use a dedicated iterator instead of the `i` variable below\n // so other keys we fetch in localStorage aren't counted in\n // the `iterationNumber` argument passed to the `iterate()`\n // callback.\n //\n // See: github.com/mozilla/localForage/pull/435#discussion_r38061530\n var iterationNumber = 1;\n\n for (var i = 0; i < length; i++) {\n var key = localStorage.key(i);\n if (key.indexOf(keyPrefix) !== 0) {\n continue;\n }\n var value = localStorage.getItem(key);\n\n // If a result was found, parse it from the serialized\n // string into a JS object. If result isn't truthy, the\n // key is likely undefined and we'll pass it straight\n // to the iterator.\n if (value) {\n value = dbInfo.serializer.deserialize(value);\n }\n\n value = iterator(value, key.substring(keyPrefixLength), iterationNumber++);\n\n if (value !== void 0) {\n return value;\n }\n }\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Same as localStorage's key() method, except takes a callback.\nfunction key$2(n, callback) {\n var self = this;\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var result;\n try {\n result = localStorage.key(n);\n } catch (error) {\n result = null;\n }\n\n // Remove the prefix from the key, if a key is found.\n if (result) {\n result = result.substring(dbInfo.keyPrefix.length);\n }\n\n return result;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction keys$2(callback) {\n var self = this;\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var length = localStorage.length;\n var keys = [];\n\n for (var i = 0; i < length; i++) {\n var itemKey = localStorage.key(i);\n if (itemKey.indexOf(dbInfo.keyPrefix) === 0) {\n keys.push(itemKey.substring(dbInfo.keyPrefix.length));\n }\n }\n\n return keys;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Supply the number of keys in the datastore to the callback function.\nfunction length$2(callback) {\n var self = this;\n var promise = self.keys().then(function (keys) {\n return keys.length;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Remove an item from the store, nice and simple.\nfunction removeItem$2(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n localStorage.removeItem(dbInfo.keyPrefix + key);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Set a key's value and run an optional callback once the value is set.\n// Unlike Gaia's implementation, the callback function is passed the value,\n// in case you want to operate on that value only after you're sure it\n// saved, or something like that.\nfunction setItem$2(key, value, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = self.ready().then(function () {\n // Convert undefined values to null.\n // https://github.com/mozilla/localForage/pull/42\n if (value === undefined) {\n value = null;\n }\n\n // Save the original value to pass to the callback.\n var originalValue = value;\n\n return new Promise$1(function (resolve, reject) {\n var dbInfo = self._dbInfo;\n dbInfo.serializer.serialize(value, function (value, error) {\n if (error) {\n reject(error);\n } else {\n try {\n localStorage.setItem(dbInfo.keyPrefix + key, value);\n resolve(originalValue);\n } catch (e) {\n // localStorage capacity exceeded.\n // TODO: Make this a specific error/event.\n if (e.name === 'QuotaExceededError' || e.name === 'NS_ERROR_DOM_QUOTA_REACHED') {\n reject(e);\n }\n reject(e);\n }\n }\n });\n });\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction dropInstance$2(options, callback) {\n callback = getCallback.apply(this, arguments);\n\n options = typeof options !== 'function' && options || {};\n if (!options.name) {\n var currentConfig = this.config();\n options.name = options.name || currentConfig.name;\n options.storeName = options.storeName || currentConfig.storeName;\n }\n\n var self = this;\n var promise;\n if (!options.name) {\n promise = Promise$1.reject('Invalid arguments');\n } else {\n promise = new Promise$1(function (resolve) {\n if (!options.storeName) {\n resolve(options.name + '/');\n } else {\n resolve(_getKeyPrefix(options, self._defaultConfig));\n }\n }).then(function (keyPrefix) {\n for (var i = localStorage.length - 1; i >= 0; i--) {\n var key = localStorage.key(i);\n\n if (key.indexOf(keyPrefix) === 0) {\n localStorage.removeItem(key);\n }\n }\n });\n }\n\n executeCallback(promise, callback);\n return promise;\n}\n\nvar localStorageWrapper = {\n _driver: 'localStorageWrapper',\n _initStorage: _initStorage$2,\n _support: isLocalStorageValid(),\n iterate: iterate$2,\n getItem: getItem$2,\n setItem: setItem$2,\n removeItem: removeItem$2,\n clear: clear$2,\n length: length$2,\n key: key$2,\n keys: keys$2,\n dropInstance: dropInstance$2\n};\n\nvar sameValue = function sameValue(x, y) {\n return x === y || typeof x === 'number' && typeof y === 'number' && isNaN(x) && isNaN(y);\n};\n\nvar includes = function includes(array, searchElement) {\n var len = array.length;\n var i = 0;\n while (i < len) {\n if (sameValue(array[i], searchElement)) {\n return true;\n }\n i++;\n }\n\n return false;\n};\n\nvar isArray = Array.isArray || function (arg) {\n return Object.prototype.toString.call(arg) === '[object Array]';\n};\n\n// Drivers are stored here when `defineDriver()` is called.\n// They are shared across all instances of localForage.\nvar DefinedDrivers = {};\n\nvar DriverSupport = {};\n\nvar DefaultDrivers = {\n INDEXEDDB: asyncStorage,\n WEBSQL: webSQLStorage,\n LOCALSTORAGE: localStorageWrapper\n};\n\nvar DefaultDriverOrder = [DefaultDrivers.INDEXEDDB._driver, DefaultDrivers.WEBSQL._driver, DefaultDrivers.LOCALSTORAGE._driver];\n\nvar OptionalDriverMethods = ['dropInstance'];\n\nvar LibraryMethods = ['clear', 'getItem', 'iterate', 'key', 'keys', 'length', 'removeItem', 'setItem'].concat(OptionalDriverMethods);\n\nvar DefaultConfig = {\n description: '',\n driver: DefaultDriverOrder.slice(),\n name: 'localforage',\n // Default DB size is _JUST UNDER_ 5MB, as it's the highest size\n // we can use without a prompt.\n size: 4980736,\n storeName: 'keyvaluepairs',\n version: 1.0\n};\n\nfunction callWhenReady(localForageInstance, libraryMethod) {\n localForageInstance[libraryMethod] = function () {\n var _args = arguments;\n return localForageInstance.ready().then(function () {\n return localForageInstance[libraryMethod].apply(localForageInstance, _args);\n });\n };\n}\n\nfunction extend() {\n for (var i = 1; i < arguments.length; i++) {\n var arg = arguments[i];\n\n if (arg) {\n for (var _key in arg) {\n if (arg.hasOwnProperty(_key)) {\n if (isArray(arg[_key])) {\n arguments[0][_key] = arg[_key].slice();\n } else {\n arguments[0][_key] = arg[_key];\n }\n }\n }\n }\n }\n\n return arguments[0];\n}\n\nvar LocalForage = function () {\n function LocalForage(options) {\n _classCallCheck(this, LocalForage);\n\n for (var driverTypeKey in DefaultDrivers) {\n if (DefaultDrivers.hasOwnProperty(driverTypeKey)) {\n var driver = DefaultDrivers[driverTypeKey];\n var driverName = driver._driver;\n this[driverTypeKey] = driverName;\n\n if (!DefinedDrivers[driverName]) {\n // we don't need to wait for the promise,\n // since the default drivers can be defined\n // in a blocking manner\n this.defineDriver(driver);\n }\n }\n }\n\n this._defaultConfig = extend({}, DefaultConfig);\n this._config = extend({}, this._defaultConfig, options);\n this._driverSet = null;\n this._initDriver = null;\n this._ready = false;\n this._dbInfo = null;\n\n this._wrapLibraryMethodsWithReady();\n this.setDriver(this._config.driver)[\"catch\"](function () {});\n }\n\n // Set any config values for localForage; can be called anytime before\n // the first API call (e.g. `getItem`, `setItem`).\n // We loop through options so we don't overwrite existing config\n // values.\n\n\n LocalForage.prototype.config = function config(options) {\n // If the options argument is an object, we use it to set values.\n // Otherwise, we return either a specified config value or all\n // config values.\n if ((typeof options === 'undefined' ? 'undefined' : _typeof(options)) === 'object') {\n // If localforage is ready and fully initialized, we can't set\n // any new configuration values. Instead, we return an error.\n if (this._ready) {\n return new Error(\"Can't call config() after localforage \" + 'has been used.');\n }\n\n for (var i in options) {\n if (i === 'storeName') {\n options[i] = options[i].replace(/\\W/g, '_');\n }\n\n if (i === 'version' && typeof options[i] !== 'number') {\n return new Error('Database version must be a number.');\n }\n\n this._config[i] = options[i];\n }\n\n // after all config options are set and\n // the driver option is used, try setting it\n if ('driver' in options && options.driver) {\n return this.setDriver(this._config.driver);\n }\n\n return true;\n } else if (typeof options === 'string') {\n return this._config[options];\n } else {\n return this._config;\n }\n };\n\n // Used to define a custom driver, shared across all instances of\n // localForage.\n\n\n LocalForage.prototype.defineDriver = function defineDriver(driverObject, callback, errorCallback) {\n var promise = new Promise$1(function (resolve, reject) {\n try {\n var driverName = driverObject._driver;\n var complianceError = new Error('Custom driver not compliant; see ' + 'https://mozilla.github.io/localForage/#definedriver');\n\n // A driver name should be defined and not overlap with the\n // library-defined, default drivers.\n if (!driverObject._driver) {\n reject(complianceError);\n return;\n }\n\n var driverMethods = LibraryMethods.concat('_initStorage');\n for (var i = 0, len = driverMethods.length; i < len; i++) {\n var driverMethodName = driverMethods[i];\n\n // when the property is there,\n // it should be a method even when optional\n var isRequired = !includes(OptionalDriverMethods, driverMethodName);\n if ((isRequired || driverObject[driverMethodName]) && typeof driverObject[driverMethodName] !== 'function') {\n reject(complianceError);\n return;\n }\n }\n\n var configureMissingMethods = function configureMissingMethods() {\n var methodNotImplementedFactory = function methodNotImplementedFactory(methodName) {\n return function () {\n var error = new Error('Method ' + methodName + ' is not implemented by the current driver');\n var promise = Promise$1.reject(error);\n executeCallback(promise, arguments[arguments.length - 1]);\n return promise;\n };\n };\n\n for (var _i = 0, _len = OptionalDriverMethods.length; _i < _len; _i++) {\n var optionalDriverMethod = OptionalDriverMethods[_i];\n if (!driverObject[optionalDriverMethod]) {\n driverObject[optionalDriverMethod] = methodNotImplementedFactory(optionalDriverMethod);\n }\n }\n };\n\n configureMissingMethods();\n\n var setDriverSupport = function setDriverSupport(support) {\n if (DefinedDrivers[driverName]) {\n console.info('Redefining LocalForage driver: ' + driverName);\n }\n DefinedDrivers[driverName] = driverObject;\n DriverSupport[driverName] = support;\n // don't use a then, so that we can define\n // drivers that have simple _support methods\n // in a blocking manner\n resolve();\n };\n\n if ('_support' in driverObject) {\n if (driverObject._support && typeof driverObject._support === 'function') {\n driverObject._support().then(setDriverSupport, reject);\n } else {\n setDriverSupport(!!driverObject._support);\n }\n } else {\n setDriverSupport(true);\n }\n } catch (e) {\n reject(e);\n }\n });\n\n executeTwoCallbacks(promise, callback, errorCallback);\n return promise;\n };\n\n LocalForage.prototype.driver = function driver() {\n return this._driver || null;\n };\n\n LocalForage.prototype.getDriver = function getDriver(driverName, callback, errorCallback) {\n var getDriverPromise = DefinedDrivers[driverName] ? Promise$1.resolve(DefinedDrivers[driverName]) : Promise$1.reject(new Error('Driver not found.'));\n\n executeTwoCallbacks(getDriverPromise, callback, errorCallback);\n return getDriverPromise;\n };\n\n LocalForage.prototype.getSerializer = function getSerializer(callback) {\n var serializerPromise = Promise$1.resolve(localforageSerializer);\n executeTwoCallbacks(serializerPromise, callback);\n return serializerPromise;\n };\n\n LocalForage.prototype.ready = function ready(callback) {\n var self = this;\n\n var promise = self._driverSet.then(function () {\n if (self._ready === null) {\n self._ready = self._initDriver();\n }\n\n return self._ready;\n });\n\n executeTwoCallbacks(promise, callback, callback);\n return promise;\n };\n\n LocalForage.prototype.setDriver = function setDriver(drivers, callback, errorCallback) {\n var self = this;\n\n if (!isArray(drivers)) {\n drivers = [drivers];\n }\n\n var supportedDrivers = this._getSupportedDrivers(drivers);\n\n function setDriverToConfig() {\n self._config.driver = self.driver();\n }\n\n function extendSelfWithDriver(driver) {\n self._extend(driver);\n setDriverToConfig();\n\n self._ready = self._initStorage(self._config);\n return self._ready;\n }\n\n function initDriver(supportedDrivers) {\n return function () {\n var currentDriverIndex = 0;\n\n function driverPromiseLoop() {\n while (currentDriverIndex < supportedDrivers.length) {\n var driverName = supportedDrivers[currentDriverIndex];\n currentDriverIndex++;\n\n self._dbInfo = null;\n self._ready = null;\n\n return self.getDriver(driverName).then(extendSelfWithDriver)[\"catch\"](driverPromiseLoop);\n }\n\n setDriverToConfig();\n var error = new Error('No available storage method found.');\n self._driverSet = Promise$1.reject(error);\n return self._driverSet;\n }\n\n return driverPromiseLoop();\n };\n }\n\n // There might be a driver initialization in progress\n // so wait for it to finish in order to avoid a possible\n // race condition to set _dbInfo\n var oldDriverSetDone = this._driverSet !== null ? this._driverSet[\"catch\"](function () {\n return Promise$1.resolve();\n }) : Promise$1.resolve();\n\n this._driverSet = oldDriverSetDone.then(function () {\n var driverName = supportedDrivers[0];\n self._dbInfo = null;\n self._ready = null;\n\n return self.getDriver(driverName).then(function (driver) {\n self._driver = driver._driver;\n setDriverToConfig();\n self._wrapLibraryMethodsWithReady();\n self._initDriver = initDriver(supportedDrivers);\n });\n })[\"catch\"](function () {\n setDriverToConfig();\n var error = new Error('No available storage method found.');\n self._driverSet = Promise$1.reject(error);\n return self._driverSet;\n });\n\n executeTwoCallbacks(this._driverSet, callback, errorCallback);\n return this._driverSet;\n };\n\n LocalForage.prototype.supports = function supports(driverName) {\n return !!DriverSupport[driverName];\n };\n\n LocalForage.prototype._extend = function _extend(libraryMethodsAndProperties) {\n extend(this, libraryMethodsAndProperties);\n };\n\n LocalForage.prototype._getSupportedDrivers = function _getSupportedDrivers(drivers) {\n var supportedDrivers = [];\n for (var i = 0, len = drivers.length; i < len; i++) {\n var driverName = drivers[i];\n if (this.supports(driverName)) {\n supportedDrivers.push(driverName);\n }\n }\n return supportedDrivers;\n };\n\n LocalForage.prototype._wrapLibraryMethodsWithReady = function _wrapLibraryMethodsWithReady() {\n // Add a stub for each driver API method that delays the call to the\n // corresponding driver method until localForage is ready. These stubs\n // will be replaced by the driver methods as soon as the driver is\n // loaded, so there is no performance impact.\n for (var i = 0, len = LibraryMethods.length; i < len; i++) {\n callWhenReady(this, LibraryMethods[i]);\n }\n };\n\n LocalForage.prototype.createInstance = function createInstance(options) {\n return new LocalForage(options);\n };\n\n return LocalForage;\n}();\n\n// The actual localForage object that we expose as a module or via a\n// global. It's extended by pulling in one of our other libraries.\n\n\nvar localforage_js = new LocalForage();\n\nmodule.exports = localforage_js;\n\n},{\"3\":3}]},{},[4])(4)\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", "/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\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", "/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://feross.org>\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 '<Buffer ' + str + '>'\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", "", "\"use strict\";\n/*! noble-ed25519 - MIT License (c) Paul Miller (paulmillr.com) */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.utils = exports.verify = exports.sign = exports.getPublicKey = exports.SignResult = exports.Signature = exports.Point = exports.ExtendedPoint = exports.CURVE = void 0;\nconst CURVE = {\n a: -1n,\n d: 37095705934669439343138083508754565189542113879843219016388785533085940283555n,\n P: 2n ** 255n - 19n,\n n: 2n ** 252n + 27742317777372353535851937790883648493n,\n h: 8n,\n Gx: 15112221349535400772501151409588531511454012693041857206046113283949847762202n,\n Gy: 46316835694926478169428394003475163141307993866256225615783033603165251855960n,\n};\nexports.CURVE = CURVE;\nconst B32 = 32;\nconst SQRT_M1 = 19681161376707505956807079304988542015446066515923890162744021073123829784752n;\nconst SQRT_AD_MINUS_ONE = 25063068953384623474111414158702152701244531502492656460079210482610430750235n;\nconst INVSQRT_A_MINUS_D = 54469307008909316920995813868745141605393597292927456921205312896311721017578n;\nconst ONE_MINUS_D_SQ = 1159843021668779879193775521855586647937357759715417654439879720876111806838n;\nconst D_MINUS_ONE_SQ = 40440834346308536858101042469323190826248399146238708352240133220865137265952n;\nclass ExtendedPoint {\n constructor(x, y, z, t) {\n this.x = x;\n this.y = y;\n this.z = z;\n this.t = t;\n }\n static fromAffine(p) {\n if (!(p instanceof Point)) {\n throw new TypeError('ExtendedPoint#fromAffine: expected Point');\n }\n if (p.equals(Point.ZERO))\n return ExtendedPoint.ZERO;\n return new ExtendedPoint(p.x, p.y, 1n, mod(p.x * p.y));\n }\n static toAffineBatch(points) {\n const toInv = invertBatch(points.map((p) => p.z));\n return points.map((p, i) => p.toAffine(toInv[i]));\n }\n static normalizeZ(points) {\n return this.toAffineBatch(points).map(this.fromAffine);\n }\n static fromRistrettoHash(hash) {\n const r1 = bytes255ToNumberLE(hash.slice(0, B32));\n const R1 = this.calcElligatorRistrettoMap(r1);\n const r2 = bytes255ToNumberLE(hash.slice(B32, B32 * 2));\n const R2 = this.calcElligatorRistrettoMap(r2);\n return R1.add(R2);\n }\n static calcElligatorRistrettoMap(r0) {\n const { d } = CURVE;\n const r = mod(SQRT_M1 * r0 * r0);\n const Ns = mod((r + 1n) * ONE_MINUS_D_SQ);\n let c = -1n;\n const D = mod((c - d * r) * mod(r + d));\n let { isValid: Ns_D_is_sq, value: s } = uvRatio(Ns, D);\n let s_ = mod(s * r0);\n if (!edIsNegative(s_))\n s_ = mod(-s_);\n if (!Ns_D_is_sq)\n s = s_;\n if (!Ns_D_is_sq)\n c = r;\n const Nt = mod(c * (r - 1n) * D_MINUS_ONE_SQ - D);\n const s2 = s * s;\n const W0 = mod((s + s) * D);\n const W1 = mod(Nt * SQRT_AD_MINUS_ONE);\n const W2 = mod(1n - s2);\n const W3 = mod(1n + s2);\n return new ExtendedPoint(mod(W0 * W3), mod(W2 * W1), mod(W1 * W3), mod(W0 * W2));\n }\n static fromRistrettoBytes(bytes) {\n const { a, d } = CURVE;\n const emsg = 'ExtendedPoint.fromRistrettoBytes: Cannot convert bytes to Ristretto Point';\n const s = bytes255ToNumberLE(bytes);\n if (!equalBytes(numberToBytesPadded(s, B32), bytes) || edIsNegative(s))\n throw new Error(emsg);\n const s2 = mod(s * s);\n const u1 = mod(1n + a * s2);\n const u2 = mod(1n - a * s2);\n const u1_2 = mod(u1 * u1);\n const u2_2 = mod(u2 * u2);\n const v = mod(a * d * u1_2 - u2_2);\n const { isValid, value: I } = invertSqrt(mod(v * u2_2));\n const Dx = mod(I * u2);\n const Dy = mod(I * Dx * v);\n let x = mod((s + s) * Dx);\n if (edIsNegative(x))\n x = mod(-x);\n const y = mod(u1 * Dy);\n const t = mod(x * y);\n if (!isValid || edIsNegative(t) || y === 0n)\n throw new Error(emsg);\n return new ExtendedPoint(x, y, 1n, t);\n }\n toRistrettoBytes() {\n let { x, y, z, t } = this;\n const u1 = mod((z + y) * (z - y));\n const u2 = mod(x * y);\n const { value: invsqrt } = invertSqrt(mod(u1 * u2 ** 2n));\n const D1 = mod(invsqrt * u1);\n const D2 = mod(invsqrt * u2);\n const zInv = mod(D1 * D2 * t);\n let D;\n if (edIsNegative(t * zInv)) {\n [x, y] = [mod(y * SQRT_M1), mod(x * SQRT_M1)];\n D = mod(D1 * INVSQRT_A_MINUS_D);\n }\n else {\n D = D2;\n }\n if (edIsNegative(x * zInv))\n y = mod(-y);\n let s = mod((z - y) * D);\n if (edIsNegative(s))\n s = mod(-s);\n return numberToBytesPadded(s, B32);\n }\n equals(other) {\n const a = this;\n const b = other;\n const [T1, T2, Z1, Z2] = [a.t, b.t, a.z, b.z];\n return mod(T1 * Z2) === mod(T2 * Z1);\n }\n negate() {\n return new ExtendedPoint(mod(-this.x), this.y, this.z, mod(-this.t));\n }\n double() {\n const X1 = this.x;\n const Y1 = this.y;\n const Z1 = this.z;\n const { a } = CURVE;\n const A = mod(X1 ** 2n);\n const B = mod(Y1 ** 2n);\n const C = mod(2n * Z1 ** 2n);\n const D = mod(a * A);\n const E = mod((X1 + Y1) ** 2n - A - B);\n const G = mod(D + B);\n const F = mod(G - C);\n const H = mod(D - B);\n const X3 = mod(E * F);\n const Y3 = mod(G * H);\n const T3 = mod(E * H);\n const Z3 = mod(F * G);\n return new ExtendedPoint(X3, Y3, Z3, T3);\n }\n add(other) {\n const X1 = this.x;\n const Y1 = this.y;\n const Z1 = this.z;\n const T1 = this.t;\n const X2 = other.x;\n const Y2 = other.y;\n const Z2 = other.z;\n const T2 = other.t;\n const A = mod((Y1 - X1) * (Y2 + X2));\n const B = mod((Y1 + X1) * (Y2 - X2));\n const F = mod(B - A);\n if (F === 0n) {\n return this.double();\n }\n const C = mod(Z1 * 2n * T2);\n const D = mod(T1 * 2n * Z2);\n const E = mod(D + C);\n const G = mod(B + A);\n const H = mod(D - C);\n const X3 = mod(E * F);\n const Y3 = mod(G * H);\n const T3 = mod(E * H);\n const Z3 = mod(F * G);\n return new ExtendedPoint(X3, Y3, Z3, T3);\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiplyUnsafe(scalar) {\n if (!isValidScalar(scalar))\n throw new TypeError('Point#multiply: expected number or bigint');\n let n = mod(BigInt(scalar), CURVE.n);\n if (n === 1n)\n return this;\n let p = ExtendedPoint.ZERO;\n let d = this;\n while (n > 0n) {\n if (n & 1n)\n p = p.add(d);\n d = d.double();\n n >>= 1n;\n }\n return p;\n }\n precomputeWindow(W) {\n const windows = 256 / W + 1;\n let points = [];\n let p = this;\n let base = p;\n for (let window = 0; window < windows; window++) {\n base = p;\n points.push(base);\n for (let i = 1; i < 2 ** (W - 1); i++) {\n base = base.add(p);\n points.push(base);\n }\n p = base.double();\n }\n return points;\n }\n wNAF(n, affinePoint) {\n if (!affinePoint && this.equals(ExtendedPoint.BASE))\n affinePoint = Point.BASE;\n const W = (affinePoint && affinePoint._WINDOW_SIZE) || 1;\n if (256 % W) {\n throw new Error('Point#wNAF: Invalid precomputation window, must be power of 2');\n }\n let precomputes = affinePoint && pointPrecomputes.get(affinePoint);\n if (!precomputes) {\n precomputes = this.precomputeWindow(W);\n if (affinePoint && W !== 1) {\n precomputes = ExtendedPoint.normalizeZ(precomputes);\n pointPrecomputes.set(affinePoint, precomputes);\n }\n }\n let p = ExtendedPoint.ZERO;\n let f = ExtendedPoint.ZERO;\n const windows = 256 / W + 1;\n const windowSize = 2 ** (W - 1);\n const mask = BigInt(2 ** W - 1);\n const maxNumber = 2 ** W;\n const shiftBy = BigInt(W);\n for (let window = 0; window < windows; window++) {\n const offset = window * windowSize;\n let wbits = Number(n & mask);\n n >>= shiftBy;\n if (wbits > windowSize) {\n wbits -= maxNumber;\n n += 1n;\n }\n if (wbits === 0) {\n f = f.add(window % 2 ? precomputes[offset].negate() : precomputes[offset]);\n }\n else {\n const cached = precomputes[offset + Math.abs(wbits) - 1];\n p = p.add(wbits < 0 ? cached.negate() : cached);\n }\n }\n return [p, f];\n }\n multiply(scalar, affinePoint) {\n if (!isValidScalar(scalar))\n throw new TypeError('Point#multiply: expected number or bigint');\n const n = mod(BigInt(scalar), CURVE.n);\n return ExtendedPoint.normalizeZ(this.wNAF(n, affinePoint))[0];\n }\n toAffine(invZ = invert(this.z)) {\n const x = mod(this.x * invZ);\n const y = mod(this.y * invZ);\n return new Point(x, y);\n }\n}\nexports.ExtendedPoint = ExtendedPoint;\nExtendedPoint.BASE = new ExtendedPoint(CURVE.Gx, CURVE.Gy, 1n, mod(CURVE.Gx * CURVE.Gy));\nExtendedPoint.ZERO = new ExtendedPoint(0n, 1n, 1n, 0n);\nconst pointPrecomputes = new WeakMap();\nclass Point {\n constructor(x, y) {\n this.x = x;\n this.y = y;\n }\n _setWindowSize(windowSize) {\n this._WINDOW_SIZE = windowSize;\n pointPrecomputes.delete(this);\n }\n static fromHex(hash) {\n const { d, P } = CURVE;\n const bytes = hash instanceof Uint8Array ? hash : hexToBytes(hash);\n if (bytes.length !== 32)\n throw new Error('Point.fromHex: expected 32 bytes');\n const last = bytes[31];\n const normedLast = last & ~0x80;\n const isLastByteOdd = (last & 0x80) !== 0;\n const normed = Uint8Array.from(Array.from(bytes.slice(0, 31)).concat(normedLast));\n const y = bytesToNumberLE(normed);\n if (y >= P)\n throw new Error('Point.fromHex expects hex <= Fp');\n const y2 = mod(y * y);\n const u = mod(y2 - 1n);\n const v = mod(d * y2 + 1n);\n let { isValid, value: x } = uvRatio(u, v);\n if (!isValid)\n throw new Error('Point.fromHex: invalid y coordinate');\n const isXOdd = (x & 1n) === 1n;\n if (isLastByteOdd !== isXOdd) {\n x = mod(-x);\n }\n return new Point(x, y);\n }\n static async fromPrivateKey(privateKey) {\n const privBytes = await exports.utils.sha512(normalizePrivateKey(privateKey));\n return Point.BASE.multiply(encodePrivate(privBytes));\n }\n toRawBytes() {\n const hex = numberToHex(this.y);\n const u8 = new Uint8Array(B32);\n for (let i = hex.length - 2, j = 0; j < B32 && i >= 0; i -= 2, j++) {\n u8[j] = Number.parseInt(hex[i] + hex[i + 1], 16);\n }\n const mask = this.x & 1n ? 0x80 : 0;\n u8[B32 - 1] |= mask;\n return u8;\n }\n toHex() {\n return bytesToHex(this.toRawBytes());\n }\n toX25519() {\n return mod((1n + this.y) * invert(1n - this.y));\n }\n equals(other) {\n return this.x === other.x && this.y === other.y;\n }\n negate() {\n return new Point(mod(-this.x), this.y);\n }\n add(other) {\n return ExtendedPoint.fromAffine(this).add(ExtendedPoint.fromAffine(other)).toAffine();\n }\n subtract(other) {\n return this.add(other.negate());\n }\n multiply(scalar) {\n return ExtendedPoint.fromAffine(this).multiply(scalar, this).toAffine();\n }\n}\nexports.Point = Point;\nPoint.BASE = new Point(CURVE.Gx, CURVE.Gy);\nPoint.ZERO = new Point(0n, 1n);\nclass Signature {\n constructor(r, s) {\n this.r = r;\n this.s = s;\n }\n static fromHex(hex) {\n hex = ensureBytes(hex);\n const r = Point.fromHex(hex.slice(0, 32));\n const s = bytesToNumberLE(hex.slice(32));\n if (!isWithinCurveOrder(s))\n throw new Error('Signature.fromHex expects s <= CURVE.n');\n return new Signature(r, s);\n }\n toRawBytes() {\n const numberBytes = hexToBytes(numberToHex(this.s)).reverse();\n const sBytes = new Uint8Array(B32);\n sBytes.set(numberBytes);\n const res = new Uint8Array(B32 * 2);\n res.set(this.r.toRawBytes());\n res.set(sBytes, 32);\n return res;\n }\n toHex() {\n return bytesToHex(this.toRawBytes());\n }\n}\nexports.Signature = Signature;\nexports.SignResult = Signature;\nfunction concatBytes(...arrays) {\n if (arrays.length === 1)\n return arrays[0];\n const length = arrays.reduce((a, arr) => a + arr.length, 0);\n const result = new Uint8Array(length);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const arr = arrays[i];\n result.set(arr, pad);\n pad += arr.length;\n }\n return result;\n}\nfunction bytesToHex(uint8a) {\n let hex = '';\n for (let i = 0; i < uint8a.length; i++) {\n hex += uint8a[i].toString(16).padStart(2, '0');\n }\n return hex;\n}\nfunction hexToBytes(hex) {\n if (typeof hex !== 'string' || hex.length % 2)\n throw new Error('Expected valid hex');\n const array = new Uint8Array(hex.length / 2);\n for (let i = 0; i < array.length; i++) {\n const j = i * 2;\n array[i] = Number.parseInt(hex.slice(j, j + 2), 16);\n }\n return array;\n}\nfunction numberToHex(num) {\n const hex = num.toString(16);\n return hex.length & 1 ? `0${hex}` : hex;\n}\nfunction numberToBytesPadded(num, length = B32) {\n const hex = numberToHex(num).padStart(length * 2, '0');\n return hexToBytes(hex).reverse();\n}\nfunction edIsNegative(num) {\n return (mod(num) & 1n) === 1n;\n}\nfunction isValidScalar(num) {\n if (typeof num === 'bigint' && num > 0n)\n return true;\n if (typeof num === 'number' && num > 0 && Number.isSafeInteger(num))\n return true;\n return false;\n}\nfunction bytesToNumberLE(uint8a) {\n let value = 0n;\n for (let i = 0; i < uint8a.length; i++) {\n value += BigInt(uint8a[i]) << (8n * BigInt(i));\n }\n return value;\n}\nfunction bytes255ToNumberLE(bytes) {\n return mod(bytesToNumberLE(bytes) & (2n ** 255n - 1n));\n}\nfunction mod(a, b = CURVE.P) {\n const res = a % b;\n return res >= 0n ? res : b + res;\n}\nfunction invert(number, modulo = CURVE.P) {\n if (number === 0n || modulo <= 0n) {\n throw new Error(`invert: expected positive integers, got n=${number} mod=${modulo}`);\n }\n let a = mod(number, modulo);\n let b = modulo;\n let [x, y, u, v] = [0n, 1n, 1n, 0n];\n while (a !== 0n) {\n const q = b / a;\n const r = b % a;\n const m = x - u * q;\n const n = y - v * q;\n [b, a] = [a, r];\n [x, y] = [u, v];\n [u, v] = [m, n];\n }\n const gcd = b;\n if (gcd !== 1n)\n throw new Error('invert: does not exist');\n return mod(x, modulo);\n}\nfunction invertBatch(nums, n = CURVE.P) {\n const len = nums.length;\n const scratch = new Array(len);\n let acc = 1n;\n for (let i = 0; i < len; i++) {\n if (nums[i] === 0n)\n continue;\n scratch[i] = acc;\n acc = mod(acc * nums[i], n);\n }\n acc = invert(acc, n);\n for (let i = len - 1; i >= 0; i--) {\n if (nums[i] === 0n)\n continue;\n let tmp = mod(acc * nums[i], n);\n nums[i] = mod(acc * scratch[i], n);\n acc = tmp;\n }\n return nums;\n}\nfunction pow2(x, power) {\n const { P } = CURVE;\n let res = x;\n while (power-- > 0n) {\n res *= res;\n res %= P;\n }\n return res;\n}\nfunction pow_2_252_3(x) {\n const { P } = CURVE;\n const x2 = (x * x) % P;\n const b2 = (x2 * x) % P;\n const b4 = (pow2(b2, 2n) * b2) % P;\n const b5 = (pow2(b4, 1n) * x) % P;\n const b10 = (pow2(b5, 5n) * b5) % P;\n const b20 = (pow2(b10, 10n) * b10) % P;\n const b40 = (pow2(b20, 20n) * b20) % P;\n const b80 = (pow2(b40, 40n) * b40) % P;\n const b160 = (pow2(b80, 80n) * b80) % P;\n const b240 = (pow2(b160, 80n) * b80) % P;\n const b250 = (pow2(b240, 10n) * b10) % P;\n const pow_p_5_8 = (pow2(b250, 2n) * x) % P;\n return pow_p_5_8;\n}\nfunction uvRatio(u, v) {\n const v3 = mod(v * v * v);\n const v7 = mod(v3 * v3 * v);\n let x = mod(u * v3 * pow_2_252_3(u * v7));\n const vx2 = mod(v * x * x);\n const root1 = x;\n const root2 = mod(x * SQRT_M1);\n const useRoot1 = vx2 === u;\n const useRoot2 = vx2 === mod(-u);\n const noRoot = vx2 === mod(-u * SQRT_M1);\n if (useRoot1)\n x = root1;\n if (useRoot2 || noRoot)\n x = root2;\n if (edIsNegative(x))\n x = mod(-x);\n return { isValid: useRoot1 || useRoot2, value: x };\n}\nfunction invertSqrt(number) {\n return uvRatio(1n, number);\n}\nasync function sha512ToNumberLE(...args) {\n const messageArray = concatBytes(...args);\n const hash = await exports.utils.sha512(messageArray);\n const value = bytesToNumberLE(hash);\n return mod(value, CURVE.n);\n}\nfunction keyPrefix(privateBytes) {\n return privateBytes.slice(B32);\n}\nfunction encodePrivate(privateBytes) {\n const last = B32 - 1;\n const head = privateBytes.slice(0, B32);\n head[0] &= 248;\n head[last] &= 127;\n head[last] |= 64;\n return mod(bytesToNumberLE(head), CURVE.n);\n}\nfunction equalBytes(b1, b2) {\n if (b1.length !== b2.length) {\n return false;\n }\n for (let i = 0; i < b1.length; i++) {\n if (b1[i] !== b2[i]) {\n return false;\n }\n }\n return true;\n}\nfunction ensureBytes(hash) {\n return hash instanceof Uint8Array ? hash : hexToBytes(hash);\n}\nfunction isWithinCurveOrder(num) {\n return 0 < num && num < CURVE.n;\n}\nfunction normalizePrivateKey(key) {\n let num;\n if (typeof key === 'bigint' || (typeof key === 'number' && Number.isSafeInteger(key) && key > 0)) {\n num = BigInt(key);\n key = num.toString(16).padStart(B32 * 2, '0');\n }\n if (typeof key === 'string') {\n if (key.length !== 64)\n throw new Error('Expected 32 bytes of private key');\n return hexToBytes(key);\n }\n else if (key instanceof Uint8Array) {\n if (key.length !== 32)\n throw new Error('Expected 32 bytes of private key');\n return key;\n }\n else {\n throw new TypeError('Expected valid private key');\n }\n}\nasync function getPublicKey(privateKey) {\n const key = await Point.fromPrivateKey(privateKey);\n return typeof privateKey === 'string' ? key.toHex() : key.toRawBytes();\n}\nexports.getPublicKey = getPublicKey;\nasync function sign(hash, privateKey) {\n const privBytes = await exports.utils.sha512(normalizePrivateKey(privateKey));\n const p = encodePrivate(privBytes);\n const P = Point.BASE.multiply(p);\n const msg = ensureBytes(hash);\n const r = await sha512ToNumberLE(keyPrefix(privBytes), msg);\n const R = Point.BASE.multiply(r);\n const h = await sha512ToNumberLE(R.toRawBytes(), P.toRawBytes(), msg);\n const S = mod(r + h * p, CURVE.n);\n const sig = new Signature(R, S);\n return typeof hash === 'string' ? sig.toHex() : sig.toRawBytes();\n}\nexports.sign = sign;\nasync function verify(signature, hash, publicKey) {\n hash = ensureBytes(hash);\n if (!(publicKey instanceof Point))\n publicKey = Point.fromHex(publicKey);\n if (!(signature instanceof Signature))\n signature = Signature.fromHex(signature);\n const hs = await sha512ToNumberLE(signature.r.toRawBytes(), publicKey.toRawBytes(), hash);\n const Ph = ExtendedPoint.fromAffine(publicKey).multiplyUnsafe(hs);\n const Gs = ExtendedPoint.BASE.multiply(signature.s);\n const RPh = ExtendedPoint.fromAffine(signature.r).add(Ph);\n return RPh.subtract(Gs).multiplyUnsafe(8n).equals(ExtendedPoint.ZERO);\n}\nexports.verify = verify;\nPoint.BASE._setWindowSize(8);\nexports.utils = {\n TORSION_SUBGROUP: [\n '0100000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a',\n '0000000000000000000000000000000000000000000000000000000000000080',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05',\n 'ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f',\n '26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85',\n '0000000000000000000000000000000000000000000000000000000000000000',\n 'c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa',\n ],\n randomPrivateKey: (bytesLength = 32) => {\n if (typeof window == 'object' && 'crypto' in window) {\n return window.crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n else if (typeof process === 'object' && 'node' in process.versions) {\n const { randomBytes } = require('crypto');\n return new Uint8Array(randomBytes(bytesLength).buffer);\n }\n else {\n throw new Error(\"The environment doesn't have randomBytes function\");\n }\n },\n sha512: async (message) => {\n if (typeof window == 'object' && 'crypto' in window) {\n const buffer = await window.crypto.subtle.digest('SHA-512', message.buffer);\n return new Uint8Array(buffer);\n }\n else if (typeof process === 'object' && 'node' in process.versions) {\n const { createHash } = require('crypto');\n const hash = createHash('sha512');\n hash.update(message);\n return Uint8Array.from(hash.digest());\n }\n else {\n throw new Error(\"The environment doesn't have sha512 function\");\n }\n },\n precompute(windowSize = 8, point = Point.BASE) {\n const cached = point.equals(Point.BASE) ? point : new Point(point.x, point.y);\n cached._setWindowSize(windowSize);\n cached.multiply(1n);\n return cached;\n },\n};\n", null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, "(function (Object) {\n typeof globalThis !== 'object' && (\n this ?\n get() :\n (Object.defineProperty(Object.prototype, '_T_', {\n configurable: true,\n get: get\n }), _T_)\n );\n function get() {\n var global = this || self;\n global.globalThis = global;\n delete Object.prototype._T_;\n }\n}(Object));\nmodule.exports = globalThis;\n", "/*!\n localForage -- Offline Storage, Improved\n Version 1.7.3\n https://localforage.github.io/localForage\n (c) 2013-2017 Mozilla, Apache License 2.0\n*/\n(function(f){if(typeof exports===\"object\"&&typeof module!==\"undefined\"){module.exports=f()}else if(typeof define===\"function\"&&define.amd){define([],f)}else{var g;if(typeof window!==\"undefined\"){g=window}else if(typeof global!==\"undefined\"){g=global}else if(typeof self!==\"undefined\"){g=self}else{g=this}g.localforage = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw (f.code=\"MODULE_NOT_FOUND\", f)}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){\n(function (global){\n'use strict';\nvar Mutation = global.MutationObserver || global.WebKitMutationObserver;\n\nvar scheduleDrain;\n\n{\n if (Mutation) {\n var called = 0;\n var observer = new Mutation(nextTick);\n var element = global.document.createTextNode('');\n observer.observe(element, {\n characterData: true\n });\n scheduleDrain = function () {\n element.data = (called = ++called % 2);\n };\n } else if (!global.setImmediate && typeof global.MessageChannel !== 'undefined') {\n var channel = new global.MessageChannel();\n channel.port1.onmessage = nextTick;\n scheduleDrain = function () {\n channel.port2.postMessage(0);\n };\n } else if ('document' in global && 'onreadystatechange' in global.document.createElement('script')) {\n scheduleDrain = function () {\n\n // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n var scriptEl = global.document.createElement('script');\n scriptEl.onreadystatechange = function () {\n nextTick();\n\n scriptEl.onreadystatechange = null;\n scriptEl.parentNode.removeChild(scriptEl);\n scriptEl = null;\n };\n global.document.documentElement.appendChild(scriptEl);\n };\n } else {\n scheduleDrain = function () {\n setTimeout(nextTick, 0);\n };\n }\n}\n\nvar draining;\nvar queue = [];\n//named nextTick for less confusing stack traces\nfunction nextTick() {\n draining = true;\n var i, oldQueue;\n var len = queue.length;\n while (len) {\n oldQueue = queue;\n queue = [];\n i = -1;\n while (++i < len) {\n oldQueue[i]();\n }\n len = queue.length;\n }\n draining = false;\n}\n\nmodule.exports = immediate;\nfunction immediate(task) {\n if (queue.push(task) === 1 && !draining) {\n scheduleDrain();\n }\n}\n\n}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{}],2:[function(_dereq_,module,exports){\n'use strict';\nvar immediate = _dereq_(1);\n\n/* istanbul ignore next */\nfunction INTERNAL() {}\n\nvar handlers = {};\n\nvar REJECTED = ['REJECTED'];\nvar FULFILLED = ['FULFILLED'];\nvar PENDING = ['PENDING'];\n\nmodule.exports = Promise;\n\nfunction Promise(resolver) {\n if (typeof resolver !== 'function') {\n throw new TypeError('resolver must be a function');\n }\n this.state = PENDING;\n this.queue = [];\n this.outcome = void 0;\n if (resolver !== INTERNAL) {\n safelyResolveThenable(this, resolver);\n }\n}\n\nPromise.prototype[\"catch\"] = function (onRejected) {\n return this.then(null, onRejected);\n};\nPromise.prototype.then = function (onFulfilled, onRejected) {\n if (typeof onFulfilled !== 'function' && this.state === FULFILLED ||\n typeof onRejected !== 'function' && this.state === REJECTED) {\n return this;\n }\n var promise = new this.constructor(INTERNAL);\n if (this.state !== PENDING) {\n var resolver = this.state === FULFILLED ? onFulfilled : onRejected;\n unwrap(promise, resolver, this.outcome);\n } else {\n this.queue.push(new QueueItem(promise, onFulfilled, onRejected));\n }\n\n return promise;\n};\nfunction QueueItem(promise, onFulfilled, onRejected) {\n this.promise = promise;\n if (typeof onFulfilled === 'function') {\n this.onFulfilled = onFulfilled;\n this.callFulfilled = this.otherCallFulfilled;\n }\n if (typeof onRejected === 'function') {\n this.onRejected = onRejected;\n this.callRejected = this.otherCallRejected;\n }\n}\nQueueItem.prototype.callFulfilled = function (value) {\n handlers.resolve(this.promise, value);\n};\nQueueItem.prototype.otherCallFulfilled = function (value) {\n unwrap(this.promise, this.onFulfilled, value);\n};\nQueueItem.prototype.callRejected = function (value) {\n handlers.reject(this.promise, value);\n};\nQueueItem.prototype.otherCallRejected = function (value) {\n unwrap(this.promise, this.onRejected, value);\n};\n\nfunction unwrap(promise, func, value) {\n immediate(function () {\n var returnValue;\n try {\n returnValue = func(value);\n } catch (e) {\n return handlers.reject(promise, e);\n }\n if (returnValue === promise) {\n handlers.reject(promise, new TypeError('Cannot resolve promise with itself'));\n } else {\n handlers.resolve(promise, returnValue);\n }\n });\n}\n\nhandlers.resolve = function (self, value) {\n var result = tryCatch(getThen, value);\n if (result.status === 'error') {\n return handlers.reject(self, result.value);\n }\n var thenable = result.value;\n\n if (thenable) {\n safelyResolveThenable(self, thenable);\n } else {\n self.state = FULFILLED;\n self.outcome = value;\n var i = -1;\n var len = self.queue.length;\n while (++i < len) {\n self.queue[i].callFulfilled(value);\n }\n }\n return self;\n};\nhandlers.reject = function (self, error) {\n self.state = REJECTED;\n self.outcome = error;\n var i = -1;\n var len = self.queue.length;\n while (++i < len) {\n self.queue[i].callRejected(error);\n }\n return self;\n};\n\nfunction getThen(obj) {\n // Make sure we only access the accessor once as required by the spec\n var then = obj && obj.then;\n if (obj && (typeof obj === 'object' || typeof obj === 'function') && typeof then === 'function') {\n return function appyThen() {\n then.apply(obj, arguments);\n };\n }\n}\n\nfunction safelyResolveThenable(self, thenable) {\n // Either fulfill, reject or reject with error\n var called = false;\n function onError(value) {\n if (called) {\n return;\n }\n called = true;\n handlers.reject(self, value);\n }\n\n function onSuccess(value) {\n if (called) {\n return;\n }\n called = true;\n handlers.resolve(self, value);\n }\n\n function tryToUnwrap() {\n thenable(onSuccess, onError);\n }\n\n var result = tryCatch(tryToUnwrap);\n if (result.status === 'error') {\n onError(result.value);\n }\n}\n\nfunction tryCatch(func, value) {\n var out = {};\n try {\n out.value = func(value);\n out.status = 'success';\n } catch (e) {\n out.status = 'error';\n out.value = e;\n }\n return out;\n}\n\nPromise.resolve = resolve;\nfunction resolve(value) {\n if (value instanceof this) {\n return value;\n }\n return handlers.resolve(new this(INTERNAL), value);\n}\n\nPromise.reject = reject;\nfunction reject(reason) {\n var promise = new this(INTERNAL);\n return handlers.reject(promise, reason);\n}\n\nPromise.all = all;\nfunction all(iterable) {\n var self = this;\n if (Object.prototype.toString.call(iterable) !== '[object Array]') {\n return this.reject(new TypeError('must be an array'));\n }\n\n var len = iterable.length;\n var called = false;\n if (!len) {\n return this.resolve([]);\n }\n\n var values = new Array(len);\n var resolved = 0;\n var i = -1;\n var promise = new this(INTERNAL);\n\n while (++i < len) {\n allResolver(iterable[i], i);\n }\n return promise;\n function allResolver(value, i) {\n self.resolve(value).then(resolveFromAll, function (error) {\n if (!called) {\n called = true;\n handlers.reject(promise, error);\n }\n });\n function resolveFromAll(outValue) {\n values[i] = outValue;\n if (++resolved === len && !called) {\n called = true;\n handlers.resolve(promise, values);\n }\n }\n }\n}\n\nPromise.race = race;\nfunction race(iterable) {\n var self = this;\n if (Object.prototype.toString.call(iterable) !== '[object Array]') {\n return this.reject(new TypeError('must be an array'));\n }\n\n var len = iterable.length;\n var called = false;\n if (!len) {\n return this.resolve([]);\n }\n\n var i = -1;\n var promise = new this(INTERNAL);\n\n while (++i < len) {\n resolver(iterable[i]);\n }\n return promise;\n function resolver(value) {\n self.resolve(value).then(function (response) {\n if (!called) {\n called = true;\n handlers.resolve(promise, response);\n }\n }, function (error) {\n if (!called) {\n called = true;\n handlers.reject(promise, error);\n }\n });\n }\n}\n\n},{\"1\":1}],3:[function(_dereq_,module,exports){\n(function (global){\n'use strict';\nif (typeof global.Promise !== 'function') {\n global.Promise = _dereq_(2);\n}\n\n}).call(this,typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{\"2\":2}],4:[function(_dereq_,module,exports){\n'use strict';\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction getIDB() {\n /* global indexedDB,webkitIndexedDB,mozIndexedDB,OIndexedDB,msIndexedDB */\n try {\n if (typeof indexedDB !== 'undefined') {\n return indexedDB;\n }\n if (typeof webkitIndexedDB !== 'undefined') {\n return webkitIndexedDB;\n }\n if (typeof mozIndexedDB !== 'undefined') {\n return mozIndexedDB;\n }\n if (typeof OIndexedDB !== 'undefined') {\n return OIndexedDB;\n }\n if (typeof msIndexedDB !== 'undefined') {\n return msIndexedDB;\n }\n } catch (e) {\n return;\n }\n}\n\nvar idb = getIDB();\n\nfunction isIndexedDBValid() {\n try {\n // Initialize IndexedDB; fall back to vendor-prefixed versions\n // if needed.\n if (!idb) {\n return false;\n }\n // We mimic PouchDB here;\n //\n // We test for openDatabase because IE Mobile identifies itself\n // as Safari. Oh the lulz...\n var isSafari = typeof openDatabase !== 'undefined' && /(Safari|iPhone|iPad|iPod)/.test(navigator.userAgent) && !/Chrome/.test(navigator.userAgent) && !/BlackBerry/.test(navigator.platform);\n\n var hasFetch = typeof fetch === 'function' && fetch.toString().indexOf('[native code') !== -1;\n\n // Safari <10.1 does not meet our requirements for IDB support (#5572)\n // since Safari 10.1 shipped with fetch, we can use that to detect it\n return (!isSafari || hasFetch) && typeof indexedDB !== 'undefined' &&\n // some outdated implementations of IDB that appear on Samsung\n // and HTC Android devices <4.4 are missing IDBKeyRange\n // See: https://github.com/mozilla/localForage/issues/128\n // See: https://github.com/mozilla/localForage/issues/272\n typeof IDBKeyRange !== 'undefined';\n } catch (e) {\n return false;\n }\n}\n\n// Abstracts constructing a Blob object, so it also works in older\n// browsers that don't support the native Blob constructor. (i.e.\n// old QtWebKit versions, at least).\n// Abstracts constructing a Blob object, so it also works in older\n// browsers that don't support the native Blob constructor. (i.e.\n// old QtWebKit versions, at least).\nfunction createBlob(parts, properties) {\n /* global BlobBuilder,MSBlobBuilder,MozBlobBuilder,WebKitBlobBuilder */\n parts = parts || [];\n properties = properties || {};\n try {\n return new Blob(parts, properties);\n } catch (e) {\n if (e.name !== 'TypeError') {\n throw e;\n }\n var Builder = typeof BlobBuilder !== 'undefined' ? BlobBuilder : typeof MSBlobBuilder !== 'undefined' ? MSBlobBuilder : typeof MozBlobBuilder !== 'undefined' ? MozBlobBuilder : WebKitBlobBuilder;\n var builder = new Builder();\n for (var i = 0; i < parts.length; i += 1) {\n builder.append(parts[i]);\n }\n return builder.getBlob(properties.type);\n }\n}\n\n// This is CommonJS because lie is an external dependency, so Rollup\n// can just ignore it.\nif (typeof Promise === 'undefined') {\n // In the \"nopromises\" build this will just throw if you don't have\n // a global promise object, but it would throw anyway later.\n _dereq_(3);\n}\nvar Promise$1 = Promise;\n\nfunction executeCallback(promise, callback) {\n if (callback) {\n promise.then(function (result) {\n callback(null, result);\n }, function (error) {\n callback(error);\n });\n }\n}\n\nfunction executeTwoCallbacks(promise, callback, errorCallback) {\n if (typeof callback === 'function') {\n promise.then(callback);\n }\n\n if (typeof errorCallback === 'function') {\n promise[\"catch\"](errorCallback);\n }\n}\n\nfunction normalizeKey(key) {\n // Cast the key to a string, as that's all we can set as a key.\n if (typeof key !== 'string') {\n console.warn(key + ' used as a key, but it is not a string.');\n key = String(key);\n }\n\n return key;\n}\n\nfunction getCallback() {\n if (arguments.length && typeof arguments[arguments.length - 1] === 'function') {\n return arguments[arguments.length - 1];\n }\n}\n\n// Some code originally from async_storage.js in\n// [Gaia](https://github.com/mozilla-b2g/gaia).\n\nvar DETECT_BLOB_SUPPORT_STORE = 'local-forage-detect-blob-support';\nvar supportsBlobs = void 0;\nvar dbContexts = {};\nvar toString = Object.prototype.toString;\n\n// Transaction Modes\nvar READ_ONLY = 'readonly';\nvar READ_WRITE = 'readwrite';\n\n// Transform a binary string to an array buffer, because otherwise\n// weird stuff happens when you try to work with the binary string directly.\n// It is known.\n// From http://stackoverflow.com/questions/14967647/ (continues on next line)\n// encode-decode-image-with-base64-breaks-image (2013-04-21)\nfunction _binStringToArrayBuffer(bin) {\n var length = bin.length;\n var buf = new ArrayBuffer(length);\n var arr = new Uint8Array(buf);\n for (var i = 0; i < length; i++) {\n arr[i] = bin.charCodeAt(i);\n }\n return buf;\n}\n\n//\n// Blobs are not supported in all versions of IndexedDB, notably\n// Chrome <37 and Android <5. In those versions, storing a blob will throw.\n//\n// Various other blob bugs exist in Chrome v37-42 (inclusive).\n// Detecting them is expensive and confusing to users, and Chrome 37-42\n// is at very low usage worldwide, so we do a hacky userAgent check instead.\n//\n// content-type bug: https://code.google.com/p/chromium/issues/detail?id=408120\n// 404 bug: https://code.google.com/p/chromium/issues/detail?id=447916\n// FileReader bug: https://code.google.com/p/chromium/issues/detail?id=447836\n//\n// Code borrowed from PouchDB. See:\n// https://github.com/pouchdb/pouchdb/blob/master/packages/node_modules/pouchdb-adapter-idb/src/blobSupport.js\n//\nfunction _checkBlobSupportWithoutCaching(idb) {\n return new Promise$1(function (resolve) {\n var txn = idb.transaction(DETECT_BLOB_SUPPORT_STORE, READ_WRITE);\n var blob = createBlob(['']);\n txn.objectStore(DETECT_BLOB_SUPPORT_STORE).put(blob, 'key');\n\n txn.onabort = function (e) {\n // If the transaction aborts now its due to not being able to\n // write to the database, likely due to the disk being full\n e.preventDefault();\n e.stopPropagation();\n resolve(false);\n };\n\n txn.oncomplete = function () {\n var matchedChrome = navigator.userAgent.match(/Chrome\\/(\\d+)/);\n var matchedEdge = navigator.userAgent.match(/Edge\\//);\n // MS Edge pretends to be Chrome 42:\n // https://msdn.microsoft.com/en-us/library/hh869301%28v=vs.85%29.aspx\n resolve(matchedEdge || !matchedChrome || parseInt(matchedChrome[1], 10) >= 43);\n };\n })[\"catch\"](function () {\n return false; // error, so assume unsupported\n });\n}\n\nfunction _checkBlobSupport(idb) {\n if (typeof supportsBlobs === 'boolean') {\n return Promise$1.resolve(supportsBlobs);\n }\n return _checkBlobSupportWithoutCaching(idb).then(function (value) {\n supportsBlobs = value;\n return supportsBlobs;\n });\n}\n\nfunction _deferReadiness(dbInfo) {\n var dbContext = dbContexts[dbInfo.name];\n\n // Create a deferred object representing the current database operation.\n var deferredOperation = {};\n\n deferredOperation.promise = new Promise$1(function (resolve, reject) {\n deferredOperation.resolve = resolve;\n deferredOperation.reject = reject;\n });\n\n // Enqueue the deferred operation.\n dbContext.deferredOperations.push(deferredOperation);\n\n // Chain its promise to the database readiness.\n if (!dbContext.dbReady) {\n dbContext.dbReady = deferredOperation.promise;\n } else {\n dbContext.dbReady = dbContext.dbReady.then(function () {\n return deferredOperation.promise;\n });\n }\n}\n\nfunction _advanceReadiness(dbInfo) {\n var dbContext = dbContexts[dbInfo.name];\n\n // Dequeue a deferred operation.\n var deferredOperation = dbContext.deferredOperations.pop();\n\n // Resolve its promise (which is part of the database readiness\n // chain of promises).\n if (deferredOperation) {\n deferredOperation.resolve();\n return deferredOperation.promise;\n }\n}\n\nfunction _rejectReadiness(dbInfo, err) {\n var dbContext = dbContexts[dbInfo.name];\n\n // Dequeue a deferred operation.\n var deferredOperation = dbContext.deferredOperations.pop();\n\n // Reject its promise (which is part of the database readiness\n // chain of promises).\n if (deferredOperation) {\n deferredOperation.reject(err);\n return deferredOperation.promise;\n }\n}\n\nfunction _getConnection(dbInfo, upgradeNeeded) {\n return new Promise$1(function (resolve, reject) {\n dbContexts[dbInfo.name] = dbContexts[dbInfo.name] || createDbContext();\n\n if (dbInfo.db) {\n if (upgradeNeeded) {\n _deferReadiness(dbInfo);\n dbInfo.db.close();\n } else {\n return resolve(dbInfo.db);\n }\n }\n\n var dbArgs = [dbInfo.name];\n\n if (upgradeNeeded) {\n dbArgs.push(dbInfo.version);\n }\n\n var openreq = idb.open.apply(idb, dbArgs);\n\n if (upgradeNeeded) {\n openreq.onupgradeneeded = function (e) {\n var db = openreq.result;\n try {\n db.createObjectStore(dbInfo.storeName);\n if (e.oldVersion <= 1) {\n // Added when support for blob shims was added\n db.createObjectStore(DETECT_BLOB_SUPPORT_STORE);\n }\n } catch (ex) {\n if (ex.name === 'ConstraintError') {\n console.warn('The database \"' + dbInfo.name + '\"' + ' has been upgraded from version ' + e.oldVersion + ' to version ' + e.newVersion + ', but the storage \"' + dbInfo.storeName + '\" already exists.');\n } else {\n throw ex;\n }\n }\n };\n }\n\n openreq.onerror = function (e) {\n e.preventDefault();\n reject(openreq.error);\n };\n\n openreq.onsuccess = function () {\n resolve(openreq.result);\n _advanceReadiness(dbInfo);\n };\n });\n}\n\nfunction _getOriginalConnection(dbInfo) {\n return _getConnection(dbInfo, false);\n}\n\nfunction _getUpgradedConnection(dbInfo) {\n return _getConnection(dbInfo, true);\n}\n\nfunction _isUpgradeNeeded(dbInfo, defaultVersion) {\n if (!dbInfo.db) {\n return true;\n }\n\n var isNewStore = !dbInfo.db.objectStoreNames.contains(dbInfo.storeName);\n var isDowngrade = dbInfo.version < dbInfo.db.version;\n var isUpgrade = dbInfo.version > dbInfo.db.version;\n\n if (isDowngrade) {\n // If the version is not the default one\n // then warn for impossible downgrade.\n if (dbInfo.version !== defaultVersion) {\n console.warn('The database \"' + dbInfo.name + '\"' + \" can't be downgraded from version \" + dbInfo.db.version + ' to version ' + dbInfo.version + '.');\n }\n // Align the versions to prevent errors.\n dbInfo.version = dbInfo.db.version;\n }\n\n if (isUpgrade || isNewStore) {\n // If the store is new then increment the version (if needed).\n // This will trigger an \"upgradeneeded\" event which is required\n // for creating a store.\n if (isNewStore) {\n var incVersion = dbInfo.db.version + 1;\n if (incVersion > dbInfo.version) {\n dbInfo.version = incVersion;\n }\n }\n\n return true;\n }\n\n return false;\n}\n\n// encode a blob for indexeddb engines that don't support blobs\nfunction _encodeBlob(blob) {\n return new Promise$1(function (resolve, reject) {\n var reader = new FileReader();\n reader.onerror = reject;\n reader.onloadend = function (e) {\n var base64 = btoa(e.target.result || '');\n resolve({\n __local_forage_encoded_blob: true,\n data: base64,\n type: blob.type\n });\n };\n reader.readAsBinaryString(blob);\n });\n}\n\n// decode an encoded blob\nfunction _decodeBlob(encodedBlob) {\n var arrayBuff = _binStringToArrayBuffer(atob(encodedBlob.data));\n return createBlob([arrayBuff], { type: encodedBlob.type });\n}\n\n// is this one of our fancy encoded blobs?\nfunction _isEncodedBlob(value) {\n return value && value.__local_forage_encoded_blob;\n}\n\n// Specialize the default `ready()` function by making it dependent\n// on the current database operations. Thus, the driver will be actually\n// ready when it's been initialized (default) *and* there are no pending\n// operations on the database (initiated by some other instances).\nfunction _fullyReady(callback) {\n var self = this;\n\n var promise = self._initReady().then(function () {\n var dbContext = dbContexts[self._dbInfo.name];\n\n if (dbContext && dbContext.dbReady) {\n return dbContext.dbReady;\n }\n });\n\n executeTwoCallbacks(promise, callback, callback);\n return promise;\n}\n\n// Try to establish a new db connection to replace the\n// current one which is broken (i.e. experiencing\n// InvalidStateError while creating a transaction).\nfunction _tryReconnect(dbInfo) {\n _deferReadiness(dbInfo);\n\n var dbContext = dbContexts[dbInfo.name];\n var forages = dbContext.forages;\n\n for (var i = 0; i < forages.length; i++) {\n var forage = forages[i];\n if (forage._dbInfo.db) {\n forage._dbInfo.db.close();\n forage._dbInfo.db = null;\n }\n }\n dbInfo.db = null;\n\n return _getOriginalConnection(dbInfo).then(function (db) {\n dbInfo.db = db;\n if (_isUpgradeNeeded(dbInfo)) {\n // Reopen the database for upgrading.\n return _getUpgradedConnection(dbInfo);\n }\n return db;\n }).then(function (db) {\n // store the latest db reference\n // in case the db was upgraded\n dbInfo.db = dbContext.db = db;\n for (var i = 0; i < forages.length; i++) {\n forages[i]._dbInfo.db = db;\n }\n })[\"catch\"](function (err) {\n _rejectReadiness(dbInfo, err);\n throw err;\n });\n}\n\n// FF doesn't like Promises (micro-tasks) and IDDB store operations,\n// so we have to do it with callbacks\nfunction createTransaction(dbInfo, mode, callback, retries) {\n if (retries === undefined) {\n retries = 1;\n }\n\n try {\n var tx = dbInfo.db.transaction(dbInfo.storeName, mode);\n callback(null, tx);\n } catch (err) {\n if (retries > 0 && (!dbInfo.db || err.name === 'InvalidStateError' || err.name === 'NotFoundError')) {\n return Promise$1.resolve().then(function () {\n if (!dbInfo.db || err.name === 'NotFoundError' && !dbInfo.db.objectStoreNames.contains(dbInfo.storeName) && dbInfo.version <= dbInfo.db.version) {\n // increase the db version, to create the new ObjectStore\n if (dbInfo.db) {\n dbInfo.version = dbInfo.db.version + 1;\n }\n // Reopen the database for upgrading.\n return _getUpgradedConnection(dbInfo);\n }\n }).then(function () {\n return _tryReconnect(dbInfo).then(function () {\n createTransaction(dbInfo, mode, callback, retries - 1);\n });\n })[\"catch\"](callback);\n }\n\n callback(err);\n }\n}\n\nfunction createDbContext() {\n return {\n // Running localForages sharing a database.\n forages: [],\n // Shared database.\n db: null,\n // Database readiness (promise).\n dbReady: null,\n // Deferred operations on the database.\n deferredOperations: []\n };\n}\n\n// Open the IndexedDB database (automatically creates one if one didn't\n// previously exist), using any options set in the config.\nfunction _initStorage(options) {\n var self = this;\n var dbInfo = {\n db: null\n };\n\n if (options) {\n for (var i in options) {\n dbInfo[i] = options[i];\n }\n }\n\n // Get the current context of the database;\n var dbContext = dbContexts[dbInfo.name];\n\n // ...or create a new context.\n if (!dbContext) {\n dbContext = createDbContext();\n // Register the new context in the global container.\n dbContexts[dbInfo.name] = dbContext;\n }\n\n // Register itself as a running localForage in the current context.\n dbContext.forages.push(self);\n\n // Replace the default `ready()` function with the specialized one.\n if (!self._initReady) {\n self._initReady = self.ready;\n self.ready = _fullyReady;\n }\n\n // Create an array of initialization states of the related localForages.\n var initPromises = [];\n\n function ignoreErrors() {\n // Don't handle errors here,\n // just makes sure related localForages aren't pending.\n return Promise$1.resolve();\n }\n\n for (var j = 0; j < dbContext.forages.length; j++) {\n var forage = dbContext.forages[j];\n if (forage !== self) {\n // Don't wait for itself...\n initPromises.push(forage._initReady()[\"catch\"](ignoreErrors));\n }\n }\n\n // Take a snapshot of the related localForages.\n var forages = dbContext.forages.slice(0);\n\n // Initialize the connection process only when\n // all the related localForages aren't pending.\n return Promise$1.all(initPromises).then(function () {\n dbInfo.db = dbContext.db;\n // Get the connection or open a new one without upgrade.\n return _getOriginalConnection(dbInfo);\n }).then(function (db) {\n dbInfo.db = db;\n if (_isUpgradeNeeded(dbInfo, self._defaultConfig.version)) {\n // Reopen the database for upgrading.\n return _getUpgradedConnection(dbInfo);\n }\n return db;\n }).then(function (db) {\n dbInfo.db = dbContext.db = db;\n self._dbInfo = dbInfo;\n // Share the final connection amongst related localForages.\n for (var k = 0; k < forages.length; k++) {\n var forage = forages[k];\n if (forage !== self) {\n // Self is already up-to-date.\n forage._dbInfo.db = dbInfo.db;\n forage._dbInfo.version = dbInfo.version;\n }\n }\n });\n}\n\nfunction getItem(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.get(key);\n\n req.onsuccess = function () {\n var value = req.result;\n if (value === undefined) {\n value = null;\n }\n if (_isEncodedBlob(value)) {\n value = _decodeBlob(value);\n }\n resolve(value);\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Iterate over all items stored in database.\nfunction iterate(iterator, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.openCursor();\n var iterationNumber = 1;\n\n req.onsuccess = function () {\n var cursor = req.result;\n\n if (cursor) {\n var value = cursor.value;\n if (_isEncodedBlob(value)) {\n value = _decodeBlob(value);\n }\n var result = iterator(value, cursor.key, iterationNumber++);\n\n // when the iterator callback retuns any\n // (non-`undefined`) value, then we stop\n // the iteration immediately\n if (result !== void 0) {\n resolve(result);\n } else {\n cursor[\"continue\"]();\n }\n } else {\n resolve();\n }\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n\n return promise;\n}\n\nfunction setItem(key, value, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n var dbInfo;\n self.ready().then(function () {\n dbInfo = self._dbInfo;\n if (toString.call(value) === '[object Blob]') {\n return _checkBlobSupport(dbInfo.db).then(function (blobSupport) {\n if (blobSupport) {\n return value;\n }\n return _encodeBlob(value);\n });\n }\n return value;\n }).then(function (value) {\n createTransaction(self._dbInfo, READ_WRITE, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n\n // The reason we don't _save_ null is because IE 10 does\n // not support saving the `null` type in IndexedDB. How\n // ironic, given the bug below!\n // See: https://github.com/mozilla/localForage/issues/161\n if (value === null) {\n value = undefined;\n }\n\n var req = store.put(value, key);\n\n transaction.oncomplete = function () {\n // Cast to undefined so the value passed to\n // callback/promise is the same as what one would get out\n // of `getItem()` later. This leads to some weirdness\n // (setItem('foo', undefined) will return `null`), but\n // it's not my fault localStorage is our baseline and that\n // it's weird.\n if (value === undefined) {\n value = null;\n }\n\n resolve(value);\n };\n transaction.onabort = transaction.onerror = function () {\n var err = req.error ? req.error : req.transaction.error;\n reject(err);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction removeItem(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_WRITE, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n // We use a Grunt task to make this safe for IE and some\n // versions of Android (including those used by Cordova).\n // Normally IE won't like `.delete()` and will insist on\n // using `['delete']()`, but we have a build step that\n // fixes this for us now.\n var req = store[\"delete\"](key);\n transaction.oncomplete = function () {\n resolve();\n };\n\n transaction.onerror = function () {\n reject(req.error);\n };\n\n // The request will be also be aborted if we've exceeded our storage\n // space.\n transaction.onabort = function () {\n var err = req.error ? req.error : req.transaction.error;\n reject(err);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction clear(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_WRITE, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.clear();\n\n transaction.oncomplete = function () {\n resolve();\n };\n\n transaction.onabort = transaction.onerror = function () {\n var err = req.error ? req.error : req.transaction.error;\n reject(err);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction length(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.count();\n\n req.onsuccess = function () {\n resolve(req.result);\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction key(n, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n if (n < 0) {\n resolve(null);\n\n return;\n }\n\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var advanced = false;\n var req = store.openCursor();\n\n req.onsuccess = function () {\n var cursor = req.result;\n if (!cursor) {\n // this means there weren't enough keys\n resolve(null);\n\n return;\n }\n\n if (n === 0) {\n // We have the first key, return it if that's what they\n // wanted.\n resolve(cursor.key);\n } else {\n if (!advanced) {\n // Otherwise, ask the cursor to skip ahead n\n // records.\n advanced = true;\n cursor.advance(n);\n } else {\n // When we get here, we've got the nth key.\n resolve(cursor.key);\n }\n }\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction keys(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n createTransaction(self._dbInfo, READ_ONLY, function (err, transaction) {\n if (err) {\n return reject(err);\n }\n\n try {\n var store = transaction.objectStore(self._dbInfo.storeName);\n var req = store.openCursor();\n var keys = [];\n\n req.onsuccess = function () {\n var cursor = req.result;\n\n if (!cursor) {\n resolve(keys);\n return;\n }\n\n keys.push(cursor.key);\n cursor[\"continue\"]();\n };\n\n req.onerror = function () {\n reject(req.error);\n };\n } catch (e) {\n reject(e);\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction dropInstance(options, callback) {\n callback = getCallback.apply(this, arguments);\n\n var currentConfig = this.config();\n options = typeof options !== 'function' && options || {};\n if (!options.name) {\n options.name = options.name || currentConfig.name;\n options.storeName = options.storeName || currentConfig.storeName;\n }\n\n var self = this;\n var promise;\n if (!options.name) {\n promise = Promise$1.reject('Invalid arguments');\n } else {\n var isCurrentDb = options.name === currentConfig.name && self._dbInfo.db;\n\n var dbPromise = isCurrentDb ? Promise$1.resolve(self._dbInfo.db) : _getOriginalConnection(options).then(function (db) {\n var dbContext = dbContexts[options.name];\n var forages = dbContext.forages;\n dbContext.db = db;\n for (var i = 0; i < forages.length; i++) {\n forages[i]._dbInfo.db = db;\n }\n return db;\n });\n\n if (!options.storeName) {\n promise = dbPromise.then(function (db) {\n _deferReadiness(options);\n\n var dbContext = dbContexts[options.name];\n var forages = dbContext.forages;\n\n db.close();\n for (var i = 0; i < forages.length; i++) {\n var forage = forages[i];\n forage._dbInfo.db = null;\n }\n\n var dropDBPromise = new Promise$1(function (resolve, reject) {\n var req = idb.deleteDatabase(options.name);\n\n req.onerror = req.onblocked = function (err) {\n var db = req.result;\n if (db) {\n db.close();\n }\n reject(err);\n };\n\n req.onsuccess = function () {\n var db = req.result;\n if (db) {\n db.close();\n }\n resolve(db);\n };\n });\n\n return dropDBPromise.then(function (db) {\n dbContext.db = db;\n for (var i = 0; i < forages.length; i++) {\n var _forage = forages[i];\n _advanceReadiness(_forage._dbInfo);\n }\n })[\"catch\"](function (err) {\n (_rejectReadiness(options, err) || Promise$1.resolve())[\"catch\"](function () {});\n throw err;\n });\n });\n } else {\n promise = dbPromise.then(function (db) {\n if (!db.objectStoreNames.contains(options.storeName)) {\n return;\n }\n\n var newVersion = db.version + 1;\n\n _deferReadiness(options);\n\n var dbContext = dbContexts[options.name];\n var forages = dbContext.forages;\n\n db.close();\n for (var i = 0; i < forages.length; i++) {\n var forage = forages[i];\n forage._dbInfo.db = null;\n forage._dbInfo.version = newVersion;\n }\n\n var dropObjectPromise = new Promise$1(function (resolve, reject) {\n var req = idb.open(options.name, newVersion);\n\n req.onerror = function (err) {\n var db = req.result;\n db.close();\n reject(err);\n };\n\n req.onupgradeneeded = function () {\n var db = req.result;\n db.deleteObjectStore(options.storeName);\n };\n\n req.onsuccess = function () {\n var db = req.result;\n db.close();\n resolve(db);\n };\n });\n\n return dropObjectPromise.then(function (db) {\n dbContext.db = db;\n for (var j = 0; j < forages.length; j++) {\n var _forage2 = forages[j];\n _forage2._dbInfo.db = db;\n _advanceReadiness(_forage2._dbInfo);\n }\n })[\"catch\"](function (err) {\n (_rejectReadiness(options, err) || Promise$1.resolve())[\"catch\"](function () {});\n throw err;\n });\n });\n }\n }\n\n executeCallback(promise, callback);\n return promise;\n}\n\nvar asyncStorage = {\n _driver: 'asyncStorage',\n _initStorage: _initStorage,\n _support: isIndexedDBValid(),\n iterate: iterate,\n getItem: getItem,\n setItem: setItem,\n removeItem: removeItem,\n clear: clear,\n length: length,\n key: key,\n keys: keys,\n dropInstance: dropInstance\n};\n\nfunction isWebSQLValid() {\n return typeof openDatabase === 'function';\n}\n\n// Sadly, the best way to save binary data in WebSQL/localStorage is serializing\n// it to Base64, so this is how we store it to prevent very strange errors with less\n// verbose ways of binary <-> string data storage.\nvar BASE_CHARS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n\nvar BLOB_TYPE_PREFIX = '~~local_forage_type~';\nvar BLOB_TYPE_PREFIX_REGEX = /^~~local_forage_type~([^~]+)~/;\n\nvar SERIALIZED_MARKER = '__lfsc__:';\nvar SERIALIZED_MARKER_LENGTH = SERIALIZED_MARKER.length;\n\n// OMG the serializations!\nvar TYPE_ARRAYBUFFER = 'arbf';\nvar TYPE_BLOB = 'blob';\nvar TYPE_INT8ARRAY = 'si08';\nvar TYPE_UINT8ARRAY = 'ui08';\nvar TYPE_UINT8CLAMPEDARRAY = 'uic8';\nvar TYPE_INT16ARRAY = 'si16';\nvar TYPE_INT32ARRAY = 'si32';\nvar TYPE_UINT16ARRAY = 'ur16';\nvar TYPE_UINT32ARRAY = 'ui32';\nvar TYPE_FLOAT32ARRAY = 'fl32';\nvar TYPE_FLOAT64ARRAY = 'fl64';\nvar TYPE_SERIALIZED_MARKER_LENGTH = SERIALIZED_MARKER_LENGTH + TYPE_ARRAYBUFFER.length;\n\nvar toString$1 = Object.prototype.toString;\n\nfunction stringToBuffer(serializedString) {\n // Fill the string into a ArrayBuffer.\n var bufferLength = serializedString.length * 0.75;\n var len = serializedString.length;\n var i;\n var p = 0;\n var encoded1, encoded2, encoded3, encoded4;\n\n if (serializedString[serializedString.length - 1] === '=') {\n bufferLength--;\n if (serializedString[serializedString.length - 2] === '=') {\n bufferLength--;\n }\n }\n\n var buffer = new ArrayBuffer(bufferLength);\n var bytes = new Uint8Array(buffer);\n\n for (i = 0; i < len; i += 4) {\n encoded1 = BASE_CHARS.indexOf(serializedString[i]);\n encoded2 = BASE_CHARS.indexOf(serializedString[i + 1]);\n encoded3 = BASE_CHARS.indexOf(serializedString[i + 2]);\n encoded4 = BASE_CHARS.indexOf(serializedString[i + 3]);\n\n /*jslint bitwise: true */\n bytes[p++] = encoded1 << 2 | encoded2 >> 4;\n bytes[p++] = (encoded2 & 15) << 4 | encoded3 >> 2;\n bytes[p++] = (encoded3 & 3) << 6 | encoded4 & 63;\n }\n return buffer;\n}\n\n// Converts a buffer to a string to store, serialized, in the backend\n// storage library.\nfunction bufferToString(buffer) {\n // base64-arraybuffer\n var bytes = new Uint8Array(buffer);\n var base64String = '';\n var i;\n\n for (i = 0; i < bytes.length; i += 3) {\n /*jslint bitwise: true */\n base64String += BASE_CHARS[bytes[i] >> 2];\n base64String += BASE_CHARS[(bytes[i] & 3) << 4 | bytes[i + 1] >> 4];\n base64String += BASE_CHARS[(bytes[i + 1] & 15) << 2 | bytes[i + 2] >> 6];\n base64String += BASE_CHARS[bytes[i + 2] & 63];\n }\n\n if (bytes.length % 3 === 2) {\n base64String = base64String.substring(0, base64String.length - 1) + '=';\n } else if (bytes.length % 3 === 1) {\n base64String = base64String.substring(0, base64String.length - 2) + '==';\n }\n\n return base64String;\n}\n\n// Serialize a value, afterwards executing a callback (which usually\n// instructs the `setItem()` callback/promise to be executed). This is how\n// we store binary data with localStorage.\nfunction serialize(value, callback) {\n var valueType = '';\n if (value) {\n valueType = toString$1.call(value);\n }\n\n // Cannot use `value instanceof ArrayBuffer` or such here, as these\n // checks fail when running the tests using casper.js...\n //\n // TODO: See why those tests fail and use a better solution.\n if (value && (valueType === '[object ArrayBuffer]' || value.buffer && toString$1.call(value.buffer) === '[object ArrayBuffer]')) {\n // Convert binary arrays to a string and prefix the string with\n // a special marker.\n var buffer;\n var marker = SERIALIZED_MARKER;\n\n if (value instanceof ArrayBuffer) {\n buffer = value;\n marker += TYPE_ARRAYBUFFER;\n } else {\n buffer = value.buffer;\n\n if (valueType === '[object Int8Array]') {\n marker += TYPE_INT8ARRAY;\n } else if (valueType === '[object Uint8Array]') {\n marker += TYPE_UINT8ARRAY;\n } else if (valueType === '[object Uint8ClampedArray]') {\n marker += TYPE_UINT8CLAMPEDARRAY;\n } else if (valueType === '[object Int16Array]') {\n marker += TYPE_INT16ARRAY;\n } else if (valueType === '[object Uint16Array]') {\n marker += TYPE_UINT16ARRAY;\n } else if (valueType === '[object Int32Array]') {\n marker += TYPE_INT32ARRAY;\n } else if (valueType === '[object Uint32Array]') {\n marker += TYPE_UINT32ARRAY;\n } else if (valueType === '[object Float32Array]') {\n marker += TYPE_FLOAT32ARRAY;\n } else if (valueType === '[object Float64Array]') {\n marker += TYPE_FLOAT64ARRAY;\n } else {\n callback(new Error('Failed to get type for BinaryArray'));\n }\n }\n\n callback(marker + bufferToString(buffer));\n } else if (valueType === '[object Blob]') {\n // Conver the blob to a binaryArray and then to a string.\n var fileReader = new FileReader();\n\n fileReader.onload = function () {\n // Backwards-compatible prefix for the blob type.\n var str = BLOB_TYPE_PREFIX + value.type + '~' + bufferToString(this.result);\n\n callback(SERIALIZED_MARKER + TYPE_BLOB + str);\n };\n\n fileReader.readAsArrayBuffer(value);\n } else {\n try {\n callback(JSON.stringify(value));\n } catch (e) {\n console.error(\"Couldn't convert value into a JSON string: \", value);\n\n callback(null, e);\n }\n }\n}\n\n// Deserialize data we've inserted into a value column/field. We place\n// special markers into our strings to mark them as encoded; this isn't\n// as nice as a meta field, but it's the only sane thing we can do whilst\n// keeping localStorage support intact.\n//\n// Oftentimes this will just deserialize JSON content, but if we have a\n// special marker (SERIALIZED_MARKER, defined above), we will extract\n// some kind of arraybuffer/binary data/typed array out of the string.\nfunction deserialize(value) {\n // If we haven't marked this string as being specially serialized (i.e.\n // something other than serialized JSON), we can just return it and be\n // done with it.\n if (value.substring(0, SERIALIZED_MARKER_LENGTH) !== SERIALIZED_MARKER) {\n return JSON.parse(value);\n }\n\n // The following code deals with deserializing some kind of Blob or\n // TypedArray. First we separate out the type of data we're dealing\n // with from the data itself.\n var serializedString = value.substring(TYPE_SERIALIZED_MARKER_LENGTH);\n var type = value.substring(SERIALIZED_MARKER_LENGTH, TYPE_SERIALIZED_MARKER_LENGTH);\n\n var blobType;\n // Backwards-compatible blob type serialization strategy.\n // DBs created with older versions of localForage will simply not have the blob type.\n if (type === TYPE_BLOB && BLOB_TYPE_PREFIX_REGEX.test(serializedString)) {\n var matcher = serializedString.match(BLOB_TYPE_PREFIX_REGEX);\n blobType = matcher[1];\n serializedString = serializedString.substring(matcher[0].length);\n }\n var buffer = stringToBuffer(serializedString);\n\n // Return the right type based on the code/type set during\n // serialization.\n switch (type) {\n case TYPE_ARRAYBUFFER:\n return buffer;\n case TYPE_BLOB:\n return createBlob([buffer], { type: blobType });\n case TYPE_INT8ARRAY:\n return new Int8Array(buffer);\n case TYPE_UINT8ARRAY:\n return new Uint8Array(buffer);\n case TYPE_UINT8CLAMPEDARRAY:\n return new Uint8ClampedArray(buffer);\n case TYPE_INT16ARRAY:\n return new Int16Array(buffer);\n case TYPE_UINT16ARRAY:\n return new Uint16Array(buffer);\n case TYPE_INT32ARRAY:\n return new Int32Array(buffer);\n case TYPE_UINT32ARRAY:\n return new Uint32Array(buffer);\n case TYPE_FLOAT32ARRAY:\n return new Float32Array(buffer);\n case TYPE_FLOAT64ARRAY:\n return new Float64Array(buffer);\n default:\n throw new Error('Unkown type: ' + type);\n }\n}\n\nvar localforageSerializer = {\n serialize: serialize,\n deserialize: deserialize,\n stringToBuffer: stringToBuffer,\n bufferToString: bufferToString\n};\n\n/*\n * Includes code from:\n *\n * base64-arraybuffer\n * https://github.com/niklasvh/base64-arraybuffer\n *\n * Copyright (c) 2012 Niklas von Hertzen\n * Licensed under the MIT license.\n */\n\nfunction createDbTable(t, dbInfo, callback, errorCallback) {\n t.executeSql('CREATE TABLE IF NOT EXISTS ' + dbInfo.storeName + ' ' + '(id INTEGER PRIMARY KEY, key unique, value)', [], callback, errorCallback);\n}\n\n// Open the WebSQL database (automatically creates one if one didn't\n// previously exist), using any options set in the config.\nfunction _initStorage$1(options) {\n var self = this;\n var dbInfo = {\n db: null\n };\n\n if (options) {\n for (var i in options) {\n dbInfo[i] = typeof options[i] !== 'string' ? options[i].toString() : options[i];\n }\n }\n\n var dbInfoPromise = new Promise$1(function (resolve, reject) {\n // Open the database; the openDatabase API will automatically\n // create it for us if it doesn't exist.\n try {\n dbInfo.db = openDatabase(dbInfo.name, String(dbInfo.version), dbInfo.description, dbInfo.size);\n } catch (e) {\n return reject(e);\n }\n\n // Create our key/value table if it doesn't exist.\n dbInfo.db.transaction(function (t) {\n createDbTable(t, dbInfo, function () {\n self._dbInfo = dbInfo;\n resolve();\n }, function (t, error) {\n reject(error);\n });\n }, reject);\n });\n\n dbInfo.serializer = localforageSerializer;\n return dbInfoPromise;\n}\n\nfunction tryExecuteSql(t, dbInfo, sqlStatement, args, callback, errorCallback) {\n t.executeSql(sqlStatement, args, callback, function (t, error) {\n if (error.code === error.SYNTAX_ERR) {\n t.executeSql('SELECT name FROM sqlite_master ' + \"WHERE type='table' AND name = ?\", [dbInfo.storeName], function (t, results) {\n if (!results.rows.length) {\n // if the table is missing (was deleted)\n // re-create it table and retry\n createDbTable(t, dbInfo, function () {\n t.executeSql(sqlStatement, args, callback, errorCallback);\n }, errorCallback);\n } else {\n errorCallback(t, error);\n }\n }, errorCallback);\n } else {\n errorCallback(t, error);\n }\n }, errorCallback);\n}\n\nfunction getItem$1(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT * FROM ' + dbInfo.storeName + ' WHERE key = ? LIMIT 1', [key], function (t, results) {\n var result = results.rows.length ? results.rows.item(0).value : null;\n\n // Check to see if this is serialized content we need to\n // unpack.\n if (result) {\n result = dbInfo.serializer.deserialize(result);\n }\n\n resolve(result);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction iterate$1(iterator, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT * FROM ' + dbInfo.storeName, [], function (t, results) {\n var rows = results.rows;\n var length = rows.length;\n\n for (var i = 0; i < length; i++) {\n var item = rows.item(i);\n var result = item.value;\n\n // Check to see if this is serialized content\n // we need to unpack.\n if (result) {\n result = dbInfo.serializer.deserialize(result);\n }\n\n result = iterator(result, item.key, i + 1);\n\n // void(0) prevents problems with redefinition\n // of `undefined`.\n if (result !== void 0) {\n resolve(result);\n return;\n }\n }\n\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction _setItem(key, value, callback, retriesLeft) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n // The localStorage API doesn't return undefined values in an\n // \"expected\" way, so undefined is always cast to null in all\n // drivers. See: https://github.com/mozilla/localForage/pull/42\n if (value === undefined) {\n value = null;\n }\n\n // Save the original value to pass to the callback.\n var originalValue = value;\n\n var dbInfo = self._dbInfo;\n dbInfo.serializer.serialize(value, function (value, error) {\n if (error) {\n reject(error);\n } else {\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'INSERT OR REPLACE INTO ' + dbInfo.storeName + ' ' + '(key, value) VALUES (?, ?)', [key, value], function () {\n resolve(originalValue);\n }, function (t, error) {\n reject(error);\n });\n }, function (sqlError) {\n // The transaction failed; check\n // to see if it's a quota error.\n if (sqlError.code === sqlError.QUOTA_ERR) {\n // We reject the callback outright for now, but\n // it's worth trying to re-run the transaction.\n // Even if the user accepts the prompt to use\n // more storage on Safari, this error will\n // be called.\n //\n // Try to re-run the transaction.\n if (retriesLeft > 0) {\n resolve(_setItem.apply(self, [key, originalValue, callback, retriesLeft - 1]));\n return;\n }\n reject(sqlError);\n }\n });\n }\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction setItem$1(key, value, callback) {\n return _setItem.apply(this, [key, value, callback, 1]);\n}\n\nfunction removeItem$1(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'DELETE FROM ' + dbInfo.storeName + ' WHERE key = ?', [key], function () {\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Deletes every item in the table.\n// TODO: Find out if this resets the AUTO_INCREMENT number.\nfunction clear$1(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'DELETE FROM ' + dbInfo.storeName, [], function () {\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Does a simple `COUNT(key)` to get the number of items stored in\n// localForage.\nfunction length$1(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n // Ahhh, SQL makes this one soooooo easy.\n tryExecuteSql(t, dbInfo, 'SELECT COUNT(key) as c FROM ' + dbInfo.storeName, [], function (t, results) {\n var result = results.rows.item(0).c;\n resolve(result);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Return the key located at key index X; essentially gets the key from a\n// `WHERE id = ?`. This is the most efficient way I can think to implement\n// this rarely-used (in my experience) part of the API, but it can seem\n// inconsistent, because we do `INSERT OR REPLACE INTO` on `setItem()`, so\n// the ID of each key will change every time it's updated. Perhaps a stored\n// procedure for the `setItem()` SQL would solve this problem?\n// TODO: Don't change ID on `setItem()`.\nfunction key$1(n, callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT key FROM ' + dbInfo.storeName + ' WHERE id = ? LIMIT 1', [n + 1], function (t, results) {\n var result = results.rows.length ? results.rows.item(0).key : null;\n resolve(result);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction keys$1(callback) {\n var self = this;\n\n var promise = new Promise$1(function (resolve, reject) {\n self.ready().then(function () {\n var dbInfo = self._dbInfo;\n dbInfo.db.transaction(function (t) {\n tryExecuteSql(t, dbInfo, 'SELECT key FROM ' + dbInfo.storeName, [], function (t, results) {\n var keys = [];\n\n for (var i = 0; i < results.rows.length; i++) {\n keys.push(results.rows.item(i).key);\n }\n\n resolve(keys);\n }, function (t, error) {\n reject(error);\n });\n });\n })[\"catch\"](reject);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// https://www.w3.org/TR/webdatabase/#databases\n// > There is no way to enumerate or delete the databases available for an origin from this API.\nfunction getAllStoreNames(db) {\n return new Promise$1(function (resolve, reject) {\n db.transaction(function (t) {\n t.executeSql('SELECT name FROM sqlite_master ' + \"WHERE type='table' AND name <> '__WebKitDatabaseInfoTable__'\", [], function (t, results) {\n var storeNames = [];\n\n for (var i = 0; i < results.rows.length; i++) {\n storeNames.push(results.rows.item(i).name);\n }\n\n resolve({\n db: db,\n storeNames: storeNames\n });\n }, function (t, error) {\n reject(error);\n });\n }, function (sqlError) {\n reject(sqlError);\n });\n });\n}\n\nfunction dropInstance$1(options, callback) {\n callback = getCallback.apply(this, arguments);\n\n var currentConfig = this.config();\n options = typeof options !== 'function' && options || {};\n if (!options.name) {\n options.name = options.name || currentConfig.name;\n options.storeName = options.storeName || currentConfig.storeName;\n }\n\n var self = this;\n var promise;\n if (!options.name) {\n promise = Promise$1.reject('Invalid arguments');\n } else {\n promise = new Promise$1(function (resolve) {\n var db;\n if (options.name === currentConfig.name) {\n // use the db reference of the current instance\n db = self._dbInfo.db;\n } else {\n db = openDatabase(options.name, '', '', 0);\n }\n\n if (!options.storeName) {\n // drop all database tables\n resolve(getAllStoreNames(db));\n } else {\n resolve({\n db: db,\n storeNames: [options.storeName]\n });\n }\n }).then(function (operationInfo) {\n return new Promise$1(function (resolve, reject) {\n operationInfo.db.transaction(function (t) {\n function dropTable(storeName) {\n return new Promise$1(function (resolve, reject) {\n t.executeSql('DROP TABLE IF EXISTS ' + storeName, [], function () {\n resolve();\n }, function (t, error) {\n reject(error);\n });\n });\n }\n\n var operations = [];\n for (var i = 0, len = operationInfo.storeNames.length; i < len; i++) {\n operations.push(dropTable(operationInfo.storeNames[i]));\n }\n\n Promise$1.all(operations).then(function () {\n resolve();\n })[\"catch\"](function (e) {\n reject(e);\n });\n }, function (sqlError) {\n reject(sqlError);\n });\n });\n });\n }\n\n executeCallback(promise, callback);\n return promise;\n}\n\nvar webSQLStorage = {\n _driver: 'webSQLStorage',\n _initStorage: _initStorage$1,\n _support: isWebSQLValid(),\n iterate: iterate$1,\n getItem: getItem$1,\n setItem: setItem$1,\n removeItem: removeItem$1,\n clear: clear$1,\n length: length$1,\n key: key$1,\n keys: keys$1,\n dropInstance: dropInstance$1\n};\n\nfunction isLocalStorageValid() {\n try {\n return typeof localStorage !== 'undefined' && 'setItem' in localStorage &&\n // in IE8 typeof localStorage.setItem === 'object'\n !!localStorage.setItem;\n } catch (e) {\n return false;\n }\n}\n\nfunction _getKeyPrefix(options, defaultConfig) {\n var keyPrefix = options.name + '/';\n\n if (options.storeName !== defaultConfig.storeName) {\n keyPrefix += options.storeName + '/';\n }\n return keyPrefix;\n}\n\n// Check if localStorage throws when saving an item\nfunction checkIfLocalStorageThrows() {\n var localStorageTestKey = '_localforage_support_test';\n\n try {\n localStorage.setItem(localStorageTestKey, true);\n localStorage.removeItem(localStorageTestKey);\n\n return false;\n } catch (e) {\n return true;\n }\n}\n\n// Check if localStorage is usable and allows to save an item\n// This method checks if localStorage is usable in Safari Private Browsing\n// mode, or in any other case where the available quota for localStorage\n// is 0 and there wasn't any saved items yet.\nfunction _isLocalStorageUsable() {\n return !checkIfLocalStorageThrows() || localStorage.length > 0;\n}\n\n// Config the localStorage backend, using options set in the config.\nfunction _initStorage$2(options) {\n var self = this;\n var dbInfo = {};\n if (options) {\n for (var i in options) {\n dbInfo[i] = options[i];\n }\n }\n\n dbInfo.keyPrefix = _getKeyPrefix(options, self._defaultConfig);\n\n if (!_isLocalStorageUsable()) {\n return Promise$1.reject();\n }\n\n self._dbInfo = dbInfo;\n dbInfo.serializer = localforageSerializer;\n\n return Promise$1.resolve();\n}\n\n// Remove all keys from the datastore, effectively destroying all data in\n// the app's key/value store!\nfunction clear$2(callback) {\n var self = this;\n var promise = self.ready().then(function () {\n var keyPrefix = self._dbInfo.keyPrefix;\n\n for (var i = localStorage.length - 1; i >= 0; i--) {\n var key = localStorage.key(i);\n\n if (key.indexOf(keyPrefix) === 0) {\n localStorage.removeItem(key);\n }\n }\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Retrieve an item from the store. Unlike the original async_storage\n// library in Gaia, we don't modify return values at all. If a key's value\n// is `undefined`, we pass that value to the callback function.\nfunction getItem$2(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var result = localStorage.getItem(dbInfo.keyPrefix + key);\n\n // If a result was found, parse it from the serialized\n // string into a JS object. If result isn't truthy, the key\n // is likely undefined and we'll pass it straight to the\n // callback.\n if (result) {\n result = dbInfo.serializer.deserialize(result);\n }\n\n return result;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Iterate over all items in the store.\nfunction iterate$2(iterator, callback) {\n var self = this;\n\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var keyPrefix = dbInfo.keyPrefix;\n var keyPrefixLength = keyPrefix.length;\n var length = localStorage.length;\n\n // We use a dedicated iterator instead of the `i` variable below\n // so other keys we fetch in localStorage aren't counted in\n // the `iterationNumber` argument passed to the `iterate()`\n // callback.\n //\n // See: github.com/mozilla/localForage/pull/435#discussion_r38061530\n var iterationNumber = 1;\n\n for (var i = 0; i < length; i++) {\n var key = localStorage.key(i);\n if (key.indexOf(keyPrefix) !== 0) {\n continue;\n }\n var value = localStorage.getItem(key);\n\n // If a result was found, parse it from the serialized\n // string into a JS object. If result isn't truthy, the\n // key is likely undefined and we'll pass it straight\n // to the iterator.\n if (value) {\n value = dbInfo.serializer.deserialize(value);\n }\n\n value = iterator(value, key.substring(keyPrefixLength), iterationNumber++);\n\n if (value !== void 0) {\n return value;\n }\n }\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Same as localStorage's key() method, except takes a callback.\nfunction key$2(n, callback) {\n var self = this;\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var result;\n try {\n result = localStorage.key(n);\n } catch (error) {\n result = null;\n }\n\n // Remove the prefix from the key, if a key is found.\n if (result) {\n result = result.substring(dbInfo.keyPrefix.length);\n }\n\n return result;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction keys$2(callback) {\n var self = this;\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n var length = localStorage.length;\n var keys = [];\n\n for (var i = 0; i < length; i++) {\n var itemKey = localStorage.key(i);\n if (itemKey.indexOf(dbInfo.keyPrefix) === 0) {\n keys.push(itemKey.substring(dbInfo.keyPrefix.length));\n }\n }\n\n return keys;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Supply the number of keys in the datastore to the callback function.\nfunction length$2(callback) {\n var self = this;\n var promise = self.keys().then(function (keys) {\n return keys.length;\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Remove an item from the store, nice and simple.\nfunction removeItem$2(key, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = self.ready().then(function () {\n var dbInfo = self._dbInfo;\n localStorage.removeItem(dbInfo.keyPrefix + key);\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\n// Set a key's value and run an optional callback once the value is set.\n// Unlike Gaia's implementation, the callback function is passed the value,\n// in case you want to operate on that value only after you're sure it\n// saved, or something like that.\nfunction setItem$2(key, value, callback) {\n var self = this;\n\n key = normalizeKey(key);\n\n var promise = self.ready().then(function () {\n // Convert undefined values to null.\n // https://github.com/mozilla/localForage/pull/42\n if (value === undefined) {\n value = null;\n }\n\n // Save the original value to pass to the callback.\n var originalValue = value;\n\n return new Promise$1(function (resolve, reject) {\n var dbInfo = self._dbInfo;\n dbInfo.serializer.serialize(value, function (value, error) {\n if (error) {\n reject(error);\n } else {\n try {\n localStorage.setItem(dbInfo.keyPrefix + key, value);\n resolve(originalValue);\n } catch (e) {\n // localStorage capacity exceeded.\n // TODO: Make this a specific error/event.\n if (e.name === 'QuotaExceededError' || e.name === 'NS_ERROR_DOM_QUOTA_REACHED') {\n reject(e);\n }\n reject(e);\n }\n }\n });\n });\n });\n\n executeCallback(promise, callback);\n return promise;\n}\n\nfunction dropInstance$2(options, callback) {\n callback = getCallback.apply(this, arguments);\n\n options = typeof options !== 'function' && options || {};\n if (!options.name) {\n var currentConfig = this.config();\n options.name = options.name || currentConfig.name;\n options.storeName = options.storeName || currentConfig.storeName;\n }\n\n var self = this;\n var promise;\n if (!options.name) {\n promise = Promise$1.reject('Invalid arguments');\n } else {\n promise = new Promise$1(function (resolve) {\n if (!options.storeName) {\n resolve(options.name + '/');\n } else {\n resolve(_getKeyPrefix(options, self._defaultConfig));\n }\n }).then(function (keyPrefix) {\n for (var i = localStorage.length - 1; i >= 0; i--) {\n var key = localStorage.key(i);\n\n if (key.indexOf(keyPrefix) === 0) {\n localStorage.removeItem(key);\n }\n }\n });\n }\n\n executeCallback(promise, callback);\n return promise;\n}\n\nvar localStorageWrapper = {\n _driver: 'localStorageWrapper',\n _initStorage: _initStorage$2,\n _support: isLocalStorageValid(),\n iterate: iterate$2,\n getItem: getItem$2,\n setItem: setItem$2,\n removeItem: removeItem$2,\n clear: clear$2,\n length: length$2,\n key: key$2,\n keys: keys$2,\n dropInstance: dropInstance$2\n};\n\nvar sameValue = function sameValue(x, y) {\n return x === y || typeof x === 'number' && typeof y === 'number' && isNaN(x) && isNaN(y);\n};\n\nvar includes = function includes(array, searchElement) {\n var len = array.length;\n var i = 0;\n while (i < len) {\n if (sameValue(array[i], searchElement)) {\n return true;\n }\n i++;\n }\n\n return false;\n};\n\nvar isArray = Array.isArray || function (arg) {\n return Object.prototype.toString.call(arg) === '[object Array]';\n};\n\n// Drivers are stored here when `defineDriver()` is called.\n// They are shared across all instances of localForage.\nvar DefinedDrivers = {};\n\nvar DriverSupport = {};\n\nvar DefaultDrivers = {\n INDEXEDDB: asyncStorage,\n WEBSQL: webSQLStorage,\n LOCALSTORAGE: localStorageWrapper\n};\n\nvar DefaultDriverOrder = [DefaultDrivers.INDEXEDDB._driver, DefaultDrivers.WEBSQL._driver, DefaultDrivers.LOCALSTORAGE._driver];\n\nvar OptionalDriverMethods = ['dropInstance'];\n\nvar LibraryMethods = ['clear', 'getItem', 'iterate', 'key', 'keys', 'length', 'removeItem', 'setItem'].concat(OptionalDriverMethods);\n\nvar DefaultConfig = {\n description: '',\n driver: DefaultDriverOrder.slice(),\n name: 'localforage',\n // Default DB size is _JUST UNDER_ 5MB, as it's the highest size\n // we can use without a prompt.\n size: 4980736,\n storeName: 'keyvaluepairs',\n version: 1.0\n};\n\nfunction callWhenReady(localForageInstance, libraryMethod) {\n localForageInstance[libraryMethod] = function () {\n var _args = arguments;\n return localForageInstance.ready().then(function () {\n return localForageInstance[libraryMethod].apply(localForageInstance, _args);\n });\n };\n}\n\nfunction extend() {\n for (var i = 1; i < arguments.length; i++) {\n var arg = arguments[i];\n\n if (arg) {\n for (var _key in arg) {\n if (arg.hasOwnProperty(_key)) {\n if (isArray(arg[_key])) {\n arguments[0][_key] = arg[_key].slice();\n } else {\n arguments[0][_key] = arg[_key];\n }\n }\n }\n }\n }\n\n return arguments[0];\n}\n\nvar LocalForage = function () {\n function LocalForage(options) {\n _classCallCheck(this, LocalForage);\n\n for (var driverTypeKey in DefaultDrivers) {\n if (DefaultDrivers.hasOwnProperty(driverTypeKey)) {\n var driver = DefaultDrivers[driverTypeKey];\n var driverName = driver._driver;\n this[driverTypeKey] = driverName;\n\n if (!DefinedDrivers[driverName]) {\n // we don't need to wait for the promise,\n // since the default drivers can be defined\n // in a blocking manner\n this.defineDriver(driver);\n }\n }\n }\n\n this._defaultConfig = extend({}, DefaultConfig);\n this._config = extend({}, this._defaultConfig, options);\n this._driverSet = null;\n this._initDriver = null;\n this._ready = false;\n this._dbInfo = null;\n\n this._wrapLibraryMethodsWithReady();\n this.setDriver(this._config.driver)[\"catch\"](function () {});\n }\n\n // Set any config values for localForage; can be called anytime before\n // the first API call (e.g. `getItem`, `setItem`).\n // We loop through options so we don't overwrite existing config\n // values.\n\n\n LocalForage.prototype.config = function config(options) {\n // If the options argument is an object, we use it to set values.\n // Otherwise, we return either a specified config value or all\n // config values.\n if ((typeof options === 'undefined' ? 'undefined' : _typeof(options)) === 'object') {\n // If localforage is ready and fully initialized, we can't set\n // any new configuration values. Instead, we return an error.\n if (this._ready) {\n return new Error(\"Can't call config() after localforage \" + 'has been used.');\n }\n\n for (var i in options) {\n if (i === 'storeName') {\n options[i] = options[i].replace(/\\W/g, '_');\n }\n\n if (i === 'version' && typeof options[i] !== 'number') {\n return new Error('Database version must be a number.');\n }\n\n this._config[i] = options[i];\n }\n\n // after all config options are set and\n // the driver option is used, try setting it\n if ('driver' in options && options.driver) {\n return this.setDriver(this._config.driver);\n }\n\n return true;\n } else if (typeof options === 'string') {\n return this._config[options];\n } else {\n return this._config;\n }\n };\n\n // Used to define a custom driver, shared across all instances of\n // localForage.\n\n\n LocalForage.prototype.defineDriver = function defineDriver(driverObject, callback, errorCallback) {\n var promise = new Promise$1(function (resolve, reject) {\n try {\n var driverName = driverObject._driver;\n var complianceError = new Error('Custom driver not compliant; see ' + 'https://mozilla.github.io/localForage/#definedriver');\n\n // A driver name should be defined and not overlap with the\n // library-defined, default drivers.\n if (!driverObject._driver) {\n reject(complianceError);\n return;\n }\n\n var driverMethods = LibraryMethods.concat('_initStorage');\n for (var i = 0, len = driverMethods.length; i < len; i++) {\n var driverMethodName = driverMethods[i];\n\n // when the property is there,\n // it should be a method even when optional\n var isRequired = !includes(OptionalDriverMethods, driverMethodName);\n if ((isRequired || driverObject[driverMethodName]) && typeof driverObject[driverMethodName] !== 'function') {\n reject(complianceError);\n return;\n }\n }\n\n var configureMissingMethods = function configureMissingMethods() {\n var methodNotImplementedFactory = function methodNotImplementedFactory(methodName) {\n return function () {\n var error = new Error('Method ' + methodName + ' is not implemented by the current driver');\n var promise = Promise$1.reject(error);\n executeCallback(promise, arguments[arguments.length - 1]);\n return promise;\n };\n };\n\n for (var _i = 0, _len = OptionalDriverMethods.length; _i < _len; _i++) {\n var optionalDriverMethod = OptionalDriverMethods[_i];\n if (!driverObject[optionalDriverMethod]) {\n driverObject[optionalDriverMethod] = methodNotImplementedFactory(optionalDriverMethod);\n }\n }\n };\n\n configureMissingMethods();\n\n var setDriverSupport = function setDriverSupport(support) {\n if (DefinedDrivers[driverName]) {\n console.info('Redefining LocalForage driver: ' + driverName);\n }\n DefinedDrivers[driverName] = driverObject;\n DriverSupport[driverName] = support;\n // don't use a then, so that we can define\n // drivers that have simple _support methods\n // in a blocking manner\n resolve();\n };\n\n if ('_support' in driverObject) {\n if (driverObject._support && typeof driverObject._support === 'function') {\n driverObject._support().then(setDriverSupport, reject);\n } else {\n setDriverSupport(!!driverObject._support);\n }\n } else {\n setDriverSupport(true);\n }\n } catch (e) {\n reject(e);\n }\n });\n\n executeTwoCallbacks(promise, callback, errorCallback);\n return promise;\n };\n\n LocalForage.prototype.driver = function driver() {\n return this._driver || null;\n };\n\n LocalForage.prototype.getDriver = function getDriver(driverName, callback, errorCallback) {\n var getDriverPromise = DefinedDrivers[driverName] ? Promise$1.resolve(DefinedDrivers[driverName]) : Promise$1.reject(new Error('Driver not found.'));\n\n executeTwoCallbacks(getDriverPromise, callback, errorCallback);\n return getDriverPromise;\n };\n\n LocalForage.prototype.getSerializer = function getSerializer(callback) {\n var serializerPromise = Promise$1.resolve(localforageSerializer);\n executeTwoCallbacks(serializerPromise, callback);\n return serializerPromise;\n };\n\n LocalForage.prototype.ready = function ready(callback) {\n var self = this;\n\n var promise = self._driverSet.then(function () {\n if (self._ready === null) {\n self._ready = self._initDriver();\n }\n\n return self._ready;\n });\n\n executeTwoCallbacks(promise, callback, callback);\n return promise;\n };\n\n LocalForage.prototype.setDriver = function setDriver(drivers, callback, errorCallback) {\n var self = this;\n\n if (!isArray(drivers)) {\n drivers = [drivers];\n }\n\n var supportedDrivers = this._getSupportedDrivers(drivers);\n\n function setDriverToConfig() {\n self._config.driver = self.driver();\n }\n\n function extendSelfWithDriver(driver) {\n self._extend(driver);\n setDriverToConfig();\n\n self._ready = self._initStorage(self._config);\n return self._ready;\n }\n\n function initDriver(supportedDrivers) {\n return function () {\n var currentDriverIndex = 0;\n\n function driverPromiseLoop() {\n while (currentDriverIndex < supportedDrivers.length) {\n var driverName = supportedDrivers[currentDriverIndex];\n currentDriverIndex++;\n\n self._dbInfo = null;\n self._ready = null;\n\n return self.getDriver(driverName).then(extendSelfWithDriver)[\"catch\"](driverPromiseLoop);\n }\n\n setDriverToConfig();\n var error = new Error('No available storage method found.');\n self._driverSet = Promise$1.reject(error);\n return self._driverSet;\n }\n\n return driverPromiseLoop();\n };\n }\n\n // There might be a driver initialization in progress\n // so wait for it to finish in order to avoid a possible\n // race condition to set _dbInfo\n var oldDriverSetDone = this._driverSet !== null ? this._driverSet[\"catch\"](function () {\n return Promise$1.resolve();\n }) : Promise$1.resolve();\n\n this._driverSet = oldDriverSetDone.then(function () {\n var driverName = supportedDrivers[0];\n self._dbInfo = null;\n self._ready = null;\n\n return self.getDriver(driverName).then(function (driver) {\n self._driver = driver._driver;\n setDriverToConfig();\n self._wrapLibraryMethodsWithReady();\n self._initDriver = initDriver(supportedDrivers);\n });\n })[\"catch\"](function () {\n setDriverToConfig();\n var error = new Error('No available storage method found.');\n self._driverSet = Promise$1.reject(error);\n return self._driverSet;\n });\n\n executeTwoCallbacks(this._driverSet, callback, errorCallback);\n return this._driverSet;\n };\n\n LocalForage.prototype.supports = function supports(driverName) {\n return !!DriverSupport[driverName];\n };\n\n LocalForage.prototype._extend = function _extend(libraryMethodsAndProperties) {\n extend(this, libraryMethodsAndProperties);\n };\n\n LocalForage.prototype._getSupportedDrivers = function _getSupportedDrivers(drivers) {\n var supportedDrivers = [];\n for (var i = 0, len = drivers.length; i < len; i++) {\n var driverName = drivers[i];\n if (this.supports(driverName)) {\n supportedDrivers.push(driverName);\n }\n }\n return supportedDrivers;\n };\n\n LocalForage.prototype._wrapLibraryMethodsWithReady = function _wrapLibraryMethodsWithReady() {\n // Add a stub for each driver API method that delays the call to the\n // corresponding driver method until localForage is ready. These stubs\n // will be replaced by the driver methods as soon as the driver is\n // loaded, so there is no performance impact.\n for (var i = 0, len = LibraryMethods.length; i < len; i++) {\n callWhenReady(this, LibraryMethods[i]);\n }\n };\n\n LocalForage.prototype.createInstance = function createInstance(options) {\n return new LocalForage(options);\n };\n\n return LocalForage;\n}();\n\n// The actual localForage object that we expose as a module or via a\n// global. It's extended by pulling in one of our other libraries.\n\n\nvar localforage_js = new LocalForage();\n\nmodule.exports = localforage_js;\n\n},{\"3\":3}]},{},[4])(4)\n});\n", "export type Msg = ArrayBuffer | string | Uint8Array\n\nexport type CipherText = ArrayBuffer\nexport type SymmKey = CryptoKey\n\nexport type PublicKey = CryptoKey\nexport type PrivateKey = CryptoKey\n\nexport type Config = {\n type: CryptoSystem\n curve: EccCurve\n rsaSize: RsaSize\n symmAlg: SymmAlg\n symmLen: SymmKeyLength\n hashAlg: HashAlg\n charSize: CharSize\n storeName: string\n readKeyName: string\n writeKeyName: string\n}\n\nexport type SymmKeyOpts = {\n alg: SymmAlg\n length: SymmKeyLength\n iv: ArrayBuffer\n}\n\nexport enum CryptoSystem {\n ECC = 'ecc',\n RSA = 'rsa',\n}\n\nexport enum EccCurve {\n P_256 = 'P-256',\n P_384 = 'P-384',\n P_521 = 'P-521',\n}\n\nexport enum RsaSize {\n B1024 = 1024,\n B2048 = 2048,\n B4096 = 4096\n}\n\nexport enum SymmAlg {\n AES_CTR = 'AES-CTR',\n AES_CBC = 'AES-CBC',\n}\n\nexport enum SymmKeyLength {\n B128 = 128,\n B192 = 192,\n B256 = 256,\n}\n\nexport enum HashAlg {\n SHA_1 = 'SHA-1',\n SHA_256 = 'SHA-256',\n SHA_384 = 'SHA-384',\n SHA_512 = 'SHA-512',\n}\n\nexport enum CharSize {\n B8 = 8,\n B16 = 16,\n}\n\nexport enum KeyUse {\n Read = 'read',\n Write = 'write',\n}\n\nexport interface KeyStore {\n cfg: Config\n\n readKey: () => Promise<CryptoKeyPair>\n writeKey: () => Promise<CryptoKeyPair>\n getSymmKey: (keyName: string, cfg?: Partial<Config>) => Promise<CryptoKey>\n keyExists(keyName: string): Promise<boolean>\n deleteKey(keyName: string): Promise<void>\n destroy(): Promise<void>\n\n // Symmetric\n\n importSymmKey(\n keyStr: string,\n keyName: string,\n cfg?: Partial<Config>\n ): Promise<void>\n\n exportSymmKey(\n keyName: string,\n cfg?: Partial<Config>\n ): Promise<string>\n\n encryptWithSymmKey(\n msg: string,\n keyName: string,\n cfg?: Partial<Config>\n ): Promise<string>\n\n decryptWithSymmKey(\n cipherBytes: string,\n keyName: string,\n cfg?: Partial<Config>\n ): Promise<string>\n\n // Asymmetric\n\n sign(\n msg: string,\n cfg?: Partial<Config>\n ): Promise<string>\n\n verify(\n msg: string,\n sig: string,\n publicKey: string,\n cfg?: Partial<Config>\n ): Promise<boolean>\n\n encrypt(\n msg: string,\n publicKey: string,\n cfg?: Partial<Config>\n ): Promise<string>\n\n decrypt(\n cipherText: string,\n publicKey: string,\n cfg?: Partial<Config>\n ): Promise<string>\n\n publicReadKey(): Promise<string>\n publicWriteKey(): Promise<string>\n}\n", "import { KeyUse, CryptoSystem } from './types'\n\nexport const KeyDoesNotExist = new Error(\"Key does not exist. Make sure you properly instantiated the keystore.\")\nexport const NotKeyPair = new Error(\"Retrieved a symmetric key when an asymmetric keypair was expected. Please use a different key name.\")\nexport const NotKey = new Error(\"Retrieved an asymmetric keypair when an symmetric key was expected. Please use a different key name.\")\nexport const ECCNotEnabled = new Error(\"ECC is not enabled for this browser. Please use RSA instead.\")\nexport const UnsupportedCrypto = new Error(\"Cryptosystem not supported. Please use ECC or RSA\")\nexport const InvalidKeyUse = new Error(\"Invalid key use. Please use 'read' or 'write\")\n\nexport function checkIsKeyPair(keypair: any): CryptoKeyPair {\n if(!keypair || keypair === null) {\n throw KeyDoesNotExist\n } else if(keypair.privateKey === undefined) {\n throw NotKeyPair\n }\n return keypair as CryptoKeyPair\n}\n\nexport function checkIsKey(key: any): CryptoKey {\n if(!key || key === null) {\n throw KeyDoesNotExist\n } else if (key.privateKey !== undefined || key.algorithm === undefined) {\n throw NotKey\n }\n return key\n}\n\nexport function checkValidCryptoSystem(type: CryptoSystem): void {\n checkValid(type, [CryptoSystem.ECC, CryptoSystem.RSA], UnsupportedCrypto)\n}\n\nexport function checkValidKeyUse(use: KeyUse): void {\n checkValid(use, [KeyUse.Read, KeyUse.Write], InvalidKeyUse)\n}\n\nfunction checkValid<T>(toCheck: T, opts: T[], error: Error): void {\n const match = opts.some(opt => opt === toCheck)\n if(!match) {\n throw error\n }\n}\n\nexport default {\n KeyDoesNotExist,\n NotKeyPair,\n NotKey,\n ECCNotEnabled,\n UnsupportedCrypto,\n InvalidKeyUse,\n checkIsKeyPair,\n checkIsKey,\n checkValidCryptoSystem,\n checkValidKeyUse,\n}\n", "import localforage from 'localforage'\nimport { checkIsKeyPair, checkIsKey } from './errors'\n\n/* istanbul ignore next */\nexport function createStore(name: string): LocalForage {\n return localforage.createInstance({ name })\n}\n\nexport async function createIfDoesNotExist(id: string, makeFn: () => Promise<CryptoKeyPair | CryptoKey>, store: LocalForage = localforage): Promise<void> {\n if(await exists(id, store)) {\n return \n }\n const key = await makeFn()\n await put(id, key, store)\n}\n\n/* istanbul ignore next */\nexport async function put(id: string, key: CryptoKeyPair | CryptoKey, store: LocalForage = localforage): Promise<CryptoKeyPair | CryptoKey> {\n\treturn store.setItem(id, key)\n}\n\n/* istanbul ignore next */\nexport async function getKeypair(id: string, store: LocalForage = localforage): Promise<CryptoKeyPair | null> {\n return get(id, checkIsKeyPair, store)\n}\n\n/* istanbul ignore next */\nexport async function getKey(id: string, store: LocalForage = localforage): Promise<CryptoKey | null> {\n return get(id, checkIsKey, store)\n}\n\n/* istanbul ignore next */\nexport async function get<T>(id: string, checkFn: (obj: unknown) => T | null, store: LocalForage = localforage) {\n const item = await store.getItem(id)\n return item === null ? null : checkFn(item)\n}\n\n/* istanbul ignore next */\nexport async function exists(id: string, store: LocalForage = localforage): Promise<boolean> {\n const key = await store.getItem(id)\n return key !== null\n}\n\n/* istanbul ignore next */\nexport async function rm(id: string, store: LocalForage = localforage): Promise<void> {\n return store.removeItem(id)\n}\n\nexport async function dropStore(store: LocalForage): Promise<void> {\n return store.dropInstance()\n}\n\n/* istanbul ignore next */\nexport async function clear(store?: LocalForage): Promise<void> {\n if(store){\n return dropStore(store)\n }else {\n return localforage.clear()\n }\n}\n\nexport default {\n createStore,\n createIfDoesNotExist,\n put,\n getKeypair,\n\tgetKey,\n exists,\n rm,\n dropStore,\n\tclear\n}\n", "export default (typeof global !== \"undefined\" ? global :\n typeof self !== \"undefined\" ? self :\n typeof window !== \"undefined\" ? window : {});", "var lookup = [];\nvar revLookup = [];\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;\nvar inited = false;\nfunction init () {\n inited = true;\n var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';\n for (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i];\n revLookup[code.charCodeAt(i)] = i;\n }\n\n revLookup['-'.charCodeAt(0)] = 62;\n revLookup['_'.charCodeAt(0)] = 63;\n}\n\nfunction toByteArray (b64) {\n if (!inited) {\n init();\n }\n var i, j, l, tmp, placeHolders, arr;\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 // the number of equal signs (place holders)\n // if there are two placeholders, than the two characters before it\n // represent one byte\n // if there is only one, then the three characters before it represent 2 bytes\n // this is just a cheap hack to not do indexOf twice\n placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0;\n\n // base64 is 4/3 + up to two characters of the original data\n arr = new Arr(len * 3 / 4 - placeHolders);\n\n // if there are placeholders, only get up to the last complete 4 chars\n l = placeHolders > 0 ? len - 4 : len;\n\n var L = 0;\n\n for (i = 0, j = 0; i < l; i += 4, j += 3) {\n tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)];\n arr[L++] = (tmp >> 16) & 0xFF;\n arr[L++] = (tmp >> 8) & 0xFF;\n arr[L++] = tmp & 0xFF;\n }\n\n if (placeHolders === 2) {\n tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4);\n arr[L++] = tmp & 0xFF;\n } else if (placeHolders === 1) {\n tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2);\n arr[L++] = (tmp >> 8) & 0xFF;\n arr[L++] = tmp & 0xFF;\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + 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 = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]);\n output.push(tripletToBase64(tmp));\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n if (!inited) {\n init();\n }\n var tmp;\n var len = uint8.length;\n var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes\n var output = '';\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 output += lookup[tmp >> 2];\n output += lookup[(tmp << 4) & 0x3F];\n output += '==';\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + (uint8[len - 1]);\n output += lookup[tmp >> 10];\n output += lookup[(tmp >> 4) & 0x3F];\n output += lookup[(tmp << 2) & 0x3F];\n output += '=';\n }\n\n parts.push(output);\n\n return parts.join('')\n}\n\nfunction read (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\nfunction write (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\nvar toString = {}.toString;\n\nvar isArray = Array.isArray || function (arr) {\n return toString.call(arr) == '[object Array]';\n};\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>\n * @license MIT\n */\n\nvar INSPECT_MAX_BYTES = 50;\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Use Object implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * Due to various browser bugs, sometimes the Object implementation will be used even\n * when the browser supports typed arrays.\n *\n * Note:\n *\n * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n *\n * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n *\n * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n * incorrect length in some situations.\n\n * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n * get the Object implementation, which is slower but behaves correctly.\n */\nBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n ? global.TYPED_ARRAY_SUPPORT\n : true;\n\n/*\n * Export kMaxLength after typed array support is determined.\n */\nvar _kMaxLength = kMaxLength();\n\nfunction kMaxLength () {\n return Buffer.TYPED_ARRAY_SUPPORT\n ? 0x7fffffff\n : 0x3fffffff\n}\n\nfunction createBuffer (that, length) {\n if (kMaxLength() < length) {\n throw new RangeError('Invalid typed array length')\n }\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = new Uint8Array(length);\n that.__proto__ = Buffer.prototype;\n } else {\n // Fallback: Return an object instance of the Buffer class\n if (that === null) {\n that = new Buffer(length);\n }\n that.length = length;\n }\n\n return that\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 if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n return new Buffer(arg, encodingOrOffset, length)\n }\n\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new Error(\n 'If encoding is specified then the first argument must be a string'\n )\n }\n return allocUnsafe(this, arg)\n }\n return from(this, arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192; // not used by this implementation\n\n// TODO: Legacy, not needed anymore. Remove in next major version.\nBuffer._augment = function (arr) {\n arr.__proto__ = Buffer.prototype;\n return arr\n};\n\nfunction from (that, value, encodingOrOffset, length) {\n if (typeof value === 'number') {\n throw new TypeError('\"value\" argument must not be a number')\n }\n\n if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n return fromArrayBuffer(that, value, encodingOrOffset, length)\n }\n\n if (typeof value === 'string') {\n return fromString(that, value, encodingOrOffset)\n }\n\n return fromObject(that, value)\n}\n\n/**\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(null, value, encodingOrOffset, length)\n};\n\nif (Buffer.TYPED_ARRAY_SUPPORT) {\n Buffer.prototype.__proto__ = Uint8Array.prototype;\n Buffer.__proto__ = Uint8Array;\n}\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n } else if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n}\n\nfunction alloc (that, size, fill, encoding) {\n assertSize(size);\n if (size <= 0) {\n return createBuffer(that, 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 interpretted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(that, size).fill(fill, encoding)\n : createBuffer(that, size).fill(fill)\n }\n return createBuffer(that, 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(null, size, fill, encoding)\n};\n\nfunction allocUnsafe (that, size) {\n assertSize(size);\n that = createBuffer(that, size < 0 ? 0 : checked(size) | 0);\n if (!Buffer.TYPED_ARRAY_SUPPORT) {\n for (var i = 0; i < size; ++i) {\n that[i] = 0;\n }\n }\n return that\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(null, 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(null, size)\n};\n\nfunction fromString (that, string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8';\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('\"encoding\" must be a valid string encoding')\n }\n\n var length = byteLength(string, encoding) | 0;\n that = createBuffer(that, length);\n\n var actual = that.write(string, encoding);\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n that = that.slice(0, actual);\n }\n\n return that\n}\n\nfunction fromArrayLike (that, array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0;\n that = createBuffer(that, length);\n for (var i = 0; i < length; i += 1) {\n that[i] = array[i] & 255;\n }\n return that\n}\n\nfunction fromArrayBuffer (that, array, byteOffset, length) {\n array.byteLength; // this throws if `array` is not a valid ArrayBuffer\n\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\\'offset\\' is out of bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\\'length\\' is out of bounds')\n }\n\n if (byteOffset === undefined && length === undefined) {\n array = new Uint8Array(array);\n } else if (length === undefined) {\n array = new Uint8Array(array, byteOffset);\n } else {\n array = new Uint8Array(array, byteOffset, length);\n }\n\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n // Return an augmented `Uint8Array` instance, for best performance\n that = array;\n that.__proto__ = Buffer.prototype;\n } else {\n // Fallback: Return an object instance of the Buffer class\n that = fromArrayLike(that, array);\n }\n return that\n}\n\nfunction fromObject (that, obj) {\n if (internalIsBuffer(obj)) {\n var len = checked(obj.length) | 0;\n that = createBuffer(that, len);\n\n if (that.length === 0) {\n return that\n }\n\n obj.copy(that, 0, 0, len);\n return that\n }\n\n if (obj) {\n if ((typeof ArrayBuffer !== 'undefined' &&\n obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n if (typeof obj.length !== 'number' || isnan(obj.length)) {\n return createBuffer(that, 0)\n }\n return fromArrayLike(that, obj)\n }\n\n if (obj.type === 'Buffer' && isArray(obj.data)) {\n return fromArrayLike(that, obj.data)\n }\n }\n\n throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n}\n\nfunction checked (length) {\n // Note: cannot use `length < kMaxLength()` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= kMaxLength()) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + kMaxLength().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}\nBuffer.isBuffer = isBuffer;\nfunction internalIsBuffer (b) {\n return !!(b != null && b._isBuffer)\n}\n\nBuffer.compare = function compare (a, b) {\n if (!internalIsBuffer(a) || !internalIsBuffer(b)) {\n throw new TypeError('Arguments must be Buffers')\n }\n\n if (a === b) return 0\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) 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 (!isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n var i;\n if (length === undefined) {\n length = 0;\n for (i = 0; i < list.length; ++i) {\n length += list[i].length;\n }\n }\n\n var buffer = Buffer.allocUnsafe(length);\n var pos = 0;\n for (i = 0; i < list.length; ++i) {\n var buf = list[i];\n if (!internalIsBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n buf.copy(buffer, pos);\n pos += buf.length;\n }\n return buffer\n};\n\nfunction byteLength (string, encoding) {\n if (internalIsBuffer(string)) {\n return string.length\n }\n if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n string = '' + string;\n }\n\n var len = string.length;\n if (len === 0) return 0\n\n // Use a for loop to avoid recursion\n var 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 case undefined:\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) return utf8ToBytes(string).length // assume utf8\n encoding = ('' + encoding).toLowerCase();\n loweredCase = true;\n }\n }\n}\nBuffer.byteLength = byteLength;\n\nfunction slowToString (encoding, start, end) {\n var 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 coersion 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// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n// Buffer instances.\nBuffer.prototype._isBuffer = true;\n\nfunction swap (b, n, m) {\n var i = b[n];\n b[n] = b[m];\n b[m] = i;\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n var len = this.length;\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (var i = 0; i < len; i += 2) {\n swap(this, i, i + 1);\n }\n return this\n};\n\nBuffer.prototype.swap32 = function swap32 () {\n var len = this.length;\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (var i = 0; i < len; i += 4) {\n swap(this, i, i + 3);\n swap(this, i + 1, i + 2);\n }\n return this\n};\n\nBuffer.prototype.swap64 = function swap64 () {\n var len = this.length;\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (var i = 0; i < len; i += 8) {\n swap(this, i, i + 7);\n swap(this, i + 1, i + 6);\n swap(this, i + 2, i + 5);\n swap(this, i + 3, i + 4);\n }\n return this\n};\n\nBuffer.prototype.toString = function toString () {\n var length = this.length | 0;\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n};\n\nBuffer.prototype.equals = function equals (b) {\n if (!internalIsBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n};\n\nBuffer.prototype.inspect = function inspect () {\n var str = '';\n var max = INSPECT_MAX_BYTES;\n if (this.length > 0) {\n str = this.toString('hex', 0, max).match(/.{2}/g).join(' ');\n if (this.length > max) str += ' ... ';\n }\n return '<Buffer ' + str + '>'\n};\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (!internalIsBuffer(target)) {\n throw new TypeError('Argument must be a Buffer')\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 var x = thisEnd - thisStart;\n var y = end - start;\n var len = Math.min(x, y);\n\n var thisCopy = this.slice(thisStart, thisEnd);\n var targetCopy = target.slice(start, end);\n\n for (var i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i];\n y = targetCopy[i];\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n};\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 (isNaN(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 (internalIsBuffer(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 (Buffer.TYPED_ARRAY_SUPPORT &&\n 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 var indexSize = 1;\n var arrLength = arr.length;\n var 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 var i;\n if (dir) {\n var 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 var found = true;\n for (var j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false;\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n};\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n};\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n};\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0;\n var remaining = buf.length - offset;\n if (!length) {\n length = remaining;\n } else {\n length = Number(length);\n if (length > remaining) {\n length = remaining;\n }\n }\n\n // must be an even number of digits\n var strLen = string.length;\n if (strLen % 2 !== 0) throw new TypeError('Invalid hex string')\n\n if (length > strLen / 2) {\n length = strLen / 2;\n }\n for (var i = 0; i < length; ++i) {\n var parsed = parseInt(string.substr(i * 2, 2), 16);\n if (isNaN(parsed)) return i\n buf[offset + i] = parsed;\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8';\n length = this.length;\n offset = 0;\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 // legacy write(string, encoding, offset, length) - remove in v0.13\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n var remaining = this.length - offset;\n if (length === undefined || length > remaining) length = remaining;\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8';\n\n var 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 return asciiWrite(this, string, offset, length)\n\n case 'latin1':\n case 'binary':\n return latin1Write(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase();\n loweredCase = true;\n }\n }\n};\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n};\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return fromByteArray(buf)\n } else {\n return fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end);\n var res = [];\n\n var i = start;\n while (i < end) {\n var firstByte = buf[i];\n var codePoint = null;\n var bytesPerSequence = (firstByte > 0xEF) ? 4\n : (firstByte > 0xDF) ? 3\n : (firstByte > 0xBF) ? 2\n : 1;\n\n if (i + bytesPerSequence <= end) {\n var secondByte, thirdByte, fourthByte, tempCodePoint;\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte;\n }\n 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\nvar MAX_ARGUMENTS_LENGTH = 0x1000;\n\nfunction decodeCodePointsArray (codePoints) {\n var 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 var res = '';\n var 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 var ret = '';\n end = Math.min(buf.length, end);\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F);\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n var ret = '';\n end = Math.min(buf.length, end);\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i]);\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n var len = buf.length;\n\n if (!start || start < 0) start = 0;\n if (!end || end < 0 || end > len) end = len;\n\n var out = '';\n for (var i = start; i < end; ++i) {\n out += toHex(buf[i]);\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n var bytes = buf.slice(start, end);\n var res = '';\n for (var i = 0; i < bytes.length; 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 var len = this.length;\n start = ~~start;\n end = end === undefined ? len : ~~end;\n\n if (start < 0) {\n start += len;\n if (start < 0) start = 0;\n } else if (start > len) {\n start = len;\n }\n\n if (end < 0) {\n end += len;\n if (end < 0) end = 0;\n } else if (end > len) {\n end = len;\n }\n\n if (end < start) end = start;\n\n var newBuf;\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n newBuf = this.subarray(start, end);\n newBuf.__proto__ = Buffer.prototype;\n } else {\n var sliceLen = end - start;\n newBuf = new Buffer(sliceLen, undefined);\n for (var i = 0; i < sliceLen; ++i) {\n newBuf[i] = this[i + start];\n }\n }\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 = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n var val = this[offset];\n var mul = 1;\n var i = 0;\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul;\n }\n\n return val\n};\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length);\n }\n\n var val = this[offset + --byteLength];\n var mul = 1;\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul;\n }\n\n return val\n};\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 1, this.length);\n return this[offset]\n};\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n return this[offset] | (this[offset + 1] << 8)\n};\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n return (this[offset] << 8) | this[offset + 1]\n};\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n};\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\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.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n var val = this[offset];\n var mul = 1;\n var 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 var i = byteLength;\n var mul = 1;\n var 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 if (!noAssert) checkOffset(offset, 1, this.length);\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n};\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n var val = this[offset] | (this[offset + 1] << 8);\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n};\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 2, this.length);\n var val = this[offset + 1] | (this[offset] << 8);\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n};\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n\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 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.readFloatLE = function readFloatLE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return read(this, offset, true, 23, 4)\n};\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 4, this.length);\n return read(this, offset, false, 23, 4)\n};\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length);\n return read(this, offset, true, 52, 8)\n};\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n if (!noAssert) checkOffset(offset, 8, this.length);\n return read(this, offset, false, 52, 8)\n};\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!internalIsBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1;\n checkInt(this, value, offset, byteLength, maxBytes, 0);\n }\n\n var mul = 1;\n var i = 0;\n this[offset] = value & 0xFF;\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF;\n }\n\n return offset + byteLength\n};\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n byteLength = byteLength | 0;\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1;\n checkInt(this, value, offset, byteLength, maxBytes, 0);\n }\n\n var i = byteLength - 1;\n var mul = 1;\n this[offset + i] = value & 0xFF;\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF;\n }\n\n return offset + byteLength\n};\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);\n if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);\n this[offset] = (value & 0xff);\n return offset + 1\n};\n\nfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffff + value + 1;\n for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) {\n buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n (littleEndian ? i : 1 - i) * 8;\n }\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff);\n this[offset + 1] = (value >>> 8);\n } else {\n objectWriteUInt16(this, value, offset, true);\n }\n return offset + 2\n};\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 8);\n this[offset + 1] = (value & 0xff);\n } else {\n objectWriteUInt16(this, value, offset, false);\n }\n return offset + 2\n};\n\nfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n if (value < 0) value = 0xffffffff + value + 1;\n for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) {\n buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff;\n }\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset + 3] = (value >>> 24);\n this[offset + 2] = (value >>> 16);\n this[offset + 1] = (value >>> 8);\n this[offset] = (value & 0xff);\n } else {\n objectWriteUInt32(this, value, offset, true);\n }\n return offset + 4\n};\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 24);\n this[offset + 1] = (value >>> 16);\n this[offset + 2] = (value >>> 8);\n this[offset + 3] = (value & 0xff);\n } else {\n objectWriteUInt32(this, value, offset, false);\n }\n return offset + 4\n};\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1);\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit);\n }\n\n var i = 0;\n var mul = 1;\n var sub = 0;\n this[offset] = value & 0xFF;\n 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 var limit = Math.pow(2, 8 * byteLength - 1);\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit);\n }\n\n var i = byteLength - 1;\n var mul = 1;\n var sub = 0;\n this[offset + i] = value & 0xFF;\n 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 (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value);\n if (value < 0) value = 0xff + value + 1;\n this[offset] = (value & 0xff);\n return offset + 1\n};\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value;\n offset = offset | 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff);\n this[offset + 1] = (value >>> 8);\n } else {\n objectWriteUInt16(this, value, offset, true);\n }\n 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 if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 8);\n this[offset + 1] = (value & 0xff);\n } else {\n objectWriteUInt16(this, value, offset, false);\n }\n 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 if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value & 0xff);\n this[offset + 1] = (value >>> 8);\n this[offset + 2] = (value >>> 16);\n this[offset + 3] = (value >>> 24);\n } else {\n objectWriteUInt32(this, value, offset, true);\n }\n 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 if (Buffer.TYPED_ARRAY_SUPPORT) {\n this[offset] = (value >>> 24);\n this[offset + 1] = (value >>> 16);\n this[offset + 2] = (value >>> 8);\n this[offset + 3] = (value & 0xff);\n } else {\n objectWriteUInt32(this, value, offset, false);\n }\n return offset + 4\n};\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4);\n }\n write(buf, value, offset, littleEndian, 23, 4);\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n};\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n};\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8);\n }\n 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 (!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('sourceStart out of bounds')\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 var len = end - start;\n var i;\n\n if (this === target && start < targetStart && targetStart < end) {\n // descending copy from end\n for (i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start];\n }\n } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n // ascending copy from start\n for (i = 0; i < len; ++i) {\n target[i + targetStart] = this[i + start];\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, start + len),\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 (val.length === 1) {\n var code = val.charCodeAt(0);\n if (code < 256) {\n val = code;\n }\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 } else if (typeof val === 'number') {\n val = val & 255;\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 var i;\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val;\n }\n } else {\n var bytes = internalIsBuffer(val)\n ? val\n : utf8ToBytes(new Buffer(val, encoding).toString());\n var len = bytes.length;\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len];\n }\n }\n\n return this\n};\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g;\n\nfunction base64clean (str) {\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = stringtrim(str).replace(INVALID_BASE64_RE, '');\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 stringtrim (str) {\n if (str.trim) return str.trim()\n return str.replace(/^\\s+|\\s+$/g, '')\n}\n\nfunction toHex (n) {\n if (n < 16) return '0' + n.toString(16)\n return n.toString(16)\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity;\n var codePoint;\n var length = string.length;\n var leadSurrogate = null;\n var bytes = [];\n\n for (var i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i);\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 var byteArray = [];\n for (var i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF);\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n var c, hi, lo;\n var byteArray = [];\n for (var 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\n\nfunction base64ToBytes (str) {\n return toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n for (var i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i];\n }\n return i\n}\n\nfunction isnan (val) {\n return val !== val // eslint-disable-line no-self-compare\n}\n\n\n// the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence\n// The _isBuffer check is for Safari 5-7 support, because it's missing\n// Object.prototype.constructor. Remove this eventually\nfunction isBuffer(obj) {\n return obj != null && (!!obj._isBuffer || isFastBuffer(obj) || isSlowBuffer(obj))\n}\n\nfunction isFastBuffer (obj) {\n return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)\n}\n\n// For Node v0.10 support. Remove this eventually.\nfunction isSlowBuffer (obj) {\n return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isFastBuffer(obj.slice(0, 0))\n}\n\nexport { Buffer, INSPECT_MAX_BYTES, SlowBuffer, isBuffer, _kMaxLength as kMaxLength };\n", "import { CharSize, Msg } from './types'\nimport { Buffer } from 'buffer'\n\nexport function arrBufToStr(buf: ArrayBuffer, charSize: CharSize): string {\n const arr = charSize === 8 ? new Uint8Array(buf) : new Uint16Array(buf)\n return Array.from(arr)\n .map(b => String.fromCharCode(b))\n .join('')\n}\n\nexport function arrBufToBase64(buf: ArrayBuffer): string {\n const str = arrBufToStr(buf, 8)\n return Buffer.from(str, 'binary').toString('base64')\n}\n\nexport function strToArrBuf(str: string, charSize: CharSize): ArrayBuffer {\n const view =\n charSize === 8 ? new Uint8Array(str.length) : new Uint16Array(str.length)\n for (let i = 0, strLen = str.length; i < strLen; i++) {\n view[i] = str.charCodeAt(i)\n }\n return view.buffer\n}\n\nexport function base64ToArrBuf(base64: string): ArrayBuffer {\n const str = Buffer.from(base64, 'base64').toString('binary')\n return strToArrBuf(str, 8)\n}\n\nexport function publicExponent(): Uint8Array {\n return new Uint8Array([0x01, 0x00, 0x01])\n}\n\nexport function randomBuf(length: number): ArrayBuffer {\n const arr = new Uint8Array(length)\n globalThis.crypto.getRandomValues(arr)\n return arr.buffer\n}\n\nexport function joinBufs(fst: ArrayBuffer, snd: ArrayBuffer): ArrayBuffer {\n const view1 = new Uint8Array(fst)\n const view2 = new Uint8Array(snd)\n const joined = new Uint8Array(view1.length + view2.length)\n joined.set(view1)\n joined.set(view2, view1.length)\n return joined.buffer\n}\n\nexport const normalizeUtf8ToBuf = (msg: Msg): ArrayBuffer => {\n return normalizeToBuf(msg, (str) => strToArrBuf(str, CharSize.B8))\n}\n\nexport const normalizeUtf16ToBuf = (msg: Msg): ArrayBuffer => {\n return normalizeToBuf(msg, (str) => strToArrBuf(str, CharSize.B16))\n}\n\nexport const normalizeBase64ToBuf = (msg: Msg): ArrayBuffer => {\n return normalizeToBuf(msg, base64ToArrBuf)\n}\n\nexport const normalizeUnicodeToBuf = (msg: Msg, charSize: CharSize) => {\n switch (charSize) {\n case 8: return normalizeUtf8ToBuf(msg)\n default: return normalizeUtf16ToBuf(msg)\n }\n}\n\nexport const normalizeToBuf = (msg: Msg, strConv: (str: string) => ArrayBuffer): ArrayBuffer => {\n if (typeof msg === 'string') {\n return strConv(msg)\n } else if (typeof msg === 'object' && msg.byteLength !== undefined) {\n // this is the best runtime check I could find for ArrayBuffer/Uint8Array\n const temp = new Uint8Array(msg)\n return temp.buffer\n } else {\n throw new Error(\"Improper value. Must be a string, ArrayBuffer, Uint8Array\")\n }\n}\n\n/* istanbul ignore next */\nexport async function structuralClone(obj: any) {\n return new Promise(resolve => {\n const { port1, port2 } = new MessageChannel()\n port2.onmessage = ev => resolve(ev.data)\n port1.postMessage(obj)\n })\n}\n\nexport default {\n arrBufToStr,\n arrBufToBase64,\n strToArrBuf,\n base64ToArrBuf,\n publicExponent,\n randomBuf,\n joinBufs,\n normalizeUtf8ToBuf,\n normalizeUtf16ToBuf,\n normalizeBase64ToBuf,\n normalizeToBuf,\n structuralClone\n}\n", "import { EccCurve, RsaSize, SymmAlg, SymmKeyLength, HashAlg, CharSize } from './types'\n\nexport const ECC_READ_ALG = 'ECDH'\nexport const ECC_WRITE_ALG = 'ECDSA'\nexport const RSA_READ_ALG = 'RSA-OAEP'\nexport const RSA_WRITE_ALG = 'RSASSA-PKCS1-v1_5'\nexport const SALT_LENGTH = 128\n\nexport const DEFAULT_CRYPTOSYSTEM = 'ecc'\nexport const DEFAULT_ECC_CURVE = EccCurve.P_256\nexport const DEFAULT_RSA_SIZE = RsaSize.B2048\n\nexport const DEFAULT_SYMM_ALG = SymmAlg.AES_CTR\nexport const DEFAULT_SYMM_LEN = SymmKeyLength.B256\nexport const DEFAULT_CTR_LEN = 64\n\nexport const DEFAULT_HASH_ALG = HashAlg.SHA_256\nexport const DEFAULT_CHAR_SIZE = CharSize.B16\n\nexport const DEFAULT_STORE_NAME = 'keystore'\nexport const DEFAULT_READ_KEY_NAME = 'read-key'\nexport const DEFAULT_WRITE_KEY_NAME = 'write-key'\n\nexport default {\n ECC_READ_ALG,\n ECC_WRITE_ALG,\n RSA_READ_ALG,\n RSA_WRITE_ALG,\n SALT_LENGTH,\n DEFAULT_CRYPTOSYSTEM,\n DEFAULT_ECC_CURVE,\n DEFAULT_RSA_SIZE,\n DEFAULT_SYMM_ALG,\n DEFAULT_CTR_LEN,\n DEFAULT_HASH_ALG,\n DEFAULT_CHAR_SIZE,\n DEFAULT_STORE_NAME,\n DEFAULT_READ_KEY_NAME,\n DEFAULT_WRITE_KEY_NAME,\n}\n", "import utils from '../utils'\nimport { ECC_READ_ALG, ECC_WRITE_ALG } from '../constants'\nimport { EccCurve, KeyUse, PublicKey } from '../types'\nimport { checkValidKeyUse } from '../errors'\n\nexport async function makeKeypair(\n curve: EccCurve,\n use: KeyUse\n): Promise<CryptoKeyPair> {\n checkValidKeyUse(use)\n const alg = use === KeyUse.Read ? ECC_READ_ALG : ECC_WRITE_ALG\n const uses: KeyUsage[] =\n use === KeyUse.Read ? ['deriveKey', 'deriveBits'] : ['sign', 'verify']\n return globalThis.crypto.subtle.generateKey(\n { name: alg, namedCurve: curve },\n false,\n uses\n )\n}\n\nexport async function importPublicKey(base64Key: string, curve: EccCurve, use: KeyUse): Promise<PublicKey> {\n checkValidKeyUse(use)\n const alg = use === KeyUse.Read ? ECC_READ_ALG : ECC_WRITE_ALG\n const uses: KeyUsage[] =\n use === KeyUse.Read ? [] : ['verify']\n const buf = utils.base64ToArrBuf(base64Key)\n return globalThis.crypto.subtle.importKey(\n 'raw',\n buf,\n { name: alg, namedCurve: curve },\n true,\n uses\n )\n}\n\nexport default {\n makeKeypair,\n importPublicKey\n}\n", "import utils from '../utils'\nimport { DEFAULT_SYMM_ALG, DEFAULT_SYMM_LEN } from '../constants'\nimport { SymmKey, SymmKeyOpts } from '../types'\n\nexport async function makeKey(opts?: Partial<SymmKeyOpts>): Promise<SymmKey> {\n return globalThis.crypto.subtle.generateKey(\n { \n name: opts?.alg || DEFAULT_SYMM_ALG,\n length: opts?.length || DEFAULT_SYMM_LEN,\n },\n true,\n ['encrypt', 'decrypt']\n )\n}\n\nexport async function importKey(base64key: string, opts?: Partial<SymmKeyOpts>): Promise<SymmKey> {\n const buf = utils.base64ToArrBuf(base64key)\n return globalThis.crypto.subtle.importKey(\n 'raw',\n buf,\n { \n name: opts?.alg || DEFAULT_SYMM_ALG,\n length: opts?.length || DEFAULT_SYMM_LEN,\n },\n true,\n ['encrypt', 'decrypt']\n )\n}\n\nexport default {\n makeKey,\n importKey,\n}\n", "import keys from './keys'\nimport utils from '../utils'\nimport { DEFAULT_SYMM_ALG, DEFAULT_CTR_LEN } from '../constants'\nimport { SymmKey, SymmKeyOpts, SymmAlg, CipherText, Msg } from '../types'\n\nexport async function encryptBytes(\n msg: Msg,\n key: SymmKey | string,\n opts?: Partial<SymmKeyOpts>\n): Promise<CipherText> {\n const data = utils.normalizeUtf16ToBuf(msg)\n const importedKey = typeof key === 'string' ? await keys.importKey(key, opts) : key\n const alg = opts?.alg || DEFAULT_SYMM_ALG\n const iv = opts?.iv || utils.randomBuf(16)\n const cipherBuf = await globalThis.crypto.subtle.encrypt(\n { \n name: alg,\n // AES-CTR uses a counter, AES-GCM/AES-CBC use an initialization vector\n iv: alg === SymmAlg.AES_CTR ? undefined : iv,\n counter: alg === SymmAlg.AES_CTR ? new Uint8Array(iv) : undefined,\n length: alg === SymmAlg.AES_CTR ? DEFAULT_CTR_LEN : undefined,\n },\n importedKey,\n data\n )\n return utils.joinBufs(iv, cipherBuf)\n}\n\nexport async function decryptBytes(\n msg: Msg,\n key: SymmKey | string,\n opts?: Partial<SymmKeyOpts>\n): Promise<ArrayBuffer> {\n const cipherText = utils.normalizeBase64ToBuf(msg)\n const importedKey = typeof key === 'string' ? await keys.importKey(key, opts) : key\n const alg = opts?.alg || DEFAULT_SYMM_ALG\n const iv = cipherText.slice(0, 16)\n const cipherBytes = cipherText.slice(16)\n const msgBuff = await globalThis.crypto.subtle.decrypt(\n { name: alg,\n // AES-CTR uses a counter, AES-GCM/AES-CBC use an initialization vector\n iv: alg === SymmAlg.AES_CTR ? undefined : iv,\n counter: alg === SymmAlg.AES_CTR ? new Uint8Array(iv) : undefined,\n length: alg === SymmAlg.AES_CTR ? DEFAULT_CTR_LEN : undefined,\n },\n importedKey,\n cipherBytes\n )\n return msgBuff\n}\n\nexport async function encrypt(\n msg: Msg,\n key: SymmKey | string,\n opts?: Partial<SymmKeyOpts>\n): Promise<string> {\n const cipherText = await encryptBytes(msg, key, opts)\n return utils.arrBufToBase64(cipherText)\n}\n\nexport async function decrypt(\n msg: Msg,\n key: SymmKey | string,\n opts?: Partial<SymmKeyOpts>\n): Promise<string> {\n const msgBytes = await decryptBytes(msg, key, opts)\n return utils.arrBufToStr(msgBytes, 16)\n}\n\n\nexport async function exportKey(key: SymmKey): Promise<string> {\n const raw = await globalThis.crypto.subtle.exportKey('raw', key)\n return utils.arrBufToBase64(raw)\n}\n\nexport default {\n encryptBytes,\n decryptBytes,\n encrypt,\n decrypt,\n exportKey\n}\n", "import keys from './keys'\nimport operations from './operations'\n\nexport * from './keys'\nexport * from './operations'\n\nexport default {\n ...keys,\n ...operations,\n}\n", "import aes from '../aes'\nimport keys from './keys'\nimport utils, { normalizeBase64ToBuf, normalizeUnicodeToBuf } from '../utils'\nimport { DEFAULT_CHAR_SIZE, DEFAULT_ECC_CURVE, DEFAULT_HASH_ALG, ECC_READ_ALG, ECC_WRITE_ALG, DEFAULT_SYMM_ALG, DEFAULT_SYMM_LEN } from '../constants'\nimport { CharSize, EccCurve, Msg, PrivateKey, PublicKey, HashAlg, KeyUse, SymmKey, SymmKeyOpts } from '../types'\n\n\nexport async function sign(\n msg: Msg,\n privateKey: PrivateKey,\n charSize: CharSize = DEFAULT_CHAR_SIZE,\n hashAlg: HashAlg = DEFAULT_HASH_ALG,\n): Promise<ArrayBuffer> {\n return globalThis.crypto.subtle.sign(\n { name: ECC_WRITE_ALG, hash: { name: hashAlg }},\n privateKey,\n normalizeUnicodeToBuf(msg, charSize)\n )\n}\n\nexport async function verify(\n msg: Msg,\n sig: Msg,\n publicKey: string | PublicKey,\n charSize: CharSize = DEFAULT_CHAR_SIZE,\n curve: EccCurve = DEFAULT_ECC_CURVE,\n hashAlg: HashAlg = DEFAULT_HASH_ALG\n): Promise<boolean> {\n return globalThis.crypto.subtle.verify(\n { name: ECC_WRITE_ALG, hash: { name: hashAlg }},\n typeof publicKey === \"string\"\n ? await keys.importPublicKey(publicKey, curve, KeyUse.Write)\n : publicKey,\n normalizeBase64ToBuf(sig),\n normalizeUnicodeToBuf(msg, charSize)\n )\n}\n\nexport async function encrypt(\n msg: Msg,\n privateKey: PrivateKey,\n publicKey: string | PublicKey,\n charSize: CharSize = DEFAULT_CHAR_SIZE,\n curve: EccCurve = DEFAULT_ECC_CURVE,\n opts?: Partial<SymmKeyOpts>\n): Promise<ArrayBuffer> {\n const importedPublicKey = typeof publicKey === \"string\"\n ? await keys.importPublicKey(publicKey, curve, KeyUse.Read)\n : publicKey\n\n const cipherKey = await getSharedKey(privateKey, importedPublicKey, opts)\n return aes.encryptBytes(normalizeUnicodeToBuf(msg, charSize), cipherKey, opts)\n}\n\nexport async function decrypt(\n msg: Msg,\n privateKey: PrivateKey,\n publicKey: string | PublicKey,\n curve: EccCurve = DEFAULT_ECC_CURVE,\n opts?: Partial<SymmKeyOpts>\n): Promise<ArrayBuffer> {\n const importedPublicKey = typeof publicKey === \"string\"\n ? await keys.importPublicKey(publicKey, curve, KeyUse.Read)\n : publicKey\n\n const cipherKey = await getSharedKey(privateKey, importedPublicKey, opts)\n return aes.decryptBytes(normalizeBase64ToBuf(msg), cipherKey, opts)\n}\n\nexport async function getPublicKey(keypair: CryptoKeyPair): Promise<string> {\n const raw = await globalThis.crypto.subtle.exportKey('raw', keypair.publicKey)\n return utils.arrBufToBase64(raw)\n}\n\nexport async function getSharedKey(privateKey: PrivateKey, publicKey: PublicKey, opts?: Partial<SymmKeyOpts>): Promise<SymmKey> {\n return globalThis.crypto.subtle.deriveKey(\n { name: ECC_READ_ALG, public: publicKey },\n privateKey,\n {\n name: opts?.alg || DEFAULT_SYMM_ALG,\n length: opts?.length || DEFAULT_SYMM_LEN\n },\n false,\n ['encrypt', 'decrypt']\n )\n}\n\nexport default {\n sign,\n verify,\n encrypt,\n decrypt,\n getPublicKey,\n getSharedKey\n}\n", "import ecc from './ecc/keys'\nimport {\n DEFAULT_CRYPTOSYSTEM,\n DEFAULT_ECC_CURVE,\n DEFAULT_RSA_SIZE,\n DEFAULT_SYMM_ALG,\n DEFAULT_SYMM_LEN,\n DEFAULT_HASH_ALG,\n DEFAULT_CHAR_SIZE,\n DEFAULT_STORE_NAME,\n DEFAULT_READ_KEY_NAME,\n DEFAULT_WRITE_KEY_NAME\n} from './constants'\nimport { Config, KeyUse, CryptoSystem, SymmKeyOpts } from './types'\nimport utils from './utils'\n\nexport const defaultConfig = {\n type: DEFAULT_CRYPTOSYSTEM,\n curve: DEFAULT_ECC_CURVE,\n rsaSize: DEFAULT_RSA_SIZE,\n symmAlg: DEFAULT_SYMM_ALG,\n symmLen: DEFAULT_SYMM_LEN,\n hashAlg: DEFAULT_HASH_ALG,\n charSize: DEFAULT_CHAR_SIZE,\n storeName: DEFAULT_STORE_NAME,\n readKeyName: DEFAULT_READ_KEY_NAME,\n writeKeyName: DEFAULT_WRITE_KEY_NAME\n} as Config\n\nexport function normalize(\n maybeCfg?: Partial<Config>,\n eccEnabled: boolean = true\n): Config {\n let cfg\n if (!maybeCfg) {\n cfg = defaultConfig\n } else {\n cfg = {\n ...defaultConfig,\n ...maybeCfg\n }\n }\n if (!maybeCfg?.type) {\n cfg.type = eccEnabled ? CryptoSystem.ECC : CryptoSystem.RSA\n }\n return cfg\n}\n\n// Attempt a structural clone of an ECC Key (required to store in IndexedDB)\n// If it throws an error, use RSA, otherwise use ECC\nexport async function eccEnabled(): Promise<boolean> {\n const keypair = await ecc.makeKeypair(DEFAULT_ECC_CURVE, KeyUse.Read)\n try {\n await utils.structuralClone(keypair)\n } catch (err) {\n return false\n }\n return true\n}\n\nexport function merge(cfg: Config, overwrites: Partial<Config> = {}): Config {\n return {\n ...cfg,\n ...overwrites\n }\n}\n\nexport function symmKeyOpts(cfg: Config): Partial<SymmKeyOpts> {\n return { alg: cfg.symmAlg, length: cfg.symmLen }\n}\n\nexport default {\n defaultConfig,\n normalize,\n eccEnabled,\n merge,\n symmKeyOpts\n}\n", "import aes from '../aes'\nimport idb from '../idb'\nimport utils from '../utils'\nimport config from '../config'\nimport { Config } from '../types'\nimport { checkIsKeyPair } from '../errors'\n\nexport default class KeyStoreBase {\n\n cfg: Config\n protected store: LocalForage\n\n constructor(cfg: Config, store: LocalForage) {\n this.cfg = cfg\n this.store = store\n }\n\n async writeKey(): Promise<CryptoKeyPair> {\n const maybeKey = await idb.getKeypair(this.cfg.writeKeyName, this.store)\n return checkIsKeyPair(maybeKey)\n }\n\n async readKey(): Promise<CryptoKeyPair> {\n const maybeKey = await idb.getKeypair(this.cfg.readKeyName, this.store)\n return checkIsKeyPair(maybeKey)\n }\n\n async getSymmKey(keyName: string, cfg?: Partial<Config>): Promise<CryptoKey> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const maybeKey = await idb.getKey(keyName, this.store)\n if(maybeKey !== null) {\n return maybeKey\n }\n const key = await aes.makeKey(config.symmKeyOpts(mergedCfg))\n await idb.put(keyName, key, this.store)\n return key\n }\n\n async keyExists(keyName: string): Promise<boolean> {\n const key = await idb.getKey(keyName, this.store)\n return key !== null\n }\n\n async deleteKey(keyName: string): Promise<void> {\n return idb.rm(keyName, this.store)\n }\n\n async destroy(): Promise<void> {\n return idb.dropStore(this.store)\n }\n\n async importSymmKey(keyStr: string, keyName: string, cfg?: Partial<Config>): Promise<void> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const key = await aes.importKey(keyStr, config.symmKeyOpts(mergedCfg))\n await idb.put(keyName, key, this.store)\n }\n\n async exportSymmKey(keyName: string, cfg?: Partial<Config>): Promise<string> {\n const key = await this.getSymmKey(keyName, cfg)\n return aes.exportKey(key)\n }\n\n async encryptWithSymmKey(msg: string, keyName: string, cfg?: Partial<Config>): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const key = await this.getSymmKey(keyName, cfg)\n const cipherText = await aes.encryptBytes(\n utils.strToArrBuf(msg, mergedCfg.charSize),\n key,\n config.symmKeyOpts(mergedCfg)\n )\n return utils.arrBufToBase64(cipherText)\n }\n\n async decryptWithSymmKey(cipherText: string, keyName: string, cfg?: Partial<Config>): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const key = await this.getSymmKey(keyName, cfg)\n const msgBytes = await aes.decryptBytes(\n utils.base64ToArrBuf(cipherText),\n key,\n config.symmKeyOpts(mergedCfg)\n )\n return utils.arrBufToStr(msgBytes, mergedCfg.charSize)\n }\n}\n", "import IDB from '../idb'\nimport keys from './keys'\nimport operations from './operations'\nimport config from '../config'\nimport utils from '../utils'\nimport KeyStoreBase from '../keystore/base'\nimport { KeyStore, Config, KeyUse, CryptoSystem } from '../types'\n\nexport class ECCKeyStore extends KeyStoreBase implements KeyStore {\n\n static async init(maybeCfg?: Partial<Config>): Promise<ECCKeyStore> {\n const cfg = config.normalize({\n ...(maybeCfg || {}),\n type: CryptoSystem.ECC\n })\n const { curve, storeName, readKeyName, writeKeyName } = cfg\n\n const store = IDB.createStore(storeName)\n await IDB.createIfDoesNotExist(readKeyName, () => (\n keys.makeKeypair(curve, KeyUse.Read)\n ), store)\n await IDB.createIfDoesNotExist(writeKeyName, () => (\n keys.makeKeypair(curve, KeyUse.Write)\n ), store)\n\n return new ECCKeyStore(cfg, store)\n }\n\n\n async sign(msg: string, cfg?: Partial<Config>): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const writeKey = await this.writeKey()\n\n return utils.arrBufToBase64(await operations.sign(\n msg,\n writeKey.privateKey,\n mergedCfg.charSize,\n mergedCfg.hashAlg\n ))\n }\n\n async verify(\n msg: string,\n sig: string,\n publicKey: string,\n cfg?: Partial<Config>\n ): Promise<boolean> {\n const mergedCfg = config.merge(this.cfg, cfg)\n\n return operations.verify(\n msg,\n sig,\n publicKey,\n mergedCfg.charSize,\n mergedCfg.curve,\n mergedCfg.hashAlg\n )\n }\n\n async encrypt(\n msg: string,\n publicKey: string,\n cfg?: Partial<Config>\n ): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const readKey = await this.readKey()\n\n return utils.arrBufToBase64(await operations.encrypt(\n msg,\n readKey.privateKey,\n publicKey,\n mergedCfg.charSize,\n mergedCfg.curve\n ))\n }\n\n async decrypt(\n cipherText: string,\n publicKey: string,\n cfg?: Partial<Config>\n ): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const readKey = await this.readKey()\n\n return utils.arrBufToStr(\n await operations.decrypt(\n cipherText,\n readKey.privateKey,\n publicKey,\n mergedCfg.curve\n ),\n mergedCfg.charSize\n )\n }\n\n async publicReadKey(): Promise<string> {\n const readKey = await this.readKey()\n return operations.getPublicKey(readKey)\n }\n\n async publicWriteKey(): Promise<string> {\n const writeKey = await this.writeKey()\n return operations.getPublicKey(writeKey)\n }\n}\n\nexport default ECCKeyStore\n", "import { RSA_READ_ALG, RSA_WRITE_ALG } from '../constants'\nimport { RsaSize, HashAlg, KeyUse, PublicKey } from '../types'\nimport utils from '../utils'\nimport { checkValidKeyUse } from '../errors'\n\nexport async function makeKeypair(\n size: RsaSize,\n hashAlg: HashAlg,\n use: KeyUse\n): Promise<CryptoKeyPair> {\n checkValidKeyUse(use)\n const alg = use === KeyUse.Read ? RSA_READ_ALG : RSA_WRITE_ALG\n const uses: KeyUsage[] = use === KeyUse.Read ? ['encrypt', 'decrypt'] : ['sign', 'verify']\n return globalThis.crypto.subtle.generateKey(\n {\n name: alg,\n modulusLength: size,\n publicExponent: utils.publicExponent(),\n hash: { name: hashAlg }\n },\n false,\n uses\n )\n}\n\nfunction stripKeyHeader(base64Key: string): string{\n return base64Key\n .replace('-----BEGIN PUBLIC KEY-----\\n', '')\n .replace('\\n-----END PUBLIC KEY-----', '')\n}\n\nexport async function importPublicKey(base64Key: string, hashAlg: HashAlg, use: KeyUse): Promise<PublicKey> {\n checkValidKeyUse(use)\n const alg = use === KeyUse.Read ? RSA_READ_ALG : RSA_WRITE_ALG\n const uses: KeyUsage[] = use === KeyUse.Read ? ['encrypt'] : ['verify']\n const buf = utils.base64ToArrBuf(stripKeyHeader(base64Key))\n return globalThis.crypto.subtle.importKey(\n 'spki',\n buf,\n { name: alg, hash: {name: hashAlg}},\n true,\n uses\n )\n}\n\nexport default {\n makeKeypair,\n importPublicKey\n}\n", "import keys from './keys'\nimport utils, { normalizeBase64ToBuf, normalizeUnicodeToBuf } from '../utils'\nimport { DEFAULT_CHAR_SIZE, DEFAULT_HASH_ALG, RSA_READ_ALG, RSA_WRITE_ALG, SALT_LENGTH } from '../constants'\nimport { CharSize, HashAlg, KeyUse, Msg, PrivateKey, PublicKey } from '../types'\n\n\nexport async function sign(\n msg: Msg,\n privateKey: PrivateKey,\n charSize: CharSize = DEFAULT_CHAR_SIZE\n): Promise<ArrayBuffer> {\n return globalThis.crypto.subtle.sign(\n { name: RSA_WRITE_ALG, saltLength: SALT_LENGTH },\n privateKey,\n normalizeUnicodeToBuf(msg, charSize)\n )\n}\n\nexport async function verify(\n msg: Msg,\n sig: Msg,\n publicKey: string | PublicKey,\n charSize: CharSize = DEFAULT_CHAR_SIZE,\n hashAlg: HashAlg = DEFAULT_HASH_ALG\n): Promise<boolean> {\n return globalThis.crypto.subtle.verify(\n { name: RSA_WRITE_ALG, saltLength: SALT_LENGTH },\n typeof publicKey === \"string\"\n ? await keys.importPublicKey(publicKey, hashAlg, KeyUse.Write)\n : publicKey,\n normalizeBase64ToBuf(sig),\n normalizeUnicodeToBuf(msg, charSize)\n )\n}\n\nexport async function encrypt(\n msg: Msg,\n publicKey: string | PublicKey,\n charSize: CharSize = DEFAULT_CHAR_SIZE,\n hashAlg: HashAlg = DEFAULT_HASH_ALG\n): Promise<ArrayBuffer> {\n return globalThis.crypto.subtle.encrypt(\n { name: RSA_READ_ALG },\n typeof publicKey === \"string\"\n ? await keys.importPublicKey(publicKey, hashAlg, KeyUse.Read)\n : publicKey,\n normalizeUnicodeToBuf(msg, charSize)\n )\n}\n\nexport async function decrypt(\n msg: Msg,\n privateKey: PrivateKey\n): Promise<ArrayBuffer> {\n const normalized = normalizeBase64ToBuf(msg)\n return globalThis.crypto.subtle.decrypt(\n { name: RSA_READ_ALG },\n privateKey,\n normalized\n )\n}\n\nexport async function getPublicKey(keypair: CryptoKeyPair): Promise<string> {\n const spki = await globalThis.crypto.subtle.exportKey('spki', keypair.publicKey)\n return utils.arrBufToBase64(spki)\n}\n\nexport default {\n sign,\n verify,\n encrypt,\n decrypt,\n getPublicKey,\n}\n", "import IDB from '../idb'\nimport keys from './keys'\nimport operations from './operations'\nimport config from '../config'\nimport utils from '../utils'\nimport KeyStoreBase from '../keystore/base'\nimport { KeyStore, Config, KeyUse, CryptoSystem, Msg, PublicKey } from '../types'\n\nexport class RSAKeyStore extends KeyStoreBase implements KeyStore {\n\n static async init(maybeCfg?: Partial<Config>): Promise<RSAKeyStore> {\n const cfg = config.normalize({\n ...(maybeCfg || {}),\n type: CryptoSystem.RSA\n })\n\n const { rsaSize, hashAlg, storeName, readKeyName, writeKeyName } = cfg\n const store = IDB.createStore(storeName)\n\n await IDB.createIfDoesNotExist(readKeyName, () => (\n keys.makeKeypair(rsaSize, hashAlg, KeyUse.Read)\n ), store)\n await IDB.createIfDoesNotExist(writeKeyName, () => (\n keys.makeKeypair(rsaSize, hashAlg, KeyUse.Write)\n ), store)\n\n return new RSAKeyStore(cfg, store)\n }\n\n\n async sign(msg: Msg, cfg?: Partial<Config>): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n const writeKey = await this.writeKey()\n\n return utils.arrBufToBase64(await operations.sign(\n msg,\n writeKey.privateKey,\n mergedCfg.charSize\n ))\n }\n\n async verify(\n msg: string,\n sig: string,\n publicKey: string | PublicKey,\n cfg?: Partial<Config>\n ): Promise<boolean> {\n const mergedCfg = config.merge(this.cfg, cfg)\n\n return operations.verify(\n msg,\n sig,\n publicKey,\n mergedCfg.charSize,\n mergedCfg.hashAlg\n )\n }\n\n async encrypt(\n msg: Msg,\n publicKey: string | PublicKey,\n cfg?: Partial<Config>\n ): Promise<string> {\n const mergedCfg = config.merge(this.cfg, cfg)\n\n return utils.arrBufToBase64(await operations.encrypt(\n msg,\n publicKey,\n mergedCfg.charSize,\n mergedCfg.hashAlg\n ))\n }\n\n async decrypt(\n cipherText: Msg,\n publicKey?: string | PublicKey, // unused param so that keystore interfaces match\n cfg?: Partial<Config>\n ): Promise<string> {\n const readKey = await this.readKey()\n const mergedCfg = config.merge(this.cfg, cfg)\n\n return utils.arrBufToStr(\n await operations.decrypt(\n cipherText,\n readKey.privateKey,\n ),\n mergedCfg.charSize\n )\n }\n\n async publicReadKey(): Promise<string> {\n const readKey = await this.readKey()\n return operations.getPublicKey(readKey)\n }\n\n async publicWriteKey(): Promise<string> {\n const writeKey = await this.writeKey()\n return operations.getPublicKey(writeKey)\n }\n}\n\nexport default RSAKeyStore\n", "import ECCKeyStore from '../ecc/keystore'\nimport RSAKeyStore from '../rsa/keystore'\nimport config from '../config'\nimport IDB from '../idb'\nimport { ECCNotEnabled, checkValidCryptoSystem } from '../errors'\nimport { Config, KeyStore } from '../types'\n\nexport async function init(maybeCfg?: Partial<Config>): Promise<KeyStore>{\n const eccEnabled = await config.eccEnabled()\n if(!eccEnabled && maybeCfg?.type === 'ecc'){\n throw ECCNotEnabled\n }\n \n const cfg = config.normalize(maybeCfg, eccEnabled)\n\n checkValidCryptoSystem(cfg.type)\n\n if(cfg.type === 'ecc'){\n return ECCKeyStore.init(cfg)\n }else {\n return RSAKeyStore.init(cfg)\n }\n}\n\nexport async function clear(): Promise<void> {\n return IDB.clear()\n}\n\nexport default {\n init,\n clear,\n}\n", "import keys from './keys'\nimport operations from './operations'\nimport keystore from './keystore'\n\nexport * from './keys'\nexport * from './operations'\nexport * from './keystore'\n\nexport default {\n ...keys,\n ...operations,\n ...keystore,\n}\n\n\n", "import keys from './keys'\nimport operations from './operations'\nimport keystore from './keystore'\n\nexport * from './keys'\nexport * from './operations'\nexport * from './keystore'\n\nexport default {\n ...keys,\n ...operations,\n ...keystore,\n}\n\n\n", "import \"@ungap/global-this\"\nimport { init, clear } from './keystore'\n\nimport * as ecc from './ecc'\nimport * as rsa from './rsa'\nimport * as config from './config'\nimport * as constants from './constants'\nimport * as utils from './utils'\nimport * as idb from './idb'\nimport * as types from './types'\n\nexport default {\n init,\n clear,\n ...types,\n ...constants,\n ...config,\n ...utils,\n ecc,\n rsa,\n idb,\n}\n", "'use strict'\n\n/* eslint-env browser */\n\n/**\n * @typedef {Error|ErrorData} EncodedError\n *\n * Properties added by err-code library\n * @typedef {Object} ErrorExtension\n * @property {string} [code]\n * @property {string} [detail]\n */\n\n/**\n * @typedef {Error & ErrorExtension} ExtendedError\n */\n\n/**\n * @typedef {Object} ErrorData\n * @property {string} name\n * @property {string} message\n * @property {string|undefined} stack\n * @property {string|undefined} code\n * @property {string|undefined} detail\n *\n * @param {ExtendedError} error\n * @returns {EncodedError}\n */\nconst encodeError = error => {\n const { name, message, stack, code, detail } = error\n return { name, message, stack, code, detail }\n}\nexports.encodeError = encodeError\n\n/**\n * @param {EncodedError} error\n * @returns {Error}\n */\nconst decodeError = error => {\n if (error instanceof Error) {\n return error\n } else {\n const { name, message, stack, code } = error\n return Object.assign(createError(name, message), { name, stack, code })\n }\n}\nexports.decodeError = decodeError\n\n/**\n * Create error by error name.\n *\n * @param {string} name\n * @param {string} message\n * @returns {Error}\n */\nconst createError = (name, message) => {\n switch (name) {\n case 'RangeError': {\n return new RangeError(message)\n }\n case 'ReferenceError': {\n return ReferenceError(message)\n }\n case 'SyntaxError': {\n return new SyntaxError(message)\n }\n case 'TypeError': {\n return new TypeError(message)\n }\n case 'URIError': {\n return new URIError(message)\n }\n default: {\n return new Error(message)\n }\n }\n}\n", "'use strict'\n\n/**\n * Transforms an array of ArrayBuffers into a Set,\n * and makes sure the buffers are not detached.\n *\n * @param {Transferable[]} values\n * @returns {Set<Transferable>}\n */\nconst ensureUniqueBuffers = values => new Set(values)\nexports.ensureUniqueBuffers = ensureUniqueBuffers\n", "'use strict'\n\nexports.TimeoutError = class TimeoutError extends Error {\n get name () {\n return this.constructor.name\n }\n}\n\nexports.AbortError = class AbortError extends Error {\n get name () {\n return this.constructor.name\n }\n}\n\nexports.DisconnectError = class DisconnectError extends Error {\n get name () {\n return this.constructor.name\n }\n}\n", "'use strict'\n\nconst { decodeError } = require('ipfs-message-port-protocol/src/error')\nconst { ensureUniqueBuffers } = require('ipfs-message-port-protocol/src/buffer')\nconst { DisconnectError, TimeoutError, AbortError } = require('./error')\n\n/**\n * RPC Transport over `MessagePort` that can execute queries. It takes care of\n * executing queries by issuing a message with unique ID and fullfilling a\n * query when corresponding response message is received. It also makes sure\n * that aborted / timed out queries are cancelled as needed.\n *\n * It is expected that there will be at most one transport for a message port\n * instance.\n *\n */\nmodule.exports = class MessageTransport {\n /**\n * Create transport for the underlying message port.\n *\n * @param {MessagePort} [port]\n */\n constructor (port) {\n this.port = null\n // Assigining a random enough identifier to the transport, to ensure that\n // query.id will be unique when multiple tabs are communicating with a\n // a server in the SharedWorker.\n this.id = Math.random()\n .toString(32)\n .slice(2)\n\n // Local unique id on the transport which is incremented for each query.\n this.nextID = 0\n\n // Dictionary of pending requests\n /** @type {Record<string, Query<any, any>>} */\n this.queries = Object.create(null)\n\n // If port is provided connect this transport to it. If not transport can\n // queue queries and execute those once it's connected.\n if (port) {\n this.connect(port)\n }\n }\n\n /**\n * Executes given query with this transport and returns promise for it's\n * result. Promise fails with an error if query fails.\n *\n * @template I, O\n * @param {Query<I, O>} query\n * @returns {Promise<O>}\n */\n execute (query) {\n const id = `${this.id}@${this.nextID++}`\n this.queries[id] = query\n\n // If query has a timeout set a timer.\n if (query.timeout > 0 && query.timeout < Infinity) {\n query.timerID = setTimeout(MessageTransport.timeout, query.timeout, this, id)\n }\n\n if (query.signal) {\n query.signal.addEventListener('abort', () => this.abort(id), {\n once: true\n })\n }\n\n // If transport is connected (it has port) post a query, otherwise it\n // will remain in the pending queries queue.\n if (this.port) {\n MessageTransport.postQuery(this.port, id, query)\n }\n\n return query.result\n }\n\n /**\n * Connects this transport to the given message port. Throws `Error` if\n * transport is already connected. All the pending queries will be executed\n * as connection occurs.\n *\n * @param {MessagePort} port\n */\n connect (port) {\n if (this.port) {\n throw new Error('Transport is already open')\n } else {\n this.port = port\n this.port.addEventListener('message', this)\n this.port.start()\n\n // Go ever pending queries (that were submitted before transport was\n // connected) and post them. This loop is safe because messages will not\n // arrive while this loop is running so no mutation can occur.\n for (const [id, query] of Object.entries(this.queries)) {\n MessageTransport.postQuery(port, id, query)\n }\n }\n }\n\n /**\n * Disconnects this transport. This will cause all the pending queries\n * to be aborted and undelying message port to be closed.\n *\n * Once disconnected transport can not be reconnected back.\n */\n disconnect () {\n const error = new DisconnectError()\n for (const [id, query] of Object.entries(this.queries)) {\n query.fail(error)\n this.abort(id)\n }\n\n // Note that reference to port is kept that ensures that attempt to\n // reconnect will throw an error.\n if (this.port) {\n this.port.removeEventListener('message', this)\n this.port.close()\n }\n }\n\n /**\n * Invoked on query timeout. If query is still pending it will fail and\n * abort message will be send to a the server.\n *\n * @param {MessageTransport} self\n * @param {string} id\n */\n static timeout (self, id) {\n const { queries } = self\n const query = queries[id]\n if (query) {\n delete queries[id]\n query.fail(new TimeoutError('request timed out'))\n if (self.port) {\n self.port.postMessage({ type: 'abort', id })\n }\n }\n }\n\n /**\n * Aborts this query by failing with `AbortError` and sending an abort message\n * to the server. If query is no longer pending this has no effect.\n *\n * @param {string} id\n */\n abort (id) {\n const { queries } = this\n const query = queries[id]\n if (query) {\n delete queries[id]\n\n query.fail(new AbortError())\n if (this.port) {\n this.port.postMessage({ type: 'abort', id })\n }\n\n if (query.timerID != null) {\n clearTimeout(query.timerID)\n }\n }\n }\n\n /**\n * Sends a given `query` with a given `id` over the message channel.\n *\n * @param {MessagePort} port\n * @param {string} id\n * @param {Query<any, any>} query\n */\n static postQuery (port, id, query) {\n port.postMessage(\n {\n type: 'query',\n namespace: query.namespace,\n method: query.method,\n id,\n input: query.toJSON()\n },\n // @ts-expect-error - TS seems to want second arg to postMessage to not be undefined\n ensureUniqueBuffers(query.transfer() || [])\n )\n }\n\n /**\n * Handler is invoked when message on the message port is received.\n *\n * @param {MessageEvent} event\n */\n handleEvent (event) {\n const { id, result } = event.data\n const query = this.queries[id]\n // If query with a the given ID is found it is completed with the result,\n // otherwise it is cancelled.\n // Note: query may not be found when it was aborted on the client and at the\n // same time server posted response.\n if (query) {\n delete this.queries[id]\n if (result.ok) {\n query.succeed(result.value)\n } else {\n query.fail(decodeError(result.error))\n }\n\n if (query.timerID != null) {\n clearTimeout(query.timerID)\n }\n }\n }\n}\n\n/**\n * @template I,O\n * @typedef {import('./query')<I, O>} Query\n */\n", "'use strict'\n\n/**\n * Represents server query, encapsulating inputs to the server endpoint and\n * promise of it's result.\n *\n * @template I,O\n */\nmodule.exports = class Query {\n /**\n * @param {string} namespace - component namespace on the server.\n * @param {string} method - remote method this is a query of.\n * @param {QueryInput<I>} input - query input.\n */\n constructor (namespace, method, input) {\n /** @type {Promise<O>} */\n this.result = new Promise((resolve, reject) => {\n this.succeed = resolve\n this.fail = reject\n this.signal = input.signal\n this.input = input\n this.namespace = namespace\n this.method = method\n this.timeout = input.timeout == null ? Infinity : input.timeout\n /** @type {number|null} */\n this.timerID = null\n })\n }\n\n /**\n * Data that will be structure cloned over message channel.\n *\n * @returns {Object}\n */\n toJSON () {\n return this.input\n }\n\n /**\n * Data that will be transferred over message channel.\n *\n * @returns {Transferable[]|void}\n */\n transfer () {\n return this.input.transfer\n }\n}\n\n/**\n * @typedef {Object} QueryOptions\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n * @property {Transferable[]} [transfer]\n */\n/**\n * @template I\n * @typedef {I & QueryOptions} QueryInput\n */\n", "'use strict'\n\nconst Query = require('./query')\n\n/**\n * Service represents an API to a remote service `T`. It will have all the\n * methods with the same signatures as `T`.\n *\n * @template T\n */\nmodule.exports = class Service {\n /**\n * @param {string} namespace - Namespace that remote API is served under.\n * @param {ProcedureNames<T>} methods - Method names of the remote API.\n * @param {MessageTransport} transport - Transport to issue queries over.\n */\n constructor (namespace, methods, transport) {\n this.transport = transport\n // Type script does not like using classes as some dicitionaries, so\n // we explicitly type it as dictionary.\n /** @type {Object.<ProcedureNames<T>, Function>} */\n const api = this\n for (const method of methods) {\n /**\n * @template I, O\n * @param {I} input\n * @returns {Promise<O>}\n */\n api[method] = input =>\n this.transport.execute(new Query(namespace, method.toString(), input))\n }\n }\n}\n\n/**\n * @typedef {import('./transport')} MessageTransport\n */\n/**\n * @template T\n * @typedef {import('ipfs-message-port-protocol/src/rpc').ProcedureNames<T>} ProcedureNames\n */\n", "'use strict'\n\n/* eslint-env browser */\n\nconst Service = require('./client/service')\n\n/**\n * @template T\n * @typedef {import('ipfs-message-port-protocol/src/rpc').Remote<T>} Remote\n */\n\n/**\n * @template T\n * @typedef {import('ipfs-message-port-protocol/src/rpc').ProcedureNames<T>} ProcedureNames\n */\n\n/**\n * @template T\n * @typedef {Array<keyof T>} Keys\n */\n\n/**\n * @template T\n * @typedef {Remote<T> & Service<T>} RemoteService\n */\n\n/**\n * Client represents the client to remote `T` service. It is a base clase that\n * specific API clients will subclass to provide a higher level API for end\n * user. Client implementations take care of encoding arguments into quries\n * and issing those to `remote` service.\n *\n * @class\n * @template T\n */\nmodule.exports = class Client {\n /**\n * @param {string} namespace\n * @param {ProcedureNames<T>} methods\n * @param {MessageTransport} transport\n */\n constructor (namespace, methods, transport) {\n /** @type {RemoteService<T>} */\n this.remote = (new Service(namespace, methods, transport))\n }\n}\n\n/**\n * @typedef {import('./client/transport')} MessageTransport\n */\n", "'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (source instanceof Uint8Array) {\n } else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source)\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0\n // Skip leading spaces.\n if (source[psz] === ' ') { return }\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip trailing spaces.\n if (source[psz] === ' ') { return }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = new Uint8Array(zeroes + (size - it4))\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n", "'use strict'\n\nconst textDecoder = new TextDecoder()\n/**\n * @param {ArrayBufferView|ArrayBuffer} bytes\n * @returns {string}\n */\nconst decodeText = (bytes) => textDecoder.decode(bytes)\n\nconst textEncoder = new TextEncoder()\n/**\n * @param {string} text\n * @returns {Uint8Array}\n */\nconst encodeText = (text) => textEncoder.encode(text)\n\n/**\n * Returns a new Uint8Array created by concatenating the passed Arrays\n *\n * @param {Array<ArrayLike<number>>} arrs\n * @param {number} length\n * @returns {Uint8Array}\n */\nfunction concat (arrs, length) {\n const output = new Uint8Array(length)\n let offset = 0\n\n for (const arr of arrs) {\n output.set(arr, offset)\n offset += arr.length\n }\n\n return output\n}\n\nmodule.exports = { decodeText, encodeText, concat }\n", "'use strict'\n\nconst { encodeText } = require('./util')\n\n/** @typedef {import('./types').CodecFactory} CodecFactory */\n/** @typedef {import(\"./types\").BaseName} BaseName */\n/** @typedef {import(\"./types\").BaseCode} BaseCode */\n\n/**\n * Class to encode/decode in the supported Bases\n *\n */\nclass Base {\n /**\n * @param {BaseName} name\n * @param {BaseCode} code\n * @param {CodecFactory} factory\n * @param {string} alphabet\n */\n constructor (name, code, factory, alphabet) {\n this.name = name\n this.code = code\n this.codeBuf = encodeText(this.code)\n this.alphabet = alphabet\n this.codec = factory(alphabet)\n }\n\n /**\n * @param {Uint8Array} buf\n * @returns {string}\n */\n encode (buf) {\n return this.codec.encode(buf)\n }\n\n /**\n * @param {string} string\n * @returns {Uint8Array}\n */\n decode (string) {\n for (const char of string) {\n if (this.alphabet && this.alphabet.indexOf(char) < 0) {\n throw new Error(`invalid character '${char}' in '${string}'`)\n }\n }\n return this.codec.decode(string)\n }\n}\n\nmodule.exports = Base\n", "'use strict'\n\n/** @typedef {import('./types').CodecFactory} CodecFactory */\n\n/**\n * @param {string} string\n * @param {string} alphabet\n * @param {number} bitsPerChar\n * @returns {Uint8Array}\n */\nconst decode = (string, alphabet, bitsPerChar) => {\n // Build the character lookup table:\n /** @type {Record<string, number>} */\n const codes = {}\n for (let i = 0; i < alphabet.length; ++i) {\n codes[alphabet[i]] = i\n }\n\n // Count the padding bytes:\n let end = string.length\n while (string[end - 1] === '=') {\n --end\n }\n\n // Allocate the output:\n const out = new Uint8Array((end * bitsPerChar / 8) | 0)\n\n // Parse the data:\n let bits = 0 // Number of bits currently in the buffer\n let buffer = 0 // Bits waiting to be written out, MSB first\n let written = 0 // Next byte to write\n for (let i = 0; i < end; ++i) {\n // Read one character from the string:\n const value = codes[string[i]]\n if (value === undefined) {\n throw new SyntaxError('Invalid character ' + string[i])\n }\n\n // Append the bits to the buffer:\n buffer = (buffer << bitsPerChar) | value\n bits += bitsPerChar\n\n // Write out some bits if the buffer has a byte's worth:\n if (bits >= 8) {\n bits -= 8\n out[written++] = 0xff & (buffer >> bits)\n }\n }\n\n // Verify that we have received just enough bits:\n if (bits >= bitsPerChar || 0xff & (buffer << (8 - bits))) {\n throw new SyntaxError('Unexpected end of data')\n }\n\n return out\n}\n\n/**\n * @param {Uint8Array} data\n * @param {string} alphabet\n * @param {number} bitsPerChar\n * @returns {string}\n */\nconst encode = (data, alphabet, bitsPerChar) => {\n const pad = alphabet[alphabet.length - 1] === '='\n const mask = (1 << bitsPerChar) - 1\n let out = ''\n\n let bits = 0 // Number of bits currently in the buffer\n let buffer = 0 // Bits waiting to be written out, MSB first\n for (let i = 0; i < data.length; ++i) {\n // Slurp data into the buffer:\n buffer = (buffer << 8) | data[i]\n bits += 8\n\n // Write out as much as we can:\n while (bits > bitsPerChar) {\n bits -= bitsPerChar\n out += alphabet[mask & (buffer >> bits)]\n }\n }\n\n // Partial character:\n if (bits) {\n out += alphabet[mask & (buffer << (bitsPerChar - bits))]\n }\n\n // Add padding characters until we hit a byte boundary:\n if (pad) {\n while ((out.length * bitsPerChar) & 7) {\n out += '='\n }\n }\n\n return out\n}\n\n/**\n * RFC4648 Factory\n *\n * @param {number} bitsPerChar\n * @returns {CodecFactory}\n */\nconst rfc4648 = (bitsPerChar) => (alphabet) => {\n return {\n /**\n * @param {Uint8Array} input\n * @returns {string}\n */\n encode (input) {\n return encode(input, alphabet, bitsPerChar)\n },\n /**\n * @param {string} input\n * @returns {Uint8Array}\n */\n decode (input) {\n return decode(input, alphabet, bitsPerChar)\n }\n }\n}\n\nmodule.exports = { rfc4648 }\n", "'use strict'\n\nconst baseX = require('@multiformats/base-x')\nconst Base = require('./base.js')\nconst { rfc4648 } = require('./rfc4648')\nconst { decodeText, encodeText } = require('./util')\n\n/** @typedef {import('./types').CodecFactory} CodecFactory */\n/** @typedef {import('./types').Codec} Codec */\n/** @typedef {import('./types').BaseName} BaseName */\n/** @typedef {import('./types').BaseCode} BaseCode */\n\n/** @type {CodecFactory} */\nconst identity = () => {\n return {\n encode: decodeText,\n decode: encodeText\n }\n}\n\n/**\n *\n * name, code, implementation, alphabet\n *\n * @type {Array<[BaseName, BaseCode, CodecFactory, string]>}\n */\nconst constants = [\n ['identity', '\\x00', identity, ''],\n ['base2', '0', rfc4648(1), '01'],\n ['base8', '7', rfc4648(3), '01234567'],\n ['base10', '9', baseX, '0123456789'],\n ['base16', 'f', rfc4648(4), '0123456789abcdef'],\n ['base16upper', 'F', rfc4648(4), '0123456789ABCDEF'],\n ['base32hex', 'v', rfc4648(5), '0123456789abcdefghijklmnopqrstuv'],\n ['base32hexupper', 'V', rfc4648(5), '0123456789ABCDEFGHIJKLMNOPQRSTUV'],\n ['base32hexpad', 't', rfc4648(5), '0123456789abcdefghijklmnopqrstuv='],\n ['base32hexpadupper', 'T', rfc4648(5), '0123456789ABCDEFGHIJKLMNOPQRSTUV='],\n ['base32', 'b', rfc4648(5), 'abcdefghijklmnopqrstuvwxyz234567'],\n ['base32upper', 'B', rfc4648(5), 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'],\n ['base32pad', 'c', rfc4648(5), 'abcdefghijklmnopqrstuvwxyz234567='],\n ['base32padupper', 'C', rfc4648(5), 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567='],\n ['base32z', 'h', rfc4648(5), 'ybndrfg8ejkmcpqxot1uwisza345h769'],\n ['base36', 'k', baseX, '0123456789abcdefghijklmnopqrstuvwxyz'],\n ['base36upper', 'K', baseX, '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'],\n ['base58btc', 'z', baseX, '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'],\n ['base58flickr', 'Z', baseX, '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'],\n ['base64', 'm', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'],\n ['base64pad', 'M', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='],\n ['base64url', 'u', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'],\n ['base64urlpad', 'U', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=']\n]\n\n/** @type {Record<BaseName,Base>} */\nconst names = constants.reduce((prev, tupple) => {\n prev[tupple[0]] = new Base(tupple[0], tupple[1], tupple[2], tupple[3])\n return prev\n}, /** @type {Record<BaseName,Base>} */({}))\n\n/** @type {Record<BaseCode,Base>} */\nconst codes = constants.reduce((prev, tupple) => {\n prev[tupple[1]] = names[tupple[0]]\n return prev\n}, /** @type {Record<BaseCode,Base>} */({}))\n\nmodule.exports = {\n names,\n codes\n}\n", "/**\n * Implementation of the [multibase](https://github.com/multiformats/multibase) specification.\n *\n */\n'use strict'\n\nconst constants = require('./constants')\nconst { encodeText, decodeText, concat } = require('./util')\n\n/** @typedef {import('./base')} Base */\n/** @typedef {import(\"./types\").BaseNameOrCode} BaseNameOrCode */\n/** @typedef {import(\"./types\").BaseCode} BaseCode */\n/** @typedef {import(\"./types\").BaseName} BaseName */\n\n/**\n * Create a new Uint8Array with the multibase varint+code.\n *\n * @param {BaseNameOrCode} nameOrCode - The multibase name or code number.\n * @param {Uint8Array} buf - The data to be prefixed with multibase.\n * @returns {Uint8Array}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction multibase (nameOrCode, buf) {\n if (!buf) {\n throw new Error('requires an encoded Uint8Array')\n }\n const { name, codeBuf } = encoding(nameOrCode)\n validEncode(name, buf)\n\n return concat([codeBuf, buf], codeBuf.length + buf.length)\n}\n\n/**\n * Encode data with the specified base and add the multibase prefix.\n *\n * @param {BaseNameOrCode} nameOrCode - The multibase name or code number.\n * @param {Uint8Array} buf - The data to be encoded.\n * @returns {Uint8Array}\n * @throws {Error} Will throw if the encoding is not supported\n *\n */\nfunction encode (nameOrCode, buf) {\n const enc = encoding(nameOrCode)\n const data = encodeText(enc.encode(buf))\n\n return concat([enc.codeBuf, data], enc.codeBuf.length + data.length)\n}\n\n/**\n * Takes a Uint8Array or string encoded with multibase header, decodes it and\n * returns the decoded buffer\n *\n * @param {Uint8Array|string} data\n * @returns {Uint8Array}\n * @throws {Error} Will throw if the encoding is not supported\n *\n */\nfunction decode (data) {\n if (data instanceof Uint8Array) {\n data = decodeText(data)\n }\n const prefix = data[0]\n\n // Make all encodings case-insensitive except the ones that include upper and lower chars in the alphabet\n if (['f', 'F', 'v', 'V', 't', 'T', 'b', 'B', 'c', 'C', 'h', 'k', 'K'].includes(prefix)) {\n data = data.toLowerCase()\n }\n const enc = encoding(/** @type {BaseCode} */(data[0]))\n return enc.decode(data.substring(1))\n}\n\n/**\n * Is the given data multibase encoded?\n *\n * @param {Uint8Array|string} data\n */\nfunction isEncoded (data) {\n if (data instanceof Uint8Array) {\n data = decodeText(data)\n }\n\n // Ensure bufOrString is a string\n if (Object.prototype.toString.call(data) !== '[object String]') {\n return false\n }\n\n try {\n const enc = encoding(/** @type {BaseCode} */(data[0]))\n return enc.name\n } catch (err) {\n return false\n }\n}\n\n/**\n * Validate encoded data\n *\n * @param {BaseNameOrCode} name\n * @param {Uint8Array} buf\n * @returns {void}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction validEncode (name, buf) {\n const enc = encoding(name)\n enc.decode(decodeText(buf))\n}\n\n/**\n * Get the encoding by name or code\n *\n * @param {BaseNameOrCode} nameOrCode\n * @returns {Base}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction encoding (nameOrCode) {\n if (Object.prototype.hasOwnProperty.call(constants.names, /** @type {BaseName} */(nameOrCode))) {\n return constants.names[/** @type {BaseName} */(nameOrCode)]\n } else if (Object.prototype.hasOwnProperty.call(constants.codes, /** @type {BaseCode} */(nameOrCode))) {\n return constants.codes[/** @type {BaseCode} */(nameOrCode)]\n } else {\n throw new Error(`Unsupported encoding: ${nameOrCode}`)\n }\n}\n\n/**\n * Get encoding from data\n *\n * @param {string|Uint8Array} data\n * @returns {Base}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction encodingFromData (data) {\n if (data instanceof Uint8Array) {\n data = decodeText(data)\n }\n\n return encoding(/** @type {BaseCode} */(data[0]))\n}\n\nexports = module.exports = multibase\nexports.encode = encode\nexports.decode = decode\nexports.isEncoded = isEncoded\nexports.encoding = encoding\nexports.encodingFromData = encodingFromData\nconst names = Object.freeze(constants.names)\nconst codes = Object.freeze(constants.codes)\nexports.names = names\nexports.codes = codes\n", "module.exports = encode\n\nvar MSB = 0x80\n , REST = 0x7F\n , MSBALL = ~REST\n , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n out = out || []\n offset = offset || 0\n var oldOffset = offset\n\n while(num >= INT) {\n out[offset++] = (num & 0xFF) | MSB\n num /= 128\n }\n while(num & MSBALL) {\n out[offset++] = (num & 0xFF) | MSB\n num >>>= 7\n }\n out[offset] = num | 0\n \n encode.bytes = offset - oldOffset + 1\n \n return out\n}\n", "module.exports = read\n\nvar MSB = 0x80\n , REST = 0x7F\n\nfunction read(buf, offset) {\n var res = 0\n , offset = offset || 0\n , shift = 0\n , counter = offset\n , b\n , l = buf.length\n\n do {\n if (counter >= l) {\n read.bytes = 0\n throw new RangeError('Could not decode varint')\n }\n b = buf[counter++]\n res += shift < 28\n ? (b & REST) << shift\n : (b & REST) * Math.pow(2, shift)\n shift += 7\n } while (b >= MSB)\n\n read.bytes = counter - offset\n\n return res\n}\n", "\nvar N1 = Math.pow(2, 7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n return (\n value < N1 ? 1\n : value < N2 ? 2\n : value < N3 ? 3\n : value < N4 ? 4\n : value < N5 ? 5\n : value < N6 ? 6\n : value < N7 ? 7\n : value < N8 ? 8\n : value < N9 ? 9\n : 10\n )\n}\n", "module.exports = {\n encode: require('./encode.js')\n , decode: require('./decode.js')\n , encodingLength: require('./length.js')\n}\n", "/* eslint quote-props: off */\n'use strict'\n\n/**\n * Names for all available hashes\n *\n * @typedef { \"identity\" | \"sha1\" | \"sha2-256\" | \"sha2-512\" | \"sha3-512\" | \"sha3-384\" | \"sha3-256\" | \"sha3-224\" | \"shake-128\" | \"shake-256\" | \"keccak-224\" | \"keccak-256\" | \"keccak-384\" | \"keccak-512\" | \"blake3\" | \"murmur3-128\" | \"murmur3-32\" | \"dbl-sha2-256\" | \"md4\" | \"md5\" | \"bmt\" | \"sha2-256-trunc254-padded\" | \"ripemd-128\" | \"ripemd-160\" | \"ripemd-256\" | \"ripemd-320\" | \"x11\" | \"kangarootwelve\" | \"sm3-256\" | \"blake2b-8\" | \"blake2b-16\" | \"blake2b-24\" | \"blake2b-32\" | \"blake2b-40\" | \"blake2b-48\" | \"blake2b-56\" | \"blake2b-64\" | \"blake2b-72\" | \"blake2b-80\" | \"blake2b-88\" | \"blake2b-96\" | \"blake2b-104\" | \"blake2b-112\" | \"blake2b-120\" | \"blake2b-128\" | \"blake2b-136\" | \"blake2b-144\" | \"blake2b-152\" | \"blake2b-160\" | \"blake2b-168\" | \"blake2b-176\" | \"blake2b-184\" | \"blake2b-192\" | \"blake2b-200\" | \"blake2b-208\" | \"blake2b-216\" | \"blake2b-224\" | \"blake2b-232\" | \"blake2b-240\" | \"blake2b-248\" | \"blake2b-256\" | \"blake2b-264\" | \"blake2b-272\" | \"blake2b-280\" | \"blake2b-288\" | \"blake2b-296\" | \"blake2b-304\" | \"blake2b-312\" | \"blake2b-320\" | \"blake2b-328\" | \"blake2b-336\" | \"blake2b-344\" | \"blake2b-352\" | \"blake2b-360\" | \"blake2b-368\" | \"blake2b-376\" | \"blake2b-384\" | \"blake2b-392\" | \"blake2b-400\" | \"blake2b-408\" | \"blake2b-416\" | \"blake2b-424\" | \"blake2b-432\" | \"blake2b-440\" | \"blake2b-448\" | \"blake2b-456\" | \"blake2b-464\" | \"blake2b-472\" | \"blake2b-480\" | \"blake2b-488\" | \"blake2b-496\" | \"blake2b-504\" | \"blake2b-512\" | \"blake2s-8\" | \"blake2s-16\" | \"blake2s-24\" | \"blake2s-32\" | \"blake2s-40\" | \"blake2s-48\" | \"blake2s-56\" | \"blake2s-64\" | \"blake2s-72\" | \"blake2s-80\" | \"blake2s-88\" | \"blake2s-96\" | \"blake2s-104\" | \"blake2s-112\" | \"blake2s-120\" | \"blake2s-128\" | \"blake2s-136\" | \"blake2s-144\" | \"blake2s-152\" | \"blake2s-160\" | \"blake2s-168\" | \"blake2s-176\" | \"blake2s-184\" | \"blake2s-192\" | \"blake2s-200\" | \"blake2s-208\" | \"blake2s-216\" | \"blake2s-224\" | \"blake2s-232\" | \"blake2s-240\" | \"blake2s-248\" | \"blake2s-256\" | \"skein256-8\" | \"skein256-16\" | \"skein256-24\" | \"skein256-32\" | \"skein256-40\" | \"skein256-48\" | \"skein256-56\" | \"skein256-64\" | \"skein256-72\" | \"skein256-80\" | \"skein256-88\" | \"skein256-96\" | \"skein256-104\" | \"skein256-112\" | \"skein256-120\" | \"skein256-128\" | \"skein256-136\" | \"skein256-144\" | \"skein256-152\" | \"skein256-160\" | \"skein256-168\" | \"skein256-176\" | \"skein256-184\" | \"skein256-192\" | \"skein256-200\" | \"skein256-208\" | \"skein256-216\" | \"skein256-224\" | \"skein256-232\" | \"skein256-240\" | \"skein256-248\" | \"skein256-256\" | \"skein512-8\" | \"skein512-16\" | \"skein512-24\" | \"skein512-32\" | \"skein512-40\" | \"skein512-48\" | \"skein512-56\" | \"skein512-64\" | \"skein512-72\" | \"skein512-80\" | \"skein512-88\" | \"skein512-96\" | \"skein512-104\" | \"skein512-112\" | \"skein512-120\" | \"skein512-128\" | \"skein512-136\" | \"skein512-144\" | \"skein512-152\" | \"skein512-160\" | \"skein512-168\" | \"skein512-176\" | \"skein512-184\" | \"skein512-192\" | \"skein512-200\" | \"skein512-208\" | \"skein512-216\" | \"skein512-224\" | \"skein512-232\" | \"skein512-240\" | \"skein512-248\" | \"skein512-256\" | \"skein512-264\" | \"skein512-272\" | \"skein512-280\" | \"skein512-288\" | \"skein512-296\" | \"skein512-304\" | \"skein512-312\" | \"skein512-320\" | \"skein512-328\" | \"skein512-336\" | \"skein512-344\" | \"skein512-352\" | \"skein512-360\" | \"skein512-368\" | \"skein512-376\" | \"skein512-384\" | \"skein512-392\" | \"skein512-400\" | \"skein512-408\" | \"skein512-416\" | \"skein512-424\" | \"skein512-432\" | \"skein512-440\" | \"skein512-448\" | \"skein512-456\" | \"skein512-464\" | \"skein512-472\" | \"skein512-480\" | \"skein512-488\" | \"skein512-496\" | \"skein512-504\" | \"skein512-512\" | \"skein1024-8\" | \"skein1024-16\" | \"skein1024-24\" | \"skein1024-32\" | \"skein1024-40\" | \"skein1024-48\" | \"skein1024-56\" | \"skein1024-64\" | \"skein1024-72\" | \"skein1024-80\" | \"skein1024-88\" | \"skein1024-96\" | \"skein1024-104\" | \"skein1024-112\" | \"skein1024-120\" | \"skein1024-128\" | \"skein1024-136\" | \"skein1024-144\" | \"skein1024-152\" | \"skein1024-160\" | \"skein1024-168\" | \"skein1024-176\" | \"skein1024-184\" | \"skein1024-192\" | \"skein1024-200\" | \"skein1024-208\" | \"skein1024-216\" | \"skein1024-224\" | \"skein1024-232\" | \"skein1024-240\" | \"skein1024-248\" | \"skein1024-256\" | \"skein1024-264\" | \"skein1024-272\" | \"skein1024-280\" | \"skein1024-288\" | \"skein1024-296\" | \"skein1024-304\" | \"skein1024-312\" | \"skein1024-320\" | \"skein1024-328\" | \"skein1024-336\" | \"skein1024-344\" | \"skein1024-352\" | \"skein1024-360\" | \"skein1024-368\" | \"skein1024-376\" | \"skein1024-384\" | \"skein1024-392\" | \"skein1024-400\" | \"skein1024-408\" | \"skein1024-416\" | \"skein1024-424\" | \"skein1024-432\" | \"skein1024-440\" | \"skein1024-448\" | \"skein1024-456\" | \"skein1024-464\" | \"skein1024-472\" | \"skein1024-480\" | \"skein1024-488\" | \"skein1024-496\" | \"skein1024-504\" | \"skein1024-512\" | \"skein1024-520\" | \"skein1024-528\" | \"skein1024-536\" | \"skein1024-544\" | \"skein1024-552\" | \"skein1024-560\" | \"skein1024-568\" | \"skein1024-576\" | \"skein1024-584\" | \"skein1024-592\" | \"skein1024-600\" | \"skein1024-608\" | \"skein1024-616\" | \"skein1024-624\" | \"skein1024-632\" | \"skein1024-640\" | \"skein1024-648\" | \"skein1024-656\" | \"skein1024-664\" | \"skein1024-672\" | \"skein1024-680\" | \"skein1024-688\" | \"skein1024-696\" | \"skein1024-704\" | \"skein1024-712\" | \"skein1024-720\" | \"skein1024-728\" | \"skein1024-736\" | \"skein1024-744\" | \"skein1024-752\" | \"skein1024-760\" | \"skein1024-768\" | \"skein1024-776\" | \"skein1024-784\" | \"skein1024-792\" | \"skein1024-800\" | \"skein1024-808\" | \"skein1024-816\" | \"skein1024-824\" | \"skein1024-832\" | \"skein1024-840\" | \"skein1024-848\" | \"skein1024-856\" | \"skein1024-864\" | \"skein1024-872\" | \"skein1024-880\" | \"skein1024-888\" | \"skein1024-896\" | \"skein1024-904\" | \"skein1024-912\" | \"skein1024-920\" | \"skein1024-928\" | \"skein1024-936\" | \"skein1024-944\" | \"skein1024-952\" | \"skein1024-960\" | \"skein1024-968\" | \"skein1024-976\" | \"skein1024-984\" | \"skein1024-992\" | \"skein1024-1000\" | \"skein1024-1008\" | \"skein1024-1016\" | \"skein1024-1024\" | \"poseidon-bls12_381-a2-fc1\" | \"poseidon-bls12_381-a2-fc1-sc\" } HashName\n */\n/**\n * Codes for all available hashes\n *\n * @typedef { 0x00 | 0x11 | 0x12 | 0x13 | 0x14 | 0x15 | 0x16 | 0x17 | 0x18 | 0x19 | 0x1a | 0x1b | 0x1c | 0x1d | 0x1e | 0x22 | 0x23 | 0x56 | 0xd4 | 0xd5 | 0xd6 | 0x1012 | 0x1052 | 0x1053 | 0x1054 | 0x1055 | 0x1100 | 0x1d01 | 0x534d | 0xb201 | 0xb202 | 0xb203 | 0xb204 | 0xb205 | 0xb206 | 0xb207 | 0xb208 | 0xb209 | 0xb20a | 0xb20b | 0xb20c | 0xb20d | 0xb20e | 0xb20f | 0xb210 | 0xb211 | 0xb212 | 0xb213 | 0xb214 | 0xb215 | 0xb216 | 0xb217 | 0xb218 | 0xb219 | 0xb21a | 0xb21b | 0xb21c | 0xb21d | 0xb21e | 0xb21f | 0xb220 | 0xb221 | 0xb222 | 0xb223 | 0xb224 | 0xb225 | 0xb226 | 0xb227 | 0xb228 | 0xb229 | 0xb22a | 0xb22b | 0xb22c | 0xb22d | 0xb22e | 0xb22f | 0xb230 | 0xb231 | 0xb232 | 0xb233 | 0xb234 | 0xb235 | 0xb236 | 0xb237 | 0xb238 | 0xb239 | 0xb23a | 0xb23b | 0xb23c | 0xb23d | 0xb23e | 0xb23f | 0xb240 | 0xb241 | 0xb242 | 0xb243 | 0xb244 | 0xb245 | 0xb246 | 0xb247 | 0xb248 | 0xb249 | 0xb24a | 0xb24b | 0xb24c | 0xb24d | 0xb24e | 0xb24f | 0xb250 | 0xb251 | 0xb252 | 0xb253 | 0xb254 | 0xb255 | 0xb256 | 0xb257 | 0xb258 | 0xb259 | 0xb25a | 0xb25b | 0xb25c | 0xb25d | 0xb25e | 0xb25f | 0xb260 | 0xb301 | 0xb302 | 0xb303 | 0xb304 | 0xb305 | 0xb306 | 0xb307 | 0xb308 | 0xb309 | 0xb30a | 0xb30b | 0xb30c | 0xb30d | 0xb30e | 0xb30f | 0xb310 | 0xb311 | 0xb312 | 0xb313 | 0xb314 | 0xb315 | 0xb316 | 0xb317 | 0xb318 | 0xb319 | 0xb31a | 0xb31b | 0xb31c | 0xb31d | 0xb31e | 0xb31f | 0xb320 | 0xb321 | 0xb322 | 0xb323 | 0xb324 | 0xb325 | 0xb326 | 0xb327 | 0xb328 | 0xb329 | 0xb32a | 0xb32b | 0xb32c | 0xb32d | 0xb32e | 0xb32f | 0xb330 | 0xb331 | 0xb332 | 0xb333 | 0xb334 | 0xb335 | 0xb336 | 0xb337 | 0xb338 | 0xb339 | 0xb33a | 0xb33b | 0xb33c | 0xb33d | 0xb33e | 0xb33f | 0xb340 | 0xb341 | 0xb342 | 0xb343 | 0xb344 | 0xb345 | 0xb346 | 0xb347 | 0xb348 | 0xb349 | 0xb34a | 0xb34b | 0xb34c | 0xb34d | 0xb34e | 0xb34f | 0xb350 | 0xb351 | 0xb352 | 0xb353 | 0xb354 | 0xb355 | 0xb356 | 0xb357 | 0xb358 | 0xb359 | 0xb35a | 0xb35b | 0xb35c | 0xb35d | 0xb35e | 0xb35f | 0xb360 | 0xb361 | 0xb362 | 0xb363 | 0xb364 | 0xb365 | 0xb366 | 0xb367 | 0xb368 | 0xb369 | 0xb36a | 0xb36b | 0xb36c | 0xb36d | 0xb36e | 0xb36f | 0xb370 | 0xb371 | 0xb372 | 0xb373 | 0xb374 | 0xb375 | 0xb376 | 0xb377 | 0xb378 | 0xb379 | 0xb37a | 0xb37b | 0xb37c | 0xb37d | 0xb37e | 0xb37f | 0xb380 | 0xb381 | 0xb382 | 0xb383 | 0xb384 | 0xb385 | 0xb386 | 0xb387 | 0xb388 | 0xb389 | 0xb38a | 0xb38b | 0xb38c | 0xb38d | 0xb38e | 0xb38f | 0xb390 | 0xb391 | 0xb392 | 0xb393 | 0xb394 | 0xb395 | 0xb396 | 0xb397 | 0xb398 | 0xb399 | 0xb39a | 0xb39b | 0xb39c | 0xb39d | 0xb39e | 0xb39f | 0xb3a0 | 0xb3a1 | 0xb3a2 | 0xb3a3 | 0xb3a4 | 0xb3a5 | 0xb3a6 | 0xb3a7 | 0xb3a8 | 0xb3a9 | 0xb3aa | 0xb3ab | 0xb3ac | 0xb3ad | 0xb3ae | 0xb3af | 0xb3b0 | 0xb3b1 | 0xb3b2 | 0xb3b3 | 0xb3b4 | 0xb3b5 | 0xb3b6 | 0xb3b7 | 0xb3b8 | 0xb3b9 | 0xb3ba | 0xb3bb | 0xb3bc | 0xb3bd | 0xb3be | 0xb3bf | 0xb3c0 | 0xb3c1 | 0xb3c2 | 0xb3c3 | 0xb3c4 | 0xb3c5 | 0xb3c6 | 0xb3c7 | 0xb3c8 | 0xb3c9 | 0xb3ca | 0xb3cb | 0xb3cc | 0xb3cd | 0xb3ce | 0xb3cf | 0xb3d0 | 0xb3d1 | 0xb3d2 | 0xb3d3 | 0xb3d4 | 0xb3d5 | 0xb3d6 | 0xb3d7 | 0xb3d8 | 0xb3d9 | 0xb3da | 0xb3db | 0xb3dc | 0xb3dd | 0xb3de | 0xb3df | 0xb3e0 | 0xb401 | 0xb402 } HashCode\n */\n\n/**\n * @type { Record<HashName,HashCode> }\n */\nconst names = Object.freeze({\n 'identity': 0x00,\n 'sha1': 0x11,\n 'sha2-256': 0x12,\n 'sha2-512': 0x13,\n 'sha3-512': 0x14,\n 'sha3-384': 0x15,\n 'sha3-256': 0x16,\n 'sha3-224': 0x17,\n 'shake-128': 0x18,\n 'shake-256': 0x19,\n 'keccak-224': 0x1a,\n 'keccak-256': 0x1b,\n 'keccak-384': 0x1c,\n 'keccak-512': 0x1d,\n 'blake3': 0x1e,\n 'murmur3-128': 0x22,\n 'murmur3-32': 0x23,\n 'dbl-sha2-256': 0x56,\n 'md4': 0xd4,\n 'md5': 0xd5,\n 'bmt': 0xd6,\n 'sha2-256-trunc254-padded': 0x1012,\n 'ripemd-128': 0x1052,\n 'ripemd-160': 0x1053,\n 'ripemd-256': 0x1054,\n 'ripemd-320': 0x1055,\n 'x11': 0x1100,\n 'kangarootwelve': 0x1d01,\n 'sm3-256': 0x534d,\n 'blake2b-8': 0xb201,\n 'blake2b-16': 0xb202,\n 'blake2b-24': 0xb203,\n 'blake2b-32': 0xb204,\n 'blake2b-40': 0xb205,\n 'blake2b-48': 0xb206,\n 'blake2b-56': 0xb207,\n 'blake2b-64': 0xb208,\n 'blake2b-72': 0xb209,\n 'blake2b-80': 0xb20a,\n 'blake2b-88': 0xb20b,\n 'blake2b-96': 0xb20c,\n 'blake2b-104': 0xb20d,\n 'blake2b-112': 0xb20e,\n 'blake2b-120': 0xb20f,\n 'blake2b-128': 0xb210,\n 'blake2b-136': 0xb211,\n 'blake2b-144': 0xb212,\n 'blake2b-152': 0xb213,\n 'blake2b-160': 0xb214,\n 'blake2b-168': 0xb215,\n 'blake2b-176': 0xb216,\n 'blake2b-184': 0xb217,\n 'blake2b-192': 0xb218,\n 'blake2b-200': 0xb219,\n 'blake2b-208': 0xb21a,\n 'blake2b-216': 0xb21b,\n 'blake2b-224': 0xb21c,\n 'blake2b-232': 0xb21d,\n 'blake2b-240': 0xb21e,\n 'blake2b-248': 0xb21f,\n 'blake2b-256': 0xb220,\n 'blake2b-264': 0xb221,\n 'blake2b-272': 0xb222,\n 'blake2b-280': 0xb223,\n 'blake2b-288': 0xb224,\n 'blake2b-296': 0xb225,\n 'blake2b-304': 0xb226,\n 'blake2b-312': 0xb227,\n 'blake2b-320': 0xb228,\n 'blake2b-328': 0xb229,\n 'blake2b-336': 0xb22a,\n 'blake2b-344': 0xb22b,\n 'blake2b-352': 0xb22c,\n 'blake2b-360': 0xb22d,\n 'blake2b-368': 0xb22e,\n 'blake2b-376': 0xb22f,\n 'blake2b-384': 0xb230,\n 'blake2b-392': 0xb231,\n 'blake2b-400': 0xb232,\n 'blake2b-408': 0xb233,\n 'blake2b-416': 0xb234,\n 'blake2b-424': 0xb235,\n 'blake2b-432': 0xb236,\n 'blake2b-440': 0xb237,\n 'blake2b-448': 0xb238,\n 'blake2b-456': 0xb239,\n 'blake2b-464': 0xb23a,\n 'blake2b-472': 0xb23b,\n 'blake2b-480': 0xb23c,\n 'blake2b-488': 0xb23d,\n 'blake2b-496': 0xb23e,\n 'blake2b-504': 0xb23f,\n 'blake2b-512': 0xb240,\n 'blake2s-8': 0xb241,\n 'blake2s-16': 0xb242,\n 'blake2s-24': 0xb243,\n 'blake2s-32': 0xb244,\n 'blake2s-40': 0xb245,\n 'blake2s-48': 0xb246,\n 'blake2s-56': 0xb247,\n 'blake2s-64': 0xb248,\n 'blake2s-72': 0xb249,\n 'blake2s-80': 0xb24a,\n 'blake2s-88': 0xb24b,\n 'blake2s-96': 0xb24c,\n 'blake2s-104': 0xb24d,\n 'blake2s-112': 0xb24e,\n 'blake2s-120': 0xb24f,\n 'blake2s-128': 0xb250,\n 'blake2s-136': 0xb251,\n 'blake2s-144': 0xb252,\n 'blake2s-152': 0xb253,\n 'blake2s-160': 0xb254,\n 'blake2s-168': 0xb255,\n 'blake2s-176': 0xb256,\n 'blake2s-184': 0xb257,\n 'blake2s-192': 0xb258,\n 'blake2s-200': 0xb259,\n 'blake2s-208': 0xb25a,\n 'blake2s-216': 0xb25b,\n 'blake2s-224': 0xb25c,\n 'blake2s-232': 0xb25d,\n 'blake2s-240': 0xb25e,\n 'blake2s-248': 0xb25f,\n 'blake2s-256': 0xb260,\n 'skein256-8': 0xb301,\n 'skein256-16': 0xb302,\n 'skein256-24': 0xb303,\n 'skein256-32': 0xb304,\n 'skein256-40': 0xb305,\n 'skein256-48': 0xb306,\n 'skein256-56': 0xb307,\n 'skein256-64': 0xb308,\n 'skein256-72': 0xb309,\n 'skein256-80': 0xb30a,\n 'skein256-88': 0xb30b,\n 'skein256-96': 0xb30c,\n 'skein256-104': 0xb30d,\n 'skein256-112': 0xb30e,\n 'skein256-120': 0xb30f,\n 'skein256-128': 0xb310,\n 'skein256-136': 0xb311,\n 'skein256-144': 0xb312,\n 'skein256-152': 0xb313,\n 'skein256-160': 0xb314,\n 'skein256-168': 0xb315,\n 'skein256-176': 0xb316,\n 'skein256-184': 0xb317,\n 'skein256-192': 0xb318,\n 'skein256-200': 0xb319,\n 'skein256-208': 0xb31a,\n 'skein256-216': 0xb31b,\n 'skein256-224': 0xb31c,\n 'skein256-232': 0xb31d,\n 'skein256-240': 0xb31e,\n 'skein256-248': 0xb31f,\n 'skein256-256': 0xb320,\n 'skein512-8': 0xb321,\n 'skein512-16': 0xb322,\n 'skein512-24': 0xb323,\n 'skein512-32': 0xb324,\n 'skein512-40': 0xb325,\n 'skein512-48': 0xb326,\n 'skein512-56': 0xb327,\n 'skein512-64': 0xb328,\n 'skein512-72': 0xb329,\n 'skein512-80': 0xb32a,\n 'skein512-88': 0xb32b,\n 'skein512-96': 0xb32c,\n 'skein512-104': 0xb32d,\n 'skein512-112': 0xb32e,\n 'skein512-120': 0xb32f,\n 'skein512-128': 0xb330,\n 'skein512-136': 0xb331,\n 'skein512-144': 0xb332,\n 'skein512-152': 0xb333,\n 'skein512-160': 0xb334,\n 'skein512-168': 0xb335,\n 'skein512-176': 0xb336,\n 'skein512-184': 0xb337,\n 'skein512-192': 0xb338,\n 'skein512-200': 0xb339,\n 'skein512-208': 0xb33a,\n 'skein512-216': 0xb33b,\n 'skein512-224': 0xb33c,\n 'skein512-232': 0xb33d,\n 'skein512-240': 0xb33e,\n 'skein512-248': 0xb33f,\n 'skein512-256': 0xb340,\n 'skein512-264': 0xb341,\n 'skein512-272': 0xb342,\n 'skein512-280': 0xb343,\n 'skein512-288': 0xb344,\n 'skein512-296': 0xb345,\n 'skein512-304': 0xb346,\n 'skein512-312': 0xb347,\n 'skein512-320': 0xb348,\n 'skein512-328': 0xb349,\n 'skein512-336': 0xb34a,\n 'skein512-344': 0xb34b,\n 'skein512-352': 0xb34c,\n 'skein512-360': 0xb34d,\n 'skein512-368': 0xb34e,\n 'skein512-376': 0xb34f,\n 'skein512-384': 0xb350,\n 'skein512-392': 0xb351,\n 'skein512-400': 0xb352,\n 'skein512-408': 0xb353,\n 'skein512-416': 0xb354,\n 'skein512-424': 0xb355,\n 'skein512-432': 0xb356,\n 'skein512-440': 0xb357,\n 'skein512-448': 0xb358,\n 'skein512-456': 0xb359,\n 'skein512-464': 0xb35a,\n 'skein512-472': 0xb35b,\n 'skein512-480': 0xb35c,\n 'skein512-488': 0xb35d,\n 'skein512-496': 0xb35e,\n 'skein512-504': 0xb35f,\n 'skein512-512': 0xb360,\n 'skein1024-8': 0xb361,\n 'skein1024-16': 0xb362,\n 'skein1024-24': 0xb363,\n 'skein1024-32': 0xb364,\n 'skein1024-40': 0xb365,\n 'skein1024-48': 0xb366,\n 'skein1024-56': 0xb367,\n 'skein1024-64': 0xb368,\n 'skein1024-72': 0xb369,\n 'skein1024-80': 0xb36a,\n 'skein1024-88': 0xb36b,\n 'skein1024-96': 0xb36c,\n 'skein1024-104': 0xb36d,\n 'skein1024-112': 0xb36e,\n 'skein1024-120': 0xb36f,\n 'skein1024-128': 0xb370,\n 'skein1024-136': 0xb371,\n 'skein1024-144': 0xb372,\n 'skein1024-152': 0xb373,\n 'skein1024-160': 0xb374,\n 'skein1024-168': 0xb375,\n 'skein1024-176': 0xb376,\n 'skein1024-184': 0xb377,\n 'skein1024-192': 0xb378,\n 'skein1024-200': 0xb379,\n 'skein1024-208': 0xb37a,\n 'skein1024-216': 0xb37b,\n 'skein1024-224': 0xb37c,\n 'skein1024-232': 0xb37d,\n 'skein1024-240': 0xb37e,\n 'skein1024-248': 0xb37f,\n 'skein1024-256': 0xb380,\n 'skein1024-264': 0xb381,\n 'skein1024-272': 0xb382,\n 'skein1024-280': 0xb383,\n 'skein1024-288': 0xb384,\n 'skein1024-296': 0xb385,\n 'skein1024-304': 0xb386,\n 'skein1024-312': 0xb387,\n 'skein1024-320': 0xb388,\n 'skein1024-328': 0xb389,\n 'skein1024-336': 0xb38a,\n 'skein1024-344': 0xb38b,\n 'skein1024-352': 0xb38c,\n 'skein1024-360': 0xb38d,\n 'skein1024-368': 0xb38e,\n 'skein1024-376': 0xb38f,\n 'skein1024-384': 0xb390,\n 'skein1024-392': 0xb391,\n 'skein1024-400': 0xb392,\n 'skein1024-408': 0xb393,\n 'skein1024-416': 0xb394,\n 'skein1024-424': 0xb395,\n 'skein1024-432': 0xb396,\n 'skein1024-440': 0xb397,\n 'skein1024-448': 0xb398,\n 'skein1024-456': 0xb399,\n 'skein1024-464': 0xb39a,\n 'skein1024-472': 0xb39b,\n 'skein1024-480': 0xb39c,\n 'skein1024-488': 0xb39d,\n 'skein1024-496': 0xb39e,\n 'skein1024-504': 0xb39f,\n 'skein1024-512': 0xb3a0,\n 'skein1024-520': 0xb3a1,\n 'skein1024-528': 0xb3a2,\n 'skein1024-536': 0xb3a3,\n 'skein1024-544': 0xb3a4,\n 'skein1024-552': 0xb3a5,\n 'skein1024-560': 0xb3a6,\n 'skein1024-568': 0xb3a7,\n 'skein1024-576': 0xb3a8,\n 'skein1024-584': 0xb3a9,\n 'skein1024-592': 0xb3aa,\n 'skein1024-600': 0xb3ab,\n 'skein1024-608': 0xb3ac,\n 'skein1024-616': 0xb3ad,\n 'skein1024-624': 0xb3ae,\n 'skein1024-632': 0xb3af,\n 'skein1024-640': 0xb3b0,\n 'skein1024-648': 0xb3b1,\n 'skein1024-656': 0xb3b2,\n 'skein1024-664': 0xb3b3,\n 'skein1024-672': 0xb3b4,\n 'skein1024-680': 0xb3b5,\n 'skein1024-688': 0xb3b6,\n 'skein1024-696': 0xb3b7,\n 'skein1024-704': 0xb3b8,\n 'skein1024-712': 0xb3b9,\n 'skein1024-720': 0xb3ba,\n 'skein1024-728': 0xb3bb,\n 'skein1024-736': 0xb3bc,\n 'skein1024-744': 0xb3bd,\n 'skein1024-752': 0xb3be,\n 'skein1024-760': 0xb3bf,\n 'skein1024-768': 0xb3c0,\n 'skein1024-776': 0xb3c1,\n 'skein1024-784': 0xb3c2,\n 'skein1024-792': 0xb3c3,\n 'skein1024-800': 0xb3c4,\n 'skein1024-808': 0xb3c5,\n 'skein1024-816': 0xb3c6,\n 'skein1024-824': 0xb3c7,\n 'skein1024-832': 0xb3c8,\n 'skein1024-840': 0xb3c9,\n 'skein1024-848': 0xb3ca,\n 'skein1024-856': 0xb3cb,\n 'skein1024-864': 0xb3cc,\n 'skein1024-872': 0xb3cd,\n 'skein1024-880': 0xb3ce,\n 'skein1024-888': 0xb3cf,\n 'skein1024-896': 0xb3d0,\n 'skein1024-904': 0xb3d1,\n 'skein1024-912': 0xb3d2,\n 'skein1024-920': 0xb3d3,\n 'skein1024-928': 0xb3d4,\n 'skein1024-936': 0xb3d5,\n 'skein1024-944': 0xb3d6,\n 'skein1024-952': 0xb3d7,\n 'skein1024-960': 0xb3d8,\n 'skein1024-968': 0xb3d9,\n 'skein1024-976': 0xb3da,\n 'skein1024-984': 0xb3db,\n 'skein1024-992': 0xb3dc,\n 'skein1024-1000': 0xb3dd,\n 'skein1024-1008': 0xb3de,\n 'skein1024-1016': 0xb3df,\n 'skein1024-1024': 0xb3e0,\n 'poseidon-bls12_381-a2-fc1': 0xb401,\n 'poseidon-bls12_381-a2-fc1-sc': 0xb402\n})\n\nmodule.exports = { names }\n", "'use strict'\n\nconst { encoding: getCodec } = require('multibase')\nconst utf8Decoder = new TextDecoder('utf8')\n\n/**\n * @typedef {import('multibase/src/types').BaseName | 'utf8' | 'utf-8' | 'ascii' | undefined} SupportedEncodings\n */\n\n/**\n * Turns a Uint8Array of bytes into a string with each\n * character being the char code of the corresponding byte\n *\n * @param {Uint8Array} array - The array to turn into a string\n */\nfunction uint8ArrayToAsciiString (array) {\n let string = ''\n\n for (let i = 0; i < array.length; i++) {\n string += String.fromCharCode(array[i])\n }\n return string\n}\n\n/**\n * Turns a `Uint8Array` into a string.\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n *\n * @param {Uint8Array} array - The array to turn into a string\n * @param {SupportedEncodings} [encoding=utf8] - The encoding to use\n * @returns {string}\n */\nfunction toString (array, encoding = 'utf8') {\n if (encoding === 'utf8' || encoding === 'utf-8') {\n return utf8Decoder.decode(array)\n }\n\n if (encoding === 'ascii') {\n return uint8ArrayToAsciiString(array)\n }\n\n return getCodec(encoding).encode(array)\n}\n\nmodule.exports = toString\n", "'use strict'\n\nconst { encoding: getCodec } = require('multibase')\nconst utf8Encoder = new TextEncoder()\n\n/**\n * @typedef {import('multibase/src/types').BaseName | 'utf8' | 'utf-8' | 'ascii' | undefined} SupportedEncodings\n */\n\n/**\n * Interprets each character in a string as a byte and\n * returns a Uint8Array of those bytes.\n *\n * @param {string} string - The string to turn into an array\n */\nfunction asciiStringToUint8Array (string) {\n const array = new Uint8Array(string.length)\n\n for (let i = 0; i < string.length; i++) {\n array[i] = string.charCodeAt(i)\n }\n\n return array\n}\n\n/**\n * Create a `Uint8Array` from the passed string\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n *\n * @param {string} string\n * @param {SupportedEncodings} [encoding=utf8] - utf8, base16, base64, base64urlpad, etc\n * @returns {Uint8Array}\n */\nfunction fromString (string, encoding = 'utf8') {\n if (encoding === 'utf8' || encoding === 'utf-8') {\n return utf8Encoder.encode(string)\n }\n\n if (encoding === 'ascii') {\n return asciiStringToUint8Array(string)\n }\n\n return getCodec(encoding).decode(string)\n}\n\nmodule.exports = fromString\n", "'use strict'\n\n/**\n * Returns a new Uint8Array created by concatenating the passed ArrayLikes\n *\n * @param {Array<ArrayLike<number>>} arrays\n * @param {number} [length]\n */\nfunction concat (arrays, length) {\n if (!length) {\n length = arrays.reduce((acc, curr) => acc + curr.length, 0)\n }\n\n const output = new Uint8Array(length)\n let offset = 0\n\n for (const arr of arrays) {\n output.set(arr, offset)\n offset += arr.length\n }\n\n return output\n}\n\nmodule.exports = concat\n", "/**\n * Multihash implementation in JavaScript.\n */\n'use strict'\n\nconst multibase = require('multibase')\nconst varint = require('varint')\nconst { names } = require('./constants')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\nconst codes = /** @type {import('./types').CodeNameMap} */({})\n\n// eslint-disable-next-line guard-for-in\nfor (const key in names) {\n const name = /** @type {HashName} */(key)\n codes[names[name]] = name\n}\nObject.freeze(codes)\n\n/**\n * Convert the given multihash to a hex encoded string.\n *\n * @param {Uint8Array} hash\n * @returns {string}\n */\nfunction toHexString (hash) {\n if (!(hash instanceof Uint8Array)) {\n throw new Error('must be passed a Uint8Array')\n }\n\n return uint8ArrayToString(hash, 'base16')\n}\n\n/**\n * Convert the given hex encoded string to a multihash.\n *\n * @param {string} hash\n * @returns {Uint8Array}\n */\nfunction fromHexString (hash) {\n return uint8ArrayFromString(hash, 'base16')\n}\n\n/**\n * Convert the given multihash to a base58 encoded string.\n *\n * @param {Uint8Array} hash\n * @returns {string}\n */\nfunction toB58String (hash) {\n if (!(hash instanceof Uint8Array)) {\n throw new Error('must be passed a Uint8Array')\n }\n\n return uint8ArrayToString(multibase.encode('base58btc', hash)).slice(1)\n}\n\n/**\n * Convert the given base58 encoded string to a multihash.\n *\n * @param {string|Uint8Array} hash\n * @returns {Uint8Array}\n */\nfunction fromB58String (hash) {\n const encoded = hash instanceof Uint8Array\n ? uint8ArrayToString(hash)\n : hash\n\n return multibase.decode('z' + encoded)\n}\n\n/**\n * Decode a hash from the given multihash.\n *\n * @param {Uint8Array} bytes\n * @returns {{code: HashCode, name: HashName, length: number, digest: Uint8Array}} result\n */\nfunction decode (bytes) {\n if (!(bytes instanceof Uint8Array)) {\n throw new Error('multihash must be a Uint8Array')\n }\n\n if (bytes.length < 2) {\n throw new Error('multihash too short. must be > 2 bytes.')\n }\n\n const code = /** @type {HashCode} */(varint.decode(bytes))\n if (!isValidCode(code)) {\n throw new Error(`multihash unknown function code: 0x${code.toString(16)}`)\n }\n bytes = bytes.slice(varint.decode.bytes)\n\n const len = varint.decode(bytes)\n if (len < 0) {\n throw new Error(`multihash invalid length: ${len}`)\n }\n bytes = bytes.slice(varint.decode.bytes)\n\n if (bytes.length !== len) {\n throw new Error(`multihash length inconsistent: 0x${uint8ArrayToString(bytes, 'base16')}`)\n }\n\n return {\n code,\n name: codes[code],\n length: len,\n digest: bytes\n }\n}\n\n/**\n * Encode a hash digest along with the specified function code.\n *\n * > **Note:** the length is derived from the length of the digest itself.\n *\n * @param {Uint8Array} digest\n * @param {HashName | HashCode} code\n * @param {number} [length]\n * @returns {Uint8Array}\n */\nfunction encode (digest, code, length) {\n if (!digest || code === undefined) {\n throw new Error('multihash encode requires at least two args: digest, code')\n }\n\n // ensure it's a hashfunction code.\n const hashfn = coerceCode(code)\n\n if (!(digest instanceof Uint8Array)) {\n throw new Error('digest should be a Uint8Array')\n }\n\n if (length == null) {\n length = digest.length\n }\n\n if (length && digest.length !== length) {\n throw new Error('digest length should be equal to specified length.')\n }\n\n const hash = varint.encode(hashfn)\n const len = varint.encode(length)\n return uint8ArrayConcat([hash, len, digest], hash.length + len.length + digest.length)\n}\n\n/**\n * Converts a hash function name into the matching code.\n * If passed a number it will return the number if it's a valid code.\n *\n * @param {HashName | number} name\n * @returns {number}\n */\nfunction coerceCode (name) {\n let code = name\n\n if (typeof name === 'string') {\n if (names[name] === undefined) {\n throw new Error(`Unrecognized hash function named: ${name}`)\n }\n code = names[name]\n }\n\n if (typeof code !== 'number') {\n throw new Error(`Hash function code should be a number. Got: ${code}`)\n }\n\n // @ts-ignore\n if (codes[code] === undefined && !isAppCode(code)) {\n throw new Error(`Unrecognized function code: ${code}`)\n }\n\n return code\n}\n\n/**\n * Checks if a code is part of the app range\n *\n * @param {number} code\n * @returns {boolean}\n */\nfunction isAppCode (code) {\n return code > 0 && code < 0x10\n}\n\n/**\n * Checks whether a multihash code is valid.\n *\n * @param {HashCode} code\n * @returns {boolean}\n */\nfunction isValidCode (code) {\n if (isAppCode(code)) {\n return true\n }\n\n if (codes[code]) {\n return true\n }\n\n return false\n}\n\n/**\n * Check if the given buffer is a valid multihash. Throws an error if it is not valid.\n *\n * @param {Uint8Array} multihash\n * @returns {void}\n * @throws {Error}\n */\nfunction validate (multihash) {\n decode(multihash) // throws if bad.\n}\n\n/**\n * Returns a prefix from a valid multihash. Throws an error if it is not valid.\n *\n * @param {Uint8Array} multihash\n * @returns {Uint8Array}\n * @throws {Error}\n */\nfunction prefix (multihash) {\n validate(multihash)\n\n return multihash.subarray(0, 2)\n}\n\nmodule.exports = {\n names,\n codes,\n toHexString,\n fromHexString,\n toB58String,\n fromB58String,\n decode,\n encode,\n coerceCode,\n isAppCode,\n validate,\n prefix,\n isValidCode\n}\n\n/**\n * @typedef { import(\"./constants\").HashCode } HashCode\n * @typedef { import(\"./constants\").HashName } HashName\n */\n", "module.exports = encode\n\nvar MSB = 0x80\n , REST = 0x7F\n , MSBALL = ~REST\n , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n out = out || []\n offset = offset || 0\n var oldOffset = offset\n\n while(num >= INT) {\n out[offset++] = (num & 0xFF) | MSB\n num /= 128\n }\n while(num & MSBALL) {\n out[offset++] = (num & 0xFF) | MSB\n num >>>= 7\n }\n out[offset] = num | 0\n \n encode.bytes = offset - oldOffset + 1\n \n return out\n}\n", "module.exports = read\n\nvar MSB = 0x80\n , REST = 0x7F\n\nfunction read(buf, offset) {\n var res = 0\n , offset = offset || 0\n , shift = 0\n , counter = offset\n , b\n , l = buf.length\n\n do {\n if (counter >= l) {\n read.bytes = 0\n throw new RangeError('Could not decode varint')\n }\n b = buf[counter++]\n res += shift < 28\n ? (b & REST) << shift\n : (b & REST) * Math.pow(2, shift)\n shift += 7\n } while (b >= MSB)\n\n read.bytes = counter - offset\n\n return res\n}\n", "\nvar N1 = Math.pow(2, 7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n return (\n value < N1 ? 1\n : value < N2 ? 2\n : value < N3 ? 3\n : value < N4 ? 4\n : value < N5 ? 5\n : value < N6 ? 6\n : value < N7 ? 7\n : value < N8 ? 8\n : value < N9 ? 9\n : 10\n )\n}\n", "module.exports = {\n encode: require('./encode.js')\n , decode: require('./decode.js')\n , encodingLength: require('./length.js')\n}\n", "'use strict'\n\nconst varint = require('varint')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nmodule.exports = {\n numberToUint8Array,\n uint8ArrayToNumber,\n varintUint8ArrayEncode,\n varintEncode\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction uint8ArrayToNumber (buf) {\n return parseInt(uint8ArrayToString(buf, 'base16'), 16)\n}\n\n/**\n * @param {number} num\n */\nfunction numberToUint8Array (num) {\n let hexString = num.toString(16)\n if (hexString.length % 2 === 1) {\n hexString = '0' + hexString\n }\n return uint8ArrayFromString(hexString, 'base16')\n}\n\n/**\n * @param {Uint8Array} input\n */\nfunction varintUint8ArrayEncode (input) {\n return Uint8Array.from(varint.encode(uint8ArrayToNumber(input)))\n}\n\n/**\n * @param {number} num\n */\nfunction varintEncode (num) {\n return Uint8Array.from(varint.encode(num))\n}\n", "// DO NOT CHANGE THIS FILE. IT IS GENERATED BY tools/update-table.js\n/* eslint quote-props: off */\n'use strict'\n\n/**\n * @type {import('./generated-types').NameCodeMap}\n */\nconst baseTable = Object.freeze({\n 'identity': 0x00,\n 'cidv1': 0x01,\n 'cidv2': 0x02,\n 'cidv3': 0x03,\n 'ip4': 0x04,\n 'tcp': 0x06,\n 'sha1': 0x11,\n 'sha2-256': 0x12,\n 'sha2-512': 0x13,\n 'sha3-512': 0x14,\n 'sha3-384': 0x15,\n 'sha3-256': 0x16,\n 'sha3-224': 0x17,\n 'shake-128': 0x18,\n 'shake-256': 0x19,\n 'keccak-224': 0x1a,\n 'keccak-256': 0x1b,\n 'keccak-384': 0x1c,\n 'keccak-512': 0x1d,\n 'blake3': 0x1e,\n 'dccp': 0x21,\n 'murmur3-128': 0x22,\n 'murmur3-32': 0x23,\n 'ip6': 0x29,\n 'ip6zone': 0x2a,\n 'path': 0x2f,\n 'multicodec': 0x30,\n 'multihash': 0x31,\n 'multiaddr': 0x32,\n 'multibase': 0x33,\n 'dns': 0x35,\n 'dns4': 0x36,\n 'dns6': 0x37,\n 'dnsaddr': 0x38,\n 'protobuf': 0x50,\n 'cbor': 0x51,\n 'raw': 0x55,\n 'dbl-sha2-256': 0x56,\n 'rlp': 0x60,\n 'bencode': 0x63,\n 'dag-pb': 0x70,\n 'dag-cbor': 0x71,\n 'libp2p-key': 0x72,\n 'git-raw': 0x78,\n 'torrent-info': 0x7b,\n 'torrent-file': 0x7c,\n 'leofcoin-block': 0x81,\n 'leofcoin-tx': 0x82,\n 'leofcoin-pr': 0x83,\n 'sctp': 0x84,\n 'dag-jose': 0x85,\n 'dag-cose': 0x86,\n 'eth-block': 0x90,\n 'eth-block-list': 0x91,\n 'eth-tx-trie': 0x92,\n 'eth-tx': 0x93,\n 'eth-tx-receipt-trie': 0x94,\n 'eth-tx-receipt': 0x95,\n 'eth-state-trie': 0x96,\n 'eth-account-snapshot': 0x97,\n 'eth-storage-trie': 0x98,\n 'bitcoin-block': 0xb0,\n 'bitcoin-tx': 0xb1,\n 'bitcoin-witness-commitment': 0xb2,\n 'zcash-block': 0xc0,\n 'zcash-tx': 0xc1,\n 'docid': 0xce,\n 'stellar-block': 0xd0,\n 'stellar-tx': 0xd1,\n 'md4': 0xd4,\n 'md5': 0xd5,\n 'bmt': 0xd6,\n 'decred-block': 0xe0,\n 'decred-tx': 0xe1,\n 'ipld-ns': 0xe2,\n 'ipfs-ns': 0xe3,\n 'swarm-ns': 0xe4,\n 'ipns-ns': 0xe5,\n 'zeronet': 0xe6,\n 'secp256k1-pub': 0xe7,\n 'bls12_381-g1-pub': 0xea,\n 'bls12_381-g2-pub': 0xeb,\n 'x25519-pub': 0xec,\n 'ed25519-pub': 0xed,\n 'bls12_381-g1g2-pub': 0xee,\n 'dash-block': 0xf0,\n 'dash-tx': 0xf1,\n 'swarm-manifest': 0xfa,\n 'swarm-feed': 0xfb,\n 'udp': 0x0111,\n 'p2p-webrtc-star': 0x0113,\n 'p2p-webrtc-direct': 0x0114,\n 'p2p-stardust': 0x0115,\n 'p2p-circuit': 0x0122,\n 'dag-json': 0x0129,\n 'udt': 0x012d,\n 'utp': 0x012e,\n 'unix': 0x0190,\n 'thread': 0x0196,\n 'p2p': 0x01a5,\n 'ipfs': 0x01a5,\n 'https': 0x01bb,\n 'onion': 0x01bc,\n 'onion3': 0x01bd,\n 'garlic64': 0x01be,\n 'garlic32': 0x01bf,\n 'tls': 0x01c0,\n 'quic': 0x01cc,\n 'ws': 0x01dd,\n 'wss': 0x01de,\n 'p2p-websocket-star': 0x01df,\n 'http': 0x01e0,\n 'json': 0x0200,\n 'messagepack': 0x0201,\n 'libp2p-peer-record': 0x0301,\n 'sha2-256-trunc254-padded': 0x1012,\n 'ripemd-128': 0x1052,\n 'ripemd-160': 0x1053,\n 'ripemd-256': 0x1054,\n 'ripemd-320': 0x1055,\n 'x11': 0x1100,\n 'p256-pub': 0x1200,\n 'p384-pub': 0x1201,\n 'p521-pub': 0x1202,\n 'ed448-pub': 0x1203,\n 'x448-pub': 0x1204,\n 'ed25519-priv': 0x1300,\n 'kangarootwelve': 0x1d01,\n 'sm3-256': 0x534d,\n 'blake2b-8': 0xb201,\n 'blake2b-16': 0xb202,\n 'blake2b-24': 0xb203,\n 'blake2b-32': 0xb204,\n 'blake2b-40': 0xb205,\n 'blake2b-48': 0xb206,\n 'blake2b-56': 0xb207,\n 'blake2b-64': 0xb208,\n 'blake2b-72': 0xb209,\n 'blake2b-80': 0xb20a,\n 'blake2b-88': 0xb20b,\n 'blake2b-96': 0xb20c,\n 'blake2b-104': 0xb20d,\n 'blake2b-112': 0xb20e,\n 'blake2b-120': 0xb20f,\n 'blake2b-128': 0xb210,\n 'blake2b-136': 0xb211,\n 'blake2b-144': 0xb212,\n 'blake2b-152': 0xb213,\n 'blake2b-160': 0xb214,\n 'blake2b-168': 0xb215,\n 'blake2b-176': 0xb216,\n 'blake2b-184': 0xb217,\n 'blake2b-192': 0xb218,\n 'blake2b-200': 0xb219,\n 'blake2b-208': 0xb21a,\n 'blake2b-216': 0xb21b,\n 'blake2b-224': 0xb21c,\n 'blake2b-232': 0xb21d,\n 'blake2b-240': 0xb21e,\n 'blake2b-248': 0xb21f,\n 'blake2b-256': 0xb220,\n 'blake2b-264': 0xb221,\n 'blake2b-272': 0xb222,\n 'blake2b-280': 0xb223,\n 'blake2b-288': 0xb224,\n 'blake2b-296': 0xb225,\n 'blake2b-304': 0xb226,\n 'blake2b-312': 0xb227,\n 'blake2b-320': 0xb228,\n 'blake2b-328': 0xb229,\n 'blake2b-336': 0xb22a,\n 'blake2b-344': 0xb22b,\n 'blake2b-352': 0xb22c,\n 'blake2b-360': 0xb22d,\n 'blake2b-368': 0xb22e,\n 'blake2b-376': 0xb22f,\n 'blake2b-384': 0xb230,\n 'blake2b-392': 0xb231,\n 'blake2b-400': 0xb232,\n 'blake2b-408': 0xb233,\n 'blake2b-416': 0xb234,\n 'blake2b-424': 0xb235,\n 'blake2b-432': 0xb236,\n 'blake2b-440': 0xb237,\n 'blake2b-448': 0xb238,\n 'blake2b-456': 0xb239,\n 'blake2b-464': 0xb23a,\n 'blake2b-472': 0xb23b,\n 'blake2b-480': 0xb23c,\n 'blake2b-488': 0xb23d,\n 'blake2b-496': 0xb23e,\n 'blake2b-504': 0xb23f,\n 'blake2b-512': 0xb240,\n 'blake2s-8': 0xb241,\n 'blake2s-16': 0xb242,\n 'blake2s-24': 0xb243,\n 'blake2s-32': 0xb244,\n 'blake2s-40': 0xb245,\n 'blake2s-48': 0xb246,\n 'blake2s-56': 0xb247,\n 'blake2s-64': 0xb248,\n 'blake2s-72': 0xb249,\n 'blake2s-80': 0xb24a,\n 'blake2s-88': 0xb24b,\n 'blake2s-96': 0xb24c,\n 'blake2s-104': 0xb24d,\n 'blake2s-112': 0xb24e,\n 'blake2s-120': 0xb24f,\n 'blake2s-128': 0xb250,\n 'blake2s-136': 0xb251,\n 'blake2s-144': 0xb252,\n 'blake2s-152': 0xb253,\n 'blake2s-160': 0xb254,\n 'blake2s-168': 0xb255,\n 'blake2s-176': 0xb256,\n 'blake2s-184': 0xb257,\n 'blake2s-192': 0xb258,\n 'blake2s-200': 0xb259,\n 'blake2s-208': 0xb25a,\n 'blake2s-216': 0xb25b,\n 'blake2s-224': 0xb25c,\n 'blake2s-232': 0xb25d,\n 'blake2s-240': 0xb25e,\n 'blake2s-248': 0xb25f,\n 'blake2s-256': 0xb260,\n 'skein256-8': 0xb301,\n 'skein256-16': 0xb302,\n 'skein256-24': 0xb303,\n 'skein256-32': 0xb304,\n 'skein256-40': 0xb305,\n 'skein256-48': 0xb306,\n 'skein256-56': 0xb307,\n 'skein256-64': 0xb308,\n 'skein256-72': 0xb309,\n 'skein256-80': 0xb30a,\n 'skein256-88': 0xb30b,\n 'skein256-96': 0xb30c,\n 'skein256-104': 0xb30d,\n 'skein256-112': 0xb30e,\n 'skein256-120': 0xb30f,\n 'skein256-128': 0xb310,\n 'skein256-136': 0xb311,\n 'skein256-144': 0xb312,\n 'skein256-152': 0xb313,\n 'skein256-160': 0xb314,\n 'skein256-168': 0xb315,\n 'skein256-176': 0xb316,\n 'skein256-184': 0xb317,\n 'skein256-192': 0xb318,\n 'skein256-200': 0xb319,\n 'skein256-208': 0xb31a,\n 'skein256-216': 0xb31b,\n 'skein256-224': 0xb31c,\n 'skein256-232': 0xb31d,\n 'skein256-240': 0xb31e,\n 'skein256-248': 0xb31f,\n 'skein256-256': 0xb320,\n 'skein512-8': 0xb321,\n 'skein512-16': 0xb322,\n 'skein512-24': 0xb323,\n 'skein512-32': 0xb324,\n 'skein512-40': 0xb325,\n 'skein512-48': 0xb326,\n 'skein512-56': 0xb327,\n 'skein512-64': 0xb328,\n 'skein512-72': 0xb329,\n 'skein512-80': 0xb32a,\n 'skein512-88': 0xb32b,\n 'skein512-96': 0xb32c,\n 'skein512-104': 0xb32d,\n 'skein512-112': 0xb32e,\n 'skein512-120': 0xb32f,\n 'skein512-128': 0xb330,\n 'skein512-136': 0xb331,\n 'skein512-144': 0xb332,\n 'skein512-152': 0xb333,\n 'skein512-160': 0xb334,\n 'skein512-168': 0xb335,\n 'skein512-176': 0xb336,\n 'skein512-184': 0xb337,\n 'skein512-192': 0xb338,\n 'skein512-200': 0xb339,\n 'skein512-208': 0xb33a,\n 'skein512-216': 0xb33b,\n 'skein512-224': 0xb33c,\n 'skein512-232': 0xb33d,\n 'skein512-240': 0xb33e,\n 'skein512-248': 0xb33f,\n 'skein512-256': 0xb340,\n 'skein512-264': 0xb341,\n 'skein512-272': 0xb342,\n 'skein512-280': 0xb343,\n 'skein512-288': 0xb344,\n 'skein512-296': 0xb345,\n 'skein512-304': 0xb346,\n 'skein512-312': 0xb347,\n 'skein512-320': 0xb348,\n 'skein512-328': 0xb349,\n 'skein512-336': 0xb34a,\n 'skein512-344': 0xb34b,\n 'skein512-352': 0xb34c,\n 'skein512-360': 0xb34d,\n 'skein512-368': 0xb34e,\n 'skein512-376': 0xb34f,\n 'skein512-384': 0xb350,\n 'skein512-392': 0xb351,\n 'skein512-400': 0xb352,\n 'skein512-408': 0xb353,\n 'skein512-416': 0xb354,\n 'skein512-424': 0xb355,\n 'skein512-432': 0xb356,\n 'skein512-440': 0xb357,\n 'skein512-448': 0xb358,\n 'skein512-456': 0xb359,\n 'skein512-464': 0xb35a,\n 'skein512-472': 0xb35b,\n 'skein512-480': 0xb35c,\n 'skein512-488': 0xb35d,\n 'skein512-496': 0xb35e,\n 'skein512-504': 0xb35f,\n 'skein512-512': 0xb360,\n 'skein1024-8': 0xb361,\n 'skein1024-16': 0xb362,\n 'skein1024-24': 0xb363,\n 'skein1024-32': 0xb364,\n 'skein1024-40': 0xb365,\n 'skein1024-48': 0xb366,\n 'skein1024-56': 0xb367,\n 'skein1024-64': 0xb368,\n 'skein1024-72': 0xb369,\n 'skein1024-80': 0xb36a,\n 'skein1024-88': 0xb36b,\n 'skein1024-96': 0xb36c,\n 'skein1024-104': 0xb36d,\n 'skein1024-112': 0xb36e,\n 'skein1024-120': 0xb36f,\n 'skein1024-128': 0xb370,\n 'skein1024-136': 0xb371,\n 'skein1024-144': 0xb372,\n 'skein1024-152': 0xb373,\n 'skein1024-160': 0xb374,\n 'skein1024-168': 0xb375,\n 'skein1024-176': 0xb376,\n 'skein1024-184': 0xb377,\n 'skein1024-192': 0xb378,\n 'skein1024-200': 0xb379,\n 'skein1024-208': 0xb37a,\n 'skein1024-216': 0xb37b,\n 'skein1024-224': 0xb37c,\n 'skein1024-232': 0xb37d,\n 'skein1024-240': 0xb37e,\n 'skein1024-248': 0xb37f,\n 'skein1024-256': 0xb380,\n 'skein1024-264': 0xb381,\n 'skein1024-272': 0xb382,\n 'skein1024-280': 0xb383,\n 'skein1024-288': 0xb384,\n 'skein1024-296': 0xb385,\n 'skein1024-304': 0xb386,\n 'skein1024-312': 0xb387,\n 'skein1024-320': 0xb388,\n 'skein1024-328': 0xb389,\n 'skein1024-336': 0xb38a,\n 'skein1024-344': 0xb38b,\n 'skein1024-352': 0xb38c,\n 'skein1024-360': 0xb38d,\n 'skein1024-368': 0xb38e,\n 'skein1024-376': 0xb38f,\n 'skein1024-384': 0xb390,\n 'skein1024-392': 0xb391,\n 'skein1024-400': 0xb392,\n 'skein1024-408': 0xb393,\n 'skein1024-416': 0xb394,\n 'skein1024-424': 0xb395,\n 'skein1024-432': 0xb396,\n 'skein1024-440': 0xb397,\n 'skein1024-448': 0xb398,\n 'skein1024-456': 0xb399,\n 'skein1024-464': 0xb39a,\n 'skein1024-472': 0xb39b,\n 'skein1024-480': 0xb39c,\n 'skein1024-488': 0xb39d,\n 'skein1024-496': 0xb39e,\n 'skein1024-504': 0xb39f,\n 'skein1024-512': 0xb3a0,\n 'skein1024-520': 0xb3a1,\n 'skein1024-528': 0xb3a2,\n 'skein1024-536': 0xb3a3,\n 'skein1024-544': 0xb3a4,\n 'skein1024-552': 0xb3a5,\n 'skein1024-560': 0xb3a6,\n 'skein1024-568': 0xb3a7,\n 'skein1024-576': 0xb3a8,\n 'skein1024-584': 0xb3a9,\n 'skein1024-592': 0xb3aa,\n 'skein1024-600': 0xb3ab,\n 'skein1024-608': 0xb3ac,\n 'skein1024-616': 0xb3ad,\n 'skein1024-624': 0xb3ae,\n 'skein1024-632': 0xb3af,\n 'skein1024-640': 0xb3b0,\n 'skein1024-648': 0xb3b1,\n 'skein1024-656': 0xb3b2,\n 'skein1024-664': 0xb3b3,\n 'skein1024-672': 0xb3b4,\n 'skein1024-680': 0xb3b5,\n 'skein1024-688': 0xb3b6,\n 'skein1024-696': 0xb3b7,\n 'skein1024-704': 0xb3b8,\n 'skein1024-712': 0xb3b9,\n 'skein1024-720': 0xb3ba,\n 'skein1024-728': 0xb3bb,\n 'skein1024-736': 0xb3bc,\n 'skein1024-744': 0xb3bd,\n 'skein1024-752': 0xb3be,\n 'skein1024-760': 0xb3bf,\n 'skein1024-768': 0xb3c0,\n 'skein1024-776': 0xb3c1,\n 'skein1024-784': 0xb3c2,\n 'skein1024-792': 0xb3c3,\n 'skein1024-800': 0xb3c4,\n 'skein1024-808': 0xb3c5,\n 'skein1024-816': 0xb3c6,\n 'skein1024-824': 0xb3c7,\n 'skein1024-832': 0xb3c8,\n 'skein1024-840': 0xb3c9,\n 'skein1024-848': 0xb3ca,\n 'skein1024-856': 0xb3cb,\n 'skein1024-864': 0xb3cc,\n 'skein1024-872': 0xb3cd,\n 'skein1024-880': 0xb3ce,\n 'skein1024-888': 0xb3cf,\n 'skein1024-896': 0xb3d0,\n 'skein1024-904': 0xb3d1,\n 'skein1024-912': 0xb3d2,\n 'skein1024-920': 0xb3d3,\n 'skein1024-928': 0xb3d4,\n 'skein1024-936': 0xb3d5,\n 'skein1024-944': 0xb3d6,\n 'skein1024-952': 0xb3d7,\n 'skein1024-960': 0xb3d8,\n 'skein1024-968': 0xb3d9,\n 'skein1024-976': 0xb3da,\n 'skein1024-984': 0xb3db,\n 'skein1024-992': 0xb3dc,\n 'skein1024-1000': 0xb3dd,\n 'skein1024-1008': 0xb3de,\n 'skein1024-1016': 0xb3df,\n 'skein1024-1024': 0xb3e0,\n 'poseidon-bls12_381-a2-fc1': 0xb401,\n 'poseidon-bls12_381-a2-fc1-sc': 0xb402,\n 'zeroxcert-imprint-256': 0xce11,\n 'fil-commitment-unsealed': 0xf101,\n 'fil-commitment-sealed': 0xf102,\n 'holochain-adr-v0': 0x807124,\n 'holochain-adr-v1': 0x817124,\n 'holochain-key-v0': 0x947124,\n 'holochain-key-v1': 0x957124,\n 'holochain-sig-v0': 0xa27124,\n 'holochain-sig-v1': 0xa37124,\n 'skynet-ns': 0xb19910\n})\n\nmodule.exports = { baseTable }\n", "'use strict'\n\n/** @typedef {import('./generated-types').ConstantCodeMap} ConstantCodeMap */\n/** @typedef {import('./generated-types').NameUint8ArrayMap} NameUint8ArrayMap */\n/** @typedef {import('./generated-types').CodeNameMap} CodeNameMap */\n/** @typedef {import('./generated-types').CodecName} CodecName */\n/** @typedef {import('./generated-types').CodecConstant} CodecConstant */\n\nconst { baseTable } = require('./generated-table')\nconst varintEncode = require('./util').varintEncode\n\nconst nameToVarint = /** @type {NameUint8ArrayMap} */ ({})\nconst constantToCode = /** @type {ConstantCodeMap} */({})\nconst codeToName = /** @type {CodeNameMap} */({})\n\n// eslint-disable-next-line guard-for-in\nfor (const name in baseTable) {\n const codecName = /** @type {CodecName} */(name)\n const code = baseTable[codecName]\n nameToVarint[codecName] = varintEncode(code)\n\n const constant = /** @type {CodecConstant} */(codecName.toUpperCase().replace(/-/g, '_'))\n constantToCode[constant] = code\n\n if (!codeToName[code]) {\n codeToName[code] = codecName\n }\n}\n\nObject.freeze(nameToVarint)\nObject.freeze(constantToCode)\nObject.freeze(codeToName)\nconst nameToCode = Object.freeze(baseTable)\nmodule.exports = {\n nameToVarint,\n constantToCode,\n nameToCode,\n codeToName\n}\n", "/**\n * Implementation of the multicodec specification.\n *\n * @module multicodec\n * @example\n * const multicodec = require('multicodec')\n *\n * const prefixedProtobuf = multicodec.addPrefix('protobuf', protobufBuffer)\n * // prefixedProtobuf 0x50...\n *\n */\n'use strict'\n\n/** @typedef {import('./generated-types').CodecName} CodecName */\n/** @typedef {import('./generated-types').CodecCode} CodecCode */\n\nconst varint = require('varint')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst util = require('./util')\nconst { nameToVarint, constantToCode, nameToCode, codeToName } = require('./maps')\n\n/**\n * Prefix a buffer with a multicodec-packed.\n *\n * @param {CodecName|Uint8Array} multicodecStrOrCode\n * @param {Uint8Array} data\n * @returns {Uint8Array}\n */\nfunction addPrefix (multicodecStrOrCode, data) {\n let prefix\n\n if (multicodecStrOrCode instanceof Uint8Array) {\n prefix = util.varintUint8ArrayEncode(multicodecStrOrCode)\n } else {\n if (nameToVarint[multicodecStrOrCode]) {\n prefix = nameToVarint[multicodecStrOrCode]\n } else {\n throw new Error('multicodec not recognized')\n }\n }\n\n return uint8ArrayConcat([prefix, data], prefix.length + data.length)\n}\n\n/**\n * Decapsulate the multicodec-packed prefix from the data.\n *\n * @param {Uint8Array} data\n * @returns {Uint8Array}\n */\nfunction rmPrefix (data) {\n varint.decode(/** @type {Buffer} */(data))\n return data.slice(varint.decode.bytes)\n}\n\n/**\n * Get the codec name of the prefixed data.\n *\n * @param {Uint8Array} prefixedData\n * @returns {CodecName}\n */\nfunction getNameFromData (prefixedData) {\n const code = /** @type {CodecCode} */(varint.decode(/** @type {Buffer} */(prefixedData)))\n const name = codeToName[code]\n if (name === undefined) {\n throw new Error(`Code \"${code}\" not found`)\n }\n return name\n}\n\n/**\n * Get the codec name from a code.\n *\n * @param {CodecCode} codec\n * @returns {CodecName}\n */\nfunction getNameFromCode (codec) {\n return codeToName[codec]\n}\n\n/**\n * Get the code of the codec\n *\n * @param {CodecName} name\n * @returns {CodecCode}\n */\nfunction getCodeFromName (name) {\n const code = nameToCode[name]\n if (code === undefined) {\n throw new Error(`Codec \"${name}\" not found`)\n }\n return code\n}\n\n/**\n * Get the code of the prefixed data.\n *\n * @param {Uint8Array} prefixedData\n * @returns {CodecCode}\n */\nfunction getCodeFromData (prefixedData) {\n return /** @type {CodecCode} */(varint.decode(/** @type {Buffer} */(prefixedData)))\n}\n\n/**\n * Get the code as varint of a codec name.\n *\n * @param {CodecName} name\n * @returns {Uint8Array}\n */\nfunction getVarintFromName (name) {\n const code = nameToVarint[name]\n if (code === undefined) {\n throw new Error(`Codec \"${name}\" not found`)\n }\n return code\n}\n\n/**\n * Get the varint of a code.\n *\n * @param {CodecCode} code\n * @returns {Uint8Array}\n */\nfunction getVarintFromCode (code) {\n return util.varintEncode(code)\n}\n\n/**\n * Get the codec name of the prefixed data.\n *\n * @deprecated use getNameFromData instead.\n * @param {Uint8Array} prefixedData\n * @returns {CodecName}\n */\nfunction getCodec (prefixedData) {\n return getNameFromData(prefixedData)\n}\n\n/**\n * Get the codec name from a code.\n *\n * @deprecated use getNameFromCode instead.\n * @param {CodecCode} codec\n * @returns {CodecName}\n */\nfunction getName (codec) {\n return getNameFromCode(codec)\n}\n\n/**\n * Get the code of the codec\n *\n * @deprecated use getCodeFromName instead.\n * @param {CodecName} name\n * @returns {CodecCode}\n */\nfunction getNumber (name) {\n return getCodeFromName(name)\n}\n\n/**\n * Get the code of the prefixed data.\n *\n * @deprecated use getCodeFromData instead.\n * @param {Uint8Array} prefixedData\n * @returns {CodecCode}\n */\nfunction getCode (prefixedData) {\n return getCodeFromData(prefixedData)\n}\n\n/**\n * Get the code as varint of a codec name.\n *\n * @deprecated use getVarintFromName instead.\n * @param {CodecName} name\n * @returns {Uint8Array}\n */\nfunction getCodeVarint (name) {\n return getVarintFromName(name)\n}\n\n/**\n * Get the varint of a code.\n *\n * @deprecated use getVarintFromCode instead.\n * @param {CodecCode} code\n * @returns {Array.<number>}\n */\nfunction getVarint (code) {\n return Array.from(getVarintFromCode(code))\n}\n\nmodule.exports = {\n addPrefix,\n rmPrefix,\n getNameFromData,\n getNameFromCode,\n getCodeFromName,\n getCodeFromData,\n getVarintFromName,\n getVarintFromCode,\n // Deprecated\n getCodec,\n getName,\n getNumber,\n getCode,\n getCodeVarint,\n getVarint,\n // Make the constants top-level constants\n ...constantToCode,\n // Export the maps\n nameToVarint,\n nameToCode,\n codeToName\n}\n", "'use strict'\n\nconst mh = require('multihashes')\n\nconst CIDUtil = {\n /**\n * Test if the given input is a valid CID object.\n * Returns an error message if it is not.\n * Returns undefined if it is a valid CID.\n *\n * @param {any} other\n * @returns {string|undefined}\n */\n checkCIDComponents: function (other) {\n if (other == null) {\n return 'null values are not valid CIDs'\n }\n\n if (!(other.version === 0 || other.version === 1)) {\n return 'Invalid version, must be a number equal to 1 or 0'\n }\n\n if (typeof other.codec !== 'string') {\n return 'codec must be string'\n }\n\n if (other.version === 0) {\n if (other.codec !== 'dag-pb') {\n return \"codec must be 'dag-pb' for CIDv0\"\n }\n if (other.multibaseName !== 'base58btc') {\n return \"multibaseName must be 'base58btc' for CIDv0\"\n }\n }\n\n if (!(other.multihash instanceof Uint8Array)) {\n return 'multihash must be a Uint8Array'\n }\n\n try {\n mh.validate(other.multihash)\n } catch (err) {\n let errorMsg = err.message\n if (!errorMsg) { // Just in case mh.validate() throws an error with empty error message\n errorMsg = 'Multihash validation failed'\n }\n return errorMsg\n }\n }\n}\n\nmodule.exports = CIDUtil\n", "'use strict'\n\n/**\n * Returns true if the two passed Uint8Arrays have the same content\n *\n * @param {Uint8Array} a\n * @param {Uint8Array} b\n */\nfunction equals (a, b) {\n if (a === b) {\n return true\n }\n\n if (a.byteLength !== b.byteLength) {\n return false\n }\n\n for (let i = 0; i < a.byteLength; i++) {\n if (a[i] !== b[i]) {\n return false\n }\n }\n\n return true\n}\n\nmodule.exports = equals\n", "'use strict'\n\nconst mh = require('multihashes')\nconst multibase = require('multibase')\nconst multicodec = require('multicodec')\nconst CIDUtil = require('./cid-util')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\nconst codecs = multicodec.nameToCode\nconst codecInts = /** @type {CodecName[]} */(Object.keys(codecs)).reduce((p, name) => {\n p[codecs[name]] = name\n return p\n}, /** @type {Record<CodecCode, CodecName>} */({}))\n\nconst symbol = Symbol.for('@ipld/js-cid/CID')\n\n/**\n * @typedef {Object} SerializedCID\n * @property {string} codec\n * @property {number} version\n * @property {Uint8Array} hash\n */\n/**\n * @typedef {0|1} CIDVersion\n * @typedef {import('multibase').BaseNameOrCode} BaseNameOrCode\n * @typedef {import('multicodec').CodecName} CodecName\n * @typedef {import('multicodec').CodecCode} CodecCode\n */\n\n/**\n * Class representing a CID `<mbase><version><mcodec><mhash>`\n * , as defined in [ipld/cid](https://github.com/multiformats/cid).\n *\n * @class CID\n */\nclass CID {\n /**\n * Create a new CID.\n *\n * The algorithm for argument input is roughly:\n * ```\n * if (cid)\n * -> create a copy\n * else if (str)\n * if (1st char is on multibase table) -> CID String\n * else -> bs58 encoded multihash\n * else if (Uint8Array)\n * if (1st byte is 0 or 1) -> CID\n * else -> multihash\n * else if (Number)\n * -> construct CID by parts\n * ```\n *\n * @param {CIDVersion | string | Uint8Array | CID} version\n * @param {string|number} [codec]\n * @param {Uint8Array} [multihash]\n * @param {string} [multibaseName]\n *\n * @example\n * new CID(<version>, <codec>, <multihash>, <multibaseName>)\n * new CID(<cidStr>)\n * new CID(<cid.bytes>)\n * new CID(<multihash>)\n * new CID(<bs58 encoded multihash>)\n * new CID(<cid>)\n */\n constructor (version, codec, multihash, multibaseName) {\n // We have below three blank field accessors only because\n // otherwise TS will not pick them up if done after assignemnts\n\n /**\n * The version of the CID.\n *\n * @type {CIDVersion}\n */\n // eslint-disable-next-line no-unused-expressions\n this.version\n\n /**\n * The codec of the CID.\n *\n * @deprecated\n * @type {CodecName}\n */\n // eslint-disable-next-line no-unused-expressions\n this.codec\n\n /**\n * The multihash of the CID.\n *\n * @type {Uint8Array}\n */\n // eslint-disable-next-line no-unused-expressions\n this.multihash\n\n Object.defineProperty(this, symbol, { value: true })\n if (CID.isCID(version)) {\n // version is an exising CID instance\n const cid = /** @type {CID} */(version)\n this.version = cid.version\n this.codec = cid.codec\n this.multihash = cid.multihash\n // Default guard for when a CID < 0.7 is passed with no multibaseName\n // @ts-ignore\n this.multibaseName = cid.multibaseName || (cid.version === 0 ? 'base58btc' : 'base32')\n return\n }\n\n if (typeof version === 'string') {\n // e.g. 'base32' or false\n const baseName = multibase.isEncoded(version)\n if (baseName) {\n // version is a CID String encoded with multibase, so v1\n const cid = multibase.decode(version)\n this.version = /** @type {CIDVersion} */(parseInt(cid[0].toString(), 16))\n this.codec = multicodec.getCodec(cid.slice(1))\n this.multihash = multicodec.rmPrefix(cid.slice(1))\n this.multibaseName = baseName\n } else {\n // version is a base58btc string multihash, so v0\n this.version = 0\n this.codec = 'dag-pb'\n this.multihash = mh.fromB58String(version)\n this.multibaseName = 'base58btc'\n }\n CID.validateCID(this)\n Object.defineProperty(this, 'string', { value: version })\n return\n }\n\n if (version instanceof Uint8Array) {\n const v = parseInt(version[0].toString(), 16)\n if (v === 1) {\n // version is a CID Uint8Array\n const cid = version\n this.version = v\n this.codec = multicodec.getCodec(cid.slice(1))\n this.multihash = multicodec.rmPrefix(cid.slice(1))\n this.multibaseName = 'base32'\n } else {\n // version is a raw multihash Uint8Array, so v0\n this.version = 0\n this.codec = 'dag-pb'\n this.multihash = version\n this.multibaseName = 'base58btc'\n }\n CID.validateCID(this)\n return\n }\n\n // otherwise, assemble the CID from the parameters\n\n this.version = version\n\n if (typeof codec === 'number') {\n // @ts-ignore\n codec = codecInts[codec]\n }\n\n this.codec = /** @type {CodecName} */ (codec)\n\n this.multihash = /** @type {Uint8Array} */ (multihash)\n\n /**\n * Multibase name as string.\n *\n * @deprecated\n * @type {string}\n */\n this.multibaseName = multibaseName || (version === 0 ? 'base58btc' : 'base32')\n\n CID.validateCID(this)\n }\n\n /**\n * The CID as a `Uint8Array`\n *\n * @returns {Uint8Array}\n *\n */\n get bytes () {\n // @ts-ignore\n let bytes = this._bytes\n\n if (!bytes) {\n if (this.version === 0) {\n bytes = this.multihash\n } else if (this.version === 1) {\n const codec = multicodec.getCodeVarint(this.codec)\n bytes = uint8ArrayConcat([\n [1], codec, this.multihash\n ], 1 + codec.byteLength + this.multihash.byteLength)\n } else {\n throw new Error('unsupported version')\n }\n\n // Cache this Uint8Array so it doesn't have to be recreated\n Object.defineProperty(this, '_bytes', { value: bytes })\n }\n\n return bytes\n }\n\n /**\n * The prefix of the CID.\n *\n * @returns {Uint8Array}\n */\n get prefix () {\n const codec = multicodec.getCodeVarint(this.codec)\n const multihash = mh.prefix(this.multihash)\n const prefix = uint8ArrayConcat([\n [this.version], codec, multihash\n ], 1 + codec.byteLength + multihash.byteLength)\n\n return prefix\n }\n\n /**\n * The codec of the CID in its number form.\n *\n * @returns {CodecCode}\n */\n get code () {\n return codecs[this.codec]\n }\n\n /**\n * Convert to a CID of version `0`.\n *\n * @returns {CID}\n */\n toV0 () {\n if (this.codec !== 'dag-pb') {\n throw new Error('Cannot convert a non dag-pb CID to CIDv0')\n }\n\n const { name, length } = mh.decode(this.multihash)\n\n if (name !== 'sha2-256') {\n throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0')\n }\n\n if (length !== 32) {\n throw new Error('Cannot convert non 32 byte multihash CID to CIDv0')\n }\n\n return new CID(0, this.codec, this.multihash)\n }\n\n /**\n * Convert to a CID of version `1`.\n *\n * @returns {CID}\n */\n toV1 () {\n return new CID(1, this.codec, this.multihash)\n }\n\n /**\n * Encode the CID into a string.\n *\n * @param {BaseNameOrCode} [base=this.multibaseName] - Base encoding to use.\n * @returns {string}\n */\n toBaseEncodedString (base = this.multibaseName) {\n // @ts-ignore non enumerable cache property\n if (this.string && this.string.length !== 0 && base === this.multibaseName) {\n // @ts-ignore non enumerable cache property\n return this.string\n }\n let str\n if (this.version === 0) {\n if (base !== 'base58btc') {\n throw new Error('not supported with CIDv0, to support different bases, please migrate the instance do CIDv1, you can do that through cid.toV1()')\n }\n str = mh.toB58String(this.multihash)\n } else if (this.version === 1) {\n str = uint8ArrayToString(multibase.encode(base, this.bytes))\n } else {\n throw new Error('unsupported version')\n }\n if (base === this.multibaseName) {\n // cache the string value\n Object.defineProperty(this, 'string', { value: str })\n }\n return str\n }\n\n /**\n * CID(QmdfTbBqBPQ7VNxZEYEj14VmRuZBkqFbiwReogJgS1zR1n)\n *\n * @returns {string}\n */\n [Symbol.for('nodejs.util.inspect.custom')] () {\n return 'CID(' + this.toString() + ')'\n }\n\n /**\n * Encode the CID into a string.\n *\n * @param {BaseNameOrCode} [base=this.multibaseName] - Base encoding to use.\n * @returns {string}\n */\n toString (base) {\n return this.toBaseEncodedString(base)\n }\n\n /**\n * Serialize to a plain object.\n *\n * @returns {SerializedCID}\n */\n toJSON () {\n return {\n codec: this.codec,\n version: this.version,\n hash: this.multihash\n }\n }\n\n /**\n * Compare equality with another CID.\n *\n * @param {CID} other\n * @returns {boolean}\n */\n equals (other) {\n return this.codec === other.codec &&\n this.version === other.version &&\n uint8ArrayEquals(this.multihash, other.multihash)\n }\n\n /**\n * Test if the given input is a valid CID object.\n * Throws if it is not.\n *\n * @param {any} other - The other CID.\n * @returns {void}\n */\n static validateCID (other) {\n const errorMsg = CIDUtil.checkCIDComponents(other)\n if (errorMsg) {\n throw new Error(errorMsg)\n }\n }\n\n /**\n * Check if object is a CID instance\n *\n * @param {any} value\n * @returns {value is CID}\n */\n static isCID (value) {\n return value instanceof CID || Boolean(value && value[symbol])\n }\n}\n\nCID.codecs = codecs\n\nmodule.exports = CID\n", "'use strict'\n\nconst CID = require('cids')\n\n/**\n * @typedef {Object} EncodedCID\n * @property {string} codec\n * @property {Uint8Array} multihash\n * @property {number} version\n */\n\n/**\n * Encodes CID (well not really encodes it as all own properties are going to be\n * be cloned anyway). If `transfer` array is passed underlying `ArrayBuffer`\n * will be added for the transfer list.\n *\n * @param {CID} cid\n * @param {Transferable[]} [transfer]\n * @returns {EncodedCID}\n */\nconst encodeCID = (cid, transfer) => {\n if (transfer) {\n transfer.push(cid.multihash.buffer)\n }\n return cid\n}\nexports.encodeCID = encodeCID\n\n/**\n * Decodes encoded CID (well sort of instead it makes nasty mutations to turn\n * structure cloned CID back into itself).\n *\n * @param {EncodedCID} encodedCID\n * @returns {CID}\n */\nconst decodeCID = encodedCID => {\n /** @type {CID} */\n const cid = (encodedCID)\n Object.setPrototypeOf(cid.multihash, Uint8Array.prototype)\n Object.setPrototypeOf(cid, CID.prototype)\n // TODO: Figure out a way to avoid `Symbol.for` here as it can get out of\n // sync with cids implementation.\n // See: https://github.com/moxystudio/js-class-is/issues/25\n Object.defineProperty(cid, Symbol.for('@ipld/js-cid/CID'), { value: true })\n\n return cid\n}\nexports.decodeCID = decodeCID\n\nexports.CID = CID\n", "'use strict'\n\nconst CID = require('cids')\n\nconst { version } = require('../package.json')\nconst blockSymbol = Symbol.for('@ipld/js-ipld-block/block')\nconst readonly = { writable: false, configurable: false, enumerable: true }\n\n/**\n * Represents an immutable block of data that is uniquely referenced with a cid.\n *\n * @example\n * const block = new Block(Uint8Array.from([0, 1, 2, 3]), new CID('...'))\n */\nclass Block {\n /**\n * @param {Uint8Array} data - The data to be stored in the block as a Uint8Array.\n * @param {CID} cid - The cid of the data\n */\n constructor (data, cid) {\n if (!data || !(data instanceof Uint8Array)) {\n throw new Error('first argument must be a Uint8Array')\n }\n\n if (!cid || !CID.isCID(cid)) {\n throw new Error('second argument must be a CID')\n }\n\n this.data = data\n this.cid = cid\n\n Object.defineProperties(this, {\n data: readonly,\n cid: readonly\n })\n }\n\n /**\n * The data of this block.\n *\n * @deprecated\n * @type {Uint8Array}\n */\n get _data () {\n deprecateData()\n return this.data\n }\n\n /**\n * The cid of the data this block represents.\n *\n * @deprecated\n * @type {CID}\n */\n get _cid () {\n deprecateCID()\n return this.cid\n }\n\n get [Symbol.toStringTag] () {\n return 'Block'\n }\n\n get [blockSymbol] () {\n return true\n }\n\n /**\n * Check if the given value is a Block.\n *\n * @param {any} other\n * @returns {other is Block}\n */\n static isBlock (other) {\n return Boolean(other && other[blockSymbol])\n }\n}\n\n/**\n * @param {RegExp} range\n * @param {string} message\n * @returns {() => void}\n */\nconst deprecate = (range, message) => {\n let warned = false\n return () => {\n if (range.test(version)) {\n if (!warned) {\n warned = true\n // eslint-disable-next-line no-console\n console.warn(message)\n }\n } else {\n throw new Error(message)\n }\n }\n}\n\nconst deprecateCID = deprecate(/^0\\.10|^0\\.11/, 'block._cid is deprecated and will be removed in 0.12 release. Please use block.cid instead')\nconst deprecateData = deprecate(/^0\\.10|^0.11/, 'block._data is deprecated and will be removed in 0.12 release. Please use block.data instead')\n\nmodule.exports = Block\n", "'use strict'\n\nconst { encodeCID, decodeCID } = require('./cid')\nconst Block = require('ipld-block')\n\n/**\n * @typedef {import('./cid').EncodedCID} EncodedCID\n * @typedef {Object} EncodedBlock\n * @property {Uint8Array} data\n * @property {EncodedCID} cid\n */\n\n/**\n * Encodes Block for over the message channel transfer.\n *\n * If `transfer` array is provided all the encountered `ArrayBuffer`s within\n * this block will be added to the transfer so they are moved across without\n * copy.\n *\n * @param {Block} block\n * @param {Transferable[]} [transfer]\n * @returns {EncodedBlock}\n */\nconst encodeBlock = ({ cid, data }, transfer) => {\n if (transfer) {\n transfer.push(data.buffer)\n }\n return { cid: encodeCID(cid, transfer), data }\n}\nexports.encodeBlock = encodeBlock\n\n/**\n * @param {EncodedBlock} encodedBlock\n * @returns {Block}\n */\nconst decodeBlock = ({ cid, data }) => {\n return new Block(data, decodeCID(cid))\n}\n\nexports.decodeBlock = decodeBlock\n\nexports.Block = Block\n", "'use strict'\n\nconst Client = require('./client')\nconst { encodeCID, decodeCID } = require('ipfs-message-port-protocol/src/cid')\nconst { decodeError } = require('ipfs-message-port-protocol/src/error')\nconst {\n encodeBlock,\n decodeBlock\n} = require('ipfs-message-port-protocol/src/block')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-message-port-server/src/block').Block} Block\n * @typedef {import('ipfs-message-port-server/src/block').EncodedBlock} EncodedBlock\n * @typedef {import('ipfs-message-port-server/src/block').Rm} EncodedRmEntry\n * @typedef {import('ipfs-message-port-server/src/block').BlockService} BlockService\n * @typedef {import('./client').MessageTransport} MessageTransport\n */\n\n/**\n * @class\n * @extends {Client<BlockService>}\n */\nclass BlockClient extends Client {\n /**\n * @param {MessageTransport} transport\n */\n constructor (transport) {\n super('block', ['put', 'get', 'rm', 'stat'], transport)\n }\n\n /**\n * Get a raw IPFS block.\n *\n * @param {CID} cid - A CID that corresponds to the desired block\n * @param {Object} [options]\n * @param {number} [options.timeout] - A timeout in ms\n * @param {AbortSignal} [options.signal] - Can be used to cancel any long\n * running requests started as a result of this call\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * worker if passed.\n * @returns {Promise<Block>}\n */\n async get (cid, options = {}) {\n const { transfer } = options\n const { block } = await this.remote.get({\n ...options,\n cid: encodeCID(cid, transfer)\n })\n return decodeBlock(block)\n }\n\n /**\n * Stores input as an IPFS block.\n *\n * @param {Block|Uint8Array} block - A Block or Uint8Array of block data\n * @param {Object} [options]\n * @param {CID} [options.cid] - A CID to store the block under (if block is\n * `Uint8Array`)\n * @param {string} [options.format='dag-pb'] - The codec to use to create the\n * CID (if block is `Uint8Array`)\n * @param {string} [options.mhtype='sha2-256'] - The hashing algorithm to use\n * to create the CID (if block is `Uint8Array`)\n * @param {0|1} [options.version=0] - The version to use to create the CID\n * (if block is `Uint8Array`)\n * @param {number} [options.mhlen]\n * @param {boolean} [options.pin=false] - If true, pin added blocks recursively\n * @param {number} [options.timeout] - A timeout in ms\n * @param {AbortSignal} [options.signal] - Can be used to cancel any long\n * running requests started as a result of this call\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * worker if passed.\n * @returns {Promise<Block>}\n */\n async put (block, options = {}) {\n const { transfer } = options\n // @ts-ignore - ipfs-unixfs-importer passes `progress` which causing errors\n // because functions can't be transferred.\n delete options.progress\n const result = await this.remote.put({\n ...options,\n cid: options.cid == null ? undefined : encodeCID(options.cid, transfer),\n block: block instanceof Uint8Array ? block : encodeBlock(block, transfer)\n })\n return decodeBlock(result.block)\n }\n\n /**\n * Remove one or more IPFS block(s).\n *\n * @param {CID|CID[]} cids - Block(s) to be removed\n * @param {Object} [options]\n * @param {boolean} [options.force=false] - Ignores nonexistent blocks\n * @param {boolean} [options.quiet=false] - Write minimal output\n * @param {number} [options.timeout] - A timeout in ms\n * @param {AbortSignal} [options.signal] - Can be used to cancel any long\n * running requests started as a result of this call\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * worker if passed.\n * @returns {AsyncIterable<RmEntry>}\n *\n * @typedef {Object} RmEntry\n * @property {CID} cid\n * @property {Error|void} [error]\n */\n async * rm (cids, options = {}) {\n const { transfer } = options\n const entries = await this.remote.rm({\n ...options,\n cids: Array.isArray(cids)\n ? cids.map(cid => encodeCID(cid, transfer))\n : [encodeCID(cids, transfer)]\n })\n\n yield * entries.map(decodeRmEntry)\n }\n\n /**\n * Returns information about a raw IPFS block.\n *\n * @param {CID} cid - Block to get information about.\n * @param {Object} [options]\n * @param {number} [options.timeout] - A timeout in ms\n * @param {AbortSignal} [options.signal] - Can be used to cancel any long\n * running requests started as a result of this call\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * worker if passed.\n * @returns {Promise<Stat>}\n *\n * @typedef {Object} Stat\n * @property {CID} cid\n * @property {number} size\n */\n async stat (cid, options = {}) {\n const { transfer } = options\n const result = await this.remote.stat({\n ...options,\n cid: encodeCID(cid, transfer)\n })\n\n return { ...result, cid: decodeCID(result.cid) }\n }\n}\n\n/**\n * @param {EncodedRmEntry} entry\n * @returns {RmEntry}\n */\nconst decodeRmEntry = entry => {\n const cid = decodeCID(entry.cid)\n if (entry.error) {\n return { cid, error: decodeError(entry.error) }\n } else {\n return { cid }\n }\n}\n\nmodule.exports = BlockClient\n", "'use strict'\n\nconst { encodeCID, decodeCID, CID } = require('./cid')\n\n/**\n * @typedef {import('./data').JSONValue} JSONValue\n */\n\n/**\n * @template T\n * @typedef {import('./data').StringEncoded<T>} StringEncoded\n */\n\n/**\n * @typedef {Object} EncodedCID\n * @property {string} codec\n * @property {Uint8Array} multihash\n * @property {number} version\n * @typedef {JSONValue} DAGNode\n *\n * @typedef {Object} EncodedDAGNode\n * @property {DAGNode} dagNode\n * @property {CID[]} cids\n */\n\n/**\n * @param {EncodedDAGNode} encodedNode\n * @returns {DAGNode}\n */\nconst decodeNode = ({ dagNode, cids }) => {\n // It is not ideal to have to mutate prototype chains like\n // this, but it removes a need of traversing node first on client\n // and now on server.\n for (const cid of cids) {\n decodeCID(cid)\n }\n\n return dagNode\n}\n\nexports.decodeNode = decodeNode\n\n/**\n * Encodes DAG node for over the message channel transfer by collecting all\n * the CID instances into an array so they could be turned back into CIDs\n * without traversal on the other end.\n *\n * If `transfer` array is provided all the encountered `ArrayBuffer`s within\n * this node will be added to transfer so they are moved across without copy.\n *\n * @param {DAGNode} dagNode\n * @param {Transferable[]} [transfer]\n * @returns {EncodedDAGNode}\n */\nconst encodeNode = (dagNode, transfer) => {\n /** @type {CID[]} */\n const cids = []\n collectNode(dagNode, cids, transfer)\n return { dagNode, cids }\n}\nexports.encodeNode = encodeNode\n\n/**\n * Recursively traverses passed `value` and collects encountered `CID` instances\n * into provided `cids` array. If `transfer` array is passed collects all the\n * `ArrayBuffer`s into it.\n *\n * @param {DAGNode} value\n * @param {CID[]} cids\n * @param {Transferable[]} [transfer]\n * @returns {void}\n */\nconst collectNode = (value, cids, transfer) => {\n if (value != null && typeof value === 'object') {\n if (CID.isCID(value)) {\n cids.push(value)\n encodeCID(value, transfer)\n } else if (value instanceof ArrayBuffer) {\n if (transfer) {\n transfer.push(value)\n }\n } else if (ArrayBuffer.isView(value)) {\n if (transfer) {\n transfer.push(value.buffer)\n }\n } else if (Array.isArray(value)) {\n for (const member of value) {\n collectNode(member, cids, transfer)\n }\n } else {\n for (const member of Object.values(value)) {\n collectNode(member, cids, transfer)\n }\n }\n }\n}\n", "'use strict'\n\nconst Client = require('./client')\nconst { encodeCID, decodeCID } = require('ipfs-message-port-protocol/src/cid')\nconst { encodeNode, decodeNode } = require('ipfs-message-port-protocol/src/dag')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-message-port-server/src/dag').EncodedCID} EncodedCID\n * @typedef {import('ipfs-message-port-server/src/dag').DAGNode} DAGNode\n * @typedef {import('ipfs-message-port-server/src/dag').EncodedDAGNode} EncodedDAGNode\n * @typedef {import('ipfs-message-port-server/src/dag').DAGEntry} DAGEntry\n * @typedef {import('ipfs-message-port-server/src/dag').DAGService} DagService\n * @typedef {import('./client').MessageTransport} MessageTransport\n */\n\n/**\n * @class\n * @extends {Client<DagService>}\n */\nclass DAGClient extends Client {\n /**\n * @param {MessageTransport} transport\n */\n constructor (transport) {\n super('dag', ['put', 'get', 'resolve', 'tree'], transport)\n }\n\n /**\n * @param {DAGNode} dagNode\n * @param {Object} [options]\n * @param {string} [options.format=\"dag-cbor\"] - The IPLD format multicodec\n * @param {string} [options.hashAlg=\"sha2-256\"] - The hash algorithm to be used over the serialized DAG node\n * @param {CID} [options.cid]\n * @param {boolean} [options.pin=false] - Pin this node when adding to the blockstore\n * @param {boolean} [options.preload=true]\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * @param {number} [options.timeout] - A timeout in ms\n * @param {AbortSignal} [options.signal] - Can be used to cancel any long running requests started as a result of this call.\n * @returns {Promise<CID>}\n */\n async put (dagNode, options = {}) {\n const { cid } = options\n\n const encodedCID = await this.remote.put({\n ...options,\n cid: cid != null ? encodeCID(cid) : undefined,\n dagNode: encodeNode(dagNode, options.transfer)\n })\n\n return decodeCID(encodedCID)\n }\n\n /**\n * @param {CID} cid\n * @param {Object} [options]\n * @param {string} [options.path]\n * @param {boolean} [options.localResolve]\n * @param {number} [options.timeout]\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * @param {AbortSignal} [options.signal]\n * @returns {Promise<DAGEntry>}\n */\n async get (cid, options = {}) {\n const { value, remainderPath } = await this.remote.get({\n ...options,\n cid: encodeCID(cid, options.transfer)\n })\n\n return { value: decodeNode(value), remainderPath }\n }\n\n /**\n * @typedef {Object} ResolveResult\n * @property {CID} cid\n * @property {string|void} remainderPath\n *\n * @param {CID} cid\n * @param {Object} [options]\n * @param {string} [options.path]\n * @param {number} [options.timeout]\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * @param {AbortSignal} [options.signal]\n * @returns {Promise<ResolveResult>}\n */\n async resolve (cid, options = {}) {\n const { cid: encodedCID, remainderPath } = await this.remote.resolve({\n ...options,\n cid: encodeCIDOrPath(cid, options.transfer)\n })\n\n return { cid: decodeCID(encodedCID), remainderPath }\n }\n\n /**\n * Enumerate all the entries in a graph\n *\n * @param {CID} cid - CID of the DAG node to enumerate\n * @param {Object} [options]\n * @param {string} [options.path]\n * @param {boolean} [options.recursive]\n * @param {Transferable[]} [options.transfer] - References to transfer to the\n * @param {number} [options.timeout]\n * @param {AbortSignal} [options.signal]\n * @returns {AsyncIterable<string>}\n */\n async * tree (cid, options = {}) {\n const paths = await this.remote.tree({\n ...options,\n cid: encodeCID(cid, options.transfer)\n })\n\n yield * paths\n }\n}\n\n/**\n * @param {string|CID} input\n * @param {Transferable[]} [transfer]\n * @returns {string|EncodedCID}\n */\nconst encodeCIDOrPath = (input, transfer) => {\n if (typeof input === 'string') {\n return input\n } else {\n return encodeCID(input, transfer)\n }\n}\n\nmodule.exports = DAGClient\n", "'use strict'\n\n/* eslint-env browser */\nconst { encodeError, decodeError } = require('./error')\nconst { ensureUniqueBuffers } = require('./buffer')\n\n/**\n * @template T\n * @typedef {Object} RemoteIterable\n * @property {'RemoteIterable'} type\n * @property {MessagePort} port\n */\n\n/**\n * @typedef {Object} RemoteCallback\n * @property {'RemoteCallback'} type\n * @property {MessagePort} port\n */\n\n/**\n * @template T\n * @typedef {Object} RemoteYield\n * @property {false} done\n * @property {T} value\n * @property {void} error\n */\n\n/**\n * @template T\n * @typedef {Object} RemoteDone\n * @property {true} done\n * @property {T|void} value\n * @property {void} error\n */\n\n/**\n * @typedef {import('./error').EncodedError} EncodedError\n * @typedef {Object} RemoteError\n * @property {true} done\n * @property {void} value\n * @property {EncodedError} error\n */\n\n/**\n * @template T\n * @typedef {RemoteYield<T>|RemoteDone<T>|RemoteError} RemoteNext\n */\n\n/**\n * @template I, O\n * @param {RemoteIterable<I>} remote\n * @param {function(I):O} decode\n * @returns {AsyncIterable<O>}\n */\nconst decodeIterable = async function * ({ port }, decode) {\n /**\n * @param {RemoteNext<I>} _data\n */\n let receive = _data => {}\n /**\n * @returns {Promise<RemoteNext<I>>}\n */\n const wait = () => new Promise(resolve => (receive = resolve))\n const next = () => {\n port.postMessage({ method: 'next' })\n return wait()\n }\n\n /**\n * @param {MessageEvent} event\n * @returns {void}\n */\n port.onmessage = event => receive(event.data)\n\n let isDone = false\n try {\n while (!isDone) {\n const { done, value, error } = await next()\n isDone = done\n if (error != null) {\n throw decodeError(error)\n } else if (value != null) {\n yield decode(value)\n }\n }\n } finally {\n if (!isDone) {\n port.postMessage({ method: 'return' })\n }\n port.close()\n }\n}\nexports.decodeIterable = decodeIterable\n\n/**\n * @template I,O\n * @param {AsyncIterable<I>|Iterable<I>} iterable\n * @param {function(I, Transferable[]):O} encode\n * @param {Transferable[]} transfer\n * @returns {RemoteIterable<O>}\n */\nconst encodeIterable = (iterable, encode, transfer) => {\n const { port1: port, port2: remote } = new MessageChannel()\n /** @type {Iterator<I>|AsyncIterator<I>} */\n const iterator = toIterator(iterable)\n\n port.onmessage = async ({ data: { method } }) => {\n switch (method) {\n case 'next': {\n try {\n const { done, value } = await iterator.next()\n if (done) {\n port.postMessage({ type: 'next', done: true })\n port.close()\n } else {\n /** @type {Transferable[]} */\n const itemTransfer = []\n const encodedValue = encode(value, itemTransfer)\n\n port.postMessage(\n {\n type: 'next',\n done: false,\n value: encodedValue\n },\n // @ts-expect-error - Typescript expects the transfer list to be an Array, but it can actually be any iterable.\n ensureUniqueBuffers(itemTransfer)\n )\n }\n } catch (error) {\n port.postMessage({\n type: 'throw',\n error: encodeError(error)\n })\n port.close()\n }\n break\n }\n case 'return': {\n port.close()\n if (iterator.return) {\n iterator.return()\n }\n break\n }\n default: {\n break\n }\n }\n }\n port.start()\n transfer.push(remote)\n\n return { type: 'RemoteIterable', port: remote }\n}\nexports.encodeIterable = encodeIterable\n\n/**\n * @template I\n * @param {any} iterable\n * @returns {Iterator<I>|AsyncIterator<I>}\n */\nconst toIterator = iterable => {\n if (iterable != null) {\n if (typeof iterable[Symbol.asyncIterator] === 'function') {\n return iterable[Symbol.asyncIterator]()\n }\n\n if (typeof iterable[Symbol.iterator] === 'function') {\n return iterable[Symbol.iterator]()\n }\n }\n\n throw TypeError('Value must be async or sync iterable')\n}\n\n/**\n * @param {Function} callback\n * @param {Transferable[]} transfer\n * @returns {RemoteCallback}\n */\nconst encodeCallback = (callback, transfer) => {\n // eslint-disable-next-line no-undef\n const { port1: port, port2: remote } = new MessageChannel()\n port.onmessage = ({ data }) => callback.apply(null, data)\n transfer.push(remote)\n return { type: 'RemoteCallback', port: remote }\n}\nexports.encodeCallback = encodeCallback\n\n/**\n * @template T\n * @param {RemoteCallback} remote\n * @returns {function(T[]):void | function(T[], Transferable[]):void}\n */\nconst decodeCallback = ({ port }) => {\n /**\n * @param {T[]} args\n * @param {Transferable[]} [transfer]\n * @returns {void}\n */\n const callback = (args, transfer = []) => {\n // @ts-expect-error - Typescript expects the transfer list to be an Array, but it can actually be any iterable.\n port.postMessage(args, new Set(transfer))\n }\n\n return callback\n}\nexports.decodeCallback = decodeCallback\n", "'use strict'\n\n/**\n * Turns a browser readable stream into an async iterable. Async iteration over\n * returned iterable will lock give stream, preventing any other consumer from\n * acquiring a reader. The lock will be released if iteration loop is broken. To\n * prevent stream cancelling optional `{ preventCancel: true }` could be passed\n * as a second argument.\n * @template T\n * @param {ReadableStream<T>} stream\n * @param {Object} [options]\n * @param {boolean} [options.preventCancel=boolean]\n * @returns {AsyncIterable<T>}\n */\nasync function * browserReadableStreamToIt (stream, options = {}) {\n const reader = stream.getReader()\n\n try {\n while (true) {\n const result = await reader.read()\n\n if (result.done) {\n return\n }\n\n yield result.value\n }\n } finally {\n if (options.preventCancel !== true) {\n reader.cancel()\n }\n\n reader.releaseLock()\n }\n}\n\nmodule.exports = browserReadableStreamToIt\n", "'use strict'\n\n/* eslint-env browser */\n\nconst Client = require('./client')\nconst { encodeCID, decodeCID, CID } = require('ipfs-message-port-protocol/src/cid')\nconst {\n decodeIterable,\n encodeIterable,\n encodeCallback\n} = require('ipfs-message-port-protocol/src/core')\n/** @type {<T>(stream:ReadableStream<T>) => AsyncIterable<T>} */\n// @ts-ignore - browser-stream-to-it has not types\nconst iterateReadableStream = require('browser-readablestream-to-it')\n\n/**\n * @template T\n * @typedef {import('ipfs-message-port-protocol/src/core').RemoteIterable<T>} RemoteIterable\n */\n/**\n * @typedef {import('ipfs-message-port-protocol/src/data').Time} Time\n * @typedef {import('ipfs-message-port-protocol/src/data').UnixFSTime} UnixFSTime\n * @typedef {import('ipfs-message-port-protocol/src/dag').EncodedCID} EncodedCID\n * @typedef {import('ipfs-message-port-server/src/core').SingleFileInput} EncodedAddInput\n * @typedef {import('ipfs-message-port-server/src/core').MultiFileInput} EncodedAddAllInput\n * @typedef {import('ipfs-message-port-server/src/core').FileInput} FileInput\n * @typedef {import('ipfs-message-port-server/src/core').FileContent} EncodedFileContent\n *\n * @typedef {Object} NoramilzedFileInput\n * @property {string} path\n * @property {AsyncIterable<ArrayBuffer>} content\n *\n * @typedef {ArrayBuffer|ArrayBufferView} Bytes\n *\n * @typedef {Blob|Bytes|string|Iterable<number>|Iterable<Bytes>|AsyncIterable<Bytes>} FileContent\n *\n * @typedef {Object} FileObject\n * @property {string} [path]\n * @property {FileContent} [content]\n * @property {string|number} [mode]\n * @property {UnixFSTime} [mtime]\n *\n *\n * @typedef {Blob|Bytes|string|FileObject|Iterable<number>|Iterable<Bytes>|AsyncIterable<Bytes>|ReadableStream} AddInput\n *\n * @typedef {Iterable<Blob|string|FileObject>|AsyncIterable<Blob|string|FileObject>} AddAllInput\n */\n\n/**\n * @typedef {import('ipfs-message-port-server/src/core').CoreService} CoreService\n * @typedef {import('ipfs-message-port-server/src/core').AddedEntry} AddedEntry\n * @typedef {import('ipfs-message-port-server/src/core').EncodedLsEntry} EncodedLsEntry\n * @typedef {import('ipfs-message-port-server/src/core').LsEntry} LsEntry\n * @typedef {import('./client').MessageTransport} MessageTransport\n */\n\n/**\n * @class\n * @extends {Client<CoreService>}\n */\nclass CoreClient extends Client {\n /**\n * @param {MessageTransport} transport\n */\n constructor (transport) {\n super('core', ['add', 'addAll', 'cat', 'ls'], transport)\n }\n\n /**\n * Import files and data into IPFS.\n *\n * If you pass binary data like `Uint8Array` it is recommended to provide\n * `transfer: [input.buffer]` which would allow transferring it instead of\n * copying.\n *\n * @type {import('.').Implements<typeof import('ipfs-core/src/components/add-all')>}\n */\n async * addAll (input, options = {}) {\n const { timeout, signal } = options\n const transfer = [...(options.transfer || [])]\n const progress = options.progress\n ? encodeCallback(options.progress, transfer)\n : undefined\n\n const result = await this.remote.addAll({\n ...options,\n input: encodeAddAllInput(input, transfer),\n progress,\n transfer,\n timeout,\n signal\n })\n yield * decodeIterable(result.data, decodeAddedData)\n }\n\n /**\n * Add file to IPFS.\n *\n * If you pass binary data like `Uint8Array` it is recommended to provide\n * `transfer: [input.buffer]` which would allow transferring it instead of\n * copying.\n *\n * @type {import('.').Implements<typeof import('ipfs-core/src/components/add')>}\n */\n async add (input, options = {}) {\n const { timeout, signal } = options\n const transfer = [...(options.transfer || [])]\n const progress = options.progress\n ? encodeCallback(options.progress, transfer)\n : undefined\n\n const result = await this.remote.add({\n ...options,\n input: encodeAddInput(input, transfer),\n progress,\n transfer,\n timeout,\n signal\n })\n\n return decodeAddedData(result.data)\n }\n\n /**\n * Returns content addressed by a valid IPFS Path.\n *\n * @param {string|CID} inputPath\n * @param {Object} [options]\n * @param {number} [options.offset]\n * @param {number} [options.length]\n * @param {number} [options.timeout]\n * @param {AbortSignal} [options.signal]\n * @returns {AsyncIterable<Uint8Array>}\n */\n async * cat (inputPath, options = {}) {\n const input = CID.isCID(inputPath) ? encodeCID(inputPath) : inputPath\n const result = await this.remote.cat({ ...options, path: input })\n yield * decodeIterable(result.data, identity)\n }\n\n /**\n * Returns content addressed by a valid IPFS Path.\n *\n * @param {string|CID} inputPath\n * @param {Object} [options]\n * @param {boolean} [options.recursive]\n * @param {boolean} [options.preload]\n * @param {number} [options.timeout]\n * @param {AbortSignal} [options.signal]\n * @returns {AsyncIterable<LsEntry>}\n */\n async * ls (inputPath, options = {}) {\n const input = CID.isCID(inputPath) ? encodeCID(inputPath) : inputPath\n const result = await this.remote.ls({ ...options, path: input })\n\n yield * decodeIterable(result.data, decodeLsEntry)\n }\n}\n\n/**\n * Decodes values yield by `ipfs.add`.\n *\n * @param {AddedEntry} data\n * @returns {import('ipfs-core-types/src/files').UnixFSEntry}\n */\nconst decodeAddedData = ({ path, cid, mode, mtime, size }) => {\n return {\n path,\n cid: decodeCID(cid),\n mode,\n mtime,\n size\n }\n}\n\n/**\n * @param {EncodedLsEntry} encodedEntry\n * @returns {LsEntry}\n */\nconst decodeLsEntry = ({ depth, name, path, size, cid, type, mode, mtime }) => ({\n cid: decodeCID(cid),\n type,\n name,\n path,\n mode,\n mtime,\n size,\n depth\n})\n\n/**\n * @template T\n * @param {T} v\n * @returns {T}\n */\nconst identity = (v) => v\n\n/**\n * Encodes input passed to the `ipfs.add` via the best possible strategy for the\n * given input.\n *\n * @param {AddInput} input\n * @param {Transferable[]} transfer\n * @returns {EncodedAddInput}\n */\nconst encodeAddInput = (input, transfer) => {\n // We want to get a Blob as input. If we got it we're set.\n if (input instanceof Blob) {\n return input\n } else if (typeof input === 'string') {\n return input\n } else if (input instanceof ArrayBuffer) {\n return input\n } else if (ArrayBuffer.isView(input)) {\n // Note we are not adding `input.buffer` into transfer list, it's on user.\n return input\n } else {\n // If input is (async) iterable or `ReadableStream` or \"FileObject\" it will\n // be encoded via own specific encoder.\n const iterable = asIterable(input)\n if (iterable) {\n return encodeIterable(iterable, encodeIterableContent, transfer)\n }\n\n const asyncIterable = asAsyncIterable(input)\n if (asyncIterable) {\n return encodeIterable(\n asyncIterable,\n encodeAsyncIterableContent,\n transfer\n )\n }\n\n const readableStream = asReadableStream(input)\n if (readableStream) {\n return encodeIterable(\n iterateReadableStream(readableStream),\n encodeAsyncIterableContent,\n transfer\n )\n }\n\n const file = asFileObject(input)\n if (file) {\n return encodeFileObject(file, transfer)\n }\n\n throw TypeError('Unexpected input: ' + typeof input)\n }\n}\n\n/**\n * Encodes input passed to the `ipfs.add` via the best possible strategy for the\n * given input.\n *\n * @param {AddAllInput} input\n * @param {Transferable[]} transfer\n * @returns {EncodedAddAllInput}\n */\nconst encodeAddAllInput = (input, transfer) => {\n // If input is (async) iterable or `ReadableStream` or \"FileObject\" it will\n // be encoded via own specific encoder.\n const iterable = asIterable(input)\n if (iterable) {\n return encodeIterable(iterable, encodeIterableContent, transfer)\n }\n\n const asyncIterable = asAsyncIterable(input)\n if (asyncIterable) {\n return encodeIterable(\n asyncIterable,\n encodeAsyncIterableContent,\n transfer\n )\n }\n\n const readableStream = asReadableStream(input)\n if (readableStream) {\n return encodeIterable(\n iterateReadableStream(readableStream),\n encodeAsyncIterableContent,\n transfer\n )\n }\n\n throw TypeError('Unexpected input: ' + typeof input)\n}\n\n/**\n * Function encodes individual item of some `AsyncIterable` by choosing most\n * effective strategy.\n *\n * @param {ArrayBuffer|ArrayBufferView|Blob|string|FileObject} content\n * @param {Transferable[]} transfer\n * @returns {FileInput|ArrayBuffer|ArrayBufferView}\n */\nconst encodeAsyncIterableContent = (content, transfer) => {\n if (content instanceof ArrayBuffer) {\n return content\n } else if (ArrayBuffer.isView(content)) {\n return content\n } else if (content instanceof Blob) {\n return { path: '', content }\n } else if (typeof content === 'string') {\n return { path: '', content }\n } else {\n const file = asFileObject(content)\n if (file) {\n return encodeFileObject(file, transfer)\n } else {\n throw TypeError('Unexpected input: ' + typeof content)\n }\n }\n}\n\n/**\n * @param {number|Bytes|Blob|string|FileObject|void} content\n * @param {Transferable[]} transfer\n * @returns {FileInput|ArrayBuffer|ArrayBufferView}\n */\nconst encodeIterableContent = (content, transfer) => {\n if (typeof content === 'number') {\n throw TypeError('Iterable of numbers is not supported')\n } else if (content instanceof ArrayBuffer) {\n return content\n } else if (ArrayBuffer.isView(content)) {\n return content\n } else if (content instanceof Blob) {\n return { path: '', content }\n } else if (typeof content === 'string') {\n return { path: '', content }\n } else {\n const file = asFileObject(content)\n if (file) {\n return encodeFileObject(file, transfer)\n } else {\n throw TypeError('Unexpected input: ' + typeof content)\n }\n }\n}\n\n/**\n * @param {FileObject} file\n * @param {Transferable[]} transfer\n * @returns {FileInput}\n */\nconst encodeFileObject = ({ path, mode, mtime, content }, transfer) => {\n return {\n path,\n mode,\n mtime,\n content: content ? encodeFileContent(content, transfer) : undefined\n }\n}\n\n/**\n *\n * @param {FileContent|undefined} content\n * @param {Transferable[]} transfer\n * @returns {EncodedFileContent}\n */\nconst encodeFileContent = (content, transfer) => {\n if (content == null) {\n return ''\n } else if (content instanceof ArrayBuffer || ArrayBuffer.isView(content)) {\n return content\n } else if (content instanceof Blob) {\n return content\n } else if (typeof content === 'string') {\n return content\n } else {\n const iterable = asIterable(content)\n if (iterable) {\n return encodeIterable(iterable, encodeIterableContent, transfer)\n }\n\n const asyncIterable = asAsyncIterable(content)\n if (asyncIterable) {\n return encodeIterable(\n asyncIterable,\n encodeAsyncIterableContent,\n transfer\n )\n }\n\n const readableStream = asReadableStream(content)\n if (readableStream) {\n return encodeIterable(\n iterateReadableStream(readableStream),\n encodeAsyncIterableContent,\n transfer\n )\n }\n\n throw TypeError('Unexpected input: ' + typeof content)\n }\n}\n\n/**\n * Pattern matches given input as `Iterable<I>` and returns back either matched\n * iterable or `null`.\n *\n * @template I\n * @param {Iterable<I>|AddInput|AddAllInput} input\n * @returns {Iterable<I>|null}\n */\nconst asIterable = (input) => {\n /** @type {*} */\n const object = input\n if (object && typeof object[Symbol.iterator] === 'function') {\n return object\n } else {\n return null\n }\n}\n\n/**\n * Pattern matches given `input` as `AsyncIterable<I>` and returns back either\n * matched `AsyncIterable` or `null`.\n *\n * @template I\n * @param {AsyncIterable<I>|AddInput|AddAllInput} input\n * @returns {AsyncIterable<I>|null}\n */\nconst asAsyncIterable = (input) => {\n /** @type {*} */\n const object = input\n if (object && typeof object[Symbol.asyncIterator] === 'function') {\n return object\n } else {\n return null\n }\n}\n\n/**\n * Pattern matches given `input` as `ReadableStream` and return back either\n * matched input or `null`.\n *\n * @param {any} input\n * @returns {ReadableStream<Uint8Array>|null}\n */\nconst asReadableStream = (input) => {\n if (input && typeof input.getReader === 'function') {\n return input\n } else {\n return null\n }\n}\n\n/**\n * Pattern matches given input as \"FileObject\" and returns back eithr matched\n * input or `null`.\n *\n * @param {*} input\n * @returns {FileObject|null}\n */\nconst asFileObject = (input) => {\n if (typeof input === 'object' && (input.path || input.content)) {\n return input\n } else {\n return null\n }\n}\n\nmodule.exports = CoreClient\n", "'use strict'\n\n/* eslint-env browser */\nconst Client = require('./client')\nconst { decodeCID, CID } = require('ipfs-message-port-protocol/src/cid')\n\n/**\n * @typedef {import('ipfs-message-port-server/src/files').FilesService} FilesService\n * @typedef {import('ipfs-message-port-server/src/files').EncodedStat} EncodedStat\n * @typedef {import('./client').MessageTransport} MessageTransport\n */\n\n/**\n * @class\n * @extends {Client<FilesService>}\n */\nclass FilesClient extends Client {\n /**\n * @param {MessageTransport} transport\n */\n constructor (transport) {\n super('files', ['stat'], transport)\n }\n\n /**\n * @typedef {Object} Stat\n * @property {CID} cid Content identifier.\n * @property {number} size File size in bytes.\n * @property {number} cumulativeSize Size of the DAGNodes making up the file in bytes.\n * @property {\"directory\"|\"file\"} type\n * @property {number} blocks Number of files making up directory (when a direcotry)\n * or number of blocks that make up the file (when a file)\n * @property {boolean} withLocality True when locality information is present\n * @property {boolean} local True if the queried dag is fully present locally\n * @property {number} sizeLocal Cumulative size of the data present locally\n *\n * @param {string|CID} pathOrCID\n * @param {Object} [options]\n * @param {boolean} [options.hash=false] - If true will only return hash\n * @param {boolean} [options.size=false] - If true will only return size\n * @param {boolean} [options.withLocal=false] - If true computes size of the dag that is local, and total size when possible\n * @param {number} [options.timeout]\n * @param {AbortSignal} [options.signal]\n * @returns {Promise<Stat>}\n */\n async stat (pathOrCID, options = {}) {\n const { size, hash, withLocal, timeout, signal } = options\n const { stat } = await this.remote.stat({\n path: encodeLocation(pathOrCID),\n size,\n hash,\n withLocal,\n timeout,\n signal\n })\n return decodeStat(stat)\n }\n}\nmodule.exports = FilesClient\n\n/**\n * Turns content address (path or CID) into path.\n *\n * @param {string|CID} pathOrCID\n * @returns {string}\n */\nconst encodeLocation = pathOrCID =>\n CID.isCID(pathOrCID) ? `/ipfs/${pathOrCID.toString()}` : pathOrCID\n\n/**\n *\n * @param {EncodedStat} data\n * @returns {Stat}\n */\nconst decodeStat = data => {\n return { ...data, cid: decodeCID(data.cid) }\n}\n", "'use strict'\n\n/* eslint-env browser */\nconst Client = require('./client')\nconst { decodeCID, CID } = require('ipfs-message-port-protocol/src/cid')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-message-port-server/src/pin').EncodedCID} EncodedCID\n * @typedef {import('ipfs-message-port-server/src/pin').PinService} PinService\n * @typedef {import('./client').MessageTransport} MessageTransport\n */\n\n/**\n * @class\n * @extends {Client<PinService>}\n */\nclass PinClient extends Client {\n /**\n * @param {MessageTransport} transport\n */\n constructor (transport) {\n super('pin', ['add'], transport)\n }\n\n async add (pathOrCID, options = {}) {\n const { recursive, timeout, signal } = options\n const { cid } = await this.remote.add({\n path: encodeLocation(pathOrCID),\n recursive,\n timeout,\n signal\n })\n return decodeCID(cid)\n }\n}\nmodule.exports = PinClient\n\n/**\n * Turns content address (path or CID) into path.\n *\n * @param {string|CID} pathOrCID\n * @returns {string}\n */\nconst encodeLocation = pathOrCID =>\n CID.isCID(pathOrCID) ? `/ipfs/${pathOrCID.toString()}` : `${pathOrCID}`\n", "'use strict'\n/* eslint-env browser */\n\nconst MessageTransport = require('./client/transport')\nconst BlockClient = require('./block')\nconst DAGClient = require('./dag')\nconst CoreClient = require('./core')\nconst FilesClient = require('./files')\nconst PinClient = require('./pin')\n\n/**\n * @typedef {import('./client').MessageTransport} MessageTransport\n *\n * @typedef {Object} ClientOptions\n * @property {MessagePort} port\n */\n\nclass IPFSClient extends CoreClient {\n /**\n * @param {MessageTransport} transport\n */\n constructor (transport) {\n super(transport)\n this.transport = transport\n this.block = new BlockClient(this.transport)\n this.dag = new DAGClient(this.transport)\n this.files = new FilesClient(this.transport)\n this.pin = new PinClient(this.transport)\n }\n\n /**\n * Attaches IPFS client to the given message port. Throws\n * exception if client is already attached.\n *\n * @param {IPFSClient} self\n * @param {MessagePort} port\n */\n static attach (self, port) {\n self.transport.connect(port)\n }\n\n /**\n * Creates IPFS client that is detached from the `ipfs-message-port-service`.\n * This can be useful when in a scenario where obtaining message port happens\n * later on in the application logic. Datached IPFS client will queue all the\n * API calls and flush them once client is attached.\n *\n * @returns {IPFSClient}\n */\n static detached () {\n return new IPFSClient(new MessageTransport(undefined))\n }\n\n /**\n * Creates IPFS client from the message port (assumes that\n * `ipfs-message-port-service` is instantiated on the other end)\n *\n * @param {MessagePort} port\n * @returns {IPFSClient}\n */\n static from (port) {\n return new IPFSClient(new MessageTransport(port))\n }\n}\n\nmodule.exports = IPFSClient\n\n/**\n * @typedef {Object} MessagePortOptions\n * @property {Array} [transfer] - A list of ArrayBuffers whose ownership will be transferred to the shared worker\n *\n * @typedef {import('ipfs-core/src/utils').AbortOptions} AbortOptions}\n */\n\n/**\n * This is an utility type that can be used to derive type of the HTTP Client\n * API from the Core API. It takes type of the API factory (from ipfs-core),\n * derives API from it's return type and extends it last `options` parameter\n * with `HttpOptions`.\n *\n * This can be used to avoid (re)typing API interface when implementing it in\n * http client e.g you can annotate `ipfs.addAll` implementation with\n *\n * `@type {Implements<typeof import('ipfs-core/src/components/add-all')>}`\n *\n * **Caution**: This supports APIs with up to four parameters and last optional\n * `options` parameter, anything else will result to `never` type.\n *\n * @template {(config:any) => any} APIFactory\n * @typedef {APIWithExtraOptions<ReturnType<APIFactory>, MessagePortOptions>} Implements\n */\n\n/**\n * @template Key\n * @template {(config:any) => any} APIFactory\n * @typedef {import('./interface').APIMethodWithExtraOptions<ReturnType<APIFactory>, Key, MessagePortOptions>} ImplementsMethod\n */\n\n/**\n * @template API, Extra\n * @typedef {import('./interface').APIWithExtraOptions<API, Extra>} APIWithExtraOptions\n */\n", "\"use strict\";\r\nmodule.exports = asPromise;\r\n\r\n/**\r\n * Callback as used by {@link util.asPromise}.\r\n * @typedef asPromiseCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {...*} params Additional arguments\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Returns a promise from a node-style callback function.\r\n * @memberof util\r\n * @param {asPromiseCallback} fn Function to call\r\n * @param {*} ctx Function context\r\n * @param {...*} params Function arguments\r\n * @returns {Promise<*>} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0,\r\n index = 2,\r\n pending = true;\r\n while (index < arguments.length)\r\n params[offset++] = arguments[index++];\r\n return new Promise(function executor(resolve, reject) {\r\n params[offset] = function callback(err/*, varargs */) {\r\n if (pending) {\r\n pending = false;\r\n if (err)\r\n reject(err);\r\n else {\r\n var params = new Array(arguments.length - 1),\r\n offset = 0;\r\n while (offset < params.length)\r\n params[offset++] = arguments[offset];\r\n resolve.apply(null, params);\r\n }\r\n }\r\n };\r\n try {\r\n fn.apply(ctx || null, params);\r\n } catch (err) {\r\n if (pending) {\r\n pending = false;\r\n reject(err);\r\n }\r\n }\r\n });\r\n}\r\n", "\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n var p = string.length;\r\n if (!p)\r\n return 0;\r\n var n = 0;\r\n while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n ++n;\r\n return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n var parts = null,\r\n chunk = [];\r\n var i = 0, // output index\r\n j = 0, // goto index\r\n t; // temporary\r\n while (start < end) {\r\n var b = buffer[start++];\r\n switch (j) {\r\n case 0:\r\n chunk[i++] = b64[b >> 2];\r\n t = (b & 3) << 4;\r\n j = 1;\r\n break;\r\n case 1:\r\n chunk[i++] = b64[t | b >> 4];\r\n t = (b & 15) << 2;\r\n j = 2;\r\n break;\r\n case 2:\r\n chunk[i++] = b64[t | b >> 6];\r\n chunk[i++] = b64[b & 63];\r\n j = 0;\r\n break;\r\n }\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (j) {\r\n chunk[i++] = b64[t];\r\n chunk[i++] = 61;\r\n if (j === 1)\r\n chunk[i++] = 61;\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n var start = offset;\r\n var j = 0, // goto index\r\n t; // temporary\r\n for (var i = 0; i < string.length;) {\r\n var c = string.charCodeAt(i++);\r\n if (c === 61 && j > 1)\r\n break;\r\n if ((c = s64[c]) === undefined)\r\n throw Error(invalidEncoding);\r\n switch (j) {\r\n case 0:\r\n t = c;\r\n j = 1;\r\n break;\r\n case 1:\r\n buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n t = c;\r\n j = 2;\r\n break;\r\n case 2:\r\n buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n t = c;\r\n j = 3;\r\n break;\r\n case 3:\r\n buffer[offset++] = (t & 3) << 6 | c;\r\n j = 0;\r\n break;\r\n }\r\n }\r\n if (j === 1)\r\n throw Error(invalidEncoding);\r\n return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n", "\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n /**\r\n * Registered listeners.\r\n * @type {Object.<string,*>}\r\n * @private\r\n */\r\n this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n fn : fn,\r\n ctx : ctx || this\r\n });\r\n return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n if (evt === undefined)\r\n this._listeners = {};\r\n else {\r\n if (fn === undefined)\r\n this._listeners[evt] = [];\r\n else {\r\n var listeners = this._listeners[evt];\r\n for (var i = 0; i < listeners.length;)\r\n if (listeners[i].fn === fn)\r\n listeners.splice(i, 1);\r\n else\r\n ++i;\r\n }\r\n }\r\n return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n var listeners = this._listeners[evt];\r\n if (listeners) {\r\n var args = [],\r\n i = 1;\r\n for (; i < arguments.length;)\r\n args.push(arguments[i++]);\r\n for (i = 0; i < listeners.length;)\r\n listeners[i].fn.apply(listeners[i++].ctx, args);\r\n }\r\n return this;\r\n};\r\n", "\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n // float: typed array\r\n if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n var f32 = new Float32Array([ -0 ]),\r\n f8b = new Uint8Array(f32.buffer),\r\n le = f8b[3] === 128;\r\n\r\n function writeFloat_f32_cpy(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n }\r\n\r\n function writeFloat_f32_rev(val, buf, pos) {\r\n f32[0] = val;\r\n buf[pos ] = f8b[3];\r\n buf[pos + 1] = f8b[2];\r\n buf[pos + 2] = f8b[1];\r\n buf[pos + 3] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n function readFloat_f32_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n function readFloat_f32_rev(buf, pos) {\r\n f8b[3] = buf[pos ];\r\n f8b[2] = buf[pos + 1];\r\n f8b[1] = buf[pos + 2];\r\n f8b[0] = buf[pos + 3];\r\n return f32[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n /* istanbul ignore next */\r\n exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n // float: ieee754\r\n })(); else (function() {\r\n\r\n function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0)\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n else if (isNaN(val))\r\n writeUint(2143289344, buf, pos);\r\n else if (val > 3.4028234663852886e+38) // +-Infinity\r\n writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n else if (val < 1.1754943508222875e-38) // denormal\r\n writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n }\r\n }\r\n\r\n exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n function readFloat_ieee754(readUint, buf, pos) {\r\n var uint = readUint(buf, pos),\r\n sign = (uint >> 31) * 2 + 1,\r\n exponent = uint >>> 23 & 255,\r\n mantissa = uint & 8388607;\r\n return exponent === 255\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 1.401298464324817e-45 * mantissa\r\n : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n }\r\n\r\n exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n })();\r\n\r\n // double: typed array\r\n if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n var f64 = new Float64Array([-0]),\r\n f8b = new Uint8Array(f64.buffer),\r\n le = f8b[7] === 128;\r\n\r\n function writeDouble_f64_cpy(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[0];\r\n buf[pos + 1] = f8b[1];\r\n buf[pos + 2] = f8b[2];\r\n buf[pos + 3] = f8b[3];\r\n buf[pos + 4] = f8b[4];\r\n buf[pos + 5] = f8b[5];\r\n buf[pos + 6] = f8b[6];\r\n buf[pos + 7] = f8b[7];\r\n }\r\n\r\n function writeDouble_f64_rev(val, buf, pos) {\r\n f64[0] = val;\r\n buf[pos ] = f8b[7];\r\n buf[pos + 1] = f8b[6];\r\n buf[pos + 2] = f8b[5];\r\n buf[pos + 3] = f8b[4];\r\n buf[pos + 4] = f8b[3];\r\n buf[pos + 5] = f8b[2];\r\n buf[pos + 6] = f8b[1];\r\n buf[pos + 7] = f8b[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n function readDouble_f64_cpy(buf, pos) {\r\n f8b[0] = buf[pos ];\r\n f8b[1] = buf[pos + 1];\r\n f8b[2] = buf[pos + 2];\r\n f8b[3] = buf[pos + 3];\r\n f8b[4] = buf[pos + 4];\r\n f8b[5] = buf[pos + 5];\r\n f8b[6] = buf[pos + 6];\r\n f8b[7] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n function readDouble_f64_rev(buf, pos) {\r\n f8b[7] = buf[pos ];\r\n f8b[6] = buf[pos + 1];\r\n f8b[5] = buf[pos + 2];\r\n f8b[4] = buf[pos + 3];\r\n f8b[3] = buf[pos + 4];\r\n f8b[2] = buf[pos + 5];\r\n f8b[1] = buf[pos + 6];\r\n f8b[0] = buf[pos + 7];\r\n return f64[0];\r\n }\r\n\r\n /* istanbul ignore next */\r\n exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n /* istanbul ignore next */\r\n exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n // double: ieee754\r\n })(); else (function() {\r\n\r\n function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n var sign = val < 0 ? 1 : 0;\r\n if (sign)\r\n val = -val;\r\n if (val === 0) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n } else if (isNaN(val)) {\r\n writeUint(0, buf, pos + off0);\r\n writeUint(2146959360, buf, pos + off1);\r\n } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n writeUint(0, buf, pos + off0);\r\n writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n } else {\r\n var mantissa;\r\n if (val < 2.2250738585072014e-308) { // denormal\r\n mantissa = val / 5e-324;\r\n writeUint(mantissa >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n } else {\r\n var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n if (exponent === 1024)\r\n exponent = 1023;\r\n mantissa = val * Math.pow(2, -exponent);\r\n writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n }\r\n }\r\n }\r\n\r\n exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n var lo = readUint(buf, pos + off0),\r\n hi = readUint(buf, pos + off1);\r\n var sign = (hi >> 31) * 2 + 1,\r\n exponent = hi >>> 20 & 2047,\r\n mantissa = 4294967296 * (hi & 1048575) + lo;\r\n return exponent === 2047\r\n ? mantissa\r\n ? NaN\r\n : sign * Infinity\r\n : exponent === 0 // denormal\r\n ? sign * 5e-324 * mantissa\r\n : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n }\r\n\r\n exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n })();\r\n\r\n return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n buf[pos ] = val & 255;\r\n buf[pos + 1] = val >>> 8 & 255;\r\n buf[pos + 2] = val >>> 16 & 255;\r\n buf[pos + 3] = val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n buf[pos ] = val >>> 24;\r\n buf[pos + 1] = val >>> 16 & 255;\r\n buf[pos + 2] = val >>> 8 & 255;\r\n buf[pos + 3] = val & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n return (buf[pos ]\r\n | buf[pos + 1] << 8\r\n | buf[pos + 2] << 16\r\n | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n return (buf[pos ] << 24\r\n | buf[pos + 1] << 16\r\n | buf[pos + 2] << 8\r\n | buf[pos + 3]) >>> 0;\r\n}\r\n", "\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n try {\r\n var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n if (mod && (mod.length || Object.keys(mod).length))\r\n return mod;\r\n } catch (e) {} // eslint-disable-line no-empty\r\n return null;\r\n}\r\n", "\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n var len = 0,\r\n c = 0;\r\n for (var i = 0; i < string.length; ++i) {\r\n c = string.charCodeAt(i);\r\n if (c < 128)\r\n len += 1;\r\n else if (c < 2048)\r\n len += 2;\r\n else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n ++i;\r\n len += 4;\r\n } else\r\n len += 3;\r\n }\r\n return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n var len = end - start;\r\n if (len < 1)\r\n return \"\";\r\n var parts = null,\r\n chunk = [],\r\n i = 0, // char offset\r\n t; // temporary\r\n while (start < end) {\r\n t = buffer[start++];\r\n if (t < 128)\r\n chunk[i++] = t;\r\n else if (t > 191 && t < 224)\r\n chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n else if (t > 239 && t < 365) {\r\n t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n chunk[i++] = 0xD800 + (t >> 10);\r\n chunk[i++] = 0xDC00 + (t & 1023);\r\n } else\r\n chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n if (i > 8191) {\r\n (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n i = 0;\r\n }\r\n }\r\n if (parts) {\r\n if (i)\r\n parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n return parts.join(\"\");\r\n }\r\n return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n var start = offset,\r\n c1, // character 1\r\n c2; // character 2\r\n for (var i = 0; i < string.length; ++i) {\r\n c1 = string.charCodeAt(i);\r\n if (c1 < 128) {\r\n buffer[offset++] = c1;\r\n } else if (c1 < 2048) {\r\n buffer[offset++] = c1 >> 6 | 192;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n ++i;\r\n buffer[offset++] = c1 >> 18 | 240;\r\n buffer[offset++] = c1 >> 12 & 63 | 128;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n } else {\r\n buffer[offset++] = c1 >> 12 | 224;\r\n buffer[offset++] = c1 >> 6 & 63 | 128;\r\n buffer[offset++] = c1 & 63 | 128;\r\n }\r\n }\r\n return offset - start;\r\n};\r\n", "\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n var SIZE = size || 8192;\r\n var MAX = SIZE >>> 1;\r\n var slab = null;\r\n var offset = SIZE;\r\n return function pool_alloc(size) {\r\n if (size < 1 || size > MAX)\r\n return alloc(size);\r\n if (offset + size > SIZE) {\r\n slab = alloc(SIZE);\r\n offset = 0;\r\n }\r\n var buf = slice.call(slab, offset, offset += size);\r\n if (offset & 7) // align to 32 bit\r\n offset = (offset | 7) + 1;\r\n return buf;\r\n };\r\n}\r\n", "\"use strict\";\nmodule.exports = LongBits;\n\nvar util = require(\"../util/minimal\");\n\n/**\n * Constructs new long bits.\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @constructor\n * @param {number} lo Low 32 bits, unsigned\n * @param {number} hi High 32 bits, unsigned\n */\nfunction LongBits(lo, hi) {\n\n // note that the casts below are theoretically unnecessary as of today, but older statically\n // generated converter code might still call the ctor with signed 32bits. kept for compat.\n\n /**\n * Low bits.\n * @type {number}\n */\n this.lo = lo >>> 0;\n\n /**\n * High bits.\n * @type {number}\n */\n this.hi = hi >>> 0;\n}\n\n/**\n * Zero bits.\n * @memberof util.LongBits\n * @type {util.LongBits}\n */\nvar zero = LongBits.zero = new LongBits(0, 0);\n\nzero.toNumber = function() { return 0; };\nzero.zzEncode = zero.zzDecode = function() { return this; };\nzero.length = function() { return 1; };\n\n/**\n * Zero hash.\n * @memberof util.LongBits\n * @type {string}\n */\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\n\n/**\n * Constructs new long bits from the specified number.\n * @param {number} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.fromNumber = function fromNumber(value) {\n if (value === 0)\n return zero;\n var sign = value < 0;\n if (sign)\n value = -value;\n var lo = value >>> 0,\n hi = (value - lo) / 4294967296 >>> 0;\n if (sign) {\n hi = ~hi >>> 0;\n lo = ~lo >>> 0;\n if (++lo > 4294967295) {\n lo = 0;\n if (++hi > 4294967295)\n hi = 0;\n }\n }\n return new LongBits(lo, hi);\n};\n\n/**\n * Constructs new long bits from a number, long or string.\n * @param {Long|number|string} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.from = function from(value) {\n if (typeof value === \"number\")\n return LongBits.fromNumber(value);\n if (util.isString(value)) {\n /* istanbul ignore else */\n if (util.Long)\n value = util.Long.fromString(value);\n else\n return LongBits.fromNumber(parseInt(value, 10));\n }\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n};\n\n/**\n * Converts this long bits to a possibly unsafe JavaScript number.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {number} Possibly unsafe number\n */\nLongBits.prototype.toNumber = function toNumber(unsigned) {\n if (!unsigned && this.hi >>> 31) {\n var lo = ~this.lo + 1 >>> 0,\n hi = ~this.hi >>> 0;\n if (!lo)\n hi = hi + 1 >>> 0;\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n};\n\n/**\n * Converts this long bits to a long.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long} Long\n */\nLongBits.prototype.toLong = function toLong(unsigned) {\n return util.Long\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\n /* istanbul ignore next */\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\n};\n\nvar charCodeAt = String.prototype.charCodeAt;\n\n/**\n * Constructs new long bits from the specified 8 characters long hash.\n * @param {string} hash Hash\n * @returns {util.LongBits} Bits\n */\nLongBits.fromHash = function fromHash(hash) {\n if (hash === zeroHash)\n return zero;\n return new LongBits(\n ( charCodeAt.call(hash, 0)\n | charCodeAt.call(hash, 1) << 8\n | charCodeAt.call(hash, 2) << 16\n | charCodeAt.call(hash, 3) << 24) >>> 0\n ,\n ( charCodeAt.call(hash, 4)\n | charCodeAt.call(hash, 5) << 8\n | charCodeAt.call(hash, 6) << 16\n | charCodeAt.call(hash, 7) << 24) >>> 0\n );\n};\n\n/**\n * Converts this long bits to a 8 characters long hash.\n * @returns {string} Hash\n */\nLongBits.prototype.toHash = function toHash() {\n return String.fromCharCode(\n this.lo & 255,\n this.lo >>> 8 & 255,\n this.lo >>> 16 & 255,\n this.lo >>> 24 ,\n this.hi & 255,\n this.hi >>> 8 & 255,\n this.hi >>> 16 & 255,\n this.hi >>> 24\n );\n};\n\n/**\n * Zig-zag encodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzEncode = function zzEncode() {\n var mask = this.hi >> 31;\n this.hi = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\n this.lo = ( this.lo << 1 ^ mask) >>> 0;\n return this;\n};\n\n/**\n * Zig-zag decodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzDecode = function zzDecode() {\n var mask = -(this.lo & 1);\n this.lo = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\n this.hi = ( this.hi >>> 1 ^ mask) >>> 0;\n return this;\n};\n\n/**\n * Calculates the length of this longbits when encoded as a varint.\n * @returns {number} Length\n */\nLongBits.prototype.length = function length() {\n var part0 = this.lo,\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\n part2 = this.hi >>> 24;\n return part2 === 0\n ? part1 === 0\n ? part0 < 16384\n ? part0 < 128 ? 1 : 2\n : part0 < 2097152 ? 3 : 4\n : part1 < 16384\n ? part1 < 128 ? 5 : 6\n : part1 < 2097152 ? 7 : 8\n : part2 < 128 ? 9 : 10;\n};\n", "\"use strict\";\nvar util = exports;\n\n// used to return a Promise where callback is omitted\nutil.asPromise = require(\"@protobufjs/aspromise\");\n\n// converts to / from base64 encoded strings\nutil.base64 = require(\"@protobufjs/base64\");\n\n// base class of rpc.Service\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\n\n// float handling accross browsers\nutil.float = require(\"@protobufjs/float\");\n\n// requires modules optionally and hides the call from bundlers\nutil.inquire = require(\"@protobufjs/inquire\");\n\n// converts to / from utf8 encoded strings\nutil.utf8 = require(\"@protobufjs/utf8\");\n\n// provides a node-like buffer pool in the browser\nutil.pool = require(\"@protobufjs/pool\");\n\n// utility to work with the low and high bits of a 64 bit value\nutil.LongBits = require(\"./longbits\");\n\n/**\n * Whether running within node or not.\n * @memberof util\n * @type {boolean}\n */\nutil.isNode = Boolean(typeof global !== \"undefined\"\n && global\n && global.process\n && global.process.versions\n && global.process.versions.node);\n\n/**\n * Global object reference.\n * @memberof util\n * @type {Object}\n */\nutil.global = util.isNode && global\n || typeof window !== \"undefined\" && window\n || typeof self !== \"undefined\" && self\n || this; // eslint-disable-line no-invalid-this\n\n/**\n * An immuable empty array.\n * @memberof util\n * @type {Array.<*>}\n * @const\n */\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\n\n/**\n * An immutable empty object.\n * @type {Object}\n * @const\n */\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\n\n/**\n * Tests if the specified value is an integer.\n * @function\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is an integer\n */\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\n};\n\n/**\n * Tests if the specified value is a string.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a string\n */\nutil.isString = function isString(value) {\n return typeof value === \"string\" || value instanceof String;\n};\n\n/**\n * Tests if the specified value is a non-null object.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a non-null object\n */\nutil.isObject = function isObject(value) {\n return value && typeof value === \"object\";\n};\n\n/**\n * Checks if a property on a message is considered to be present.\n * This is an alias of {@link util.isSet}.\n * @function\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isset =\n\n/**\n * Checks if a property on a message is considered to be present.\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isSet = function isSet(obj, prop) {\n var value = obj[prop];\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\n return false;\n};\n\n/**\n * Any compatible Buffer instance.\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\n * @interface Buffer\n * @extends Uint8Array\n */\n\n/**\n * Node's Buffer class if available.\n * @type {Constructor<Buffer>}\n */\nutil.Buffer = (function() {\n try {\n var Buffer = util.inquire(\"buffer\").Buffer;\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\n } catch (e) {\n /* istanbul ignore next */\n return null;\n }\n})();\n\n// Internal alias of or polyfull for Buffer.from.\nutil._Buffer_from = null;\n\n// Internal alias of or polyfill for Buffer.allocUnsafe.\nutil._Buffer_allocUnsafe = null;\n\n/**\n * Creates a new buffer of whatever type supported by the environment.\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\n * @returns {Uint8Array|Buffer} Buffer\n */\nutil.newBuffer = function newBuffer(sizeOrArray) {\n /* istanbul ignore next */\n return typeof sizeOrArray === \"number\"\n ? util.Buffer\n ? util._Buffer_allocUnsafe(sizeOrArray)\n : new util.Array(sizeOrArray)\n : util.Buffer\n ? util._Buffer_from(sizeOrArray)\n : typeof Uint8Array === \"undefined\"\n ? sizeOrArray\n : new Uint8Array(sizeOrArray);\n};\n\n/**\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\n * @type {Constructor<Uint8Array>}\n */\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\n\n/**\n * Any compatible Long instance.\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\n * @interface Long\n * @property {number} low Low bits\n * @property {number} high High bits\n * @property {boolean} unsigned Whether unsigned or not\n */\n\n/**\n * Long.js's Long class if available.\n * @type {Constructor<Long>}\n */\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\n || /* istanbul ignore next */ util.global.Long\n || util.inquire(\"long\");\n\n/**\n * Regular expression used to verify 2 bit (`bool`) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key2Re = /^true|false|0|1$/;\n\n/**\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\n\n/**\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\n\n/**\n * Converts a number or long to an 8 characters long hash string.\n * @param {Long|number} value Value to convert\n * @returns {string} Hash\n */\nutil.longToHash = function longToHash(value) {\n return value\n ? util.LongBits.from(value).toHash()\n : util.LongBits.zeroHash;\n};\n\n/**\n * Converts an 8 characters long hash string to a long or number.\n * @param {string} hash Hash\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long|number} Original value\n */\nutil.longFromHash = function longFromHash(hash, unsigned) {\n var bits = util.LongBits.fromHash(hash);\n if (util.Long)\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\n return bits.toNumber(Boolean(unsigned));\n};\n\n/**\n * Merges the properties of the source object into the destination object.\n * @memberof util\n * @param {Object.<string,*>} dst Destination object\n * @param {Object.<string,*>} src Source object\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\n * @returns {Object.<string,*>} Destination object\n */\nfunction merge(dst, src, ifNotSet) { // used by converters\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\n if (dst[keys[i]] === undefined || !ifNotSet)\n dst[keys[i]] = src[keys[i]];\n return dst;\n}\n\nutil.merge = merge;\n\n/**\n * Converts the first character of a string to lower case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.lcFirst = function lcFirst(str) {\n return str.charAt(0).toLowerCase() + str.substring(1);\n};\n\n/**\n * Creates a custom error constructor.\n * @memberof util\n * @param {string} name Error name\n * @returns {Constructor<Error>} Custom error constructor\n */\nfunction newError(name) {\n\n function CustomError(message, properties) {\n\n if (!(this instanceof CustomError))\n return new CustomError(message, properties);\n\n // Error.call(this, message);\n // ^ just returns a new error instance because the ctor can be called as a function\n\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\n\n /* istanbul ignore next */\n if (Error.captureStackTrace) // node\n Error.captureStackTrace(this, CustomError);\n else\n Object.defineProperty(this, \"stack\", { value: new Error().stack || \"\" });\n\n if (properties)\n merge(this, properties);\n }\n\n (CustomError.prototype = Object.create(Error.prototype)).constructor = CustomError;\n\n Object.defineProperty(CustomError.prototype, \"name\", { get: function() { return name; } });\n\n CustomError.prototype.toString = function toString() {\n return this.name + \": \" + this.message;\n };\n\n return CustomError;\n}\n\nutil.newError = newError;\n\n/**\n * Constructs a new protocol error.\n * @classdesc Error subclass indicating a protocol specifc error.\n * @memberof util\n * @extends Error\n * @template T extends Message<T>\n * @constructor\n * @param {string} message Error message\n * @param {Object.<string,*>} [properties] Additional properties\n * @example\n * try {\n * MyMessage.decode(someBuffer); // throws if required fields are missing\n * } catch (e) {\n * if (e instanceof ProtocolError && e.instance)\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\n * }\n */\nutil.ProtocolError = newError(\"ProtocolError\");\n\n/**\n * So far decoded message instance.\n * @name util.ProtocolError#instance\n * @type {Message<T>}\n */\n\n/**\n * A OneOf getter as returned by {@link util.oneOfGetter}.\n * @typedef OneOfGetter\n * @type {function}\n * @returns {string|undefined} Set field name, if any\n */\n\n/**\n * Builds a getter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfGetter} Unbound getter\n */\nutil.oneOfGetter = function getOneOf(fieldNames) {\n var fieldMap = {};\n for (var i = 0; i < fieldNames.length; ++i)\n fieldMap[fieldNames[i]] = 1;\n\n /**\n * @returns {string|undefined} Set field name, if any\n * @this Object\n * @ignore\n */\n return function() { // eslint-disable-line consistent-return\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\n return keys[i];\n };\n};\n\n/**\n * A OneOf setter as returned by {@link util.oneOfSetter}.\n * @typedef OneOfSetter\n * @type {function}\n * @param {string|undefined} value Field name\n * @returns {undefined}\n */\n\n/**\n * Builds a setter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfSetter} Unbound setter\n */\nutil.oneOfSetter = function setOneOf(fieldNames) {\n\n /**\n * @param {string} name Field name\n * @returns {undefined}\n * @this Object\n * @ignore\n */\n return function(name) {\n for (var i = 0; i < fieldNames.length; ++i)\n if (fieldNames[i] !== name)\n delete this[fieldNames[i]];\n };\n};\n\n/**\n * Default conversion options used for {@link Message#toJSON} implementations.\n *\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\n *\n * - Longs become strings\n * - Enums become string keys\n * - Bytes become base64 encoded strings\n * - (Sub-)Messages become plain objects\n * - Maps become plain objects with all string keys\n * - Repeated fields become arrays\n * - NaN and Infinity for float and double fields become strings\n *\n * @type {IConversionOptions}\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\n */\nutil.toJSONOptions = {\n longs: String,\n enums: String,\n bytes: String,\n json: true\n};\n\n// Sets up buffer utility according to the environment (called in index-minimal)\nutil._configure = function() {\n var Buffer = util.Buffer;\n /* istanbul ignore if */\n if (!Buffer) {\n util._Buffer_from = util._Buffer_allocUnsafe = null;\n return;\n }\n // because node 4.x buffers are incompatible & immutable\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\n /* istanbul ignore next */\n function Buffer_from(value, encoding) {\n return new Buffer(value, encoding);\n };\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\n /* istanbul ignore next */\n function Buffer_allocUnsafe(size) {\n return new Buffer(size);\n };\n};\n", "\"use strict\";\nmodule.exports = Writer;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferWriter; // cyclic\n\nvar LongBits = util.LongBits,\n base64 = util.base64,\n utf8 = util.utf8;\n\n/**\n * Constructs a new writer operation instance.\n * @classdesc Scheduled writer operation.\n * @constructor\n * @param {function(*, Uint8Array, number)} fn Function to call\n * @param {number} len Value byte length\n * @param {*} val Value to write\n * @ignore\n */\nfunction Op(fn, len, val) {\n\n /**\n * Function to call.\n * @type {function(Uint8Array, number, *)}\n */\n this.fn = fn;\n\n /**\n * Value byte length.\n * @type {number}\n */\n this.len = len;\n\n /**\n * Next operation.\n * @type {Writer.Op|undefined}\n */\n this.next = undefined;\n\n /**\n * Value to write.\n * @type {*}\n */\n this.val = val; // type varies\n}\n\n/* istanbul ignore next */\nfunction noop() {} // eslint-disable-line no-empty-function\n\n/**\n * Constructs a new writer state instance.\n * @classdesc Copied writer state.\n * @memberof Writer\n * @constructor\n * @param {Writer} writer Writer to copy state from\n * @ignore\n */\nfunction State(writer) {\n\n /**\n * Current head.\n * @type {Writer.Op}\n */\n this.head = writer.head;\n\n /**\n * Current tail.\n * @type {Writer.Op}\n */\n this.tail = writer.tail;\n\n /**\n * Current buffer length.\n * @type {number}\n */\n this.len = writer.len;\n\n /**\n * Next state.\n * @type {State|null}\n */\n this.next = writer.states;\n}\n\n/**\n * Constructs a new writer instance.\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n */\nfunction Writer() {\n\n /**\n * Current length.\n * @type {number}\n */\n this.len = 0;\n\n /**\n * Operations head.\n * @type {Object}\n */\n this.head = new Op(noop, 0, 0);\n\n /**\n * Operations tail\n * @type {Object}\n */\n this.tail = this.head;\n\n /**\n * Linked forked states.\n * @type {Object|null}\n */\n this.states = null;\n\n // When a value is written, the writer calculates its byte length and puts it into a linked\n // list of operations to perform when finish() is called. This both allows us to allocate\n // buffers of the exact required size and reduces the amount of work we have to do compared\n // to first calculating over objects and then encoding over objects. In our case, the encoding\n // part is just a linked list walk calling operations with already prepared values.\n}\n\nvar create = function create() {\n return util.Buffer\n ? function create_buffer_setup() {\n return (Writer.create = function create_buffer() {\n return new BufferWriter();\n })();\n }\n /* istanbul ignore next */\n : function create_array() {\n return new Writer();\n };\n};\n\n/**\n * Creates a new writer.\n * @function\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\n */\nWriter.create = create();\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Uint8Array} Buffer\n */\nWriter.alloc = function alloc(size) {\n return new util.Array(size);\n};\n\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\n/* istanbul ignore else */\nif (util.Array !== Array)\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\n\n/**\n * Pushes a new operation to the queue.\n * @param {function(Uint8Array, number, *)} fn Function to call\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @returns {Writer} `this`\n * @private\n */\nWriter.prototype._push = function push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n};\n\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\n\nfunction writeVarint32(val, buf, pos) {\n while (val > 127) {\n buf[pos++] = val & 127 | 128;\n val >>>= 7;\n }\n buf[pos] = val;\n}\n\n/**\n * Constructs a new varint writer operation instance.\n * @classdesc Scheduled varint writer operation.\n * @extends Op\n * @constructor\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @ignore\n */\nfunction VarintOp(len, val) {\n this.len = len;\n this.next = undefined;\n this.val = val;\n}\n\nVarintOp.prototype = Object.create(Op.prototype);\nVarintOp.prototype.fn = writeVarint32;\n\n/**\n * Writes an unsigned 32 bit value as a varint.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.uint32 = function write_uint32(value) {\n // here, the call to this.push has been inlined and a varint specific Op subclass is used.\n // uint32 is by far the most frequently used operation and benefits significantly from this.\n this.len += (this.tail = this.tail.next = new VarintOp(\n (value = value >>> 0)\n < 128 ? 1\n : value < 16384 ? 2\n : value < 2097152 ? 3\n : value < 268435456 ? 4\n : 5,\n value)).len;\n return this;\n};\n\n/**\n * Writes a signed 32 bit value as a varint.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.int32 = function write_int32(value) {\n return value < 0\n ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\n : this.uint32(value);\n};\n\n/**\n * Writes a 32 bit value as a varint, zig-zag encoded.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sint32 = function write_sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n};\n\nfunction writeVarint64(val, buf, pos) {\n while (val.hi) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\n val.hi >>>= 7;\n }\n while (val.lo > 127) {\n buf[pos++] = val.lo & 127 | 128;\n val.lo = val.lo >>> 7;\n }\n buf[pos++] = val.lo;\n}\n\n/**\n * Writes an unsigned 64 bit value as a varint.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.uint64 = function write_uint64(value) {\n var bits = LongBits.from(value);\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a signed 64 bit value as a varint.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.int64 = Writer.prototype.uint64;\n\n/**\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sint64 = function write_sint64(value) {\n var bits = LongBits.from(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a boolish value as a varint.\n * @param {boolean} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bool = function write_bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n};\n\nfunction writeFixed32(val, buf, pos) {\n buf[pos ] = val & 255;\n buf[pos + 1] = val >>> 8 & 255;\n buf[pos + 2] = val >>> 16 & 255;\n buf[pos + 3] = val >>> 24;\n}\n\n/**\n * Writes an unsigned 32 bit value as fixed 32 bits.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.fixed32 = function write_fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n};\n\n/**\n * Writes a signed 32 bit value as fixed 32 bits.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\n\n/**\n * Writes an unsigned 64 bit value as fixed 64 bits.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.fixed64 = function write_fixed64(value) {\n var bits = LongBits.from(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n};\n\n/**\n * Writes a signed 64 bit value as fixed 64 bits.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\n\n/**\n * Writes a float (32 bit).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.float = function write_float(value) {\n return this._push(util.float.writeFloatLE, 4, value);\n};\n\n/**\n * Writes a double (64 bit float).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.double = function write_double(value) {\n return this._push(util.float.writeDoubleLE, 8, value);\n};\n\nvar writeBytes = util.Array.prototype.set\n ? function writeBytes_set(val, buf, pos) {\n buf.set(val, pos); // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytes_for(val, buf, pos) {\n for (var i = 0; i < val.length; ++i)\n buf[pos + i] = val[i];\n };\n\n/**\n * Writes a sequence of bytes.\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bytes = function write_bytes(value) {\n var len = value.length >>> 0;\n if (!len)\n return this._push(writeByte, 1, 0);\n if (util.isString(value)) {\n var buf = Writer.alloc(len = base64.length(value));\n base64.decode(value, buf, 0);\n value = buf;\n }\n return this.uint32(len)._push(writeBytes, len, value);\n};\n\n/**\n * Writes a string.\n * @param {string} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.string = function write_string(value) {\n var len = utf8.length(value);\n return len\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n};\n\n/**\n * Forks this writer's state by pushing it to a stack.\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\n * @returns {Writer} `this`\n */\nWriter.prototype.fork = function fork() {\n this.states = new State(this);\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n return this;\n};\n\n/**\n * Resets this instance to the last state.\n * @returns {Writer} `this`\n */\nWriter.prototype.reset = function reset() {\n if (this.states) {\n this.head = this.states.head;\n this.tail = this.states.tail;\n this.len = this.states.len;\n this.states = this.states.next;\n } else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n};\n\n/**\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\n * @returns {Writer} `this`\n */\nWriter.prototype.ldelim = function ldelim() {\n var head = this.head,\n tail = this.tail,\n len = this.len;\n this.reset().uint32(len);\n if (len) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n};\n\n/**\n * Finishes the write operation.\n * @returns {Uint8Array} Finished buffer\n */\nWriter.prototype.finish = function finish() {\n var head = this.head.next, // skip noop\n buf = this.constructor.alloc(this.len),\n pos = 0;\n while (head) {\n head.fn(head.val, buf, pos);\n pos += head.len;\n head = head.next;\n }\n // this.head = this.tail = null;\n return buf;\n};\n\nWriter._configure = function(BufferWriter_) {\n BufferWriter = BufferWriter_;\n Writer.create = create();\n BufferWriter._configure();\n};\n", "\"use strict\";\nmodule.exports = BufferWriter;\n\n// extends Writer\nvar Writer = require(\"./writer\");\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer writer instance.\n * @classdesc Wire format writer using node buffers.\n * @extends Writer\n * @constructor\n */\nfunction BufferWriter() {\n Writer.call(this);\n}\n\nBufferWriter._configure = function () {\n /**\n * Allocates a buffer of the specified size.\n * @function\n * @param {number} size Buffer size\n * @returns {Buffer} Buffer\n */\n BufferWriter.alloc = util._Buffer_allocUnsafe;\n\n BufferWriter.writeBytesBuffer = util.Buffer && util.Buffer.prototype instanceof Uint8Array && util.Buffer.prototype.set.name === \"set\"\n ? function writeBytesBuffer_set(val, buf, pos) {\n buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytesBuffer_copy(val, buf, pos) {\n if (val.copy) // Buffer values\n val.copy(buf, pos, 0, val.length);\n else for (var i = 0; i < val.length;) // plain array values\n buf[pos++] = val[i++];\n };\n};\n\n\n/**\n * @override\n */\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\n if (util.isString(value))\n value = util._Buffer_from(value, \"base64\");\n var len = value.length >>> 0;\n this.uint32(len);\n if (len)\n this._push(BufferWriter.writeBytesBuffer, len, value);\n return this;\n};\n\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\n util.utf8.write(val, buf, pos);\n else if (buf.utf8Write)\n buf.utf8Write(val, pos);\n else\n buf.write(val, pos);\n}\n\n/**\n * @override\n */\nBufferWriter.prototype.string = function write_string_buffer(value) {\n var len = util.Buffer.byteLength(value);\n this.uint32(len);\n if (len)\n this._push(writeStringBuffer, len, value);\n return this;\n};\n\n\n/**\n * Finishes the write operation.\n * @name BufferWriter#finish\n * @function\n * @returns {Buffer} Finished buffer\n */\n\nBufferWriter._configure();\n", "\"use strict\";\nmodule.exports = Reader;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferReader; // cyclic\n\nvar LongBits = util.LongBits,\n utf8 = util.utf8;\n\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\n}\n\n/**\n * Constructs a new reader instance using the specified buffer.\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n * @param {Uint8Array} buffer Buffer to read from\n */\nfunction Reader(buffer) {\n\n /**\n * Read buffer.\n * @type {Uint8Array}\n */\n this.buf = buffer;\n\n /**\n * Read buffer position.\n * @type {number}\n */\n this.pos = 0;\n\n /**\n * Read buffer length.\n * @type {number}\n */\n this.len = buffer.length;\n}\n\nvar create_array = typeof Uint8Array !== \"undefined\"\n ? function create_typed_array(buffer) {\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n }\n /* istanbul ignore next */\n : function create_array(buffer) {\n if (Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n };\n\nvar create = function create() {\n return util.Buffer\n ? function create_buffer_setup(buffer) {\n return (Reader.create = function create_buffer(buffer) {\n return util.Buffer.isBuffer(buffer)\n ? new BufferReader(buffer)\n /* istanbul ignore next */\n : create_array(buffer);\n })(buffer);\n }\n /* istanbul ignore next */\n : create_array;\n};\n\n/**\n * Creates a new reader using the specified buffer.\n * @function\n * @param {Uint8Array|Buffer} buffer Buffer to read from\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\n * @throws {Error} If `buffer` is not a valid buffer\n */\nReader.create = create();\n\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\n\n/**\n * Reads a varint as an unsigned 32 bit value.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.uint32 = (function read_uint32_setup() {\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\n return function read_uint32() {\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\n\n /* istanbul ignore if */\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n };\n})();\n\n/**\n * Reads a varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.int32 = function read_int32() {\n return this.uint32() | 0;\n};\n\n/**\n * Reads a zig-zag encoded varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.sint32 = function read_sint32() {\n var value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readLongVarint() {\n // tends to deopt with local vars for octet etc.\n var bits = new LongBits(0, 0);\n var i = 0;\n if (this.len - this.pos > 4) { // fast route (lo)\n for (; i < 4; ++i) {\n // 1st..4th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n // 5th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) >> 4) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n i = 0;\n } else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n // 1st..3th\n bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n // 4th\n bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\n return bits;\n }\n if (this.len - this.pos > 4) { // fast route (hi)\n for (; i < 5; ++i) {\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n } else {\n for (; i < 5; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n // 6th..10th\n bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n if (this.buf[this.pos++] < 128)\n return bits;\n }\n }\n /* istanbul ignore next */\n throw Error(\"invalid varint encoding\");\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads a varint as a signed 64 bit value.\n * @name Reader#int64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as an unsigned 64 bit value.\n * @name Reader#uint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a zig-zag encoded varint as a signed 64 bit value.\n * @name Reader#sint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as a boolean.\n * @returns {boolean} Value read\n */\nReader.prototype.bool = function read_bool() {\n return this.uint32() !== 0;\n};\n\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\n return (buf[end - 4]\n | buf[end - 3] << 8\n | buf[end - 2] << 16\n | buf[end - 1] << 24) >>> 0;\n}\n\n/**\n * Reads fixed 32 bits as an unsigned 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.fixed32 = function read_fixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4);\n};\n\n/**\n * Reads fixed 32 bits as a signed 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.sfixed32 = function read_sfixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readFixed64(/* this: Reader */) {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 8);\n\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads fixed 64 bits.\n * @name Reader#fixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads zig-zag encoded fixed 64 bits.\n * @name Reader#sfixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a float (32 bit) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.float = function read_float() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n};\n\n/**\n * Reads a double (64 bit float) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.double = function read_double() {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @returns {Uint8Array} Value read\n */\nReader.prototype.bytes = function read_bytes() {\n var length = this.uint32(),\n start = this.pos,\n end = this.pos + length;\n\n /* istanbul ignore if */\n if (end > this.len)\n throw indexOutOfRange(this, length);\n\n this.pos += length;\n if (Array.isArray(this.buf)) // plain array\n return this.buf.slice(start, end);\n return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\n ? new this.buf.constructor(0)\n : this._slice.call(this.buf, start, end);\n};\n\n/**\n * Reads a string preceeded by its byte length as a varint.\n * @returns {string} Value read\n */\nReader.prototype.string = function read_string() {\n var bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n};\n\n/**\n * Skips the specified number of bytes if specified, otherwise skips a varint.\n * @param {number} [length] Length if known, otherwise a varint is assumed\n * @returns {Reader} `this`\n */\nReader.prototype.skip = function skip(length) {\n if (typeof length === \"number\") {\n /* istanbul ignore if */\n if (this.pos + length > this.len)\n throw indexOutOfRange(this, length);\n this.pos += length;\n } else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n } while (this.buf[this.pos++] & 128);\n }\n return this;\n};\n\n/**\n * Skips the next element of the specified wire type.\n * @param {number} wireType Wire type received\n * @returns {Reader} `this`\n */\nReader.prototype.skipType = function(wireType) {\n switch (wireType) {\n case 0:\n this.skip();\n break;\n case 1:\n this.skip(8);\n break;\n case 2:\n this.skip(this.uint32());\n break;\n case 3:\n while ((wireType = this.uint32() & 7) !== 4) {\n this.skipType(wireType);\n }\n break;\n case 5:\n this.skip(4);\n break;\n\n /* istanbul ignore next */\n default:\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\n }\n return this;\n};\n\nReader._configure = function(BufferReader_) {\n BufferReader = BufferReader_;\n Reader.create = create();\n BufferReader._configure();\n\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\n util.merge(Reader.prototype, {\n\n int64: function read_int64() {\n return readLongVarint.call(this)[fn](false);\n },\n\n uint64: function read_uint64() {\n return readLongVarint.call(this)[fn](true);\n },\n\n sint64: function read_sint64() {\n return readLongVarint.call(this).zzDecode()[fn](false);\n },\n\n fixed64: function read_fixed64() {\n return readFixed64.call(this)[fn](true);\n },\n\n sfixed64: function read_sfixed64() {\n return readFixed64.call(this)[fn](false);\n }\n\n });\n};\n", "\"use strict\";\nmodule.exports = BufferReader;\n\n// extends Reader\nvar Reader = require(\"./reader\");\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer reader instance.\n * @classdesc Wire format reader using node buffers.\n * @extends Reader\n * @constructor\n * @param {Buffer} buffer Buffer to read from\n */\nfunction BufferReader(buffer) {\n Reader.call(this, buffer);\n\n /**\n * Read buffer.\n * @name BufferReader#buf\n * @type {Buffer}\n */\n}\n\nBufferReader._configure = function () {\n /* istanbul ignore else */\n if (util.Buffer)\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\n};\n\n\n/**\n * @override\n */\nBufferReader.prototype.string = function read_string_buffer() {\n var len = this.uint32(); // modifies pos\n return this.buf.utf8Slice\n ? this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len))\n : this.buf.toString(\"utf-8\", this.pos, this.pos = Math.min(this.pos + len, this.len));\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @name BufferReader#bytes\n * @function\n * @returns {Buffer} Value read\n */\n\nBufferReader._configure();\n", "\"use strict\";\nmodule.exports = Service;\n\nvar util = require(\"../util/minimal\");\n\n// Extends EventEmitter\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\n\n/**\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\n *\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\n * @typedef rpc.ServiceMethodCallback\n * @template TRes extends Message<TRes>\n * @type {function}\n * @param {Error|null} error Error, if any\n * @param {TRes} [response] Response message\n * @returns {undefined}\n */\n\n/**\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\n * @typedef rpc.ServiceMethod\n * @template TReq extends Message<TReq>\n * @template TRes extends Message<TRes>\n * @type {function}\n * @param {TReq|Properties<TReq>} request Request message or plain object\n * @param {rpc.ServiceMethodCallback<TRes>} [callback] Node-style callback called with the error, if any, and the response message\n * @returns {Promise<Message<TRes>>} Promise if `callback` has been omitted, otherwise `undefined`\n */\n\n/**\n * Constructs a new RPC service instance.\n * @classdesc An RPC service as returned by {@link Service#create}.\n * @exports rpc.Service\n * @extends util.EventEmitter\n * @constructor\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n */\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\n\n if (typeof rpcImpl !== \"function\")\n throw TypeError(\"rpcImpl must be a function\");\n\n util.EventEmitter.call(this);\n\n /**\n * RPC implementation. Becomes `null` once the service is ended.\n * @type {RPCImpl|null}\n */\n this.rpcImpl = rpcImpl;\n\n /**\n * Whether requests are length-delimited.\n * @type {boolean}\n */\n this.requestDelimited = Boolean(requestDelimited);\n\n /**\n * Whether responses are length-delimited.\n * @type {boolean}\n */\n this.responseDelimited = Boolean(responseDelimited);\n}\n\n/**\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\n * @param {Method|rpc.ServiceMethod<TReq,TRes>} method Reflected or static method\n * @param {Constructor<TReq>} requestCtor Request constructor\n * @param {Constructor<TRes>} responseCtor Response constructor\n * @param {TReq|Properties<TReq>} request Request message or plain object\n * @param {rpc.ServiceMethodCallback<TRes>} callback Service callback\n * @returns {undefined}\n * @template TReq extends Message<TReq>\n * @template TRes extends Message<TRes>\n */\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\n\n if (!request)\n throw TypeError(\"request must be specified\");\n\n var self = this;\n if (!callback)\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\n\n if (!self.rpcImpl) {\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\n return undefined;\n }\n\n try {\n return self.rpcImpl(\n method,\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\n function rpcCallback(err, response) {\n\n if (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n\n if (response === null) {\n self.end(/* endedByRPC */ true);\n return undefined;\n }\n\n if (!(response instanceof responseCtor)) {\n try {\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\n } catch (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n }\n\n self.emit(\"data\", response, method);\n return callback(null, response);\n }\n );\n } catch (err) {\n self.emit(\"error\", err, method);\n setTimeout(function() { callback(err); }, 0);\n return undefined;\n }\n};\n\n/**\n * Ends this service and emits the `end` event.\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\n * @returns {rpc.Service} `this`\n */\nService.prototype.end = function end(endedByRPC) {\n if (this.rpcImpl) {\n if (!endedByRPC) // signal end to rpcImpl\n this.rpcImpl(null, null, null);\n this.rpcImpl = null;\n this.emit(\"end\").off();\n }\n return this;\n};\n", "\"use strict\";\n\n/**\n * Streaming RPC helpers.\n * @namespace\n */\nvar rpc = exports;\n\n/**\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\n * @typedef RPCImpl\n * @type {function}\n * @param {Method|rpc.ServiceMethod<Message<{}>,Message<{}>>} method Reflected or static method being called\n * @param {Uint8Array} requestData Request data\n * @param {RPCImplCallback} callback Callback function\n * @returns {undefined}\n * @example\n * function rpcImpl(method, requestData, callback) {\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\n * throw Error(\"no such method\");\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\n * callback(err, responseData);\n * });\n * }\n */\n\n/**\n * Node-style callback as used by {@link RPCImpl}.\n * @typedef RPCImplCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\n * @returns {undefined}\n */\n\nrpc.Service = require(\"./rpc/service\");\n", "\"use strict\";\nmodule.exports = {};\n\n/**\n * Named roots.\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\n * Can also be used manually to make roots available accross modules.\n * @name roots\n * @type {Object.<string,Root>}\n * @example\n * // pbjs -r myroot -o compiled.js ...\n *\n * // in another module:\n * require(\"./compiled.js\");\n *\n * // in any subsequent module:\n * var root = protobuf.roots[\"myroot\"];\n */\n", "\"use strict\";\nvar protobuf = exports;\n\n/**\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\n * @name build\n * @type {string}\n * @const\n */\nprotobuf.build = \"minimal\";\n\n// Serialization\nprotobuf.Writer = require(\"./writer\");\nprotobuf.BufferWriter = require(\"./writer_buffer\");\nprotobuf.Reader = require(\"./reader\");\nprotobuf.BufferReader = require(\"./reader_buffer\");\n\n// Utility\nprotobuf.util = require(\"./util/minimal\");\nprotobuf.rpc = require(\"./rpc\");\nprotobuf.roots = require(\"./roots\");\nprotobuf.configure = configure;\n\n/* istanbul ignore next */\n/**\n * Reconfigures the library according to the environment.\n * @returns {undefined}\n */\nfunction configure() {\n protobuf.util._configure();\n protobuf.Writer._configure(protobuf.BufferWriter);\n protobuf.Reader._configure(protobuf.BufferReader);\n}\n\n// Set up buffer utility according to the environment\nconfigure();\n", "// minimal library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index-minimal\");\n", "/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"default\"] || ($protobuf.roots[\"default\"] = {});\n\n$root.PBLink = (function() {\n\n /**\n * Properties of a PBLink.\n * @exports IPBLink\n * @interface IPBLink\n * @property {Uint8Array|null} [Hash] PBLink Hash\n * @property {string|null} [Name] PBLink Name\n * @property {number|null} [Tsize] PBLink Tsize\n */\n\n /**\n * Constructs a new PBLink.\n * @exports PBLink\n * @classdesc Represents a PBLink.\n * @implements IPBLink\n * @constructor\n * @param {IPBLink=} [p] Properties to set\n */\n function PBLink(p) {\n if (p)\n for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n if (p[ks[i]] != null)\n this[ks[i]] = p[ks[i]];\n }\n\n /**\n * PBLink Hash.\n * @member {Uint8Array} Hash\n * @memberof PBLink\n * @instance\n */\n PBLink.prototype.Hash = $util.newBuffer([]);\n\n /**\n * PBLink Name.\n * @member {string} Name\n * @memberof PBLink\n * @instance\n */\n PBLink.prototype.Name = \"\";\n\n /**\n * PBLink Tsize.\n * @member {number} Tsize\n * @memberof PBLink\n * @instance\n */\n PBLink.prototype.Tsize = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n /**\n * Encodes the specified PBLink message. Does not implicitly {@link PBLink.verify|verify} messages.\n * @function encode\n * @memberof PBLink\n * @static\n * @param {IPBLink} m PBLink message or plain object to encode\n * @param {$protobuf.Writer} [w] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n PBLink.encode = function encode(m, w) {\n if (!w)\n w = $Writer.create();\n if (m.Hash != null && Object.hasOwnProperty.call(m, \"Hash\"))\n w.uint32(10).bytes(m.Hash);\n if (m.Name != null && Object.hasOwnProperty.call(m, \"Name\"))\n w.uint32(18).string(m.Name);\n if (m.Tsize != null && Object.hasOwnProperty.call(m, \"Tsize\"))\n w.uint32(24).uint64(m.Tsize);\n return w;\n };\n\n /**\n * Decodes a PBLink message from the specified reader or buffer.\n * @function decode\n * @memberof PBLink\n * @static\n * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n * @param {number} [l] Message length if known beforehand\n * @returns {PBLink} PBLink\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n PBLink.decode = function decode(r, l) {\n if (!(r instanceof $Reader))\n r = $Reader.create(r);\n var c = l === undefined ? r.len : r.pos + l, m = new $root.PBLink();\n while (r.pos < c) {\n var t = r.uint32();\n switch (t >>> 3) {\n case 1:\n m.Hash = r.bytes();\n break;\n case 2:\n m.Name = r.string();\n break;\n case 3:\n m.Tsize = r.uint64();\n break;\n default:\n r.skipType(t & 7);\n break;\n }\n }\n return m;\n };\n\n /**\n * Creates a PBLink message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof PBLink\n * @static\n * @param {Object.<string,*>} d Plain object\n * @returns {PBLink} PBLink\n */\n PBLink.fromObject = function fromObject(d) {\n if (d instanceof $root.PBLink)\n return d;\n var m = new $root.PBLink();\n if (d.Hash != null) {\n if (typeof d.Hash === \"string\")\n $util.base64.decode(d.Hash, m.Hash = $util.newBuffer($util.base64.length(d.Hash)), 0);\n else if (d.Hash.length)\n m.Hash = d.Hash;\n }\n if (d.Name != null) {\n m.Name = String(d.Name);\n }\n if (d.Tsize != null) {\n if ($util.Long)\n (m.Tsize = $util.Long.fromValue(d.Tsize)).unsigned = true;\n else if (typeof d.Tsize === \"string\")\n m.Tsize = parseInt(d.Tsize, 10);\n else if (typeof d.Tsize === \"number\")\n m.Tsize = d.Tsize;\n else if (typeof d.Tsize === \"object\")\n m.Tsize = new $util.LongBits(d.Tsize.low >>> 0, d.Tsize.high >>> 0).toNumber(true);\n }\n return m;\n };\n\n /**\n * Creates a plain object from a PBLink message. Also converts values to other types if specified.\n * @function toObject\n * @memberof PBLink\n * @static\n * @param {PBLink} m PBLink\n * @param {$protobuf.IConversionOptions} [o] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n PBLink.toObject = function toObject(m, o) {\n if (!o)\n o = {};\n var d = {};\n if (o.defaults) {\n if (o.bytes === String)\n d.Hash = \"\";\n else {\n d.Hash = [];\n if (o.bytes !== Array)\n d.Hash = $util.newBuffer(d.Hash);\n }\n d.Name = \"\";\n if ($util.Long) {\n var n = new $util.Long(0, 0, true);\n d.Tsize = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n } else\n d.Tsize = o.longs === String ? \"0\" : 0;\n }\n if (m.Hash != null && m.hasOwnProperty(\"Hash\")) {\n d.Hash = o.bytes === String ? $util.base64.encode(m.Hash, 0, m.Hash.length) : o.bytes === Array ? Array.prototype.slice.call(m.Hash) : m.Hash;\n }\n if (m.Name != null && m.hasOwnProperty(\"Name\")) {\n d.Name = m.Name;\n }\n if (m.Tsize != null && m.hasOwnProperty(\"Tsize\")) {\n if (typeof m.Tsize === \"number\")\n d.Tsize = o.longs === String ? String(m.Tsize) : m.Tsize;\n else\n d.Tsize = o.longs === String ? $util.Long.prototype.toString.call(m.Tsize) : o.longs === Number ? new $util.LongBits(m.Tsize.low >>> 0, m.Tsize.high >>> 0).toNumber(true) : m.Tsize;\n }\n return d;\n };\n\n /**\n * Converts this PBLink to JSON.\n * @function toJSON\n * @memberof PBLink\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n PBLink.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n };\n\n return PBLink;\n})();\n\n$root.PBNode = (function() {\n\n /**\n * Properties of a PBNode.\n * @exports IPBNode\n * @interface IPBNode\n * @property {Array.<IPBLink>|null} [Links] PBNode Links\n * @property {Uint8Array|null} [Data] PBNode Data\n */\n\n /**\n * Constructs a new PBNode.\n * @exports PBNode\n * @classdesc Represents a PBNode.\n * @implements IPBNode\n * @constructor\n * @param {IPBNode=} [p] Properties to set\n */\n function PBNode(p) {\n this.Links = [];\n if (p)\n for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n if (p[ks[i]] != null)\n this[ks[i]] = p[ks[i]];\n }\n\n /**\n * PBNode Links.\n * @member {Array.<IPBLink>} Links\n * @memberof PBNode\n * @instance\n */\n PBNode.prototype.Links = $util.emptyArray;\n\n /**\n * PBNode Data.\n * @member {Uint8Array} Data\n * @memberof PBNode\n * @instance\n */\n PBNode.prototype.Data = $util.newBuffer([]);\n\n /**\n * Encodes the specified PBNode message. Does not implicitly {@link PBNode.verify|verify} messages.\n * @function encode\n * @memberof PBNode\n * @static\n * @param {IPBNode} m PBNode message or plain object to encode\n * @param {$protobuf.Writer} [w] Writer to encode to\n * @returns {$protobuf.Writer} Writer\n */\n PBNode.encode = function encode(m, w) {\n if (!w)\n w = $Writer.create();\n if (m.Data != null && Object.hasOwnProperty.call(m, \"Data\"))\n w.uint32(10).bytes(m.Data);\n if (m.Links != null && m.Links.length) {\n for (var i = 0; i < m.Links.length; ++i)\n $root.PBLink.encode(m.Links[i], w.uint32(18).fork()).ldelim();\n }\n return w;\n };\n\n /**\n * Decodes a PBNode message from the specified reader or buffer.\n * @function decode\n * @memberof PBNode\n * @static\n * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n * @param {number} [l] Message length if known beforehand\n * @returns {PBNode} PBNode\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {$protobuf.util.ProtocolError} If required fields are missing\n */\n PBNode.decode = function decode(r, l) {\n if (!(r instanceof $Reader))\n r = $Reader.create(r);\n var c = l === undefined ? r.len : r.pos + l, m = new $root.PBNode();\n while (r.pos < c) {\n var t = r.uint32();\n switch (t >>> 3) {\n case 2:\n if (!(m.Links && m.Links.length))\n m.Links = [];\n m.Links.push($root.PBLink.decode(r, r.uint32()));\n break;\n case 1:\n m.Data = r.bytes();\n break;\n default:\n r.skipType(t & 7);\n break;\n }\n }\n return m;\n };\n\n /**\n * Creates a PBNode message from a plain object. Also converts values to their respective internal types.\n * @function fromObject\n * @memberof PBNode\n * @static\n * @param {Object.<string,*>} d Plain object\n * @returns {PBNode} PBNode\n */\n PBNode.fromObject = function fromObject(d) {\n if (d instanceof $root.PBNode)\n return d;\n var m = new $root.PBNode();\n if (d.Links) {\n if (!Array.isArray(d.Links))\n throw TypeError(\".PBNode.Links: array expected\");\n m.Links = [];\n for (var i = 0; i < d.Links.length; ++i) {\n if (typeof d.Links[i] !== \"object\")\n throw TypeError(\".PBNode.Links: object expected\");\n m.Links[i] = $root.PBLink.fromObject(d.Links[i]);\n }\n }\n if (d.Data != null) {\n if (typeof d.Data === \"string\")\n $util.base64.decode(d.Data, m.Data = $util.newBuffer($util.base64.length(d.Data)), 0);\n else if (d.Data.length)\n m.Data = d.Data;\n }\n return m;\n };\n\n /**\n * Creates a plain object from a PBNode message. Also converts values to other types if specified.\n * @function toObject\n * @memberof PBNode\n * @static\n * @param {PBNode} m PBNode\n * @param {$protobuf.IConversionOptions} [o] Conversion options\n * @returns {Object.<string,*>} Plain object\n */\n PBNode.toObject = function toObject(m, o) {\n if (!o)\n o = {};\n var d = {};\n if (o.arrays || o.defaults) {\n d.Links = [];\n }\n if (o.defaults) {\n if (o.bytes === String)\n d.Data = \"\";\n else {\n d.Data = [];\n if (o.bytes !== Array)\n d.Data = $util.newBuffer(d.Data);\n }\n }\n if (m.Data != null && m.hasOwnProperty(\"Data\")) {\n d.Data = o.bytes === String ? $util.base64.encode(m.Data, 0, m.Data.length) : o.bytes === Array ? Array.prototype.slice.call(m.Data) : m.Data;\n }\n if (m.Links && m.Links.length) {\n d.Links = [];\n for (var j = 0; j < m.Links.length; ++j) {\n d.Links[j] = $root.PBLink.toObject(m.Links[j], o);\n }\n }\n return d;\n };\n\n /**\n * Converts this PBNode to JSON.\n * @function toJSON\n * @memberof PBNode\n * @instance\n * @returns {Object.<string,*>} JSON object\n */\n PBNode.prototype.toJSON = function toJSON() {\n return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n };\n\n return PBNode;\n})();\n\nmodule.exports = $root;\n", "'use strict'\n\nconst CID = require('cids')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * Link represents an IPFS Merkle DAG Link between Nodes.\n */\nclass DAGLink {\n /**\n * @param {string | undefined | null} name\n * @param {number} size\n * @param {CID | string | Uint8Array} cid\n */\n constructor (name, size, cid) {\n if (!cid) {\n throw new Error('A link requires a cid to point to')\n }\n\n // assert(size, 'A link requires a size')\n // note - links should include size, but this assert is disabled\n // for now to maintain consistency with go-ipfs pinset\n this.Name = name || ''\n this.Tsize = size\n this.Hash = new CID(cid)\n\n Object.defineProperties(this, {\n _nameBuf: { value: null, writable: true, enumerable: false }\n })\n }\n\n toString () {\n return `DAGLink <${this.Hash.toBaseEncodedString()} - name: \"${this.Name}\", size: ${this.Tsize}>`\n }\n\n toJSON () {\n if (!this._json) {\n this._json = Object.freeze({\n name: this.Name,\n size: this.Tsize,\n cid: this.Hash.toBaseEncodedString()\n })\n }\n\n return Object.assign({}, this._json)\n }\n\n // Memoize the Uint8Array representation of name\n // We need this to sort the links, otherwise\n // we will reallocate new Uint8Arrays every time\n get nameAsBuffer () {\n if (this._nameBuf != null) {\n return this._nameBuf\n }\n\n this._nameBuf = uint8ArrayFromString(this.Name)\n return this._nameBuf\n }\n}\n\nmodule.exports = DAGLink\n", "//! stable.js 0.1.8, https://github.com/Two-Screen/stable\n//! \u00A9 2018 Angry Bytes and contributors. MIT licensed.\n\n(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global.stable = factory());\n}(this, (function () { 'use strict';\n\n // A stable array sort, because `Array#sort()` is not guaranteed stable.\n // This is an implementation of merge sort, without recursion.\n\n var stable = function (arr, comp) {\n return exec(arr.slice(), comp)\n };\n\n stable.inplace = function (arr, comp) {\n var result = exec(arr, comp);\n\n // This simply copies back if the result isn't in the original array,\n // which happens on an odd number of passes.\n if (result !== arr) {\n pass(result, null, arr.length, arr);\n }\n\n return arr\n };\n\n // Execute the sort using the input array and a second buffer as work space.\n // Returns one of those two, containing the final result.\n function exec(arr, comp) {\n if (typeof(comp) !== 'function') {\n comp = function (a, b) {\n return String(a).localeCompare(b)\n };\n }\n\n // Short-circuit when there's nothing to sort.\n var len = arr.length;\n if (len <= 1) {\n return arr\n }\n\n // Rather than dividing input, simply iterate chunks of 1, 2, 4, 8, etc.\n // Chunks are the size of the left or right hand in merge sort.\n // Stop when the left-hand covers all of the array.\n var buffer = new Array(len);\n for (var chk = 1; chk < len; chk *= 2) {\n pass(arr, comp, chk, buffer);\n\n var tmp = arr;\n arr = buffer;\n buffer = tmp;\n }\n\n return arr\n }\n\n // Run a single pass with the given chunk size.\n var pass = function (arr, comp, chk, result) {\n var len = arr.length;\n var i = 0;\n // Step size / double chunk size.\n var dbl = chk * 2;\n // Bounds of the left and right chunks.\n var l, r, e;\n // Iterators over the left and right chunk.\n var li, ri;\n\n // Iterate over pairs of chunks.\n for (l = 0; l < len; l += dbl) {\n r = l + chk;\n e = r + chk;\n if (r > len) r = len;\n if (e > len) e = len;\n\n // Iterate both chunks in parallel.\n li = l;\n ri = r;\n while (true) {\n // Compare the chunks.\n if (li < r && ri < e) {\n // This works for a regular `sort()` compatible comparator,\n // but also for a simple comparator like: `a > b`\n if (comp(arr[li], arr[ri]) <= 0) {\n result[i++] = arr[li++];\n }\n else {\n result[i++] = arr[ri++];\n }\n }\n // Nothing to compare, just flush what's left.\n else if (li < r) {\n result[i++] = arr[li++];\n }\n else if (ri < e) {\n result[i++] = arr[ri++];\n }\n // Both iterators are at the chunk ends.\n else {\n break\n }\n }\n }\n };\n\n return stable;\n\n})));\n", "'use strict'\n\n/**\n * Can be used with Array.sort to sort and array with Uint8Array entries\n *\n * @param {Uint8Array} a\n * @param {Uint8Array} b\n */\nfunction compare (a, b) {\n for (let i = 0; i < a.byteLength; i++) {\n if (a[i] < b[i]) {\n return -1\n }\n\n if (a[i] > b[i]) {\n return 1\n }\n }\n\n if (a.byteLength > b.byteLength) {\n return 1\n }\n\n if (a.byteLength < b.byteLength) {\n return -1\n }\n\n return 0\n}\n\nmodule.exports = compare\n", "'use strict'\n\nconst sort = require('stable')\nconst uint8ArrayCompare = require('uint8arrays/compare')\n\n/**\n * @typedef {import('../dag-link/dagLink')} DAGLink\n */\n\n/**\n *\n * @param {DAGLink} a\n * @param {DAGLink} b\n */\nconst linkSort = (a, b) => {\n const buf1 = a.nameAsBuffer\n const buf2 = b.nameAsBuffer\n\n return uint8ArrayCompare(buf1, buf2)\n}\n\n/**\n * Sorts links in place (mutating given array)\n *\n * @param {DAGLink[]} links\n * @returns {void}\n */\nconst sortLinks = (links) => {\n sort.inplace(links, linkSort)\n}\n\nmodule.exports = sortLinks\n", "'use strict'\n\nconst DAGLink = require('./dagLink')\n\n/**\n * @param {*} link\n */\nfunction createDagLinkFromB58EncodedHash (link) {\n return new DAGLink(\n link.Name || link.name || '',\n link.Tsize || link.Size || link.size || 0,\n link.Hash || link.hash || link.multihash || link.cid\n )\n}\n\nmodule.exports = {\n createDagLinkFromB58EncodedHash\n}\n", "'use strict'\n\nconst protobuf = require('protobufjs/minimal')\nconst {\n PBLink\n} = require('./dag')\n\nconst {\n createDagLinkFromB58EncodedHash\n} = require('./dag-link/util')\n\n/**\n * @typedef {import('./dag-link/dagLink')} DAGLink\n * @typedef {import('./types').DAGLinkLike} DAGLinkLike\n * @typedef {import('./types').SerializableDAGNode} SerializableDAGNode\n * @typedef {import('cids')} CID\n */\n\n/**\n * @param { { Data?: Uint8Array, Links: (DAGLink | DAGLinkLike)[] }} node\n * @returns {SerializableDAGNode}\n */\nconst toProtoBuf = (node) => {\n const pbn = {}\n\n if (node.Data && node.Data.byteLength > 0) {\n pbn.Data = node.Data\n } else {\n // NOTE: this has to be null in order to match go-ipfs serialization\n // `null !== new Uint8Array(0)`\n pbn.Data = null\n }\n\n if (node.Links && node.Links.length > 0) {\n pbn.Links = node.Links\n .map((link) => ({\n Hash: link.Hash.bytes,\n Name: link.Name,\n Tsize: link.Tsize\n }))\n } else {\n pbn.Links = null\n }\n\n return pbn\n}\n\n/**\n * Serialize internal representation into a binary PB block.\n *\n * @param {import('./dag-node/dagNode')} node - Internal representation of a PB block\n */\nconst serializeDAGNode = (node) => {\n return encode(toProtoBuf(node))\n}\n\n/**\n * Serialize an object where the `Links` might not be a `DAGLink` instance yet\n *\n * @param {Uint8Array} [data]\n * @param {(DAGLink | string | DAGLinkLike)[]} [links]\n */\nconst serializeDAGNodeLike = (data, links = []) => {\n const node = {\n Data: data,\n Links: links.map((link) => {\n return createDagLinkFromB58EncodedHash(link)\n })\n }\n\n return encode(toProtoBuf(node))\n}\n\nmodule.exports = {\n serializeDAGNode,\n serializeDAGNodeLike\n}\n\n/**\n * The fields in PBNode are the wrong way round - `id: 2` comes before\n * `id: 1`. protobufjs writes them out in id order but go-IPFS does not so\n * we have to use the protobuf.Writer interface directly to get the same\n * serialized form as go-IPFS\n *\n * @param {SerializableDAGNode} pbf\n */\nfunction encode (pbf) {\n const writer = protobuf.Writer.create()\n\n if (pbf.Links != null) {\n for (let i = 0; i < pbf.Links.length; i++) {\n PBLink.encode(pbf.Links[i], writer.uint32(18).fork()).ldelim()\n }\n }\n\n if (pbf.Data != null) {\n writer.uint32(10).bytes(pbf.Data)\n }\n\n return writer.finish()\n}\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 * [js-sha3]{@link https://github.com/emn178/js-sha3}\n *\n * @version 0.8.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2018\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n 'use strict';\n\n var INPUT_ERROR = 'input is invalid type';\n var FINALIZE_ERROR = 'finalize already called';\n var WINDOW = typeof window === 'object';\n var root = WINDOW ? window : {};\n if (root.JS_SHA3_NO_WINDOW) {\n WINDOW = false;\n }\n var WEB_WORKER = !WINDOW && typeof self === 'object';\n var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n if (NODE_JS) {\n root = global;\n } else if (WEB_WORKER) {\n root = self;\n }\n var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;\n var AMD = typeof define === 'function' && define.amd;\n var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n var HEX_CHARS = '0123456789abcdef'.split('');\n var SHAKE_PADDING = [31, 7936, 2031616, 520093696];\n var CSHAKE_PADDING = [4, 1024, 262144, 67108864];\n var KECCAK_PADDING = [1, 256, 65536, 16777216];\n var PADDING = [6, 1536, 393216, 100663296];\n var SHIFT = [0, 8, 16, 24];\n var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,\n 0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,\n 2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,\n 2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,\n 2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];\n var BITS = [224, 256, 384, 512];\n var SHAKE_BITS = [128, 256];\n var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];\n var CSHAKE_BYTEPAD = {\n '128': 168,\n '256': 136\n };\n\n if (root.JS_SHA3_NO_NODE_JS || !Array.isArray) {\n Array.isArray = function (obj) {\n return Object.prototype.toString.call(obj) === '[object Array]';\n };\n }\n\n if (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {\n ArrayBuffer.isView = function (obj) {\n return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n };\n }\n\n var createOutputMethod = function (bits, padding, outputType) {\n return function (message) {\n return new Keccak(bits, padding, bits).update(message)[outputType]();\n };\n };\n\n var createShakeOutputMethod = function (bits, padding, outputType) {\n return function (message, outputBits) {\n return new Keccak(bits, padding, outputBits).update(message)[outputType]();\n };\n };\n\n var createCshakeOutputMethod = function (bits, padding, outputType) {\n return function (message, outputBits, n, s) {\n return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();\n };\n };\n\n var createKmacOutputMethod = function (bits, padding, outputType) {\n return function (key, message, outputBits, s) {\n return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();\n };\n };\n\n var createOutputMethods = function (method, createMethod, bits, padding) {\n for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n var type = OUTPUT_TYPES[i];\n method[type] = createMethod(bits, padding, type);\n }\n return method;\n };\n\n var createMethod = function (bits, padding) {\n var method = createOutputMethod(bits, padding, 'hex');\n method.create = function () {\n return new Keccak(bits, padding, bits);\n };\n method.update = function (message) {\n return method.create().update(message);\n };\n return createOutputMethods(method, createOutputMethod, bits, padding);\n };\n\n var createShakeMethod = function (bits, padding) {\n var method = createShakeOutputMethod(bits, padding, 'hex');\n method.create = function (outputBits) {\n return new Keccak(bits, padding, outputBits);\n };\n method.update = function (message, outputBits) {\n return method.create(outputBits).update(message);\n };\n return createOutputMethods(method, createShakeOutputMethod, bits, padding);\n };\n\n var createCshakeMethod = function (bits, padding) {\n var w = CSHAKE_BYTEPAD[bits];\n var method = createCshakeOutputMethod(bits, padding, 'hex');\n method.create = function (outputBits, n, s) {\n if (!n && !s) {\n return methods['shake' + bits].create(outputBits);\n } else {\n return new Keccak(bits, padding, outputBits).bytepad([n, s], w);\n }\n };\n method.update = function (message, outputBits, n, s) {\n return method.create(outputBits, n, s).update(message);\n };\n return createOutputMethods(method, createCshakeOutputMethod, bits, padding);\n };\n\n var createKmacMethod = function (bits, padding) {\n var w = CSHAKE_BYTEPAD[bits];\n var method = createKmacOutputMethod(bits, padding, 'hex');\n method.create = function (key, outputBits, s) {\n return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);\n };\n method.update = function (key, message, outputBits, s) {\n return method.create(key, outputBits, s).update(message);\n };\n return createOutputMethods(method, createKmacOutputMethod, bits, padding);\n };\n\n var algorithms = [\n { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },\n { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },\n { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },\n { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },\n { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }\n ];\n\n var methods = {}, methodNames = [];\n\n for (var i = 0; i < algorithms.length; ++i) {\n var algorithm = algorithms[i];\n var bits = algorithm.bits;\n for (var j = 0; j < bits.length; ++j) {\n var methodName = algorithm.name + '_' + bits[j];\n methodNames.push(methodName);\n methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);\n if (algorithm.name !== 'sha3') {\n var newMethodName = algorithm.name + bits[j];\n methodNames.push(newMethodName);\n methods[newMethodName] = methods[methodName];\n }\n }\n }\n\n function Keccak(bits, padding, outputBits) {\n this.blocks = [];\n this.s = [];\n this.padding = padding;\n this.outputBits = outputBits;\n this.reset = true;\n this.finalized = false;\n this.block = 0;\n this.start = 0;\n this.blockCount = (1600 - (bits << 1)) >> 5;\n this.byteCount = this.blockCount << 2;\n this.outputBlocks = outputBits >> 5;\n this.extraBytes = (outputBits & 31) >> 3;\n\n for (var i = 0; i < 50; ++i) {\n this.s[i] = 0;\n }\n }\n\n Keccak.prototype.update = function (message) {\n if (this.finalized) {\n throw new Error(FINALIZE_ERROR);\n }\n var notString, type = typeof message;\n if (type !== 'string') {\n if (type === 'object') {\n if (message === null) {\n throw new Error(INPUT_ERROR);\n } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n message = new Uint8Array(message);\n } else if (!Array.isArray(message)) {\n if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {\n throw new Error(INPUT_ERROR);\n }\n }\n } else {\n throw new Error(INPUT_ERROR);\n }\n notString = true;\n }\n var blocks = this.blocks, byteCount = this.byteCount, length = message.length,\n blockCount = this.blockCount, index = 0, s = this.s, i, code;\n\n while (index < length) {\n if (this.reset) {\n this.reset = false;\n blocks[0] = this.block;\n for (i = 1; i < blockCount + 1; ++i) {\n blocks[i] = 0;\n }\n }\n if (notString) {\n for (i = this.start; index < length && i < byteCount; ++index) {\n blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n }\n } else {\n for (i = this.start; index < length && i < byteCount; ++index) {\n code = message.charCodeAt(index);\n if (code < 0x80) {\n blocks[i >> 2] |= code << SHIFT[i++ & 3];\n } else if (code < 0x800) {\n blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n } else if (code < 0xd800 || code >= 0xe000) {\n blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n }\n }\n }\n this.lastByteIndex = i;\n if (i >= byteCount) {\n this.start = i - byteCount;\n this.block = blocks[blockCount];\n for (i = 0; i < blockCount; ++i) {\n s[i] ^= blocks[i];\n }\n f(s);\n this.reset = true;\n } else {\n this.start = i;\n }\n }\n return this;\n };\n\n Keccak.prototype.encode = function (x, right) {\n var o = x & 255, n = 1;\n var bytes = [o];\n x = x >> 8;\n o = x & 255;\n while (o > 0) {\n bytes.unshift(o);\n x = x >> 8;\n o = x & 255;\n ++n;\n }\n if (right) {\n bytes.push(n);\n } else {\n bytes.unshift(n);\n }\n this.update(bytes);\n return bytes.length;\n };\n\n Keccak.prototype.encodeString = function (str) {\n var notString, type = typeof str;\n if (type !== 'string') {\n if (type === 'object') {\n if (str === null) {\n throw new Error(INPUT_ERROR);\n } else if (ARRAY_BUFFER && str.constructor === ArrayBuffer) {\n str = new Uint8Array(str);\n } else if (!Array.isArray(str)) {\n if (!ARRAY_BUFFER || !ArrayBuffer.isView(str)) {\n throw new Error(INPUT_ERROR);\n }\n }\n } else {\n throw new Error(INPUT_ERROR);\n }\n notString = true;\n }\n var bytes = 0, length = str.length;\n if (notString) {\n bytes = length;\n } else {\n for (var i = 0; i < str.length; ++i) {\n var code = str.charCodeAt(i);\n if (code < 0x80) {\n bytes += 1;\n } else if (code < 0x800) {\n bytes += 2;\n } else if (code < 0xd800 || code >= 0xe000) {\n bytes += 3;\n } else {\n code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));\n bytes += 4;\n }\n }\n }\n bytes += this.encode(bytes * 8);\n this.update(str);\n return bytes;\n };\n\n Keccak.prototype.bytepad = function (strs, w) {\n var bytes = this.encode(w);\n for (var i = 0; i < strs.length; ++i) {\n bytes += this.encodeString(strs[i]);\n }\n var paddingBytes = w - bytes % w;\n var zeros = [];\n zeros.length = paddingBytes;\n this.update(zeros);\n return this;\n };\n\n Keccak.prototype.finalize = function () {\n if (this.finalized) {\n return;\n }\n this.finalized = true;\n var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;\n blocks[i >> 2] |= this.padding[i & 3];\n if (this.lastByteIndex === this.byteCount) {\n blocks[0] = blocks[blockCount];\n for (i = 1; i < blockCount + 1; ++i) {\n blocks[i] = 0;\n }\n }\n blocks[blockCount - 1] |= 0x80000000;\n for (i = 0; i < blockCount; ++i) {\n s[i] ^= blocks[i];\n }\n f(s);\n };\n\n Keccak.prototype.toString = Keccak.prototype.hex = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var hex = '', block;\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n block = s[i];\n hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +\n HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +\n HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +\n HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];\n }\n if (j % blockCount === 0) {\n f(s);\n i = 0;\n }\n }\n if (extraBytes) {\n block = s[i];\n hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];\n if (extraBytes > 1) {\n hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];\n }\n if (extraBytes > 2) {\n hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];\n }\n }\n return hex;\n };\n\n Keccak.prototype.arrayBuffer = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var bytes = this.outputBits >> 3;\n var buffer;\n if (extraBytes) {\n buffer = new ArrayBuffer((outputBlocks + 1) << 2);\n } else {\n buffer = new ArrayBuffer(bytes);\n }\n var array = new Uint32Array(buffer);\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n array[j] = s[i];\n }\n if (j % blockCount === 0) {\n f(s);\n }\n }\n if (extraBytes) {\n array[i] = s[i];\n buffer = buffer.slice(0, bytes);\n }\n return buffer;\n };\n\n Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;\n\n Keccak.prototype.digest = Keccak.prototype.array = function () {\n this.finalize();\n\n var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n extraBytes = this.extraBytes, i = 0, j = 0;\n var array = [], offset, block;\n while (j < outputBlocks) {\n for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n offset = j << 2;\n block = s[i];\n array[offset] = block & 0xFF;\n array[offset + 1] = (block >> 8) & 0xFF;\n array[offset + 2] = (block >> 16) & 0xFF;\n array[offset + 3] = (block >> 24) & 0xFF;\n }\n if (j % blockCount === 0) {\n f(s);\n }\n }\n if (extraBytes) {\n offset = j << 2;\n block = s[i];\n array[offset] = block & 0xFF;\n if (extraBytes > 1) {\n array[offset + 1] = (block >> 8) & 0xFF;\n }\n if (extraBytes > 2) {\n array[offset + 2] = (block >> 16) & 0xFF;\n }\n }\n return array;\n };\n\n function Kmac(bits, padding, outputBits) {\n Keccak.call(this, bits, padding, outputBits);\n }\n\n Kmac.prototype = new Keccak();\n\n Kmac.prototype.finalize = function () {\n this.encode(this.outputBits, true);\n return Keccak.prototype.finalize.call(this);\n };\n\n var f = function (s) {\n var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,\n b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,\n b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,\n b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;\n for (n = 0; n < 48; n += 2) {\n c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];\n c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];\n c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];\n c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];\n c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];\n c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];\n c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];\n c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];\n c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];\n c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];\n\n h = c8 ^ ((c2 << 1) | (c3 >>> 31));\n l = c9 ^ ((c3 << 1) | (c2 >>> 31));\n s[0] ^= h;\n s[1] ^= l;\n s[10] ^= h;\n s[11] ^= l;\n s[20] ^= h;\n s[21] ^= l;\n s[30] ^= h;\n s[31] ^= l;\n s[40] ^= h;\n s[41] ^= l;\n h = c0 ^ ((c4 << 1) | (c5 >>> 31));\n l = c1 ^ ((c5 << 1) | (c4 >>> 31));\n s[2] ^= h;\n s[3] ^= l;\n s[12] ^= h;\n s[13] ^= l;\n s[22] ^= h;\n s[23] ^= l;\n s[32] ^= h;\n s[33] ^= l;\n s[42] ^= h;\n s[43] ^= l;\n h = c2 ^ ((c6 << 1) | (c7 >>> 31));\n l = c3 ^ ((c7 << 1) | (c6 >>> 31));\n s[4] ^= h;\n s[5] ^= l;\n s[14] ^= h;\n s[15] ^= l;\n s[24] ^= h;\n s[25] ^= l;\n s[34] ^= h;\n s[35] ^= l;\n s[44] ^= h;\n s[45] ^= l;\n h = c4 ^ ((c8 << 1) | (c9 >>> 31));\n l = c5 ^ ((c9 << 1) | (c8 >>> 31));\n s[6] ^= h;\n s[7] ^= l;\n s[16] ^= h;\n s[17] ^= l;\n s[26] ^= h;\n s[27] ^= l;\n s[36] ^= h;\n s[37] ^= l;\n s[46] ^= h;\n s[47] ^= l;\n h = c6 ^ ((c0 << 1) | (c1 >>> 31));\n l = c7 ^ ((c1 << 1) | (c0 >>> 31));\n s[8] ^= h;\n s[9] ^= l;\n s[18] ^= h;\n s[19] ^= l;\n s[28] ^= h;\n s[29] ^= l;\n s[38] ^= h;\n s[39] ^= l;\n s[48] ^= h;\n s[49] ^= l;\n\n b0 = s[0];\n b1 = s[1];\n b32 = (s[11] << 4) | (s[10] >>> 28);\n b33 = (s[10] << 4) | (s[11] >>> 28);\n b14 = (s[20] << 3) | (s[21] >>> 29);\n b15 = (s[21] << 3) | (s[20] >>> 29);\n b46 = (s[31] << 9) | (s[30] >>> 23);\n b47 = (s[30] << 9) | (s[31] >>> 23);\n b28 = (s[40] << 18) | (s[41] >>> 14);\n b29 = (s[41] << 18) | (s[40] >>> 14);\n b20 = (s[2] << 1) | (s[3] >>> 31);\n b21 = (s[3] << 1) | (s[2] >>> 31);\n b2 = (s[13] << 12) | (s[12] >>> 20);\n b3 = (s[12] << 12) | (s[13] >>> 20);\n b34 = (s[22] << 10) | (s[23] >>> 22);\n b35 = (s[23] << 10) | (s[22] >>> 22);\n b16 = (s[33] << 13) | (s[32] >>> 19);\n b17 = (s[32] << 13) | (s[33] >>> 19);\n b48 = (s[42] << 2) | (s[43] >>> 30);\n b49 = (s[43] << 2) | (s[42] >>> 30);\n b40 = (s[5] << 30) | (s[4] >>> 2);\n b41 = (s[4] << 30) | (s[5] >>> 2);\n b22 = (s[14] << 6) | (s[15] >>> 26);\n b23 = (s[15] << 6) | (s[14] >>> 26);\n b4 = (s[25] << 11) | (s[24] >>> 21);\n b5 = (s[24] << 11) | (s[25] >>> 21);\n b36 = (s[34] << 15) | (s[35] >>> 17);\n b37 = (s[35] << 15) | (s[34] >>> 17);\n b18 = (s[45] << 29) | (s[44] >>> 3);\n b19 = (s[44] << 29) | (s[45] >>> 3);\n b10 = (s[6] << 28) | (s[7] >>> 4);\n b11 = (s[7] << 28) | (s[6] >>> 4);\n b42 = (s[17] << 23) | (s[16] >>> 9);\n b43 = (s[16] << 23) | (s[17] >>> 9);\n b24 = (s[26] << 25) | (s[27] >>> 7);\n b25 = (s[27] << 25) | (s[26] >>> 7);\n b6 = (s[36] << 21) | (s[37] >>> 11);\n b7 = (s[37] << 21) | (s[36] >>> 11);\n b38 = (s[47] << 24) | (s[46] >>> 8);\n b39 = (s[46] << 24) | (s[47] >>> 8);\n b30 = (s[8] << 27) | (s[9] >>> 5);\n b31 = (s[9] << 27) | (s[8] >>> 5);\n b12 = (s[18] << 20) | (s[19] >>> 12);\n b13 = (s[19] << 20) | (s[18] >>> 12);\n b44 = (s[29] << 7) | (s[28] >>> 25);\n b45 = (s[28] << 7) | (s[29] >>> 25);\n b26 = (s[38] << 8) | (s[39] >>> 24);\n b27 = (s[39] << 8) | (s[38] >>> 24);\n b8 = (s[48] << 14) | (s[49] >>> 18);\n b9 = (s[49] << 14) | (s[48] >>> 18);\n\n s[0] = b0 ^ (~b2 & b4);\n s[1] = b1 ^ (~b3 & b5);\n s[10] = b10 ^ (~b12 & b14);\n s[11] = b11 ^ (~b13 & b15);\n s[20] = b20 ^ (~b22 & b24);\n s[21] = b21 ^ (~b23 & b25);\n s[30] = b30 ^ (~b32 & b34);\n s[31] = b31 ^ (~b33 & b35);\n s[40] = b40 ^ (~b42 & b44);\n s[41] = b41 ^ (~b43 & b45);\n s[2] = b2 ^ (~b4 & b6);\n s[3] = b3 ^ (~b5 & b7);\n s[12] = b12 ^ (~b14 & b16);\n s[13] = b13 ^ (~b15 & b17);\n s[22] = b22 ^ (~b24 & b26);\n s[23] = b23 ^ (~b25 & b27);\n s[32] = b32 ^ (~b34 & b36);\n s[33] = b33 ^ (~b35 & b37);\n s[42] = b42 ^ (~b44 & b46);\n s[43] = b43 ^ (~b45 & b47);\n s[4] = b4 ^ (~b6 & b8);\n s[5] = b5 ^ (~b7 & b9);\n s[14] = b14 ^ (~b16 & b18);\n s[15] = b15 ^ (~b17 & b19);\n s[24] = b24 ^ (~b26 & b28);\n s[25] = b25 ^ (~b27 & b29);\n s[34] = b34 ^ (~b36 & b38);\n s[35] = b35 ^ (~b37 & b39);\n s[44] = b44 ^ (~b46 & b48);\n s[45] = b45 ^ (~b47 & b49);\n s[6] = b6 ^ (~b8 & b0);\n s[7] = b7 ^ (~b9 & b1);\n s[16] = b16 ^ (~b18 & b10);\n s[17] = b17 ^ (~b19 & b11);\n s[26] = b26 ^ (~b28 & b20);\n s[27] = b27 ^ (~b29 & b21);\n s[36] = b36 ^ (~b38 & b30);\n s[37] = b37 ^ (~b39 & b31);\n s[46] = b46 ^ (~b48 & b40);\n s[47] = b47 ^ (~b49 & b41);\n s[8] = b8 ^ (~b0 & b2);\n s[9] = b9 ^ (~b1 & b3);\n s[18] = b18 ^ (~b10 & b12);\n s[19] = b19 ^ (~b11 & b13);\n s[28] = b28 ^ (~b20 & b22);\n s[29] = b29 ^ (~b21 & b23);\n s[38] = b38 ^ (~b30 & b32);\n s[39] = b39 ^ (~b31 & b33);\n s[48] = b48 ^ (~b40 & b42);\n s[49] = b49 ^ (~b41 & b43);\n\n s[0] ^= RC[n];\n s[1] ^= RC[n + 1];\n }\n };\n\n if (COMMON_JS) {\n module.exports = methods;\n } else {\n for (i = 0; i < methodNames.length; ++i) {\n root[methodNames[i]] = methods[methodNames[i]];\n }\n if (AMD) {\n define(function () {\n return methods;\n });\n }\n }\n})();\n", "/* jshint -W086: true */\n// +----------------------------------------------------------------------+\n// | murmurHash3js.js v3.0.1 // https://github.com/pid/murmurHash3js\n// | A javascript implementation of MurmurHash3's x86 hashing algorithms. |\n// |----------------------------------------------------------------------|\n// | Copyright (c) 2012-2015 Karan Lyons |\n// | https://github.com/karanlyons/murmurHash3.js/blob/c1778f75792abef7bdd74bc85d2d4e1a3d25cfe9/murmurHash3.js |\n// | Freely distributable under the MIT license. |\n// +----------------------------------------------------------------------+\n\n;(function (root, undefined) {\n 'use strict';\n\n // Create a local object that'll be exported or referenced globally.\n var library = {\n 'version': '3.0.0',\n 'x86': {},\n 'x64': {},\n 'inputValidation': true\n };\n\n // PRIVATE FUNCTIONS\n // -----------------\n\n function _validBytes(bytes) {\n // check the input is an array or a typed array\n if (!Array.isArray(bytes) && !ArrayBuffer.isView(bytes)) {\n return false;\n }\n\n // check all bytes are actually bytes\n for (var i = 0; i < bytes.length; i++) {\n if (!Number.isInteger(bytes[i]) || bytes[i] < 0 || bytes[i] > 255) {\n return false;\n }\n }\n return true;\n }\n\n function _x86Multiply(m, n) {\n //\n // Given two 32bit ints, returns the two multiplied together as a\n // 32bit int.\n //\n\n return ((m & 0xffff) * n) + ((((m >>> 16) * n) & 0xffff) << 16);\n }\n\n function _x86Rotl(m, n) {\n //\n // Given a 32bit int and an int representing a number of bit positions,\n // returns the 32bit int rotated left by that number of positions.\n //\n\n return (m << n) | (m >>> (32 - n));\n }\n\n function _x86Fmix(h) {\n //\n // Given a block, returns murmurHash3's final x86 mix of that block.\n //\n\n h ^= h >>> 16;\n h = _x86Multiply(h, 0x85ebca6b);\n h ^= h >>> 13;\n h = _x86Multiply(h, 0xc2b2ae35);\n h ^= h >>> 16;\n\n return h;\n }\n\n function _x64Add(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // added together as a 64bit int (as an array of two 32bit ints).\n //\n\n m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n var o = [0, 0, 0, 0];\n\n o[3] += m[3] + n[3];\n o[2] += o[3] >>> 16;\n o[3] &= 0xffff;\n\n o[2] += m[2] + n[2];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[1] += m[1] + n[1];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[0] += m[0] + n[0];\n o[0] &= 0xffff;\n\n return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n }\n\n function _x64Multiply(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // multiplied together as a 64bit int (as an array of two 32bit ints).\n //\n\n m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n var o = [0, 0, 0, 0];\n\n o[3] += m[3] * n[3];\n o[2] += o[3] >>> 16;\n o[3] &= 0xffff;\n\n o[2] += m[2] * n[3];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[2] += m[3] * n[2];\n o[1] += o[2] >>> 16;\n o[2] &= 0xffff;\n\n o[1] += m[1] * n[3];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[1] += m[2] * n[2];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[1] += m[3] * n[1];\n o[0] += o[1] >>> 16;\n o[1] &= 0xffff;\n\n o[0] += (m[0] * n[3]) + (m[1] * n[2]) + (m[2] * n[1]) + (m[3] * n[0]);\n o[0] &= 0xffff;\n\n return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n }\n\n function _x64Rotl(m, n) {\n //\n // Given a 64bit int (as an array of two 32bit ints) and an int\n // representing a number of bit positions, returns the 64bit int (as an\n // array of two 32bit ints) rotated left by that number of positions.\n //\n\n n %= 64;\n\n if (n === 32) {\n return [m[1], m[0]];\n } else if (n < 32) {\n return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))];\n } else {\n n -= 32;\n return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))];\n }\n }\n\n function _x64LeftShift(m, n) {\n //\n // Given a 64bit int (as an array of two 32bit ints) and an int\n // representing a number of bit positions, returns the 64bit int (as an\n // array of two 32bit ints) shifted left by that number of positions.\n //\n\n n %= 64;\n\n if (n === 0) {\n return m;\n } else if (n < 32) {\n return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];\n } else {\n return [m[1] << (n - 32), 0];\n }\n }\n\n function _x64Xor(m, n) {\n //\n // Given two 64bit ints (as an array of two 32bit ints) returns the two\n // xored together as a 64bit int (as an array of two 32bit ints).\n //\n\n return [m[0] ^ n[0], m[1] ^ n[1]];\n }\n\n function _x64Fmix(h) {\n //\n // Given a block, returns murmurHash3's final x64 mix of that block.\n // (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the\n // only place where we need to right shift 64bit ints.)\n //\n\n h = _x64Xor(h, [0, h[0] >>> 1]);\n h = _x64Multiply(h, [0xff51afd7, 0xed558ccd]);\n h = _x64Xor(h, [0, h[0] >>> 1]);\n h = _x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);\n h = _x64Xor(h, [0, h[0] >>> 1]);\n\n return h;\n }\n\n // PUBLIC FUNCTIONS\n // ----------------\n\n library.x86.hash32 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 32 bit hash\n // using the x86 flavor of MurmurHash3, as an unsigned int.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n seed = seed || 0;\n\n var remainder = bytes.length % 4;\n var blocks = bytes.length - remainder;\n\n var h1 = seed;\n\n var k1 = 0;\n\n var c1 = 0xcc9e2d51;\n var c2 = 0x1b873593;\n\n for (var i = 0; i < blocks; i = i + 4) {\n k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n\n h1 ^= k1;\n h1 = _x86Rotl(h1, 13);\n h1 = _x86Multiply(h1, 5) + 0xe6546b64;\n }\n\n k1 = 0;\n\n switch (remainder) {\n case 3:\n k1 ^= bytes[i + 2] << 16;\n\n case 2:\n k1 ^= bytes[i + 1] << 8;\n\n case 1:\n k1 ^= bytes[i];\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n }\n\n h1 ^= bytes.length;\n h1 = _x86Fmix(h1);\n\n return h1 >>> 0;\n };\n\n library.x86.hash128 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 128 bit\n // hash using the x86 flavor of MurmurHash3, as an unsigned hex.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n\n seed = seed || 0;\n var remainder = bytes.length % 16;\n var blocks = bytes.length - remainder;\n\n var h1 = seed;\n var h2 = seed;\n var h3 = seed;\n var h4 = seed;\n\n var k1 = 0;\n var k2 = 0;\n var k3 = 0;\n var k4 = 0;\n\n var c1 = 0x239b961b;\n var c2 = 0xab0e9789;\n var c3 = 0x38b34ae5;\n var c4 = 0xa1e38b93;\n\n for (var i = 0; i < blocks; i = i + 16) {\n k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n k2 = (bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24);\n k3 = (bytes[i + 8]) | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24);\n k4 = (bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24);\n\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n\n h1 = _x86Rotl(h1, 19);\n h1 += h2;\n h1 = _x86Multiply(h1, 5) + 0x561ccd1b;\n\n k2 = _x86Multiply(k2, c2);\n k2 = _x86Rotl(k2, 16);\n k2 = _x86Multiply(k2, c3);\n h2 ^= k2;\n\n h2 = _x86Rotl(h2, 17);\n h2 += h3;\n h2 = _x86Multiply(h2, 5) + 0x0bcaa747;\n\n k3 = _x86Multiply(k3, c3);\n k3 = _x86Rotl(k3, 17);\n k3 = _x86Multiply(k3, c4);\n h3 ^= k3;\n\n h3 = _x86Rotl(h3, 15);\n h3 += h4;\n h3 = _x86Multiply(h3, 5) + 0x96cd1c35;\n\n k4 = _x86Multiply(k4, c4);\n k4 = _x86Rotl(k4, 18);\n k4 = _x86Multiply(k4, c1);\n h4 ^= k4;\n\n h4 = _x86Rotl(h4, 13);\n h4 += h1;\n h4 = _x86Multiply(h4, 5) + 0x32ac3b17;\n }\n\n k1 = 0;\n k2 = 0;\n k3 = 0;\n k4 = 0;\n\n switch (remainder) {\n case 15:\n k4 ^= bytes[i + 14] << 16;\n\n case 14:\n k4 ^= bytes[i + 13] << 8;\n\n case 13:\n k4 ^= bytes[i + 12];\n k4 = _x86Multiply(k4, c4);\n k4 = _x86Rotl(k4, 18);\n k4 = _x86Multiply(k4, c1);\n h4 ^= k4;\n\n case 12:\n k3 ^= bytes[i + 11] << 24;\n\n case 11:\n k3 ^= bytes[i + 10] << 16;\n\n case 10:\n k3 ^= bytes[i + 9] << 8;\n\n case 9:\n k3 ^= bytes[i + 8];\n k3 = _x86Multiply(k3, c3);\n k3 = _x86Rotl(k3, 17);\n k3 = _x86Multiply(k3, c4);\n h3 ^= k3;\n\n case 8:\n k2 ^= bytes[i + 7] << 24;\n\n case 7:\n k2 ^= bytes[i + 6] << 16;\n\n case 6:\n k2 ^= bytes[i + 5] << 8;\n\n case 5:\n k2 ^= bytes[i + 4];\n k2 = _x86Multiply(k2, c2);\n k2 = _x86Rotl(k2, 16);\n k2 = _x86Multiply(k2, c3);\n h2 ^= k2;\n\n case 4:\n k1 ^= bytes[i + 3] << 24;\n\n case 3:\n k1 ^= bytes[i + 2] << 16;\n\n case 2:\n k1 ^= bytes[i + 1] << 8;\n\n case 1:\n k1 ^= bytes[i];\n k1 = _x86Multiply(k1, c1);\n k1 = _x86Rotl(k1, 15);\n k1 = _x86Multiply(k1, c2);\n h1 ^= k1;\n }\n\n h1 ^= bytes.length;\n h2 ^= bytes.length;\n h3 ^= bytes.length;\n h4 ^= bytes.length;\n\n h1 += h2;\n h1 += h3;\n h1 += h4;\n h2 += h1;\n h3 += h1;\n h4 += h1;\n\n h1 = _x86Fmix(h1);\n h2 = _x86Fmix(h2);\n h3 = _x86Fmix(h3);\n h4 = _x86Fmix(h4);\n\n h1 += h2;\n h1 += h3;\n h1 += h4;\n h2 += h1;\n h3 += h1;\n h4 += h1;\n\n return (\"00000000\" + (h1 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h3 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h4 >>> 0).toString(16)).slice(-8);\n };\n\n library.x64.hash128 = function (bytes, seed) {\n //\n // Given a string and an optional seed as an int, returns a 128 bit\n // hash using the x64 flavor of MurmurHash3, as an unsigned hex.\n //\n if (library.inputValidation && !_validBytes(bytes)) {\n return undefined;\n }\n seed = seed || 0;\n\n var remainder = bytes.length % 16;\n var blocks = bytes.length - remainder;\n\n var h1 = [0, seed];\n var h2 = [0, seed];\n\n var k1 = [0, 0];\n var k2 = [0, 0];\n\n var c1 = [0x87c37b91, 0x114253d5];\n var c2 = [0x4cf5ad43, 0x2745937f];\n\n for (var i = 0; i < blocks; i = i + 16) {\n k1 = [(bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24), (bytes[i]) |\n (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24)];\n k2 = [(bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24), (bytes[i + 8]) |\n (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24)];\n\n k1 = _x64Multiply(k1, c1);\n k1 = _x64Rotl(k1, 31);\n k1 = _x64Multiply(k1, c2);\n h1 = _x64Xor(h1, k1);\n\n h1 = _x64Rotl(h1, 27);\n h1 = _x64Add(h1, h2);\n h1 = _x64Add(_x64Multiply(h1, [0, 5]), [0, 0x52dce729]);\n\n k2 = _x64Multiply(k2, c2);\n k2 = _x64Rotl(k2, 33);\n k2 = _x64Multiply(k2, c1);\n h2 = _x64Xor(h2, k2);\n\n h2 = _x64Rotl(h2, 31);\n h2 = _x64Add(h2, h1);\n h2 = _x64Add(_x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);\n }\n\n k1 = [0, 0];\n k2 = [0, 0];\n\n switch (remainder) {\n case 15:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 14]], 48));\n\n case 14:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 13]], 40));\n\n case 13:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 12]], 32));\n\n case 12:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 11]], 24));\n\n case 11:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 10]], 16));\n\n case 10:\n k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 9]], 8));\n\n case 9:\n k2 = _x64Xor(k2, [0, bytes[i + 8]]);\n k2 = _x64Multiply(k2, c2);\n k2 = _x64Rotl(k2, 33);\n k2 = _x64Multiply(k2, c1);\n h2 = _x64Xor(h2, k2);\n\n case 8:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 7]], 56));\n\n case 7:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 6]], 48));\n\n case 6:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 5]], 40));\n\n case 5:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 4]], 32));\n\n case 4:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 3]], 24));\n\n case 3:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 2]], 16));\n\n case 2:\n k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 1]], 8));\n\n case 1:\n k1 = _x64Xor(k1, [0, bytes[i]]);\n k1 = _x64Multiply(k1, c1);\n k1 = _x64Rotl(k1, 31);\n k1 = _x64Multiply(k1, c2);\n h1 = _x64Xor(h1, k1);\n }\n\n h1 = _x64Xor(h1, [0, bytes.length]);\n h2 = _x64Xor(h2, [0, bytes.length]);\n\n h1 = _x64Add(h1, h2);\n h2 = _x64Add(h2, h1);\n\n h1 = _x64Fmix(h1);\n h2 = _x64Fmix(h2);\n\n h1 = _x64Add(h1, h2);\n h2 = _x64Add(h2, h1);\n\n return (\"00000000\" + (h1[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h1[1] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[1] >>> 0).toString(16)).slice(-8);\n };\n\n // INITIALIZATION\n // --------------\n\n // Export murmurHash3 for CommonJS, either as an AMD module or just as part\n // of the global object.\n if (typeof exports !== 'undefined') {\n\n if (typeof module !== 'undefined' && module.exports) {\n exports = module.exports = library;\n }\n\n exports.murmurHash3 = library;\n\n } else if (typeof define === 'function' && define.amd) {\n\n define([], function () {\n return library;\n });\n } else {\n\n // Use murmurHash3.noConflict to restore `murmurHash3` back to its\n // original value. Returns a reference to the library object, to allow\n // it to be used under a different name.\n library._murmurHash3 = root.murmurHash3;\n\n library.noConflict = function () {\n root.murmurHash3 = library._murmurHash3;\n library._murmurHash3 = undefined;\n library.noConflict = undefined;\n\n return library;\n };\n\n root.murmurHash3 = library;\n }\n})(this);\n", "module.exports = require('./lib/murmurHash3js');\n", "/* eslint-disable require-await */\n'use strict'\n\nconst multihash = require('multihashes')\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('./types').Digest} Digest\n */\n\n/**\n * @type {Crypto}\n */\nconst crypto =\n self.crypto ||\n /** @type {typeof window.crypto} */\n // @ts-ignore - unknown property\n (self.msCrypto)\n\n/**\n *\n * @param {Uint8Array} data\n * @param {HashName} alg\n * @returns {Promise<Uint8Array>}\n */\nconst digest = async (data, alg) => {\n if (typeof self === 'undefined' || !crypto) {\n throw new Error(\n 'Please use a browser with webcrypto support and ensure the code has been delivered securely via HTTPS/TLS and run within a Secure Context'\n )\n }\n switch (alg) {\n case 'sha1':\n return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-1' }, data))\n case 'sha2-256':\n return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-256' }, data))\n case 'sha2-512':\n return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-512' }, data))\n case 'dbl-sha2-256': {\n const d = await crypto.subtle.digest({ name: 'SHA-256' }, data)\n return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-256' }, d))\n }\n default:\n throw new Error(`${alg} is not a supported algorithm`)\n }\n}\n\nmodule.exports = {\n /**\n * @param {HashName} alg\n * @returns {Digest}\n */\n factory: (alg) => async (data) => {\n return digest(data, alg)\n },\n digest,\n /**\n * @param {Uint8Array} buf\n * @param {HashName} alg\n * @param {number} [length]\n */\n multihashing: async (buf, alg, length) => {\n const h = await digest(buf, alg)\n return multihash.encode(h, alg, length)\n }\n}\n", "'use strict'\n\n/**\n * @param {number} number\n * @returns {Uint8Array}\n */\nconst fromNumberTo32BitBuf = (number) => {\n const bytes = new Uint8Array(4)\n\n for (let i = 0; i < 4; i++) {\n bytes[i] = number & 0xff\n number = number >> 8\n }\n\n return bytes\n}\n\nmodule.exports = {\n fromNumberTo32BitBuf\n}\n", "var ERROR_MSG_INPUT = 'Input must be an string, Buffer or Uint8Array'\n\n// For convenience, let people hash a string, not just a Uint8Array\nfunction normalizeInput (input) {\n var ret\n if (input instanceof Uint8Array) {\n ret = input\n } else if (input instanceof Buffer) {\n ret = new Uint8Array(input)\n } else if (typeof (input) === 'string') {\n ret = new Uint8Array(Buffer.from(input, 'utf8'))\n } else {\n throw new Error(ERROR_MSG_INPUT)\n }\n return ret\n}\n\n// Converts a Uint8Array to a hexadecimal string\n// For example, toHex([255, 0, 255]) returns \"ff00ff\"\nfunction toHex (bytes) {\n return Array.prototype.map.call(bytes, function (n) {\n return (n < 16 ? '0' : '') + n.toString(16)\n }).join('')\n}\n\n// Converts any value in [0...2^32-1] to an 8-character hex string\nfunction uint32ToHex (val) {\n return (0x100000000 + val).toString(16).substring(1)\n}\n\n// For debugging: prints out hash state in the same format as the RFC\n// sample computation exactly, so that you can diff\nfunction debugPrint (label, arr, size) {\n var msg = '\\n' + label + ' = '\n for (var i = 0; i < arr.length; i += 2) {\n if (size === 32) {\n msg += uint32ToHex(arr[i]).toUpperCase()\n msg += ' '\n msg += uint32ToHex(arr[i + 1]).toUpperCase()\n } else if (size === 64) {\n msg += uint32ToHex(arr[i + 1]).toUpperCase()\n msg += uint32ToHex(arr[i]).toUpperCase()\n } else throw new Error('Invalid size ' + size)\n if (i % 6 === 4) {\n msg += '\\n' + new Array(label.length + 4).join(' ')\n } else if (i < arr.length - 2) {\n msg += ' '\n }\n }\n console.log(msg)\n}\n\n// For performance testing: generates N bytes of input, hashes M times\n// Measures and prints MB/second hash performance each time\nfunction testSpeed (hashFn, N, M) {\n var startMs = new Date().getTime()\n\n var input = new Uint8Array(N)\n for (var i = 0; i < N; i++) {\n input[i] = i % 256\n }\n var genMs = new Date().getTime()\n console.log('Generated random input in ' + (genMs - startMs) + 'ms')\n startMs = genMs\n\n for (i = 0; i < M; i++) {\n var hashHex = hashFn(input)\n var hashMs = new Date().getTime()\n var ms = hashMs - startMs\n startMs = hashMs\n console.log('Hashed in ' + ms + 'ms: ' + hashHex.substring(0, 20) + '...')\n console.log(Math.round(N / (1 << 20) / (ms / 1000) * 100) / 100 + ' MB PER SECOND')\n }\n}\n\nmodule.exports = {\n normalizeInput: normalizeInput,\n toHex: toHex,\n debugPrint: debugPrint,\n testSpeed: testSpeed\n}\n", "// Blake2B in pure Javascript\n// Adapted from the reference implementation in RFC7693\n// Ported to Javascript by DC - https://github.com/dcposch\n\nvar util = require('./util')\n\n// 64-bit unsigned addition\n// Sets v[a,a+1] += v[b,b+1]\n// v should be a Uint32Array\nfunction ADD64AA (v, a, b) {\n var o0 = v[a] + v[b]\n var o1 = v[a + 1] + v[b + 1]\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}\n\n// 64-bit unsigned addition\n// Sets v[a,a+1] += b\n// b0 is the low 32 bits of b, b1 represents the high 32 bits\nfunction ADD64AC (v, a, b0, b1) {\n var o0 = v[a] + b0\n if (b0 < 0) {\n o0 += 0x100000000\n }\n var o1 = v[a + 1] + b1\n if (o0 >= 0x100000000) {\n o1++\n }\n v[a] = o0\n v[a + 1] = o1\n}\n\n// Little-endian byte access\nfunction B2B_GET32 (arr, i) {\n return (arr[i] ^\n (arr[i + 1] << 8) ^\n (arr[i + 2] << 16) ^\n (arr[i + 3] << 24))\n}\n\n// G Mixing function\n// The ROTRs are inlined for speed\nfunction B2B_G (a, b, c, d, ix, iy) {\n var x0 = m[ix]\n var x1 = m[ix + 1]\n var y0 = m[iy]\n var y1 = m[iy + 1]\n\n ADD64AA(v, a, b) // v[a,a+1] += v[b,b+1] ... in JS we must store a uint64 as two uint32s\n ADD64AC(v, a, x0, x1) // v[a, a+1] += x ... x0 is the low 32 bits of x, x1 is the high 32 bits\n\n // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n var xor0 = v[d] ^ v[a]\n var xor1 = v[d + 1] ^ v[a + 1]\n v[d] = xor1\n v[d + 1] = xor0\n\n ADD64AA(v, c, d)\n\n // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n xor0 = v[b] ^ v[c]\n xor1 = v[b + 1] ^ v[c + 1]\n v[b] = (xor0 >>> 24) ^ (xor1 << 8)\n v[b + 1] = (xor1 >>> 24) ^ (xor0 << 8)\n\n ADD64AA(v, a, b)\n ADD64AC(v, a, y0, y1)\n\n // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n xor0 = v[d] ^ v[a]\n xor1 = v[d + 1] ^ v[a + 1]\n v[d] = (xor0 >>> 16) ^ (xor1 << 16)\n v[d + 1] = (xor1 >>> 16) ^ (xor0 << 16)\n\n ADD64AA(v, c, d)\n\n // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n xor0 = v[b] ^ v[c]\n xor1 = v[b + 1] ^ v[c + 1]\n v[b] = (xor1 >>> 31) ^ (xor0 << 1)\n v[b + 1] = (xor0 >>> 31) ^ (xor1 << 1)\n}\n\n// Initialization Vector\nvar BLAKE2B_IV32 = new Uint32Array([\n 0xF3BCC908, 0x6A09E667, 0x84CAA73B, 0xBB67AE85,\n 0xFE94F82B, 0x3C6EF372, 0x5F1D36F1, 0xA54FF53A,\n 0xADE682D1, 0x510E527F, 0x2B3E6C1F, 0x9B05688C,\n 0xFB41BD6B, 0x1F83D9AB, 0x137E2179, 0x5BE0CD19\n])\n\nvar SIGMA8 = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3\n]\n\n// These are offsets into a uint64 buffer.\n// Multiply them all by 2 to make them offsets into a uint32 buffer,\n// because this is Javascript and we don't have uint64s\nvar SIGMA82 = new Uint8Array(SIGMA8.map(function (x) { return x * 2 }))\n\n// Compression function. 'last' flag indicates last block.\n// Note we're representing 16 uint64s as 32 uint32s\nvar v = new Uint32Array(32)\nvar m = new Uint32Array(32)\nfunction blake2bCompress (ctx, last) {\n var i = 0\n\n // init work variables\n for (i = 0; i < 16; i++) {\n v[i] = ctx.h[i]\n v[i + 16] = BLAKE2B_IV32[i]\n }\n\n // low 64 bits of offset\n v[24] = v[24] ^ ctx.t\n v[25] = v[25] ^ (ctx.t / 0x100000000)\n // high 64 bits not supported, offset may not be higher than 2**53-1\n\n // last block flag set ?\n if (last) {\n v[28] = ~v[28]\n v[29] = ~v[29]\n }\n\n // get little-endian words\n for (i = 0; i < 32; i++) {\n m[i] = B2B_GET32(ctx.b, 4 * i)\n }\n\n // twelve rounds of mixing\n // uncomment the DebugPrint calls to log the computation\n // and match the RFC sample documentation\n // util.debugPrint(' m[16]', m, 64)\n for (i = 0; i < 12; i++) {\n // util.debugPrint(' (i=' + (i < 10 ? ' ' : '') + i + ') v[16]', v, 64)\n B2B_G(0, 8, 16, 24, SIGMA82[i * 16 + 0], SIGMA82[i * 16 + 1])\n B2B_G(2, 10, 18, 26, SIGMA82[i * 16 + 2], SIGMA82[i * 16 + 3])\n B2B_G(4, 12, 20, 28, SIGMA82[i * 16 + 4], SIGMA82[i * 16 + 5])\n B2B_G(6, 14, 22, 30, SIGMA82[i * 16 + 6], SIGMA82[i * 16 + 7])\n B2B_G(0, 10, 20, 30, SIGMA82[i * 16 + 8], SIGMA82[i * 16 + 9])\n B2B_G(2, 12, 22, 24, SIGMA82[i * 16 + 10], SIGMA82[i * 16 + 11])\n B2B_G(4, 14, 16, 26, SIGMA82[i * 16 + 12], SIGMA82[i * 16 + 13])\n B2B_G(6, 8, 18, 28, SIGMA82[i * 16 + 14], SIGMA82[i * 16 + 15])\n }\n // util.debugPrint(' (i=12) v[16]', v, 64)\n\n for (i = 0; i < 16; i++) {\n ctx.h[i] = ctx.h[i] ^ v[i] ^ v[i + 16]\n }\n // util.debugPrint('h[8]', ctx.h, 64)\n}\n\n// Creates a BLAKE2b hashing context\n// Requires an output length between 1 and 64 bytes\n// Takes an optional Uint8Array key\nfunction blake2bInit (outlen, key) {\n if (outlen === 0 || outlen > 64) {\n throw new Error('Illegal output length, expected 0 < length <= 64')\n }\n if (key && key.length > 64) {\n throw new Error('Illegal key, expected Uint8Array with 0 < length <= 64')\n }\n\n // state, 'param block'\n var ctx = {\n b: new Uint8Array(128),\n h: new Uint32Array(16),\n t: 0, // input count\n c: 0, // pointer within buffer\n outlen: outlen // output length in bytes\n }\n\n // initialize hash state\n for (var i = 0; i < 16; i++) {\n ctx.h[i] = BLAKE2B_IV32[i]\n }\n var keylen = key ? key.length : 0\n ctx.h[0] ^= 0x01010000 ^ (keylen << 8) ^ outlen\n\n // key the hash, if applicable\n if (key) {\n blake2bUpdate(ctx, key)\n // at the end\n ctx.c = 128\n }\n\n return ctx\n}\n\n// Updates a BLAKE2b streaming hash\n// Requires hash context and Uint8Array (byte array)\nfunction blake2bUpdate (ctx, input) {\n for (var i = 0; i < input.length; i++) {\n if (ctx.c === 128) { // buffer full ?\n ctx.t += ctx.c // add counters\n blake2bCompress(ctx, false) // compress (not last)\n ctx.c = 0 // counter to zero\n }\n ctx.b[ctx.c++] = input[i]\n }\n}\n\n// Completes a BLAKE2b streaming hash\n// Returns a Uint8Array containing the message digest\nfunction blake2bFinal (ctx) {\n ctx.t += ctx.c // mark last block offset\n\n while (ctx.c < 128) { // fill up with zeros\n ctx.b[ctx.c++] = 0\n }\n blake2bCompress(ctx, true) // final block flag = 1\n\n // little endian convert and store\n var out = new Uint8Array(ctx.outlen)\n for (var i = 0; i < ctx.outlen; i++) {\n out[i] = ctx.h[i >> 2] >> (8 * (i & 3))\n }\n return out\n}\n\n// Computes the BLAKE2B hash of a string or byte array, and returns a Uint8Array\n//\n// Returns a n-byte Uint8Array\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer or Uint8Array\n// - key - optional key Uint8Array, up to 64 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2b (input, key, outlen) {\n // preprocess inputs\n outlen = outlen || 64\n input = util.normalizeInput(input)\n\n // do the math\n var ctx = blake2bInit(outlen, key)\n blake2bUpdate(ctx, input)\n return blake2bFinal(ctx)\n}\n\n// Computes the BLAKE2B hash of a string or byte array\n//\n// Returns an n-byte hash in hex, all lowercase\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer, or Uint8Array\n// - key - optional key Uint8Array, up to 64 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2bHex (input, key, outlen) {\n var output = blake2b(input, key, outlen)\n return util.toHex(output)\n}\n\nmodule.exports = {\n blake2b: blake2b,\n blake2bHex: blake2bHex,\n blake2bInit: blake2bInit,\n blake2bUpdate: blake2bUpdate,\n blake2bFinal: blake2bFinal\n}\n", "// BLAKE2s hash function in pure Javascript\n// Adapted from the reference implementation in RFC7693\n// Ported to Javascript by DC - https://github.com/dcposch\n\nvar util = require('./util')\n\n// Little-endian byte access.\n// Expects a Uint8Array and an index\n// Returns the little-endian uint32 at v[i..i+3]\nfunction B2S_GET32 (v, i) {\n return v[i] ^ (v[i + 1] << 8) ^ (v[i + 2] << 16) ^ (v[i + 3] << 24)\n}\n\n// Mixing function G.\nfunction B2S_G (a, b, c, d, x, y) {\n v[a] = v[a] + v[b] + x\n v[d] = ROTR32(v[d] ^ v[a], 16)\n v[c] = v[c] + v[d]\n v[b] = ROTR32(v[b] ^ v[c], 12)\n v[a] = v[a] + v[b] + y\n v[d] = ROTR32(v[d] ^ v[a], 8)\n v[c] = v[c] + v[d]\n v[b] = ROTR32(v[b] ^ v[c], 7)\n}\n\n// 32-bit right rotation\n// x should be a uint32\n// y must be between 1 and 31, inclusive\nfunction ROTR32 (x, y) {\n return (x >>> y) ^ (x << (32 - y))\n}\n\n// Initialization Vector.\nvar BLAKE2S_IV = new Uint32Array([\n 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,\n 0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19])\n\nvar SIGMA = new Uint8Array([\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0])\n\n// Compression function. \"last\" flag indicates last block\nvar v = new Uint32Array(16)\nvar m = new Uint32Array(16)\nfunction blake2sCompress (ctx, last) {\n var i = 0\n for (i = 0; i < 8; i++) { // init work variables\n v[i] = ctx.h[i]\n v[i + 8] = BLAKE2S_IV[i]\n }\n\n v[12] ^= ctx.t // low 32 bits of offset\n v[13] ^= (ctx.t / 0x100000000) // high 32 bits\n if (last) { // last block flag set ?\n v[14] = ~v[14]\n }\n\n for (i = 0; i < 16; i++) { // get little-endian words\n m[i] = B2S_GET32(ctx.b, 4 * i)\n }\n\n // ten rounds of mixing\n // uncomment the DebugPrint calls to log the computation\n // and match the RFC sample documentation\n // util.debugPrint(' m[16]', m, 32)\n for (i = 0; i < 10; i++) {\n // util.debugPrint(' (i=' + i + ') v[16]', v, 32)\n B2S_G(0, 4, 8, 12, m[SIGMA[i * 16 + 0]], m[SIGMA[i * 16 + 1]])\n B2S_G(1, 5, 9, 13, m[SIGMA[i * 16 + 2]], m[SIGMA[i * 16 + 3]])\n B2S_G(2, 6, 10, 14, m[SIGMA[i * 16 + 4]], m[SIGMA[i * 16 + 5]])\n B2S_G(3, 7, 11, 15, m[SIGMA[i * 16 + 6]], m[SIGMA[i * 16 + 7]])\n B2S_G(0, 5, 10, 15, m[SIGMA[i * 16 + 8]], m[SIGMA[i * 16 + 9]])\n B2S_G(1, 6, 11, 12, m[SIGMA[i * 16 + 10]], m[SIGMA[i * 16 + 11]])\n B2S_G(2, 7, 8, 13, m[SIGMA[i * 16 + 12]], m[SIGMA[i * 16 + 13]])\n B2S_G(3, 4, 9, 14, m[SIGMA[i * 16 + 14]], m[SIGMA[i * 16 + 15]])\n }\n // util.debugPrint(' (i=10) v[16]', v, 32)\n\n for (i = 0; i < 8; i++) {\n ctx.h[i] ^= v[i] ^ v[i + 8]\n }\n // util.debugPrint('h[8]', ctx.h, 32)\n}\n\n// Creates a BLAKE2s hashing context\n// Requires an output length between 1 and 32 bytes\n// Takes an optional Uint8Array key\nfunction blake2sInit (outlen, key) {\n if (!(outlen > 0 && outlen <= 32)) {\n throw new Error('Incorrect output length, should be in [1, 32]')\n }\n var keylen = key ? key.length : 0\n if (key && !(keylen > 0 && keylen <= 32)) {\n throw new Error('Incorrect key length, should be in [1, 32]')\n }\n\n var ctx = {\n h: new Uint32Array(BLAKE2S_IV), // hash state\n b: new Uint32Array(64), // input block\n c: 0, // pointer within block\n t: 0, // input count\n outlen: outlen // output length in bytes\n }\n ctx.h[0] ^= 0x01010000 ^ (keylen << 8) ^ outlen\n\n if (keylen > 0) {\n blake2sUpdate(ctx, key)\n ctx.c = 64 // at the end\n }\n\n return ctx\n}\n\n// Updates a BLAKE2s streaming hash\n// Requires hash context and Uint8Array (byte array)\nfunction blake2sUpdate (ctx, input) {\n for (var i = 0; i < input.length; i++) {\n if (ctx.c === 64) { // buffer full ?\n ctx.t += ctx.c // add counters\n blake2sCompress(ctx, false) // compress (not last)\n ctx.c = 0 // counter to zero\n }\n ctx.b[ctx.c++] = input[i]\n }\n}\n\n// Completes a BLAKE2s streaming hash\n// Returns a Uint8Array containing the message digest\nfunction blake2sFinal (ctx) {\n ctx.t += ctx.c // mark last block offset\n while (ctx.c < 64) { // fill up with zeros\n ctx.b[ctx.c++] = 0\n }\n blake2sCompress(ctx, true) // final block flag = 1\n\n // little endian convert and store\n var out = new Uint8Array(ctx.outlen)\n for (var i = 0; i < ctx.outlen; i++) {\n out[i] = (ctx.h[i >> 2] >> (8 * (i & 3))) & 0xFF\n }\n return out\n}\n\n// Computes the BLAKE2S hash of a string or byte array, and returns a Uint8Array\n//\n// Returns a n-byte Uint8Array\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer, or Uint8Array\n// - key - optional key Uint8Array, up to 32 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2s (input, key, outlen) {\n // preprocess inputs\n outlen = outlen || 32\n input = util.normalizeInput(input)\n\n // do the math\n var ctx = blake2sInit(outlen, key)\n blake2sUpdate(ctx, input)\n return blake2sFinal(ctx)\n}\n\n// Computes the BLAKE2S hash of a string or byte array\n//\n// Returns an n-byte hash in hex, all lowercase\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer, or Uint8Array\n// - key - optional key Uint8Array, up to 32 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2sHex (input, key, outlen) {\n var output = blake2s(input, key, outlen)\n return util.toHex(output)\n}\n\nmodule.exports = {\n blake2s: blake2s,\n blake2sHex: blake2sHex,\n blake2sInit: blake2sInit,\n blake2sUpdate: blake2sUpdate,\n blake2sFinal: blake2sFinal\n}\n", "var b2b = require('./blake2b')\nvar b2s = require('./blake2s')\n\nmodule.exports = {\n blake2b: b2b.blake2b,\n blake2bHex: b2b.blake2bHex,\n blake2bInit: b2b.blake2bInit,\n blake2bUpdate: b2b.blake2bUpdate,\n blake2bFinal: b2b.blake2bFinal,\n blake2s: b2s.blake2s,\n blake2sHex: b2s.blake2sHex,\n blake2sInit: b2s.blake2sInit,\n blake2sUpdate: b2s.blake2sUpdate,\n blake2sFinal: b2s.blake2sFinal\n}\n", "'use strict'\n\n// @ts-ignore - no types available\nconst blake = require('blakejs')\n\nconst minB = 0xb201\nconst minS = 0xb241\n\nconst blake2b = {\n init: blake.blake2bInit,\n update: blake.blake2bUpdate,\n digest: blake.blake2bFinal\n}\n\nconst blake2s = {\n init: blake.blake2sInit,\n update: blake.blake2sUpdate,\n digest: blake.blake2sFinal\n}\n\n// Note that although this function doesn't do any asynchronous work, we mark\n// the function as async because it must return a Promise to match the API\n// for other functions that do perform asynchronous work (see sha.browser.js)\n// eslint-disable-next-line\n\n/**\n * @param {number} size\n * @param {any} hf\n * @returns {import('./types').Digest}\n */\nconst makeB2Hash = (size, hf) => async (data) => {\n const ctx = hf.init(size, null)\n hf.update(ctx, data)\n return hf.digest(ctx)\n}\n\n/**\n * @param {Record<number, import('./types').Digest>} table\n */\nmodule.exports = (table) => {\n for (let i = 0; i < 64; i++) {\n table[minB + i] = makeB2Hash(i + 1, blake2b)\n }\n for (let i = 0; i < 32; i++) {\n table[minS + i] = makeB2Hash(i + 1, blake2s)\n }\n}\n", "'use strict'\n\nconst sha3 = require('js-sha3')\n// @ts-ignore - no types available\nconst mur = require('murmurhash3js-revisited')\nconst { factory: sha } = require('./sha')\nconst { fromNumberTo32BitBuf } = require('./utils')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n// Note that although this function doesn't do any asynchronous work, we mark\n// the function as async because it must return a Promise to match the API\n// for other functions that do perform asynchronous work (see sha.browser.js)\n// eslint-disable-next-line\n/**\n * @param {string} algorithm\n * @returns {import('./types').Digest}\n */\nconst hash = (algorithm) => async (data) => {\n switch (algorithm) {\n case 'sha3-224':\n return new Uint8Array(sha3.sha3_224.arrayBuffer(data))\n case 'sha3-256':\n return new Uint8Array(sha3.sha3_256.arrayBuffer(data))\n case 'sha3-384':\n return new Uint8Array(sha3.sha3_384.arrayBuffer(data))\n case 'sha3-512':\n return new Uint8Array(sha3.sha3_512.arrayBuffer(data))\n case 'shake-128':\n return new Uint8Array(sha3.shake128.create(128).update(data).arrayBuffer())\n case 'shake-256':\n return new Uint8Array(sha3.shake256.create(256).update(data).arrayBuffer())\n case 'keccak-224':\n return new Uint8Array(sha3.keccak224.arrayBuffer(data))\n case 'keccak-256':\n return new Uint8Array(sha3.keccak256.arrayBuffer(data))\n case 'keccak-384':\n return new Uint8Array(sha3.keccak384.arrayBuffer(data))\n case 'keccak-512':\n return new Uint8Array(sha3.keccak512.arrayBuffer(data))\n case 'murmur3-128':\n return uint8ArrayFromString(mur.x64.hash128(data), 'base16')\n case 'murmur3-32':\n return fromNumberTo32BitBuf(mur.x86.hash32(data))\n\n default:\n throw new TypeError(`${algorithm} is not a supported algorithm`)\n }\n}\n\n/** @type {import('./types').Digest} */\nconst identity = data => data\n\nmodule.exports = {\n identity,\n sha1: sha('sha1'),\n sha2256: sha('sha2-256'),\n sha2512: sha('sha2-512'),\n dblSha2256: sha('dbl-sha2-256'),\n sha3224: hash('sha3-224'),\n sha3256: hash('sha3-256'),\n sha3384: hash('sha3-384'),\n sha3512: hash('sha3-512'),\n shake128: hash('shake-128'),\n shake256: hash('shake-256'),\n keccak224: hash('keccak-224'),\n keccak256: hash('keccak-256'),\n keccak384: hash('keccak-384'),\n keccak512: hash('keccak-512'),\n murmur3128: hash('murmur3-128'),\n murmur332: hash('murmur3-32'),\n addBlake: require('./blake')\n}\n", "'use strict'\n\nconst errcode = require('err-code')\nconst multihash = require('multihashes')\nconst crypto = require('./crypto')\nconst equals = require('uint8arrays/equals')\n\n/**\n * @typedef {import(\"./types\").Digest} Digest\n * @typedef {import(\"multihashes\").HashName} HashName\n */\n\n/**\n * Hash the given `bytes` using the algorithm specified by `alg`.\n *\n * @param {Uint8Array} bytes - The value to hash.\n * @param {HashName} alg - The algorithm to use eg 'sha1'\n * @param {number} [length] - Optionally trim the result to this length.\n * @returns {Promise<Uint8Array>}\n */\nasync function Multihashing (bytes, alg, length) {\n const digest = await Multihashing.digest(bytes, alg, length)\n return multihash.encode(digest, alg, length)\n}\n\n/**\n * Expose multihash itself, to avoid silly double requires.\n */\nMultihashing.multihash = multihash\n\n/**\n * @param {Uint8Array} bytes - The value to hash.\n * @param {HashName} alg - The algorithm to use eg 'sha1'\n * @param {number} [length] - Optionally trim the result to this length.\n * @returns {Promise<Uint8Array>}\n */\nMultihashing.digest = async (bytes, alg, length) => {\n const hash = Multihashing.createHash(alg)\n const digest = await hash(bytes)\n return length ? digest.slice(0, length) : digest\n}\n\n/**\n * Creates a function that hashes with the given algorithm\n *\n * @param {HashName} alg - The algorithm to use eg 'sha1'\n * @returns {Digest} - The hash function corresponding to `alg`\n */\nMultihashing.createHash = function (alg) {\n if (!alg) {\n const e = errcode(new Error('hash algorithm must be specified'), 'ERR_HASH_ALGORITHM_NOT_SPECIFIED')\n throw e\n }\n\n const code = multihash.coerceCode(alg)\n if (!Multihashing.functions[code]) {\n throw errcode(new Error(`multihash function '${alg}' not yet supported`), 'ERR_HASH_ALGORITHM_NOT_SUPPORTED')\n }\n\n return Multihashing.functions[code]\n}\n\n/**\n * Mapping of multihash codes to their hashing functions.\n *\n * @type {Record<number, Digest>}\n */\n// @ts-ignore - most of those functions aren't typed\nMultihashing.functions = {\n // identity\n 0x00: crypto.identity,\n // sha1\n 0x11: crypto.sha1,\n // sha2-256\n 0x12: crypto.sha2256,\n // sha2-512\n 0x13: crypto.sha2512,\n // sha3-512\n 0x14: crypto.sha3512,\n // sha3-384\n 0x15: crypto.sha3384,\n // sha3-256\n 0x16: crypto.sha3256,\n // sha3-224\n 0x17: crypto.sha3224,\n // shake-128\n 0x18: crypto.shake128,\n // shake-256\n 0x19: crypto.shake256,\n // keccak-224\n 0x1A: crypto.keccak224,\n // keccak-256\n 0x1B: crypto.keccak256,\n // keccak-384\n 0x1C: crypto.keccak384,\n // keccak-512\n 0x1D: crypto.keccak512,\n // murmur3-128\n 0x22: crypto.murmur3128,\n // murmur3-32\n 0x23: crypto.murmur332,\n // dbl-sha2-256\n 0x56: crypto.dblSha2256\n}\n\n// add blake functions\ncrypto.addBlake(Multihashing.functions)\n\n/**\n * @param {Uint8Array} bytes\n * @param {Uint8Array} hash\n * @returns {Promise<boolean>}\n */\nMultihashing.validate = async (bytes, hash) => {\n const newHash = await Multihashing(bytes, multihash.decode(hash).name)\n\n return equals(hash, newHash)\n}\n\nmodule.exports = Multihashing\n", "'use strict'\n\nconst CID = require('cids')\nconst multicodec = require('multicodec')\nconst multihashing = require('multihashing-async')\nconst { multihash } = multihashing\n\nconst codec = multicodec.DAG_PB\nconst defaultHashAlg = multihash.names['sha2-256']\n\n/**\n * @typedef {object} GenCIDOptions - Options to create the CID\n * @property {CID.CIDVersion} [cidVersion=1] - CID version number\n * @property {multihashing.multihash.HashCode} [hashAlg=multihash.names['sha2-256']] - Defaults to the defaultHashAlg of the format\n */\n\n/**\n * Calculate the CID of the binary blob.\n *\n * @param {Uint8Array} binaryBlob - Encoded IPLD Node\n * @param {GenCIDOptions} [userOptions] - Options to create the CID\n */\nconst cid = async (binaryBlob, userOptions = {}) => {\n const options = {\n cidVersion: userOptions.cidVersion == null ? 1 : userOptions.cidVersion,\n hashAlg: userOptions.hashAlg == null ? defaultHashAlg : userOptions.hashAlg\n }\n\n const hashName = multihash.codes[options.hashAlg]\n const hash = await multihashing(binaryBlob, hashName)\n const codecName = multicodec.getNameFromCode(codec)\n const cid = new CID(options.cidVersion, codecName, hash)\n\n return cid\n}\n\nmodule.exports = {\n codec,\n defaultHashAlg,\n cid\n}\n", "'use strict'\n\nconst DAGLink = require('../dag-link/dagLink')\nconst genCid = require('../genCid')\n\n/**\n * toDAGLink converts a DAGNode to a DAGLink\n *\n * @typedef {import('../genCid').GenCIDOptions} GenCIDOptions\n *\n * @typedef {object} ToDagLinkExtraOptions\n * @property {string} [name]\n *\n * @typedef {GenCIDOptions & ToDagLinkExtraOptions} ToDagLinkOptions\n *\n * @param {import('./dagNode')} node\n * @param {ToDagLinkOptions} options\n */\nconst toDAGLink = async (node, options = {}) => {\n const buf = node.serialize()\n const nodeCid = await genCid.cid(buf, options)\n return new DAGLink(options.name || '', node.size, nodeCid)\n}\n\nmodule.exports = toDAGLink\n", "'use strict'\n\nconst sortLinks = require('./sortLinks')\nconst DAGLink = require('../dag-link/dagLink')\n\n/**\n * @typedef {import('./dagNode')} DAGNode\n * @typedef {import('../types')} DAGLinkLike\n */\n\n/**\n * @param {*} link\n * @returns {DAGLink}\n */\nconst asDAGLink = (link) => {\n if (link instanceof DAGLink) {\n // It's a DAGLink instance\n // no need to do anything\n return link\n }\n\n // DAGNode.isDagNode() would be more appropriate here, but it can't be used\n // as it would lead to circular dependencies as `addLink` is called from\n // within the DAGNode object.\n if (!('cid' in link ||\n 'hash' in link ||\n 'Hash' in link ||\n 'multihash' in link)) {\n throw new Error('Link must be a DAGLink or DAGLink-like. Convert the DAGNode into a DAGLink via `node.toDAGLink()`.')\n }\n\n // It's a Object with name, multihash/hash/cid and size\n // @ts-ignore\n return new DAGLink(link.Name || link.name, link.Tsize || link.size, link.Hash || link.multihash || link.hash || link.cid)\n}\n\n/**\n * @param {DAGNode} node\n * @param {DAGLink | DAGLinkLike} link\n */\nconst addLink = (node, link) => {\n const dagLink = asDAGLink(link)\n node.Links.push(dagLink)\n sortLinks(node.Links)\n}\n\nmodule.exports = addLink\n", "'use strict'\n\nconst CID = require('cids')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * @typedef {import('../dag-link/dagLink')} DAGLink\n */\n\n/**\n *\n * @param {import('./dagNode')} dagNode\n * @param {string | CID | Uint8Array | DAGLink} nameOrCid\n */\nconst rmLink = (dagNode, nameOrCid) => {\n let predicate = null\n\n // It's a name\n if (typeof nameOrCid === 'string') {\n predicate = (/** @type {DAGLink} */ link) => link.Name === nameOrCid\n } else if (nameOrCid instanceof Uint8Array) {\n predicate = (/** @type {DAGLink} */ link) => uint8ArrayEquals(link.Hash.bytes, nameOrCid)\n } else if (CID.isCID(nameOrCid)) {\n predicate = (/** @type {DAGLink} */ link) => uint8ArrayEquals(link.Hash.bytes, nameOrCid.bytes)\n }\n\n if (predicate) {\n const links = dagNode.Links\n let index = 0\n while (index < links.length) {\n const link = links[index]\n if (predicate(link)) {\n links.splice(index, 1)\n } else {\n index++\n }\n }\n } else {\n throw new Error('second arg needs to be a name or CID')\n }\n}\n\nmodule.exports = rmLink\n", "'use strict'\n\nconst sortLinks = require('./sortLinks')\nconst DAGLink = require('../dag-link/dagLink')\nconst { createDagLinkFromB58EncodedHash } = require('../dag-link/util')\nconst { serializeDAGNode } = require('../serialize')\nconst toDAGLink = require('./toDagLink')\nconst addLink = require('./addLink')\nconst rmLink = require('./rmLink')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('../types').DAGLinkLike} DAGLinkLike\n */\n\nclass DAGNode {\n /**\n *@param {Uint8Array | string} [data]\n * @param {(DAGLink | DAGLinkLike)[]} links\n * @param {number | null} [serializedSize]\n */\n constructor (data, links = [], serializedSize = null) {\n if (!data) {\n data = new Uint8Array(0)\n }\n if (typeof data === 'string') {\n data = uint8ArrayFromString(data)\n }\n\n if (!(data instanceof Uint8Array)) {\n throw new Error('Passed \\'data\\' is not a Uint8Array or a String!')\n }\n\n if (serializedSize !== null && typeof serializedSize !== 'number') {\n throw new Error('Passed \\'serializedSize\\' must be a number!')\n }\n\n const sortedLinks = links.map((link) => {\n return link instanceof DAGLink\n ? link\n : createDagLinkFromB58EncodedHash(link)\n })\n sortLinks(sortedLinks)\n\n this.Data = data\n this.Links = sortedLinks\n\n Object.defineProperties(this, {\n _serializedSize: { value: serializedSize, writable: true, enumerable: false },\n _size: { value: null, writable: true, enumerable: false }\n })\n }\n\n toJSON () {\n if (!this._json) {\n this._json = Object.freeze({\n data: this.Data,\n links: this.Links.map((l) => l.toJSON()),\n size: this.size\n })\n }\n\n return Object.assign({}, this._json)\n }\n\n toString () {\n return `DAGNode <data: \"${uint8ArrayToString(this.Data, 'base64urlpad')}\", links: ${this.Links.length}, size: ${this.size}>`\n }\n\n _invalidateCached () {\n this._serializedSize = null\n this._size = null\n }\n\n /**\n * @param {DAGLink | import('../types').DAGLinkLike} link\n */\n addLink (link) {\n this._invalidateCached()\n return addLink(this, link)\n }\n\n /**\n * @param {DAGLink | string | CID} link\n */\n rmLink (link) {\n this._invalidateCached()\n return rmLink(this, link)\n }\n\n /**\n * @param {import('./toDagLink').ToDagLinkOptions} [options]\n */\n toDAGLink (options) {\n return toDAGLink(this, options)\n }\n\n serialize () {\n const buf = serializeDAGNode(this)\n\n this._serializedSize = buf.length\n\n return buf\n }\n\n get size () {\n if (this._size == null) {\n let serializedSize\n\n if (serializedSize == null) {\n this._serializedSize = this.serialize().length\n serializedSize = this._serializedSize\n }\n\n this._size = this.Links.reduce((sum, l) => sum + l.Tsize, serializedSize)\n }\n\n return this._size\n }\n\n set size (size) {\n throw new Error(\"Can't set property: 'size' is immutable\")\n }\n}\n\nmodule.exports = DAGNode\n", "'use strict'\n\nconst {\n PBNode\n} = require('./dag')\nconst DAGLink = require('./dag-link/dagLink')\nconst DAGNode = require('./dag-node/dagNode')\nconst { serializeDAGNode, serializeDAGNodeLike } = require('./serialize')\nconst genCid = require('./genCid')\n\n/**\n * @typedef {import('./types').DAGLinkLike} DAGLinkLike\n */\n\n/**\n * Calculate the CID of the binary blob\n *\n * @param {Uint8Array} binaryBlob - Encoded IPLD Node\n * @param {import('./genCid').GenCIDOptions} [userOptions] - Options to create the CID\n */\nconst cid = (binaryBlob, userOptions) => {\n return genCid.cid(binaryBlob, userOptions)\n}\n\n/**\n * Serialize internal representation into a binary PB block\n *\n * @param {DAGNode | { Data?: Uint8Array, Links?: (DAGLink | DAGLinkLike)[]}} node\n */\nconst serialize = (node) => {\n if (node instanceof DAGNode) {\n return serializeDAGNode(node)\n } else {\n return serializeDAGNodeLike(node.Data, node.Links)\n }\n}\n\n/**\n * Deserialize PB block into the internal representation.\n *\n * @param {Uint8Array} buffer - Binary representation of a PB block\n */\nconst deserialize = (buffer) => {\n const message = PBNode.decode(buffer)\n const pbn = PBNode.toObject(message, {\n defaults: false,\n arrays: true,\n longs: Number,\n objects: false\n })\n\n /** @type {DAGLink[]} */\n const links = pbn.Links.map((/** @type {DAGLinkLike} */ link) => {\n // @ts-ignore\n return new DAGLink(link.Name, link.Tsize, link.Hash)\n })\n\n const data = pbn.Data == null ? new Uint8Array(0) : pbn.Data\n\n return new DAGNode(data, links, buffer.byteLength)\n}\n\nmodule.exports = {\n codec: genCid.codec,\n defaultHashAlg: genCid.defaultHashAlg,\n serialize,\n deserialize,\n cid\n}\n", "'use strict'\n\nconst CID = require('cids')\n\nconst util = require('./util')\n\n/**\n * Resolves a path within a PB block.\n *\n * If the path resolves half-way to a link, then the `remainderPath` is the part\n * after the link that can be used for further resolving\n *\n * Returns the value or a link and the partial missing path. This way the\n * IPLD Resolver can fetch the link and continue to resolve.\n *\n * @param {Uint8Array} binaryBlob - Binary representation of a PB block\n * @param {string} [path='/'] - Path that should be resolved\n */\nexports.resolve = (binaryBlob, path = '/') => {\n let node = util.deserialize(binaryBlob)\n\n const parts = path.split('/').filter(Boolean)\n while (parts.length) {\n const key = parts.shift()\n // @ts-ignore\n if (node[key] === undefined) {\n // There might be a matching named link\n for (const link of node.Links) {\n if (link.Name === key) {\n return {\n value: link.Hash,\n remainderPath: parts.join('/')\n }\n }\n }\n\n // There wasn't even a matching named link\n throw new Error(`Object has no property '${key}'`)\n }\n\n // @ts-ignore\n node = node[key]\n if (CID.isCID(node)) {\n return {\n value: node,\n remainderPath: parts.join('/')\n }\n }\n }\n\n return {\n value: node,\n remainderPath: ''\n }\n}\n\n/**\n * Return all available paths of a block.\n *\n * @generator\n * @param {Uint8Array} binaryBlob - Binary representation of a PB block\n * @yields {string} - A single path\n */\nexports.tree = function * (binaryBlob) {\n const node = util.deserialize(binaryBlob)\n\n // There is always a `Data` and `Links` property\n yield 'Data'\n yield 'Links'\n for (let ii = 0; ii < node.Links.length; ii++) {\n yield `Links/${ii}`\n yield `Links/${ii}/Name`\n yield `Links/${ii}/Tsize`\n yield `Links/${ii}/Hash`\n }\n}\n", "'use strict'\n\nconst resolver = require('./resolver')\nconst util = require('./util')\nconst DAGNodeClass = require('./dag-node/dagNode')\nconst DAGLinkClass = require('./dag-link/dagLink')\n\n/**\n * @typedef {import('./types').DAGLinkLike} DAGLinkLike\n * @typedef {import('./types').DAGNodeLike} DAGNodeLike\n * @typedef {import('./dag-node/dagNode')} DAGNode\n * @typedef {import('./dag-link/dagLink')} DAGLink\n */\n\n/**\n * @type {import('./types').DAGNodeFormat}\n */\nconst format = {\n DAGNode: DAGNodeClass,\n DAGLink: DAGLinkClass,\n\n /**\n * Functions to fulfil IPLD Format interface\n * https://github.com/ipld/interface-ipld-format\n */\n resolver,\n util,\n codec: util.codec,\n defaultHashAlg: util.defaultHashAlg\n}\n\nmodule.exports = format\n", "'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n/**\n * Base-N/Base-X encoding/decoding functions.\n *\n * Original implementation from base-x:\n * https://github.com/cryptocoinjs/base-x\n *\n * Which is MIT licensed:\n *\n * The MIT License (MIT)\n *\n * Copyright base-x contributors (c) 2016\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\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 OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n */\n\n// base58 characters (Bitcoin alphabet)\nconst BASE58_BTC = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\n\n// baseN alphabet indexes\nconst _reverseAlphabets = {};\n\n/**\n * BaseN-encodes a Uint8Array using the given alphabet.\n *\n * @param {Uint8Array} input the bytes to encode in a Uint8Array.\n * @param {number} maxline the maximum number of encoded characters per line to\n * use, defaults to none.\n *\n * @return {string} the baseN-encoded output string.\n */\nfunction encode(input, maxline, alphabet = BASE58_BTC) {\n if(!(input instanceof Uint8Array)) {\n throw new TypeError('\"input\" must be a Uint8Array.');\n }\n if(typeof alphabet !== 'string') {\n throw new TypeError('\"alphabet\" must be a string.');\n }\n if(maxline !== undefined && typeof maxline !== 'number') {\n throw new TypeError('\"maxline\" must be a number.');\n }\n if(input.length === 0) {\n return '';\n }\n\n let output = '';\n\n let i = 0;\n const base = alphabet.length;\n const first = alphabet.charAt(0);\n const digits = [0];\n for(i = 0; i < input.length; ++i) {\n let carry = input[i];\n for(let j = 0; j < digits.length; ++j) {\n carry += digits[j] << 8;\n digits[j] = carry % base;\n carry = (carry / base) | 0;\n }\n\n while(carry > 0) {\n digits.push(carry % base);\n carry = (carry / base) | 0;\n }\n }\n\n // deal with leading zeros\n for(i = 0; input[i] === 0 && i < input.length - 1; ++i) {\n output += first;\n }\n // convert digits to a string\n for(i = digits.length - 1; i >= 0; --i) {\n output += alphabet[digits[i]];\n }\n\n if(maxline) {\n const regex = new RegExp('.{1,' + maxline + '}', 'g');\n output = output.match(regex).join('\\r\\n');\n }\n\n return output;\n}\n\n/**\n * Decodes a baseN-encoded (using the given alphabet) string to a\n * Uint8Array.\n *\n * @param {string} input the baseN-encoded input string.\n *\n * @return {Uint8Array} the decoded bytes in a Uint8Array.\n */\nfunction decode(input, alphabet = BASE58_BTC) {\n if(typeof input !== 'string') {\n throw new TypeError('\"input\" must be a string.');\n }\n if(typeof alphabet !== 'string') {\n throw new TypeError('\"alphabet\" must be a string.');\n }\n if(input.length === 0) {\n return new Uint8Array();\n }\n\n let table = _reverseAlphabets[alphabet];\n if(!table) {\n // compute reverse alphabet\n table = _reverseAlphabets[alphabet] = [];\n for(let i = 0; i < alphabet.length; ++i) {\n table[alphabet.charCodeAt(i)] = i;\n }\n }\n\n // remove whitespace characters\n input = input.replace(/\\s/g, '');\n\n const base = alphabet.length;\n const first = alphabet.charAt(0);\n const bytes = [0];\n for(let i = 0; i < input.length; i++) {\n const value = table[input.charCodeAt(i)];\n if(value === undefined) {\n return;\n }\n\n let carry = value;\n for(let j = 0; j < bytes.length; ++j) {\n carry += bytes[j] * base;\n bytes[j] = carry & 0xff;\n carry >>= 8;\n }\n\n while(carry > 0) {\n bytes.push(carry & 0xff);\n carry >>= 8;\n }\n }\n\n // deal with leading zeros\n for(let k = 0; input[k] === first && k < input.length - 1; ++k) {\n bytes.push(0);\n }\n\n return new Uint8Array(bytes.reverse());\n}\n\nexports.decode = decode;\nexports.encode = encode;\n", "'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar baseN = require('./baseN.js');\n\n\n\nexports.decode = baseN.decode;\nexports.encode = baseN.encode;\n", "/**\n\tC-like unsigned 32 bits integers in Javascript\n\tCopyright (C) 2013, Pierre Curto\n\tMIT license\n */\n;(function (root) {\n\n\t// Local cache for typical radices\n\tvar radixPowerCache = {\n\t\t36: UINT32( Math.pow(36, 5) )\n\t,\t16: UINT32( Math.pow(16, 7) )\n\t,\t10: UINT32( Math.pow(10, 9) )\n\t,\t2: UINT32( Math.pow(2, 30) )\n\t}\n\tvar radixCache = {\n\t\t36: UINT32(36)\n\t,\t16: UINT32(16)\n\t,\t10: UINT32(10)\n\t,\t2: UINT32(2)\n\t}\n\n\t/**\n\t *\tRepresents an unsigned 32 bits integer\n\t * @constructor\n\t * @param {Number|String|Number} low bits | integer as a string \t\t | integer as a number\n\t * @param {Number|Number|Undefined} high bits | radix (optional, default=10)\n\t * @return \n\t */\n\tfunction UINT32 (l, h) {\n\t\tif ( !(this instanceof UINT32) )\n\t\t\treturn new UINT32(l, h)\n\n\t\tthis._low = 0\n\t\tthis._high = 0\n\t\tthis.remainder = null\n\t\tif (typeof h == 'undefined')\n\t\t\treturn fromNumber.call(this, l)\n\n\t\tif (typeof l == 'string')\n\t\t\treturn fromString.call(this, l, h)\n\n\t\tfromBits.call(this, l, h)\n\t}\n\n\t/**\n\t * Set the current _UINT32_ object with its low and high bits\n\t * @method fromBits\n\t * @param {Number} low bits\n\t * @param {Number} high bits\n\t * @return ThisExpression\n\t */\n\tfunction fromBits (l, h) {\n\t\tthis._low = l | 0\n\t\tthis._high = h | 0\n\n\t\treturn this\n\t}\n\tUINT32.prototype.fromBits = fromBits\n\n\t/**\n\t * Set the current _UINT32_ object from a number\n\t * @method fromNumber\n\t * @param {Number} number\n\t * @return ThisExpression\n\t */\n\tfunction fromNumber (value) {\n\t\tthis._low = value & 0xFFFF\n\t\tthis._high = value >>> 16\n\n\t\treturn this\n\t}\n\tUINT32.prototype.fromNumber = fromNumber\n\n\t/**\n\t * Set the current _UINT32_ object from a string\n\t * @method fromString\n\t * @param {String} integer as a string\n\t * @param {Number} radix (optional, default=10)\n\t * @return ThisExpression\n\t */\n\tfunction fromString (s, radix) {\n\t\tvar value = parseInt(s, radix || 10)\n\n\t\tthis._low = value & 0xFFFF\n\t\tthis._high = value >>> 16\n\n\t\treturn this\n\t}\n\tUINT32.prototype.fromString = fromString\n\n\t/**\n\t * Convert this _UINT32_ to a number\n\t * @method toNumber\n\t * @return {Number} the converted UINT32\n\t */\n\tUINT32.prototype.toNumber = function () {\n\t\treturn (this._high * 65536) + this._low\n\t}\n\n\t/**\n\t * Convert this _UINT32_ to a string\n\t * @method toString\n\t * @param {Number} radix (optional, default=10)\n\t * @return {String} the converted UINT32\n\t */\n\tUINT32.prototype.toString = function (radix) {\n\t\treturn this.toNumber().toString(radix || 10)\n\t}\n\n\t/**\n\t * Add two _UINT32_. The current _UINT32_ stores the result\n\t * @method add\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.add = function (other) {\n\t\tvar a00 = this._low + other._low\n\t\tvar a16 = a00 >>> 16\n\n\t\ta16 += this._high + other._high\n\n\t\tthis._low = a00 & 0xFFFF\n\t\tthis._high = a16 & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Subtract two _UINT32_. The current _UINT32_ stores the result\n\t * @method subtract\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.subtract = function (other) {\n\t\t//TODO inline\n\t\treturn this.add( other.clone().negate() )\n\t}\n\n\t/**\n\t * Multiply two _UINT32_. The current _UINT32_ stores the result\n\t * @method multiply\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.multiply = function (other) {\n\t\t/*\n\t\t\ta = a00 + a16\n\t\t\tb = b00 + b16\n\t\t\ta*b = (a00 + a16)(b00 + b16)\n\t\t\t\t= a00b00 + a00b16 + a16b00 + a16b16\n\n\t\t\ta16b16 overflows the 32bits\n\t\t */\n\t\tvar a16 = this._high\n\t\tvar a00 = this._low\n\t\tvar b16 = other._high\n\t\tvar b00 = other._low\n\n/* Removed to increase speed under normal circumstances (i.e. not multiplying by 0 or 1)\n\t\t// this == 0 or other == 1: nothing to do\n\t\tif ((a00 == 0 && a16 == 0) || (b00 == 1 && b16 == 0)) return this\n\n\t\t// other == 0 or this == 1: this = other\n\t\tif ((b00 == 0 && b16 == 0) || (a00 == 1 && a16 == 0)) {\n\t\t\tthis._low = other._low\n\t\t\tthis._high = other._high\n\t\t\treturn this\n\t\t}\n*/\n\n\t\tvar c16, c00\n\t\tc00 = a00 * b00\n\t\tc16 = c00 >>> 16\n\n\t\tc16 += a16 * b00\n\t\tc16 &= 0xFFFF\t\t// Not required but improves performance\n\t\tc16 += a00 * b16\n\n\t\tthis._low = c00 & 0xFFFF\n\t\tthis._high = c16 & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Divide two _UINT32_. The current _UINT32_ stores the result.\n\t * The remainder is made available as the _remainder_ property on\n\t * the _UINT32_ object. It can be null, meaning there are no remainder.\n\t * @method div\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.div = function (other) {\n\t\tif ( (other._low == 0) && (other._high == 0) ) throw Error('division by zero')\n\n\t\t// other == 1\n\t\tif (other._high == 0 && other._low == 1) {\n\t\t\tthis.remainder = new UINT32(0)\n\t\t\treturn this\n\t\t}\n\n\t\t// other > this: 0\n\t\tif ( other.gt(this) ) {\n\t\t\tthis.remainder = this.clone()\n\t\t\tthis._low = 0\n\t\t\tthis._high = 0\n\t\t\treturn this\n\t\t}\n\t\t// other == this: 1\n\t\tif ( this.eq(other) ) {\n\t\t\tthis.remainder = new UINT32(0)\n\t\t\tthis._low = 1\n\t\t\tthis._high = 0\n\t\t\treturn this\n\t\t}\n\n\t\t// Shift the divisor left until it is higher than the dividend\n\t\tvar _other = other.clone()\n\t\tvar i = -1\n\t\twhile ( !this.lt(_other) ) {\n\t\t\t// High bit can overflow the default 16bits\n\t\t\t// Its ok since we right shift after this loop\n\t\t\t// The overflown bit must be kept though\n\t\t\t_other.shiftLeft(1, true)\n\t\t\ti++\n\t\t}\n\n\t\t// Set the remainder\n\t\tthis.remainder = this.clone()\n\t\t// Initialize the current result to 0\n\t\tthis._low = 0\n\t\tthis._high = 0\n\t\tfor (; i >= 0; i--) {\n\t\t\t_other.shiftRight(1)\n\t\t\t// If shifted divisor is smaller than the dividend\n\t\t\t// then subtract it from the dividend\n\t\t\tif ( !this.remainder.lt(_other) ) {\n\t\t\t\tthis.remainder.subtract(_other)\n\t\t\t\t// Update the current result\n\t\t\t\tif (i >= 16) {\n\t\t\t\t\tthis._high |= 1 << (i - 16)\n\t\t\t\t} else {\n\t\t\t\t\tthis._low |= 1 << i\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Negate the current _UINT32_\n\t * @method negate\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.negate = function () {\n\t\tvar v = ( ~this._low & 0xFFFF ) + 1\n\t\tthis._low = v & 0xFFFF\n\t\tthis._high = (~this._high + (v >>> 16)) & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Equals\n\t * @method eq\n\t * @param {Object} other UINT32\n\t * @return {Boolean}\n\t */\n\tUINT32.prototype.equals = UINT32.prototype.eq = function (other) {\n\t\treturn (this._low == other._low) && (this._high == other._high)\n\t}\n\n\t/**\n\t * Greater than (strict)\n\t * @method gt\n\t * @param {Object} other UINT32\n\t * @return {Boolean}\n\t */\n\tUINT32.prototype.greaterThan = UINT32.prototype.gt = function (other) {\n\t\tif (this._high > other._high) return true\n\t\tif (this._high < other._high) return false\n\t\treturn this._low > other._low\n\t}\n\n\t/**\n\t * Less than (strict)\n\t * @method lt\n\t * @param {Object} other UINT32\n\t * @return {Boolean}\n\t */\n\tUINT32.prototype.lessThan = UINT32.prototype.lt = function (other) {\n\t\tif (this._high < other._high) return true\n\t\tif (this._high > other._high) return false\n\t\treturn this._low < other._low\n\t}\n\n\t/**\n\t * Bitwise OR\n\t * @method or\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.or = function (other) {\n\t\tthis._low |= other._low\n\t\tthis._high |= other._high\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise AND\n\t * @method and\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.and = function (other) {\n\t\tthis._low &= other._low\n\t\tthis._high &= other._high\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise NOT\n\t * @method not\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.not = function() {\n\t\tthis._low = ~this._low & 0xFFFF\n\t\tthis._high = ~this._high & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise XOR\n\t * @method xor\n\t * @param {Object} other UINT32\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.xor = function (other) {\n\t\tthis._low ^= other._low\n\t\tthis._high ^= other._high\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise shift right\n\t * @method shiftRight\n\t * @param {Number} number of bits to shift\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.shiftRight = UINT32.prototype.shiftr = function (n) {\n\t\tif (n > 16) {\n\t\t\tthis._low = this._high >> (n - 16)\n\t\t\tthis._high = 0\n\t\t} else if (n == 16) {\n\t\t\tthis._low = this._high\n\t\t\tthis._high = 0\n\t\t} else {\n\t\t\tthis._low = (this._low >> n) | ( (this._high << (16-n)) & 0xFFFF )\n\t\t\tthis._high >>= n\n\t\t}\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise shift left\n\t * @method shiftLeft\n\t * @param {Number} number of bits to shift\n\t * @param {Boolean} allow overflow\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.shiftLeft = UINT32.prototype.shiftl = function (n, allowOverflow) {\n\t\tif (n > 16) {\n\t\t\tthis._high = this._low << (n - 16)\n\t\t\tthis._low = 0\n\t\t\tif (!allowOverflow) {\n\t\t\t\tthis._high &= 0xFFFF\n\t\t\t}\n\t\t} else if (n == 16) {\n\t\t\tthis._high = this._low\n\t\t\tthis._low = 0\n\t\t} else {\n\t\t\tthis._high = (this._high << n) | (this._low >> (16-n))\n\t\t\tthis._low = (this._low << n) & 0xFFFF\n\t\t\tif (!allowOverflow) {\n\t\t\t\t// Overflow only allowed on the high bits...\n\t\t\t\tthis._high &= 0xFFFF\n\t\t\t}\n\t\t}\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise rotate left\n\t * @method rotl\n\t * @param {Number} number of bits to rotate\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.rotateLeft = UINT32.prototype.rotl = function (n) {\n\t\tvar v = (this._high << 16) | this._low\n\t\tv = (v << n) | (v >>> (32 - n))\n\t\tthis._low = v & 0xFFFF\n\t\tthis._high = v >>> 16\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise rotate right\n\t * @method rotr\n\t * @param {Number} number of bits to rotate\n\t * @return ThisExpression\n\t */\n\tUINT32.prototype.rotateRight = UINT32.prototype.rotr = function (n) {\n\t\tvar v = (this._high << 16) | this._low\n\t\tv = (v >>> n) | (v << (32 - n))\n\t\tthis._low = v & 0xFFFF\n\t\tthis._high = v >>> 16\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Clone the current _UINT32_\n\t * @method clone\n\t * @return {Object} cloned UINT32\n\t */\n\tUINT32.prototype.clone = function () {\n\t\treturn new UINT32(this._low, this._high)\n\t}\n\n\tif (typeof define != 'undefined' && define.amd) {\n\t\t// AMD / RequireJS\n\t\tdefine([], function () {\n\t\t\treturn UINT32\n\t\t})\n\t} else if (typeof module != 'undefined' && module.exports) {\n\t\t// Node.js\n\t\tmodule.exports = UINT32\n\t} else {\n\t\t// Browser\n\t\troot['UINT32'] = UINT32\n\t}\n\n})(this)\n", "/**\n\tC-like unsigned 64 bits integers in Javascript\n\tCopyright (C) 2013, Pierre Curto\n\tMIT license\n */\n;(function (root) {\n\n\t// Local cache for typical radices\n\tvar radixPowerCache = {\n\t\t16: UINT64( Math.pow(16, 5) )\n\t,\t10: UINT64( Math.pow(10, 5) )\n\t,\t2: UINT64( Math.pow(2, 5) )\n\t}\n\tvar radixCache = {\n\t\t16: UINT64(16)\n\t,\t10: UINT64(10)\n\t,\t2: UINT64(2)\n\t}\n\n\t/**\n\t *\tRepresents an unsigned 64 bits integer\n\t * @constructor\n\t * @param {Number} first low bits (8)\n\t * @param {Number} second low bits (8)\n\t * @param {Number} first high bits (8)\n\t * @param {Number} second high bits (8)\n\t * or\n\t * @param {Number} low bits (32)\n\t * @param {Number} high bits (32)\n\t * or\n\t * @param {String|Number} integer as a string \t\t | integer as a number\n\t * @param {Number|Undefined} radix (optional, default=10)\n\t * @return \n\t */\n\tfunction UINT64 (a00, a16, a32, a48) {\n\t\tif ( !(this instanceof UINT64) )\n\t\t\treturn new UINT64(a00, a16, a32, a48)\n\n\t\tthis.remainder = null\n\t\tif (typeof a00 == 'string')\n\t\t\treturn fromString.call(this, a00, a16)\n\n\t\tif (typeof a16 == 'undefined')\n\t\t\treturn fromNumber.call(this, a00)\n\n\t\tfromBits.apply(this, arguments)\n\t}\n\n\t/**\n\t * Set the current _UINT64_ object with its low and high bits\n\t * @method fromBits\n\t * @param {Number} first low bits (8)\n\t * @param {Number} second low bits (8)\n\t * @param {Number} first high bits (8)\n\t * @param {Number} second high bits (8)\n\t * or\n\t * @param {Number} low bits (32)\n\t * @param {Number} high bits (32)\n\t * @return ThisExpression\n\t */\n\tfunction fromBits (a00, a16, a32, a48) {\n\t\tif (typeof a32 == 'undefined') {\n\t\t\tthis._a00 = a00 & 0xFFFF\n\t\t\tthis._a16 = a00 >>> 16\n\t\t\tthis._a32 = a16 & 0xFFFF\n\t\t\tthis._a48 = a16 >>> 16\n\t\t\treturn this\n\t\t}\n\n\t\tthis._a00 = a00 | 0\n\t\tthis._a16 = a16 | 0\n\t\tthis._a32 = a32 | 0\n\t\tthis._a48 = a48 | 0\n\n\t\treturn this\n\t}\n\tUINT64.prototype.fromBits = fromBits\n\n\t/**\n\t * Set the current _UINT64_ object from a number\n\t * @method fromNumber\n\t * @param {Number} number\n\t * @return ThisExpression\n\t */\n\tfunction fromNumber (value) {\n\t\tthis._a00 = value & 0xFFFF\n\t\tthis._a16 = value >>> 16\n\t\tthis._a32 = 0\n\t\tthis._a48 = 0\n\n\t\treturn this\n\t}\n\tUINT64.prototype.fromNumber = fromNumber\n\n\t/**\n\t * Set the current _UINT64_ object from a string\n\t * @method fromString\n\t * @param {String} integer as a string\n\t * @param {Number} radix (optional, default=10)\n\t * @return ThisExpression\n\t */\n\tfunction fromString (s, radix) {\n\t\tradix = radix || 10\n\n\t\tthis._a00 = 0\n\t\tthis._a16 = 0\n\t\tthis._a32 = 0\n\t\tthis._a48 = 0\n\n\t\t/*\n\t\t\tIn Javascript, bitwise operators only operate on the first 32 bits \n\t\t\tof a number, even though parseInt() encodes numbers with a 53 bits \n\t\t\tmantissa.\n\t\t\tTherefore UINT64(<Number>) can only work on 32 bits.\n\t\t\tThe radix maximum value is 36 (as per ECMA specs) (26 letters + 10 digits)\n\t\t\tmaximum input value is m = 32bits as 1 = 2^32 - 1\n\t\t\tSo the maximum substring length n is:\n\t\t\t36^(n+1) - 1 = 2^32 - 1\n\t\t\t36^(n+1) = 2^32\n\t\t\t(n+1)ln(36) = 32ln(2)\n\t\t\tn = 32ln(2)/ln(36) - 1\n\t\t\tn = 5.189644915687692\n\t\t\tn = 5\n\t\t */\n\t\tvar radixUint = radixPowerCache[radix] || new UINT64( Math.pow(radix, 5) )\n\n\t\tfor (var i = 0, len = s.length; i < len; i += 5) {\n\t\t\tvar size = Math.min(5, len - i)\n\t\t\tvar value = parseInt( s.slice(i, i + size), radix )\n\t\t\tthis.multiply(\n\t\t\t\t\tsize < 5\n\t\t\t\t\t\t? new UINT64( Math.pow(radix, size) )\n\t\t\t\t\t\t: radixUint\n\t\t\t\t)\n\t\t\t\t.add( new UINT64(value) )\n\t\t}\n\n\t\treturn this\n\t}\n\tUINT64.prototype.fromString = fromString\n\n\t/**\n\t * Convert this _UINT64_ to a number (last 32 bits are dropped)\n\t * @method toNumber\n\t * @return {Number} the converted UINT64\n\t */\n\tUINT64.prototype.toNumber = function () {\n\t\treturn (this._a16 * 65536) + this._a00\n\t}\n\n\t/**\n\t * Convert this _UINT64_ to a string\n\t * @method toString\n\t * @param {Number} radix (optional, default=10)\n\t * @return {String} the converted UINT64\n\t */\n\tUINT64.prototype.toString = function (radix) {\n\t\tradix = radix || 10\n\t\tvar radixUint = radixCache[radix] || new UINT64(radix)\n\n\t\tif ( !this.gt(radixUint) ) return this.toNumber().toString(radix)\n\n\t\tvar self = this.clone()\n\t\tvar res = new Array(64)\n\t\tfor (var i = 63; i >= 0; i--) {\n\t\t\tself.div(radixUint)\n\t\t\tres[i] = self.remainder.toNumber().toString(radix)\n\t\t\tif ( !self.gt(radixUint) ) break\n\t\t}\n\t\tres[i-1] = self.toNumber().toString(radix)\n\n\t\treturn res.join('')\n\t}\n\n\t/**\n\t * Add two _UINT64_. The current _UINT64_ stores the result\n\t * @method add\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.add = function (other) {\n\t\tvar a00 = this._a00 + other._a00\n\n\t\tvar a16 = a00 >>> 16\n\t\ta16 += this._a16 + other._a16\n\n\t\tvar a32 = a16 >>> 16\n\t\ta32 += this._a32 + other._a32\n\n\t\tvar a48 = a32 >>> 16\n\t\ta48 += this._a48 + other._a48\n\n\t\tthis._a00 = a00 & 0xFFFF\n\t\tthis._a16 = a16 & 0xFFFF\n\t\tthis._a32 = a32 & 0xFFFF\n\t\tthis._a48 = a48 & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Subtract two _UINT64_. The current _UINT64_ stores the result\n\t * @method subtract\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.subtract = function (other) {\n\t\treturn this.add( other.clone().negate() )\n\t}\n\n\t/**\n\t * Multiply two _UINT64_. The current _UINT64_ stores the result\n\t * @method multiply\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.multiply = function (other) {\n\t\t/*\n\t\t\ta = a00 + a16 + a32 + a48\n\t\t\tb = b00 + b16 + b32 + b48\n\t\t\ta*b = (a00 + a16 + a32 + a48)(b00 + b16 + b32 + b48)\n\t\t\t\t= a00b00 + a00b16 + a00b32 + a00b48\n\t\t\t\t+ a16b00 + a16b16 + a16b32 + a16b48\n\t\t\t\t+ a32b00 + a32b16 + a32b32 + a32b48\n\t\t\t\t+ a48b00 + a48b16 + a48b32 + a48b48\n\n\t\t\ta16b48, a32b32, a48b16, a48b32 and a48b48 overflow the 64 bits\n\t\t\tso it comes down to:\n\t\t\ta*b\t= a00b00 + a00b16 + a00b32 + a00b48\n\t\t\t\t+ a16b00 + a16b16 + a16b32\n\t\t\t\t+ a32b00 + a32b16\n\t\t\t\t+ a48b00\n\t\t\t\t= a00b00\n\t\t\t\t+ a00b16 + a16b00\n\t\t\t\t+ a00b32 + a16b16 + a32b00\n\t\t\t\t+ a00b48 + a16b32 + a32b16 + a48b00\n\t\t */\n\t\tvar a00 = this._a00\n\t\tvar a16 = this._a16\n\t\tvar a32 = this._a32\n\t\tvar a48 = this._a48\n\t\tvar b00 = other._a00\n\t\tvar b16 = other._a16\n\t\tvar b32 = other._a32\n\t\tvar b48 = other._a48\n\n\t\tvar c00 = a00 * b00\n\n\t\tvar c16 = c00 >>> 16\n\t\tc16 += a00 * b16\n\t\tvar c32 = c16 >>> 16\n\t\tc16 &= 0xFFFF\n\t\tc16 += a16 * b00\n\n\t\tc32 += c16 >>> 16\n\t\tc32 += a00 * b32\n\t\tvar c48 = c32 >>> 16\n\t\tc32 &= 0xFFFF\n\t\tc32 += a16 * b16\n\t\tc48 += c32 >>> 16\n\t\tc32 &= 0xFFFF\n\t\tc32 += a32 * b00\n\n\t\tc48 += c32 >>> 16\n\t\tc48 += a00 * b48\n\t\tc48 &= 0xFFFF\n\t\tc48 += a16 * b32\n\t\tc48 &= 0xFFFF\n\t\tc48 += a32 * b16\n\t\tc48 &= 0xFFFF\n\t\tc48 += a48 * b00\n\n\t\tthis._a00 = c00 & 0xFFFF\n\t\tthis._a16 = c16 & 0xFFFF\n\t\tthis._a32 = c32 & 0xFFFF\n\t\tthis._a48 = c48 & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Divide two _UINT64_. The current _UINT64_ stores the result.\n\t * The remainder is made available as the _remainder_ property on\n\t * the _UINT64_ object. It can be null, meaning there are no remainder.\n\t * @method div\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.div = function (other) {\n\t\tif ( (other._a16 == 0) && (other._a32 == 0) && (other._a48 == 0) ) {\n\t\t\tif (other._a00 == 0) throw Error('division by zero')\n\n\t\t\t// other == 1: this\n\t\t\tif (other._a00 == 1) {\n\t\t\t\tthis.remainder = new UINT64(0)\n\t\t\t\treturn this\n\t\t\t}\n\t\t}\n\n\t\t// other > this: 0\n\t\tif ( other.gt(this) ) {\n\t\t\tthis.remainder = this.clone()\n\t\t\tthis._a00 = 0\n\t\t\tthis._a16 = 0\n\t\t\tthis._a32 = 0\n\t\t\tthis._a48 = 0\n\t\t\treturn this\n\t\t}\n\t\t// other == this: 1\n\t\tif ( this.eq(other) ) {\n\t\t\tthis.remainder = new UINT64(0)\n\t\t\tthis._a00 = 1\n\t\t\tthis._a16 = 0\n\t\t\tthis._a32 = 0\n\t\t\tthis._a48 = 0\n\t\t\treturn this\n\t\t}\n\n\t\t// Shift the divisor left until it is higher than the dividend\n\t\tvar _other = other.clone()\n\t\tvar i = -1\n\t\twhile ( !this.lt(_other) ) {\n\t\t\t// High bit can overflow the default 16bits\n\t\t\t// Its ok since we right shift after this loop\n\t\t\t// The overflown bit must be kept though\n\t\t\t_other.shiftLeft(1, true)\n\t\t\ti++\n\t\t}\n\n\t\t// Set the remainder\n\t\tthis.remainder = this.clone()\n\t\t// Initialize the current result to 0\n\t\tthis._a00 = 0\n\t\tthis._a16 = 0\n\t\tthis._a32 = 0\n\t\tthis._a48 = 0\n\t\tfor (; i >= 0; i--) {\n\t\t\t_other.shiftRight(1)\n\t\t\t// If shifted divisor is smaller than the dividend\n\t\t\t// then subtract it from the dividend\n\t\t\tif ( !this.remainder.lt(_other) ) {\n\t\t\t\tthis.remainder.subtract(_other)\n\t\t\t\t// Update the current result\n\t\t\t\tif (i >= 48) {\n\t\t\t\t\tthis._a48 |= 1 << (i - 48)\n\t\t\t\t} else if (i >= 32) {\n\t\t\t\t\tthis._a32 |= 1 << (i - 32)\n\t\t\t\t} else if (i >= 16) {\n\t\t\t\t\tthis._a16 |= 1 << (i - 16)\n\t\t\t\t} else {\n\t\t\t\t\tthis._a00 |= 1 << i\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Negate the current _UINT64_\n\t * @method negate\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.negate = function () {\n\t\tvar v = ( ~this._a00 & 0xFFFF ) + 1\n\t\tthis._a00 = v & 0xFFFF\n\t\tv = (~this._a16 & 0xFFFF) + (v >>> 16)\n\t\tthis._a16 = v & 0xFFFF\n\t\tv = (~this._a32 & 0xFFFF) + (v >>> 16)\n\t\tthis._a32 = v & 0xFFFF\n\t\tthis._a48 = (~this._a48 + (v >>> 16)) & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\n\t * @method eq\n\t * @param {Object} other UINT64\n\t * @return {Boolean}\n\t */\n\tUINT64.prototype.equals = UINT64.prototype.eq = function (other) {\n\t\treturn (this._a48 == other._a48) && (this._a00 == other._a00)\n\t\t\t && (this._a32 == other._a32) && (this._a16 == other._a16)\n\t}\n\n\t/**\n\t * Greater than (strict)\n\t * @method gt\n\t * @param {Object} other UINT64\n\t * @return {Boolean}\n\t */\n\tUINT64.prototype.greaterThan = UINT64.prototype.gt = function (other) {\n\t\tif (this._a48 > other._a48) return true\n\t\tif (this._a48 < other._a48) return false\n\t\tif (this._a32 > other._a32) return true\n\t\tif (this._a32 < other._a32) return false\n\t\tif (this._a16 > other._a16) return true\n\t\tif (this._a16 < other._a16) return false\n\t\treturn this._a00 > other._a00\n\t}\n\n\t/**\n\t * Less than (strict)\n\t * @method lt\n\t * @param {Object} other UINT64\n\t * @return {Boolean}\n\t */\n\tUINT64.prototype.lessThan = UINT64.prototype.lt = function (other) {\n\t\tif (this._a48 < other._a48) return true\n\t\tif (this._a48 > other._a48) return false\n\t\tif (this._a32 < other._a32) return true\n\t\tif (this._a32 > other._a32) return false\n\t\tif (this._a16 < other._a16) return true\n\t\tif (this._a16 > other._a16) return false\n\t\treturn this._a00 < other._a00\n\t}\n\n\t/**\n\t * Bitwise OR\n\t * @method or\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.or = function (other) {\n\t\tthis._a00 |= other._a00\n\t\tthis._a16 |= other._a16\n\t\tthis._a32 |= other._a32\n\t\tthis._a48 |= other._a48\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise AND\n\t * @method and\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.and = function (other) {\n\t\tthis._a00 &= other._a00\n\t\tthis._a16 &= other._a16\n\t\tthis._a32 &= other._a32\n\t\tthis._a48 &= other._a48\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise XOR\n\t * @method xor\n\t * @param {Object} other UINT64\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.xor = function (other) {\n\t\tthis._a00 ^= other._a00\n\t\tthis._a16 ^= other._a16\n\t\tthis._a32 ^= other._a32\n\t\tthis._a48 ^= other._a48\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise NOT\n\t * @method not\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.not = function() {\n\t\tthis._a00 = ~this._a00 & 0xFFFF\n\t\tthis._a16 = ~this._a16 & 0xFFFF\n\t\tthis._a32 = ~this._a32 & 0xFFFF\n\t\tthis._a48 = ~this._a48 & 0xFFFF\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise shift right\n\t * @method shiftRight\n\t * @param {Number} number of bits to shift\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.shiftRight = UINT64.prototype.shiftr = function (n) {\n\t\tn %= 64\n\t\tif (n >= 48) {\n\t\t\tthis._a00 = this._a48 >> (n - 48)\n\t\t\tthis._a16 = 0\n\t\t\tthis._a32 = 0\n\t\t\tthis._a48 = 0\n\t\t} else if (n >= 32) {\n\t\t\tn -= 32\n\t\t\tthis._a00 = ( (this._a32 >> n) | (this._a48 << (16-n)) ) & 0xFFFF\n\t\t\tthis._a16 = (this._a48 >> n) & 0xFFFF\n\t\t\tthis._a32 = 0\n\t\t\tthis._a48 = 0\n\t\t} else if (n >= 16) {\n\t\t\tn -= 16\n\t\t\tthis._a00 = ( (this._a16 >> n) | (this._a32 << (16-n)) ) & 0xFFFF\n\t\t\tthis._a16 = ( (this._a32 >> n) | (this._a48 << (16-n)) ) & 0xFFFF\n\t\t\tthis._a32 = (this._a48 >> n) & 0xFFFF\n\t\t\tthis._a48 = 0\n\t\t} else {\n\t\t\tthis._a00 = ( (this._a00 >> n) | (this._a16 << (16-n)) ) & 0xFFFF\n\t\t\tthis._a16 = ( (this._a16 >> n) | (this._a32 << (16-n)) ) & 0xFFFF\n\t\t\tthis._a32 = ( (this._a32 >> n) | (this._a48 << (16-n)) ) & 0xFFFF\n\t\t\tthis._a48 = (this._a48 >> n) & 0xFFFF\n\t\t}\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise shift left\n\t * @method shiftLeft\n\t * @param {Number} number of bits to shift\n\t * @param {Boolean} allow overflow\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.shiftLeft = UINT64.prototype.shiftl = function (n, allowOverflow) {\n\t\tn %= 64\n\t\tif (n >= 48) {\n\t\t\tthis._a48 = this._a00 << (n - 48)\n\t\t\tthis._a32 = 0\n\t\t\tthis._a16 = 0\n\t\t\tthis._a00 = 0\n\t\t} else if (n >= 32) {\n\t\t\tn -= 32\n\t\t\tthis._a48 = (this._a16 << n) | (this._a00 >> (16-n))\n\t\t\tthis._a32 = (this._a00 << n) & 0xFFFF\n\t\t\tthis._a16 = 0\n\t\t\tthis._a00 = 0\n\t\t} else if (n >= 16) {\n\t\t\tn -= 16\n\t\t\tthis._a48 = (this._a32 << n) | (this._a16 >> (16-n))\n\t\t\tthis._a32 = ( (this._a16 << n) | (this._a00 >> (16-n)) ) & 0xFFFF\n\t\t\tthis._a16 = (this._a00 << n) & 0xFFFF\n\t\t\tthis._a00 = 0\n\t\t} else {\n\t\t\tthis._a48 = (this._a48 << n) | (this._a32 >> (16-n))\n\t\t\tthis._a32 = ( (this._a32 << n) | (this._a16 >> (16-n)) ) & 0xFFFF\n\t\t\tthis._a16 = ( (this._a16 << n) | (this._a00 >> (16-n)) ) & 0xFFFF\n\t\t\tthis._a00 = (this._a00 << n) & 0xFFFF\n\t\t}\n\t\tif (!allowOverflow) {\n\t\t\tthis._a48 &= 0xFFFF\n\t\t}\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise rotate left\n\t * @method rotl\n\t * @param {Number} number of bits to rotate\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.rotateLeft = UINT64.prototype.rotl = function (n) {\n\t\tn %= 64\n\t\tif (n == 0) return this\n\t\tif (n >= 32) {\n\t\t\t// A.B.C.D\n\t\t\t// B.C.D.A rotl(16)\n\t\t\t// C.D.A.B rotl(32)\n\t\t\tvar v = this._a00\n\t\t\tthis._a00 = this._a32\n\t\t\tthis._a32 = v\n\t\t\tv = this._a48\n\t\t\tthis._a48 = this._a16\n\t\t\tthis._a16 = v\n\t\t\tif (n == 32) return this\n\t\t\tn -= 32\n\t\t}\n\n\t\tvar high = (this._a48 << 16) | this._a32\n\t\tvar low = (this._a16 << 16) | this._a00\n\n\t\tvar _high = (high << n) | (low >>> (32 - n))\n\t\tvar _low = (low << n) | (high >>> (32 - n))\n\n\t\tthis._a00 = _low & 0xFFFF\n\t\tthis._a16 = _low >>> 16\n\t\tthis._a32 = _high & 0xFFFF\n\t\tthis._a48 = _high >>> 16\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Bitwise rotate right\n\t * @method rotr\n\t * @param {Number} number of bits to rotate\n\t * @return ThisExpression\n\t */\n\tUINT64.prototype.rotateRight = UINT64.prototype.rotr = function (n) {\n\t\tn %= 64\n\t\tif (n == 0) return this\n\t\tif (n >= 32) {\n\t\t\t// A.B.C.D\n\t\t\t// D.A.B.C rotr(16)\n\t\t\t// C.D.A.B rotr(32)\n\t\t\tvar v = this._a00\n\t\t\tthis._a00 = this._a32\n\t\t\tthis._a32 = v\n\t\t\tv = this._a48\n\t\t\tthis._a48 = this._a16\n\t\t\tthis._a16 = v\n\t\t\tif (n == 32) return this\n\t\t\tn -= 32\n\t\t}\n\n\t\tvar high = (this._a48 << 16) | this._a32\n\t\tvar low = (this._a16 << 16) | this._a00\n\n\t\tvar _high = (high >>> n) | (low << (32 - n))\n\t\tvar _low = (low >>> n) | (high << (32 - n))\n\n\t\tthis._a00 = _low & 0xFFFF\n\t\tthis._a16 = _low >>> 16\n\t\tthis._a32 = _high & 0xFFFF\n\t\tthis._a48 = _high >>> 16\n\n\t\treturn this\n\t}\n\n\t/**\n\t * Clone the current _UINT64_\n\t * @method clone\n\t * @return {Object} cloned UINT64\n\t */\n\tUINT64.prototype.clone = function () {\n\t\treturn new UINT64(this._a00, this._a16, this._a32, this._a48)\n\t}\n\n\tif (typeof define != 'undefined' && define.amd) {\n\t\t// AMD / RequireJS\n\t\tdefine([], function () {\n\t\t\treturn UINT64\n\t\t})\n\t} else if (typeof module != 'undefined' && module.exports) {\n\t\t// Node.js\n\t\tmodule.exports = UINT64\n\t} else {\n\t\t// Browser\n\t\troot['UINT64'] = UINT64\n\t}\n\n})(this)\n", "exports.UINT32 = require('./lib/uint32')\nexports.UINT64 = require('./lib/uint64')", "/**\nxxHash implementation in pure Javascript\n\nCopyright (C) 2013, Pierre Curto\nMIT license\n*/\nvar UINT32 = require('cuint').UINT32\n\n/*\n\tMerged this sequence of method calls as it speeds up\n\tthe calculations by a factor of 2\n */\n// this.v1.add( other.multiply(PRIME32_2) ).rotl(13).multiply(PRIME32_1);\nUINT32.prototype.xxh_update = function (low, high) {\n\tvar b00 = PRIME32_2._low\n\tvar b16 = PRIME32_2._high\n\n\tvar c16, c00\n\tc00 = low * b00\n\tc16 = c00 >>> 16\n\n\tc16 += high * b00\n\tc16 &= 0xFFFF\t\t// Not required but improves performance\n\tc16 += low * b16\n\n\tvar a00 = this._low + (c00 & 0xFFFF)\n\tvar a16 = a00 >>> 16\n\n\ta16 += this._high + (c16 & 0xFFFF)\n\n\tvar v = (a16 << 16) | (a00 & 0xFFFF)\n\tv = (v << 13) | (v >>> 19)\n\n\ta00 = v & 0xFFFF\n\ta16 = v >>> 16\n\n\tb00 = PRIME32_1._low\n\tb16 = PRIME32_1._high\n\n\tc00 = a00 * b00\n\tc16 = c00 >>> 16\n\n\tc16 += a16 * b00\n\tc16 &= 0xFFFF\t\t// Not required but improves performance\n\tc16 += a00 * b16\n\n\tthis._low = c00 & 0xFFFF\n\tthis._high = c16 & 0xFFFF\n}\n\n/*\n * Constants\n */\nvar PRIME32_1 = UINT32( '2654435761' )\nvar PRIME32_2 = UINT32( '2246822519' )\nvar PRIME32_3 = UINT32( '3266489917' )\nvar PRIME32_4 = UINT32( '668265263' )\nvar PRIME32_5 = UINT32( '374761393' )\n\n/**\n* Convert string to proper UTF-8 array\n* @param str Input string\n* @returns {Uint8Array} UTF8 array is returned as uint8 array\n*/\nfunction toUTF8Array (str) {\n\tvar utf8 = []\n\tfor (var i=0, n=str.length; i < n; i++) {\n\t\tvar charcode = str.charCodeAt(i)\n\t\tif (charcode < 0x80) utf8.push(charcode)\n\t\telse if (charcode < 0x800) {\n\t\t\tutf8.push(0xc0 | (charcode >> 6),\n\t\t\t0x80 | (charcode & 0x3f))\n\t\t}\n\t\telse if (charcode < 0xd800 || charcode >= 0xe000) {\n\t\t\tutf8.push(0xe0 | (charcode >> 12),\n\t\t\t0x80 | ((charcode>>6) & 0x3f),\n\t\t\t0x80 | (charcode & 0x3f))\n\t\t}\n\t\t// surrogate pair\n\t\telse {\n\t\t\ti++;\n\t\t\t// UTF-16 encodes 0x10000-0x10FFFF by\n\t\t\t// subtracting 0x10000 and splitting the\n\t\t\t// 20 bits of 0x0-0xFFFFF into two halves\n\t\t\tcharcode = 0x10000 + (((charcode & 0x3ff)<<10)\n\t\t\t| (str.charCodeAt(i) & 0x3ff))\n\t\t\tutf8.push(0xf0 | (charcode >>18),\n\t\t\t0x80 | ((charcode>>12) & 0x3f),\n\t\t\t0x80 | ((charcode>>6) & 0x3f),\n\t\t\t0x80 | (charcode & 0x3f))\n\t\t}\n\t}\n\n\treturn new Uint8Array(utf8)\n}\n\n/**\n * XXH object used as a constructor or a function\n * @constructor\n * or\n * @param {Object|String} input data\n * @param {Number|UINT32} seed\n * @return ThisExpression\n * or\n * @return {UINT32} xxHash\n */\nfunction XXH () {\n\tif (arguments.length == 2)\n\t\treturn new XXH( arguments[1] ).update( arguments[0] ).digest()\n\n\tif (!(this instanceof XXH))\n\t\treturn new XXH( arguments[0] )\n\n\tinit.call(this, arguments[0])\n}\n\n/**\n * Initialize the XXH instance with the given seed\n * @method init\n * @param {Number|Object} seed as a number or an unsigned 32 bits integer\n * @return ThisExpression\n */\n function init (seed) {\n\tthis.seed = seed instanceof UINT32 ? seed.clone() : UINT32(seed)\n\tthis.v1 = this.seed.clone().add(PRIME32_1).add(PRIME32_2)\n\tthis.v2 = this.seed.clone().add(PRIME32_2)\n\tthis.v3 = this.seed.clone()\n\tthis.v4 = this.seed.clone().subtract(PRIME32_1)\n\tthis.total_len = 0\n\tthis.memsize = 0\n\tthis.memory = null\n\n\treturn this\n}\nXXH.prototype.init = init\n\n/**\n * Add data to be computed for the XXH hash\n * @method update\n * @param {String|Buffer|ArrayBuffer} input as a string or nodejs Buffer or ArrayBuffer\n * @return ThisExpression\n */\nXXH.prototype.update = function (input) {\n\tvar isString = typeof input == 'string'\n\tvar isArrayBuffer\n\n\t// Convert all strings to utf-8 first (issue #5)\n\tif (isString) {\n\t\tinput = toUTF8Array(input)\n\t\tisString = false\n\t\tisArrayBuffer = true\n\t}\n\n\tif (typeof ArrayBuffer !== \"undefined\" && input instanceof ArrayBuffer)\n\t{\n\t\tisArrayBuffer = true\n\t\tinput = new Uint8Array(input);\n\t}\n\n\tvar p = 0\n\tvar len = input.length\n\tvar bEnd = p + len\n\n\tif (len == 0) return this\n\n\tthis.total_len += len\n\n\tif (this.memsize == 0)\n\t{\n\t\tif (isString) {\n\t\t\tthis.memory = ''\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory = new Uint8Array(16)\n\t\t} else {\n\t\t\tthis.memory = new Buffer(16)\n\t\t}\n\t}\n\n\tif (this.memsize + len < 16) // fill in tmp buffer\n\t{\n\t\t// XXH_memcpy(this.memory + this.memsize, input, len)\n\t\tif (isString) {\n\t\t\tthis.memory += input\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory.set( input.subarray(0, len), this.memsize )\n\t\t} else {\n\t\t\tinput.copy( this.memory, this.memsize, 0, len )\n\t\t}\n\n\t\tthis.memsize += len\n\t\treturn this\n\t}\n\n\tif (this.memsize > 0) // some data left from previous update\n\t{\n\t\t// XXH_memcpy(this.memory + this.memsize, input, 16-this.memsize);\n\t\tif (isString) {\n\t\t\tthis.memory += input.slice(0, 16 - this.memsize)\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory.set( input.subarray(0, 16 - this.memsize), this.memsize )\n\t\t} else {\n\t\t\tinput.copy( this.memory, this.memsize, 0, 16 - this.memsize )\n\t\t}\n\n\t\tvar p32 = 0\n\t\tif (isString) {\n\t\t\tthis.v1.xxh_update(\n\t\t\t\t(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)\n\t\t\t,\t(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)\n\t\t\t)\n\t\t\tp32 += 4\n\t\t\tthis.v2.xxh_update(\n\t\t\t\t(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)\n\t\t\t,\t(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)\n\t\t\t)\n\t\t\tp32 += 4\n\t\t\tthis.v3.xxh_update(\n\t\t\t\t(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)\n\t\t\t,\t(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)\n\t\t\t)\n\t\t\tp32 += 4\n\t\t\tthis.v4.xxh_update(\n\t\t\t\t(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)\n\t\t\t,\t(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)\n\t\t\t)\n\t\t} else {\n\t\t\tthis.v1.xxh_update(\n\t\t\t\t(this.memory[p32+1] << 8) | this.memory[p32]\n\t\t\t,\t(this.memory[p32+3] << 8) | this.memory[p32+2]\n\t\t\t)\n\t\t\tp32 += 4\n\t\t\tthis.v2.xxh_update(\n\t\t\t\t(this.memory[p32+1] << 8) | this.memory[p32]\n\t\t\t,\t(this.memory[p32+3] << 8) | this.memory[p32+2]\n\t\t\t)\n\t\t\tp32 += 4\n\t\t\tthis.v3.xxh_update(\n\t\t\t\t(this.memory[p32+1] << 8) | this.memory[p32]\n\t\t\t,\t(this.memory[p32+3] << 8) | this.memory[p32+2]\n\t\t\t)\n\t\t\tp32 += 4\n\t\t\tthis.v4.xxh_update(\n\t\t\t\t(this.memory[p32+1] << 8) | this.memory[p32]\n\t\t\t,\t(this.memory[p32+3] << 8) | this.memory[p32+2]\n\t\t\t)\n\t\t}\n\n\t\tp += 16 - this.memsize\n\t\tthis.memsize = 0\n\t\tif (isString) this.memory = ''\n\t}\n\n\tif (p <= bEnd - 16)\n\t{\n\t\tvar limit = bEnd - 16\n\n\t\tdo\n\t\t{\n\t\t\tif (isString) {\n\t\t\t\tthis.v1.xxh_update(\n\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t)\n\t\t\t\tp += 4\n\t\t\t\tthis.v2.xxh_update(\n\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t)\n\t\t\t\tp += 4\n\t\t\t\tthis.v3.xxh_update(\n\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t)\n\t\t\t\tp += 4\n\t\t\t\tthis.v4.xxh_update(\n\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t)\n\t\t\t} else {\n\t\t\t\tthis.v1.xxh_update(\n\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t)\n\t\t\t\tp += 4\n\t\t\t\tthis.v2.xxh_update(\n\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t)\n\t\t\t\tp += 4\n\t\t\t\tthis.v3.xxh_update(\n\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t)\n\t\t\t\tp += 4\n\t\t\t\tthis.v4.xxh_update(\n\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t)\n\t\t\t}\n\t\t\tp += 4\n\t\t} while (p <= limit)\n\t}\n\n\tif (p < bEnd)\n\t{\n\t\t// XXH_memcpy(this.memory, p, bEnd-p);\n\t\tif (isString) {\n\t\t\tthis.memory += input.slice(p)\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory.set( input.subarray(p, bEnd), this.memsize )\n\t\t} else {\n\t\t\tinput.copy( this.memory, this.memsize, p, bEnd )\n\t\t}\n\n\t\tthis.memsize = bEnd - p\n\t}\n\n\treturn this\n}\n\n/**\n * Finalize the XXH computation. The XXH instance is ready for reuse for the given seed\n * @method digest\n * @return {UINT32} xxHash\n */\nXXH.prototype.digest = function () {\n\tvar input = this.memory\n\tvar isString = typeof input == 'string'\n\tvar p = 0\n\tvar bEnd = this.memsize\n\tvar h32, h\n\tvar u = new UINT32\n\n\tif (this.total_len >= 16)\n\t{\n\t\th32 = this.v1.rotl(1).add( this.v2.rotl(7).add( this.v3.rotl(12).add( this.v4.rotl(18) ) ) )\n\t}\n\telse\n\t{\n\t\th32 = this.seed.clone().add( PRIME32_5 )\n\t}\n\n\th32.add( u.fromNumber(this.total_len) )\n\n\twhile (p <= bEnd - 4)\n\t{\n\t\tif (isString) {\n\t\t\tu.fromBits(\n\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t)\n\t\t} else {\n\t\t\tu.fromBits(\n\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t)\n\t\t}\n\t\th32\n\t\t\t.add( u.multiply(PRIME32_3) )\n\t\t\t.rotl(17)\n\t\t\t.multiply( PRIME32_4 )\n\t\tp += 4\n\t}\n\n\twhile (p < bEnd)\n\t{\n\t\tu.fromBits( isString ? input.charCodeAt(p++) : input[p++], 0 )\n\t\th32\n\t\t\t.add( u.multiply(PRIME32_5) )\n\t\t\t.rotl(11)\n\t\t\t.multiply(PRIME32_1)\n\t}\n\n\th = h32.clone().shiftRight(15)\n\th32.xor(h).multiply(PRIME32_2)\n\n\th = h32.clone().shiftRight(13)\n\th32.xor(h).multiply(PRIME32_3)\n\n\th = h32.clone().shiftRight(16)\n\th32.xor(h)\n\n\t// Reset the state\n\tthis.init( this.seed )\n\n\treturn h32\n}\n\nmodule.exports = XXH\n", "/**\nxxHash64 implementation in pure Javascript\n\nCopyright (C) 2016, Pierre Curto\nMIT license\n*/\nvar UINT64 = require('cuint').UINT64\n\n/*\n * Constants\n */\nvar PRIME64_1 = UINT64( '11400714785074694791' )\nvar PRIME64_2 = UINT64( '14029467366897019727' )\nvar PRIME64_3 = UINT64( '1609587929392839161' )\nvar PRIME64_4 = UINT64( '9650029242287828579' )\nvar PRIME64_5 = UINT64( '2870177450012600261' )\n\n/**\n* Convert string to proper UTF-8 array\n* @param str Input string\n* @returns {Uint8Array} UTF8 array is returned as uint8 array\n*/\nfunction toUTF8Array (str) {\n\tvar utf8 = []\n\tfor (var i=0, n=str.length; i < n; i++) {\n\t\tvar charcode = str.charCodeAt(i)\n\t\tif (charcode < 0x80) utf8.push(charcode)\n\t\telse if (charcode < 0x800) {\n\t\t\tutf8.push(0xc0 | (charcode >> 6),\n\t\t\t0x80 | (charcode & 0x3f))\n\t\t}\n\t\telse if (charcode < 0xd800 || charcode >= 0xe000) {\n\t\t\tutf8.push(0xe0 | (charcode >> 12),\n\t\t\t0x80 | ((charcode>>6) & 0x3f),\n\t\t\t0x80 | (charcode & 0x3f))\n\t\t}\n\t\t// surrogate pair\n\t\telse {\n\t\t\ti++;\n\t\t\t// UTF-16 encodes 0x10000-0x10FFFF by\n\t\t\t// subtracting 0x10000 and splitting the\n\t\t\t// 20 bits of 0x0-0xFFFFF into two halves\n\t\t\tcharcode = 0x10000 + (((charcode & 0x3ff)<<10)\n\t\t\t| (str.charCodeAt(i) & 0x3ff))\n\t\t\tutf8.push(0xf0 | (charcode >>18),\n\t\t\t0x80 | ((charcode>>12) & 0x3f),\n\t\t\t0x80 | ((charcode>>6) & 0x3f),\n\t\t\t0x80 | (charcode & 0x3f))\n\t\t}\n\t}\n\n\treturn new Uint8Array(utf8)\n}\n\n/**\n * XXH64 object used as a constructor or a function\n * @constructor\n * or\n * @param {Object|String} input data\n * @param {Number|UINT64} seed\n * @return ThisExpression\n * or\n * @return {UINT64} xxHash\n */\nfunction XXH64 () {\n\tif (arguments.length == 2)\n\t\treturn new XXH64( arguments[1] ).update( arguments[0] ).digest()\n\n\tif (!(this instanceof XXH64))\n\t\treturn new XXH64( arguments[0] )\n\n\tinit.call(this, arguments[0])\n}\n\n/**\n * Initialize the XXH64 instance with the given seed\n * @method init\n * @param {Number|Object} seed as a number or an unsigned 32 bits integer\n * @return ThisExpression\n */\n function init (seed) {\n\tthis.seed = seed instanceof UINT64 ? seed.clone() : UINT64(seed)\n\tthis.v1 = this.seed.clone().add(PRIME64_1).add(PRIME64_2)\n\tthis.v2 = this.seed.clone().add(PRIME64_2)\n\tthis.v3 = this.seed.clone()\n\tthis.v4 = this.seed.clone().subtract(PRIME64_1)\n\tthis.total_len = 0\n\tthis.memsize = 0\n\tthis.memory = null\n\n\treturn this\n}\nXXH64.prototype.init = init\n\n/**\n * Add data to be computed for the XXH64 hash\n * @method update\n * @param {String|Buffer|ArrayBuffer} input as a string or nodejs Buffer or ArrayBuffer\n * @return ThisExpression\n */\nXXH64.prototype.update = function (input) {\n\tvar isString = typeof input == 'string'\n\tvar isArrayBuffer\n\n\t// Convert all strings to utf-8 first (issue #5)\n\tif (isString) {\n\t\tinput = toUTF8Array(input)\n\t\tisString = false\n\t\tisArrayBuffer = true\n\t}\n\n\tif (typeof ArrayBuffer !== \"undefined\" && input instanceof ArrayBuffer)\n\t{\n\t\tisArrayBuffer = true\n\t\tinput = new Uint8Array(input);\n\t}\n\n\tvar p = 0\n\tvar len = input.length\n\tvar bEnd = p + len\n\n\tif (len == 0) return this\n\n\tthis.total_len += len\n\n\tif (this.memsize == 0)\n\t{\n\t\tif (isString) {\n\t\t\tthis.memory = ''\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory = new Uint8Array(32)\n\t\t} else {\n\t\t\tthis.memory = new Buffer(32)\n\t\t}\n\t}\n\n\tif (this.memsize + len < 32) // fill in tmp buffer\n\t{\n\t\t// XXH64_memcpy(this.memory + this.memsize, input, len)\n\t\tif (isString) {\n\t\t\tthis.memory += input\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory.set( input.subarray(0, len), this.memsize )\n\t\t} else {\n\t\t\tinput.copy( this.memory, this.memsize, 0, len )\n\t\t}\n\n\t\tthis.memsize += len\n\t\treturn this\n\t}\n\n\tif (this.memsize > 0) // some data left from previous update\n\t{\n\t\t// XXH64_memcpy(this.memory + this.memsize, input, 16-this.memsize);\n\t\tif (isString) {\n\t\t\tthis.memory += input.slice(0, 32 - this.memsize)\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory.set( input.subarray(0, 32 - this.memsize), this.memsize )\n\t\t} else {\n\t\t\tinput.copy( this.memory, this.memsize, 0, 32 - this.memsize )\n\t\t}\n\n\t\tvar p64 = 0\n\t\tif (isString) {\n\t\t\tvar other\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)\n\t\t\t\t)\n\t\t\tthis.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\tp64 += 8\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)\n\t\t\t\t)\n\t\t\tthis.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\tp64 += 8\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)\n\t\t\t\t)\n\t\t\tthis.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\tp64 += 8\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)\n\t\t\t\t,\t(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)\n\t\t\t\t)\n\t\t\tthis.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t} else {\n\t\t\tvar other\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory[p64+1] << 8) | this.memory[p64]\n\t\t\t\t,\t(this.memory[p64+3] << 8) | this.memory[p64+2]\n\t\t\t\t,\t(this.memory[p64+5] << 8) | this.memory[p64+4]\n\t\t\t\t,\t(this.memory[p64+7] << 8) | this.memory[p64+6]\n\t\t\t\t)\n\t\t\tthis.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\tp64 += 8\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory[p64+1] << 8) | this.memory[p64]\n\t\t\t\t,\t(this.memory[p64+3] << 8) | this.memory[p64+2]\n\t\t\t\t,\t(this.memory[p64+5] << 8) | this.memory[p64+4]\n\t\t\t\t,\t(this.memory[p64+7] << 8) | this.memory[p64+6]\n\t\t\t\t)\n\t\t\tthis.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\tp64 += 8\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory[p64+1] << 8) | this.memory[p64]\n\t\t\t\t,\t(this.memory[p64+3] << 8) | this.memory[p64+2]\n\t\t\t\t,\t(this.memory[p64+5] << 8) | this.memory[p64+4]\n\t\t\t\t,\t(this.memory[p64+7] << 8) | this.memory[p64+6]\n\t\t\t\t)\n\t\t\tthis.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\tp64 += 8\n\t\t\tother = UINT64(\n\t\t\t\t\t(this.memory[p64+1] << 8) | this.memory[p64]\n\t\t\t\t,\t(this.memory[p64+3] << 8) | this.memory[p64+2]\n\t\t\t\t,\t(this.memory[p64+5] << 8) | this.memory[p64+4]\n\t\t\t\t,\t(this.memory[p64+7] << 8) | this.memory[p64+6]\n\t\t\t\t)\n\t\t\tthis.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t}\n\n\t\tp += 32 - this.memsize\n\t\tthis.memsize = 0\n\t\tif (isString) this.memory = ''\n\t}\n\n\tif (p <= bEnd - 32)\n\t{\n\t\tvar limit = bEnd - 32\n\n\t\tdo\n\t\t{\n\t\t\tif (isString) {\n\t\t\t\tvar other\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t\t,\t(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)\n\t\t\t\t\t,\t(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)\n\t\t\t\t\t)\n\t\t\t\tthis.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t\tp += 8\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t\t,\t(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)\n\t\t\t\t\t,\t(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)\n\t\t\t\t\t)\n\t\t\t\tthis.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t\tp += 8\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t\t,\t(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)\n\t\t\t\t\t,\t(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)\n\t\t\t\t\t)\n\t\t\t\tthis.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t\tp += 8\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t\t\t,\t(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)\n\t\t\t\t\t,\t(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)\n\t\t\t\t\t)\n\t\t\t\tthis.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t} else {\n\t\t\t\tvar other\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t\t,\t(input[p+5] << 8) | input[p+4]\n\t\t\t\t\t,\t(input[p+7] << 8) | input[p+6]\n\t\t\t\t\t)\n\t\t\t\tthis.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t\tp += 8\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t\t,\t(input[p+5] << 8) | input[p+4]\n\t\t\t\t\t,\t(input[p+7] << 8) | input[p+6]\n\t\t\t\t\t)\n\t\t\t\tthis.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t\tp += 8\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t\t,\t(input[p+5] << 8) | input[p+4]\n\t\t\t\t\t,\t(input[p+7] << 8) | input[p+6]\n\t\t\t\t\t)\n\t\t\t\tthis.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t\tp += 8\n\t\t\t\tother = UINT64(\n\t\t\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t\t\t,\t(input[p+5] << 8) | input[p+4]\n\t\t\t\t\t,\t(input[p+7] << 8) | input[p+6]\n\t\t\t\t\t)\n\t\t\t\tthis.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);\n\t\t\t}\n\t\t\tp += 8\n\t\t} while (p <= limit)\n\t}\n\n\tif (p < bEnd)\n\t{\n\t\t// XXH64_memcpy(this.memory, p, bEnd-p);\n\t\tif (isString) {\n\t\t\tthis.memory += input.slice(p)\n\t\t} else if (isArrayBuffer) {\n\t\t\tthis.memory.set( input.subarray(p, bEnd), this.memsize )\n\t\t} else {\n\t\t\tinput.copy( this.memory, this.memsize, p, bEnd )\n\t\t}\n\n\t\tthis.memsize = bEnd - p\n\t}\n\n\treturn this\n}\n\n/**\n * Finalize the XXH64 computation. The XXH64 instance is ready for reuse for the given seed\n * @method digest\n * @return {UINT64} xxHash\n */\nXXH64.prototype.digest = function () {\n\tvar input = this.memory\n\tvar isString = typeof input == 'string'\n\tvar p = 0\n\tvar bEnd = this.memsize\n\tvar h64, h\n\tvar u = new UINT64\n\n\tif (this.total_len >= 32)\n\t{\n\t\th64 = this.v1.clone().rotl(1)\n\t\th64.add( this.v2.clone().rotl(7) )\n\t\th64.add( this.v3.clone().rotl(12) )\n\t\th64.add( this.v4.clone().rotl(18) )\n\n\t\th64.xor( this.v1.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )\n\t\th64.multiply(PRIME64_1).add(PRIME64_4)\n\n\t\th64.xor( this.v2.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )\n\t\th64.multiply(PRIME64_1).add(PRIME64_4)\n\n\t\th64.xor( this.v3.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )\n\t\th64.multiply(PRIME64_1).add(PRIME64_4)\n\n\t\th64.xor( this.v4.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )\n\t\th64.multiply(PRIME64_1).add(PRIME64_4)\n\t}\n\telse\n\t{\n\t\th64 = this.seed.clone().add( PRIME64_5 )\n\t}\n\n\th64.add( u.fromNumber(this.total_len) )\n\n\twhile (p <= bEnd - 8)\n\t{\n\t\tif (isString) {\n\t\t\tu.fromBits(\n\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t,\t(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)\n\t\t\t,\t(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)\n\t\t\t)\n\t\t} else {\n\t\t\tu.fromBits(\n\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t,\t(input[p+5] << 8) | input[p+4]\n\t\t\t,\t(input[p+7] << 8) | input[p+6]\n\t\t\t)\n\t\t}\n\t\tu.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1)\n\t\th64\n\t\t\t.xor(u)\n\t\t\t.rotl(27)\n\t\t\t.multiply( PRIME64_1 )\n\t\t\t.add( PRIME64_4 )\n\t\tp += 8\n\t}\n\n\tif (p + 4 <= bEnd) {\n\t\tif (isString) {\n\t\t\tu.fromBits(\n\t\t\t\t(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)\n\t\t\t,\t(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)\n\t\t\t,\t0\n\t\t\t,\t0\n\t\t\t)\n\t\t} else {\n\t\t\tu.fromBits(\n\t\t\t\t(input[p+1] << 8) | input[p]\n\t\t\t,\t(input[p+3] << 8) | input[p+2]\n\t\t\t,\t0\n\t\t\t,\t0\n\t\t\t)\n\t\t}\n\t\th64\n\t\t\t.xor( u.multiply(PRIME64_1) )\n\t\t\t.rotl(23)\n\t\t\t.multiply( PRIME64_2 )\n\t\t\t.add( PRIME64_3 )\n\t\tp += 4\n\t}\n\n\twhile (p < bEnd)\n\t{\n\t\tu.fromBits( isString ? input.charCodeAt(p++) : input[p++], 0, 0, 0 )\n\t\th64\n\t\t\t.xor( u.multiply(PRIME64_5) )\n\t\t\t.rotl(11)\n\t\t\t.multiply(PRIME64_1)\n\t}\n\n\th = h64.clone().shiftRight(33)\n\th64.xor(h).multiply(PRIME64_2)\n\n\th = h64.clone().shiftRight(29)\n\th64.xor(h).multiply(PRIME64_3)\n\n\th = h64.clone().shiftRight(32)\n\th64.xor(h)\n\n\t// Reset the state\n\tthis.init( this.seed )\n\n\treturn h64\n}\n\nmodule.exports = XXH64\n", "module.exports = {\n\th32: require(\"./xxhash\")\n,\th64: require(\"./xxhash64\")\n}\n", "/* file : utils.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __values = (this && this.__values) || function(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar xxhashjs_1 = __importDefault(require(\"xxhashjs\"));\nvar buffer_1 = require(\"buffer\");\n/**\n * Create a new array fill with a base value\n * @param size - The size of the array\n * @param defaultValue - The default value used to fill the array. If it's a function, it will be invoked to get the default value.\n * @return A newly allocated array\n * @memberof Utils\n */\nfunction allocateArray(size, defaultValue) {\n var array = new Array(size);\n var getDefault = (typeof defaultValue === 'function') ? defaultValue : function () { return defaultValue; };\n for (var ind = 0; ind < size; ind++) {\n array[ind] = getDefault();\n }\n return array;\n}\nexports.allocateArray = allocateArray;\n/**\n * (64-bits only) Hash a value into two values (in hex or integer format)\n * @param value - The value to hash\n * @param asInt - (optional) If True, the values will be returned as an integer. Otherwise, as hexadecimal values.\n * @param seed the seed used for hashing\n * @return The results of the hash functions applied to the value (in hex or integer)\n * @memberof Utils\n * @author Arnaud Grall & Thomas Minier\n */\nfunction hashTwice(value, asInt, seed) {\n if (asInt === undefined) {\n asInt = false;\n }\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n var f = xxhashjs_1.default.h64(value, seed + 1);\n var l = xxhashjs_1.default.h64(value, seed + 2);\n if (asInt) {\n return {\n first: f.toNumber(),\n second: l.toNumber()\n };\n }\n else {\n var one = f.toString(16);\n if (one.length < 16) {\n one = '0'.repeat(16 - one.length) + one;\n }\n var two = l.toString(16);\n if (two.length < 16) {\n two = '0'.repeat(16 - two.length) + two;\n }\n return {\n first: Number(one),\n second: Number(two)\n };\n }\n}\nexports.hashTwice = hashTwice;\nfunction hashTwiceAsString(value, seed) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n var f = xxhashjs_1.default.h64(value, seed + 1);\n var l = xxhashjs_1.default.h64(value, seed + 2);\n var one = f.toString(16);\n if (one.length < 16)\n one = '0'.repeat(16 - one.length) + one;\n var two = l.toString(16);\n if (two.length < 16)\n two = '0'.repeat(16 - two.length) + two;\n return {\n first: one,\n second: two\n };\n}\nexports.hashTwiceAsString = hashTwiceAsString;\n/**\n * (64-bits only) Same as hashTwice but return Numbers and String equivalent\n * @param val the value to hash\n * @param seed the seed to change when hashing\n * @return A object of shape {int: {first: <number>, second: <number>}, string: {first: <hex-string>, second: <hex-string>}\n * @author Arnaud Grall\n */\nfunction allInOneHashTwice(val, seed) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n var one = xxhashjs_1.default.h64(val, seed + 1);\n var two = xxhashjs_1.default.h64(val, seed + 2);\n var stringOne = one.toString(16);\n if (stringOne.length < 16)\n stringOne = '0'.repeat(16 - stringOne.length) + stringOne;\n var stringTwo = two.toString(16);\n if (stringTwo.length < 16)\n stringTwo = '0'.repeat(16 - stringTwo.length) + stringTwo;\n return {\n int: {\n first: one.toNumber(),\n second: two.toNumber()\n },\n string: {\n first: stringOne,\n second: stringTwo\n }\n };\n}\nexports.allInOneHashTwice = allInOneHashTwice;\n/**\n * Apply Double Hashing to produce a n-hash\n *\n * This implementation used directly the value produced by the two hash functions instead of the functions themselves.\n * @see {@link http://citeseer.ist.psu.edu/viewdoc/download;jsessionid=4060353E67A356EF9528D2C57C064F5A?doi=10.1.1.152.579&rep=rep1&type=pdf} for more details about double hashing.\n * @param n - The indice of the hash function we want to produce\n * @param hashA - The result of the first hash function applied to a value.\n * @param hashB - The result of the second hash function applied to a value.\n * @param size - The size of the datastructures associated to the hash context (ex: the size of a Bloom Filter)\n * @return The result of hash_n applied to a value.\n * @memberof Utils\n * @author Thomas Minier\n */\nfunction doubleHashing(n, hashA, hashB, size) {\n return Math.abs((hashA + n * hashB) % size);\n}\nexports.doubleHashing = doubleHashing;\n/**\n * Generate a set of distinct indexes on interval [0, size) using the double hashing technique\n * @param element - The element to hash\n * @param size - the range on which we can generate an index [0, size) = size\n * @param number - The number of indexes desired\n * @param seed - The seed used\n * @return A array of indexes\n * @author Arnaud Grall\n */\nfunction getDistinctIndices(element, size, number, seed) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n function getDistinctIndicesBis(n, elem, size, count, indexes) {\n if (indexes === void 0) { indexes = []; }\n if (indexes.length === count) {\n return indexes;\n }\n else {\n var hashes = hashTwice(elem, true, seed + size % n);\n var ind = doubleHashing(n, hashes.first, hashes.second, size);\n if (indexes.includes(ind)) {\n // console.log('generate index: %d for %s', ind, elem)\n return getDistinctIndicesBis(n + 1, elem, size, count, indexes);\n }\n else {\n // console.log('already found: %d for %s', ind, elem)\n indexes.push(ind);\n return getDistinctIndicesBis(n + 1, elem, size, count, indexes);\n }\n }\n }\n return getDistinctIndicesBis(1, element, size, number);\n}\nexports.getDistinctIndices = getDistinctIndices;\n/**\n * Generate hashCount indexes, one index per [0, size)\n * it uses the double hashing technique to generate the indexes\n * @param element - The element to hash\n * @param size - The range on which we can g-enerate the index, exclusive\n * @param hashCount - The number of indexes we want\n * @return An array of indexes\n */\nfunction getIndices(element, size, hashCount, seed) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n var arr = [];\n for (var i = 1; i <= hashCount; i++) {\n var hashes = hashTwice(element, true, seed + size % i);\n arr.push(doubleHashing(i, hashes.first, hashes.second, size));\n }\n if (arr.length !== hashCount)\n throw new Error('report this, please, shouldnt be of different size');\n return arr;\n}\nexports.getIndices = getIndices;\n/**\n * Generate a random int bewteen two bounds (included)\n * @param min - The lower bound\n * @param max - The upper bound\n * @param random - Function used to generate random floats\n * @return A random int bewteen lower and upper bound (included)\n * @memberof Utils\n * @author Thomas Minier\n */\nfunction randomInt(min, max, random) {\n if (random === undefined) {\n random = Math.random;\n }\n min = Math.ceil(min);\n max = Math.floor(max);\n var rn = random();\n return Math.floor(rn * (max - min + 1)) + min;\n}\nexports.randomInt = randomInt;\n/**\n * Return the non-destructive XOR of two buffers\n * @param a - The buffer to copy, then to xor with b\n * @param b - The buffer to xor with\n * @return The results of the XOR between the two buffers\n * @author Arnaud Grall\n */\nfunction xorBuffer(a, b) {\n var length = Math.max(a.length, b.length);\n var buffer = buffer_1.Buffer.allocUnsafe(length).fill(0);\n for (var i = 0; i < length; ++i) {\n if (i < a.length && i < b.length) {\n buffer[length - i - 1] = a[a.length - i - 1] ^ b[b.length - i - 1];\n }\n else if (i < a.length && i >= b.length) {\n buffer[length - i - 1] ^= a[a.length - i - 1];\n }\n else if (i < b.length && i >= a.length) {\n buffer[length - i - 1] ^= b[b.length - i - 1];\n }\n }\n // now need to remove leading zeros in the buffer if any\n var start = 0;\n var it = buffer.values();\n var value = it.next();\n while (!value.done && value.value === 0) {\n start++;\n value = it.next();\n }\n var buf2 = buffer.slice(start);\n return buf2;\n}\nexports.xorBuffer = xorBuffer;\n/**\n * Return true if the buffer is empty, i.e., all value are equals to 0.\n * @param buffer - The buffer to inspect\n * @return True if the buffer only contains zero, False otherwise\n * @author Arnaud Grall\n */\nfunction isEmptyBuffer(buffer) {\n var e_1, _a;\n if (buffer === null || !buffer)\n return true;\n try {\n for (var buffer_2 = __values(buffer), buffer_2_1 = buffer_2.next(); !buffer_2_1.done; buffer_2_1 = buffer_2.next()) {\n var value = buffer_2_1.value;\n if (value !== 0) {\n return false;\n }\n }\n }\n catch (e_1_1) { e_1 = { error: e_1_1 }; }\n finally {\n try {\n if (buffer_2_1 && !buffer_2_1.done && (_a = buffer_2.return)) _a.call(buffer_2);\n }\n finally { if (e_1) throw e_1.error; }\n }\n return true;\n // const json = buffer.toJSON()\n // let i = 0\n // let found = false\n // while (!found && i < json.data.length) {\n // if (json.data[i] !== 0) {\n // found = true\n // }\n // i++\n // }\n // return !found\n}\nexports.isEmptyBuffer = isEmptyBuffer;\n/**\n * Hash an item as an unsigned int\n * @param elem - Element to hash\n * @param seed - The hash seed. If its is UINT32 make sure to set the length to 32\n * @param length - The length of hashes (defaults to 64 bits)\n * @return The hash value as an unsigned int\n * @author Arnaud Grall\n */\nfunction hashAsInt(elem, seed, length) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n switch (length) {\n case 32:\n return xxhashjs_1.default.h32(elem, seed).toNumber();\n case 64:\n return xxhashjs_1.default.h64(elem, seed).toNumber();\n default:\n return xxhashjs_1.default.h64(elem, seed).toNumber();\n }\n}\nexports.hashAsInt = hashAsInt;\n/**\n * Hash an item as a string\n * @param elem - Element to hash\n * @param seed - The hash seed. If its is UINT32 make sure to set the length to 32\n * @param base - The base in which the string will be returned, default: 16\n * @param length - The length of hashes (defaults to 64 bits)\n * @return The hashed value as a string\n * @author Arnaud Grall\n */\nfunction hashAsString(elem, seed, base, length) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n if (base === undefined) {\n base = 16;\n }\n if (length === undefined) {\n length = 64;\n }\n var hash;\n switch (length) {\n case 32:\n hash = xxhashjs_1.default.h32(elem, seed);\n break;\n case 64:\n hash = xxhashjs_1.default.h64(elem, seed);\n break;\n default:\n hash = xxhashjs_1.default.h64(elem, seed);\n break;\n }\n var result = '';\n if (base === 16) {\n result = hash.toString(base);\n if (result.length < (length / 4)) {\n result = '0'.repeat((length / 4) - result.length) + result;\n }\n }\n else if (base === 2) {\n result = hex2bin(hash.toString(16));\n if (result.length < length) {\n result = '0'.repeat(length - result.length) + result;\n }\n }\n return result;\n}\nexports.hashAsString = hashAsString;\n/**\n * Hash an item as a string\n * @param elem - Element to hash\n * @param seed - The hash seed. If its is UINT32 make sure to set the length to 32\n * @param base - The base in which the string will be returned, default: 16\n * @param length - The length of hashes (defaults to 64 bits)\n * @return The item hased as an int and a string\n * @author Arnaud Grall\n */\nfunction hashIntAndString(elem, seed, base, length) {\n if (seed === undefined) {\n seed = getDefaultSeed();\n }\n if (base === undefined) {\n base = 16;\n }\n if (length === undefined) {\n length = 64;\n }\n var hash;\n switch (length) {\n case 32:\n hash = xxhashjs_1.default.h32(elem, seed);\n break;\n case 64:\n hash = xxhashjs_1.default.h64(elem, seed);\n break;\n default:\n hash = xxhashjs_1.default.h64(elem, seed);\n break;\n }\n var result = '';\n if (base === 16) {\n result = hash.toString(base);\n if (result.length < (length / 4)) {\n result = '0'.repeat((length / 4) - result.length) + result;\n }\n }\n else if (base === 2) {\n result = hex2bin(hash.toString(16));\n if (result.length < length) {\n result = '0'.repeat(length - result.length) + result;\n }\n }\n return { int: hash.toNumber(), string: result };\n}\nexports.hashIntAndString = hashIntAndString;\n/**\n * Return the default seed used in the package\n * @return A ssed as a floating point number\n * @author Arnaud Grall\n */\nfunction getDefaultSeed() {\n return 0x1234567890;\n}\nexports.getDefaultSeed = getDefaultSeed;\n/**\n * Return the next power of 2 of x\n * @param x - Value\n * @return The next power of 2 of x\n */\nfunction power2(x) {\n return Math.ceil(Math.pow(2, Math.floor(Math.log(x) / Math.log(2))));\n}\nexports.power2 = power2;\n/**\n * Convert an hex string into a binary string\n * @param hex - A base 16 string\n * @return A base 2 string\n */\nfunction hex2bin(hex) {\n return parseInt(hex, 16).toString(2);\n}\nexports.hex2bin = hex2bin;\n/**\n * Convert an uint8 to an array of 1s and 0s\n * @param uint8 - A uint8 number\n * @return An array of 1s and 0s\n */\nfunction uint8ToBits(uint8) {\n return [128, 64, 32, 16, 8, 4, 2, 1].map(function (x) { return (x & uint8) > 0 ? 1 : 0; });\n}\nexports.uint8ToBits = uint8ToBits;\n/**\n * Convert an array of 1s and 0s to a uint8\n * @param bits - An array of 1s and 0s\n * @return A uint8 number\n */\nfunction bitsToUint8(bits) {\n return bits.reduce(function (acc, cur, i) {\n if (cur === 0) {\n return acc;\n }\n else if (cur === 1) {\n return acc + Math.pow(2, 7 - i);\n }\n else {\n throw new Error(\"Not binary\");\n }\n }, 0);\n}\nexports.bitsToUint8 = bitsToUint8;\n", "// A port of an algorithm by Johannes Baag\u00F8e <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baag\u00F8e <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\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 OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n var me = this, mash = Mash();\n\n me.next = function() {\n var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n me.s0 = me.s1;\n me.s1 = me.s2;\n return me.s2 = t - (me.c = t | 0);\n };\n\n // Apply the seeding algorithm from Baagoe.\n me.c = 1;\n me.s0 = mash(' ');\n me.s1 = mash(' ');\n me.s2 = mash(' ');\n me.s0 -= mash(seed);\n if (me.s0 < 0) { me.s0 += 1; }\n me.s1 -= mash(seed);\n if (me.s1 < 0) { me.s1 += 1; }\n me.s2 -= mash(seed);\n if (me.s2 < 0) { me.s2 += 1; }\n mash = null;\n}\n\nfunction copy(f, t) {\n t.c = f.c;\n t.s0 = f.s0;\n t.s1 = f.s1;\n t.s2 = f.s2;\n return t;\n}\n\nfunction impl(seed, opts) {\n var xg = new Alea(seed),\n state = opts && opts.state,\n prng = xg.next;\n prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n prng.double = function() {\n return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n };\n prng.quick = prng;\n if (state) {\n if (typeof(state) == 'object') copy(state, xg);\n prng.state = function() { return copy(xg, {}); }\n }\n return prng;\n}\n\nfunction Mash() {\n var n = 0xefc8249d;\n\n var mash = function(data) {\n data = String(data);\n for (var i = 0; i < data.length; i++) {\n n += data.charCodeAt(i);\n var h = 0.02519603282416938 * n;\n n = h >>> 0;\n h -= n;\n h *= n;\n n = h >>> 0;\n h -= n;\n n += h * 0x100000000; // 2^32\n }\n return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n };\n\n return mash;\n}\n\n\nif (module && module.exports) {\n module.exports = impl;\n} else if (define && define.amd) {\n define(function() { return impl; });\n} else {\n this.alea = impl;\n}\n\n})(\n this,\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia. See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n var me = this, strseed = '';\n\n me.x = 0;\n me.y = 0;\n me.z = 0;\n me.w = 0;\n\n // Set up generator function.\n me.next = function() {\n var t = me.x ^ (me.x << 11);\n me.x = me.y;\n me.y = me.z;\n me.z = me.w;\n return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n };\n\n if (seed === (seed | 0)) {\n // Integer seed.\n me.x = seed;\n } else {\n // String seed.\n strseed += seed;\n }\n\n // Mix in string seed, then discard an initial batch of 64 values.\n for (var k = 0; k < strseed.length + 64; k++) {\n me.x ^= strseed.charCodeAt(k) | 0;\n me.next();\n }\n}\n\nfunction copy(f, t) {\n t.x = f.x;\n t.y = f.y;\n t.z = f.z;\n t.w = f.w;\n return t;\n}\n\nfunction impl(seed, opts) {\n var xg = new XorGen(seed),\n state = opts && opts.state,\n prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n prng.double = function() {\n do {\n var top = xg.next() >>> 11,\n bot = (xg.next() >>> 0) / 0x100000000,\n result = (top + bot) / (1 << 21);\n } while (result === 0);\n return result;\n };\n prng.int32 = xg.next;\n prng.quick = prng;\n if (state) {\n if (typeof(state) == 'object') copy(state, xg);\n prng.state = function() { return copy(xg, {}); }\n }\n return prng;\n}\n\nif (module && module.exports) {\n module.exports = impl;\n} else if (define && define.amd) {\n define(function() { return impl; });\n} else {\n this.xor128 = impl;\n}\n\n})(\n this,\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia. See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n var me = this, strseed = '';\n\n // Set up generator function.\n me.next = function() {\n var t = (me.x ^ (me.x >>> 2));\n me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n return (me.d = (me.d + 362437 | 0)) +\n (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n };\n\n me.x = 0;\n me.y = 0;\n me.z = 0;\n me.w = 0;\n me.v = 0;\n\n if (seed === (seed | 0)) {\n // Integer seed.\n me.x = seed;\n } else {\n // String seed.\n strseed += seed;\n }\n\n // Mix in string seed, then discard an initial batch of 64 values.\n for (var k = 0; k < strseed.length + 64; k++) {\n me.x ^= strseed.charCodeAt(k) | 0;\n if (k == strseed.length) {\n me.d = me.x << 10 ^ me.x >>> 4;\n }\n me.next();\n }\n}\n\nfunction copy(f, t) {\n t.x = f.x;\n t.y = f.y;\n t.z = f.z;\n t.w = f.w;\n t.v = f.v;\n t.d = f.d;\n return t;\n}\n\nfunction impl(seed, opts) {\n var xg = new XorGen(seed),\n state = opts && opts.state,\n prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n prng.double = function() {\n do {\n var top = xg.next() >>> 11,\n bot = (xg.next() >>> 0) / 0x100000000,\n result = (top + bot) / (1 << 21);\n } while (result === 0);\n return result;\n };\n prng.int32 = xg.next;\n prng.quick = prng;\n if (state) {\n if (typeof(state) == 'object') copy(state, xg);\n prng.state = function() { return copy(xg, {}); }\n }\n return prng;\n}\n\nif (module && module.exports) {\n module.exports = impl;\n} else if (define && define.amd) {\n define(function() { return impl; });\n} else {\n this.xorwow = impl;\n}\n\n})(\n this,\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorshift7\" algorithm by\n// Fran\u00E7ois Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n var me = this;\n\n // Set up generator function.\n me.next = function() {\n // Update xor generator.\n var X = me.x, i = me.i, t, v, w;\n t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n X[i] = v;\n me.i = (i + 1) & 7;\n return v;\n };\n\n function init(me, seed) {\n var j, w, X = [];\n\n if (seed === (seed | 0)) {\n // Seed state array using a 32-bit integer.\n w = X[0] = seed;\n } else {\n // Seed state using a string.\n seed = '' + seed;\n for (j = 0; j < seed.length; ++j) {\n X[j & 7] = (X[j & 7] << 15) ^\n (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n }\n }\n // Enforce an array length of 8, not all zeroes.\n while (X.length < 8) X.push(0);\n for (j = 0; j < 8 && X[j] === 0; ++j);\n if (j == 8) w = X[7] = -1; else w = X[j];\n\n me.x = X;\n me.i = 0;\n\n // Discard an initial 256 values.\n for (j = 256; j > 0; --j) {\n me.next();\n }\n }\n\n init(me, seed);\n}\n\nfunction copy(f, t) {\n t.x = f.x.slice();\n t.i = f.i;\n return t;\n}\n\nfunction impl(seed, opts) {\n if (seed == null) seed = +(new Date);\n var xg = new XorGen(seed),\n state = opts && opts.state,\n prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n prng.double = function() {\n do {\n var top = xg.next() >>> 11,\n bot = (xg.next() >>> 0) / 0x100000000,\n result = (top + bot) / (1 << 21);\n } while (result === 0);\n return result;\n };\n prng.int32 = xg.next;\n prng.quick = prng;\n if (state) {\n if (state.x) copy(state, xg);\n prng.state = function() { return copy(xg, {}); }\n }\n return prng;\n}\n\nif (module && module.exports) {\n module.exports = impl;\n} else if (define && define.amd) {\n define(function() { return impl; });\n} else {\n this.xorshift7 = impl;\n}\n\n})(\n this,\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define // present with an AMD loader\n);\n\n", "// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated. For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1); // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897); // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C. This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n var me = this;\n\n // Set up generator function.\n me.next = function() {\n var w = me.w,\n X = me.X, i = me.i, t, v;\n // Update Weyl generator.\n me.w = w = (w + 0x61c88647) | 0;\n // Update xor generator.\n v = X[(i + 34) & 127];\n t = X[i = ((i + 1) & 127)];\n v ^= v << 13;\n t ^= t << 17;\n v ^= v >>> 15;\n t ^= t >>> 12;\n // Update Xor generator array state.\n v = X[i] = v ^ t;\n me.i = i;\n // Result is the combination.\n return (v + (w ^ (w >>> 16))) | 0;\n };\n\n function init(me, seed) {\n var t, v, i, j, w, X = [], limit = 128;\n if (seed === (seed | 0)) {\n // Numeric seeds initialize v, which is used to generates X.\n v = seed;\n seed = null;\n } else {\n // String seeds are mixed into v and X one character at a time.\n seed = seed + '\\0';\n v = 0;\n limit = Math.max(limit, seed.length);\n }\n // Initialize circular array and weyl value.\n for (i = 0, j = -32; j < limit; ++j) {\n // Put the unicode characters into the array, and shuffle them.\n if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n // After 32 shuffles, take v as the starting w value.\n if (j === 0) w = v;\n v ^= v << 10;\n v ^= v >>> 15;\n v ^= v << 4;\n v ^= v >>> 13;\n if (j >= 0) {\n w = (w + 0x61c88647) | 0; // Weyl.\n t = (X[j & 127] ^= (v + w)); // Combine xor and weyl to init array.\n i = (0 == t) ? i + 1 : 0; // Count zeroes.\n }\n }\n // We have detected all zeroes; make the key nonzero.\n if (i >= 128) {\n X[(seed && seed.length || 0) & 127] = -1;\n }\n // Run the generator 512 times to further mix the state before using it.\n // Factoring this as a function slows the main generator, so it is just\n // unrolled here. The weyl generator is not advanced while warming up.\n i = 127;\n for (j = 4 * 128; j > 0; --j) {\n v = X[(i + 34) & 127];\n t = X[i = ((i + 1) & 127)];\n v ^= v << 13;\n t ^= t << 17;\n v ^= v >>> 15;\n t ^= t >>> 12;\n X[i] = v ^ t;\n }\n // Storing state as object members is faster than using closure variables.\n me.w = w;\n me.X = X;\n me.i = i;\n }\n\n init(me, seed);\n}\n\nfunction copy(f, t) {\n t.i = f.i;\n t.w = f.w;\n t.X = f.X.slice();\n return t;\n};\n\nfunction impl(seed, opts) {\n if (seed == null) seed = +(new Date);\n var xg = new XorGen(seed),\n state = opts && opts.state,\n prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n prng.double = function() {\n do {\n var top = xg.next() >>> 11,\n bot = (xg.next() >>> 0) / 0x100000000,\n result = (top + bot) / (1 << 21);\n } while (result === 0);\n return result;\n };\n prng.int32 = xg.next;\n prng.quick = prng;\n if (state) {\n if (state.X) copy(state, xg);\n prng.state = function() { return copy(xg, {}); }\n }\n return prng;\n}\n\nif (module && module.exports) {\n module.exports = impl;\n} else if (define && define.amd) {\n define(function() { return impl; });\n} else {\n this.xor4096 = impl;\n}\n\n})(\n this, // window object or global\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define // present with an AMD loader\n);\n", "// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n var me = this, strseed = '';\n\n // Set up generator function.\n me.next = function() {\n var b = me.b, c = me.c, d = me.d, a = me.a;\n b = (b << 25) ^ (b >>> 7) ^ c;\n c = (c - d) | 0;\n d = (d << 24) ^ (d >>> 8) ^ a;\n a = (a - b) | 0;\n me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n me.c = c = (c - d) | 0;\n me.d = (d << 16) ^ (c >>> 16) ^ a;\n return me.a = (a - b) | 0;\n };\n\n /* The following is non-inverted tyche, which has better internal\n * bit diffusion, but which is about 25% slower than tyche-i in JS.\n me.next = function() {\n var a = me.a, b = me.b, c = me.c, d = me.d;\n a = (me.a + me.b | 0) >>> 0;\n d = me.d ^ a; d = d << 16 ^ d >>> 16;\n c = me.c + d | 0;\n b = me.b ^ c; b = b << 12 ^ d >>> 20;\n me.a = a = a + b | 0;\n d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n me.c = c = c + d | 0;\n b = b ^ c;\n return me.b = (b << 7 ^ b >>> 25);\n }\n */\n\n me.a = 0;\n me.b = 0;\n me.c = 2654435769 | 0;\n me.d = 1367130551;\n\n if (seed === Math.floor(seed)) {\n // Integer seed.\n me.a = (seed / 0x100000000) | 0;\n me.b = seed | 0;\n } else {\n // String seed.\n strseed += seed;\n }\n\n // Mix in string seed, then discard an initial batch of 64 values.\n for (var k = 0; k < strseed.length + 20; k++) {\n me.b ^= strseed.charCodeAt(k) | 0;\n me.next();\n }\n}\n\nfunction copy(f, t) {\n t.a = f.a;\n t.b = f.b;\n t.c = f.c;\n t.d = f.d;\n return t;\n};\n\nfunction impl(seed, opts) {\n var xg = new XorGen(seed),\n state = opts && opts.state,\n prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n prng.double = function() {\n do {\n var top = xg.next() >>> 11,\n bot = (xg.next() >>> 0) / 0x100000000,\n result = (top + bot) / (1 << 21);\n } while (result === 0);\n return result;\n };\n prng.int32 = xg.next;\n prng.quick = prng;\n if (state) {\n if (typeof(state) == 'object') copy(state, xg);\n prng.state = function() { return copy(xg, {}); }\n }\n return prng;\n}\n\nif (module && module.exports) {\n module.exports = impl;\n} else if (define && define.amd) {\n define(function() { return impl; });\n} else {\n this.tychei = impl;\n}\n\n})(\n this,\n (typeof module) == 'object' && module, // present in node.js\n (typeof define) == 'function' && define // present with an AMD loader\n);\n\n\n", "/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256, // each RC4 output is 0 <= x < 256\n chunks = 6, // at least six RC4 outputs for each double\n digits = 52, // there are 52 significant digits in a double\n rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n startdenom = math.pow(width, chunks),\n significance = math.pow(2, digits),\n overflow = significance * 2,\n mask = width - 1,\n nodecrypto; // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n var key = [];\n options = (options == true) ? { entropy: true } : (options || {});\n\n // Flatten the seed string or build one from local entropy if needed.\n var shortseed = mixkey(flatten(\n options.entropy ? [seed, tostring(pool)] :\n (seed == null) ? autoseed() : seed, 3), key);\n\n // Use the seed to initialize an ARC4 generator.\n var arc4 = new ARC4(key);\n\n // This function returns a random double in [0, 1) that contains\n // randomness in every bit of the mantissa of the IEEE 754 value.\n var prng = function() {\n var n = arc4.g(chunks), // Start with a numerator n < 2 ^ 48\n d = startdenom, // and denominator d = 2 ^ 48.\n x = 0; // and no 'extra last byte'.\n while (n < significance) { // Fill up all significant digits by\n n = (n + x) * width; // shifting numerator and\n d *= width; // denominator and generating a\n x = arc4.g(1); // new least-significant-byte.\n }\n while (n >= overflow) { // To avoid rounding up, before adding\n n /= 2; // last byte, shift everything\n d /= 2; // right using integer math until\n x >>>= 1; // we have exactly the desired bits.\n }\n return (n + x) / d; // Form the number within [0, 1).\n };\n\n prng.int32 = function() { return arc4.g(4) | 0; }\n prng.quick = function() { return arc4.g(4) / 0x100000000; }\n prng.double = prng;\n\n // Mix the randomness into accumulated entropy.\n mixkey(tostring(arc4.S), pool);\n\n // Calling convention: what to return as a function of prng, seed, is_math.\n return (options.pass || callback ||\n function(prng, seed, is_math_call, state) {\n if (state) {\n // Load the arc4 state from the given state if it has an S array.\n if (state.S) { copy(state, arc4); }\n // Only provide the .state method if requested via options.state.\n prng.state = function() { return copy(arc4, {}); }\n }\n\n // If called as a method of Math (Math.seedrandom()), mutate\n // Math.random because that is how seedrandom.js has worked since v1.0.\n if (is_math_call) { math[rngname] = prng; return seed; }\n\n // Otherwise, it is a newer calling convention, so return the\n // prng directly.\n else return prng;\n })(\n prng,\n shortseed,\n 'global' in options ? options.global : (this == math),\n options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation. The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4. Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n var t, keylen = key.length,\n me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n // The empty key [] is treated as [0].\n if (!keylen) { key = [keylen++]; }\n\n // Set up S using the standard key scheduling algorithm.\n while (i < width) {\n s[i] = i++;\n }\n for (i = 0; i < width; i++) {\n s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n s[j] = t;\n }\n\n // The \"g\" method returns the next (count) outputs as one number.\n (me.g = function(count) {\n // Using instance members instead of closure state nearly doubles speed.\n var t, r = 0,\n i = me.i, j = me.j, s = me.S;\n while (count--) {\n t = s[i = mask & (i + 1)];\n r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n }\n me.i = i; me.j = j;\n return r;\n // For robust unpredictability, the function call below automatically\n // discards an initial batch of values. This is called RC4-drop[256].\n // See http://google.com/search?q=rsa+fluhrer+response&btnI\n })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n t.i = f.i;\n t.j = f.j;\n t.S = f.S.slice();\n return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n var result = [], typ = (typeof obj), prop;\n if (depth && typ == 'object') {\n for (prop in obj) {\n try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n }\n }\n return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n var stringseed = seed + '', smear, j = 0;\n while (j < stringseed.length) {\n key[mask & j] =\n mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n }\n return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n try {\n var out;\n if (nodecrypto && (out = nodecrypto.randomBytes)) {\n // The use of 'out' to remember randomBytes makes tight minified code.\n out = out(width);\n } else {\n out = new Uint8Array(width);\n (global.crypto || global.msCrypto).getRandomValues(out);\n }\n return tostring(out);\n } catch (e) {\n var browser = global.navigator,\n plugins = browser && browser.plugins;\n return [+new Date, global, plugins, global.screen, tostring(pool)];\n }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool. Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n module.exports = seedrandom;\n // When in node.js, try using crypto package for autoseeding.\n try {\n nodecrypto = require('crypto');\n } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n define(function() { return seedrandom; });\n} else {\n // When included as a plain script, set up Math.seedrandom global.\n math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n // global: `self` in browsers (including strict mode and web workers),\n // otherwise `this` in Node and other environments\n (typeof self !== 'undefined') ? self : this,\n [], // pool: entropy pool starts empty\n Math // math: package containing random, pow, and seedrandom\n);\n", "// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random(); // 0 <= x < 1. Every bit is random.\n// var x = random.quick(); // 0 <= x < 1. 32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baag\u00F8e.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by Fran\u00E7ois Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three. It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures. Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n", "/* file : base-filter.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __importStar = (this && this.__importStar) || function (mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\n result[\"default\"] = mod;\n return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar utils = __importStar(require(\"./utils\"));\nvar seedrandom_1 = __importDefault(require(\"seedrandom\"));\n/**\n * A base class for implementing probailistic filters\n * @author Thomas Minier\n * @author Arnaud Grall\n */\nvar BaseFilter = /** @class */ (function () {\n function BaseFilter() {\n this._seed = utils.getDefaultSeed();\n this._rng = seedrandom_1.default(\"\" + this._seed);\n }\n Object.defineProperty(BaseFilter.prototype, \"seed\", {\n /**\n * Get the seed used in this structure\n */\n get: function () {\n return this._seed;\n },\n /**\n * Set the seed for this structure\n * @param seed the new seed that will be used in this structure\n */\n set: function (seed) {\n this._seed = seed;\n this._rng = seedrandom_1.default(\"\" + this._seed);\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(BaseFilter.prototype, \"random\", {\n /**\n * Get a function used to draw random number\n * @return A factory function used to draw random integer\n */\n get: function () {\n return this._rng;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Save the current structure as a JSON object\n */\n BaseFilter.prototype.saveAsJSON = function () {\n throw new Error('not-implemented');\n };\n /**\n * Load an Object from a provided JSON object\n * @param json the JSON object to load\n * @return Return the Object loaded from the provided JSON object\n */\n BaseFilter.fromJSON = function (json) {\n throw new Error('not-implemented');\n };\n return BaseFilter;\n}());\nexports.default = BaseFilter;\n", "/*! *****************************************************************************\nCopyright (C) Microsoft. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\nvar Reflect;\n(function (Reflect) {\n // Metadata Proposal\n // https://rbuckton.github.io/reflect-metadata/\n (function (factory) {\n var root = typeof global === \"object\" ? global :\n typeof self === \"object\" ? self :\n typeof this === \"object\" ? this :\n Function(\"return this;\")();\n var exporter = makeExporter(Reflect);\n if (typeof root.Reflect === \"undefined\") {\n root.Reflect = Reflect;\n }\n else {\n exporter = makeExporter(root.Reflect, exporter);\n }\n factory(exporter);\n function makeExporter(target, previous) {\n return function (key, value) {\n if (typeof target[key] !== \"function\") {\n Object.defineProperty(target, key, { configurable: true, writable: true, value: value });\n }\n if (previous)\n previous(key, value);\n };\n }\n })(function (exporter) {\n var hasOwn = Object.prototype.hasOwnProperty;\n // feature test for Symbol support\n var supportsSymbol = typeof Symbol === \"function\";\n var toPrimitiveSymbol = supportsSymbol && typeof Symbol.toPrimitive !== \"undefined\" ? Symbol.toPrimitive : \"@@toPrimitive\";\n var iteratorSymbol = supportsSymbol && typeof Symbol.iterator !== \"undefined\" ? Symbol.iterator : \"@@iterator\";\n var supportsCreate = typeof Object.create === \"function\"; // feature test for Object.create support\n var supportsProto = { __proto__: [] } instanceof Array; // feature test for __proto__ support\n var downLevel = !supportsCreate && !supportsProto;\n var HashMap = {\n // create an object in dictionary mode (a.k.a. \"slow\" mode in v8)\n create: supportsCreate\n ? function () { return MakeDictionary(Object.create(null)); }\n : supportsProto\n ? function () { return MakeDictionary({ __proto__: null }); }\n : function () { return MakeDictionary({}); },\n has: downLevel\n ? function (map, key) { return hasOwn.call(map, key); }\n : function (map, key) { return key in map; },\n get: downLevel\n ? function (map, key) { return hasOwn.call(map, key) ? map[key] : undefined; }\n : function (map, key) { return map[key]; },\n };\n // Load global or shim versions of Map, Set, and WeakMap\n var functionPrototype = Object.getPrototypeOf(Function);\n var usePolyfill = typeof process === \"object\" && process.env && process.env[\"REFLECT_METADATA_USE_MAP_POLYFILL\"] === \"true\";\n var _Map = !usePolyfill && typeof Map === \"function\" && typeof Map.prototype.entries === \"function\" ? Map : CreateMapPolyfill();\n var _Set = !usePolyfill && typeof Set === \"function\" && typeof Set.prototype.entries === \"function\" ? Set : CreateSetPolyfill();\n var _WeakMap = !usePolyfill && typeof WeakMap === \"function\" ? WeakMap : CreateWeakMapPolyfill();\n // [[Metadata]] internal slot\n // https://rbuckton.github.io/reflect-metadata/#ordinary-object-internal-methods-and-internal-slots\n var Metadata = new _WeakMap();\n /**\n * Applies a set of decorators to a property of a target object.\n * @param decorators An array of decorators.\n * @param target The target object.\n * @param propertyKey (Optional) The property key to decorate.\n * @param attributes (Optional) The property descriptor for the target key.\n * @remarks Decorators are applied in reverse order.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * Example = Reflect.decorate(decoratorsArray, Example);\n *\n * // property (on constructor)\n * Reflect.decorate(decoratorsArray, Example, \"staticProperty\");\n *\n * // property (on prototype)\n * Reflect.decorate(decoratorsArray, Example.prototype, \"property\");\n *\n * // method (on constructor)\n * Object.defineProperty(Example, \"staticMethod\",\n * Reflect.decorate(decoratorsArray, Example, \"staticMethod\",\n * Object.getOwnPropertyDescriptor(Example, \"staticMethod\")));\n *\n * // method (on prototype)\n * Object.defineProperty(Example.prototype, \"method\",\n * Reflect.decorate(decoratorsArray, Example.prototype, \"method\",\n * Object.getOwnPropertyDescriptor(Example.prototype, \"method\")));\n *\n */\n function decorate(decorators, target, propertyKey, attributes) {\n if (!IsUndefined(propertyKey)) {\n if (!IsArray(decorators))\n throw new TypeError();\n if (!IsObject(target))\n throw new TypeError();\n if (!IsObject(attributes) && !IsUndefined(attributes) && !IsNull(attributes))\n throw new TypeError();\n if (IsNull(attributes))\n attributes = undefined;\n propertyKey = ToPropertyKey(propertyKey);\n return DecorateProperty(decorators, target, propertyKey, attributes);\n }\n else {\n if (!IsArray(decorators))\n throw new TypeError();\n if (!IsConstructor(target))\n throw new TypeError();\n return DecorateConstructor(decorators, target);\n }\n }\n exporter(\"decorate\", decorate);\n // 4.1.2 Reflect.metadata(metadataKey, metadataValue)\n // https://rbuckton.github.io/reflect-metadata/#reflect.metadata\n /**\n * A default metadata decorator factory that can be used on a class, class member, or parameter.\n * @param metadataKey The key for the metadata entry.\n * @param metadataValue The value for the metadata entry.\n * @returns A decorator function.\n * @remarks\n * If `metadataKey` is already defined for the target and target key, the\n * metadataValue for that key will be overwritten.\n * @example\n *\n * // constructor\n * @Reflect.metadata(key, value)\n * class Example {\n * }\n *\n * // property (on constructor, TypeScript only)\n * class Example {\n * @Reflect.metadata(key, value)\n * static staticProperty;\n * }\n *\n * // property (on prototype, TypeScript only)\n * class Example {\n * @Reflect.metadata(key, value)\n * property;\n * }\n *\n * // method (on constructor)\n * class Example {\n * @Reflect.metadata(key, value)\n * static staticMethod() { }\n * }\n *\n * // method (on prototype)\n * class Example {\n * @Reflect.metadata(key, value)\n * method() { }\n * }\n *\n */\n function metadata(metadataKey, metadataValue) {\n function decorator(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey) && !IsPropertyKey(propertyKey))\n throw new TypeError();\n OrdinaryDefineOwnMetadata(metadataKey, metadataValue, target, propertyKey);\n }\n return decorator;\n }\n exporter(\"metadata\", metadata);\n /**\n * Define a unique metadata entry on the target.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param metadataValue A value that contains attached metadata.\n * @param target The target object on which to define metadata.\n * @param propertyKey (Optional) The property key for the target.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * Reflect.defineMetadata(\"custom:annotation\", options, Example);\n *\n * // property (on constructor)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example, \"staticProperty\");\n *\n * // property (on prototype)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example.prototype, \"property\");\n *\n * // method (on constructor)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example, \"staticMethod\");\n *\n * // method (on prototype)\n * Reflect.defineMetadata(\"custom:annotation\", options, Example.prototype, \"method\");\n *\n * // decorator factory as metadata-producing annotation.\n * function MyAnnotation(options): Decorator {\n * return (target, key?) => Reflect.defineMetadata(\"custom:annotation\", options, target, key);\n * }\n *\n */\n function defineMetadata(metadataKey, metadataValue, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryDefineOwnMetadata(metadataKey, metadataValue, target, propertyKey);\n }\n exporter(\"defineMetadata\", defineMetadata);\n /**\n * Gets a value indicating whether the target object or its prototype chain has the provided metadata key defined.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata key was defined on the target object or its prototype chain; otherwise, `false`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.hasMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.hasMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function hasMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryHasMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"hasMetadata\", hasMetadata);\n /**\n * Gets a value indicating whether the target object has the provided metadata key defined.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata key was defined on the target object; otherwise, `false`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.hasOwnMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function hasOwnMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryHasOwnMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"hasOwnMetadata\", hasOwnMetadata);\n /**\n * Gets the metadata value for the provided metadata key on the target object or its prototype chain.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns The metadata value for the metadata key if found; otherwise, `undefined`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.getMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function getMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryGetMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"getMetadata\", getMetadata);\n /**\n * Gets the metadata value for the provided metadata key on the target object.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns The metadata value for the metadata key if found; otherwise, `undefined`.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getOwnMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function getOwnMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryGetOwnMetadata(metadataKey, target, propertyKey);\n }\n exporter(\"getOwnMetadata\", getOwnMetadata);\n /**\n * Gets the metadata keys defined on the target object or its prototype chain.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns An array of unique metadata keys.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getMetadataKeys(Example);\n *\n * // property (on constructor)\n * result = Reflect.getMetadataKeys(Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getMetadataKeys(Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getMetadataKeys(Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getMetadataKeys(Example.prototype, \"method\");\n *\n */\n function getMetadataKeys(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryMetadataKeys(target, propertyKey);\n }\n exporter(\"getMetadataKeys\", getMetadataKeys);\n /**\n * Gets the unique metadata keys defined on the target object.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns An array of unique metadata keys.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.getOwnMetadataKeys(Example);\n *\n * // property (on constructor)\n * result = Reflect.getOwnMetadataKeys(Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.getOwnMetadataKeys(Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.getOwnMetadataKeys(Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.getOwnMetadataKeys(Example.prototype, \"method\");\n *\n */\n function getOwnMetadataKeys(target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n return OrdinaryOwnMetadataKeys(target, propertyKey);\n }\n exporter(\"getOwnMetadataKeys\", getOwnMetadataKeys);\n /**\n * Deletes the metadata entry from the target object with the provided key.\n * @param metadataKey A key used to store and retrieve metadata.\n * @param target The target object on which the metadata is defined.\n * @param propertyKey (Optional) The property key for the target.\n * @returns `true` if the metadata entry was found and deleted; otherwise, false.\n * @example\n *\n * class Example {\n * // property declarations are not part of ES6, though they are valid in TypeScript:\n * // static staticProperty;\n * // property;\n *\n * constructor(p) { }\n * static staticMethod(p) { }\n * method(p) { }\n * }\n *\n * // constructor\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example);\n *\n * // property (on constructor)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example, \"staticProperty\");\n *\n * // property (on prototype)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example.prototype, \"property\");\n *\n * // method (on constructor)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example, \"staticMethod\");\n *\n * // method (on prototype)\n * result = Reflect.deleteMetadata(\"custom:annotation\", Example.prototype, \"method\");\n *\n */\n function deleteMetadata(metadataKey, target, propertyKey) {\n if (!IsObject(target))\n throw new TypeError();\n if (!IsUndefined(propertyKey))\n propertyKey = ToPropertyKey(propertyKey);\n var metadataMap = GetOrCreateMetadataMap(target, propertyKey, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return false;\n if (!metadataMap.delete(metadataKey))\n return false;\n if (metadataMap.size > 0)\n return true;\n var targetMetadata = Metadata.get(target);\n targetMetadata.delete(propertyKey);\n if (targetMetadata.size > 0)\n return true;\n Metadata.delete(target);\n return true;\n }\n exporter(\"deleteMetadata\", deleteMetadata);\n function DecorateConstructor(decorators, target) {\n for (var i = decorators.length - 1; i >= 0; --i) {\n var decorator = decorators[i];\n var decorated = decorator(target);\n if (!IsUndefined(decorated) && !IsNull(decorated)) {\n if (!IsConstructor(decorated))\n throw new TypeError();\n target = decorated;\n }\n }\n return target;\n }\n function DecorateProperty(decorators, target, propertyKey, descriptor) {\n for (var i = decorators.length - 1; i >= 0; --i) {\n var decorator = decorators[i];\n var decorated = decorator(target, propertyKey, descriptor);\n if (!IsUndefined(decorated) && !IsNull(decorated)) {\n if (!IsObject(decorated))\n throw new TypeError();\n descriptor = decorated;\n }\n }\n return descriptor;\n }\n function GetOrCreateMetadataMap(O, P, Create) {\n var targetMetadata = Metadata.get(O);\n if (IsUndefined(targetMetadata)) {\n if (!Create)\n return undefined;\n targetMetadata = new _Map();\n Metadata.set(O, targetMetadata);\n }\n var metadataMap = targetMetadata.get(P);\n if (IsUndefined(metadataMap)) {\n if (!Create)\n return undefined;\n metadataMap = new _Map();\n targetMetadata.set(P, metadataMap);\n }\n return metadataMap;\n }\n // 3.1.1.1 OrdinaryHasMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryhasmetadata\n function OrdinaryHasMetadata(MetadataKey, O, P) {\n var hasOwn = OrdinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn)\n return true;\n var parent = OrdinaryGetPrototypeOf(O);\n if (!IsNull(parent))\n return OrdinaryHasMetadata(MetadataKey, parent, P);\n return false;\n }\n // 3.1.2.1 OrdinaryHasOwnMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryhasownmetadata\n function OrdinaryHasOwnMetadata(MetadataKey, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return false;\n return ToBoolean(metadataMap.has(MetadataKey));\n }\n // 3.1.3.1 OrdinaryGetMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarygetmetadata\n function OrdinaryGetMetadata(MetadataKey, O, P) {\n var hasOwn = OrdinaryHasOwnMetadata(MetadataKey, O, P);\n if (hasOwn)\n return OrdinaryGetOwnMetadata(MetadataKey, O, P);\n var parent = OrdinaryGetPrototypeOf(O);\n if (!IsNull(parent))\n return OrdinaryGetMetadata(MetadataKey, parent, P);\n return undefined;\n }\n // 3.1.4.1 OrdinaryGetOwnMetadata(MetadataKey, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarygetownmetadata\n function OrdinaryGetOwnMetadata(MetadataKey, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return undefined;\n return metadataMap.get(MetadataKey);\n }\n // 3.1.5.1 OrdinaryDefineOwnMetadata(MetadataKey, MetadataValue, O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarydefineownmetadata\n function OrdinaryDefineOwnMetadata(MetadataKey, MetadataValue, O, P) {\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ true);\n metadataMap.set(MetadataKey, MetadataValue);\n }\n // 3.1.6.1 OrdinaryMetadataKeys(O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinarymetadatakeys\n function OrdinaryMetadataKeys(O, P) {\n var ownKeys = OrdinaryOwnMetadataKeys(O, P);\n var parent = OrdinaryGetPrototypeOf(O);\n if (parent === null)\n return ownKeys;\n var parentKeys = OrdinaryMetadataKeys(parent, P);\n if (parentKeys.length <= 0)\n return ownKeys;\n if (ownKeys.length <= 0)\n return parentKeys;\n var set = new _Set();\n var keys = [];\n for (var _i = 0, ownKeys_1 = ownKeys; _i < ownKeys_1.length; _i++) {\n var key = ownKeys_1[_i];\n var hasKey = set.has(key);\n if (!hasKey) {\n set.add(key);\n keys.push(key);\n }\n }\n for (var _a = 0, parentKeys_1 = parentKeys; _a < parentKeys_1.length; _a++) {\n var key = parentKeys_1[_a];\n var hasKey = set.has(key);\n if (!hasKey) {\n set.add(key);\n keys.push(key);\n }\n }\n return keys;\n }\n // 3.1.7.1 OrdinaryOwnMetadataKeys(O, P)\n // https://rbuckton.github.io/reflect-metadata/#ordinaryownmetadatakeys\n function OrdinaryOwnMetadataKeys(O, P) {\n var keys = [];\n var metadataMap = GetOrCreateMetadataMap(O, P, /*Create*/ false);\n if (IsUndefined(metadataMap))\n return keys;\n var keysObj = metadataMap.keys();\n var iterator = GetIterator(keysObj);\n var k = 0;\n while (true) {\n var next = IteratorStep(iterator);\n if (!next) {\n keys.length = k;\n return keys;\n }\n var nextValue = IteratorValue(next);\n try {\n keys[k] = nextValue;\n }\n catch (e) {\n try {\n IteratorClose(iterator);\n }\n finally {\n throw e;\n }\n }\n k++;\n }\n }\n // 6 ECMAScript Data Typ0es and Values\n // https://tc39.github.io/ecma262/#sec-ecmascript-data-types-and-values\n function Type(x) {\n if (x === null)\n return 1 /* Null */;\n switch (typeof x) {\n case \"undefined\": return 0 /* Undefined */;\n case \"boolean\": return 2 /* Boolean */;\n case \"string\": return 3 /* String */;\n case \"symbol\": return 4 /* Symbol */;\n case \"number\": return 5 /* Number */;\n case \"object\": return x === null ? 1 /* Null */ : 6 /* Object */;\n default: return 6 /* Object */;\n }\n }\n // 6.1.1 The Undefined Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-undefined-type\n function IsUndefined(x) {\n return x === undefined;\n }\n // 6.1.2 The Null Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-null-type\n function IsNull(x) {\n return x === null;\n }\n // 6.1.5 The Symbol Type\n // https://tc39.github.io/ecma262/#sec-ecmascript-language-types-symbol-type\n function IsSymbol(x) {\n return typeof x === \"symbol\";\n }\n // 6.1.7 The Object Type\n // https://tc39.github.io/ecma262/#sec-object-type\n function IsObject(x) {\n return typeof x === \"object\" ? x !== null : typeof x === \"function\";\n }\n // 7.1 Type Conversion\n // https://tc39.github.io/ecma262/#sec-type-conversion\n // 7.1.1 ToPrimitive(input [, PreferredType])\n // https://tc39.github.io/ecma262/#sec-toprimitive\n function ToPrimitive(input, PreferredType) {\n switch (Type(input)) {\n case 0 /* Undefined */: return input;\n case 1 /* Null */: return input;\n case 2 /* Boolean */: return input;\n case 3 /* String */: return input;\n case 4 /* Symbol */: return input;\n case 5 /* Number */: return input;\n }\n var hint = PreferredType === 3 /* String */ ? \"string\" : PreferredType === 5 /* Number */ ? \"number\" : \"default\";\n var exoticToPrim = GetMethod(input, toPrimitiveSymbol);\n if (exoticToPrim !== undefined) {\n var result = exoticToPrim.call(input, hint);\n if (IsObject(result))\n throw new TypeError();\n return result;\n }\n return OrdinaryToPrimitive(input, hint === \"default\" ? \"number\" : hint);\n }\n // 7.1.1.1 OrdinaryToPrimitive(O, hint)\n // https://tc39.github.io/ecma262/#sec-ordinarytoprimitive\n function OrdinaryToPrimitive(O, hint) {\n if (hint === \"string\") {\n var toString_1 = O.toString;\n if (IsCallable(toString_1)) {\n var result = toString_1.call(O);\n if (!IsObject(result))\n return result;\n }\n var valueOf = O.valueOf;\n if (IsCallable(valueOf)) {\n var result = valueOf.call(O);\n if (!IsObject(result))\n return result;\n }\n }\n else {\n var valueOf = O.valueOf;\n if (IsCallable(valueOf)) {\n var result = valueOf.call(O);\n if (!IsObject(result))\n return result;\n }\n var toString_2 = O.toString;\n if (IsCallable(toString_2)) {\n var result = toString_2.call(O);\n if (!IsObject(result))\n return result;\n }\n }\n throw new TypeError();\n }\n // 7.1.2 ToBoolean(argument)\n // https://tc39.github.io/ecma262/2016/#sec-toboolean\n function ToBoolean(argument) {\n return !!argument;\n }\n // 7.1.12 ToString(argument)\n // https://tc39.github.io/ecma262/#sec-tostring\n function ToString(argument) {\n return \"\" + argument;\n }\n // 7.1.14 ToPropertyKey(argument)\n // https://tc39.github.io/ecma262/#sec-topropertykey\n function ToPropertyKey(argument) {\n var key = ToPrimitive(argument, 3 /* String */);\n if (IsSymbol(key))\n return key;\n return ToString(key);\n }\n // 7.2 Testing and Comparison Operations\n // https://tc39.github.io/ecma262/#sec-testing-and-comparison-operations\n // 7.2.2 IsArray(argument)\n // https://tc39.github.io/ecma262/#sec-isarray\n function IsArray(argument) {\n return Array.isArray\n ? Array.isArray(argument)\n : argument instanceof Object\n ? argument instanceof Array\n : Object.prototype.toString.call(argument) === \"[object Array]\";\n }\n // 7.2.3 IsCallable(argument)\n // https://tc39.github.io/ecma262/#sec-iscallable\n function IsCallable(argument) {\n // NOTE: This is an approximation as we cannot check for [[Call]] internal method.\n return typeof argument === \"function\";\n }\n // 7.2.4 IsConstructor(argument)\n // https://tc39.github.io/ecma262/#sec-isconstructor\n function IsConstructor(argument) {\n // NOTE: This is an approximation as we cannot check for [[Construct]] internal method.\n return typeof argument === \"function\";\n }\n // 7.2.7 IsPropertyKey(argument)\n // https://tc39.github.io/ecma262/#sec-ispropertykey\n function IsPropertyKey(argument) {\n switch (Type(argument)) {\n case 3 /* String */: return true;\n case 4 /* Symbol */: return true;\n default: return false;\n }\n }\n // 7.3 Operations on Objects\n // https://tc39.github.io/ecma262/#sec-operations-on-objects\n // 7.3.9 GetMethod(V, P)\n // https://tc39.github.io/ecma262/#sec-getmethod\n function GetMethod(V, P) {\n var func = V[P];\n if (func === undefined || func === null)\n return undefined;\n if (!IsCallable(func))\n throw new TypeError();\n return func;\n }\n // 7.4 Operations on Iterator Objects\n // https://tc39.github.io/ecma262/#sec-operations-on-iterator-objects\n function GetIterator(obj) {\n var method = GetMethod(obj, iteratorSymbol);\n if (!IsCallable(method))\n throw new TypeError(); // from Call\n var iterator = method.call(obj);\n if (!IsObject(iterator))\n throw new TypeError();\n return iterator;\n }\n // 7.4.4 IteratorValue(iterResult)\n // https://tc39.github.io/ecma262/2016/#sec-iteratorvalue\n function IteratorValue(iterResult) {\n return iterResult.value;\n }\n // 7.4.5 IteratorStep(iterator)\n // https://tc39.github.io/ecma262/#sec-iteratorstep\n function IteratorStep(iterator) {\n var result = iterator.next();\n return result.done ? false : result;\n }\n // 7.4.6 IteratorClose(iterator, completion)\n // https://tc39.github.io/ecma262/#sec-iteratorclose\n function IteratorClose(iterator) {\n var f = iterator[\"return\"];\n if (f)\n f.call(iterator);\n }\n // 9.1 Ordinary Object Internal Methods and Internal Slots\n // https://tc39.github.io/ecma262/#sec-ordinary-object-internal-methods-and-internal-slots\n // 9.1.1.1 OrdinaryGetPrototypeOf(O)\n // https://tc39.github.io/ecma262/#sec-ordinarygetprototypeof\n function OrdinaryGetPrototypeOf(O) {\n var proto = Object.getPrototypeOf(O);\n if (typeof O !== \"function\" || O === functionPrototype)\n return proto;\n // TypeScript doesn't set __proto__ in ES5, as it's non-standard.\n // Try to determine the superclass constructor. Compatible implementations\n // must either set __proto__ on a subclass constructor to the superclass constructor,\n // or ensure each class has a valid `constructor` property on its prototype that\n // points back to the constructor.\n // If this is not the same as Function.[[Prototype]], then this is definately inherited.\n // This is the case when in ES6 or when using __proto__ in a compatible browser.\n if (proto !== functionPrototype)\n return proto;\n // If the super prototype is Object.prototype, null, or undefined, then we cannot determine the heritage.\n var prototype = O.prototype;\n var prototypeProto = prototype && Object.getPrototypeOf(prototype);\n if (prototypeProto == null || prototypeProto === Object.prototype)\n return proto;\n // If the constructor was not a function, then we cannot determine the heritage.\n var constructor = prototypeProto.constructor;\n if (typeof constructor !== \"function\")\n return proto;\n // If we have some kind of self-reference, then we cannot determine the heritage.\n if (constructor === O)\n return proto;\n // we have a pretty good guess at the heritage.\n return constructor;\n }\n // naive Map shim\n function CreateMapPolyfill() {\n var cacheSentinel = {};\n var arraySentinel = [];\n var MapIterator = /** @class */ (function () {\n function MapIterator(keys, values, selector) {\n this._index = 0;\n this._keys = keys;\n this._values = values;\n this._selector = selector;\n }\n MapIterator.prototype[\"@@iterator\"] = function () { return this; };\n MapIterator.prototype[iteratorSymbol] = function () { return this; };\n MapIterator.prototype.next = function () {\n var index = this._index;\n if (index >= 0 && index < this._keys.length) {\n var result = this._selector(this._keys[index], this._values[index]);\n if (index + 1 >= this._keys.length) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n else {\n this._index++;\n }\n return { value: result, done: false };\n }\n return { value: undefined, done: true };\n };\n MapIterator.prototype.throw = function (error) {\n if (this._index >= 0) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n throw error;\n };\n MapIterator.prototype.return = function (value) {\n if (this._index >= 0) {\n this._index = -1;\n this._keys = arraySentinel;\n this._values = arraySentinel;\n }\n return { value: value, done: true };\n };\n return MapIterator;\n }());\n return /** @class */ (function () {\n function Map() {\n this._keys = [];\n this._values = [];\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n }\n Object.defineProperty(Map.prototype, \"size\", {\n get: function () { return this._keys.length; },\n enumerable: true,\n configurable: true\n });\n Map.prototype.has = function (key) { return this._find(key, /*insert*/ false) >= 0; };\n Map.prototype.get = function (key) {\n var index = this._find(key, /*insert*/ false);\n return index >= 0 ? this._values[index] : undefined;\n };\n Map.prototype.set = function (key, value) {\n var index = this._find(key, /*insert*/ true);\n this._values[index] = value;\n return this;\n };\n Map.prototype.delete = function (key) {\n var index = this._find(key, /*insert*/ false);\n if (index >= 0) {\n var size = this._keys.length;\n for (var i = index + 1; i < size; i++) {\n this._keys[i - 1] = this._keys[i];\n this._values[i - 1] = this._values[i];\n }\n this._keys.length--;\n this._values.length--;\n if (key === this._cacheKey) {\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n }\n return true;\n }\n return false;\n };\n Map.prototype.clear = function () {\n this._keys.length = 0;\n this._values.length = 0;\n this._cacheKey = cacheSentinel;\n this._cacheIndex = -2;\n };\n Map.prototype.keys = function () { return new MapIterator(this._keys, this._values, getKey); };\n Map.prototype.values = function () { return new MapIterator(this._keys, this._values, getValue); };\n Map.prototype.entries = function () { return new MapIterator(this._keys, this._values, getEntry); };\n Map.prototype[\"@@iterator\"] = function () { return this.entries(); };\n Map.prototype[iteratorSymbol] = function () { return this.entries(); };\n Map.prototype._find = function (key, insert) {\n if (this._cacheKey !== key) {\n this._cacheIndex = this._keys.indexOf(this._cacheKey = key);\n }\n if (this._cacheIndex < 0 && insert) {\n this._cacheIndex = this._keys.length;\n this._keys.push(key);\n this._values.push(undefined);\n }\n return this._cacheIndex;\n };\n return Map;\n }());\n function getKey(key, _) {\n return key;\n }\n function getValue(_, value) {\n return value;\n }\n function getEntry(key, value) {\n return [key, value];\n }\n }\n // naive Set shim\n function CreateSetPolyfill() {\n return /** @class */ (function () {\n function Set() {\n this._map = new _Map();\n }\n Object.defineProperty(Set.prototype, \"size\", {\n get: function () { return this._map.size; },\n enumerable: true,\n configurable: true\n });\n Set.prototype.has = function (value) { return this._map.has(value); };\n Set.prototype.add = function (value) { return this._map.set(value, value), this; };\n Set.prototype.delete = function (value) { return this._map.delete(value); };\n Set.prototype.clear = function () { this._map.clear(); };\n Set.prototype.keys = function () { return this._map.keys(); };\n Set.prototype.values = function () { return this._map.values(); };\n Set.prototype.entries = function () { return this._map.entries(); };\n Set.prototype[\"@@iterator\"] = function () { return this.keys(); };\n Set.prototype[iteratorSymbol] = function () { return this.keys(); };\n return Set;\n }());\n }\n // naive WeakMap shim\n function CreateWeakMapPolyfill() {\n var UUID_SIZE = 16;\n var keys = HashMap.create();\n var rootKey = CreateUniqueKey();\n return /** @class */ (function () {\n function WeakMap() {\n this._key = CreateUniqueKey();\n }\n WeakMap.prototype.has = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? HashMap.has(table, this._key) : false;\n };\n WeakMap.prototype.get = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? HashMap.get(table, this._key) : undefined;\n };\n WeakMap.prototype.set = function (target, value) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ true);\n table[this._key] = value;\n return this;\n };\n WeakMap.prototype.delete = function (target) {\n var table = GetOrCreateWeakMapTable(target, /*create*/ false);\n return table !== undefined ? delete table[this._key] : false;\n };\n WeakMap.prototype.clear = function () {\n // NOTE: not a real clear, just makes the previous data unreachable\n this._key = CreateUniqueKey();\n };\n return WeakMap;\n }());\n function CreateUniqueKey() {\n var key;\n do\n key = \"@@WeakMap@@\" + CreateUUID();\n while (HashMap.has(keys, key));\n keys[key] = true;\n return key;\n }\n function GetOrCreateWeakMapTable(target, create) {\n if (!hasOwn.call(target, rootKey)) {\n if (!create)\n return undefined;\n Object.defineProperty(target, rootKey, { value: HashMap.create() });\n }\n return target[rootKey];\n }\n function FillRandomBytes(buffer, size) {\n for (var i = 0; i < size; ++i)\n buffer[i] = Math.random() * 0xff | 0;\n return buffer;\n }\n function GenRandomBytes(size) {\n if (typeof Uint8Array === \"function\") {\n if (typeof crypto !== \"undefined\")\n return crypto.getRandomValues(new Uint8Array(size));\n if (typeof msCrypto !== \"undefined\")\n return msCrypto.getRandomValues(new Uint8Array(size));\n return FillRandomBytes(new Uint8Array(size), size);\n }\n return FillRandomBytes(new Array(size), size);\n }\n function CreateUUID() {\n var data = GenRandomBytes(UUID_SIZE);\n // mark as random - RFC 4122 \u00A7 4.4\n data[6] = data[6] & 0x4f | 0x40;\n data[8] = data[8] & 0xbf | 0x80;\n var result = \"\";\n for (var offset = 0; offset < UUID_SIZE; ++offset) {\n var byte = data[offset];\n if (offset === 4 || offset === 6 || offset === 8)\n result += \"-\";\n if (byte < 16)\n result += \"0\";\n result += byte.toString(16).toLowerCase();\n }\n return result;\n }\n }\n // uses a heuristic used by v8 and chakra to force an object into dictionary mode.\n function MakeDictionary(obj) {\n obj.__ = undefined;\n delete obj.__;\n return obj;\n }\n });\n})(Reflect || (Reflect = {}));\n", "/* file : exportable.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __read = (this && this.__read) || function (o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n};\nvar __spread = (this && this.__spread) || function () {\n for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));\n return ar;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nrequire(\"reflect-metadata\");\n/**\n * Clone a field of a filter (array, object or any primary type)\n * @param {*} v - Value to clone\n * @return {*} Cloned value\n */\nfunction cloneField(v) {\n if (v === null || v === undefined) {\n return v;\n }\n if (Array.isArray(v)) {\n return v.map(cloneField);\n }\n else if (typeof v === 'object') {\n if ('saveAsJSON' in v) {\n return v.saveAsJSON();\n }\n return Object.assign({}, v);\n }\n return v;\n}\nexports.cloneField = cloneField;\n/**\n * Get a function used to clone an object\n * @param type - Object type\n * @param fields - Object's fields to clone\n * @return A function that clones the given fields of an input object\n */\nfunction cloneObject(type) {\n var fields = [];\n for (var _i = 1; _i < arguments.length; _i++) {\n fields[_i - 1] = arguments[_i];\n }\n return function (obj) {\n var json = { type: type };\n fields.forEach(function (field) {\n json[field] = cloneField(obj[field]);\n });\n return json;\n };\n}\nexports.cloneObject = cloneObject;\n/**\n * Turn a datastructure into an exportable one, so it can be serialized from/to JSON objects.\n * @param specs - An object that describes how the datastructure should be exported/imported\n * @author Thomas Minier\n */\nfunction Exportable(specs) {\n return function (target) {\n target.prototype.saveAsJSON = function () {\n return specs.export(this);\n };\n target.fromJSON = function (json) {\n return specs.import(json);\n };\n return target;\n };\n}\nexports.Exportable = Exportable;\nvar METADATA_CLASSNAME = Symbol('bloom-filters:exportable:class-name');\nvar METADATA_FIELDS = Symbol('bloom-filters:exportable:fields');\nvar METADATA_PARAMETERS = Symbol('bloom-filters:exportable:constructor-parameters');\n/**\n * Register a field to be exportable/importable\n * @param importer - Function invoked on the JSON field to convert it into JavaScript\n */\nfunction Field(exporter, importer) {\n if (exporter === undefined) {\n exporter = cloneField;\n }\n if (importer === undefined) {\n importer = function (v) { return v; };\n }\n return function (target, propertyKey) {\n var fields = [];\n if (Reflect.hasMetadata(METADATA_FIELDS, target)) {\n fields = Reflect.getMetadata(METADATA_FIELDS, target);\n }\n fields.push({\n name: propertyKey,\n exporter: exporter,\n importer: importer\n });\n Reflect.defineMetadata(METADATA_FIELDS, fields, target);\n };\n}\nexports.Field = Field;\nfunction Parameter(fieldName) {\n return function (target, propertyKey, parameterIndex) {\n var parameters = new Map();\n if (Reflect.hasMetadata(METADATA_PARAMETERS, target)) {\n parameters = Reflect.getMetadata(METADATA_PARAMETERS, target);\n }\n parameters.set(fieldName, parameterIndex);\n Reflect.defineMetadata(METADATA_PARAMETERS, parameters, target);\n };\n}\nexports.Parameter = Parameter;\n/**\n * Augment a TypeScript class to make it exportable/importable, using @Field and @Parameter decorator\n * @param className - Name of the exportable/importable class\n */\nfunction AutoExportable(className, otherFields) {\n if (otherFields === void 0) { otherFields = []; }\n return function (target) {\n Reflect.defineMetadata(METADATA_CLASSNAME, className, target.prototype);\n if (!Reflect.hasMetadata(METADATA_FIELDS, target.prototype) || otherFields.length === 0) {\n throw new SyntaxError('No exported fields declared when @AutoExportable is called');\n }\n // define empty parameters map, for object with a constructor without parameters\n if (!Reflect.hasMetadata(METADATA_PARAMETERS, target)) {\n Reflect.defineMetadata(METADATA_PARAMETERS, new Map(), target);\n }\n target.prototype.saveAsJSON = function () {\n var _this = this;\n var json = { 'type': Reflect.getMetadata(METADATA_CLASSNAME, target.prototype) };\n // export fields defined using the @Field decorator\n var fields = Reflect.getMetadata(METADATA_FIELDS, target.prototype);\n fields.forEach(function (field) {\n json[field.name] = field.exporter(_this[field.name]);\n });\n // export fields declared through the otherFields parameter\n otherFields.forEach(function (field) {\n json[field] = cloneField(_this[field]);\n });\n return json;\n };\n target.fromJSON = function (json) {\n var className = Reflect.getMetadata(METADATA_CLASSNAME, target.prototype);\n var parameters = Reflect.getMetadata(METADATA_PARAMETERS, target);\n var fields = Reflect.getMetadata(METADATA_FIELDS, target.prototype);\n // validate the input JSON\n if (json.type !== className) {\n throw new Error(\"Cannot create an object \" + className + \" from a JSON export with type \\\"\" + json.type + \"\\\"\");\n }\n var constructorArgs = [];\n var copyFields = [];\n otherFields.map(function (name) { return ({ name: name, importer: function (v) { return v; } }); }).concat(fields).forEach(function (field) {\n if (!(field.name in json)) {\n throw new Error(\"Invalid import: required field \\\"\" + field + \"\\\" not found in JSON export \\\"\" + json + \"\\\"\");\n }\n // build constructor/copy arguments\n if (parameters.has(field.name)) {\n constructorArgs[parameters.get(field.name)] = field.importer(json[field.name]);\n }\n else {\n copyFields.push({\n name: field.name,\n value: field.importer(json[field.name])\n });\n }\n });\n // build new object\n var obj = new (target.bind.apply(target, __spread([void 0], constructorArgs)))();\n // write non-constructor exported fields\n copyFields.forEach(function (arg) {\n obj[arg.name] = arg.value;\n });\n return obj;\n };\n };\n}\nexports.AutoExportable = AutoExportable;\n", "/* file : formulas.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Various formulas used with Bloom Filters\n * @namespace Formulas\n * @private\n */\n/**\n * Compute the optimal size of a Bloom Filter\n * @param length - The length of the set used to fill the filter\n * @param errorRate - The targeted false positive rate\n * @return The optimal size of a Bloom Filter\n * @memberof Formulas\n */\nfunction optimalFilterSize(length, errorRate) {\n return Math.ceil(-((length * Math.log(errorRate)) / Math.pow(Math.log(2), 2)));\n}\nexports.optimalFilterSize = optimalFilterSize;\n/**\n * Compute the optimal number of hash functions to be used by a Bloom Filter\n * @param size - The size of the filter\n * @param length - The length of the set used to fill the filter\n * @return The optimal number of hash functions to be used by a Bloom Filter\n * @memberof Formulas\n */\nfunction optimalHashes(size, length) {\n return Math.ceil((size / length) * Math.log(2));\n}\nexports.optimalHashes = optimalHashes;\n", "/* file : bloom-filter.ts\nMIT License\n\nCopyright (c) 2017 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar exportable_1 = require(\"../exportable\");\nvar formulas_1 = require(\"../formulas\");\nvar utils_1 = require(\"../utils\");\n/**\n * A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970,\n * that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.\n *\n * Reference: Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422-426.\n * @see {@link http://crystal.uta.edu/~mcguigan/cse6350/papers/Bloom.pdf} for more details about classic Bloom Filters.\n * @author Thomas Minier\n * @author Arnaud Grall\n */\nvar BloomFilter = /** @class */ (function (_super) {\n __extends(BloomFilter, _super);\n /**\n * Constructor\n * @param size - The number of cells\n * @param nbHashes - The number of hash functions used\n */\n function BloomFilter(size, nbHashes) {\n var _this = _super.call(this) || this;\n if (nbHashes < 1) {\n throw new Error(\"A BloomFilter cannot uses less than one hash function, while you tried to use \" + nbHashes + \".\");\n }\n _this._size = size;\n _this._nbHashes = nbHashes;\n _this._filter = utils_1.allocateArray(_this._size, 0);\n _this._length = 0;\n return _this;\n }\n BloomFilter_1 = BloomFilter;\n /**\n * Create an optimal bloom filter providing the maximum of elements stored and the error rate desired\n * @param items - The maximum nuber of item to store\n * @param errorRate - The error rate desired for a maximum of items inserted\n * @return A new {@link BloomFilter}\n */\n BloomFilter.create = function (nbItems, errorRate) {\n var size = formulas_1.optimalFilterSize(nbItems, errorRate);\n var hashes = formulas_1.optimalHashes(size, nbItems);\n return new BloomFilter_1(size, hashes);\n };\n /**\n * Build a new Bloom Filter from an existing iterable with a fixed error rate\n * @param items - The iterable used to populate the filter\n * @param errorRate - The error rate, i.e. 'false positive' rate, targetted by the filter\n * @return A new Bloom Filter filled with the iterable's elements\n * @example\n * // create a filter with a false positive rate of 0.1\n * const filter = BloomFilter.from(['alice', 'bob', 'carl'], 0.1);\n */\n BloomFilter.from = function (items, errorRate) {\n var array = Array.from(items);\n var filter = BloomFilter_1.create(array.length, errorRate);\n array.forEach(function (element) { return filter.add(element); });\n return filter;\n };\n /**\n * Import an existing bloom filter from a Uint8Array\n * @param bytes - The existing bloom filter as Uint8Array\n * @param nbHashes - The number of hash functions used\n * @return A {@link BloomFilter} from the bytes array\n */\n BloomFilter.fromBytes = function (bytes, nbHashes) {\n var bits = [];\n for (var i = 0; i < bytes.length; i++) {\n var slice = utils_1.uint8ToBits(bytes[i]);\n bits = bits.concat(slice);\n }\n var filter = new BloomFilter_1(bits.length, nbHashes);\n filter._filter = bits;\n return filter;\n };\n Object.defineProperty(BloomFilter.prototype, \"size\", {\n /**\n * Get the optimal size of the filter\n * @return The size of the filter\n */\n get: function () {\n return this._size;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(BloomFilter.prototype, \"length\", {\n /**\n * Get the number of elements currently in the filter\n * @return The filter length\n */\n get: function () {\n return this._length;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Add an element to the filter\n * @param element - The element to add\n * @example\n * const filter = new BloomFilter(15, 0.1);\n * filter.add('foo');\n */\n BloomFilter.prototype.add = function (element) {\n var indexes = utils_1.getDistinctIndices(element, this._size, this._nbHashes, this.seed);\n for (var i = 0; i < indexes.length; i++) {\n this._filter[indexes[i]] = 1;\n }\n this._length++;\n };\n /**\n * Test an element for membership\n * @param element - The element to look for in the filter\n * @return False if the element is definitively not in the filter, True is the element might be in the filter\n * @example\n * const filter = new BloomFilter(15, 0.1);\n * filter.add('foo');\n * console.log(filter.has('foo')); // output: true\n * console.log(filter.has('bar')); // output: false\n */\n BloomFilter.prototype.has = function (element) {\n var indexes = utils_1.getDistinctIndices(element, this._size, this._nbHashes, this.seed);\n for (var i = 0; i < indexes.length; i++) {\n if (!this._filter[indexes[i]]) {\n return false;\n }\n }\n return true;\n };\n /**\n * Get the current false positive rate (or error rate) of the filter\n * @return The current false positive rate of the filter\n * @example\n * const filter = new BloomFilter(15, 0.1);\n * console.log(filter.rate()); // output: something around 0.1\n */\n BloomFilter.prototype.rate = function () {\n return Math.pow(1 - Math.exp((-this._nbHashes * this._length) / this._size), this._nbHashes);\n };\n /**\n * Check if another Bloom Filter is equal to this one\n * @param filter - The filter to compare to this one\n * @return True if they are equal, false otherwise\n */\n BloomFilter.prototype.equals = function (other) {\n if (this._size !== other._size || this._nbHashes !== other._nbHashes) {\n return false;\n }\n return this._filter.every(function (value, index) { return other._filter[index] === value; });\n };\n /**\n * Exports to a Uint8Array\n * @return Uint8Array of filter\n */\n BloomFilter.prototype.toBytes = function () {\n var arr = new Uint8Array(Math.ceil(this._size / 8));\n for (var i = 0; i < arr.length; i++) {\n var bits = this._filter.slice(i * 8, i * 8 + 8);\n arr[i] = utils_1.bitsToUint8(bits);\n }\n return arr;\n };\n var BloomFilter_1;\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], BloomFilter.prototype, \"_size\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], BloomFilter.prototype, \"_nbHashes\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], BloomFilter.prototype, \"_filter\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], BloomFilter.prototype, \"_length\", void 0);\n BloomFilter = BloomFilter_1 = __decorate([\n exportable_1.AutoExportable('BloomFilter', ['_seed']),\n __param(0, exportable_1.Parameter('_size')), __param(1, exportable_1.Parameter('_nbHashes')),\n __metadata(\"design:paramtypes\", [Number, Number])\n ], BloomFilter);\n return BloomFilter;\n}(base_filter_1.default));\nexports.default = BloomFilter;\n", "/* file : counting-bloom-filter.ts\nMIT License\n\nCopyright (c) 2017 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar exportable_1 = require(\"../exportable\");\nvar formulas_1 = require(\"../formulas\");\nvar utils_1 = require(\"../utils\");\n/**\n * A Counting Bloom filter works in a similar manner as a regular Bloom filter; however, it is able to keep track of insertions and deletions. In a counting Bloom filter, each entry in the Bloom filter is a small counter associated with a basic Bloom filter bit.\n *\n * Reference: F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, \u201CAn Improved Construction for Counting Bloom Filters,\u201D in 14th Annual European Symposium on Algorithms, LNCS 4168, 2006, pp.\n684\u2013695.\n * @author Thomas Minier & Arnaud Grall\n */\nvar CountingBloomFilter = /** @class */ (function (_super) {\n __extends(CountingBloomFilter, _super);\n /**\n * Constructor\n * @param size - The size of the filter\n * @param nbHashes - The number of hash functions\n */\n function CountingBloomFilter(size, nbHashes) {\n var _this = _super.call(this) || this;\n if (nbHashes < 1) {\n throw new Error(\"A CountingBloomFilter must used at least one hash function, but you tried to use \" + nbHashes + \" functions. Consider increasing it.\");\n }\n _this._size = size; // fm.optimalFilterSize(capacity, errorRate)\n _this._nbHashes = nbHashes; // fm.optimalHashes(this._size, capacity)\n // the filter contains tuples [bit, counter]\n _this._filter = utils_1.allocateArray(_this._size, function () { return [0, 0]; });\n _this._length = 0;\n return _this;\n }\n CountingBloomFilter_1 = CountingBloomFilter;\n /**\n * Allocate a CountingBloomFilter with a target maximum capacity and error rate\n * @param capacity - The maximum capacity of the filter\n * @param errorRate - The error rate of the filter\n * @return A new {@link CountingBloomFilter}\n */\n CountingBloomFilter.create = function (capacity, errorRate) {\n var s = formulas_1.optimalFilterSize(capacity, errorRate);\n return new CountingBloomFilter_1(s, formulas_1.optimalHashes(s, capacity));\n };\n /**\n * Build a new Bloom Filter from an iterable with a fixed error rate\n * @param items - Iterable used to populate the filter\n * @param errorRate - The error rate of the filter\n * @return A new Bloom Filter filled with the iterable's elements\n * @example\n * // create a filter with a false positive rate of 0.1\n * const filter = CountingBloomFilter.from(['alice', 'bob', 'carl'], 0.1);\n */\n CountingBloomFilter.from = function (items, errorRate) {\n var array = Array.from(items);\n var filter = CountingBloomFilter_1.create(array.length, errorRate);\n array.forEach(function (element) { return filter.add(element); });\n return filter;\n };\n Object.defineProperty(CountingBloomFilter.prototype, \"size\", {\n /**\n * Get the optimal size of the filter\n */\n get: function () {\n return this._size;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CountingBloomFilter.prototype, \"length\", {\n /**\n * Get the number of elements currently in the filter\n */\n get: function () {\n return this._length;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Add an element to the filter\n * @param element - The element to add\n * @example\n * const filter = new CountingBloomFilter(15, 0.1);\n * filter.add('foo');\n */\n CountingBloomFilter.prototype.add = function (element) {\n var indexes = utils_1.getDistinctIndices(element, this._size, this._nbHashes, this.seed);\n for (var i = 0; i < indexes.length; i++) {\n // increment counter\n this._filter[indexes[i]][1] += 1;\n // set bit if necessary\n if (this._filter[indexes[i]][1] > 0) {\n this._filter[indexes[i]][0] = 1;\n }\n }\n this._length++;\n };\n /**\n * Remove an element from the filter\n * @param element - The element to delete\n * @example\n * const filter = new CountingBloomFilter(15, 0.1);\n * filter.remove('foo');\n */\n CountingBloomFilter.prototype.remove = function (element) {\n var indexes = utils_1.getDistinctIndices(element, this._size, this._nbHashes, this.seed);\n var success = true;\n for (var i = 0; i < indexes.length; i++) {\n // decrement counter\n this._filter[indexes[i]][1] -= 1;\n // set bit if necessary\n if (this._filter[indexes[i]][1] <= 0) {\n this._filter[indexes[i]][0] = 0;\n }\n }\n this._length--;\n return success;\n };\n /**\n * Test an element for membership\n * @param element - The element to look for in the filter\n * @return False if the element is definitively not in the filter, True is the element might be in the filter\n * @example\n * const filter = new CountingBloomFilter(15, 0.1);\n * filter.add('foo');\n * console.log(filter.has('foo')); // output: true\n * console.log(filter.has('bar')); // output: false\n */\n CountingBloomFilter.prototype.has = function (element) {\n var indexes = utils_1.getDistinctIndices(element, this._size, this._nbHashes, this.seed);\n for (var i = 0; i < indexes.length; i++) {\n if (!this._filter[indexes[i]][0]) {\n return false;\n }\n }\n return true;\n };\n /**\n * Get the current false positive rate (or error rate) of the filter\n * @return The current false positive rate of the filter\n * @example\n * const filter = new BloomFilter(15, 0.1);\n * console.log(filter.rate()); // output: something around 0.1\n */\n CountingBloomFilter.prototype.rate = function () {\n return Math.pow(1 - Math.exp((-this._nbHashes * this._length) / this._size), this._nbHashes);\n };\n /**\n * Check if another Counting Bloom Filter is equal to this one\n * @param filter - The filter to compare to this one\n * @return True if they are equal, false otherwise\n */\n CountingBloomFilter.prototype.equals = function (other) {\n if (this._size !== other._size || this._nbHashes !== other._nbHashes || this._length !== other._length) {\n return false;\n }\n return this._filter.every(function (value, index) { return other._filter[index][0] === value[0] && other._filter[index][1] === value[1]; });\n };\n var CountingBloomFilter_1;\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], CountingBloomFilter.prototype, \"_size\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], CountingBloomFilter.prototype, \"_nbHashes\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], CountingBloomFilter.prototype, \"_filter\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], CountingBloomFilter.prototype, \"_length\", void 0);\n CountingBloomFilter = CountingBloomFilter_1 = __decorate([\n exportable_1.AutoExportable('CountingBloomFilter', ['_seed']),\n __param(0, exportable_1.Parameter('_size')), __param(1, exportable_1.Parameter('_nbHashes')),\n __metadata(\"design:paramtypes\", [Number, Number])\n ], CountingBloomFilter);\n return CountingBloomFilter;\n}(base_filter_1.default));\nexports.default = CountingBloomFilter;\n", "/* file : partitioned-bloom-filter.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar exportable_1 = require(\"../exportable\");\nvar utils_1 = require(\"../utils\");\n/**\n * Return the optimal number of hashes needed for a given error rate and load factor\n * P = p^k <=> k = ln(P)/ln(p)\n * @param errorRate - The provided error rate\n * @param loadFactor - The load factor, ideally 0.5\n * @return The number of hash function to use\n */\nfunction computeOptimalNumberOfhashes(errorRate, loadFactor) {\n // P = p^k <=> k = ln(P)/ln(p)\n return Math.ceil(Math.log(errorRate) / Math.log(loadFactor));\n}\n/**\n * Return the total number of bits needed for this filter\n * n = M*(ln(p)ln(1-p))/(-ln(P)) <=> M = (n*-ln(P)/(ln(p)ln(1-p))\n * @param size - The number of desired items\n * @param rate - The error rate desired\n * @param loadFactor - The load factor desired\n * @return The total number of cells this filter will have\n */\nfunction computeOptimalNumberOfCells(size, rate, loadFactor) {\n // n=M*(ln(p)ln(1-p))/(-ln(P)) <=> M=(n*-ln(P)/(ln(p)ln(1-p))\n return Math.ceil((size * -Math.log(rate)) / (Math.log(loadFactor) * Math.log(1 - loadFactor)));\n}\n/**\n * Return the maximum number of items this filter can store\n * @param totalBits - The total number of cells in the filter\n * @param loadFactor - The load factor desired\n * @param nbHashes - The number of hash functions used\n * @return The maximum number of items this filter store\n */\nfunction computeNumberOfItems(totalBits, loadFactor, nbHashes) {\n return Math.ceil(totalBits * (Math.log(loadFactor) * Math.log(1 - loadFactor)) / (-(nbHashes * Math.log(loadFactor))));\n}\n/**\n * A Partitioned Bloom Filter is a variation of a classic Bloom filter.\n *\n * This filter works by partitioning the M-sized bit array into k slices of size m = M/k bits, k = nb of hash functions in the filter.\n * Each hash function produces an index over m for its respective slice.\n * Thus, each element is described by exactly k bits, meaning the distribution of false positives is uniform across all elements.\n *\n * Be careful, as a Partitioned Bloom Filter have much higher collison risks that a classic Bloom Filter on small sets of data.\n *\n * Reference: Chang, F., Feng, W. C., & Li, K. (2004, March). Approximate caches for packet classification. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies (Vol. 4, pp. 2196-2207). IEEE.\n * @see {@link https://pdfs.semanticscholar.org/0e18/e24b37a1f4196fddf8c9ff8e4368b74cfd88.pdf} for more details about Partitioned Bloom Filters\n * @author Thomas Minier & Arnaud Grall\n */\nvar PartitionedBloomFilter = /** @class */ (function (_super) {\n __extends(PartitionedBloomFilter, _super);\n /**\n * Constructor\n * @param size - The total number of cells\n * @param nbHashes - The number of hash functions\n * @param loadFactor - The load factor\n * @param capacity - The filter capacity\n */\n function PartitionedBloomFilter(size, nbHashes, loadFactor, capacity) {\n var _this = _super.call(this) || this;\n _this._size = size;\n _this._nbHashes = nbHashes;\n _this._loadFactor = loadFactor;\n _this._m = Math.ceil(_this._size / _this._nbHashes);\n _this._filter = utils_1.allocateArray(_this._nbHashes, function () { return utils_1.allocateArray(_this._m, 0); });\n _this._capacity = (capacity !== undefined) ? capacity : computeNumberOfItems(_this._size, loadFactor, nbHashes);\n _this._length = 0;\n return _this;\n }\n PartitionedBloomFilter_1 = PartitionedBloomFilter;\n /**\n * Return a PartitionedBloomFilter for a given number of elements and under a given error rate\n * @param size - The max allowable number of items to insert\n * @param errorRate - The desired error rate\n * @return A new PartitionedBloomFilter optimal for the given parameters\n */\n PartitionedBloomFilter.create = function (size, errorRate, loadFactor) {\n if (loadFactor === void 0) { loadFactor = 0.5; }\n var capacity = computeOptimalNumberOfCells(size, errorRate, loadFactor);\n var nbHashes = computeOptimalNumberOfhashes(errorRate, loadFactor);\n return new PartitionedBloomFilter_1(capacity, nbHashes, loadFactor, size);\n };\n /**\n * Build a new Partitioned Bloom Filter from an existing iterable with a fixed error rate\n * @param items - The iterable used to populate the filter\n * @param errorRate - The error rate, i.e. 'false positive' rate, targetted by the filter\n * @param loadFactor - The filter's load factor\n * @return A new Bloom Filter filled with the iterable's elements\n * @example\n * // create a filter with a false positive rate of 0.1\n * const filter = PartitionedBloomFilter.from(['alice', 'bob', 'carl'], 0.1);\n */\n PartitionedBloomFilter.from = function (items, errorRate, loadFactor) {\n if (loadFactor === void 0) { loadFactor = 0.5; }\n var array = Array.from(items);\n var filter = PartitionedBloomFilter_1.create(array.length, errorRate, loadFactor);\n array.forEach(function (element) { return filter.add(element); });\n return filter;\n };\n Object.defineProperty(PartitionedBloomFilter.prototype, \"capacity\", {\n /**\n * Get the filter capacity, i.e. the maximum number of elements it will contains\n */\n get: function () {\n return this._capacity;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(PartitionedBloomFilter.prototype, \"size\", {\n /**\n * Get the size of the filter\n */\n get: function () {\n return this._size;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(PartitionedBloomFilter.prototype, \"length\", {\n /**\n * Get the number of elements currently in the filter\n */\n get: function () {\n return this._length;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(PartitionedBloomFilter.prototype, \"loadFactor\", {\n /**\n * Get the filter's load factor\n */\n get: function () {\n return this._loadFactor;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Add an element to the filter\n * @param element - The element to add\n * @example\n * const filter = new PartitionedBloomFilter(15, 0.1);\n * filter.add('foo');\n */\n PartitionedBloomFilter.prototype.add = function (element) {\n var indexes = utils_1.getIndices(element, this._m, this._nbHashes, this.seed);\n for (var i = 0; i < this._nbHashes; i++) {\n this._filter[i][indexes[i]] = 1;\n }\n this._length++;\n };\n /**\n * Test an element for membership\n * @param element - The element to look for in the filter\n * @return False if the element is definitively not in the filter, True is the element might be in the filter\n * @example\n * const filter = new PartitionedBloomFilter(15, 0.1);\n * filter.add('foo');\n * console.log(filter.has('foo')); // output: true\n * console.log(filter.has('bar')); // output: false\n */\n PartitionedBloomFilter.prototype.has = function (element) {\n var indexes = utils_1.getIndices(element, this._m, this._nbHashes, this.seed);\n for (var i = 0; i < this._nbHashes; i++) {\n if (!this._filter[i][indexes[i]]) {\n return false;\n }\n }\n return true;\n };\n /**\n * Compute the current false positive rate (or error rate) of the filter\n * @return The current false positive rate of the filter\n * @example\n * const filter = PartitionedBloomFilter.create(15, 0.1);\n * console.log(filter.rate()); // output: something around 0.1\n */\n PartitionedBloomFilter.prototype.rate = function () {\n // get the error rate for the first bucket (1 - (1 - 1/m)^n), where m is the size of a slice and n is the number of inserted elements\n var p = this._currentload();\n // P = p^k\n return Math.pow(p, this._nbHashes);\n };\n /**\n * Check if another Partitioned Bloom Filter is equal to this one\n * @param filter - The filter to compare to this one\n * @return True if they are equal, false otherwise\n */\n PartitionedBloomFilter.prototype.equals = function (other) {\n if (this._size !== other._size || this._nbHashes !== other._nbHashes || this._length !== other._length || this._loadFactor !== other._loadFactor) {\n return false;\n }\n return this._filter.every(function (array, outerIndex) { return other._filter[outerIndex].every(function (item, innerIndex) { return array[innerIndex] === item; }); });\n };\n /**\n * Return the current load of this filter, iterate on all buckets\n * @return An integer between 0 and 1, where 0 = filter empty and 1 = filter full\n */\n PartitionedBloomFilter.prototype._currentload = function () {\n var values = this._filter.map(function (bucket) {\n return bucket.reduce(function (a, b) { return a + b; }, 0);\n });\n var used = values.reduce(function (a, b) { return a + b; }, 0);\n return used / this._size;\n };\n var PartitionedBloomFilter_1;\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], PartitionedBloomFilter.prototype, \"_size\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], PartitionedBloomFilter.prototype, \"_nbHashes\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], PartitionedBloomFilter.prototype, \"_loadFactor\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], PartitionedBloomFilter.prototype, \"_m\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], PartitionedBloomFilter.prototype, \"_filter\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], PartitionedBloomFilter.prototype, \"_capacity\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], PartitionedBloomFilter.prototype, \"_length\", void 0);\n PartitionedBloomFilter = PartitionedBloomFilter_1 = __decorate([\n exportable_1.AutoExportable('PartitionedBloomFilter', ['_seed']),\n __param(0, exportable_1.Parameter('_size')), __param(1, exportable_1.Parameter('_nbHashes')), __param(2, exportable_1.Parameter('_loadFactor')), __param(3, exportable_1.Parameter('_capacity')),\n __metadata(\"design:paramtypes\", [Number, Number, Number, Number])\n ], PartitionedBloomFilter);\n return PartitionedBloomFilter;\n}(base_filter_1.default));\nexports.default = PartitionedBloomFilter;\n", "/* file : count-min-sketch.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __values = (this && this.__values) || function(o) {\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n if (m) return m.call(o);\n if (o && typeof o.length === \"number\") return {\n next: function () {\n if (o && i >= o.length) o = void 0;\n return { value: o && o[i++], done: !o };\n }\n };\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar exportable_1 = require(\"../exportable\");\nvar utils_1 = require(\"../utils\");\n/**\n * The count\u2013min sketch (CM sketch) is a probabilistic data structure that serves as a frequency table of events in a stream of data.\n * It uses hash functions to map events to frequencies, but unlike a hash table uses only sub-linear space, at the expense of overcounting some events due to collisions.\n *\n * Reference: Cormode, G., & Muthukrishnan, S. (2005). An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1), 58-75.\n * @see {@link http://vaffanculo.twiki.di.uniroma1.it/pub/Ing_algo/WebHome/p14_Cormode_JAl_05.pdf} for more details on Count Min Sketch\n * @extends Exportable\n * @author Thomas Minier & Arnaud Grall\n */\nvar CountMinSketch = /** @class */ (function (_super) {\n __extends(CountMinSketch, _super);\n /**\n * Constructor\n * @param columns - Number of columns\n * @param rows - Number of rows\n */\n function CountMinSketch(columns, rows) {\n var _this = _super.call(this) || this;\n _this._columns = columns;\n _this._rows = rows;\n _this._matrix = utils_1.allocateArray(_this._rows, function () { return utils_1.allocateArray(_this._columns, 0); });\n _this._allSums = 0;\n return _this;\n }\n CountMinSketch_1 = CountMinSketch;\n /**\n * Create a count-min sketch, with a target error rate and probability of accuracy\n * @param errorRate - The error rate\n * @param accuracy - The probability of accuracy\n * @return A new Count Min Sketch optimal for the input parameters\n */\n CountMinSketch.create = function (errorRate, accuracy) {\n if (accuracy === void 0) { accuracy = 0.999; }\n // columns = Math.ceil(Math.E / epsilon) and rows = Math.ceil(Math.log(1 / delta))\n var columns = Math.ceil(Math.E / errorRate);\n var rows = Math.ceil(Math.log(1 / accuracy));\n return new CountMinSketch_1(columns, rows);\n };\n /**\n * Create a Count Min Sketch from a set of items, with a target error rate and probability of accuracy\n * @param items - An iterable to yield items to be inserted into the filter\n * @param errorRate - The error rate\n * @param accuracy - The probability of accuracy\n * @return A new Count Min Sketch filled with the iterable's items.\n */\n CountMinSketch.from = function (items, errorRate, accuracy) {\n var e_1, _a;\n if (accuracy === void 0) { accuracy = 0.999; }\n var filter = CountMinSketch_1.create(errorRate, accuracy);\n try {\n for (var items_1 = __values(items), items_1_1 = items_1.next(); !items_1_1.done; items_1_1 = items_1.next()) {\n var item = items_1_1.value;\n filter.update(item);\n }\n }\n catch (e_1_1) { e_1 = { error: e_1_1 }; }\n finally {\n try {\n if (items_1_1 && !items_1_1.done && (_a = items_1.return)) _a.call(items_1);\n }\n finally { if (e_1) throw e_1.error; }\n }\n return filter;\n };\n Object.defineProperty(CountMinSketch.prototype, \"columns\", {\n /**\n * Return the number of columns in the sketch\n */\n get: function () {\n return this._columns;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CountMinSketch.prototype, \"rows\", {\n /**\n * Return the number of rows in the sketch\n */\n get: function () {\n return this._rows;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CountMinSketch.prototype, \"sum\", {\n /**\n * Get the sum of all counts in the sketch\n */\n get: function () {\n return this._allSums;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Update the count min sketch with a new occurrence of an element\n * @param element - The new element\n * @param count - Number of occurences of the elemnt (defauls to one)\n */\n CountMinSketch.prototype.update = function (element, count) {\n if (count === void 0) { count = 1; }\n this._allSums += count;\n var indexes = utils_1.getDistinctIndices(element, this._columns, this._rows, this.seed);\n for (var i = 0; i < this._rows; i++) {\n this._matrix[i][indexes[i]] += count;\n }\n };\n /**\n * Perform a point query: estimate the number of occurence of an element\n * @param element - The element we want to count\n * @return The estimate number of occurence of the element\n */\n CountMinSketch.prototype.count = function (element) {\n var min = Infinity;\n var indexes = utils_1.getDistinctIndices(element, this._columns, this._rows, this.seed);\n for (var i = 0; i < this._rows; i++) {\n var v = this._matrix[i][indexes[i]];\n min = Math.min(v, min);\n }\n return min;\n };\n /**\n * Check if another Count Min Sketch is equal to this one\n * @param filter - The filter to compare to this one\n * @return True if they are equal, false otherwise\n */\n CountMinSketch.prototype.equals = function (other) {\n if (this._columns !== other._columns || this._rows !== other._rows) {\n return false;\n }\n for (var i = 0; i < this._rows; i++) {\n for (var j = 0; j < this._columns; j++) {\n if (this._matrix[i][j] !== other._matrix[i][j]) {\n return false;\n }\n }\n }\n return true;\n };\n /**\n * Merge (in place) this sketch with another sketch, if they have the same number of columns and rows.\n * @param sketch - The sketch to merge with\n */\n CountMinSketch.prototype.merge = function (sketch) {\n if (this._columns !== sketch._columns) {\n throw new Error('Cannot merge two sketches with different number of columns');\n }\n if (this._rows !== sketch._rows) {\n throw new Error('Cannot merge two sketches with different number of rows');\n }\n for (var i = 0; i < this._rows; i++) {\n for (var j = 0; j < this._columns; j++) {\n this._matrix[i][j] += sketch._matrix[i][j];\n }\n }\n };\n /**\n * Clone the sketch\n * @return A new cloned sketch\n */\n CountMinSketch.prototype.clone = function () {\n var sketch = new CountMinSketch_1(this._columns, this._rows);\n sketch.merge(this);\n sketch.seed = this.seed;\n return sketch;\n };\n var CountMinSketch_1;\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], CountMinSketch.prototype, \"_columns\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], CountMinSketch.prototype, \"_rows\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], CountMinSketch.prototype, \"_matrix\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], CountMinSketch.prototype, \"_allSums\", void 0);\n CountMinSketch = CountMinSketch_1 = __decorate([\n exportable_1.AutoExportable('CountMinSketch', ['_seed']),\n __param(0, exportable_1.Parameter('_columns')), __param(1, exportable_1.Parameter('_rows')),\n __metadata(\"design:paramtypes\", [Number, Number])\n ], CountMinSketch);\n return CountMinSketch;\n}(base_filter_1.default));\nexports.default = CountMinSketch;\n", "\"use strict\";\n/* file: hyperloglog.ts\nMIT License\n\nCopyright (c) 2019-2020 Thomas Minier\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 all\ncopies 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 THE\nSOFTWARE.\n*/\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar exportable_1 = require(\"../exportable\");\nvar utils_1 = require(\"../utils\");\n// 2^32, computed as a constant as we use it a lot in the HyperLogLog algorithm\nvar TWO_POW_32 = Math.pow(2, 32);\n/**\n * Estimlate the bias-correction constant, denoted alpha in the algorithm, based on the number of registers.\n * As alpha is pretty expensive to compute, we estimate it with the formula from Flajolet et al.\n * @param m - Number of registers in the HyperLogLog algorithm\n * @return The estimated bias-correction constant\n */\nfunction computeAlpha(m) {\n switch (m) {\n case 16:\n return 0.673;\n case 32:\n return 0.697;\n case 64:\n return 0.709;\n default:\n return 0.7213 / (1.0 + 1.079 / m);\n }\n}\n/**\n * HyperLogLog is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset.\n * @see HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm {@link http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf}\n * @author Thomas Minier\n */\nvar HyperLogLog = /** @class */ (function (_super) {\n __extends(HyperLogLog, _super);\n /**\n * Constructor\n * @param nbRegisters - The number of registers to use\n */\n function HyperLogLog(nbRegisters) {\n var _this = _super.call(this) || this;\n _this._nbRegisters = nbRegisters;\n _this._nbBytesPerHash = Math.round(Math.log2(nbRegisters));\n _this._correctionBias = computeAlpha(nbRegisters);\n _this._registers = utils_1.allocateArray(_this._nbRegisters, 0);\n return _this;\n }\n HyperLogLog_1 = HyperLogLog;\n Object.defineProperty(HyperLogLog.prototype, \"nbRegisters\", {\n /**\n * Get the number of registers used by the HyperLogLog\n */\n get: function () {\n return this._nbRegisters;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Update The multiset with a new element\n * @param element - Element to add\n */\n HyperLogLog.prototype.update = function (element) {\n // const hashedValue = Buffer.from(hashAsString(element, this.seed))\n var hashedValue = utils_1.hashAsInt(element, this.seed).toString(2);\n var registerIndex = 1 + parseInt(hashedValue.slice(0, this._nbBytesPerHash - 1), 2);\n // find the left most 1-bit in the second part of the buffer \n var secondPart = hashedValue.slice(this._nbBytesPerHash);\n var posLeftMost = 0;\n while (secondPart[posLeftMost] !== '1' && posLeftMost < secondPart.length - 1) {\n posLeftMost++;\n }\n // update the register\n this._registers[registerIndex] = Math.max(this._registers[registerIndex], posLeftMost);\n };\n /**\n * Estimate the cardinality of the multiset\n * @return The estimated cardinality of the multiset\n */\n HyperLogLog.prototype.count = function (round) {\n if (round === void 0) { round = false; }\n // Use the standard HyperLogLog estimator\n var harmonicMean = this._registers.reduce(function (acc, value) { return acc + Math.pow(2, -value); }, 0);\n var estimation = (this._correctionBias * Math.pow(this._nbRegisters, 2)) / harmonicMean;\n // use linear counting to correct the estimation if E < 5m/2 and some registers are set to zero\n /*if (estimation < ((5/2) * this._nbRegisters) && this._registers.some(value => value === 0)) {\n const nbZeroRegisters = this._registers.filter(value => value === 0).length\n estimation = this._nbRegisters * Math.log(this._nbRegisters / nbZeroRegisters)\n }*/\n // correct the estimation for very large registers\n if (estimation > (TWO_POW_32 / 30)) {\n estimation = -TWO_POW_32 * Math.log(1 - (estimation / TWO_POW_32));\n }\n // round if required\n if (round) {\n estimation = Math.round(estimation);\n }\n return estimation;\n };\n /**\n * Compute the accuracy of the cardinality estimation produced by this HyperLogLog\n * @return The accuracy of the cardinality estimation\n */\n HyperLogLog.prototype.accuracy = function () {\n return 1.04 / Math.sqrt(this._nbRegisters);\n };\n /**\n * Perform the union with another HyperLogLog multiset\n * @param other - Multiset ot merge with\n * @return The union of the two multisets\n */\n HyperLogLog.prototype.merge = function (other) {\n if (this.nbRegisters !== other.nbRegisters) {\n throw new Error(\"Two HyperLogLog must have the same number of registers to be merged. Tried to merge two HyperLogLog with m = \" + this.nbRegisters + \" and m = \" + other.nbRegisters);\n }\n var newSketch = new HyperLogLog_1(this.nbRegisters);\n for (var i = 0; i < this.nbRegisters - 1; i++) {\n newSketch._registers[i] = Math.max(this._registers[i], other._registers[i]);\n }\n return newSketch;\n };\n /**\n * Check if another HyperLogLog is equal to this one\n * @param other - The HyperLogLog to compare to this one\n * @return True if they are equal, false otherwise\n */\n HyperLogLog.prototype.equals = function (other) {\n if (this.nbRegisters !== other.nbRegisters) {\n return false;\n }\n for (var i = 0; i < this.nbRegisters - 1; i++) {\n if (this._registers[i] !== other._registers[i]) {\n return false;\n }\n }\n return true;\n };\n var HyperLogLog_1;\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], HyperLogLog.prototype, \"_nbRegisters\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], HyperLogLog.prototype, \"_nbBytesPerHash\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], HyperLogLog.prototype, \"_correctionBias\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], HyperLogLog.prototype, \"_registers\", void 0);\n HyperLogLog = HyperLogLog_1 = __decorate([\n exportable_1.AutoExportable('HyperLogLog', ['_seed']),\n __param(0, exportable_1.Parameter('_nbRegisters')),\n __metadata(\"design:paramtypes\", [Number])\n ], HyperLogLog);\n return HyperLogLog;\n}(base_filter_1.default));\nexports.default = HyperLogLog;\n", "/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n var undefined;\n\n /** Used as the semantic version number. */\n var VERSION = '4.17.21';\n\n /** Used as the size to enable large array optimizations. */\n var LARGE_ARRAY_SIZE = 200;\n\n /** Error message constants. */\n var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n FUNC_ERROR_TEXT = 'Expected a function',\n INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n /** Used to stand-in for `undefined` hash values. */\n var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n /** Used as the maximum memoize cache size. */\n var MAX_MEMOIZE_SIZE = 500;\n\n /** Used as the internal argument placeholder. */\n var PLACEHOLDER = '__lodash_placeholder__';\n\n /** Used to compose bitmasks for cloning. */\n var CLONE_DEEP_FLAG = 1,\n CLONE_FLAT_FLAG = 2,\n CLONE_SYMBOLS_FLAG = 4;\n\n /** Used to compose bitmasks for value comparisons. */\n var COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n /** Used to compose bitmasks for function metadata. */\n var WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256,\n WRAP_FLIP_FLAG = 512;\n\n /** Used as default options for `_.truncate`. */\n var DEFAULT_TRUNC_LENGTH = 30,\n DEFAULT_TRUNC_OMISSION = '...';\n\n /** Used to detect hot functions by number of calls within a span of milliseconds. */\n var HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n /** Used to indicate the type of lazy iteratees. */\n var LAZY_FILTER_FLAG = 1,\n LAZY_MAP_FLAG = 2,\n LAZY_WHILE_FLAG = 3;\n\n /** Used as references for various `Number` constants. */\n var INFINITY = 1 / 0,\n MAX_SAFE_INTEGER = 9007199254740991,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n /** Used as references for the maximum length and index of an array. */\n var MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n /** Used to associate wrap methods with their bit flags. */\n var wrapFlags = [\n ['ary', WRAP_ARY_FLAG],\n ['bind', WRAP_BIND_FLAG],\n ['bindKey', WRAP_BIND_KEY_FLAG],\n ['curry', WRAP_CURRY_FLAG],\n ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n ['flip', WRAP_FLIP_FLAG],\n ['partial', WRAP_PARTIAL_FLAG],\n ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n ['rearg', WRAP_REARG_FLAG]\n ];\n\n /** `Object#toString` result references. */\n var argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n asyncTag = '[object AsyncFunction]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n domExcTag = '[object DOMException]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n nullTag = '[object Null]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n proxyTag = '[object Proxy]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]',\n undefinedTag = '[object Undefined]',\n weakMapTag = '[object WeakMap]',\n weakSetTag = '[object WeakSet]';\n\n var arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]',\n float32Tag = '[object Float32Array]',\n float64Tag = '[object Float64Array]',\n int8Tag = '[object Int8Array]',\n int16Tag = '[object Int16Array]',\n int32Tag = '[object Int32Array]',\n uint8Tag = '[object Uint8Array]',\n uint8ClampedTag = '[object Uint8ClampedArray]',\n uint16Tag = '[object Uint16Array]',\n uint32Tag = '[object Uint32Array]';\n\n /** Used to match empty string literals in compiled template source. */\n var reEmptyStringLeading = /\\b__p \\+= '';/g,\n reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n /** Used to match HTML entities and HTML characters. */\n var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n reUnescapedHtml = /[&<>\"']/g,\n reHasEscapedHtml = RegExp(reEscapedHtml.source),\n reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n /** Used to match template delimiters. */\n var reEscape = /<%-([\\s\\S]+?)%>/g,\n reEvaluate = /<%([\\s\\S]+?)%>/g,\n reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n /** Used to match property names within property paths. */\n var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/,\n rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n /**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\n var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n reHasRegExpChar = RegExp(reRegExpChar.source);\n\n /** Used to match leading whitespace. */\n var reTrimStart = /^\\s+/;\n\n /** Used to match a single whitespace character. */\n var reWhitespace = /\\s/;\n\n /** Used to match wrap detail comments. */\n var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\n\n /** Used to match words composed of alphanumeric characters. */\n var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n /**\n * Used to validate the `validate` option in `_.template` variable.\n *\n * Forbids characters which could potentially change the meaning of the function argument definition:\n * - \"(),\" (modification of function parameters)\n * - \"=\" (default value)\n * - \"[]{}\" (destructuring of function parameters)\n * - \"/\" (beginning of a comment)\n * - whitespace\n */\n var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n /** Used to match backslashes in property paths. */\n var reEscapeChar = /\\\\(\\\\)?/g;\n\n /**\n * Used to match\n * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n */\n var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n /** Used to match `RegExp` flags from their coerced string values. */\n var reFlags = /\\w*$/;\n\n /** Used to detect bad signed hexadecimal string values. */\n var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n /** Used to detect binary string values. */\n var reIsBinary = /^0b[01]+$/i;\n\n /** Used to detect host constructors (Safari). */\n var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n /** Used to detect octal string values. */\n var reIsOctal = /^0o[0-7]+$/i;\n\n /** Used to detect unsigned integer values. */\n var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n /** Used to match Latin Unicode letters (excluding mathematical operators). */\n var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n /** Used to ensure capturing order of template delimiters. */\n var reNoMatch = /($^)/;\n\n /** Used to match unescaped characters in compiled string literals. */\n var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n /** Used to compose unicode character classes. */\n var rsAstralRange = '\\\\ud800-\\\\udfff',\n rsComboMarksRange = '\\\\u0300-\\\\u036f',\n reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n rsDingbatRange = '\\\\u2700-\\\\u27bf',\n rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n rsPunctuationRange = '\\\\u2000-\\\\u206f',\n rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n rsVarRange = '\\\\ufe0e\\\\ufe0f',\n rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n /** Used to compose unicode capture groups. */\n var rsApos = \"['\\u2019]\",\n rsAstral = '[' + rsAstralRange + ']',\n rsBreak = '[' + rsBreakRange + ']',\n rsCombo = '[' + rsComboRange + ']',\n rsDigits = '\\\\d+',\n rsDingbat = '[' + rsDingbatRange + ']',\n rsLower = '[' + rsLowerRange + ']',\n rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n rsNonAstral = '[^' + rsAstralRange + ']',\n rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n rsUpper = '[' + rsUpperRange + ']',\n rsZWJ = '\\\\u200d';\n\n /** Used to compose unicode regexes. */\n var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n reOptMod = rsModifier + '?',\n rsOptVar = '[' + rsVarRange + ']?',\n rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n rsSeq = rsOptVar + reOptMod + rsOptJoin,\n rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n /** Used to match apostrophes. */\n var reApos = RegExp(rsApos, 'g');\n\n /**\n * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n */\n var reComboMark = RegExp(rsCombo, 'g');\n\n /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n /** Used to match complex or compound words. */\n var reUnicodeWord = RegExp([\n rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n rsUpper + '+' + rsOptContrUpper,\n rsOrdUpper,\n rsOrdLower,\n rsDigits,\n rsEmoji\n ].join('|'), 'g');\n\n /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']');\n\n /** Used to detect strings that need a more robust regexp to match words. */\n var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n /** Used to assign default `context` object properties. */\n var contextProps = [\n 'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n 'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n 'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n 'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n ];\n\n /** Used to make template sourceURLs easier to identify. */\n var templateCounter = -1;\n\n /** Used to identify `toStringTag` values of typed arrays. */\n var typedArrayTags = {};\n typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n typedArrayTags[uint32Tag] = true;\n typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n typedArrayTags[setTag] = typedArrayTags[stringTag] =\n typedArrayTags[weakMapTag] = false;\n\n /** Used to identify `toStringTag` values supported by `_.clone`. */\n var cloneableTags = {};\n cloneableTags[argsTag] = cloneableTags[arrayTag] =\n cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n cloneableTags[boolTag] = cloneableTags[dateTag] =\n cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n cloneableTags[int32Tag] = cloneableTags[mapTag] =\n cloneableTags[numberTag] = cloneableTags[objectTag] =\n cloneableTags[regexpTag] = cloneableTags[setTag] =\n cloneableTags[stringTag] = cloneableTags[symbolTag] =\n cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n cloneableTags[errorTag] = cloneableTags[funcTag] =\n cloneableTags[weakMapTag] = false;\n\n /** Used to map Latin Unicode letters to basic Latin letters. */\n var deburredLetters = {\n // Latin-1 Supplement block.\n '\\xc0': 'A', '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n '\\xe0': 'a', '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n '\\xc7': 'C', '\\xe7': 'c',\n '\\xd0': 'D', '\\xf0': 'd',\n '\\xc8': 'E', '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n '\\xe8': 'e', '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n '\\xcc': 'I', '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n '\\xec': 'i', '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n '\\xd1': 'N', '\\xf1': 'n',\n '\\xd2': 'O', '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n '\\xf2': 'o', '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n '\\xd9': 'U', '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n '\\xf9': 'u', '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n '\\xdd': 'Y', '\\xfd': 'y', '\\xff': 'y',\n '\\xc6': 'Ae', '\\xe6': 'ae',\n '\\xde': 'Th', '\\xfe': 'th',\n '\\xdf': 'ss',\n // Latin Extended-A block.\n '\\u0100': 'A', '\\u0102': 'A', '\\u0104': 'A',\n '\\u0101': 'a', '\\u0103': 'a', '\\u0105': 'a',\n '\\u0106': 'C', '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n '\\u0107': 'c', '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n '\\u010e': 'D', '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n '\\u0112': 'E', '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n '\\u0113': 'e', '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n '\\u011c': 'G', '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n '\\u011d': 'g', '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n '\\u0124': 'H', '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n '\\u0128': 'I', '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n '\\u0129': 'i', '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n '\\u0134': 'J', '\\u0135': 'j',\n '\\u0136': 'K', '\\u0137': 'k', '\\u0138': 'k',\n '\\u0139': 'L', '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n '\\u013a': 'l', '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n '\\u0143': 'N', '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n '\\u0144': 'n', '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n '\\u014c': 'O', '\\u014e': 'O', '\\u0150': 'O',\n '\\u014d': 'o', '\\u014f': 'o', '\\u0151': 'o',\n '\\u0154': 'R', '\\u0156': 'R', '\\u0158': 'R',\n '\\u0155': 'r', '\\u0157': 'r', '\\u0159': 'r',\n '\\u015a': 'S', '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n '\\u015b': 's', '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n '\\u0162': 'T', '\\u0164': 'T', '\\u0166': 'T',\n '\\u0163': 't', '\\u0165': 't', '\\u0167': 't',\n '\\u0168': 'U', '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n '\\u0169': 'u', '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n '\\u0174': 'W', '\\u0175': 'w',\n '\\u0176': 'Y', '\\u0177': 'y', '\\u0178': 'Y',\n '\\u0179': 'Z', '\\u017b': 'Z', '\\u017d': 'Z',\n '\\u017a': 'z', '\\u017c': 'z', '\\u017e': 'z',\n '\\u0132': 'IJ', '\\u0133': 'ij',\n '\\u0152': 'Oe', '\\u0153': 'oe',\n '\\u0149': \"'n\", '\\u017f': 's'\n };\n\n /** Used to map characters to HTML entities. */\n var htmlEscapes = {\n '&': '&amp;',\n '<': '&lt;',\n '>': '&gt;',\n '\"': '&quot;',\n \"'\": '&#39;'\n };\n\n /** Used to map HTML entities to characters. */\n var htmlUnescapes = {\n '&amp;': '&',\n '&lt;': '<',\n '&gt;': '>',\n '&quot;': '\"',\n '&#39;': \"'\"\n };\n\n /** Used to escape characters for inclusion in compiled string literals. */\n var stringEscapes = {\n '\\\\': '\\\\',\n \"'\": \"'\",\n '\\n': 'n',\n '\\r': 'r',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n /** Built-in method references without a dependency on `root`. */\n var freeParseFloat = parseFloat,\n freeParseInt = parseInt;\n\n /** Detect free variable `global` from Node.js. */\n var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n /** Detect free variable `self`. */\n var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n /** Used as a reference to the global object. */\n var root = freeGlobal || freeSelf || Function('return this')();\n\n /** Detect free variable `exports`. */\n var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n /** Detect free variable `module`. */\n var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n /** Detect the popular CommonJS extension `module.exports`. */\n var moduleExports = freeModule && freeModule.exports === freeExports;\n\n /** Detect free variable `process` from Node.js. */\n var freeProcess = moduleExports && freeGlobal.process;\n\n /** Used to access faster Node.js helpers. */\n var nodeUtil = (function() {\n try {\n // Use `util.types` for Node.js 10+.\n var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n if (types) {\n return types;\n }\n\n // Legacy `process.binding('util')` for Node.js < 10.\n return freeProcess && freeProcess.binding && freeProcess.binding('util');\n } catch (e) {}\n }());\n\n /* Node.js helper references. */\n var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n nodeIsDate = nodeUtil && nodeUtil.isDate,\n nodeIsMap = nodeUtil && nodeUtil.isMap,\n nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n nodeIsSet = nodeUtil && nodeUtil.isSet,\n nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\n function apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n }\n\n /**\n * A specialized version of `baseAggregator` for arrays.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function arrayAggregator(array, setter, iteratee, accumulator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n var value = array[index];\n setter(accumulator, value, iteratee(value), array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.forEachRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\n function arrayEachRight(array, iteratee) {\n var length = array == null ? 0 : array.length;\n\n while (length--) {\n if (iteratee(array[length], length, array) === false) {\n break;\n }\n }\n return array;\n }\n\n /**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n */\n function arrayEvery(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (!predicate(array[index], index, array)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function arrayFilter(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n }\n\n /**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\n function arrayIncludesWith(array, value, comparator) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (comparator(value, array[index])) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function arrayMap(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length,\n result = Array(length);\n\n while (++index < length) {\n result[index] = iteratee(array[index], index, array);\n }\n return result;\n }\n\n /**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\n function arrayPush(array, values) {\n var index = -1,\n length = values.length,\n offset = array.length;\n\n while (++index < length) {\n array[offset + index] = values[index];\n }\n return array;\n }\n\n /**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduce(array, iteratee, accumulator, initAccum) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n if (initAccum && length) {\n accumulator = array[++index];\n }\n while (++index < length) {\n accumulator = iteratee(accumulator, array[index], index, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.reduceRight` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the last element of `array` as\n * the initial value.\n * @returns {*} Returns the accumulated value.\n */\n function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n var length = array == null ? 0 : array.length;\n if (initAccum && length) {\n accumulator = array[--length];\n }\n while (length--) {\n accumulator = iteratee(accumulator, array[length], length, array);\n }\n return accumulator;\n }\n\n /**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function arraySome(array, predicate) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (predicate(array[index], index, array)) {\n return true;\n }\n }\n return false;\n }\n\n /**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n var asciiSize = baseProperty('length');\n\n /**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function asciiToArray(string) {\n return string.split('');\n }\n\n /**\n * Splits an ASCII `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function asciiWords(string) {\n return string.match(reAsciiWord) || [];\n }\n\n /**\n * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n * without support for iteratee shorthands, which iterates over `collection`\n * using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the found element or its key, else `undefined`.\n */\n function baseFindKey(collection, predicate, eachFunc) {\n var result;\n eachFunc(collection, function(value, key, collection) {\n if (predicate(value, key, collection)) {\n result = key;\n return false;\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOf(array, value, fromIndex) {\n return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n }\n\n /**\n * This function is like `baseIndexOf` except that it accepts a comparator.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function baseIndexOfWith(array, value, fromIndex, comparator) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (comparator(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\n function baseIsNaN(value) {\n return value !== value;\n }\n\n /**\n * The base implementation of `_.mean` and `_.meanBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the mean.\n */\n function baseMean(array, iteratee) {\n var length = array == null ? 0 : array.length;\n return length ? (baseSum(array, iteratee) / length) : NAN;\n }\n\n /**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyOf(object) {\n return function(key) {\n return object == null ? undefined : object[key];\n };\n }\n\n /**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n * `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\n function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n eachFunc(collection, function(value, index, collection) {\n accumulator = initAccum\n ? (initAccum = false, value)\n : iteratee(accumulator, value, index, collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\n function baseSortBy(array, comparer) {\n var length = array.length;\n\n array.sort(comparer);\n while (length--) {\n array[length] = array[length].value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.sum` and `_.sumBy` without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {number} Returns the sum.\n */\n function baseSum(array, iteratee) {\n var result,\n index = -1,\n length = array.length;\n\n while (++index < length) {\n var current = iteratee(array[index]);\n if (current !== undefined) {\n result = result === undefined ? current : (result + current);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\n function baseTimes(n, iteratee) {\n var index = -1,\n result = Array(n);\n\n while (++index < n) {\n result[index] = iteratee(index);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n * of key-value pairs for `object` corresponding to the property names of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the key-value pairs.\n */\n function baseToPairs(object, props) {\n return arrayMap(props, function(key) {\n return [key, object[key]];\n });\n }\n\n /**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\n function baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n }\n\n /**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\n function baseUnary(func) {\n return function(value) {\n return func(value);\n };\n }\n\n /**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\n function baseValues(object, props) {\n return arrayMap(props, function(key) {\n return object[key];\n });\n }\n\n /**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function cacheHas(cache, key) {\n return cache.has(key);\n }\n\n /**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\n function charsStartIndex(strSymbols, chrSymbols) {\n var index = -1,\n length = strSymbols.length;\n\n while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\n function charsEndIndex(strSymbols, chrSymbols) {\n var index = strSymbols.length;\n\n while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n return index;\n }\n\n /**\n * Gets the number of `placeholder` occurrences in `array`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} placeholder The placeholder to search for.\n * @returns {number} Returns the placeholder count.\n */\n function countHolders(array, placeholder) {\n var length = array.length,\n result = 0;\n\n while (length--) {\n if (array[length] === placeholder) {\n ++result;\n }\n }\n return result;\n }\n\n /**\n * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n * letters to basic Latin letters.\n *\n * @private\n * @param {string} letter The matched letter to deburr.\n * @returns {string} Returns the deburred letter.\n */\n var deburrLetter = basePropertyOf(deburredLetters);\n\n /**\n * Used by `_.escape` to convert characters to HTML entities.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n /**\n * Used by `_.template` to escape characters for inclusion in compiled string literals.\n *\n * @private\n * @param {string} chr The matched character to escape.\n * @returns {string} Returns the escaped character.\n */\n function escapeStringChar(chr) {\n return '\\\\' + stringEscapes[chr];\n }\n\n /**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function getValue(object, key) {\n return object == null ? undefined : object[key];\n }\n\n /**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\n function hasUnicode(string) {\n return reHasUnicode.test(string);\n }\n\n /**\n * Checks if `string` contains a word composed of Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a word is found, else `false`.\n */\n function hasUnicodeWord(string) {\n return reHasUnicodeWord.test(string);\n }\n\n /**\n * Converts `iterator` to an array.\n *\n * @private\n * @param {Object} iterator The iterator to convert.\n * @returns {Array} Returns the converted array.\n */\n function iteratorToArray(iterator) {\n var data,\n result = [];\n\n while (!(data = iterator.next()).done) {\n result.push(data.value);\n }\n return result;\n }\n\n /**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\n function mapToArray(map) {\n var index = -1,\n result = Array(map.size);\n\n map.forEach(function(value, key) {\n result[++index] = [key, value];\n });\n return result;\n }\n\n /**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\n function overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n }\n\n /**\n * Replaces all `placeholder` elements in `array` with an internal placeholder\n * and returns an array of their indexes.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {*} placeholder The placeholder to replace.\n * @returns {Array} Returns the new array of placeholder indexes.\n */\n function replaceHolders(array, placeholder) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value === placeholder || value === PLACEHOLDER) {\n array[index] = PLACEHOLDER;\n result[resIndex++] = index;\n }\n }\n return result;\n }\n\n /**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\n function setToArray(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = value;\n });\n return result;\n }\n\n /**\n * Converts `set` to its value-value pairs.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the value-value pairs.\n */\n function setToPairs(set) {\n var index = -1,\n result = Array(set.size);\n\n set.forEach(function(value) {\n result[++index] = [value, value];\n });\n return result;\n }\n\n /**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictIndexOf(array, value, fromIndex) {\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * A specialized version of `_.lastIndexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function strictLastIndexOf(array, value, fromIndex) {\n var index = fromIndex + 1;\n while (index--) {\n if (array[index] === value) {\n return index;\n }\n }\n return index;\n }\n\n /**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\n function stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n }\n\n /**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function stringToArray(string) {\n return hasUnicode(string)\n ? unicodeToArray(string)\n : asciiToArray(string);\n }\n\n /**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\n function trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n }\n\n /**\n * Used by `_.unescape` to convert HTML entities to characters.\n *\n * @private\n * @param {string} chr The matched character to unescape.\n * @returns {string} Returns the unescaped character.\n */\n var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n /**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\n function unicodeSize(string) {\n var result = reUnicode.lastIndex = 0;\n while (reUnicode.test(string)) {\n ++result;\n }\n return result;\n }\n\n /**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\n function unicodeToArray(string) {\n return string.match(reUnicode) || [];\n }\n\n /**\n * Splits a Unicode `string` into an array of its words.\n *\n * @private\n * @param {string} The string to inspect.\n * @returns {Array} Returns the words of `string`.\n */\n function unicodeWords(string) {\n return string.match(reUnicodeWord) || [];\n }\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * Create a new pristine `lodash` function using the `context` object.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Util\n * @param {Object} [context=root] The context object.\n * @returns {Function} Returns a new `lodash` function.\n * @example\n *\n * _.mixin({ 'foo': _.constant('foo') });\n *\n * var lodash = _.runInContext();\n * lodash.mixin({ 'bar': lodash.constant('bar') });\n *\n * _.isFunction(_.foo);\n * // => true\n * _.isFunction(_.bar);\n * // => false\n *\n * lodash.isFunction(lodash.foo);\n * // => false\n * lodash.isFunction(lodash.bar);\n * // => true\n *\n * // Create a suped-up `defer` in Node.js.\n * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n */\n var runInContext = (function runInContext(context) {\n context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n /** Built-in constructor references. */\n var Array = context.Array,\n Date = context.Date,\n Error = context.Error,\n Function = context.Function,\n Math = context.Math,\n Object = context.Object,\n RegExp = context.RegExp,\n String = context.String,\n TypeError = context.TypeError;\n\n /** Used for built-in method references. */\n var arrayProto = Array.prototype,\n funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n /** Used to detect overreaching core-js shims. */\n var coreJsData = context['__core-js_shared__'];\n\n /** Used to resolve the decompiled source of functions. */\n var funcToString = funcProto.toString;\n\n /** Used to check objects for own properties. */\n var hasOwnProperty = objectProto.hasOwnProperty;\n\n /** Used to generate unique IDs. */\n var idCounter = 0;\n\n /** Used to detect methods masquerading as native. */\n var maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\n }());\n\n /**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\n var nativeObjectToString = objectProto.toString;\n\n /** Used to infer the `Object` constructor. */\n var objectCtorString = funcToString.call(Object);\n\n /** Used to restore the original `_` reference in `_.noConflict`. */\n var oldDash = root._;\n\n /** Used to detect if a method is native. */\n var reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n );\n\n /** Built-in value references. */\n var Buffer = moduleExports ? context.Buffer : undefined,\n Symbol = context.Symbol,\n Uint8Array = context.Uint8Array,\n allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n getPrototype = overArg(Object.getPrototypeOf, Object),\n objectCreate = Object.create,\n propertyIsEnumerable = objectProto.propertyIsEnumerable,\n splice = arrayProto.splice,\n spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n symIterator = Symbol ? Symbol.iterator : undefined,\n symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n var defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n }());\n\n /** Mocked built-ins. */\n var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n ctxNow = Date && Date.now !== root.Date.now && Date.now,\n ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n /* Built-in method references for those with the same name as other `lodash` methods. */\n var nativeCeil = Math.ceil,\n nativeFloor = Math.floor,\n nativeGetSymbols = Object.getOwnPropertySymbols,\n nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n nativeIsFinite = context.isFinite,\n nativeJoin = arrayProto.join,\n nativeKeys = overArg(Object.keys, Object),\n nativeMax = Math.max,\n nativeMin = Math.min,\n nativeNow = Date.now,\n nativeParseInt = context.parseInt,\n nativeRandom = Math.random,\n nativeReverse = arrayProto.reverse;\n\n /* Built-in method references that are verified to be native. */\n var DataView = getNative(context, 'DataView'),\n Map = getNative(context, 'Map'),\n Promise = getNative(context, 'Promise'),\n Set = getNative(context, 'Set'),\n WeakMap = getNative(context, 'WeakMap'),\n nativeCreate = getNative(Object, 'create');\n\n /** Used to store function metadata. */\n var metaMap = WeakMap && new WeakMap;\n\n /** Used to lookup unminified function names. */\n var realNames = {};\n\n /** Used to detect maps, sets, and weakmaps. */\n var dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\n\n /** Used to convert symbols to primitives and strings. */\n var symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` object which wraps `value` to enable implicit method\n * chain sequences. Methods that operate on and return arrays, collections,\n * and functions can be chained together. Methods that retrieve a single value\n * or may return a primitive value will automatically end the chain sequence\n * and return the unwrapped value. Otherwise, the value must be unwrapped\n * with `_#value`.\n *\n * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n * enabled using `_.chain`.\n *\n * The execution of chained methods is lazy, that is, it's deferred until\n * `_#value` is implicitly or explicitly called.\n *\n * Lazy evaluation allows several methods to support shortcut fusion.\n * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n * the creation of intermediate arrays and can greatly reduce the number of\n * iteratee executions. Sections of a chain sequence qualify for shortcut\n * fusion if the section is applied to an array and iteratees accept only\n * one argument. The heuristic for whether a section qualifies for shortcut\n * fusion is subject to change.\n *\n * Chaining is supported in custom builds as long as the `_#value` method is\n * directly or indirectly included in the build.\n *\n * In addition to lodash methods, wrappers have `Array` and `String` methods.\n *\n * The wrapper `Array` methods are:\n * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n *\n * The wrapper `String` methods are:\n * `replace` and `split`\n *\n * The wrapper methods that support shortcut fusion are:\n * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n *\n * The chainable wrapper methods are:\n * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n * `zipObject`, `zipObjectDeep`, and `zipWith`\n *\n * The wrapper methods that are **not** chainable by default are:\n * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n * `upperFirst`, `value`, and `words`\n *\n * @name _\n * @constructor\n * @category Seq\n * @param {*} value The value to wrap in a `lodash` instance.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2, 3]);\n *\n * // Returns an unwrapped value.\n * wrapped.reduce(_.add);\n * // => 6\n *\n * // Returns a wrapped value.\n * var squares = wrapped.map(square);\n *\n * _.isArray(squares);\n * // => false\n *\n * _.isArray(squares.value());\n * // => true\n */\n function lodash(value) {\n if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n if (value instanceof LodashWrapper) {\n return value;\n }\n if (hasOwnProperty.call(value, '__wrapped__')) {\n return wrapperClone(value);\n }\n }\n return new LodashWrapper(value);\n }\n\n /**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\n var baseCreate = (function() {\n function object() {}\n return function(proto) {\n if (!isObject(proto)) {\n return {};\n }\n if (objectCreate) {\n return objectCreate(proto);\n }\n object.prototype = proto;\n var result = new object;\n object.prototype = undefined;\n return result;\n };\n }());\n\n /**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\n function baseLodash() {\n // No operation performed.\n }\n\n /**\n * The base constructor for creating `lodash` wrapper objects.\n *\n * @private\n * @param {*} value The value to wrap.\n * @param {boolean} [chainAll] Enable explicit method chain sequences.\n */\n function LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n }\n\n /**\n * By default, the template delimiters used by lodash are like those in\n * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n * following template settings to use alternative delimiters.\n *\n * @static\n * @memberOf _\n * @type {Object}\n */\n lodash.templateSettings = {\n\n /**\n * Used to detect `data` property values to be HTML-escaped.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'escape': reEscape,\n\n /**\n * Used to detect code to be evaluated.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'evaluate': reEvaluate,\n\n /**\n * Used to detect `data` property values to inject.\n *\n * @memberOf _.templateSettings\n * @type {RegExp}\n */\n 'interpolate': reInterpolate,\n\n /**\n * Used to reference the data object in the template text.\n *\n * @memberOf _.templateSettings\n * @type {string}\n */\n 'variable': '',\n\n /**\n * Used to import variables into the compiled template.\n *\n * @memberOf _.templateSettings\n * @type {Object}\n */\n 'imports': {\n\n /**\n * A reference to the `lodash` function.\n *\n * @memberOf _.templateSettings.imports\n * @type {Function}\n */\n '_': lodash\n }\n };\n\n // Ensure wrappers are instances of `baseLodash`.\n lodash.prototype = baseLodash.prototype;\n lodash.prototype.constructor = lodash;\n\n LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n LodashWrapper.prototype.constructor = LodashWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n *\n * @private\n * @constructor\n * @param {*} value The value to wrap.\n */\n function LazyWrapper(value) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__dir__ = 1;\n this.__filtered__ = false;\n this.__iteratees__ = [];\n this.__takeCount__ = MAX_ARRAY_LENGTH;\n this.__views__ = [];\n }\n\n /**\n * Creates a clone of the lazy wrapper object.\n *\n * @private\n * @name clone\n * @memberOf LazyWrapper\n * @returns {Object} Returns the cloned `LazyWrapper` object.\n */\n function lazyClone() {\n var result = new LazyWrapper(this.__wrapped__);\n result.__actions__ = copyArray(this.__actions__);\n result.__dir__ = this.__dir__;\n result.__filtered__ = this.__filtered__;\n result.__iteratees__ = copyArray(this.__iteratees__);\n result.__takeCount__ = this.__takeCount__;\n result.__views__ = copyArray(this.__views__);\n return result;\n }\n\n /**\n * Reverses the direction of lazy iteration.\n *\n * @private\n * @name reverse\n * @memberOf LazyWrapper\n * @returns {Object} Returns the new reversed `LazyWrapper` object.\n */\n function lazyReverse() {\n if (this.__filtered__) {\n var result = new LazyWrapper(this);\n result.__dir__ = -1;\n result.__filtered__ = true;\n } else {\n result = this.clone();\n result.__dir__ *= -1;\n }\n return result;\n }\n\n /**\n * Extracts the unwrapped value from its lazy wrapper.\n *\n * @private\n * @name value\n * @memberOf LazyWrapper\n * @returns {*} Returns the unwrapped value.\n */\n function lazyValue() {\n var array = this.__wrapped__.value(),\n dir = this.__dir__,\n isArr = isArray(array),\n isRight = dir < 0,\n arrLength = isArr ? array.length : 0,\n view = getView(0, arrLength, this.__views__),\n start = view.start,\n end = view.end,\n length = end - start,\n index = isRight ? end : (start - 1),\n iteratees = this.__iteratees__,\n iterLength = iteratees.length,\n resIndex = 0,\n takeCount = nativeMin(length, this.__takeCount__);\n\n if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n return baseWrapperValue(array, this.__actions__);\n }\n var result = [];\n\n outer:\n while (length-- && resIndex < takeCount) {\n index += dir;\n\n var iterIndex = -1,\n value = array[index];\n\n while (++iterIndex < iterLength) {\n var data = iteratees[iterIndex],\n iteratee = data.iteratee,\n type = data.type,\n computed = iteratee(value);\n\n if (type == LAZY_MAP_FLAG) {\n value = computed;\n } else if (!computed) {\n if (type == LAZY_FILTER_FLAG) {\n continue outer;\n } else {\n break outer;\n }\n }\n }\n result[resIndex++] = value;\n }\n return result;\n }\n\n // Ensure `LazyWrapper` is an instance of `baseLodash`.\n LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n LazyWrapper.prototype.constructor = LazyWrapper;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\n function hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function hashGet(key) {\n var data = this.__data__;\n if (nativeCreate) {\n var result = data[key];\n return result === HASH_UNDEFINED ? undefined : result;\n }\n return hasOwnProperty.call(data, key) ? data[key] : undefined;\n }\n\n /**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n }\n\n /**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\n function hashSet(key, value) {\n var data = this.__data__;\n this.size += this.has(key) ? 0 : 1;\n data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n return this;\n }\n\n // Add methods to `Hash`.\n Hash.prototype.clear = hashClear;\n Hash.prototype['delete'] = hashDelete;\n Hash.prototype.get = hashGet;\n Hash.prototype.has = hashHas;\n Hash.prototype.set = hashSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\n function listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function listCacheDelete(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n return false;\n }\n var lastIndex = data.length - 1;\n if (index == lastIndex) {\n data.pop();\n } else {\n splice.call(data, index, 1);\n }\n --this.size;\n return true;\n }\n\n /**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n }\n\n /**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n }\n\n /**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\n function listCacheSet(key, value) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n if (index < 0) {\n ++this.size;\n data.push([key, value]);\n } else {\n data[index][1] = value;\n }\n return this;\n }\n\n // Add methods to `ListCache`.\n ListCache.prototype.clear = listCacheClear;\n ListCache.prototype['delete'] = listCacheDelete;\n ListCache.prototype.get = listCacheGet;\n ListCache.prototype.has = listCacheHas;\n ListCache.prototype.set = listCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n }\n\n /**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\n function mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n }\n\n /**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n }\n\n /**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function mapCacheGet(key) {\n return getMapData(this, key).get(key);\n }\n\n /**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function mapCacheHas(key) {\n return getMapData(this, key).has(key);\n }\n\n /**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\n function mapCacheSet(key, value) {\n var data = getMapData(this, key),\n size = data.size;\n\n data.set(key, value);\n this.size += data.size == size ? 0 : 1;\n return this;\n }\n\n // Add methods to `MapCache`.\n MapCache.prototype.clear = mapCacheClear;\n MapCache.prototype['delete'] = mapCacheDelete;\n MapCache.prototype.get = mapCacheGet;\n MapCache.prototype.has = mapCacheHas;\n MapCache.prototype.set = mapCacheSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\n function SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n }\n\n /**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\n function setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n }\n\n /**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\n function setCacheHas(value) {\n return this.__data__.has(value);\n }\n\n // Add methods to `SetCache`.\n SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n SetCache.prototype.has = setCacheHas;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\n function Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n }\n\n /**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\n function stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n }\n\n /**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\n function stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n }\n\n /**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\n function stackGet(key) {\n return this.__data__.get(key);\n }\n\n /**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\n function stackHas(key) {\n return this.__data__.has(key);\n }\n\n /**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\n function stackSet(key, value) {\n var data = this.__data__;\n if (data instanceof ListCache) {\n var pairs = data.__data__;\n if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n pairs.push([key, value]);\n this.size = ++data.size;\n return this;\n }\n data = this.__data__ = new MapCache(pairs);\n }\n data.set(key, value);\n this.size = data.size;\n return this;\n }\n\n // Add methods to `Stack`.\n Stack.prototype.clear = stackClear;\n Stack.prototype['delete'] = stackDelete;\n Stack.prototype.get = stackGet;\n Stack.prototype.has = stackHas;\n Stack.prototype.set = stackSet;\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\n function arrayLikeKeys(value, inherited) {\n var isArr = isArray(value),\n isArg = !isArr && isArguments(value),\n isBuff = !isArr && !isArg && isBuffer(value),\n isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n skipIndexes = isArr || isArg || isBuff || isType,\n result = skipIndexes ? baseTimes(value.length, String) : [],\n length = result.length;\n\n for (var key in value) {\n if ((inherited || hasOwnProperty.call(value, key)) &&\n !(skipIndexes && (\n // Safari 9 has enumerable `arguments.length` in strict mode.\n key == 'length' ||\n // Node.js 0.10 has enumerable non-index properties on buffers.\n (isBuff && (key == 'offset' || key == 'parent')) ||\n // PhantomJS 2 has enumerable non-index properties on typed arrays.\n (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n // Skip index properties.\n isIndex(key, length)\n ))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `_.sample` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @returns {*} Returns the random element.\n */\n function arraySample(array) {\n var length = array.length;\n return length ? array[baseRandom(0, length - 1)] : undefined;\n }\n\n /**\n * A specialized version of `_.sampleSize` for arrays.\n *\n * @private\n * @param {Array} array The array to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function arraySampleSize(array, n) {\n return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n }\n\n /**\n * A specialized version of `_.shuffle` for arrays.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function arrayShuffle(array) {\n return shuffleSelf(copyArray(array));\n }\n\n /**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignMergeValue(object, key, value) {\n if ((value !== undefined && !eq(object[key], value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function assignValue(object, key, value) {\n var objValue = object[key];\n if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n (value === undefined && !(key in object))) {\n baseAssignValue(object, key, value);\n }\n }\n\n /**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\n function assocIndexOf(array, key) {\n var length = array.length;\n while (length--) {\n if (eq(array[length][0], key)) {\n return length;\n }\n }\n return -1;\n }\n\n /**\n * Aggregates elements of `collection` on `accumulator` with keys transformed\n * by `iteratee` and values set by `setter`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform keys.\n * @param {Object} accumulator The initial aggregated object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseAggregator(collection, setter, iteratee, accumulator) {\n baseEach(collection, function(value, key, collection) {\n setter(accumulator, value, iteratee(value), collection);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssign(object, source) {\n return object && copyObject(source, keys(source), object);\n }\n\n /**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\n function baseAssignIn(object, source) {\n return object && copyObject(source, keysIn(source), object);\n }\n\n /**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\n function baseAssignValue(object, key, value) {\n if (key == '__proto__' && defineProperty) {\n defineProperty(object, key, {\n 'configurable': true,\n 'enumerable': true,\n 'value': value,\n 'writable': true\n });\n } else {\n object[key] = value;\n }\n }\n\n /**\n * The base implementation of `_.at` without support for individual paths.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {string[]} paths The property paths to pick.\n * @returns {Array} Returns the picked elements.\n */\n function baseAt(object, paths) {\n var index = -1,\n length = paths.length,\n result = Array(length),\n skip = object == null;\n\n while (++index < length) {\n result[index] = skip ? undefined : get(object, paths[index]);\n }\n return result;\n }\n\n /**\n * The base implementation of `_.clamp` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n */\n function baseClamp(number, lower, upper) {\n if (number === number) {\n if (upper !== undefined) {\n number = number <= upper ? number : upper;\n }\n if (lower !== undefined) {\n number = number >= lower ? number : lower;\n }\n }\n return number;\n }\n\n /**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Deep clone\n * 2 - Flatten inherited properties\n * 4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\n function baseClone(value, bitmask, customizer, key, object, stack) {\n var result,\n isDeep = bitmask & CLONE_DEEP_FLAG,\n isFlat = bitmask & CLONE_FLAT_FLAG,\n isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n if (customizer) {\n result = object ? customizer(value, key, object, stack) : customizer(value);\n }\n if (result !== undefined) {\n return result;\n }\n if (!isObject(value)) {\n return value;\n }\n var isArr = isArray(value);\n if (isArr) {\n result = initCloneArray(value);\n if (!isDeep) {\n return copyArray(value, result);\n }\n } else {\n var tag = getTag(value),\n isFunc = tag == funcTag || tag == genTag;\n\n if (isBuffer(value)) {\n return cloneBuffer(value, isDeep);\n }\n if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n result = (isFlat || isFunc) ? {} : initCloneObject(value);\n if (!isDeep) {\n return isFlat\n ? copySymbolsIn(value, baseAssignIn(result, value))\n : copySymbols(value, baseAssign(result, value));\n }\n } else {\n if (!cloneableTags[tag]) {\n return object ? value : {};\n }\n result = initCloneByTag(value, tag, isDeep);\n }\n }\n // Check for circular references and return its corresponding clone.\n stack || (stack = new Stack);\n var stacked = stack.get(value);\n if (stacked) {\n return stacked;\n }\n stack.set(value, result);\n\n if (isSet(value)) {\n value.forEach(function(subValue) {\n result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n });\n } else if (isMap(value)) {\n value.forEach(function(subValue, key) {\n result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n }\n\n var keysFunc = isFull\n ? (isFlat ? getAllKeysIn : getAllKeys)\n : (isFlat ? keysIn : keys);\n\n var props = isArr ? undefined : keysFunc(value);\n arrayEach(props || value, function(subValue, key) {\n if (props) {\n key = subValue;\n subValue = value[key];\n }\n // Recursively populate clone (susceptible to call stack limits).\n assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n });\n return result;\n }\n\n /**\n * The base implementation of `_.conforms` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n */\n function baseConforms(source) {\n var props = keys(source);\n return function(object) {\n return baseConformsTo(object, source, props);\n };\n }\n\n /**\n * The base implementation of `_.conformsTo` which accepts `props` to check.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n */\n function baseConformsTo(object, source, props) {\n var length = props.length;\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (length--) {\n var key = props[length],\n predicate = source[key],\n value = object[key];\n\n if ((value === undefined && !(key in object)) || !predicate(value)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.delay` and `_.defer` which accepts `args`\n * to provide to `func`.\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {Array} args The arguments to provide to `func`.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n function baseDelay(func, wait, args) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return setTimeout(function() { func.apply(undefined, args); }, wait);\n }\n\n /**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\n function baseDifference(array, values, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n isCommon = true,\n length = array.length,\n result = [],\n valuesLength = values.length;\n\n if (!length) {\n return result;\n }\n if (iteratee) {\n values = arrayMap(values, baseUnary(iteratee));\n }\n if (comparator) {\n includes = arrayIncludesWith;\n isCommon = false;\n }\n else if (values.length >= LARGE_ARRAY_SIZE) {\n includes = cacheHas;\n isCommon = false;\n values = new SetCache(values);\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee == null ? value : iteratee(value);\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var valuesIndex = valuesLength;\n while (valuesIndex--) {\n if (values[valuesIndex] === computed) {\n continue outer;\n }\n }\n result.push(value);\n }\n else if (!includes(values, computed, comparator)) {\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEach = createBaseEach(baseForOwn);\n\n /**\n * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\n var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n /**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`\n */\n function baseEvery(collection, predicate) {\n var result = true;\n baseEach(collection, function(value, index, collection) {\n result = !!predicate(value, index, collection);\n return result;\n });\n return result;\n }\n\n /**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\n function baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.fill` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n */\n function baseFill(array, value, start, end) {\n var length = array.length;\n\n start = toInteger(start);\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = (end === undefined || end > length) ? length : toInteger(end);\n if (end < 0) {\n end += length;\n }\n end = start > end ? 0 : toLength(end);\n while (start < end) {\n array[start++] = value;\n }\n return array;\n }\n\n /**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\n function baseFilter(collection, predicate) {\n var result = [];\n baseEach(collection, function(value, index, collection) {\n if (predicate(value, index, collection)) {\n result.push(value);\n }\n });\n return result;\n }\n\n /**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\n function baseFlatten(array, depth, predicate, isStrict, result) {\n var index = -1,\n length = array.length;\n\n predicate || (predicate = isFlattenable);\n result || (result = []);\n\n while (++index < length) {\n var value = array[index];\n if (depth > 0 && predicate(value)) {\n if (depth > 1) {\n // Recursively flatten arrays (susceptible to call stack limits).\n baseFlatten(value, depth - 1, predicate, isStrict, result);\n } else {\n arrayPush(result, value);\n }\n } else if (!isStrict) {\n result[result.length] = value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseFor = createBaseFor();\n\n /**\n * This function is like `baseFor` except that it iterates over properties\n * in the opposite order.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\n var baseForRight = createBaseFor(true);\n\n /**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwn(object, iteratee) {\n return object && baseFor(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\n function baseForOwnRight(object, iteratee) {\n return object && baseForRight(object, iteratee, keys);\n }\n\n /**\n * The base implementation of `_.functions` which creates an array of\n * `object` function property names filtered from `props`.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Array} props The property names to filter.\n * @returns {Array} Returns the function names.\n */\n function baseFunctions(object, props) {\n return arrayFilter(props, function(key) {\n return isFunction(object[key]);\n });\n }\n\n /**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\n function baseGet(object, path) {\n path = castPath(path, object);\n\n var index = 0,\n length = path.length;\n\n while (object != null && index < length) {\n object = object[toKey(path[index++])];\n }\n return (index && index == length) ? object : undefined;\n }\n\n /**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n }\n\n /**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n function baseGetTag(value) {\n if (value == null) {\n return value === undefined ? undefinedTag : nullTag;\n }\n return (symToStringTag && symToStringTag in Object(value))\n ? getRawTag(value)\n : objectToString(value);\n }\n\n /**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\n function baseGt(value, other) {\n return value > other;\n }\n\n /**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHas(object, key) {\n return object != null && hasOwnProperty.call(object, key);\n }\n\n /**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\n function baseHasIn(object, key) {\n return object != null && key in Object(object);\n }\n\n /**\n * The base implementation of `_.inRange` which doesn't coerce arguments.\n *\n * @private\n * @param {number} number The number to check.\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n */\n function baseInRange(number, start, end) {\n return number >= nativeMin(start, end) && number < nativeMax(start, end);\n }\n\n /**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\n function baseIntersection(arrays, iteratee, comparator) {\n var includes = comparator ? arrayIncludesWith : arrayIncludes,\n length = arrays[0].length,\n othLength = arrays.length,\n othIndex = othLength,\n caches = Array(othLength),\n maxLength = Infinity,\n result = [];\n\n while (othIndex--) {\n var array = arrays[othIndex];\n if (othIndex && iteratee) {\n array = arrayMap(array, baseUnary(iteratee));\n }\n maxLength = nativeMin(array.length, maxLength);\n caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n ? new SetCache(othIndex && array)\n : undefined;\n }\n array = arrays[0];\n\n var index = -1,\n seen = caches[0];\n\n outer:\n while (++index < length && result.length < maxLength) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (!(seen\n ? cacheHas(seen, computed)\n : includes(result, computed, comparator)\n )) {\n othIndex = othLength;\n while (--othIndex) {\n var cache = caches[othIndex];\n if (!(cache\n ? cacheHas(cache, computed)\n : includes(arrays[othIndex], computed, comparator))\n ) {\n continue outer;\n }\n }\n if (seen) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\n function baseInverter(object, setter, iteratee, accumulator) {\n baseForOwn(object, function(value, key, object) {\n setter(accumulator, iteratee(value), key, object);\n });\n return accumulator;\n }\n\n /**\n * The base implementation of `_.invoke` without support for individual\n * method arguments.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {Array} args The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n */\n function baseInvoke(object, path, args) {\n path = castPath(path, object);\n object = parent(object, path);\n var func = object == null ? object : object[toKey(last(path))];\n return func == null ? undefined : apply(func, object, args);\n }\n\n /**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\n function baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n }\n\n /**\n * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n */\n function baseIsArrayBuffer(value) {\n return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n }\n\n /**\n * The base implementation of `_.isDate` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n */\n function baseIsDate(value) {\n return isObjectLike(value) && baseGetTag(value) == dateTag;\n }\n\n /**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n * 1 - Unordered comparison\n * 2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\n function baseIsEqual(value, other, bitmask, customizer, stack) {\n if (value === other) {\n return true;\n }\n if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n return value !== value && other !== other;\n }\n return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n }\n\n /**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n var objIsArr = isArray(object),\n othIsArr = isArray(other),\n objTag = objIsArr ? arrayTag : getTag(object),\n othTag = othIsArr ? arrayTag : getTag(other);\n\n objTag = objTag == argsTag ? objectTag : objTag;\n othTag = othTag == argsTag ? objectTag : othTag;\n\n var objIsObj = objTag == objectTag,\n othIsObj = othTag == objectTag,\n isSameTag = objTag == othTag;\n\n if (isSameTag && isBuffer(object)) {\n if (!isBuffer(other)) {\n return false;\n }\n objIsArr = true;\n objIsObj = false;\n }\n if (isSameTag && !objIsObj) {\n stack || (stack = new Stack);\n return (objIsArr || isTypedArray(object))\n ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n }\n if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n if (objIsWrapped || othIsWrapped) {\n var objUnwrapped = objIsWrapped ? object.value() : object,\n othUnwrapped = othIsWrapped ? other.value() : other;\n\n stack || (stack = new Stack);\n return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n }\n }\n if (!isSameTag) {\n return false;\n }\n stack || (stack = new Stack);\n return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n }\n\n /**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\n function baseIsMap(value) {\n return isObjectLike(value) && getTag(value) == mapTag;\n }\n\n /**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\n function baseIsMatch(object, source, matchData, customizer) {\n var index = matchData.length,\n length = index,\n noCustomizer = !customizer;\n\n if (object == null) {\n return !length;\n }\n object = Object(object);\n while (index--) {\n var data = matchData[index];\n if ((noCustomizer && data[2])\n ? data[1] !== object[data[0]]\n : !(data[0] in object)\n ) {\n return false;\n }\n }\n while (++index < length) {\n data = matchData[index];\n var key = data[0],\n objValue = object[key],\n srcValue = data[1];\n\n if (noCustomizer && data[2]) {\n if (objValue === undefined && !(key in object)) {\n return false;\n }\n } else {\n var stack = new Stack;\n if (customizer) {\n var result = customizer(objValue, srcValue, key, object, source, stack);\n }\n if (!(result === undefined\n ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n : result\n )) {\n return false;\n }\n }\n }\n return true;\n }\n\n /**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n */\n function baseIsNative(value) {\n if (!isObject(value) || isMasked(value)) {\n return false;\n }\n var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n return pattern.test(toSource(value));\n }\n\n /**\n * The base implementation of `_.isRegExp` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n */\n function baseIsRegExp(value) {\n return isObjectLike(value) && baseGetTag(value) == regexpTag;\n }\n\n /**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\n function baseIsSet(value) {\n return isObjectLike(value) && getTag(value) == setTag;\n }\n\n /**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\n function baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n }\n\n /**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\n function baseIteratee(value) {\n // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n if (typeof value == 'function') {\n return value;\n }\n if (value == null) {\n return identity;\n }\n if (typeof value == 'object') {\n return isArray(value)\n ? baseMatchesProperty(value[0], value[1])\n : baseMatches(value);\n }\n return property(value);\n }\n\n /**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeys(object) {\n if (!isPrototype(object)) {\n return nativeKeys(object);\n }\n var result = [];\n for (var key in Object(object)) {\n if (hasOwnProperty.call(object, key) && key != 'constructor') {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function baseKeysIn(object) {\n if (!isObject(object)) {\n return nativeKeysIn(object);\n }\n var isProto = isPrototype(object),\n result = [];\n\n for (var key in object) {\n if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n */\n function baseLt(value, other) {\n return value < other;\n }\n\n /**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\n function baseMap(collection, iteratee) {\n var index = -1,\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n }\n\n /**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatches(source) {\n var matchData = getMatchData(source);\n if (matchData.length == 1 && matchData[0][2]) {\n return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n }\n return function(object) {\n return object === source || baseIsMatch(object, source, matchData);\n };\n }\n\n /**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function baseMatchesProperty(path, srcValue) {\n if (isKey(path) && isStrictComparable(srcValue)) {\n return matchesStrictComparable(toKey(path), srcValue);\n }\n return function(object) {\n var objValue = get(object, path);\n return (objValue === undefined && objValue === srcValue)\n ? hasIn(object, path)\n : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n };\n }\n\n /**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMerge(object, source, srcIndex, customizer, stack) {\n if (object === source) {\n return;\n }\n baseFor(source, function(srcValue, key) {\n stack || (stack = new Stack);\n if (isObject(srcValue)) {\n baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n }\n else {\n var newValue = customizer\n ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n : undefined;\n\n if (newValue === undefined) {\n newValue = srcValue;\n }\n assignMergeValue(object, key, newValue);\n }\n }, keysIn);\n }\n\n /**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n */\n function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n var objValue = safeGet(object, key),\n srcValue = safeGet(source, key),\n stacked = stack.get(srcValue);\n\n if (stacked) {\n assignMergeValue(object, key, stacked);\n return;\n }\n var newValue = customizer\n ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n : undefined;\n\n var isCommon = newValue === undefined;\n\n if (isCommon) {\n var isArr = isArray(srcValue),\n isBuff = !isArr && isBuffer(srcValue),\n isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n newValue = srcValue;\n if (isArr || isBuff || isTyped) {\n if (isArray(objValue)) {\n newValue = objValue;\n }\n else if (isArrayLikeObject(objValue)) {\n newValue = copyArray(objValue);\n }\n else if (isBuff) {\n isCommon = false;\n newValue = cloneBuffer(srcValue, true);\n }\n else if (isTyped) {\n isCommon = false;\n newValue = cloneTypedArray(srcValue, true);\n }\n else {\n newValue = [];\n }\n }\n else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n newValue = objValue;\n if (isArguments(objValue)) {\n newValue = toPlainObject(objValue);\n }\n else if (!isObject(objValue) || isFunction(objValue)) {\n newValue = initCloneObject(srcValue);\n }\n }\n else {\n isCommon = false;\n }\n }\n if (isCommon) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, newValue);\n mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n stack['delete'](srcValue);\n }\n assignMergeValue(object, key, newValue);\n }\n\n /**\n * The base implementation of `_.nth` which doesn't coerce arguments.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {number} n The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n */\n function baseNth(array, n) {\n var length = array.length;\n if (!length) {\n return;\n }\n n += n < 0 ? length : 0;\n return isIndex(n, length) ? array[n] : undefined;\n }\n\n /**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\n function baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) {\n iteratees = arrayMap(iteratees, function(iteratee) {\n if (isArray(iteratee)) {\n return function(value) {\n return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n }\n }\n return iteratee;\n });\n } else {\n iteratees = [identity];\n }\n\n var index = -1;\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n var result = baseMap(collection, function(value, key, collection) {\n var criteria = arrayMap(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return { 'criteria': criteria, 'index': ++index, 'value': value };\n });\n\n return baseSortBy(result, function(object, other) {\n return compareMultiple(object, other, orders);\n });\n }\n\n /**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\n function basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n }\n\n /**\n * The base implementation of `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\n function basePickBy(object, paths, predicate) {\n var index = -1,\n length = paths.length,\n result = {};\n\n while (++index < length) {\n var path = paths[index],\n value = baseGet(object, path);\n\n if (predicate(value, path)) {\n baseSet(result, castPath(path, object), value);\n }\n }\n return result;\n }\n\n /**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\n function basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n }\n\n /**\n * The base implementation of `_.pullAllBy` without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n */\n function basePullAll(array, values, iteratee, comparator) {\n var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n index = -1,\n length = values.length,\n seen = array;\n\n if (array === values) {\n values = copyArray(values);\n }\n if (iteratee) {\n seen = arrayMap(array, baseUnary(iteratee));\n }\n while (++index < length) {\n var fromIndex = 0,\n value = values[index],\n computed = iteratee ? iteratee(value) : value;\n\n while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n if (seen !== array) {\n splice.call(seen, fromIndex, 1);\n }\n splice.call(array, fromIndex, 1);\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.pullAt` without support for individual\n * indexes or capturing the removed elements.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {number[]} indexes The indexes of elements to remove.\n * @returns {Array} Returns `array`.\n */\n function basePullAt(array, indexes) {\n var length = array ? indexes.length : 0,\n lastIndex = length - 1;\n\n while (length--) {\n var index = indexes[length];\n if (length == lastIndex || index !== previous) {\n var previous = index;\n if (isIndex(index)) {\n splice.call(array, index, 1);\n } else {\n baseUnset(array, index);\n }\n }\n }\n return array;\n }\n\n /**\n * The base implementation of `_.random` without support for returning\n * floating-point numbers.\n *\n * @private\n * @param {number} lower The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the random number.\n */\n function baseRandom(lower, upper) {\n return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n }\n\n /**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\n function baseRange(start, end, step, fromRight) {\n var index = -1,\n length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n result = Array(length);\n\n while (length--) {\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n }\n\n /**\n * The base implementation of `_.repeat` which doesn't coerce arguments.\n *\n * @private\n * @param {string} string The string to repeat.\n * @param {number} n The number of times to repeat the string.\n * @returns {string} Returns the repeated string.\n */\n function baseRepeat(string, n) {\n var result = '';\n if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n return result;\n }\n // Leverage the exponentiation by squaring algorithm for a faster repeat.\n // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n do {\n if (n % 2) {\n result += string;\n }\n n = nativeFloor(n / 2);\n if (n) {\n string += string;\n }\n } while (n);\n\n return result;\n }\n\n /**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\n function baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n }\n\n /**\n * The base implementation of `_.sample`.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n */\n function baseSample(collection) {\n return arraySample(values(collection));\n }\n\n /**\n * The base implementation of `_.sampleSize` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to sample.\n * @param {number} n The number of elements to sample.\n * @returns {Array} Returns the random elements.\n */\n function baseSampleSize(collection, n) {\n var array = values(collection);\n return shuffleSelf(array, baseClamp(n, 0, array.length));\n }\n\n /**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseSet(object, path, value, customizer) {\n if (!isObject(object)) {\n return object;\n }\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n lastIndex = length - 1,\n nested = object;\n\n while (nested != null && ++index < length) {\n var key = toKey(path[index]),\n newValue = value;\n\n if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n return object;\n }\n\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) {\n newValue = isObject(objValue)\n ? objValue\n : (isIndex(path[index + 1]) ? [] : {});\n }\n }\n assignValue(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n }\n\n /**\n * The base implementation of `setData` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n };\n\n /**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var baseSetToString = !defineProperty ? identity : function(func, string) {\n return defineProperty(func, 'toString', {\n 'configurable': true,\n 'enumerable': false,\n 'value': constant(string),\n 'writable': true\n });\n };\n\n /**\n * The base implementation of `_.shuffle`.\n *\n * @private\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n */\n function baseShuffle(collection) {\n return shuffleSelf(values(collection));\n }\n\n /**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseSlice(array, start, end) {\n var index = -1,\n length = array.length;\n\n if (start < 0) {\n start = -start > length ? 0 : (length + start);\n }\n end = end > length ? length : end;\n if (end < 0) {\n end += length;\n }\n length = start > end ? 0 : ((end - start) >>> 0);\n start >>>= 0;\n\n var result = Array(length);\n while (++index < length) {\n result[index] = array[index + start];\n }\n return result;\n }\n\n /**\n * The base implementation of `_.some` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n */\n function baseSome(collection, predicate) {\n var result;\n\n baseEach(collection, function(value, index, collection) {\n result = predicate(value, index, collection);\n return !result;\n });\n return !!result;\n }\n\n /**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndex(array, value, retHighest) {\n var low = 0,\n high = array == null ? low : array.length;\n\n if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n while (low < high) {\n var mid = (low + high) >>> 1,\n computed = array[mid];\n\n if (computed !== null && !isSymbol(computed) &&\n (retHighest ? (computed <= value) : (computed < value))) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return high;\n }\n return baseSortedIndexBy(array, value, identity, retHighest);\n }\n\n /**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n */\n function baseSortedIndexBy(array, value, iteratee, retHighest) {\n var low = 0,\n high = array == null ? 0 : array.length;\n if (high === 0) {\n return 0;\n }\n\n value = iteratee(value);\n var valIsNaN = value !== value,\n valIsNull = value === null,\n valIsSymbol = isSymbol(value),\n valIsUndefined = value === undefined;\n\n while (low < high) {\n var mid = nativeFloor((low + high) / 2),\n computed = iteratee(array[mid]),\n othIsDefined = computed !== undefined,\n othIsNull = computed === null,\n othIsReflexive = computed === computed,\n othIsSymbol = isSymbol(computed);\n\n if (valIsNaN) {\n var setLow = retHighest || othIsReflexive;\n } else if (valIsUndefined) {\n setLow = othIsReflexive && (retHighest || othIsDefined);\n } else if (valIsNull) {\n setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n } else if (valIsSymbol) {\n setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n } else if (othIsNull || othIsSymbol) {\n setLow = false;\n } else {\n setLow = retHighest ? (computed <= value) : (computed < value);\n }\n if (setLow) {\n low = mid + 1;\n } else {\n high = mid;\n }\n }\n return nativeMin(high, MAX_ARRAY_INDEX);\n }\n\n /**\n * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseSortedUniq(array, iteratee) {\n var index = -1,\n length = array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n if (!index || !eq(computed, seen)) {\n var seen = computed;\n result[resIndex++] = value === 0 ? 0 : value;\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.toNumber` which doesn't ensure correct\n * conversions of binary, hexadecimal, or octal string values.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n */\n function baseToNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n return +value;\n }\n\n /**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\n function baseToString(value) {\n // Exit early for strings to avoid a performance hit in some environments.\n if (typeof value == 'string') {\n return value;\n }\n if (isArray(value)) {\n // Recursively convert values (susceptible to call stack limits).\n return arrayMap(value, baseToString) + '';\n }\n if (isSymbol(value)) {\n return symbolToString ? symbolToString.call(value) : '';\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\n function baseUniq(array, iteratee, comparator) {\n var index = -1,\n includes = arrayIncludes,\n length = array.length,\n isCommon = true,\n result = [],\n seen = result;\n\n if (comparator) {\n isCommon = false;\n includes = arrayIncludesWith;\n }\n else if (length >= LARGE_ARRAY_SIZE) {\n var set = iteratee ? null : createSet(array);\n if (set) {\n return setToArray(set);\n }\n isCommon = false;\n includes = cacheHas;\n seen = new SetCache;\n }\n else {\n seen = iteratee ? [] : result;\n }\n outer:\n while (++index < length) {\n var value = array[index],\n computed = iteratee ? iteratee(value) : value;\n\n value = (comparator || value !== 0) ? value : 0;\n if (isCommon && computed === computed) {\n var seenIndex = seen.length;\n while (seenIndex--) {\n if (seen[seenIndex] === computed) {\n continue outer;\n }\n }\n if (iteratee) {\n seen.push(computed);\n }\n result.push(value);\n }\n else if (!includes(seen, computed, comparator)) {\n if (seen !== result) {\n seen.push(computed);\n }\n result.push(value);\n }\n }\n return result;\n }\n\n /**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\n function baseUnset(object, path) {\n path = castPath(path, object);\n object = parent(object, path);\n return object == null || delete object[toKey(last(path))];\n }\n\n /**\n * The base implementation of `_.update`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to update.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\n function baseUpdate(object, path, updater, customizer) {\n return baseSet(object, path, updater(baseGet(object, path)), customizer);\n }\n\n /**\n * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n * without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to query.\n * @param {Function} predicate The function invoked per iteration.\n * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the slice of `array`.\n */\n function baseWhile(array, predicate, isDrop, fromRight) {\n var length = array.length,\n index = fromRight ? length : -1;\n\n while ((fromRight ? index-- : ++index < length) &&\n predicate(array[index], index, array)) {}\n\n return isDrop\n ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n }\n\n /**\n * The base implementation of `wrapperValue` which returns the result of\n * performing a sequence of actions on the unwrapped `value`, where each\n * successive action is supplied the return value of the previous.\n *\n * @private\n * @param {*} value The unwrapped value.\n * @param {Array} actions Actions to perform to resolve the unwrapped value.\n * @returns {*} Returns the resolved value.\n */\n function baseWrapperValue(value, actions) {\n var result = value;\n if (result instanceof LazyWrapper) {\n result = result.value();\n }\n return arrayReduce(actions, function(result, action) {\n return action.func.apply(action.thisArg, arrayPush([result], action.args));\n }, result);\n }\n\n /**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\n function baseXor(arrays, iteratee, comparator) {\n var length = arrays.length;\n if (length < 2) {\n return length ? baseUniq(arrays[0]) : [];\n }\n var index = -1,\n result = Array(length);\n\n while (++index < length) {\n var array = arrays[index],\n othIndex = -1;\n\n while (++othIndex < length) {\n if (othIndex != index) {\n result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n }\n }\n }\n return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n }\n\n /**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\n function baseZipObject(props, values, assignFunc) {\n var index = -1,\n length = props.length,\n valsLength = values.length,\n result = {};\n\n while (++index < length) {\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n }\n\n /**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\n function castArrayLikeObject(value) {\n return isArrayLikeObject(value) ? value : [];\n }\n\n /**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\n function castFunction(value) {\n return typeof value == 'function' ? value : identity;\n }\n\n /**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\n function castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n }\n\n /**\n * A `baseRest` alias which can be replaced with `identity` by module\n * replacement plugins.\n *\n * @private\n * @type {Function}\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n var castRest = baseRest;\n\n /**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\n function castSlice(array, start, end) {\n var length = array.length;\n end = end === undefined ? length : end;\n return (!start && end >= length) ? array : baseSlice(array, start, end);\n }\n\n /**\n * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n *\n * @private\n * @param {number|Object} id The timer id or timeout object of the timer to clear.\n */\n var clearTimeout = ctxClearTimeout || function(id) {\n return root.clearTimeout(id);\n };\n\n /**\n * Creates a clone of `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\n function cloneBuffer(buffer, isDeep) {\n if (isDeep) {\n return buffer.slice();\n }\n var length = buffer.length,\n result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n buffer.copy(result);\n return result;\n }\n\n /**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\n function cloneArrayBuffer(arrayBuffer) {\n var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n return result;\n }\n\n /**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\n function cloneDataView(dataView, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n }\n\n /**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\n function cloneRegExp(regexp) {\n var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n result.lastIndex = regexp.lastIndex;\n return result;\n }\n\n /**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\n function cloneSymbol(symbol) {\n return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n }\n\n /**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\n function cloneTypedArray(typedArray, isDeep) {\n var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n }\n\n /**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\n function compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined,\n valIsNull = value === null,\n valIsReflexive = value === value,\n valIsSymbol = isSymbol(value);\n\n var othIsDefined = other !== undefined,\n othIsNull = other === null,\n othIsReflexive = other === other,\n othIsSymbol = isSymbol(other);\n\n if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n (valIsNull && othIsDefined && othIsReflexive) ||\n (!valIsDefined && othIsReflexive) ||\n !valIsReflexive) {\n return 1;\n }\n if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n (othIsNull && valIsDefined && valIsReflexive) ||\n (!othIsDefined && valIsReflexive) ||\n !othIsReflexive) {\n return -1;\n }\n }\n return 0;\n }\n\n /**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\n function compareMultiple(object, other, orders) {\n var index = -1,\n objCriteria = object.criteria,\n othCriteria = other.criteria,\n length = objCriteria.length,\n ordersLength = orders.length;\n\n while (++index < length) {\n var result = compareAscending(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) {\n return result;\n }\n var order = orders[index];\n return result * (order == 'desc' ? -1 : 1);\n }\n }\n // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n // that causes it, under certain circumstances, to provide the same value for\n // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n // for more details.\n //\n // This also ensures a stable sort in V8 and other engines.\n // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n return object.index - other.index;\n }\n\n /**\n * Creates an array that is the composition of partially applied arguments,\n * placeholders, and provided arguments into a single array of arguments.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to prepend to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgs(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersLength = holders.length,\n leftIndex = -1,\n leftLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(leftLength + rangeLength),\n isUncurried = !isCurried;\n\n while (++leftIndex < leftLength) {\n result[leftIndex] = partials[leftIndex];\n }\n while (++argsIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[holders[argsIndex]] = args[argsIndex];\n }\n }\n while (rangeLength--) {\n result[leftIndex++] = args[argsIndex++];\n }\n return result;\n }\n\n /**\n * This function is like `composeArgs` except that the arguments composition\n * is tailored for `_.partialRight`.\n *\n * @private\n * @param {Array} args The provided arguments.\n * @param {Array} partials The arguments to append to those provided.\n * @param {Array} holders The `partials` placeholder indexes.\n * @params {boolean} [isCurried] Specify composing for a curried function.\n * @returns {Array} Returns the new array of composed arguments.\n */\n function composeArgsRight(args, partials, holders, isCurried) {\n var argsIndex = -1,\n argsLength = args.length,\n holdersIndex = -1,\n holdersLength = holders.length,\n rightIndex = -1,\n rightLength = partials.length,\n rangeLength = nativeMax(argsLength - holdersLength, 0),\n result = Array(rangeLength + rightLength),\n isUncurried = !isCurried;\n\n while (++argsIndex < rangeLength) {\n result[argsIndex] = args[argsIndex];\n }\n var offset = argsIndex;\n while (++rightIndex < rightLength) {\n result[offset + rightIndex] = partials[rightIndex];\n }\n while (++holdersIndex < holdersLength) {\n if (isUncurried || argsIndex < argsLength) {\n result[offset + holders[holdersIndex]] = args[argsIndex++];\n }\n }\n return result;\n }\n\n /**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\n function copyArray(source, array) {\n var index = -1,\n length = source.length;\n\n array || (array = Array(length));\n while (++index < length) {\n array[index] = source[index];\n }\n return array;\n }\n\n /**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\n function copyObject(source, props, object, customizer) {\n var isNew = !object;\n object || (object = {});\n\n var index = -1,\n length = props.length;\n\n while (++index < length) {\n var key = props[index];\n\n var newValue = customizer\n ? customizer(object[key], source[key], key, object, source)\n : undefined;\n\n if (newValue === undefined) {\n newValue = source[key];\n }\n if (isNew) {\n baseAssignValue(object, key, newValue);\n } else {\n assignValue(object, key, newValue);\n }\n }\n return object;\n }\n\n /**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbols(source, object) {\n return copyObject(source, getSymbols(source), object);\n }\n\n /**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\n function copySymbolsIn(source, object) {\n return copyObject(source, getSymbolsIn(source), object);\n }\n\n /**\n * Creates a function like `_.groupBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} [initializer] The accumulator object initializer.\n * @returns {Function} Returns the new aggregator function.\n */\n function createAggregator(setter, initializer) {\n return function(collection, iteratee) {\n var func = isArray(collection) ? arrayAggregator : baseAggregator,\n accumulator = initializer ? initializer() : {};\n\n return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n };\n }\n\n /**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\n function createAssigner(assigner) {\n return baseRest(function(object, sources) {\n var index = -1,\n length = sources.length,\n customizer = length > 1 ? sources[length - 1] : undefined,\n guard = length > 2 ? sources[2] : undefined;\n\n customizer = (assigner.length > 3 && typeof customizer == 'function')\n ? (length--, customizer)\n : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n customizer = length < 3 ? undefined : customizer;\n length = 1;\n }\n object = Object(object);\n while (++index < length) {\n var source = sources[index];\n if (source) {\n assigner(object, source, index, customizer);\n }\n }\n return object;\n });\n }\n\n /**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseEach(eachFunc, fromRight) {\n return function(collection, iteratee) {\n if (collection == null) {\n return collection;\n }\n if (!isArrayLike(collection)) {\n return eachFunc(collection, iteratee);\n }\n var length = collection.length,\n index = fromRight ? length : -1,\n iterable = Object(collection);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (iteratee(iterable[index], index, iterable) === false) {\n break;\n }\n }\n return collection;\n };\n }\n\n /**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\n function createBaseFor(fromRight) {\n return function(object, iteratee, keysFunc) {\n var index = -1,\n iterable = Object(object),\n props = keysFunc(object),\n length = props.length;\n\n while (length--) {\n var key = props[fromRight ? length : ++index];\n if (iteratee(iterable[key], key, iterable) === false) {\n break;\n }\n }\n return object;\n };\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the optional `this`\n * binding of `thisArg`.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createBind(func, bitmask, thisArg) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return fn.apply(isBind ? thisArg : this, arguments);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.lowerFirst`.\n *\n * @private\n * @param {string} methodName The name of the `String` case method to use.\n * @returns {Function} Returns the new case function.\n */\n function createCaseFirst(methodName) {\n return function(string) {\n string = toString(string);\n\n var strSymbols = hasUnicode(string)\n ? stringToArray(string)\n : undefined;\n\n var chr = strSymbols\n ? strSymbols[0]\n : string.charAt(0);\n\n var trailing = strSymbols\n ? castSlice(strSymbols, 1).join('')\n : string.slice(1);\n\n return chr[methodName]() + trailing;\n };\n }\n\n /**\n * Creates a function like `_.camelCase`.\n *\n * @private\n * @param {Function} callback The function to combine each word.\n * @returns {Function} Returns the new compounder function.\n */\n function createCompounder(callback) {\n return function(string) {\n return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n };\n }\n\n /**\n * Creates a function that produces an instance of `Ctor` regardless of\n * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n *\n * @private\n * @param {Function} Ctor The constructor to wrap.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCtor(Ctor) {\n return function() {\n // Use a `switch` statement to work with class constructors. See\n // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n // for more details.\n var args = arguments;\n switch (args.length) {\n case 0: return new Ctor;\n case 1: return new Ctor(args[0]);\n case 2: return new Ctor(args[0], args[1]);\n case 3: return new Ctor(args[0], args[1], args[2]);\n case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n }\n var thisBinding = baseCreate(Ctor.prototype),\n result = Ctor.apply(thisBinding, args);\n\n // Mimic the constructor's `return` behavior.\n // See https://es5.github.io/#x13.2.2 for more details.\n return isObject(result) ? result : thisBinding;\n };\n }\n\n /**\n * Creates a function that wraps `func` to enable currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {number} arity The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createCurry(func, bitmask, arity) {\n var Ctor = createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length,\n placeholder = getHolder(wrapper);\n\n while (index--) {\n args[index] = arguments[index];\n }\n var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n ? []\n : replaceHolders(args, placeholder);\n\n length -= holders.length;\n if (length < arity) {\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, undefined,\n args, holders, undefined, undefined, arity - length);\n }\n var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n return apply(fn, this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\n function createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!isArrayLike(collection)) {\n var iteratee = getIteratee(predicate, 3);\n collection = keys(collection);\n predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n }\n\n /**\n * Creates a `_.flow` or `_.flowRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new flow function.\n */\n function createFlow(fromRight) {\n return flatRest(function(funcs) {\n var length = funcs.length,\n index = length,\n prereq = LodashWrapper.prototype.thru;\n\n if (fromRight) {\n funcs.reverse();\n }\n while (index--) {\n var func = funcs[index];\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n var wrapper = new LodashWrapper([], true);\n }\n }\n index = wrapper ? index : length;\n while (++index < length) {\n func = funcs[index];\n\n var funcName = getFuncName(func),\n data = funcName == 'wrapper' ? getData(func) : undefined;\n\n if (data && isLaziable(data[0]) &&\n data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n !data[4].length && data[9] == 1\n ) {\n wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n } else {\n wrapper = (func.length == 1 && isLaziable(func))\n ? wrapper[funcName]()\n : wrapper.thru(func);\n }\n }\n return function() {\n var args = arguments,\n value = args[0];\n\n if (wrapper && args.length == 1 && isArray(value)) {\n return wrapper.plant(value).value();\n }\n var index = 0,\n result = length ? funcs[index].apply(this, args) : value;\n\n while (++index < length) {\n result = funcs[index].call(this, result);\n }\n return result;\n };\n });\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with optional `this`\n * binding of `thisArg`, partial application, and currying.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [partialsRight] The arguments to append to those provided\n * to the new function.\n * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n var isAry = bitmask & WRAP_ARY_FLAG,\n isBind = bitmask & WRAP_BIND_FLAG,\n isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n isFlip = bitmask & WRAP_FLIP_FLAG,\n Ctor = isBindKey ? undefined : createCtor(func);\n\n function wrapper() {\n var length = arguments.length,\n args = Array(length),\n index = length;\n\n while (index--) {\n args[index] = arguments[index];\n }\n if (isCurried) {\n var placeholder = getHolder(wrapper),\n holdersCount = countHolders(args, placeholder);\n }\n if (partials) {\n args = composeArgs(args, partials, holders, isCurried);\n }\n if (partialsRight) {\n args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n }\n length -= holdersCount;\n if (isCurried && length < arity) {\n var newHolders = replaceHolders(args, placeholder);\n return createRecurry(\n func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n args, newHolders, argPos, ary, arity - length\n );\n }\n var thisBinding = isBind ? thisArg : this,\n fn = isBindKey ? thisBinding[func] : func;\n\n length = args.length;\n if (argPos) {\n args = reorder(args, argPos);\n } else if (isFlip && length > 1) {\n args.reverse();\n }\n if (isAry && ary < length) {\n args.length = ary;\n }\n if (this && this !== root && this instanceof wrapper) {\n fn = Ctor || createCtor(fn);\n }\n return fn.apply(thisBinding, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\n function createInverter(setter, toIteratee) {\n return function(object, iteratee) {\n return baseInverter(object, setter, toIteratee(iteratee), {});\n };\n }\n\n /**\n * Creates a function that performs a mathematical operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @param {number} [defaultValue] The value used for `undefined` arguments.\n * @returns {Function} Returns the new mathematical operation function.\n */\n function createMathOperation(operator, defaultValue) {\n return function(value, other) {\n var result;\n if (value === undefined && other === undefined) {\n return defaultValue;\n }\n if (value !== undefined) {\n result = value;\n }\n if (other !== undefined) {\n if (result === undefined) {\n return other;\n }\n if (typeof value == 'string' || typeof other == 'string') {\n value = baseToString(value);\n other = baseToString(other);\n } else {\n value = baseToNumber(value);\n other = baseToNumber(other);\n }\n result = operator(value, other);\n }\n return result;\n };\n }\n\n /**\n * Creates a function like `_.over`.\n *\n * @private\n * @param {Function} arrayFunc The function to iterate over iteratees.\n * @returns {Function} Returns the new over function.\n */\n function createOver(arrayFunc) {\n return flatRest(function(iteratees) {\n iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n return baseRest(function(args) {\n var thisArg = this;\n return arrayFunc(iteratees, function(iteratee) {\n return apply(iteratee, thisArg, args);\n });\n });\n });\n }\n\n /**\n * Creates the padding for `string` based on `length`. The `chars` string\n * is truncated if the number of characters exceeds `length`.\n *\n * @private\n * @param {number} length The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padding for `string`.\n */\n function createPadding(length, chars) {\n chars = chars === undefined ? ' ' : baseToString(chars);\n\n var charsLength = chars.length;\n if (charsLength < 2) {\n return charsLength ? baseRepeat(chars, length) : chars;\n }\n var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n return hasUnicode(chars)\n ? castSlice(stringToArray(result), 0, length).join('')\n : result.slice(0, length);\n }\n\n /**\n * Creates a function that wraps `func` to invoke it with the `this` binding\n * of `thisArg` and `partials` prepended to the arguments it receives.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} partials The arguments to prepend to those provided to\n * the new function.\n * @returns {Function} Returns the new wrapped function.\n */\n function createPartial(func, bitmask, thisArg, partials) {\n var isBind = bitmask & WRAP_BIND_FLAG,\n Ctor = createCtor(func);\n\n function wrapper() {\n var argsIndex = -1,\n argsLength = arguments.length,\n leftIndex = -1,\n leftLength = partials.length,\n args = Array(leftLength + argsLength),\n fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n while (++leftIndex < leftLength) {\n args[leftIndex] = partials[leftIndex];\n }\n while (argsLength--) {\n args[leftIndex++] = arguments[++argsIndex];\n }\n return apply(fn, isBind ? thisArg : this, args);\n }\n return wrapper;\n }\n\n /**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\n function createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n end = step = undefined;\n }\n // Ensure the sign of `-0` is preserved.\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n return baseRange(start, end, step, fromRight);\n };\n }\n\n /**\n * Creates a function that performs a relational operation on two values.\n *\n * @private\n * @param {Function} operator The function to perform the operation.\n * @returns {Function} Returns the new relational operation function.\n */\n function createRelationalOperation(operator) {\n return function(value, other) {\n if (!(typeof value == 'string' && typeof other == 'string')) {\n value = toNumber(value);\n other = toNumber(other);\n }\n return operator(value, other);\n };\n }\n\n /**\n * Creates a function that wraps `func` to continue currying.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @param {Function} wrapFunc The function to create the `func` wrapper.\n * @param {*} placeholder The placeholder value.\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to prepend to those provided to\n * the new function.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n var isCurry = bitmask & WRAP_CURRY_FLAG,\n newHolders = isCurry ? holders : undefined,\n newHoldersRight = isCurry ? undefined : holders,\n newPartials = isCurry ? partials : undefined,\n newPartialsRight = isCurry ? undefined : partials;\n\n bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n }\n var newData = [\n func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n newHoldersRight, argPos, ary, arity\n ];\n\n var result = wrapFunc.apply(undefined, newData);\n if (isLaziable(func)) {\n setData(result, newData);\n }\n result.placeholder = placeholder;\n return setWrapToString(result, func, bitmask);\n }\n\n /**\n * Creates a function like `_.round`.\n *\n * @private\n * @param {string} methodName The name of the `Math` method to use when rounding.\n * @returns {Function} Returns the new round function.\n */\n function createRound(methodName) {\n var func = Math[methodName];\n return function(number, precision) {\n number = toNumber(number);\n precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n if (precision && nativeIsFinite(number)) {\n // Shift with exponential notation to avoid floating-point issues.\n // See [MDN](https://mdn.io/round#Examples) for more details.\n var pair = (toString(number) + 'e').split('e'),\n value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n pair = (toString(value) + 'e').split('e');\n return +(pair[0] + 'e' + (+pair[1] - precision));\n }\n return func(number);\n };\n }\n\n /**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\n var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n };\n\n /**\n * Creates a `_.toPairs` or `_.toPairsIn` function.\n *\n * @private\n * @param {Function} keysFunc The function to get the keys of a given object.\n * @returns {Function} Returns the new pairs function.\n */\n function createToPairs(keysFunc) {\n return function(object) {\n var tag = getTag(object);\n if (tag == mapTag) {\n return mapToArray(object);\n }\n if (tag == setTag) {\n return setToPairs(object);\n }\n return baseToPairs(object, keysFunc(object));\n };\n }\n\n /**\n * Creates a function that either curries or invokes `func` with optional\n * `this` binding and partially applied arguments.\n *\n * @private\n * @param {Function|string} func The function or method name to wrap.\n * @param {number} bitmask The bitmask flags.\n * 1 - `_.bind`\n * 2 - `_.bindKey`\n * 4 - `_.curry` or `_.curryRight` of a bound function\n * 8 - `_.curry`\n * 16 - `_.curryRight`\n * 32 - `_.partial`\n * 64 - `_.partialRight`\n * 128 - `_.rearg`\n * 256 - `_.ary`\n * 512 - `_.flip`\n * @param {*} [thisArg] The `this` binding of `func`.\n * @param {Array} [partials] The arguments to be partially applied.\n * @param {Array} [holders] The `partials` placeholder indexes.\n * @param {Array} [argPos] The argument positions of the new function.\n * @param {number} [ary] The arity cap of `func`.\n * @param {number} [arity] The arity of `func`.\n * @returns {Function} Returns the new wrapped function.\n */\n function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n if (!isBindKey && typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var length = partials ? partials.length : 0;\n if (!length) {\n bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n partials = holders = undefined;\n }\n ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n arity = arity === undefined ? arity : toInteger(arity);\n length -= holders ? holders.length : 0;\n\n if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n var partialsRight = partials,\n holdersRight = holders;\n\n partials = holders = undefined;\n }\n var data = isBindKey ? undefined : getData(func);\n\n var newData = [\n func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n argPos, ary, arity\n ];\n\n if (data) {\n mergeData(newData, data);\n }\n func = newData[0];\n bitmask = newData[1];\n thisArg = newData[2];\n partials = newData[3];\n holders = newData[4];\n arity = newData[9] = newData[9] === undefined\n ? (isBindKey ? 0 : func.length)\n : nativeMax(newData[9] - length, 0);\n\n if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n }\n if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n var result = createBind(func, bitmask, thisArg);\n } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n result = createCurry(func, bitmask, arity);\n } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n result = createPartial(func, bitmask, thisArg, partials);\n } else {\n result = createHybrid.apply(undefined, newData);\n }\n var setter = data ? baseSetData : setData;\n return setWrapToString(setter(result, newData), func, bitmask);\n }\n\n /**\n * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n * of source objects to the destination object for all destination properties\n * that resolve to `undefined`.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsAssignIn(objValue, srcValue, key, object) {\n if (objValue === undefined ||\n (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n return srcValue;\n }\n return objValue;\n }\n\n /**\n * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n * objects into destination objects that are passed thru.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to merge.\n * @param {Object} object The parent object of `objValue`.\n * @param {Object} source The parent object of `srcValue`.\n * @param {Object} [stack] Tracks traversed source values and their merged\n * counterparts.\n * @returns {*} Returns the value to assign.\n */\n function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n if (isObject(objValue) && isObject(srcValue)) {\n // Recursively merge objects and arrays (susceptible to call stack limits).\n stack.set(srcValue, objValue);\n baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n stack['delete'](srcValue);\n }\n return objValue;\n }\n\n /**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\n function customOmitClone(value) {\n return isPlainObject(value) ? undefined : value;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\n function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n arrLength = array.length,\n othLength = other.length;\n\n if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n return false;\n }\n // Check that cyclic values are equal.\n var arrStacked = stack.get(array);\n var othStacked = stack.get(other);\n if (arrStacked && othStacked) {\n return arrStacked == other && othStacked == array;\n }\n var index = -1,\n result = true,\n seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n stack.set(array, other);\n stack.set(other, array);\n\n // Ignore non-index properties.\n while (++index < arrLength) {\n var arrValue = array[index],\n othValue = other[index];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, arrValue, index, other, array, stack)\n : customizer(arrValue, othValue, index, array, other, stack);\n }\n if (compared !== undefined) {\n if (compared) {\n continue;\n }\n result = false;\n break;\n }\n // Recursively compare arrays (susceptible to call stack limits).\n if (seen) {\n if (!arraySome(other, function(othValue, othIndex) {\n if (!cacheHas(seen, othIndex) &&\n (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n return seen.push(othIndex);\n }\n })) {\n result = false;\n break;\n }\n } else if (!(\n arrValue === othValue ||\n equalFunc(arrValue, othValue, bitmask, customizer, stack)\n )) {\n result = false;\n break;\n }\n }\n stack['delete'](array);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n switch (tag) {\n case dataViewTag:\n if ((object.byteLength != other.byteLength) ||\n (object.byteOffset != other.byteOffset)) {\n return false;\n }\n object = object.buffer;\n other = other.buffer;\n\n case arrayBufferTag:\n if ((object.byteLength != other.byteLength) ||\n !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n return false;\n }\n return true;\n\n case boolTag:\n case dateTag:\n case numberTag:\n // Coerce booleans to `1` or `0` and dates to milliseconds.\n // Invalid dates are coerced to `NaN`.\n return eq(+object, +other);\n\n case errorTag:\n return object.name == other.name && object.message == other.message;\n\n case regexpTag:\n case stringTag:\n // Coerce regexes to strings and treat strings, primitives and objects,\n // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n // for more details.\n return object == (other + '');\n\n case mapTag:\n var convert = mapToArray;\n\n case setTag:\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n convert || (convert = setToArray);\n\n if (object.size != other.size && !isPartial) {\n return false;\n }\n // Assume cyclic values are equal.\n var stacked = stack.get(object);\n if (stacked) {\n return stacked == other;\n }\n bitmask |= COMPARE_UNORDERED_FLAG;\n\n // Recursively compare objects (susceptible to call stack limits).\n stack.set(object, other);\n var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n stack['delete'](object);\n return result;\n\n case symbolTag:\n if (symbolValueOf) {\n return symbolValueOf.call(object) == symbolValueOf.call(other);\n }\n }\n return false;\n }\n\n /**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\n function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n objProps = getAllKeys(object),\n objLength = objProps.length,\n othProps = getAllKeys(other),\n othLength = othProps.length;\n\n if (objLength != othLength && !isPartial) {\n return false;\n }\n var index = objLength;\n while (index--) {\n var key = objProps[index];\n if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n return false;\n }\n }\n // Check that cyclic values are equal.\n var objStacked = stack.get(object);\n var othStacked = stack.get(other);\n if (objStacked && othStacked) {\n return objStacked == other && othStacked == object;\n }\n var result = true;\n stack.set(object, other);\n stack.set(other, object);\n\n var skipCtor = isPartial;\n while (++index < objLength) {\n key = objProps[index];\n var objValue = object[key],\n othValue = other[key];\n\n if (customizer) {\n var compared = isPartial\n ? customizer(othValue, objValue, key, other, object, stack)\n : customizer(objValue, othValue, key, object, other, stack);\n }\n // Recursively compare objects (susceptible to call stack limits).\n if (!(compared === undefined\n ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n : compared\n )) {\n result = false;\n break;\n }\n skipCtor || (skipCtor = key == 'constructor');\n }\n if (result && !skipCtor) {\n var objCtor = object.constructor,\n othCtor = other.constructor;\n\n // Non `Object` object instances with different constructors are not equal.\n if (objCtor != othCtor &&\n ('constructor' in object && 'constructor' in other) &&\n !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n result = false;\n }\n }\n stack['delete'](object);\n stack['delete'](other);\n return result;\n }\n\n /**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\n function flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n }\n\n /**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n }\n\n /**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\n function getAllKeysIn(object) {\n return baseGetAllKeys(object, keysIn, getSymbolsIn);\n }\n\n /**\n * Gets metadata for `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {*} Returns the metadata for `func`.\n */\n var getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n };\n\n /**\n * Gets the name of `func`.\n *\n * @private\n * @param {Function} func The function to query.\n * @returns {string} Returns the function name.\n */\n function getFuncName(func) {\n var result = (func.name + ''),\n array = realNames[result],\n length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n while (length--) {\n var data = array[length],\n otherFunc = data.func;\n if (otherFunc == null || otherFunc == func) {\n return data.name;\n }\n }\n return result;\n }\n\n /**\n * Gets the argument placeholder value for `func`.\n *\n * @private\n * @param {Function} func The function to inspect.\n * @returns {*} Returns the placeholder value.\n */\n function getHolder(func) {\n var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n return object.placeholder;\n }\n\n /**\n * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n * this function returns the custom method, otherwise it returns `baseIteratee`.\n * If arguments are provided, the chosen function is invoked with them and\n * its result is returned.\n *\n * @private\n * @param {*} [value] The value to convert to an iteratee.\n * @param {number} [arity] The arity of the created iteratee.\n * @returns {Function} Returns the chosen function or its result.\n */\n function getIteratee() {\n var result = lodash.iteratee || iteratee;\n result = result === iteratee ? baseIteratee : result;\n return arguments.length ? result(arguments[0], arguments[1]) : result;\n }\n\n /**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\n function getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n }\n\n /**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\n function getMatchData(object) {\n var result = keys(object),\n length = result.length;\n\n while (length--) {\n var key = result[length],\n value = object[key];\n\n result[length] = [key, value, isStrictComparable(value)];\n }\n return result;\n }\n\n /**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\n function getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n }\n\n /**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\n function getRawTag(value) {\n var isOwn = hasOwnProperty.call(value, symToStringTag),\n tag = value[symToStringTag];\n\n try {\n value[symToStringTag] = undefined;\n var unmasked = true;\n } catch (e) {}\n\n var result = nativeObjectToString.call(value);\n if (unmasked) {\n if (isOwn) {\n value[symToStringTag] = tag;\n } else {\n delete value[symToStringTag];\n }\n }\n return result;\n }\n\n /**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n if (object == null) {\n return [];\n }\n object = Object(object);\n return arrayFilter(nativeGetSymbols(object), function(symbol) {\n return propertyIsEnumerable.call(object, symbol);\n });\n };\n\n /**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\n var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n var result = [];\n while (object) {\n arrayPush(result, getSymbols(object));\n object = getPrototype(object);\n }\n return result;\n };\n\n /**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\n var getTag = baseGetTag;\n\n // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n (Map && getTag(new Map) != mapTag) ||\n (Promise && getTag(Promise.resolve()) != promiseTag) ||\n (Set && getTag(new Set) != setTag) ||\n (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n getTag = function(value) {\n var result = baseGetTag(value),\n Ctor = result == objectTag ? value.constructor : undefined,\n ctorString = Ctor ? toSource(Ctor) : '';\n\n if (ctorString) {\n switch (ctorString) {\n case dataViewCtorString: return dataViewTag;\n case mapCtorString: return mapTag;\n case promiseCtorString: return promiseTag;\n case setCtorString: return setTag;\n case weakMapCtorString: return weakMapTag;\n }\n }\n return result;\n };\n }\n\n /**\n * Gets the view, applying any `transforms` to the `start` and `end` positions.\n *\n * @private\n * @param {number} start The start of the view.\n * @param {number} end The end of the view.\n * @param {Array} transforms The transformations to apply to the view.\n * @returns {Object} Returns an object containing the `start` and `end`\n * positions of the view.\n */\n function getView(start, end, transforms) {\n var index = -1,\n length = transforms.length;\n\n while (++index < length) {\n var data = transforms[index],\n size = data.size;\n\n switch (data.type) {\n case 'drop': start += size; break;\n case 'dropRight': end -= size; break;\n case 'take': end = nativeMin(end, start + size); break;\n case 'takeRight': start = nativeMax(start, end - size); break;\n }\n }\n return { 'start': start, 'end': end };\n }\n\n /**\n * Extracts wrapper details from the `source` body comment.\n *\n * @private\n * @param {string} source The source to inspect.\n * @returns {Array} Returns the wrapper details.\n */\n function getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n }\n\n /**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\n function hasPath(object, path, hasFunc) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length,\n result = false;\n\n while (++index < length) {\n var key = toKey(path[index]);\n if (!(result = object != null && hasFunc(object, key))) {\n break;\n }\n object = object[key];\n }\n if (result || ++index != length) {\n return result;\n }\n length = object == null ? 0 : object.length;\n return !!length && isLength(length) && isIndex(key, length) &&\n (isArray(object) || isArguments(object));\n }\n\n /**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\n function initCloneArray(array) {\n var length = array.length,\n result = new array.constructor(length);\n\n // Add properties assigned by `RegExp#exec`.\n if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n result.index = array.index;\n result.input = array.input;\n }\n return result;\n }\n\n /**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneObject(object) {\n return (typeof object.constructor == 'function' && !isPrototype(object))\n ? baseCreate(getPrototype(object))\n : {};\n }\n\n /**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\n function initCloneByTag(object, tag, isDeep) {\n var Ctor = object.constructor;\n switch (tag) {\n case arrayBufferTag:\n return cloneArrayBuffer(object);\n\n case boolTag:\n case dateTag:\n return new Ctor(+object);\n\n case dataViewTag:\n return cloneDataView(object, isDeep);\n\n case float32Tag: case float64Tag:\n case int8Tag: case int16Tag: case int32Tag:\n case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n return cloneTypedArray(object, isDeep);\n\n case mapTag:\n return new Ctor;\n\n case numberTag:\n case stringTag:\n return new Ctor(object);\n\n case regexpTag:\n return cloneRegExp(object);\n\n case setTag:\n return new Ctor;\n\n case symbolTag:\n return cloneSymbol(object);\n }\n }\n\n /**\n * Inserts wrapper `details` in a comment at the top of the `source` body.\n *\n * @private\n * @param {string} source The source to modify.\n * @returns {Array} details The details to insert.\n * @returns {string} Returns the modified source.\n */\n function insertWrapDetails(source, details) {\n var length = details.length;\n if (!length) {\n return source;\n }\n var lastIndex = length - 1;\n details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n details = details.join(length > 2 ? ', ' : ' ');\n return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n }\n\n /**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\n function isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n }\n\n /**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\n function isIndex(value, length) {\n var type = typeof value;\n length = length == null ? MAX_SAFE_INTEGER : length;\n\n return !!length &&\n (type == 'number' ||\n (type != 'symbol' && reIsUint.test(value))) &&\n (value > -1 && value % 1 == 0 && value < length);\n }\n\n /**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n * else `false`.\n */\n function isIterateeCall(value, index, object) {\n if (!isObject(object)) {\n return false;\n }\n var type = typeof index;\n if (type == 'number'\n ? (isArrayLike(object) && isIndex(index, object.length))\n : (type == 'string' && index in object)\n ) {\n return eq(object[index], value);\n }\n return false;\n }\n\n /**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\n function isKey(value, object) {\n if (isArray(value)) {\n return false;\n }\n var type = typeof value;\n if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n value == null || isSymbol(value)) {\n return true;\n }\n return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n (object != null && value in Object(object));\n }\n\n /**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\n function isKeyable(value) {\n var type = typeof value;\n return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n ? (value !== '__proto__')\n : (value === null);\n }\n\n /**\n * Checks if `func` has a lazy counterpart.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n * else `false`.\n */\n function isLaziable(func) {\n var funcName = getFuncName(func),\n other = lodash[funcName];\n\n if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n return false;\n }\n if (func === other) {\n return true;\n }\n var data = getData(other);\n return !!data && func === data[0];\n }\n\n /**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\n function isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n }\n\n /**\n * Checks if `func` is capable of being masked.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n */\n var isMaskable = coreJsData ? isFunction : stubFalse;\n\n /**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\n function isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n }\n\n /**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n * equality comparisons, else `false`.\n */\n function isStrictComparable(value) {\n return value === value && !isObject(value);\n }\n\n /**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\n function matchesStrictComparable(key, srcValue) {\n return function(object) {\n if (object == null) {\n return false;\n }\n return object[key] === srcValue &&\n (srcValue !== undefined || (key in Object(object)));\n };\n }\n\n /**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\n function memoizeCapped(func) {\n var result = memoize(func, function(key) {\n if (cache.size === MAX_MEMOIZE_SIZE) {\n cache.clear();\n }\n return key;\n });\n\n var cache = result.cache;\n return result;\n }\n\n /**\n * Merges the function metadata of `source` into `data`.\n *\n * Merging metadata reduces the number of wrappers used to invoke a function.\n * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n * may be applied regardless of execution order. Methods like `_.ary` and\n * `_.rearg` modify function arguments, making the order in which they are\n * executed important, preventing the merging of metadata. However, we make\n * an exception for a safe combined case where curried functions have `_.ary`\n * and or `_.rearg` applied.\n *\n * @private\n * @param {Array} data The destination metadata.\n * @param {Array} source The source metadata.\n * @returns {Array} Returns `data`.\n */\n function mergeData(data, source) {\n var bitmask = data[1],\n srcBitmask = source[1],\n newBitmask = bitmask | srcBitmask,\n isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n var isCombo =\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n // Exit early if metadata can't be merged.\n if (!(isCommon || isCombo)) {\n return data;\n }\n // Use source `thisArg` if available.\n if (srcBitmask & WRAP_BIND_FLAG) {\n data[2] = source[2];\n // Set when currying a bound function.\n newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n }\n // Compose partial arguments.\n var value = source[3];\n if (value) {\n var partials = data[3];\n data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n }\n // Compose partial right arguments.\n value = source[5];\n if (value) {\n partials = data[5];\n data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n }\n // Use source `argPos` if available.\n value = source[7];\n if (value) {\n data[7] = value;\n }\n // Use source `ary` if it's smaller.\n if (srcBitmask & WRAP_ARY_FLAG) {\n data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n }\n // Use source `arity` if one is not provided.\n if (data[9] == null) {\n data[9] = source[9];\n }\n // Use source `func` and merge bitmasks.\n data[0] = source[0];\n data[1] = newBitmask;\n\n return data;\n }\n\n /**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\n function nativeKeysIn(object) {\n var result = [];\n if (object != null) {\n for (var key in Object(object)) {\n result.push(key);\n }\n }\n return result;\n }\n\n /**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\n function objectToString(value) {\n return nativeObjectToString.call(value);\n }\n\n /**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\n function overRest(func, start, transform) {\n start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n return function() {\n var args = arguments,\n index = -1,\n length = nativeMax(args.length - start, 0),\n array = Array(length);\n\n while (++index < length) {\n array[index] = args[start + index];\n }\n index = -1;\n var otherArgs = Array(start + 1);\n while (++index < start) {\n otherArgs[index] = args[index];\n }\n otherArgs[start] = transform(array);\n return apply(func, this, otherArgs);\n };\n }\n\n /**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\n function parent(object, path) {\n return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n }\n\n /**\n * Reorder `array` according to the specified indexes where the element at\n * the first index is assigned as the first element, the element at\n * the second index is assigned as the second element, and so on.\n *\n * @private\n * @param {Array} array The array to reorder.\n * @param {Array} indexes The arranged array indexes.\n * @returns {Array} Returns `array`.\n */\n function reorder(array, indexes) {\n var arrLength = array.length,\n length = nativeMin(indexes.length, arrLength),\n oldArray = copyArray(array);\n\n while (length--) {\n var index = indexes[length];\n array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n }\n return array;\n }\n\n /**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\n function safeGet(object, key) {\n if (key === 'constructor' && typeof object[key] === 'function') {\n return;\n }\n\n if (key == '__proto__') {\n return;\n }\n\n return object[key];\n }\n\n /**\n * Sets metadata for `func`.\n *\n * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n * period of time, it will trip its breaker and transition to an identity\n * function to avoid garbage collection pauses in V8. See\n * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n * for more details.\n *\n * @private\n * @param {Function} func The function to associate metadata with.\n * @param {*} data The metadata.\n * @returns {Function} Returns `func`.\n */\n var setData = shortOut(baseSetData);\n\n /**\n * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n *\n * @private\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @returns {number|Object} Returns the timer id or timeout object.\n */\n var setTimeout = ctxSetTimeout || function(func, wait) {\n return root.setTimeout(func, wait);\n };\n\n /**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\n var setToString = shortOut(baseSetToString);\n\n /**\n * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n * with wrapper details in a comment at the top of the source body.\n *\n * @private\n * @param {Function} wrapper The function to modify.\n * @param {Function} reference The reference function.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Function} Returns `wrapper`.\n */\n function setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n }\n\n /**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\n function shortOut(func) {\n var count = 0,\n lastCalled = 0;\n\n return function() {\n var stamp = nativeNow(),\n remaining = HOT_SPAN - (stamp - lastCalled);\n\n lastCalled = stamp;\n if (remaining > 0) {\n if (++count >= HOT_COUNT) {\n return arguments[0];\n }\n } else {\n count = 0;\n }\n return func.apply(undefined, arguments);\n };\n }\n\n /**\n * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n *\n * @private\n * @param {Array} array The array to shuffle.\n * @param {number} [size=array.length] The size of `array`.\n * @returns {Array} Returns `array`.\n */\n function shuffleSelf(array, size) {\n var index = -1,\n length = array.length,\n lastIndex = length - 1;\n\n size = size === undefined ? length : size;\n while (++index < size) {\n var rand = baseRandom(index, lastIndex),\n value = array[rand];\n\n array[rand] = array[index];\n array[index] = value;\n }\n array.length = size;\n return array;\n }\n\n /**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\n var stringToPath = memoizeCapped(function(string) {\n var result = [];\n if (string.charCodeAt(0) === 46 /* . */) {\n result.push('');\n }\n string.replace(rePropName, function(match, number, quote, subString) {\n result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n });\n return result;\n });\n\n /**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\n function toKey(value) {\n if (typeof value == 'string' || isSymbol(value)) {\n return value;\n }\n var result = (value + '');\n return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n }\n\n /**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\n function toSource(func) {\n if (func != null) {\n try {\n return funcToString.call(func);\n } catch (e) {}\n try {\n return (func + '');\n } catch (e) {}\n }\n return '';\n }\n\n /**\n * Updates wrapper `details` based on `bitmask` flags.\n *\n * @private\n * @returns {Array} details The details to modify.\n * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n * @returns {Array} Returns `details`.\n */\n function updateWrapDetails(details, bitmask) {\n arrayEach(wrapFlags, function(pair) {\n var value = '_.' + pair[0];\n if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n details.push(value);\n }\n });\n return details.sort();\n }\n\n /**\n * Creates a clone of `wrapper`.\n *\n * @private\n * @param {Object} wrapper The wrapper to clone.\n * @returns {Object} Returns the cloned wrapper.\n */\n function wrapperClone(wrapper) {\n if (wrapper instanceof LazyWrapper) {\n return wrapper.clone();\n }\n var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n result.__actions__ = copyArray(wrapper.__actions__);\n result.__index__ = wrapper.__index__;\n result.__values__ = wrapper.__values__;\n return result;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an array of elements split into groups the length of `size`.\n * If `array` can't be split evenly, the final chunk will be the remaining\n * elements.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to process.\n * @param {number} [size=1] The length of each chunk\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the new array of chunks.\n * @example\n *\n * _.chunk(['a', 'b', 'c', 'd'], 2);\n * // => [['a', 'b'], ['c', 'd']]\n *\n * _.chunk(['a', 'b', 'c', 'd'], 3);\n * // => [['a', 'b', 'c'], ['d']]\n */\n function chunk(array, size, guard) {\n if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n size = 1;\n } else {\n size = nativeMax(toInteger(size), 0);\n }\n var length = array == null ? 0 : array.length;\n if (!length || size < 1) {\n return [];\n }\n var index = 0,\n resIndex = 0,\n result = Array(nativeCeil(length / size));\n\n while (index < length) {\n result[resIndex++] = baseSlice(array, index, (index += size));\n }\n return result;\n }\n\n /**\n * Creates an array with all falsey values removed. The values `false`, `null`,\n * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to compact.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.compact([0, 1, false, 2, '', 3]);\n * // => [1, 2, 3]\n */\n function compact(array) {\n var index = -1,\n length = array == null ? 0 : array.length,\n resIndex = 0,\n result = [];\n\n while (++index < length) {\n var value = array[index];\n if (value) {\n result[resIndex++] = value;\n }\n }\n return result;\n }\n\n /**\n * Creates a new array concatenating `array` with any additional arrays\n * and/or values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to concatenate.\n * @param {...*} [values] The values to concatenate.\n * @returns {Array} Returns the new concatenated array.\n * @example\n *\n * var array = [1];\n * var other = _.concat(array, 2, [3], [[4]]);\n *\n * console.log(other);\n * // => [1, 2, 3, [4]]\n *\n * console.log(array);\n * // => [1]\n */\n function concat() {\n var length = arguments.length;\n if (!length) {\n return [];\n }\n var args = Array(length - 1),\n array = arguments[0],\n index = length;\n\n while (index--) {\n args[index - 1] = arguments[index];\n }\n return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n }\n\n /**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\n var difference = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `iteratee` which\n * is invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var differenceBy = baseRest(function(array, values) {\n var iteratee = last(values);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\n var differenceWith = baseRest(function(array, values) {\n var comparator = last(values);\n if (isArrayLikeObject(comparator)) {\n comparator = undefined;\n }\n return isArrayLikeObject(array)\n ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n : [];\n });\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.drop([1, 2, 3]);\n * // => [2, 3]\n *\n * _.drop([1, 2, 3], 2);\n * // => [3]\n *\n * _.drop([1, 2, 3], 5);\n * // => []\n *\n * _.drop([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function drop(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with `n` elements dropped from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to drop.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.dropRight([1, 2, 3]);\n * // => [1, 2]\n *\n * _.dropRight([1, 2, 3], 2);\n * // => [1]\n *\n * _.dropRight([1, 2, 3], 5);\n * // => []\n *\n * _.dropRight([1, 2, 3], 0);\n * // => [1, 2, 3]\n */\n function dropRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the end.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.dropRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropRightWhile(users, ['active', false]);\n * // => objects for ['barney']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropRightWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` excluding elements dropped from the beginning.\n * Elements are dropped until `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.dropWhile(users, function(o) { return !o.active; });\n * // => objects for ['pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.dropWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.dropWhile(users, ['active', false]);\n * // => objects for ['pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.dropWhile(users, 'active');\n * // => objects for ['barney', 'fred', 'pebbles']\n */\n function dropWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), true)\n : [];\n }\n\n /**\n * Fills elements of `array` with `value` from `start` up to, but not\n * including, `end`.\n *\n * **Note:** This method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Array\n * @param {Array} array The array to fill.\n * @param {*} value The value to fill `array` with.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.fill(array, 'a');\n * console.log(array);\n * // => ['a', 'a', 'a']\n *\n * _.fill(Array(3), 2);\n * // => [2, 2, 2]\n *\n * _.fill([4, 6, 8, 10], '*', 1, 3);\n * // => [4, '*', '*', 10]\n */\n function fill(array, value, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n start = 0;\n end = length;\n }\n return baseFill(array, value, start, end);\n }\n\n /**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\n function findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index);\n }\n\n /**\n * This method is like `_.findIndex` except that it iterates over elements\n * of `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n * // => 2\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n * // => 0\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastIndex(users, ['active', false]);\n * // => 2\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastIndex(users, 'active');\n * // => 0\n */\n function findLastIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length - 1;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = fromIndex < 0\n ? nativeMax(length + index, 0)\n : nativeMin(index, length - 1);\n }\n return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n }\n\n /**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\n function flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n }\n\n /**\n * Recursively flattens `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flattenDeep([1, [2, [3, [4]], 5]]);\n * // => [1, 2, 3, 4, 5]\n */\n function flattenDeep(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, INFINITY) : [];\n }\n\n /**\n * Recursively flatten `array` up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * var array = [1, [2, [3, [4]], 5]];\n *\n * _.flattenDepth(array, 1);\n * // => [1, 2, [3, [4]], 5]\n *\n * _.flattenDepth(array, 2);\n * // => [1, 2, 3, [4], 5]\n */\n function flattenDepth(array, depth) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(array, depth);\n }\n\n /**\n * The inverse of `_.toPairs`; this method returns an object composed\n * from key-value `pairs`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} pairs The key-value pairs.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.fromPairs([['a', 1], ['b', 2]]);\n * // => { 'a': 1, 'b': 2 }\n */\n function fromPairs(pairs) {\n var index = -1,\n length = pairs == null ? 0 : pairs.length,\n result = {};\n\n while (++index < length) {\n var pair = pairs[index];\n result[pair[0]] = pair[1];\n }\n return result;\n }\n\n /**\n * Gets the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias first\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the first element of `array`.\n * @example\n *\n * _.head([1, 2, 3]);\n * // => 1\n *\n * _.head([]);\n * // => undefined\n */\n function head(array) {\n return (array && array.length) ? array[0] : undefined;\n }\n\n /**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\n function indexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n }\n\n /**\n * Gets all but the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.initial([1, 2, 3]);\n * // => [1, 2]\n */\n function initial(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 0, -1) : [];\n }\n\n /**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\n var intersection = baseRest(function(arrays) {\n var mapped = arrayMap(arrays, castArrayLikeObject);\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped)\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `iteratee`\n * which is invoked for each element of each `arrays` to generate the criterion\n * by which they're compared. The order and references of result values are\n * determined by the first array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [2.1]\n *\n * // The `_.property` iteratee shorthand.\n * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }]\n */\n var intersectionBy = baseRest(function(arrays) {\n var iteratee = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n if (iteratee === last(mapped)) {\n iteratee = undefined;\n } else {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, getIteratee(iteratee, 2))\n : [];\n });\n\n /**\n * This method is like `_.intersection` except that it accepts `comparator`\n * which is invoked to compare elements of `arrays`. The order and references\n * of result values are determined by the first array. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.intersectionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }]\n */\n var intersectionWith = baseRest(function(arrays) {\n var comparator = last(arrays),\n mapped = arrayMap(arrays, castArrayLikeObject);\n\n comparator = typeof comparator == 'function' ? comparator : undefined;\n if (comparator) {\n mapped.pop();\n }\n return (mapped.length && mapped[0] === arrays[0])\n ? baseIntersection(mapped, undefined, comparator)\n : [];\n });\n\n /**\n * Converts all elements in `array` into a string separated by `separator`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to convert.\n * @param {string} [separator=','] The element separator.\n * @returns {string} Returns the joined string.\n * @example\n *\n * _.join(['a', 'b', 'c'], '~');\n * // => 'a~b~c'\n */\n function join(array, separator) {\n return array == null ? '' : nativeJoin.call(array, separator);\n }\n\n /**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\n function last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n }\n\n /**\n * This method is like `_.indexOf` except that it iterates over elements of\n * `array` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=array.length-1] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.lastIndexOf([1, 2, 1, 2], 2);\n * // => 3\n *\n * // Search from the `fromIndex`.\n * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n * // => 1\n */\n function lastIndexOf(array, value, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return -1;\n }\n var index = length;\n if (fromIndex !== undefined) {\n index = toInteger(fromIndex);\n index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n }\n return value === value\n ? strictLastIndexOf(array, value, index)\n : baseFindIndex(array, baseIsNaN, index, true);\n }\n\n /**\n * Gets the element at index `n` of `array`. If `n` is negative, the nth\n * element from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.11.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=0] The index of the element to return.\n * @returns {*} Returns the nth element of `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n *\n * _.nth(array, 1);\n * // => 'b'\n *\n * _.nth(array, -2);\n * // => 'c';\n */\n function nth(array, n) {\n return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n }\n\n /**\n * Removes all given values from `array` using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n * to remove elements from an array by predicate.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...*} [values] The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pull(array, 'a', 'c');\n * console.log(array);\n * // => ['b', 'b']\n */\n var pull = baseRest(pullAll);\n\n /**\n * This method is like `_.pull` except that it accepts an array of values to remove.\n *\n * **Note:** Unlike `_.difference`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n *\n * _.pullAll(array, ['a', 'c']);\n * console.log(array);\n * // => ['b', 'b']\n */\n function pullAll(array, values) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values)\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `iteratee` which is\n * invoked for each element of `array` and `values` to generate the criterion\n * by which they're compared. The iteratee is invoked with one argument: (value).\n *\n * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n *\n * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n * console.log(array);\n * // => [{ 'x': 2 }]\n */\n function pullAllBy(array, values, iteratee) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, getIteratee(iteratee, 2))\n : array;\n }\n\n /**\n * This method is like `_.pullAll` except that it accepts `comparator` which\n * is invoked to compare elements of `array` to `values`. The comparator is\n * invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Array} values The values to remove.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n *\n * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n * console.log(array);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n */\n function pullAllWith(array, values, comparator) {\n return (array && array.length && values && values.length)\n ? basePullAll(array, values, undefined, comparator)\n : array;\n }\n\n /**\n * Removes elements from `array` corresponding to `indexes` and returns an\n * array of removed elements.\n *\n * **Note:** Unlike `_.at`, this method mutates `array`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = ['a', 'b', 'c', 'd'];\n * var pulled = _.pullAt(array, [1, 3]);\n *\n * console.log(array);\n * // => ['a', 'c']\n *\n * console.log(pulled);\n * // => ['b', 'd']\n */\n var pullAt = flatRest(function(array, indexes) {\n var length = array == null ? 0 : array.length,\n result = baseAt(array, indexes);\n\n basePullAt(array, arrayMap(indexes, function(index) {\n return isIndex(index, length) ? +index : index;\n }).sort(compareAscending));\n\n return result;\n });\n\n /**\n * Removes all elements from `array` that `predicate` returns truthy for\n * and returns an array of the removed elements. The predicate is invoked\n * with three arguments: (value, index, array).\n *\n * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n * to pull elements from an array by value.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new array of removed elements.\n * @example\n *\n * var array = [1, 2, 3, 4];\n * var evens = _.remove(array, function(n) {\n * return n % 2 == 0;\n * });\n *\n * console.log(array);\n * // => [1, 3]\n *\n * console.log(evens);\n * // => [2, 4]\n */\n function remove(array, predicate) {\n var result = [];\n if (!(array && array.length)) {\n return result;\n }\n var index = -1,\n indexes = [],\n length = array.length;\n\n predicate = getIteratee(predicate, 3);\n while (++index < length) {\n var value = array[index];\n if (predicate(value, index, array)) {\n result.push(value);\n indexes.push(index);\n }\n }\n basePullAt(array, indexes);\n return result;\n }\n\n /**\n * Reverses `array` so that the first element becomes the last, the second\n * element becomes the second to last, and so on.\n *\n * **Note:** This method mutates `array` and is based on\n * [`Array#reverse`](https://mdn.io/Array/reverse).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to modify.\n * @returns {Array} Returns `array`.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _.reverse(array);\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function reverse(array) {\n return array == null ? array : nativeReverse.call(array);\n }\n\n /**\n * Creates a slice of `array` from `start` up to, but not including, `end`.\n *\n * **Note:** This method is used instead of\n * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n * returned.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\n function slice(array, start, end) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n start = 0;\n end = length;\n }\n else {\n start = start == null ? 0 : toInteger(start);\n end = end === undefined ? length : toInteger(end);\n }\n return baseSlice(array, start, end);\n }\n\n /**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\n function sortedIndex(array, value) {\n return baseSortedIndex(array, value);\n }\n\n /**\n * This method is like `_.sortedIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n * // => 0\n */\n function sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n }\n\n /**\n * This method is like `_.indexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n * // => 1\n */\n function sortedIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value);\n if (index < length && eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.sortedIndex` except that it returns the highest\n * index at which `value` should be inserted into `array` in order to\n * maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n * // => 4\n */\n function sortedLastIndex(array, value) {\n return baseSortedIndex(array, value, true);\n }\n\n /**\n * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n * which is invoked for `value` and each element of `array` to compute their\n * sort ranking. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the index at which `value` should be inserted\n * into `array`.\n * @example\n *\n * var objects = [{ 'x': 4 }, { 'x': 5 }];\n *\n * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n * // => 1\n *\n * // The `_.property` iteratee shorthand.\n * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n * // => 1\n */\n function sortedLastIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n }\n\n /**\n * This method is like `_.lastIndexOf` except that it performs a binary\n * search on a sorted `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n * // => 3\n */\n function sortedLastIndexOf(array, value) {\n var length = array == null ? 0 : array.length;\n if (length) {\n var index = baseSortedIndex(array, value, true) - 1;\n if (eq(array[index], value)) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * This method is like `_.uniq` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniq([1, 1, 2]);\n * // => [1, 2]\n */\n function sortedUniq(array) {\n return (array && array.length)\n ? baseSortedUniq(array)\n : [];\n }\n\n /**\n * This method is like `_.uniqBy` except that it's designed and optimized\n * for sorted arrays.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n * // => [1.1, 2.3]\n */\n function sortedUniqBy(array, iteratee) {\n return (array && array.length)\n ? baseSortedUniq(array, getIteratee(iteratee, 2))\n : [];\n }\n\n /**\n * Gets all but the first element of `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.tail([1, 2, 3]);\n * // => [2, 3]\n */\n function tail(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseSlice(array, 1, length) : [];\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the beginning.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.take([1, 2, 3]);\n * // => [1]\n *\n * _.take([1, 2, 3], 2);\n * // => [1, 2]\n *\n * _.take([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.take([1, 2, 3], 0);\n * // => []\n */\n function take(array, n, guard) {\n if (!(array && array.length)) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n return baseSlice(array, 0, n < 0 ? 0 : n);\n }\n\n /**\n * Creates a slice of `array` with `n` elements taken from the end.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {number} [n=1] The number of elements to take.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * _.takeRight([1, 2, 3]);\n * // => [3]\n *\n * _.takeRight([1, 2, 3], 2);\n * // => [2, 3]\n *\n * _.takeRight([1, 2, 3], 5);\n * // => [1, 2, 3]\n *\n * _.takeRight([1, 2, 3], 0);\n * // => []\n */\n function takeRight(array, n, guard) {\n var length = array == null ? 0 : array.length;\n if (!length) {\n return [];\n }\n n = (guard || n === undefined) ? 1 : toInteger(n);\n n = length - n;\n return baseSlice(array, n < 0 ? 0 : n, length);\n }\n\n /**\n * Creates a slice of `array` with elements taken from the end. Elements are\n * taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': false }\n * ];\n *\n * _.takeRightWhile(users, function(o) { return !o.active; });\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n * // => objects for ['pebbles']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeRightWhile(users, ['active', false]);\n * // => objects for ['fred', 'pebbles']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeRightWhile(users, 'active');\n * // => []\n */\n function takeRightWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3), false, true)\n : [];\n }\n\n /**\n * Creates a slice of `array` with elements taken from the beginning. Elements\n * are taken until `predicate` returns falsey. The predicate is invoked with\n * three arguments: (value, index, array).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Array\n * @param {Array} array The array to query.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the slice of `array`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'active': false },\n * { 'user': 'fred', 'active': false },\n * { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.takeWhile(users, function(o) { return !o.active; });\n * // => objects for ['barney', 'fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.takeWhile(users, { 'user': 'barney', 'active': false });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.takeWhile(users, ['active', false]);\n * // => objects for ['barney', 'fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.takeWhile(users, 'active');\n * // => []\n */\n function takeWhile(array, predicate) {\n return (array && array.length)\n ? baseWhile(array, getIteratee(predicate, 3))\n : [];\n }\n\n /**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\n var union = baseRest(function(arrays) {\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n });\n\n /**\n * This method is like `_.union` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which uniqueness is computed. Result values are chosen from the first\n * array in which the value occurs. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n var unionBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.union` except that it accepts `comparator` which\n * is invoked to compare elements of `arrays`. Result values are chosen from\n * the first array in which the value occurs. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.unionWith(objects, others, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var unionWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n });\n\n /**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\n function uniq(array) {\n return (array && array.length) ? baseUniq(array) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * uniqueness is computed. The order of result values is determined by the\n * order they occur in the array. The iteratee is invoked with one argument:\n * (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n * // => [2.1, 1.2]\n *\n * // The `_.property` iteratee shorthand.\n * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 1 }, { 'x': 2 }]\n */\n function uniqBy(array, iteratee) {\n return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n }\n\n /**\n * This method is like `_.uniq` except that it accepts `comparator` which\n * is invoked to compare elements of `array`. The order of result values is\n * determined by the order they occur in the array.The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.uniqWith(objects, _.isEqual);\n * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n */\n function uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n }\n\n /**\n * This method is like `_.zip` except that it accepts an array of grouped\n * elements and creates an array regrouping the elements to their pre-zip\n * configuration.\n *\n * @static\n * @memberOf _\n * @since 1.2.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n *\n * _.unzip(zipped);\n * // => [['a', 'b'], [1, 2], [true, false]]\n */\n function unzip(array) {\n if (!(array && array.length)) {\n return [];\n }\n var length = 0;\n array = arrayFilter(array, function(group) {\n if (isArrayLikeObject(group)) {\n length = nativeMax(group.length, length);\n return true;\n }\n });\n return baseTimes(length, function(index) {\n return arrayMap(array, baseProperty(index));\n });\n }\n\n /**\n * This method is like `_.unzip` except that it accepts `iteratee` to specify\n * how regrouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {Array} array The array of grouped elements to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * regrouped values.\n * @returns {Array} Returns the new array of regrouped elements.\n * @example\n *\n * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n * // => [[1, 10, 100], [2, 20, 200]]\n *\n * _.unzipWith(zipped, _.add);\n * // => [3, 30, 300]\n */\n function unzipWith(array, iteratee) {\n if (!(array && array.length)) {\n return [];\n }\n var result = unzip(array);\n if (iteratee == null) {\n return result;\n }\n return arrayMap(result, function(group) {\n return apply(iteratee, undefined, group);\n });\n }\n\n /**\n * Creates an array excluding all given values using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * **Note:** Unlike `_.pull`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...*} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.xor\n * @example\n *\n * _.without([2, 1, 2, 3], 1, 2);\n * // => [3]\n */\n var without = baseRest(function(array, values) {\n return isArrayLikeObject(array)\n ? baseDifference(array, values)\n : [];\n });\n\n /**\n * Creates an array of unique values that is the\n * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n * of the given arrays. The order of result values is determined by the order\n * they occur in the arrays.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.difference, _.without\n * @example\n *\n * _.xor([2, 1], [2, 3]);\n * // => [1, 3]\n */\n var xor = baseRest(function(arrays) {\n return baseXor(arrayFilter(arrays, isArrayLikeObject));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `iteratee` which is\n * invoked for each element of each `arrays` to generate the criterion by\n * which by which they're compared. The order of result values is determined\n * by the order they occur in the arrays. The iteratee is invoked with one\n * argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n * // => [1.2, 3.4]\n *\n * // The `_.property` iteratee shorthand.\n * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n * // => [{ 'x': 2 }]\n */\n var xorBy = baseRest(function(arrays) {\n var iteratee = last(arrays);\n if (isArrayLikeObject(iteratee)) {\n iteratee = undefined;\n }\n return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n });\n\n /**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\n var xorWith = baseRest(function(arrays) {\n var comparator = last(arrays);\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n });\n\n /**\n * Creates an array of grouped elements, the first of which contains the\n * first elements of the given arrays, the second of which contains the\n * second elements of the given arrays, and so on.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zip(['a', 'b'], [1, 2], [true, false]);\n * // => [['a', 1, true], ['b', 2, false]]\n */\n var zip = baseRest(unzip);\n\n /**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\n function zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n }\n\n /**\n * This method is like `_.zipObject` except that it supports property paths.\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n */\n function zipObjectDeep(props, values) {\n return baseZipObject(props || [], values || [], baseSet);\n }\n\n /**\n * This method is like `_.zip` except that it accepts `iteratee` to specify\n * how grouped values should be combined. The iteratee is invoked with the\n * elements of each group: (...group).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Array\n * @param {...Array} [arrays] The arrays to process.\n * @param {Function} [iteratee=_.identity] The function to combine\n * grouped values.\n * @returns {Array} Returns the new array of grouped elements.\n * @example\n *\n * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n * return a + b + c;\n * });\n * // => [111, 222]\n */\n var zipWith = baseRest(function(arrays) {\n var length = arrays.length,\n iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n return unzipWith(arrays, iteratee);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n * chain sequences enabled. The result of such sequences must be unwrapped\n * with `_#value`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Seq\n * @param {*} value The value to wrap.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'pebbles', 'age': 1 }\n * ];\n *\n * var youngest = _\n * .chain(users)\n * .sortBy('age')\n * .map(function(o) {\n * return o.user + ' is ' + o.age;\n * })\n * .head()\n * .value();\n * // => 'pebbles is 1'\n */\n function chain(value) {\n var result = lodash(value);\n result.__chain__ = true;\n return result;\n }\n\n /**\n * This method invokes `interceptor` and returns `value`. The interceptor\n * is invoked with one argument; (value). The purpose of this method is to\n * \"tap into\" a method chain sequence in order to modify intermediate results.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns `value`.\n * @example\n *\n * _([1, 2, 3])\n * .tap(function(array) {\n * // Mutate input array.\n * array.pop();\n * })\n * .reverse()\n * .value();\n * // => [2, 1]\n */\n function tap(value, interceptor) {\n interceptor(value);\n return value;\n }\n\n /**\n * This method is like `_.tap` except that it returns the result of `interceptor`.\n * The purpose of this method is to \"pass thru\" values replacing intermediate\n * results in a method chain sequence.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Seq\n * @param {*} value The value to provide to `interceptor`.\n * @param {Function} interceptor The function to invoke.\n * @returns {*} Returns the result of `interceptor`.\n * @example\n *\n * _(' abc ')\n * .chain()\n * .trim()\n * .thru(function(value) {\n * return [value];\n * })\n * .value();\n * // => ['abc']\n */\n function thru(value, interceptor) {\n return interceptor(value);\n }\n\n /**\n * This method is the wrapper version of `_.at`.\n *\n * @name at\n * @memberOf _\n * @since 1.0.0\n * @category Seq\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _(object).at(['a[0].b.c', 'a[1]']).value();\n * // => [3, 4]\n */\n var wrapperAt = flatRest(function(paths) {\n var length = paths.length,\n start = length ? paths[0] : 0,\n value = this.__wrapped__,\n interceptor = function(object) { return baseAt(object, paths); };\n\n if (length > 1 || this.__actions__.length ||\n !(value instanceof LazyWrapper) || !isIndex(start)) {\n return this.thru(interceptor);\n }\n value = value.slice(start, +start + (length ? 1 : 0));\n value.__actions__.push({\n 'func': thru,\n 'args': [interceptor],\n 'thisArg': undefined\n });\n return new LodashWrapper(value, this.__chain__).thru(function(array) {\n if (length && !array.length) {\n array.push(undefined);\n }\n return array;\n });\n });\n\n /**\n * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n *\n * @name chain\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 40 }\n * ];\n *\n * // A sequence without explicit chaining.\n * _(users).head();\n * // => { 'user': 'barney', 'age': 36 }\n *\n * // A sequence with explicit chaining.\n * _(users)\n * .chain()\n * .head()\n * .pick('user')\n * .value();\n * // => { 'user': 'barney' }\n */\n function wrapperChain() {\n return chain(this);\n }\n\n /**\n * Executes the chain sequence and returns the wrapped result.\n *\n * @name commit\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2];\n * var wrapped = _(array).push(3);\n *\n * console.log(array);\n * // => [1, 2]\n *\n * wrapped = wrapped.commit();\n * console.log(array);\n * // => [1, 2, 3]\n *\n * wrapped.last();\n * // => 3\n *\n * console.log(array);\n * // => [1, 2, 3]\n */\n function wrapperCommit() {\n return new LodashWrapper(this.value(), this.__chain__);\n }\n\n /**\n * Gets the next value on a wrapped object following the\n * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n *\n * @name next\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the next iterator value.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 1 }\n *\n * wrapped.next();\n * // => { 'done': false, 'value': 2 }\n *\n * wrapped.next();\n * // => { 'done': true, 'value': undefined }\n */\n function wrapperNext() {\n if (this.__values__ === undefined) {\n this.__values__ = toArray(this.value());\n }\n var done = this.__index__ >= this.__values__.length,\n value = done ? undefined : this.__values__[this.__index__++];\n\n return { 'done': done, 'value': value };\n }\n\n /**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\n function wrapperToIterator() {\n return this;\n }\n\n /**\n * Creates a clone of the chain sequence planting `value` as the wrapped value.\n *\n * @name plant\n * @memberOf _\n * @since 3.2.0\n * @category Seq\n * @param {*} value The value to plant.\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var wrapped = _([1, 2]).map(square);\n * var other = wrapped.plant([3, 4]);\n *\n * other.value();\n * // => [9, 16]\n *\n * wrapped.value();\n * // => [1, 4]\n */\n function wrapperPlant(value) {\n var result,\n parent = this;\n\n while (parent instanceof baseLodash) {\n var clone = wrapperClone(parent);\n clone.__index__ = 0;\n clone.__values__ = undefined;\n if (result) {\n previous.__wrapped__ = clone;\n } else {\n result = clone;\n }\n var previous = clone;\n parent = parent.__wrapped__;\n }\n previous.__wrapped__ = value;\n return result;\n }\n\n /**\n * This method is the wrapper version of `_.reverse`.\n *\n * **Note:** This method mutates the wrapped array.\n *\n * @name reverse\n * @memberOf _\n * @since 0.1.0\n * @category Seq\n * @returns {Object} Returns the new `lodash` wrapper instance.\n * @example\n *\n * var array = [1, 2, 3];\n *\n * _(array).reverse().value()\n * // => [3, 2, 1]\n *\n * console.log(array);\n * // => [3, 2, 1]\n */\n function wrapperReverse() {\n var value = this.__wrapped__;\n if (value instanceof LazyWrapper) {\n var wrapped = value;\n if (this.__actions__.length) {\n wrapped = new LazyWrapper(this);\n }\n wrapped = wrapped.reverse();\n wrapped.__actions__.push({\n 'func': thru,\n 'args': [reverse],\n 'thisArg': undefined\n });\n return new LodashWrapper(wrapped, this.__chain__);\n }\n return this.thru(reverse);\n }\n\n /**\n * Executes the chain sequence to resolve the unwrapped value.\n *\n * @name value\n * @memberOf _\n * @since 0.1.0\n * @alias toJSON, valueOf\n * @category Seq\n * @returns {*} Returns the resolved unwrapped value.\n * @example\n *\n * _([1, 2, 3]).value();\n * // => [1, 2, 3]\n */\n function wrapperValue() {\n return baseWrapperValue(this.__wrapped__, this.__actions__);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the number of times the key was returned by `iteratee`. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.countBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': 1, '6': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.countBy(['one', 'two', 'three'], 'length');\n * // => { '3': 2, '5': 1 }\n */\n var countBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n ++result[key];\n } else {\n baseAssignValue(result, key, 1);\n }\n });\n\n /**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n * else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\n function every(collection, predicate, guard) {\n var func = isArray(collection) ? arrayEvery : baseEvery;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\n function filter(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false },\n * { 'user': 'pebbles', 'age': 1, 'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\n var find = createFind(findIndex);\n\n /**\n * This method is like `_.find` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=collection.length-1] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * _.findLast([1, 2, 3, 4], function(n) {\n * return n % 2 == 1;\n * });\n * // => 3\n */\n var findLast = createFind(findLastIndex);\n\n /**\n * Creates a flattened array of values by running each element in `collection`\n * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n * with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [n, n];\n * }\n *\n * _.flatMap([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMap(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), 1);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDeep([1, 2], duplicate);\n * // => [1, 1, 2, 2]\n */\n function flatMapDeep(collection, iteratee) {\n return baseFlatten(map(collection, iteratee), INFINITY);\n }\n\n /**\n * This method is like `_.flatMap` except that it recursively flattens the\n * mapped results up to `depth` times.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {number} [depth=1] The maximum recursion depth.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * function duplicate(n) {\n * return [[[n, n]]];\n * }\n *\n * _.flatMapDepth([1, 2], duplicate, 2);\n * // => [[1, 1], [2, 2]]\n */\n function flatMapDepth(collection, iteratee, depth) {\n depth = depth === undefined ? 1 : toInteger(depth);\n return baseFlatten(map(collection, iteratee), depth);\n }\n\n /**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forEach(collection, iteratee) {\n var func = isArray(collection) ? arrayEach : baseEach;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forEach` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @alias eachRight\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEach\n * @example\n *\n * _.forEachRight([1, 2], function(value) {\n * console.log(value);\n * });\n * // => Logs `2` then `1`.\n */\n function forEachRight(collection, iteratee) {\n var func = isArray(collection) ? arrayEachRight : baseEachRight;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The order of grouped values\n * is determined by the order they occur in `collection`. The corresponding\n * value of each key is an array of elements responsible for generating the\n * key. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n * // => { '4': [4.2], '6': [6.1, 6.3] }\n *\n * // The `_.property` iteratee shorthand.\n * _.groupBy(['one', 'two', 'three'], 'length');\n * // => { '3': ['one', 'two'], '5': ['three'] }\n */\n var groupBy = createAggregator(function(result, value, key) {\n if (hasOwnProperty.call(result, key)) {\n result[key].push(value);\n } else {\n baseAssignValue(result, key, [value]);\n }\n });\n\n /**\n * Checks if `value` is in `collection`. If `collection` is a string, it's\n * checked for a substring of `value`, otherwise\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * is used for equality comparisons. If `fromIndex` is negative, it's used as\n * the offset from the end of `collection`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {boolean} Returns `true` if `value` is found, else `false`.\n * @example\n *\n * _.includes([1, 2, 3], 1);\n * // => true\n *\n * _.includes([1, 2, 3], 1, 2);\n * // => false\n *\n * _.includes({ 'a': 1, 'b': 2 }, 1);\n * // => true\n *\n * _.includes('abcd', 'bc');\n * // => true\n */\n function includes(collection, value, fromIndex, guard) {\n collection = isArrayLike(collection) ? collection : values(collection);\n fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n var length = collection.length;\n if (fromIndex < 0) {\n fromIndex = nativeMax(length + fromIndex, 0);\n }\n return isString(collection)\n ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n }\n\n /**\n * Invokes the method at `path` of each element in `collection`, returning\n * an array of the results of each invoked method. Any additional arguments\n * are provided to each invoked method. If `path` is a function, it's invoked\n * for, and `this` bound to, each element in `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array|Function|string} path The path of the method to invoke or\n * the function invoked per iteration.\n * @param {...*} [args] The arguments to invoke each method with.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n * // => [[1, 5, 7], [1, 2, 3]]\n *\n * _.invokeMap([123, 456], String.prototype.split, '');\n * // => [['1', '2', '3'], ['4', '5', '6']]\n */\n var invokeMap = baseRest(function(collection, path, args) {\n var index = -1,\n isFunc = typeof path == 'function',\n result = isArrayLike(collection) ? Array(collection.length) : [];\n\n baseEach(collection, function(value) {\n result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n });\n return result;\n });\n\n /**\n * Creates an object composed of keys generated from the results of running\n * each element of `collection` thru `iteratee`. The corresponding value of\n * each key is the last element responsible for generating the key. The\n * iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n * @returns {Object} Returns the composed aggregate object.\n * @example\n *\n * var array = [\n * { 'dir': 'left', 'code': 97 },\n * { 'dir': 'right', 'code': 100 }\n * ];\n *\n * _.keyBy(array, function(o) {\n * return String.fromCharCode(o.code);\n * });\n * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n *\n * _.keyBy(array, 'dir');\n * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n */\n var keyBy = createAggregator(function(result, value, key) {\n baseAssignValue(result, key, value);\n });\n\n /**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n * { 'user': 'barney' },\n * { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\n function map(collection, iteratee) {\n var func = isArray(collection) ? arrayMap : baseMap;\n return func(collection, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.sortBy` except that it allows specifying the sort\n * orders of the iteratees to sort by. If `orders` is unspecified, all values\n * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n * descending or \"asc\" for ascending sort order of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @param {string[]} [orders] The sort orders of `iteratees`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 34 },\n * { 'user': 'fred', 'age': 40 },\n * { 'user': 'barney', 'age': 36 }\n * ];\n *\n * // Sort by `user` in ascending order and by `age` in descending order.\n * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n */\n function orderBy(collection, iteratees, orders, guard) {\n if (collection == null) {\n return [];\n }\n if (!isArray(iteratees)) {\n iteratees = iteratees == null ? [] : [iteratees];\n }\n orders = guard ? undefined : orders;\n if (!isArray(orders)) {\n orders = orders == null ? [] : [orders];\n }\n return baseOrderBy(collection, iteratees, orders);\n }\n\n /**\n * Creates an array of elements split into two groups, the first of which\n * contains elements `predicate` returns truthy for, the second of which\n * contains elements `predicate` returns falsey for. The predicate is\n * invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of grouped elements.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true },\n * { 'user': 'pebbles', 'age': 1, 'active': false }\n * ];\n *\n * _.partition(users, function(o) { return o.active; });\n * // => objects for [['fred'], ['barney', 'pebbles']]\n *\n * // The `_.matches` iteratee shorthand.\n * _.partition(users, { 'age': 1, 'active': false });\n * // => objects for [['pebbles'], ['barney', 'fred']]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.partition(users, ['active', false]);\n * // => objects for [['barney', 'pebbles'], ['fred']]\n *\n * // The `_.property` iteratee shorthand.\n * _.partition(users, 'active');\n * // => objects for [['fred'], ['barney', 'pebbles']]\n */\n var partition = createAggregator(function(result, value, key) {\n result[key ? 0 : 1].push(value);\n }, function() { return [[], []]; });\n\n /**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n * return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\n function reduce(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduce : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n }\n\n /**\n * This method is like `_.reduce` except that it iterates over elements of\n * `collection` from right to left.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduce\n * @example\n *\n * var array = [[0, 1], [2, 3], [4, 5]];\n *\n * _.reduceRight(array, function(flattened, other) {\n * return flattened.concat(other);\n * }, []);\n * // => [4, 5, 2, 3, 0, 1]\n */\n function reduceRight(collection, iteratee, accumulator) {\n var func = isArray(collection) ? arrayReduceRight : baseReduce,\n initAccum = arguments.length < 3;\n\n return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n }\n\n /**\n * The opposite of `_.filter`; this method returns the elements of `collection`\n * that `predicate` does **not** return truthy for.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.filter\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': false },\n * { 'user': 'fred', 'age': 40, 'active': true }\n * ];\n *\n * _.reject(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.reject(users, { 'age': 40, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.reject(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.reject(users, 'active');\n * // => objects for ['barney']\n */\n function reject(collection, predicate) {\n var func = isArray(collection) ? arrayFilter : baseFilter;\n return func(collection, negate(getIteratee(predicate, 3)));\n }\n\n /**\n * Gets a random element from `collection`.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @returns {*} Returns the random element.\n * @example\n *\n * _.sample([1, 2, 3, 4]);\n * // => 2\n */\n function sample(collection) {\n var func = isArray(collection) ? arraySample : baseSample;\n return func(collection);\n }\n\n /**\n * Gets `n` random elements at unique keys from `collection` up to the\n * size of `collection`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Collection\n * @param {Array|Object} collection The collection to sample.\n * @param {number} [n=1] The number of elements to sample.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the random elements.\n * @example\n *\n * _.sampleSize([1, 2, 3], 2);\n * // => [3, 1]\n *\n * _.sampleSize([1, 2, 3], 4);\n * // => [2, 3, 1]\n */\n function sampleSize(collection, n, guard) {\n if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n return func(collection, n);\n }\n\n /**\n * Creates an array of shuffled values, using a version of the\n * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to shuffle.\n * @returns {Array} Returns the new shuffled array.\n * @example\n *\n * _.shuffle([1, 2, 3, 4]);\n * // => [4, 1, 3, 2]\n */\n function shuffle(collection) {\n var func = isArray(collection) ? arrayShuffle : baseShuffle;\n return func(collection);\n }\n\n /**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\n function size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n }\n\n /**\n * Checks if `predicate` returns truthy for **any** element of `collection`.\n * Iteration is stopped once `predicate` returns truthy. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n * else `false`.\n * @example\n *\n * _.some([null, 0, 'yes', false], Boolean);\n * // => true\n *\n * var users = [\n * { 'user': 'barney', 'active': true },\n * { 'user': 'fred', 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.some(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.some(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.some(users, 'active');\n * // => true\n */\n function some(collection, predicate, guard) {\n var func = isArray(collection) ? arraySome : baseSome;\n if (guard && isIterateeCall(collection, predicate, guard)) {\n predicate = undefined;\n }\n return func(collection, getIteratee(predicate, 3));\n }\n\n /**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n * { 'user': 'fred', 'age': 48 },\n * { 'user': 'barney', 'age': 36 },\n * { 'user': 'fred', 'age': 30 },\n * { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\n var sortBy = baseRest(function(collection, iteratees) {\n if (collection == null) {\n return [];\n }\n var length = iteratees.length;\n if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n iteratees = [];\n } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n iteratees = [iteratees[0]];\n }\n return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n * console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\n var now = ctxNow || function() {\n return root.Date.now();\n };\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The opposite of `_.before`; this method creates a function that invokes\n * `func` once it's called `n` or more times.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {number} n The number of calls before `func` is invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var saves = ['profile', 'settings'];\n *\n * var done = _.after(saves.length, function() {\n * console.log('done saving!');\n * });\n *\n * _.forEach(saves, function(type) {\n * asyncSave({ 'type': type, 'complete': done });\n * });\n * // => Logs 'done saving!' after the two async saves have completed.\n */\n function after(n, func) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n < 1) {\n return func.apply(this, arguments);\n }\n };\n }\n\n /**\n * Creates a function that invokes `func`, with up to `n` arguments,\n * ignoring any additional arguments.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @param {number} [n=func.length] The arity cap.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n * // => [6, 8, 10]\n */\n function ary(func, n, guard) {\n n = guard ? undefined : n;\n n = (func && n == null) ? func.length : n;\n return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n }\n\n /**\n * Creates a function that invokes `func`, with the `this` binding and arguments\n * of the created function, while it's called less than `n` times. Subsequent\n * calls to the created function return the result of the last `func` invocation.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {number} n The number of calls at which `func` is no longer invoked.\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * jQuery(element).on('click', _.before(5, addContactToList));\n * // => Allows adding up to 4 contacts to the list.\n */\n function before(n, func) {\n var result;\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n n = toInteger(n);\n return function() {\n if (--n > 0) {\n result = func.apply(this, arguments);\n }\n if (n <= 1) {\n func = undefined;\n }\n return result;\n };\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of `thisArg`\n * and `partials` prepended to the arguments it receives.\n *\n * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for partially applied arguments.\n *\n * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n * property of bound functions.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to bind.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * function greet(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n *\n * var object = { 'user': 'fred' };\n *\n * var bound = _.bind(greet, object, 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bind(greet, object, _, '!');\n * bound('hi');\n * // => 'hi fred!'\n */\n var bind = baseRest(function(func, thisArg, partials) {\n var bitmask = WRAP_BIND_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bind));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(func, bitmask, thisArg, partials, holders);\n });\n\n /**\n * Creates a function that invokes the method at `object[key]` with `partials`\n * prepended to the arguments it receives.\n *\n * This method differs from `_.bind` by allowing bound functions to reference\n * methods that may be redefined or don't yet exist. See\n * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n * for more details.\n *\n * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Function\n * @param {Object} object The object to invoke the method on.\n * @param {string} key The key of the method.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new bound function.\n * @example\n *\n * var object = {\n * 'user': 'fred',\n * 'greet': function(greeting, punctuation) {\n * return greeting + ' ' + this.user + punctuation;\n * }\n * };\n *\n * var bound = _.bindKey(object, 'greet', 'hi');\n * bound('!');\n * // => 'hi fred!'\n *\n * object.greet = function(greeting, punctuation) {\n * return greeting + 'ya ' + this.user + punctuation;\n * };\n *\n * bound('!');\n * // => 'hiya fred!'\n *\n * // Bound with placeholders.\n * var bound = _.bindKey(object, 'greet', _, '!');\n * bound('hi');\n * // => 'hiya fred!'\n */\n var bindKey = baseRest(function(object, key, partials) {\n var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n if (partials.length) {\n var holders = replaceHolders(partials, getHolder(bindKey));\n bitmask |= WRAP_PARTIAL_FLAG;\n }\n return createWrap(key, bitmask, object, partials, holders);\n });\n\n /**\n * Creates a function that accepts arguments of `func` and either invokes\n * `func` returning its result, if at least `arity` number of arguments have\n * been provided, or returns a function that accepts the remaining `func`\n * arguments, and so on. The arity of `func` may be specified if `func.length`\n * is not sufficient.\n *\n * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n * may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curry(abc);\n *\n * curried(1)(2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2)(3);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(1)(_, 3)(2);\n * // => [1, 2, 3]\n */\n function curry(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curry.placeholder;\n return result;\n }\n\n /**\n * This method is like `_.curry` except that arguments are applied to `func`\n * in the manner of `_.partialRight` instead of `_.partial`.\n *\n * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for provided arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of curried functions.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to curry.\n * @param {number} [arity=func.length] The arity of `func`.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the new curried function.\n * @example\n *\n * var abc = function(a, b, c) {\n * return [a, b, c];\n * };\n *\n * var curried = _.curryRight(abc);\n *\n * curried(3)(2)(1);\n * // => [1, 2, 3]\n *\n * curried(2, 3)(1);\n * // => [1, 2, 3]\n *\n * curried(1, 2, 3);\n * // => [1, 2, 3]\n *\n * // Curried with placeholders.\n * curried(3)(1, _)(2);\n * // => [1, 2, 3]\n */\n function curryRight(func, arity, guard) {\n arity = guard ? undefined : arity;\n var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n result.placeholder = curryRight.placeholder;\n return result;\n }\n\n /**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n * Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n * The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n * 'leading': true,\n * 'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\n function debounce(func, wait, options) {\n var lastArgs,\n lastThis,\n maxWait,\n result,\n timerId,\n lastCallTime,\n lastInvokeTime = 0,\n leading = false,\n maxing = false,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n wait = toNumber(wait) || 0;\n if (isObject(options)) {\n leading = !!options.leading;\n maxing = 'maxWait' in options;\n maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n\n function invokeFunc(time) {\n var args = lastArgs,\n thisArg = lastThis;\n\n lastArgs = lastThis = undefined;\n lastInvokeTime = time;\n result = func.apply(thisArg, args);\n return result;\n }\n\n function leadingEdge(time) {\n // Reset any `maxWait` timer.\n lastInvokeTime = time;\n // Start the timer for the trailing edge.\n timerId = setTimeout(timerExpired, wait);\n // Invoke the leading edge.\n return leading ? invokeFunc(time) : result;\n }\n\n function remainingWait(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime,\n timeWaiting = wait - timeSinceLastCall;\n\n return maxing\n ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n : timeWaiting;\n }\n\n function shouldInvoke(time) {\n var timeSinceLastCall = time - lastCallTime,\n timeSinceLastInvoke = time - lastInvokeTime;\n\n // Either this is the first call, activity has stopped and we're at the\n // trailing edge, the system time has gone backwards and we're treating\n // it as the trailing edge, or we've hit the `maxWait` limit.\n return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n }\n\n function timerExpired() {\n var time = now();\n if (shouldInvoke(time)) {\n return trailingEdge(time);\n }\n // Restart the timer.\n timerId = setTimeout(timerExpired, remainingWait(time));\n }\n\n function trailingEdge(time) {\n timerId = undefined;\n\n // Only invoke if we have `lastArgs` which means `func` has been\n // debounced at least once.\n if (trailing && lastArgs) {\n return invokeFunc(time);\n }\n lastArgs = lastThis = undefined;\n return result;\n }\n\n function cancel() {\n if (timerId !== undefined) {\n clearTimeout(timerId);\n }\n lastInvokeTime = 0;\n lastArgs = lastCallTime = lastThis = timerId = undefined;\n }\n\n function flush() {\n return timerId === undefined ? result : trailingEdge(now());\n }\n\n function debounced() {\n var time = now(),\n isInvoking = shouldInvoke(time);\n\n lastArgs = arguments;\n lastThis = this;\n lastCallTime = time;\n\n if (isInvoking) {\n if (timerId === undefined) {\n return leadingEdge(lastCallTime);\n }\n if (maxing) {\n // Handle invocations in a tight loop.\n clearTimeout(timerId);\n timerId = setTimeout(timerExpired, wait);\n return invokeFunc(lastCallTime);\n }\n }\n if (timerId === undefined) {\n timerId = setTimeout(timerExpired, wait);\n }\n return result;\n }\n debounced.cancel = cancel;\n debounced.flush = flush;\n return debounced;\n }\n\n /**\n * Defers invoking the `func` until the current call stack has cleared. Any\n * additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to defer.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.defer(function(text) {\n * console.log(text);\n * }, 'deferred');\n * // => Logs 'deferred' after one millisecond.\n */\n var defer = baseRest(function(func, args) {\n return baseDelay(func, 1, args);\n });\n\n /**\n * Invokes `func` after `wait` milliseconds. Any additional arguments are\n * provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to delay.\n * @param {number} wait The number of milliseconds to delay invocation.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {number} Returns the timer id.\n * @example\n *\n * _.delay(function(text) {\n * console.log(text);\n * }, 1000, 'later');\n * // => Logs 'later' after one second.\n */\n var delay = baseRest(function(func, wait, args) {\n return baseDelay(func, toNumber(wait) || 0, args);\n });\n\n /**\n * Creates a function that invokes `func` with arguments reversed.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to flip arguments for.\n * @returns {Function} Returns the new flipped function.\n * @example\n *\n * var flipped = _.flip(function() {\n * return _.toArray(arguments);\n * });\n *\n * flipped('a', 'b', 'c', 'd');\n * // => ['d', 'c', 'b', 'a']\n */\n function flip(func) {\n return createWrap(func, WRAP_FLIP_FLAG);\n }\n\n /**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\n function memoize(func, resolver) {\n if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n var memoized = function() {\n var args = arguments,\n key = resolver ? resolver.apply(this, args) : args[0],\n cache = memoized.cache;\n\n if (cache.has(key)) {\n return cache.get(key);\n }\n var result = func.apply(this, args);\n memoized.cache = cache.set(key, result) || cache;\n return result;\n };\n memoized.cache = new (memoize.Cache || MapCache);\n return memoized;\n }\n\n // Expose `MapCache`.\n memoize.Cache = MapCache;\n\n /**\n * Creates a function that negates the result of the predicate `func`. The\n * `func` predicate is invoked with the `this` binding and arguments of the\n * created function.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} predicate The predicate to negate.\n * @returns {Function} Returns the new negated function.\n * @example\n *\n * function isEven(n) {\n * return n % 2 == 0;\n * }\n *\n * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n * // => [1, 3, 5]\n */\n function negate(predicate) {\n if (typeof predicate != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return function() {\n var args = arguments;\n switch (args.length) {\n case 0: return !predicate.call(this);\n case 1: return !predicate.call(this, args[0]);\n case 2: return !predicate.call(this, args[0], args[1]);\n case 3: return !predicate.call(this, args[0], args[1], args[2]);\n }\n return !predicate.apply(this, args);\n };\n }\n\n /**\n * Creates a function that is restricted to invoking `func` once. Repeat calls\n * to the function return the value of the first invocation. The `func` is\n * invoked with the `this` binding and arguments of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new restricted function.\n * @example\n *\n * var initialize = _.once(createApplication);\n * initialize();\n * initialize();\n * // => `createApplication` is invoked once\n */\n function once(func) {\n return before(2, func);\n }\n\n /**\n * Creates a function that invokes `func` with its arguments transformed.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Function\n * @param {Function} func The function to wrap.\n * @param {...(Function|Function[])} [transforms=[_.identity]]\n * The argument transforms.\n * @returns {Function} Returns the new function.\n * @example\n *\n * function doubled(n) {\n * return n * 2;\n * }\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var func = _.overArgs(function(x, y) {\n * return [x, y];\n * }, [square, doubled]);\n *\n * func(9, 3);\n * // => [81, 6]\n *\n * func(10, 5);\n * // => [100, 10]\n */\n var overArgs = castRest(function(func, transforms) {\n transforms = (transforms.length == 1 && isArray(transforms[0]))\n ? arrayMap(transforms[0], baseUnary(getIteratee()))\n : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n var funcsLength = transforms.length;\n return baseRest(function(args) {\n var index = -1,\n length = nativeMin(args.length, funcsLength);\n\n while (++index < length) {\n args[index] = transforms[index].call(this, args[index]);\n }\n return apply(func, this, args);\n });\n });\n\n /**\n * Creates a function that invokes `func` with `partials` prepended to the\n * arguments it receives. This method is like `_.bind` except it does **not**\n * alter the `this` binding.\n *\n * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 0.2.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var sayHelloTo = _.partial(greet, 'hello');\n * sayHelloTo('fred');\n * // => 'hello fred'\n *\n * // Partially applied with placeholders.\n * var greetFred = _.partial(greet, _, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n */\n var partial = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partial));\n return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n });\n\n /**\n * This method is like `_.partial` except that partially applied arguments\n * are appended to the arguments it receives.\n *\n * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n * builds, may be used as a placeholder for partially applied arguments.\n *\n * **Note:** This method doesn't set the \"length\" property of partially\n * applied functions.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Function\n * @param {Function} func The function to partially apply arguments to.\n * @param {...*} [partials] The arguments to be partially applied.\n * @returns {Function} Returns the new partially applied function.\n * @example\n *\n * function greet(greeting, name) {\n * return greeting + ' ' + name;\n * }\n *\n * var greetFred = _.partialRight(greet, 'fred');\n * greetFred('hi');\n * // => 'hi fred'\n *\n * // Partially applied with placeholders.\n * var sayHelloTo = _.partialRight(greet, 'hello', _);\n * sayHelloTo('fred');\n * // => 'hello fred'\n */\n var partialRight = baseRest(function(func, partials) {\n var holders = replaceHolders(partials, getHolder(partialRight));\n return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n });\n\n /**\n * Creates a function that invokes `func` with arguments arranged according\n * to the specified `indexes` where the argument value at the first index is\n * provided as the first argument, the argument value at the second index is\n * provided as the second argument, and so on.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Function\n * @param {Function} func The function to rearrange arguments for.\n * @param {...(number|number[])} indexes The arranged argument indexes.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var rearged = _.rearg(function(a, b, c) {\n * return [a, b, c];\n * }, [2, 0, 1]);\n *\n * rearged('b', 'c', 'a')\n * // => ['a', 'b', 'c']\n */\n var rearg = flatRest(function(func, indexes) {\n return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n });\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * created function and arguments from `start` and beyond provided as\n * an array.\n *\n * **Note:** This method is based on the\n * [rest parameter](https://mdn.io/rest_parameters).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.rest(function(what, names) {\n * return what + ' ' + _.initial(names).join(', ') +\n * (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n * });\n *\n * say('hello', 'fred', 'barney', 'pebbles');\n * // => 'hello fred, barney, & pebbles'\n */\n function rest(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start === undefined ? start : toInteger(start);\n return baseRest(func, start);\n }\n\n /**\n * Creates a function that invokes `func` with the `this` binding of the\n * create function and an array of arguments much like\n * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n *\n * **Note:** This method is based on the\n * [spread operator](https://mdn.io/spread_operator).\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Function\n * @param {Function} func The function to spread arguments over.\n * @param {number} [start=0] The start position of the spread.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var say = _.spread(function(who, what) {\n * return who + ' says ' + what;\n * });\n *\n * say(['fred', 'hello']);\n * // => 'fred says hello'\n *\n * var numbers = Promise.all([\n * Promise.resolve(40),\n * Promise.resolve(36)\n * ]);\n *\n * numbers.then(_.spread(function(x, y) {\n * return x + y;\n * }));\n * // => a Promise of 76\n */\n function spread(func, start) {\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n start = start == null ? 0 : nativeMax(toInteger(start), 0);\n return baseRest(function(args) {\n var array = args[start],\n otherArgs = castSlice(args, 0, start);\n\n if (array) {\n arrayPush(otherArgs, array);\n }\n return apply(func, this, otherArgs);\n });\n }\n\n /**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n * Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n * Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\n function throttle(func, wait, options) {\n var leading = true,\n trailing = true;\n\n if (typeof func != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n if (isObject(options)) {\n leading = 'leading' in options ? !!options.leading : leading;\n trailing = 'trailing' in options ? !!options.trailing : trailing;\n }\n return debounce(func, wait, {\n 'leading': leading,\n 'maxWait': wait,\n 'trailing': trailing\n });\n }\n\n /**\n * Creates a function that accepts up to one argument, ignoring any\n * additional arguments.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Function\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n * @example\n *\n * _.map(['6', '8', '10'], _.unary(parseInt));\n * // => [6, 8, 10]\n */\n function unary(func) {\n return ary(func, 1);\n }\n\n /**\n * Creates a function that provides `value` to `wrapper` as its first\n * argument. Any additional arguments provided to the function are appended\n * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n * binding of the created function.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {*} value The value to wrap.\n * @param {Function} [wrapper=identity] The wrapper function.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var p = _.wrap(_.escape, function(func, text) {\n * return '<p>' + func(text) + '</p>';\n * });\n *\n * p('fred, barney, & pebbles');\n * // => '<p>fred, barney, &amp; pebbles</p>'\n */\n function wrap(value, wrapper) {\n return partial(castFunction(wrapper), value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Casts `value` as an array if it's not one.\n *\n * @static\n * @memberOf _\n * @since 4.4.0\n * @category Lang\n * @param {*} value The value to inspect.\n * @returns {Array} Returns the cast array.\n * @example\n *\n * _.castArray(1);\n * // => [1]\n *\n * _.castArray({ 'a': 1 });\n * // => [{ 'a': 1 }]\n *\n * _.castArray('abc');\n * // => ['abc']\n *\n * _.castArray(null);\n * // => [null]\n *\n * _.castArray(undefined);\n * // => [undefined]\n *\n * _.castArray();\n * // => []\n *\n * var array = [1, 2, 3];\n * console.log(_.castArray(array) === array);\n * // => true\n */\n function castArray() {\n if (!arguments.length) {\n return [];\n }\n var value = arguments[0];\n return isArray(value) ? value : [value];\n }\n\n /**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\n function clone(value) {\n return baseClone(value, CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.clone` except that it accepts `customizer` which\n * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n * cloning is handled by the method instead. The `customizer` is invoked with\n * up to four arguments; (value [, index|key, object, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeepWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(false);\n * }\n * }\n *\n * var el = _.cloneWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 0\n */\n function cloneWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\n function cloneDeep(value) {\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n }\n\n /**\n * This method is like `_.cloneWith` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @param {Function} [customizer] The function to customize cloning.\n * @returns {*} Returns the deep cloned value.\n * @see _.cloneWith\n * @example\n *\n * function customizer(value) {\n * if (_.isElement(value)) {\n * return value.cloneNode(true);\n * }\n * }\n *\n * var el = _.cloneDeepWith(document.body, customizer);\n *\n * console.log(el === document.body);\n * // => false\n * console.log(el.nodeName);\n * // => 'BODY'\n * console.log(el.childNodes.length);\n * // => 20\n */\n function cloneDeepWith(value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n }\n\n /**\n * Checks if `object` conforms to `source` by invoking the predicate\n * properties of `source` with the corresponding property values of `object`.\n *\n * **Note:** This method is equivalent to `_.conforms` when `source` is\n * partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property predicates to conform to.\n * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n * // => true\n *\n * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n * // => false\n */\n function conformsTo(object, source) {\n return source == null || baseConformsTo(object, source, keys(source));\n }\n\n /**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\n function eq(value, other) {\n return value === other || (value !== value && other !== other);\n }\n\n /**\n * Checks if `value` is greater than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n * @see _.lt\n * @example\n *\n * _.gt(3, 1);\n * // => true\n *\n * _.gt(3, 3);\n * // => false\n *\n * _.gt(1, 3);\n * // => false\n */\n var gt = createRelationalOperation(baseGt);\n\n /**\n * Checks if `value` is greater than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than or equal to\n * `other`, else `false`.\n * @see _.lte\n * @example\n *\n * _.gte(3, 1);\n * // => true\n *\n * _.gte(3, 3);\n * // => true\n *\n * _.gte(1, 3);\n * // => false\n */\n var gte = createRelationalOperation(function(value, other) {\n return value >= other;\n });\n\n /**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n * else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\n var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n };\n\n /**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\n var isArray = Array.isArray;\n\n /**\n * Checks if `value` is classified as an `ArrayBuffer` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n * @example\n *\n * _.isArrayBuffer(new ArrayBuffer(2));\n * // => true\n *\n * _.isArrayBuffer(new Array(2));\n * // => false\n */\n var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n /**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\n function isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n }\n\n /**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n * else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\n function isArrayLikeObject(value) {\n return isObjectLike(value) && isArrayLike(value);\n }\n\n /**\n * Checks if `value` is classified as a boolean primitive or object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n * @example\n *\n * _.isBoolean(false);\n * // => true\n *\n * _.isBoolean(null);\n * // => false\n */\n function isBoolean(value) {\n return value === true || value === false ||\n (isObjectLike(value) && baseGetTag(value) == boolTag);\n }\n\n /**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\n var isBuffer = nativeIsBuffer || stubFalse;\n\n /**\n * Checks if `value` is classified as a `Date` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n * @example\n *\n * _.isDate(new Date);\n * // => true\n *\n * _.isDate('Mon April 23 2012');\n * // => false\n */\n var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n /**\n * Checks if `value` is likely a DOM element.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n * @example\n *\n * _.isElement(document.body);\n * // => true\n *\n * _.isElement('<body>');\n * // => false\n */\n function isElement(value) {\n return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n }\n\n /**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\n function isEmpty(value) {\n if (value == null) {\n return true;\n }\n if (isArrayLike(value) &&\n (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n return !value.length;\n }\n var tag = getTag(value);\n if (tag == mapTag || tag == setTag) {\n return !value.size;\n }\n if (isPrototype(value)) {\n return !baseKeys(value).length;\n }\n for (var key in value) {\n if (hasOwnProperty.call(value, key)) {\n return false;\n }\n }\n return true;\n }\n\n /**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\n function isEqual(value, other) {\n return baseIsEqual(value, other);\n }\n\n /**\n * This method is like `_.isEqual` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with up to\n * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n * if (isGreeting(objValue) && isGreeting(othValue)) {\n * return true;\n * }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * _.isEqualWith(array, other, customizer);\n * // => true\n */\n function isEqualWith(value, other, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n var result = customizer ? customizer(value, other) : undefined;\n return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n }\n\n /**\n * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n * `SyntaxError`, `TypeError`, or `URIError` object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n * @example\n *\n * _.isError(new Error);\n * // => true\n *\n * _.isError(Error);\n * // => false\n */\n function isError(value) {\n if (!isObjectLike(value)) {\n return false;\n }\n var tag = baseGetTag(value);\n return tag == errorTag || tag == domExcTag ||\n (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n }\n\n /**\n * Checks if `value` is a finite primitive number.\n *\n * **Note:** This method is based on\n * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n * @example\n *\n * _.isFinite(3);\n * // => true\n *\n * _.isFinite(Number.MIN_VALUE);\n * // => true\n *\n * _.isFinite(Infinity);\n * // => false\n *\n * _.isFinite('3');\n * // => false\n */\n function isFinite(value) {\n return typeof value == 'number' && nativeIsFinite(value);\n }\n\n /**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\n function isFunction(value) {\n if (!isObject(value)) {\n return false;\n }\n // The use of `Object#toString` avoids issues with the `typeof` operator\n // in Safari 9 which returns 'object' for typed arrays and other constructors.\n var tag = baseGetTag(value);\n return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n }\n\n /**\n * Checks if `value` is an integer.\n *\n * **Note:** This method is based on\n * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n * @example\n *\n * _.isInteger(3);\n * // => true\n *\n * _.isInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isInteger(Infinity);\n * // => false\n *\n * _.isInteger('3');\n * // => false\n */\n function isInteger(value) {\n return typeof value == 'number' && value == toInteger(value);\n }\n\n /**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\n function isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\n function isObject(value) {\n var type = typeof value;\n return value != null && (type == 'object' || type == 'function');\n }\n\n /**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\n function isObjectLike(value) {\n return value != null && typeof value == 'object';\n }\n\n /**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\n var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n /**\n * Performs a partial deep comparison between `object` and `source` to\n * determine if `object` contains equivalent property values.\n *\n * **Note:** This method is equivalent to `_.matches` when `source` is\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n *\n * _.isMatch(object, { 'b': 2 });\n * // => true\n *\n * _.isMatch(object, { 'b': 1 });\n * // => false\n */\n function isMatch(object, source) {\n return object === source || baseIsMatch(object, source, getMatchData(source));\n }\n\n /**\n * This method is like `_.isMatch` except that it accepts `customizer` which\n * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n * are handled by the method instead. The `customizer` is invoked with five\n * arguments: (objValue, srcValue, index|key, object, source).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n * @example\n *\n * function isGreeting(value) {\n * return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, srcValue) {\n * if (isGreeting(objValue) && isGreeting(srcValue)) {\n * return true;\n * }\n * }\n *\n * var object = { 'greeting': 'hello' };\n * var source = { 'greeting': 'hi' };\n *\n * _.isMatchWith(object, source, customizer);\n * // => true\n */\n function isMatchWith(object, source, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return baseIsMatch(object, source, getMatchData(source), customizer);\n }\n\n /**\n * Checks if `value` is `NaN`.\n *\n * **Note:** This method is based on\n * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n * `undefined` and other non-number values.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n * @example\n *\n * _.isNaN(NaN);\n * // => true\n *\n * _.isNaN(new Number(NaN));\n * // => true\n *\n * isNaN(undefined);\n * // => true\n *\n * _.isNaN(undefined);\n * // => false\n */\n function isNaN(value) {\n // An `NaN` primitive is the only value that is not equal to itself.\n // Perform the `toStringTag` check first to avoid errors with some\n // ActiveX objects in IE.\n return isNumber(value) && value != +value;\n }\n\n /**\n * Checks if `value` is a pristine native function.\n *\n * **Note:** This method can't reliably detect native functions in the presence\n * of the core-js package because core-js circumvents this kind of detection.\n * Despite multiple requests, the core-js maintainer has made it clear: any\n * attempt to fix the detection will be obstructed. As a result, we're left\n * with little choice but to throw an error. Unfortunately, this also affects\n * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n * which rely on core-js.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n * else `false`.\n * @example\n *\n * _.isNative(Array.prototype.push);\n * // => true\n *\n * _.isNative(_);\n * // => false\n */\n function isNative(value) {\n if (isMaskable(value)) {\n throw new Error(CORE_ERROR_TEXT);\n }\n return baseIsNative(value);\n }\n\n /**\n * Checks if `value` is `null`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n * @example\n *\n * _.isNull(null);\n * // => true\n *\n * _.isNull(void 0);\n * // => false\n */\n function isNull(value) {\n return value === null;\n }\n\n /**\n * Checks if `value` is `null` or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n * @example\n *\n * _.isNil(null);\n * // => true\n *\n * _.isNil(void 0);\n * // => true\n *\n * _.isNil(NaN);\n * // => false\n */\n function isNil(value) {\n return value == null;\n }\n\n /**\n * Checks if `value` is classified as a `Number` primitive or object.\n *\n * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n * classified as numbers, use the `_.isFinite` method.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n * @example\n *\n * _.isNumber(3);\n * // => true\n *\n * _.isNumber(Number.MIN_VALUE);\n * // => true\n *\n * _.isNumber(Infinity);\n * // => true\n *\n * _.isNumber('3');\n * // => false\n */\n function isNumber(value) {\n return typeof value == 'number' ||\n (isObjectLike(value) && baseGetTag(value) == numberTag);\n }\n\n /**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\n function isPlainObject(value) {\n if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n return false;\n }\n var proto = getPrototype(value);\n if (proto === null) {\n return true;\n }\n var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n funcToString.call(Ctor) == objectCtorString;\n }\n\n /**\n * Checks if `value` is classified as a `RegExp` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n * @example\n *\n * _.isRegExp(/abc/);\n * // => true\n *\n * _.isRegExp('/abc/');\n * // => false\n */\n var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n /**\n * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n * double precision number which isn't the result of a rounded unsafe integer.\n *\n * **Note:** This method is based on\n * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n * @example\n *\n * _.isSafeInteger(3);\n * // => true\n *\n * _.isSafeInteger(Number.MIN_VALUE);\n * // => false\n *\n * _.isSafeInteger(Infinity);\n * // => false\n *\n * _.isSafeInteger('3');\n * // => false\n */\n function isSafeInteger(value) {\n return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n }\n\n /**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\n var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n /**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\n function isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n }\n\n /**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\n function isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && baseGetTag(value) == symbolTag);\n }\n\n /**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\n var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n /**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\n function isUndefined(value) {\n return value === undefined;\n }\n\n /**\n * Checks if `value` is classified as a `WeakMap` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n * @example\n *\n * _.isWeakMap(new WeakMap);\n * // => true\n *\n * _.isWeakMap(new Map);\n * // => false\n */\n function isWeakMap(value) {\n return isObjectLike(value) && getTag(value) == weakMapTag;\n }\n\n /**\n * Checks if `value` is classified as a `WeakSet` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n * @example\n *\n * _.isWeakSet(new WeakSet);\n * // => true\n *\n * _.isWeakSet(new Set);\n * // => false\n */\n function isWeakSet(value) {\n return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n }\n\n /**\n * Checks if `value` is less than `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n * else `false`.\n * @see _.gt\n * @example\n *\n * _.lt(1, 3);\n * // => true\n *\n * _.lt(3, 3);\n * // => false\n *\n * _.lt(3, 1);\n * // => false\n */\n var lt = createRelationalOperation(baseLt);\n\n /**\n * Checks if `value` is less than or equal to `other`.\n *\n * @static\n * @memberOf _\n * @since 3.9.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than or equal to\n * `other`, else `false`.\n * @see _.gte\n * @example\n *\n * _.lte(1, 3);\n * // => true\n *\n * _.lte(3, 3);\n * // => true\n *\n * _.lte(3, 1);\n * // => false\n */\n var lte = createRelationalOperation(function(value, other) {\n return value <= other;\n });\n\n /**\n * Converts `value` to an array.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Array} Returns the converted array.\n * @example\n *\n * _.toArray({ 'a': 1, 'b': 2 });\n * // => [1, 2]\n *\n * _.toArray('abc');\n * // => ['a', 'b', 'c']\n *\n * _.toArray(1);\n * // => []\n *\n * _.toArray(null);\n * // => []\n */\n function toArray(value) {\n if (!value) {\n return [];\n }\n if (isArrayLike(value)) {\n return isString(value) ? stringToArray(value) : copyArray(value);\n }\n if (symIterator && value[symIterator]) {\n return iteratorToArray(value[symIterator]());\n }\n var tag = getTag(value),\n func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n return func(value);\n }\n\n /**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\n function toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n }\n\n /**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\n function toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n }\n\n /**\n * Converts `value` to an integer suitable for use as the length of an\n * array-like object.\n *\n * **Note:** This method is based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toLength(3.2);\n * // => 3\n *\n * _.toLength(Number.MIN_VALUE);\n * // => 0\n *\n * _.toLength(Infinity);\n * // => 4294967295\n *\n * _.toLength('3.2');\n * // => 3\n */\n function toLength(value) {\n return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n }\n\n /**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\n function toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = baseTrim(value);\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n }\n\n /**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\n function toPlainObject(value) {\n return copyObject(value, keysIn(value));\n }\n\n /**\n * Converts `value` to a safe integer. A safe integer can be compared and\n * represented correctly.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toSafeInteger(3.2);\n * // => 3\n *\n * _.toSafeInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toSafeInteger(Infinity);\n * // => 9007199254740991\n *\n * _.toSafeInteger('3.2');\n * // => 3\n */\n function toSafeInteger(value) {\n return value\n ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n : (value === 0 ? value : 0);\n }\n\n /**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\n function toString(value) {\n return value == null ? '' : baseToString(value);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Assigns own enumerable string keyed properties of source objects to the\n * destination object. Source objects are applied from left to right.\n * Subsequent sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object` and is loosely based on\n * [`Object.assign`](https://mdn.io/Object/assign).\n *\n * @static\n * @memberOf _\n * @since 0.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assignIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assign({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'c': 3 }\n */\n var assign = createAssigner(function(object, source) {\n if (isPrototype(source) || isArrayLike(source)) {\n copyObject(source, keys(source), object);\n return;\n }\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n assignValue(object, key, source[key]);\n }\n }\n });\n\n /**\n * This method is like `_.assign` except that it iterates over own and\n * inherited source properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extend\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.assign\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * }\n *\n * function Bar() {\n * this.c = 3;\n * }\n *\n * Foo.prototype.b = 2;\n * Bar.prototype.d = 4;\n *\n * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n */\n var assignIn = createAssigner(function(object, source) {\n copyObject(source, keysIn(source), object);\n });\n\n /**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keysIn(source), object, customizer);\n });\n\n /**\n * This method is like `_.assign` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignInWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n * return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n copyObject(source, keys(source), object, customizer);\n });\n\n /**\n * Creates an array of values corresponding to `paths` of `object`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Array} Returns the picked values.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n *\n * _.at(object, ['a[0].b.c', 'a[1]']);\n * // => [3, 4]\n */\n var at = flatRest(baseAt);\n\n /**\n * Creates an object that inherits from the `prototype` object. If a\n * `properties` object is given, its own enumerable string keyed properties\n * are assigned to the created object.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Object\n * @param {Object} prototype The object to inherit from.\n * @param {Object} [properties] The properties to assign to the object.\n * @returns {Object} Returns the new object.\n * @example\n *\n * function Shape() {\n * this.x = 0;\n * this.y = 0;\n * }\n *\n * function Circle() {\n * Shape.call(this);\n * }\n *\n * Circle.prototype = _.create(Shape.prototype, {\n * 'constructor': Circle\n * });\n *\n * var circle = new Circle;\n * circle instanceof Circle;\n * // => true\n *\n * circle instanceof Shape;\n * // => true\n */\n function create(prototype, properties) {\n var result = baseCreate(prototype);\n return properties == null ? result : baseAssign(result, properties);\n }\n\n /**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\n var defaults = baseRest(function(object, sources) {\n object = Object(object);\n\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n\n if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n length = 1;\n }\n\n while (++index < length) {\n var source = sources[index];\n var props = keysIn(source);\n var propsIndex = -1;\n var propsLength = props.length;\n\n while (++propsIndex < propsLength) {\n var key = props[propsIndex];\n var value = object[key];\n\n if (value === undefined ||\n (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n object[key] = source[key];\n }\n }\n }\n\n return object;\n });\n\n /**\n * This method is like `_.defaults` except that it recursively assigns\n * default properties.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaults\n * @example\n *\n * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n * // => { 'a': { 'b': 2, 'c': 3 } }\n */\n var defaultsDeep = baseRest(function(args) {\n args.push(undefined, customDefaultsMerge);\n return apply(mergeWith, undefined, args);\n });\n\n /**\n * This method is like `_.find` except that it returns the key of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findKey(users, function(o) { return o.age < 40; });\n * // => 'barney' (iteration order is not guaranteed)\n *\n * // The `_.matches` iteratee shorthand.\n * _.findKey(users, { 'age': 1, 'active': true });\n * // => 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findKey(users, 'active');\n * // => 'barney'\n */\n function findKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n }\n\n /**\n * This method is like `_.findKey` except that it iterates over elements of\n * a collection in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {string|undefined} Returns the key of the matched element,\n * else `undefined`.\n * @example\n *\n * var users = {\n * 'barney': { 'age': 36, 'active': true },\n * 'fred': { 'age': 40, 'active': false },\n * 'pebbles': { 'age': 1, 'active': true }\n * };\n *\n * _.findLastKey(users, function(o) { return o.age < 40; });\n * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.findLastKey(users, { 'age': 36, 'active': true });\n * // => 'barney'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findLastKey(users, ['active', false]);\n * // => 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.findLastKey(users, 'active');\n * // => 'pebbles'\n */\n function findLastKey(object, predicate) {\n return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n }\n\n /**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\n function forIn(object, iteratee) {\n return object == null\n ? object\n : baseFor(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * This method is like `_.forIn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forIn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forInRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n */\n function forInRight(object, iteratee) {\n return object == null\n ? object\n : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n }\n\n /**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\n function forOwn(object, iteratee) {\n return object && baseForOwn(object, getIteratee(iteratee, 3));\n }\n\n /**\n * This method is like `_.forOwn` except that it iterates over properties of\n * `object` in the opposite order.\n *\n * @static\n * @memberOf _\n * @since 2.0.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwn\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwnRight(new Foo, function(value, key) {\n * console.log(key);\n * });\n * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n */\n function forOwnRight(object, iteratee) {\n return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n }\n\n /**\n * Creates an array of function property names from own enumerable properties\n * of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functionsIn\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functions(new Foo);\n * // => ['a', 'b']\n */\n function functions(object) {\n return object == null ? [] : baseFunctions(object, keys(object));\n }\n\n /**\n * Creates an array of function property names from own and inherited\n * enumerable properties of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to inspect.\n * @returns {Array} Returns the function names.\n * @see _.functions\n * @example\n *\n * function Foo() {\n * this.a = _.constant('a');\n * this.b = _.constant('b');\n * }\n *\n * Foo.prototype.c = _.constant('c');\n *\n * _.functionsIn(new Foo);\n * // => ['a', 'b', 'c']\n */\n function functionsIn(object) {\n return object == null ? [] : baseFunctions(object, keysIn(object));\n }\n\n /**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\n function get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n }\n\n /**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\n function has(object, path) {\n return object != null && hasPath(object, path, baseHas);\n }\n\n /**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\n function hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n }\n\n /**\n * Creates an object composed of the inverted keys and values of `object`.\n * If `object` contains duplicate values, subsequent values overwrite\n * property assignments of previous values.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Object\n * @param {Object} object The object to invert.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invert(object);\n * // => { '1': 'c', '2': 'b' }\n */\n var invert = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n result[value] = key;\n }, constant(identity));\n\n /**\n * This method is like `_.invert` except that the inverted object is generated\n * from the results of running each element of `object` thru `iteratee`. The\n * corresponding inverted value of each inverted key is an array of keys\n * responsible for generating the inverted value. The iteratee is invoked\n * with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.1.0\n * @category Object\n * @param {Object} object The object to invert.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {Object} Returns the new inverted object.\n * @example\n *\n * var object = { 'a': 1, 'b': 2, 'c': 1 };\n *\n * _.invertBy(object);\n * // => { '1': ['a', 'c'], '2': ['b'] }\n *\n * _.invertBy(object, function(value) {\n * return 'group' + value;\n * });\n * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n */\n var invertBy = createInverter(function(result, value, key) {\n if (value != null &&\n typeof value.toString != 'function') {\n value = nativeObjectToString.call(value);\n }\n\n if (hasOwnProperty.call(result, value)) {\n result[value].push(key);\n } else {\n result[value] = [key];\n }\n }, getIteratee);\n\n /**\n * Invokes the method at `path` of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {*} Returns the result of the invoked method.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n *\n * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n * // => [2, 3]\n */\n var invoke = baseRest(baseInvoke);\n\n /**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\n function keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n }\n\n /**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\n function keysIn(object) {\n return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n }\n\n /**\n * The opposite of `_.mapValues`; this method creates an object with the\n * same values as `object` and keys generated by running each own enumerable\n * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n * with three arguments: (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 3.8.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapValues\n * @example\n *\n * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n * return key + value;\n * });\n * // => { 'a1': 1, 'b2': 2 }\n */\n function mapKeys(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, iteratee(value, key, object), value);\n });\n return result;\n }\n\n /**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\n function mapValues(object, iteratee) {\n var result = {};\n iteratee = getIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n }\n\n /**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n * 'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n * 'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\n var merge = createAssigner(function(object, source, srcIndex) {\n baseMerge(object, source, srcIndex);\n });\n\n /**\n * This method is like `_.merge` except that it accepts `customizer` which\n * is invoked to produce the merged values of the destination and source\n * properties. If `customizer` returns `undefined`, merging is handled by the\n * method instead. The `customizer` is invoked with six arguments:\n * (objValue, srcValue, key, object, source, stack).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} customizer The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * function customizer(objValue, srcValue) {\n * if (_.isArray(objValue)) {\n * return objValue.concat(srcValue);\n * }\n * }\n *\n * var object = { 'a': [1], 'b': [2] };\n * var other = { 'a': [3], 'b': [4] };\n *\n * _.mergeWith(object, other, customizer);\n * // => { 'a': [1, 3], 'b': [2, 4] }\n */\n var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n baseMerge(object, source, srcIndex, customizer);\n });\n\n /**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\n var omit = flatRest(function(object, paths) {\n var result = {};\n if (object == null) {\n return result;\n }\n var isDeep = false;\n paths = arrayMap(paths, function(path) {\n path = castPath(path, object);\n isDeep || (isDeep = path.length > 1);\n return path;\n });\n copyObject(object, getAllKeysIn(object), result);\n if (isDeep) {\n result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n }\n var length = paths.length;\n while (length--) {\n baseUnset(result, paths[length]);\n }\n return result;\n });\n\n /**\n * The opposite of `_.pickBy`; this method creates an object composed of\n * the own and inherited enumerable string keyed properties of `object` that\n * `predicate` doesn't return truthy for. The predicate is invoked with two\n * arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omitBy(object, _.isNumber);\n * // => { 'b': '2' }\n */\n function omitBy(object, predicate) {\n return pickBy(object, negate(getIteratee(predicate)));\n }\n\n /**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\n var pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n });\n\n /**\n * Creates an object composed of the `object` properties `predicate` returns\n * truthy for. The predicate is invoked with two arguments: (value, key).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The source object.\n * @param {Function} [predicate=_.identity] The function invoked per property.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pickBy(object, _.isNumber);\n * // => { 'a': 1, 'c': 3 }\n */\n function pickBy(object, predicate) {\n if (object == null) {\n return {};\n }\n var props = arrayMap(getAllKeysIn(object), function(prop) {\n return [prop];\n });\n predicate = getIteratee(predicate);\n return basePickBy(object, props, function(value, path) {\n return predicate(value, path[0]);\n });\n }\n\n /**\n * This method is like `_.get` except that if the resolved value is a\n * function it's invoked with the `this` binding of its parent object and\n * its result is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to resolve.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n *\n * _.result(object, 'a[0].b.c1');\n * // => 3\n *\n * _.result(object, 'a[0].b.c2');\n * // => 4\n *\n * _.result(object, 'a[0].b.c3', 'default');\n * // => 'default'\n *\n * _.result(object, 'a[0].b.c3', _.constant('default'));\n * // => 'default'\n */\n function result(object, path, defaultValue) {\n path = castPath(path, object);\n\n var index = -1,\n length = path.length;\n\n // Ensure the loop is entered when path is empty.\n if (!length) {\n length = 1;\n object = undefined;\n }\n while (++index < length) {\n var value = object == null ? undefined : object[toKey(path[index])];\n if (value === undefined) {\n index = length;\n value = defaultValue;\n }\n object = isFunction(value) ? value.call(object) : value;\n }\n return object;\n }\n\n /**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\n function set(object, path, value) {\n return object == null ? object : baseSet(object, path, value);\n }\n\n /**\n * This method is like `_.set` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.setWith(object, '[0][1]', 'a', Object);\n * // => { '0': { '1': 'a' } }\n */\n function setWith(object, path, value, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseSet(object, path, value, customizer);\n }\n\n /**\n * Creates an array of own enumerable string keyed-value pairs for `object`\n * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n * entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entries\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairs(new Foo);\n * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n */\n var toPairs = createToPairs(keys);\n\n /**\n * Creates an array of own and inherited enumerable string keyed-value pairs\n * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n * or set, its entries are returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias entriesIn\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the key-value pairs.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.toPairsIn(new Foo);\n * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n */\n var toPairsIn = createToPairs(keysIn);\n\n /**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\n function transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = getIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n }\n\n /**\n * Removes the property at `path` of `object`.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n * _.unset(object, 'a[0].b.c');\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n *\n * _.unset(object, ['a', '0', 'b', 'c']);\n * // => true\n *\n * console.log(object);\n * // => { 'a': [{ 'b': {} }] };\n */\n function unset(object, path) {\n return object == null ? true : baseUnset(object, path);\n }\n\n /**\n * This method is like `_.set` except that accepts `updater` to produce the\n * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n * is invoked with one argument: (value).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n * console.log(object.a[0].b.c);\n * // => 9\n *\n * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n * console.log(object.x[0].y.z);\n * // => 0\n */\n function update(object, path, updater) {\n return object == null ? object : baseUpdate(object, path, castFunction(updater));\n }\n\n /**\n * This method is like `_.update` except that it accepts `customizer` which is\n * invoked to produce the objects of `path`. If `customizer` returns `undefined`\n * path creation is handled by the method instead. The `customizer` is invoked\n * with three arguments: (nsValue, key, nsObject).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.6.0\n * @category Object\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {Function} updater The function to produce the updated value.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {};\n *\n * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n * // => { '0': { '1': 'a' } }\n */\n function updateWith(object, path, updater, customizer) {\n customizer = typeof customizer == 'function' ? customizer : undefined;\n return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n }\n\n /**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\n function values(object) {\n return object == null ? [] : baseValues(object, keys(object));\n }\n\n /**\n * Creates an array of the own and inherited enumerable string keyed property\n * values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n * this.a = 1;\n * this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.valuesIn(new Foo);\n * // => [1, 2, 3] (iteration order is not guaranteed)\n */\n function valuesIn(object) {\n return object == null ? [] : baseValues(object, keysIn(object));\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Clamps `number` within the inclusive `lower` and `upper` bounds.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Number\n * @param {number} number The number to clamp.\n * @param {number} [lower] The lower bound.\n * @param {number} upper The upper bound.\n * @returns {number} Returns the clamped number.\n * @example\n *\n * _.clamp(-10, -5, 5);\n * // => -5\n *\n * _.clamp(10, -5, 5);\n * // => 5\n */\n function clamp(number, lower, upper) {\n if (upper === undefined) {\n upper = lower;\n lower = undefined;\n }\n if (upper !== undefined) {\n upper = toNumber(upper);\n upper = upper === upper ? upper : 0;\n }\n if (lower !== undefined) {\n lower = toNumber(lower);\n lower = lower === lower ? lower : 0;\n }\n return baseClamp(toNumber(number), lower, upper);\n }\n\n /**\n * Checks if `n` is between `start` and up to, but not including, `end`. If\n * `end` is not specified, it's set to `start` with `start` then set to `0`.\n * If `start` is greater than `end` the params are swapped to support\n * negative ranges.\n *\n * @static\n * @memberOf _\n * @since 3.3.0\n * @category Number\n * @param {number} number The number to check.\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n * @see _.range, _.rangeRight\n * @example\n *\n * _.inRange(3, 2, 4);\n * // => true\n *\n * _.inRange(4, 8);\n * // => true\n *\n * _.inRange(4, 2);\n * // => false\n *\n * _.inRange(2, 2);\n * // => false\n *\n * _.inRange(1.2, 2);\n * // => true\n *\n * _.inRange(5.2, 4);\n * // => false\n *\n * _.inRange(-3, -2, -6);\n * // => true\n */\n function inRange(number, start, end) {\n start = toFinite(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else {\n end = toFinite(end);\n }\n number = toNumber(number);\n return baseInRange(number, start, end);\n }\n\n /**\n * Produces a random number between the inclusive `lower` and `upper` bounds.\n * If only one argument is provided a number between `0` and the given number\n * is returned. If `floating` is `true`, or either `lower` or `upper` are\n * floats, a floating-point number is returned instead of an integer.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @memberOf _\n * @since 0.7.0\n * @category Number\n * @param {number} [lower=0] The lower bound.\n * @param {number} [upper=1] The upper bound.\n * @param {boolean} [floating] Specify returning a floating-point number.\n * @returns {number} Returns the random number.\n * @example\n *\n * _.random(0, 5);\n * // => an integer between 0 and 5\n *\n * _.random(5);\n * // => also an integer between 0 and 5\n *\n * _.random(5, true);\n * // => a floating-point number between 0 and 5\n *\n * _.random(1.2, 5.2);\n * // => a floating-point number between 1.2 and 5.2\n */\n function random(lower, upper, floating) {\n if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n upper = floating = undefined;\n }\n if (floating === undefined) {\n if (typeof upper == 'boolean') {\n floating = upper;\n upper = undefined;\n }\n else if (typeof lower == 'boolean') {\n floating = lower;\n lower = undefined;\n }\n }\n if (lower === undefined && upper === undefined) {\n lower = 0;\n upper = 1;\n }\n else {\n lower = toFinite(lower);\n if (upper === undefined) {\n upper = lower;\n lower = 0;\n } else {\n upper = toFinite(upper);\n }\n }\n if (lower > upper) {\n var temp = lower;\n lower = upper;\n upper = temp;\n }\n if (floating || lower % 1 || upper % 1) {\n var rand = nativeRandom();\n return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n }\n return baseRandom(lower, upper);\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the camel cased string.\n * @example\n *\n * _.camelCase('Foo Bar');\n * // => 'fooBar'\n *\n * _.camelCase('--foo-bar--');\n * // => 'fooBar'\n *\n * _.camelCase('__FOO_BAR__');\n * // => 'fooBar'\n */\n var camelCase = createCompounder(function(result, word, index) {\n word = word.toLowerCase();\n return result + (index ? capitalize(word) : word);\n });\n\n /**\n * Converts the first character of `string` to upper case and the remaining\n * to lower case.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to capitalize.\n * @returns {string} Returns the capitalized string.\n * @example\n *\n * _.capitalize('FRED');\n * // => 'Fred'\n */\n function capitalize(string) {\n return upperFirst(toString(string).toLowerCase());\n }\n\n /**\n * Deburrs `string` by converting\n * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n * letters to basic Latin letters and removing\n * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to deburr.\n * @returns {string} Returns the deburred string.\n * @example\n *\n * _.deburr('d\u00E9j\u00E0 vu');\n * // => 'deja vu'\n */\n function deburr(string) {\n string = toString(string);\n return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n }\n\n /**\n * Checks if `string` ends with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=string.length] The position to search up to.\n * @returns {boolean} Returns `true` if `string` ends with `target`,\n * else `false`.\n * @example\n *\n * _.endsWith('abc', 'c');\n * // => true\n *\n * _.endsWith('abc', 'b');\n * // => false\n *\n * _.endsWith('abc', 'b', 2);\n * // => true\n */\n function endsWith(string, target, position) {\n string = toString(string);\n target = baseToString(target);\n\n var length = string.length;\n position = position === undefined\n ? length\n : baseClamp(toInteger(position), 0, length);\n\n var end = position;\n position -= target.length;\n return position >= 0 && string.slice(position, end) == target;\n }\n\n /**\n * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n * corresponding HTML entities.\n *\n * **Note:** No other characters are escaped. To escape additional\n * characters use a third-party library like [_he_](https://mths.be/he).\n *\n * Though the \">\" character is escaped for symmetry, characters like\n * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n * unless they're part of a tag or unquoted attribute value. See\n * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n * (under \"semi-related fun fact\") for more details.\n *\n * When working with HTML you should always\n * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n * XSS vectors.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escape('fred, barney, & pebbles');\n * // => 'fred, barney, &amp; pebbles'\n */\n function escape(string) {\n string = toString(string);\n return (string && reHasUnescapedHtml.test(string))\n ? string.replace(reUnescapedHtml, escapeHtmlChar)\n : string;\n }\n\n /**\n * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to escape.\n * @returns {string} Returns the escaped string.\n * @example\n *\n * _.escapeRegExp('[lodash](https://lodash.com/)');\n * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n */\n function escapeRegExp(string) {\n string = toString(string);\n return (string && reHasRegExpChar.test(string))\n ? string.replace(reRegExpChar, '\\\\$&')\n : string;\n }\n\n /**\n * Converts `string` to\n * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the kebab cased string.\n * @example\n *\n * _.kebabCase('Foo Bar');\n * // => 'foo-bar'\n *\n * _.kebabCase('fooBar');\n * // => 'foo-bar'\n *\n * _.kebabCase('__FOO_BAR__');\n * // => 'foo-bar'\n */\n var kebabCase = createCompounder(function(result, word, index) {\n return result + (index ? '-' : '') + word.toLowerCase();\n });\n\n /**\n * Converts `string`, as space separated words, to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.lowerCase('--Foo-Bar--');\n * // => 'foo bar'\n *\n * _.lowerCase('fooBar');\n * // => 'foo bar'\n *\n * _.lowerCase('__FOO_BAR__');\n * // => 'foo bar'\n */\n var lowerCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toLowerCase();\n });\n\n /**\n * Converts the first character of `string` to lower case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.lowerFirst('Fred');\n * // => 'fred'\n *\n * _.lowerFirst('FRED');\n * // => 'fRED'\n */\n var lowerFirst = createCaseFirst('toLowerCase');\n\n /**\n * Pads `string` on the left and right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.pad('abc', 8);\n * // => ' abc '\n *\n * _.pad('abc', 8, '_-');\n * // => '_-abc_-_'\n *\n * _.pad('abc', 3);\n * // => 'abc'\n */\n function pad(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n if (!length || strLength >= length) {\n return string;\n }\n var mid = (length - strLength) / 2;\n return (\n createPadding(nativeFloor(mid), chars) +\n string +\n createPadding(nativeCeil(mid), chars)\n );\n }\n\n /**\n * Pads `string` on the right side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padEnd('abc', 6);\n * // => 'abc '\n *\n * _.padEnd('abc', 6, '_-');\n * // => 'abc_-_'\n *\n * _.padEnd('abc', 3);\n * // => 'abc'\n */\n function padEnd(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (string + createPadding(length - strLength, chars))\n : string;\n }\n\n /**\n * Pads `string` on the left side if it's shorter than `length`. Padding\n * characters are truncated if they exceed `length`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * _.padStart('abc', 6);\n * // => ' abc'\n *\n * _.padStart('abc', 6, '_-');\n * // => '_-_abc'\n *\n * _.padStart('abc', 3);\n * // => 'abc'\n */\n function padStart(string, length, chars) {\n string = toString(string);\n length = toInteger(length);\n\n var strLength = length ? stringSize(string) : 0;\n return (length && strLength < length)\n ? (createPadding(length - strLength, chars) + string)\n : string;\n }\n\n /**\n * Converts `string` to an integer of the specified radix. If `radix` is\n * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n * hexadecimal, in which case a `radix` of `16` is used.\n *\n * **Note:** This method aligns with the\n * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category String\n * @param {string} string The string to convert.\n * @param {number} [radix=10] The radix to interpret `value` by.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.parseInt('08');\n * // => 8\n *\n * _.map(['6', '08', '10'], _.parseInt);\n * // => [6, 8, 10]\n */\n function parseInt(string, radix, guard) {\n if (guard || radix == null) {\n radix = 0;\n } else if (radix) {\n radix = +radix;\n }\n return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n }\n\n /**\n * Repeats the given string `n` times.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to repeat.\n * @param {number} [n=1] The number of times to repeat the string.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the repeated string.\n * @example\n *\n * _.repeat('*', 3);\n * // => '***'\n *\n * _.repeat('abc', 2);\n * // => 'abcabc'\n *\n * _.repeat('abc', 0);\n * // => ''\n */\n function repeat(string, n, guard) {\n if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n n = 1;\n } else {\n n = toInteger(n);\n }\n return baseRepeat(toString(string), n);\n }\n\n /**\n * Replaces matches for `pattern` in `string` with `replacement`.\n *\n * **Note:** This method is based on\n * [`String#replace`](https://mdn.io/String/replace).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to modify.\n * @param {RegExp|string} pattern The pattern to replace.\n * @param {Function|string} replacement The match replacement.\n * @returns {string} Returns the modified string.\n * @example\n *\n * _.replace('Hi Fred', 'Fred', 'Barney');\n * // => 'Hi Barney'\n */\n function replace() {\n var args = arguments,\n string = toString(args[0]);\n\n return args.length < 3 ? string : string.replace(args[1], args[2]);\n }\n\n /**\n * Converts `string` to\n * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the snake cased string.\n * @example\n *\n * _.snakeCase('Foo Bar');\n * // => 'foo_bar'\n *\n * _.snakeCase('fooBar');\n * // => 'foo_bar'\n *\n * _.snakeCase('--FOO-BAR--');\n * // => 'foo_bar'\n */\n var snakeCase = createCompounder(function(result, word, index) {\n return result + (index ? '_' : '') + word.toLowerCase();\n });\n\n /**\n * Splits `string` by `separator`.\n *\n * **Note:** This method is based on\n * [`String#split`](https://mdn.io/String/split).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to split.\n * @param {RegExp|string} separator The separator pattern to split by.\n * @param {number} [limit] The length to truncate results to.\n * @returns {Array} Returns the string segments.\n * @example\n *\n * _.split('a-b-c', '-', 2);\n * // => ['a', 'b']\n */\n function split(string, separator, limit) {\n if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n separator = limit = undefined;\n }\n limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n if (!limit) {\n return [];\n }\n string = toString(string);\n if (string && (\n typeof separator == 'string' ||\n (separator != null && !isRegExp(separator))\n )) {\n separator = baseToString(separator);\n if (!separator && hasUnicode(string)) {\n return castSlice(stringToArray(string), 0, limit);\n }\n }\n return string.split(separator, limit);\n }\n\n /**\n * Converts `string` to\n * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n *\n * @static\n * @memberOf _\n * @since 3.1.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the start cased string.\n * @example\n *\n * _.startCase('--foo-bar--');\n * // => 'Foo Bar'\n *\n * _.startCase('fooBar');\n * // => 'Foo Bar'\n *\n * _.startCase('__FOO_BAR__');\n * // => 'FOO BAR'\n */\n var startCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + upperFirst(word);\n });\n\n /**\n * Checks if `string` starts with the given target string.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {string} [target] The string to search for.\n * @param {number} [position=0] The position to search from.\n * @returns {boolean} Returns `true` if `string` starts with `target`,\n * else `false`.\n * @example\n *\n * _.startsWith('abc', 'a');\n * // => true\n *\n * _.startsWith('abc', 'b');\n * // => false\n *\n * _.startsWith('abc', 'b', 1);\n * // => true\n */\n function startsWith(string, target, position) {\n string = toString(string);\n position = position == null\n ? 0\n : baseClamp(toInteger(position), 0, string.length);\n\n target = baseToString(target);\n return string.slice(position, position + target.length) == target;\n }\n\n /**\n * Creates a compiled template function that can interpolate data properties\n * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n * properties may be accessed as free variables in the template. If a setting\n * object is given, it takes precedence over `_.templateSettings` values.\n *\n * **Note:** In the development build `_.template` utilizes\n * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n * for easier debugging.\n *\n * For more information on precompiling templates see\n * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n *\n * For more information on Chrome extension sandboxes see\n * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category String\n * @param {string} [string=''] The template string.\n * @param {Object} [options={}] The options object.\n * @param {RegExp} [options.escape=_.templateSettings.escape]\n * The HTML \"escape\" delimiter.\n * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n * The \"evaluate\" delimiter.\n * @param {Object} [options.imports=_.templateSettings.imports]\n * An object to import into the template as free variables.\n * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n * The \"interpolate\" delimiter.\n * @param {string} [options.sourceURL='lodash.templateSources[n]']\n * The sourceURL of the compiled template.\n * @param {string} [options.variable='obj']\n * The data object variable name.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Function} Returns the compiled template function.\n * @example\n *\n * // Use the \"interpolate\" delimiter to create a compiled template.\n * var compiled = _.template('hello <%= user %>!');\n * compiled({ 'user': 'fred' });\n * // => 'hello fred!'\n *\n * // Use the HTML \"escape\" delimiter to escape data property values.\n * var compiled = _.template('<b><%- value %></b>');\n * compiled({ 'value': '<script>' });\n * // => '<b>&lt;script&gt;</b>'\n *\n * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the internal `print` function in \"evaluate\" delimiters.\n * var compiled = _.template('<% print(\"hello \" + user); %>!');\n * compiled({ 'user': 'barney' });\n * // => 'hello barney!'\n *\n * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n * // Disable support by replacing the \"interpolate\" delimiter.\n * var compiled = _.template('hello ${ user }!');\n * compiled({ 'user': 'pebbles' });\n * // => 'hello pebbles!'\n *\n * // Use backslashes to treat delimiters as plain text.\n * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n * compiled({ 'value': 'ignored' });\n * // => '<%- value %>'\n *\n * // Use the `imports` option to import `jQuery` as `jq`.\n * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n * compiled({ 'users': ['fred', 'barney'] });\n * // => '<li>fred</li><li>barney</li>'\n *\n * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n * compiled(data);\n * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n *\n * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n * compiled.source;\n * // => function(data) {\n * // var __t, __p = '';\n * // __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n * // return __p;\n * // }\n *\n * // Use custom template delimiters.\n * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n * var compiled = _.template('hello {{ user }}!');\n * compiled({ 'user': 'mustache' });\n * // => 'hello mustache!'\n *\n * // Use the `source` property to inline compiled templates for meaningful\n * // line numbers in error messages and stack traces.\n * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n * var JST = {\\\n * \"main\": ' + _.template(mainText).source + '\\\n * };\\\n * ');\n */\n function template(string, options, guard) {\n // Based on John Resig's `tmpl` implementation\n // (http://ejohn.org/blog/javascript-micro-templating/)\n // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n var settings = lodash.templateSettings;\n\n if (guard && isIterateeCall(string, options, guard)) {\n options = undefined;\n }\n string = toString(string);\n options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n importsKeys = keys(imports),\n importsValues = baseValues(imports, importsKeys);\n\n var isEscaping,\n isEvaluating,\n index = 0,\n interpolate = options.interpolate || reNoMatch,\n source = \"__p += '\";\n\n // Compile the regexp to match each delimiter.\n var reDelimiters = RegExp(\n (options.escape || reNoMatch).source + '|' +\n interpolate.source + '|' +\n (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n (options.evaluate || reNoMatch).source + '|$'\n , 'g');\n\n // Use a sourceURL for easier debugging.\n // The sourceURL gets injected into the source that's eval-ed, so be careful\n // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n // and escape the comment, thus injecting code that gets evaled.\n var sourceURL = '//# sourceURL=' +\n (hasOwnProperty.call(options, 'sourceURL')\n ? (options.sourceURL + '').replace(/\\s/g, ' ')\n : ('lodash.templateSources[' + (++templateCounter) + ']')\n ) + '\\n';\n\n string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n interpolateValue || (interpolateValue = esTemplateValue);\n\n // Escape characters that can't be included in string literals.\n source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n // Replace delimiters with snippets.\n if (escapeValue) {\n isEscaping = true;\n source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n }\n if (evaluateValue) {\n isEvaluating = true;\n source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n }\n if (interpolateValue) {\n source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n }\n index = offset + match.length;\n\n // The JS engine embedded in Adobe products needs `match` returned in\n // order to produce the correct `offset` value.\n return match;\n });\n\n source += \"';\\n\";\n\n // If `variable` is not specified wrap a with-statement around the generated\n // code to add the data object to the top of the scope chain.\n var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n if (!variable) {\n source = 'with (obj) {\\n' + source + '\\n}\\n';\n }\n // Throw an error if a forbidden character was found in `variable`, to prevent\n // potential command injection attacks.\n else if (reForbiddenIdentifierChars.test(variable)) {\n throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n }\n\n // Cleanup code by stripping empty strings.\n source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n .replace(reEmptyStringMiddle, '$1')\n .replace(reEmptyStringTrailing, '$1;');\n\n // Frame code as the function body.\n source = 'function(' + (variable || 'obj') + ') {\\n' +\n (variable\n ? ''\n : 'obj || (obj = {});\\n'\n ) +\n \"var __t, __p = ''\" +\n (isEscaping\n ? ', __e = _.escape'\n : ''\n ) +\n (isEvaluating\n ? ', __j = Array.prototype.join;\\n' +\n \"function print() { __p += __j.call(arguments, '') }\\n\"\n : ';\\n'\n ) +\n source +\n 'return __p\\n}';\n\n var result = attempt(function() {\n return Function(importsKeys, sourceURL + 'return ' + source)\n .apply(undefined, importsValues);\n });\n\n // Provide the compiled function's source by its `toString` method or\n // the `source` property as a convenience for inlining compiled templates.\n result.source = source;\n if (isError(result)) {\n throw result;\n }\n return result;\n }\n\n /**\n * Converts `string`, as a whole, to lower case just like\n * [String#toLowerCase](https://mdn.io/toLowerCase).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the lower cased string.\n * @example\n *\n * _.toLower('--Foo-Bar--');\n * // => '--foo-bar--'\n *\n * _.toLower('fooBar');\n * // => 'foobar'\n *\n * _.toLower('__FOO_BAR__');\n * // => '__foo_bar__'\n */\n function toLower(value) {\n return toString(value).toLowerCase();\n }\n\n /**\n * Converts `string`, as a whole, to upper case just like\n * [String#toUpperCase](https://mdn.io/toUpperCase).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the upper cased string.\n * @example\n *\n * _.toUpper('--foo-bar--');\n * // => '--FOO-BAR--'\n *\n * _.toUpper('fooBar');\n * // => 'FOOBAR'\n *\n * _.toUpper('__foo_bar__');\n * // => '__FOO_BAR__'\n */\n function toUpper(value) {\n return toString(value).toUpperCase();\n }\n\n /**\n * Removes leading and trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trim(' abc ');\n * // => 'abc'\n *\n * _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n *\n * _.map([' foo ', ' bar '], _.trim);\n * // => ['foo', 'bar']\n */\n function trim(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return baseTrim(string);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n chrSymbols = stringToArray(chars),\n start = charsStartIndex(strSymbols, chrSymbols),\n end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n return castSlice(strSymbols, start, end).join('');\n }\n\n /**\n * Removes trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimEnd(' abc ');\n * // => ' abc'\n *\n * _.trimEnd('-_-abc-_-', '_-');\n * // => '-_-abc'\n */\n function trimEnd(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.slice(0, trimmedEndIndex(string) + 1);\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n return castSlice(strSymbols, 0, end).join('');\n }\n\n /**\n * Removes leading whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trimStart(' abc ');\n * // => 'abc '\n *\n * _.trimStart('-_-abc-_-', '_-');\n * // => 'abc-_-'\n */\n function trimStart(string, chars, guard) {\n string = toString(string);\n if (string && (guard || chars === undefined)) {\n return string.replace(reTrimStart, '');\n }\n if (!string || !(chars = baseToString(chars))) {\n return string;\n }\n var strSymbols = stringToArray(string),\n start = charsStartIndex(strSymbols, stringToArray(chars));\n\n return castSlice(strSymbols, start).join('');\n }\n\n /**\n * Truncates `string` if it's longer than the given maximum string length.\n * The last characters of the truncated string are replaced with the omission\n * string which defaults to \"...\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to truncate.\n * @param {Object} [options={}] The options object.\n * @param {number} [options.length=30] The maximum string length.\n * @param {string} [options.omission='...'] The string to indicate text is omitted.\n * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n * @returns {string} Returns the truncated string.\n * @example\n *\n * _.truncate('hi-diddly-ho there, neighborino');\n * // => 'hi-diddly-ho there, neighbo...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': ' '\n * });\n * // => 'hi-diddly-ho there,...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'length': 24,\n * 'separator': /,? +/\n * });\n * // => 'hi-diddly-ho there...'\n *\n * _.truncate('hi-diddly-ho there, neighborino', {\n * 'omission': ' [...]'\n * });\n * // => 'hi-diddly-ho there, neig [...]'\n */\n function truncate(string, options) {\n var length = DEFAULT_TRUNC_LENGTH,\n omission = DEFAULT_TRUNC_OMISSION;\n\n if (isObject(options)) {\n var separator = 'separator' in options ? options.separator : separator;\n length = 'length' in options ? toInteger(options.length) : length;\n omission = 'omission' in options ? baseToString(options.omission) : omission;\n }\n string = toString(string);\n\n var strLength = string.length;\n if (hasUnicode(string)) {\n var strSymbols = stringToArray(string);\n strLength = strSymbols.length;\n }\n if (length >= strLength) {\n return string;\n }\n var end = length - stringSize(omission);\n if (end < 1) {\n return omission;\n }\n var result = strSymbols\n ? castSlice(strSymbols, 0, end).join('')\n : string.slice(0, end);\n\n if (separator === undefined) {\n return result + omission;\n }\n if (strSymbols) {\n end += (result.length - end);\n }\n if (isRegExp(separator)) {\n if (string.slice(end).search(separator)) {\n var match,\n substring = result;\n\n if (!separator.global) {\n separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n }\n separator.lastIndex = 0;\n while ((match = separator.exec(substring))) {\n var newEnd = match.index;\n }\n result = result.slice(0, newEnd === undefined ? end : newEnd);\n }\n } else if (string.indexOf(baseToString(separator), end) != end) {\n var index = result.lastIndexOf(separator);\n if (index > -1) {\n result = result.slice(0, index);\n }\n }\n return result + omission;\n }\n\n /**\n * The inverse of `_.escape`; this method converts the HTML entities\n * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n * their corresponding characters.\n *\n * **Note:** No other HTML entities are unescaped. To unescape additional\n * HTML entities use a third-party library like [_he_](https://mths.be/he).\n *\n * @static\n * @memberOf _\n * @since 0.6.0\n * @category String\n * @param {string} [string=''] The string to unescape.\n * @returns {string} Returns the unescaped string.\n * @example\n *\n * _.unescape('fred, barney, &amp; pebbles');\n * // => 'fred, barney, & pebbles'\n */\n function unescape(string) {\n string = toString(string);\n return (string && reHasEscapedHtml.test(string))\n ? string.replace(reEscapedHtml, unescapeHtmlChar)\n : string;\n }\n\n /**\n * Converts `string`, as space separated words, to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the upper cased string.\n * @example\n *\n * _.upperCase('--foo-bar');\n * // => 'FOO BAR'\n *\n * _.upperCase('fooBar');\n * // => 'FOO BAR'\n *\n * _.upperCase('__foo_bar__');\n * // => 'FOO BAR'\n */\n var upperCase = createCompounder(function(result, word, index) {\n return result + (index ? ' ' : '') + word.toUpperCase();\n });\n\n /**\n * Converts the first character of `string` to upper case.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category String\n * @param {string} [string=''] The string to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.upperFirst('fred');\n * // => 'Fred'\n *\n * _.upperFirst('FRED');\n * // => 'FRED'\n */\n var upperFirst = createCaseFirst('toUpperCase');\n\n /**\n * Splits `string` into an array of its words.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to inspect.\n * @param {RegExp|string} [pattern] The pattern to match words.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {Array} Returns the words of `string`.\n * @example\n *\n * _.words('fred, barney, & pebbles');\n * // => ['fred', 'barney', 'pebbles']\n *\n * _.words('fred, barney, & pebbles', /[^, ]+/g);\n * // => ['fred', 'barney', '&', 'pebbles']\n */\n function words(string, pattern, guard) {\n string = toString(string);\n pattern = guard ? undefined : pattern;\n\n if (pattern === undefined) {\n return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n }\n return string.match(pattern) || [];\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Attempts to invoke `func`, returning either the result or the caught error\n * object. Any additional arguments are provided to `func` when it's invoked.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Function} func The function to attempt.\n * @param {...*} [args] The arguments to invoke `func` with.\n * @returns {*} Returns the `func` result or error object.\n * @example\n *\n * // Avoid throwing errors for invalid selectors.\n * var elements = _.attempt(function(selector) {\n * return document.querySelectorAll(selector);\n * }, '>_>');\n *\n * if (_.isError(elements)) {\n * elements = [];\n * }\n */\n var attempt = baseRest(function(func, args) {\n try {\n return apply(func, undefined, args);\n } catch (e) {\n return isError(e) ? e : new Error(e);\n }\n });\n\n /**\n * Binds methods of an object to the object itself, overwriting the existing\n * method.\n *\n * **Note:** This method doesn't set the \"length\" property of bound functions.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Object} object The object to bind and assign the bound methods to.\n * @param {...(string|string[])} methodNames The object method names to bind.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var view = {\n * 'label': 'docs',\n * 'click': function() {\n * console.log('clicked ' + this.label);\n * }\n * };\n *\n * _.bindAll(view, ['click']);\n * jQuery(element).on('click', view.click);\n * // => Logs 'clicked docs' when clicked.\n */\n var bindAll = flatRest(function(object, methodNames) {\n arrayEach(methodNames, function(key) {\n key = toKey(key);\n baseAssignValue(object, key, bind(object[key], object));\n });\n return object;\n });\n\n /**\n * Creates a function that iterates over `pairs` and invokes the corresponding\n * function of the first predicate to return truthy. The predicate-function\n * pairs are invoked with the `this` binding and arguments of the created\n * function.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Array} pairs The predicate-function pairs.\n * @returns {Function} Returns the new composite function.\n * @example\n *\n * var func = _.cond([\n * [_.matches({ 'a': 1 }), _.constant('matches A')],\n * [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n * [_.stubTrue, _.constant('no match')]\n * ]);\n *\n * func({ 'a': 1, 'b': 2 });\n * // => 'matches A'\n *\n * func({ 'a': 0, 'b': 1 });\n * // => 'matches B'\n *\n * func({ 'a': '1', 'b': '2' });\n * // => 'no match'\n */\n function cond(pairs) {\n var length = pairs == null ? 0 : pairs.length,\n toIteratee = getIteratee();\n\n pairs = !length ? [] : arrayMap(pairs, function(pair) {\n if (typeof pair[1] != 'function') {\n throw new TypeError(FUNC_ERROR_TEXT);\n }\n return [toIteratee(pair[0]), pair[1]];\n });\n\n return baseRest(function(args) {\n var index = -1;\n while (++index < length) {\n var pair = pairs[index];\n if (apply(pair[0], this, args)) {\n return apply(pair[1], this, args);\n }\n }\n });\n }\n\n /**\n * Creates a function that invokes the predicate properties of `source` with\n * the corresponding property values of a given object, returning `true` if\n * all predicates return truthy, else `false`.\n *\n * **Note:** The created function is equivalent to `_.conformsTo` with\n * `source` partially applied.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {Object} source The object of property predicates to conform to.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 2, 'b': 1 },\n * { 'a': 1, 'b': 2 }\n * ];\n *\n * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n * // => [{ 'a': 1, 'b': 2 }]\n */\n function conforms(source) {\n return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\n function constant(value) {\n return function() {\n return value;\n };\n }\n\n /**\n * Checks `value` to determine whether a default value should be returned in\n * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n * or `undefined`.\n *\n * @static\n * @memberOf _\n * @since 4.14.0\n * @category Util\n * @param {*} value The value to check.\n * @param {*} defaultValue The default value.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * _.defaultTo(1, 10);\n * // => 1\n *\n * _.defaultTo(undefined, 10);\n * // => 10\n */\n function defaultTo(value, defaultValue) {\n return (value == null || value !== value) ? defaultValue : value;\n }\n\n /**\n * Creates a function that returns the result of invoking the given functions\n * with the `this` binding of the created function, where each successive\n * invocation is supplied the return value of the previous.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flowRight\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flow([_.add, square]);\n * addSquare(1, 2);\n * // => 9\n */\n var flow = createFlow();\n\n /**\n * This method is like `_.flow` except that it creates a function that\n * invokes the given functions from right to left.\n *\n * @static\n * @since 3.0.0\n * @memberOf _\n * @category Util\n * @param {...(Function|Function[])} [funcs] The functions to invoke.\n * @returns {Function} Returns the new composite function.\n * @see _.flow\n * @example\n *\n * function square(n) {\n * return n * n;\n * }\n *\n * var addSquare = _.flowRight([square, _.add]);\n * addSquare(1, 2);\n * // => 9\n */\n var flowRight = createFlow(true);\n\n /**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\n function identity(value) {\n return value;\n }\n\n /**\n * Creates a function that invokes `func` with the arguments of the created\n * function. If `func` is a property name, the created function returns the\n * property value for a given element. If `func` is an array or object, the\n * created function returns `true` for elements that contain the equivalent\n * source properties, otherwise it returns `false`.\n *\n * @static\n * @since 4.0.0\n * @memberOf _\n * @category Util\n * @param {*} [func=_.identity] The value to convert to a callback.\n * @returns {Function} Returns the callback.\n * @example\n *\n * var users = [\n * { 'user': 'barney', 'age': 36, 'active': true },\n * { 'user': 'fred', 'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, _.iteratee(['user', 'fred']));\n * // => [{ 'user': 'fred', 'age': 40 }]\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, _.iteratee('user'));\n * // => ['barney', 'fred']\n *\n * // Create custom iteratee shorthands.\n * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n * return !_.isRegExp(func) ? iteratee(func) : function(string) {\n * return func.test(string);\n * };\n * });\n *\n * _.filter(['abc', 'def'], /ef/);\n * // => ['def']\n */\n function iteratee(func) {\n return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between a given\n * object and `source`, returning `true` if the given object has equivalent\n * property values, else `false`.\n *\n * **Note:** The created function is equivalent to `_.isMatch` with `source`\n * partially applied.\n *\n * Partial comparisons will match empty array and empty object `source`\n * values against any array or object value, respectively. See `_.isEqual`\n * for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matches(source) {\n return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that performs a partial deep comparison between the\n * value at `path` of a given object to `srcValue`, returning `true` if the\n * object value is equivalent, else `false`.\n *\n * **Note:** Partial comparisons will match empty array and empty object\n * `srcValue` values against any array or object value, respectively. See\n * `_.isEqual` for a list of supported value comparisons.\n *\n * **Note:** Multiple values can be checked by combining several matchers\n * using `_.overSome`\n *\n * @static\n * @memberOf _\n * @since 3.2.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n * @example\n *\n * var objects = [\n * { 'a': 1, 'b': 2, 'c': 3 },\n * { 'a': 4, 'b': 5, 'c': 6 }\n * ];\n *\n * _.find(objects, _.matchesProperty('a', 4));\n * // => { 'a': 4, 'b': 5, 'c': 6 }\n *\n * // Checking for several possible values\n * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n */\n function matchesProperty(path, srcValue) {\n return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n }\n\n /**\n * Creates a function that invokes the method at `path` of a given object.\n * Any additional arguments are provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Array|string} path The path of the method to invoke.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': _.constant(2) } },\n * { 'a': { 'b': _.constant(1) } }\n * ];\n *\n * _.map(objects, _.method('a.b'));\n * // => [2, 1]\n *\n * _.map(objects, _.method(['a', 'b']));\n * // => [2, 1]\n */\n var method = baseRest(function(path, args) {\n return function(object) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * The opposite of `_.method`; this method creates a function that invokes\n * the method at a given path of `object`. Any additional arguments are\n * provided to the invoked method.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Util\n * @param {Object} object The object to query.\n * @param {...*} [args] The arguments to invoke the method with.\n * @returns {Function} Returns the new invoker function.\n * @example\n *\n * var array = _.times(3, _.constant),\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n * // => [2, 0]\n */\n var methodOf = baseRest(function(object, args) {\n return function(path) {\n return baseInvoke(object, path, args);\n };\n });\n\n /**\n * Adds all own enumerable string keyed function properties of a source\n * object to the destination object. If `object` is a function, then methods\n * are added to its prototype as well.\n *\n * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n * avoid conflicts caused by modifying the original.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {Function|Object} [object=lodash] The destination object.\n * @param {Object} source The object of functions to add.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n * @returns {Function|Object} Returns `object`.\n * @example\n *\n * function vowels(string) {\n * return _.filter(string, function(v) {\n * return /[aeiou]/i.test(v);\n * });\n * }\n *\n * _.mixin({ 'vowels': vowels });\n * _.vowels('fred');\n * // => ['e']\n *\n * _('fred').vowels().value();\n * // => ['e']\n *\n * _.mixin({ 'vowels': vowels }, { 'chain': false });\n * _('fred').vowels();\n * // => ['e']\n */\n function mixin(object, source, options) {\n var props = keys(source),\n methodNames = baseFunctions(source, props);\n\n if (options == null &&\n !(isObject(source) && (methodNames.length || !props.length))) {\n options = source;\n source = object;\n object = this;\n methodNames = baseFunctions(source, keys(source));\n }\n var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n isFunc = isFunction(object);\n\n arrayEach(methodNames, function(methodName) {\n var func = source[methodName];\n object[methodName] = func;\n if (isFunc) {\n object.prototype[methodName] = function() {\n var chainAll = this.__chain__;\n if (chain || chainAll) {\n var result = object(this.__wrapped__),\n actions = result.__actions__ = copyArray(this.__actions__);\n\n actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n result.__chain__ = chainAll;\n return result;\n }\n return func.apply(object, arrayPush([this.value()], arguments));\n };\n }\n });\n\n return object;\n }\n\n /**\n * Reverts the `_` variable to its previous value and returns a reference to\n * the `lodash` function.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @returns {Function} Returns the `lodash` function.\n * @example\n *\n * var lodash = _.noConflict();\n */\n function noConflict() {\n if (root._ === this) {\n root._ = oldDash;\n }\n return this;\n }\n\n /**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\n function noop() {\n // No operation performed.\n }\n\n /**\n * Creates a function that gets the argument at index `n`. If `n` is negative,\n * the nth argument from the end is returned.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [n=0] The index of the argument to return.\n * @returns {Function} Returns the new pass-thru function.\n * @example\n *\n * var func = _.nthArg(1);\n * func('a', 'b', 'c', 'd');\n * // => 'b'\n *\n * var func = _.nthArg(-2);\n * func('a', 'b', 'c', 'd');\n * // => 'c'\n */\n function nthArg(n) {\n n = toInteger(n);\n return baseRest(function(args) {\n return baseNth(args, n);\n });\n }\n\n /**\n * Creates a function that invokes `iteratees` with the arguments it receives\n * and returns their results.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n * The iteratees to invoke.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.over([Math.max, Math.min]);\n *\n * func(1, 2, 3, 4);\n * // => [4, 1]\n */\n var over = createOver(arrayMap);\n\n /**\n * Creates a function that checks if **all** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overEvery([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => false\n *\n * func(NaN);\n * // => false\n */\n var overEvery = createOver(arrayEvery);\n\n /**\n * Creates a function that checks if **any** of the `predicates` return\n * truthy when invoked with the arguments it receives.\n *\n * Following shorthands are possible for providing predicates.\n * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {...(Function|Function[])} [predicates=[_.identity]]\n * The predicates to check.\n * @returns {Function} Returns the new function.\n * @example\n *\n * var func = _.overSome([Boolean, isFinite]);\n *\n * func('1');\n * // => true\n *\n * func(null);\n * // => true\n *\n * func(NaN);\n * // => false\n *\n * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n */\n var overSome = createOver(arraySome);\n\n /**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n * { 'a': { 'b': 2 } },\n * { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\n function property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n }\n\n /**\n * The opposite of `_.property`; this method creates a function that returns\n * the value at a given path of `object`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Util\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var array = [0, 1, 2],\n * object = { 'a': array, 'b': array, 'c': array };\n *\n * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n * // => [2, 0]\n *\n * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n * // => [2, 0]\n */\n function propertyOf(object) {\n return function(path) {\n return object == null ? undefined : baseGet(object, path);\n };\n }\n\n /**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\n var range = createRange();\n\n /**\n * This method is like `_.range` except that it populates values in\n * descending order.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.range\n * @example\n *\n * _.rangeRight(4);\n * // => [3, 2, 1, 0]\n *\n * _.rangeRight(-4);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 5);\n * // => [4, 3, 2, 1]\n *\n * _.rangeRight(0, 20, 5);\n * // => [15, 10, 5, 0]\n *\n * _.rangeRight(0, -4, -1);\n * // => [-3, -2, -1, 0]\n *\n * _.rangeRight(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.rangeRight(0);\n * // => []\n */\n var rangeRight = createRange(true);\n\n /**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\n function stubArray() {\n return [];\n }\n\n /**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\n function stubFalse() {\n return false;\n }\n\n /**\n * This method returns a new empty object.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Object} Returns the new empty object.\n * @example\n *\n * var objects = _.times(2, _.stubObject);\n *\n * console.log(objects);\n * // => [{}, {}]\n *\n * console.log(objects[0] === objects[1]);\n * // => false\n */\n function stubObject() {\n return {};\n }\n\n /**\n * This method returns an empty string.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {string} Returns the empty string.\n * @example\n *\n * _.times(2, _.stubString);\n * // => ['', '']\n */\n function stubString() {\n return '';\n }\n\n /**\n * This method returns `true`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `true`.\n * @example\n *\n * _.times(2, _.stubTrue);\n * // => [true, true]\n */\n function stubTrue() {\n return true;\n }\n\n /**\n * Invokes the iteratee `n` times, returning an array of the results of\n * each invocation. The iteratee is invoked with one argument; (index).\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n * @example\n *\n * _.times(3, String);\n * // => ['0', '1', '2']\n *\n * _.times(4, _.constant(0));\n * // => [0, 0, 0, 0]\n */\n function times(n, iteratee) {\n n = toInteger(n);\n if (n < 1 || n > MAX_SAFE_INTEGER) {\n return [];\n }\n var index = MAX_ARRAY_LENGTH,\n length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n iteratee = getIteratee(iteratee);\n n -= MAX_ARRAY_LENGTH;\n\n var result = baseTimes(length, iteratee);\n while (++index < n) {\n iteratee(index);\n }\n return result;\n }\n\n /**\n * Converts `value` to a property path array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {*} value The value to convert.\n * @returns {Array} Returns the new property path array.\n * @example\n *\n * _.toPath('a.b.c');\n * // => ['a', 'b', 'c']\n *\n * _.toPath('a[0].b.c');\n * // => ['a', '0', 'b', 'c']\n */\n function toPath(value) {\n if (isArray(value)) {\n return arrayMap(value, toKey);\n }\n return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n }\n\n /**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\n function uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n }\n\n /*------------------------------------------------------------------------*/\n\n /**\n * Adds two numbers.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {number} augend The first number in an addition.\n * @param {number} addend The second number in an addition.\n * @returns {number} Returns the total.\n * @example\n *\n * _.add(6, 4);\n * // => 10\n */\n var add = createMathOperation(function(augend, addend) {\n return augend + addend;\n }, 0);\n\n /**\n * Computes `number` rounded up to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round up.\n * @param {number} [precision=0] The precision to round up to.\n * @returns {number} Returns the rounded up number.\n * @example\n *\n * _.ceil(4.006);\n * // => 5\n *\n * _.ceil(6.004, 2);\n * // => 6.01\n *\n * _.ceil(6040, -2);\n * // => 6100\n */\n var ceil = createRound('ceil');\n\n /**\n * Divide two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} dividend The first number in a division.\n * @param {number} divisor The second number in a division.\n * @returns {number} Returns the quotient.\n * @example\n *\n * _.divide(6, 4);\n * // => 1.5\n */\n var divide = createMathOperation(function(dividend, divisor) {\n return dividend / divisor;\n }, 1);\n\n /**\n * Computes `number` rounded down to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round down.\n * @param {number} [precision=0] The precision to round down to.\n * @returns {number} Returns the rounded down number.\n * @example\n *\n * _.floor(4.006);\n * // => 4\n *\n * _.floor(0.046, 2);\n * // => 0.04\n *\n * _.floor(4060, -2);\n * // => 4000\n */\n var floor = createRound('floor');\n\n /**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\n function max(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseGt)\n : undefined;\n }\n\n /**\n * This method is like `_.max` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.maxBy(objects, function(o) { return o.n; });\n * // => { 'n': 2 }\n *\n * // The `_.property` iteratee shorthand.\n * _.maxBy(objects, 'n');\n * // => { 'n': 2 }\n */\n function maxBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n : undefined;\n }\n\n /**\n * Computes the mean of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the mean.\n * @example\n *\n * _.mean([4, 2, 8, 6]);\n * // => 5\n */\n function mean(array) {\n return baseMean(array, identity);\n }\n\n /**\n * This method is like `_.mean` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be averaged.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the mean.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.meanBy(objects, function(o) { return o.n; });\n * // => 5\n *\n * // The `_.property` iteratee shorthand.\n * _.meanBy(objects, 'n');\n * // => 5\n */\n function meanBy(array, iteratee) {\n return baseMean(array, getIteratee(iteratee, 2));\n }\n\n /**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\n function min(array) {\n return (array && array.length)\n ? baseExtremum(array, identity, baseLt)\n : undefined;\n }\n\n /**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\n function minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n : undefined;\n }\n\n /**\n * Multiply two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.7.0\n * @category Math\n * @param {number} multiplier The first number in a multiplication.\n * @param {number} multiplicand The second number in a multiplication.\n * @returns {number} Returns the product.\n * @example\n *\n * _.multiply(6, 4);\n * // => 24\n */\n var multiply = createMathOperation(function(multiplier, multiplicand) {\n return multiplier * multiplicand;\n }, 1);\n\n /**\n * Computes `number` rounded to `precision`.\n *\n * @static\n * @memberOf _\n * @since 3.10.0\n * @category Math\n * @param {number} number The number to round.\n * @param {number} [precision=0] The precision to round to.\n * @returns {number} Returns the rounded number.\n * @example\n *\n * _.round(4.006);\n * // => 4\n *\n * _.round(4.006, 2);\n * // => 4.01\n *\n * _.round(4060, -2);\n * // => 4100\n */\n var round = createRound('round');\n\n /**\n * Subtract two numbers.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {number} minuend The first number in a subtraction.\n * @param {number} subtrahend The second number in a subtraction.\n * @returns {number} Returns the difference.\n * @example\n *\n * _.subtract(6, 4);\n * // => 2\n */\n var subtract = createMathOperation(function(minuend, subtrahend) {\n return minuend - subtrahend;\n }, 0);\n\n /**\n * Computes the sum of the values in `array`.\n *\n * @static\n * @memberOf _\n * @since 3.4.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {number} Returns the sum.\n * @example\n *\n * _.sum([4, 2, 8, 6]);\n * // => 20\n */\n function sum(array) {\n return (array && array.length)\n ? baseSum(array, identity)\n : 0;\n }\n\n /**\n * This method is like `_.sum` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the value to be summed.\n * The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {number} Returns the sum.\n * @example\n *\n * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n *\n * _.sumBy(objects, function(o) { return o.n; });\n * // => 20\n *\n * // The `_.property` iteratee shorthand.\n * _.sumBy(objects, 'n');\n * // => 20\n */\n function sumBy(array, iteratee) {\n return (array && array.length)\n ? baseSum(array, getIteratee(iteratee, 2))\n : 0;\n }\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return wrapped values in chain sequences.\n lodash.after = after;\n lodash.ary = ary;\n lodash.assign = assign;\n lodash.assignIn = assignIn;\n lodash.assignInWith = assignInWith;\n lodash.assignWith = assignWith;\n lodash.at = at;\n lodash.before = before;\n lodash.bind = bind;\n lodash.bindAll = bindAll;\n lodash.bindKey = bindKey;\n lodash.castArray = castArray;\n lodash.chain = chain;\n lodash.chunk = chunk;\n lodash.compact = compact;\n lodash.concat = concat;\n lodash.cond = cond;\n lodash.conforms = conforms;\n lodash.constant = constant;\n lodash.countBy = countBy;\n lodash.create = create;\n lodash.curry = curry;\n lodash.curryRight = curryRight;\n lodash.debounce = debounce;\n lodash.defaults = defaults;\n lodash.defaultsDeep = defaultsDeep;\n lodash.defer = defer;\n lodash.delay = delay;\n lodash.difference = difference;\n lodash.differenceBy = differenceBy;\n lodash.differenceWith = differenceWith;\n lodash.drop = drop;\n lodash.dropRight = dropRight;\n lodash.dropRightWhile = dropRightWhile;\n lodash.dropWhile = dropWhile;\n lodash.fill = fill;\n lodash.filter = filter;\n lodash.flatMap = flatMap;\n lodash.flatMapDeep = flatMapDeep;\n lodash.flatMapDepth = flatMapDepth;\n lodash.flatten = flatten;\n lodash.flattenDeep = flattenDeep;\n lodash.flattenDepth = flattenDepth;\n lodash.flip = flip;\n lodash.flow = flow;\n lodash.flowRight = flowRight;\n lodash.fromPairs = fromPairs;\n lodash.functions = functions;\n lodash.functionsIn = functionsIn;\n lodash.groupBy = groupBy;\n lodash.initial = initial;\n lodash.intersection = intersection;\n lodash.intersectionBy = intersectionBy;\n lodash.intersectionWith = intersectionWith;\n lodash.invert = invert;\n lodash.invertBy = invertBy;\n lodash.invokeMap = invokeMap;\n lodash.iteratee = iteratee;\n lodash.keyBy = keyBy;\n lodash.keys = keys;\n lodash.keysIn = keysIn;\n lodash.map = map;\n lodash.mapKeys = mapKeys;\n lodash.mapValues = mapValues;\n lodash.matches = matches;\n lodash.matchesProperty = matchesProperty;\n lodash.memoize = memoize;\n lodash.merge = merge;\n lodash.mergeWith = mergeWith;\n lodash.method = method;\n lodash.methodOf = methodOf;\n lodash.mixin = mixin;\n lodash.negate = negate;\n lodash.nthArg = nthArg;\n lodash.omit = omit;\n lodash.omitBy = omitBy;\n lodash.once = once;\n lodash.orderBy = orderBy;\n lodash.over = over;\n lodash.overArgs = overArgs;\n lodash.overEvery = overEvery;\n lodash.overSome = overSome;\n lodash.partial = partial;\n lodash.partialRight = partialRight;\n lodash.partition = partition;\n lodash.pick = pick;\n lodash.pickBy = pickBy;\n lodash.property = property;\n lodash.propertyOf = propertyOf;\n lodash.pull = pull;\n lodash.pullAll = pullAll;\n lodash.pullAllBy = pullAllBy;\n lodash.pullAllWith = pullAllWith;\n lodash.pullAt = pullAt;\n lodash.range = range;\n lodash.rangeRight = rangeRight;\n lodash.rearg = rearg;\n lodash.reject = reject;\n lodash.remove = remove;\n lodash.rest = rest;\n lodash.reverse = reverse;\n lodash.sampleSize = sampleSize;\n lodash.set = set;\n lodash.setWith = setWith;\n lodash.shuffle = shuffle;\n lodash.slice = slice;\n lodash.sortBy = sortBy;\n lodash.sortedUniq = sortedUniq;\n lodash.sortedUniqBy = sortedUniqBy;\n lodash.split = split;\n lodash.spread = spread;\n lodash.tail = tail;\n lodash.take = take;\n lodash.takeRight = takeRight;\n lodash.takeRightWhile = takeRightWhile;\n lodash.takeWhile = takeWhile;\n lodash.tap = tap;\n lodash.throttle = throttle;\n lodash.thru = thru;\n lodash.toArray = toArray;\n lodash.toPairs = toPairs;\n lodash.toPairsIn = toPairsIn;\n lodash.toPath = toPath;\n lodash.toPlainObject = toPlainObject;\n lodash.transform = transform;\n lodash.unary = unary;\n lodash.union = union;\n lodash.unionBy = unionBy;\n lodash.unionWith = unionWith;\n lodash.uniq = uniq;\n lodash.uniqBy = uniqBy;\n lodash.uniqWith = uniqWith;\n lodash.unset = unset;\n lodash.unzip = unzip;\n lodash.unzipWith = unzipWith;\n lodash.update = update;\n lodash.updateWith = updateWith;\n lodash.values = values;\n lodash.valuesIn = valuesIn;\n lodash.without = without;\n lodash.words = words;\n lodash.wrap = wrap;\n lodash.xor = xor;\n lodash.xorBy = xorBy;\n lodash.xorWith = xorWith;\n lodash.zip = zip;\n lodash.zipObject = zipObject;\n lodash.zipObjectDeep = zipObjectDeep;\n lodash.zipWith = zipWith;\n\n // Add aliases.\n lodash.entries = toPairs;\n lodash.entriesIn = toPairsIn;\n lodash.extend = assignIn;\n lodash.extendWith = assignInWith;\n\n // Add methods to `lodash.prototype`.\n mixin(lodash, lodash);\n\n /*------------------------------------------------------------------------*/\n\n // Add methods that return unwrapped values in chain sequences.\n lodash.add = add;\n lodash.attempt = attempt;\n lodash.camelCase = camelCase;\n lodash.capitalize = capitalize;\n lodash.ceil = ceil;\n lodash.clamp = clamp;\n lodash.clone = clone;\n lodash.cloneDeep = cloneDeep;\n lodash.cloneDeepWith = cloneDeepWith;\n lodash.cloneWith = cloneWith;\n lodash.conformsTo = conformsTo;\n lodash.deburr = deburr;\n lodash.defaultTo = defaultTo;\n lodash.divide = divide;\n lodash.endsWith = endsWith;\n lodash.eq = eq;\n lodash.escape = escape;\n lodash.escapeRegExp = escapeRegExp;\n lodash.every = every;\n lodash.find = find;\n lodash.findIndex = findIndex;\n lodash.findKey = findKey;\n lodash.findLast = findLast;\n lodash.findLastIndex = findLastIndex;\n lodash.findLastKey = findLastKey;\n lodash.floor = floor;\n lodash.forEach = forEach;\n lodash.forEachRight = forEachRight;\n lodash.forIn = forIn;\n lodash.forInRight = forInRight;\n lodash.forOwn = forOwn;\n lodash.forOwnRight = forOwnRight;\n lodash.get = get;\n lodash.gt = gt;\n lodash.gte = gte;\n lodash.has = has;\n lodash.hasIn = hasIn;\n lodash.head = head;\n lodash.identity = identity;\n lodash.includes = includes;\n lodash.indexOf = indexOf;\n lodash.inRange = inRange;\n lodash.invoke = invoke;\n lodash.isArguments = isArguments;\n lodash.isArray = isArray;\n lodash.isArrayBuffer = isArrayBuffer;\n lodash.isArrayLike = isArrayLike;\n lodash.isArrayLikeObject = isArrayLikeObject;\n lodash.isBoolean = isBoolean;\n lodash.isBuffer = isBuffer;\n lodash.isDate = isDate;\n lodash.isElement = isElement;\n lodash.isEmpty = isEmpty;\n lodash.isEqual = isEqual;\n lodash.isEqualWith = isEqualWith;\n lodash.isError = isError;\n lodash.isFinite = isFinite;\n lodash.isFunction = isFunction;\n lodash.isInteger = isInteger;\n lodash.isLength = isLength;\n lodash.isMap = isMap;\n lodash.isMatch = isMatch;\n lodash.isMatchWith = isMatchWith;\n lodash.isNaN = isNaN;\n lodash.isNative = isNative;\n lodash.isNil = isNil;\n lodash.isNull = isNull;\n lodash.isNumber = isNumber;\n lodash.isObject = isObject;\n lodash.isObjectLike = isObjectLike;\n lodash.isPlainObject = isPlainObject;\n lodash.isRegExp = isRegExp;\n lodash.isSafeInteger = isSafeInteger;\n lodash.isSet = isSet;\n lodash.isString = isString;\n lodash.isSymbol = isSymbol;\n lodash.isTypedArray = isTypedArray;\n lodash.isUndefined = isUndefined;\n lodash.isWeakMap = isWeakMap;\n lodash.isWeakSet = isWeakSet;\n lodash.join = join;\n lodash.kebabCase = kebabCase;\n lodash.last = last;\n lodash.lastIndexOf = lastIndexOf;\n lodash.lowerCase = lowerCase;\n lodash.lowerFirst = lowerFirst;\n lodash.lt = lt;\n lodash.lte = lte;\n lodash.max = max;\n lodash.maxBy = maxBy;\n lodash.mean = mean;\n lodash.meanBy = meanBy;\n lodash.min = min;\n lodash.minBy = minBy;\n lodash.stubArray = stubArray;\n lodash.stubFalse = stubFalse;\n lodash.stubObject = stubObject;\n lodash.stubString = stubString;\n lodash.stubTrue = stubTrue;\n lodash.multiply = multiply;\n lodash.nth = nth;\n lodash.noConflict = noConflict;\n lodash.noop = noop;\n lodash.now = now;\n lodash.pad = pad;\n lodash.padEnd = padEnd;\n lodash.padStart = padStart;\n lodash.parseInt = parseInt;\n lodash.random = random;\n lodash.reduce = reduce;\n lodash.reduceRight = reduceRight;\n lodash.repeat = repeat;\n lodash.replace = replace;\n lodash.result = result;\n lodash.round = round;\n lodash.runInContext = runInContext;\n lodash.sample = sample;\n lodash.size = size;\n lodash.snakeCase = snakeCase;\n lodash.some = some;\n lodash.sortedIndex = sortedIndex;\n lodash.sortedIndexBy = sortedIndexBy;\n lodash.sortedIndexOf = sortedIndexOf;\n lodash.sortedLastIndex = sortedLastIndex;\n lodash.sortedLastIndexBy = sortedLastIndexBy;\n lodash.sortedLastIndexOf = sortedLastIndexOf;\n lodash.startCase = startCase;\n lodash.startsWith = startsWith;\n lodash.subtract = subtract;\n lodash.sum = sum;\n lodash.sumBy = sumBy;\n lodash.template = template;\n lodash.times = times;\n lodash.toFinite = toFinite;\n lodash.toInteger = toInteger;\n lodash.toLength = toLength;\n lodash.toLower = toLower;\n lodash.toNumber = toNumber;\n lodash.toSafeInteger = toSafeInteger;\n lodash.toString = toString;\n lodash.toUpper = toUpper;\n lodash.trim = trim;\n lodash.trimEnd = trimEnd;\n lodash.trimStart = trimStart;\n lodash.truncate = truncate;\n lodash.unescape = unescape;\n lodash.uniqueId = uniqueId;\n lodash.upperCase = upperCase;\n lodash.upperFirst = upperFirst;\n\n // Add aliases.\n lodash.each = forEach;\n lodash.eachRight = forEachRight;\n lodash.first = head;\n\n mixin(lodash, (function() {\n var source = {};\n baseForOwn(lodash, function(func, methodName) {\n if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n source[methodName] = func;\n }\n });\n return source;\n }()), { 'chain': false });\n\n /*------------------------------------------------------------------------*/\n\n /**\n * The semantic version number.\n *\n * @static\n * @memberOf _\n * @type {string}\n */\n lodash.VERSION = VERSION;\n\n // Assign default placeholders.\n arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n lodash[methodName].placeholder = lodash;\n });\n\n // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n arrayEach(['drop', 'take'], function(methodName, index) {\n LazyWrapper.prototype[methodName] = function(n) {\n n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n var result = (this.__filtered__ && !index)\n ? new LazyWrapper(this)\n : this.clone();\n\n if (result.__filtered__) {\n result.__takeCount__ = nativeMin(n, result.__takeCount__);\n } else {\n result.__views__.push({\n 'size': nativeMin(n, MAX_ARRAY_LENGTH),\n 'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n });\n }\n return result;\n };\n\n LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n return this.reverse()[methodName](n).reverse();\n };\n });\n\n // Add `LazyWrapper` methods that accept an `iteratee` value.\n arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n var type = index + 1,\n isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n LazyWrapper.prototype[methodName] = function(iteratee) {\n var result = this.clone();\n result.__iteratees__.push({\n 'iteratee': getIteratee(iteratee, 3),\n 'type': type\n });\n result.__filtered__ = result.__filtered__ || isFilter;\n return result;\n };\n });\n\n // Add `LazyWrapper` methods for `_.head` and `_.last`.\n arrayEach(['head', 'last'], function(methodName, index) {\n var takeName = 'take' + (index ? 'Right' : '');\n\n LazyWrapper.prototype[methodName] = function() {\n return this[takeName](1).value()[0];\n };\n });\n\n // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n arrayEach(['initial', 'tail'], function(methodName, index) {\n var dropName = 'drop' + (index ? '' : 'Right');\n\n LazyWrapper.prototype[methodName] = function() {\n return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n };\n });\n\n LazyWrapper.prototype.compact = function() {\n return this.filter(identity);\n };\n\n LazyWrapper.prototype.find = function(predicate) {\n return this.filter(predicate).head();\n };\n\n LazyWrapper.prototype.findLast = function(predicate) {\n return this.reverse().find(predicate);\n };\n\n LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n if (typeof path == 'function') {\n return new LazyWrapper(this);\n }\n return this.map(function(value) {\n return baseInvoke(value, path, args);\n });\n });\n\n LazyWrapper.prototype.reject = function(predicate) {\n return this.filter(negate(getIteratee(predicate)));\n };\n\n LazyWrapper.prototype.slice = function(start, end) {\n start = toInteger(start);\n\n var result = this;\n if (result.__filtered__ && (start > 0 || end < 0)) {\n return new LazyWrapper(result);\n }\n if (start < 0) {\n result = result.takeRight(-start);\n } else if (start) {\n result = result.drop(start);\n }\n if (end !== undefined) {\n end = toInteger(end);\n result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n }\n return result;\n };\n\n LazyWrapper.prototype.takeRightWhile = function(predicate) {\n return this.reverse().takeWhile(predicate).reverse();\n };\n\n LazyWrapper.prototype.toArray = function() {\n return this.take(MAX_ARRAY_LENGTH);\n };\n\n // Add `LazyWrapper` methods to `lodash.prototype`.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n isTaker = /^(?:head|last)$/.test(methodName),\n lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n retUnwrapped = isTaker || /^find/.test(methodName);\n\n if (!lodashFunc) {\n return;\n }\n lodash.prototype[methodName] = function() {\n var value = this.__wrapped__,\n args = isTaker ? [1] : arguments,\n isLazy = value instanceof LazyWrapper,\n iteratee = args[0],\n useLazy = isLazy || isArray(value);\n\n var interceptor = function(value) {\n var result = lodashFunc.apply(lodash, arrayPush([value], args));\n return (isTaker && chainAll) ? result[0] : result;\n };\n\n if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n isLazy = useLazy = false;\n }\n var chainAll = this.__chain__,\n isHybrid = !!this.__actions__.length,\n isUnwrapped = retUnwrapped && !chainAll,\n onlyLazy = isLazy && !isHybrid;\n\n if (!retUnwrapped && useLazy) {\n value = onlyLazy ? value : new LazyWrapper(this);\n var result = func.apply(value, args);\n result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n return new LodashWrapper(result, chainAll);\n }\n if (isUnwrapped && onlyLazy) {\n return func.apply(this, args);\n }\n result = this.thru(interceptor);\n return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n };\n });\n\n // Add `Array` methods to `lodash.prototype`.\n arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n var func = arrayProto[methodName],\n chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n lodash.prototype[methodName] = function() {\n var args = arguments;\n if (retUnwrapped && !this.__chain__) {\n var value = this.value();\n return func.apply(isArray(value) ? value : [], args);\n }\n return this[chainName](function(value) {\n return func.apply(isArray(value) ? value : [], args);\n });\n };\n });\n\n // Map minified method names to their real names.\n baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n var lodashFunc = lodash[methodName];\n if (lodashFunc) {\n var key = lodashFunc.name + '';\n if (!hasOwnProperty.call(realNames, key)) {\n realNames[key] = [];\n }\n realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n }\n });\n\n realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n 'name': 'wrapper',\n 'func': undefined\n }];\n\n // Add methods to `LazyWrapper`.\n LazyWrapper.prototype.clone = lazyClone;\n LazyWrapper.prototype.reverse = lazyReverse;\n LazyWrapper.prototype.value = lazyValue;\n\n // Add chain sequence methods to the `lodash` wrapper.\n lodash.prototype.at = wrapperAt;\n lodash.prototype.chain = wrapperChain;\n lodash.prototype.commit = wrapperCommit;\n lodash.prototype.next = wrapperNext;\n lodash.prototype.plant = wrapperPlant;\n lodash.prototype.reverse = wrapperReverse;\n lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n // Add lazy aliases.\n lodash.prototype.first = lodash.prototype.head;\n\n if (symIterator) {\n lodash.prototype[symIterator] = wrapperToIterator;\n }\n return lodash;\n });\n\n /*--------------------------------------------------------------------------*/\n\n // Export lodash.\n var _ = runInContext();\n\n // Some AMD build optimizers, like r.js, check for condition patterns like:\n if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n // Expose Lodash on the global object to prevent errors when Lodash is\n // loaded by a script tag in the presence of an AMD loader.\n // See http://requirejs.org/docs/errors.html#mismatch for more details.\n // Use `_.noConflict` to remove Lodash from the global object.\n root._ = _;\n\n // Define as an anonymous module so, through path mapping, it can be\n // referenced as the \"underscore\" module.\n define(function() {\n return _;\n });\n }\n // Check for `exports` after `define` in case a build optimizer adds it.\n else if (freeModule) {\n // Export for Node.js.\n (freeModule.exports = _)._ = _;\n // Export for CommonJS support.\n freeExports._ = _;\n }\n else {\n // Export to the global object.\n root._ = _;\n }\n}.call(this));\n", "\"use strict\";\n/* file: topk.ts\nMIT License\n\nCopyright (c) 2019-2020 Thomas Minier\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 all\ncopies 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 THE\nSOFTWARE.\n*/\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (_) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar count_min_sketch_1 = __importDefault(require(\"./count-min-sketch\"));\nvar exportable_1 = require(\"../exportable\");\nvar lodash_1 = require(\"lodash\");\n/**\n * A MinHeap stores items sorted by ascending frequency\n * @author Thomas Minier\n */\nvar MinHeap = /** @class */ (function () {\n function MinHeap() {\n this._content = [];\n }\n Object.defineProperty(MinHeap.prototype, \"length\", {\n /**\n * Get the number of items in the heap\n */\n get: function () {\n return this._content.length;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(MinHeap.prototype, \"content\", {\n get: function () {\n return this._content;\n },\n set: function (value) {\n this._content = value;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Access an item at a given index\n * @param index - Index of the item\n * @return The item or `undefined` if the index is out of the array\n */\n MinHeap.prototype.get = function (index) {\n return this._content[index];\n };\n /**\n * Add a new element to the heap and keep items sorted by ascending frequency\n * @param element - Element to insert\n */\n MinHeap.prototype.add = function (element) {\n // kepp items sorted by frequency\n var index = lodash_1.sortedIndexBy(this._content, element, function (heapElement) { return heapElement.frequency; });\n this._content.splice(index, 0, element);\n };\n /**\n * Remove an item at a given index and keep items sorted by ascending frequency\n * @param index - Index of the item to remove\n */\n MinHeap.prototype.remove = function (index) {\n this._content.splice(index, 1);\n };\n /**\n * Remove and returns the element with the smallest frequency in the heap\n * @return The element with the smallest frequency in the heap\n */\n MinHeap.prototype.popMin = function () {\n return this._content.shift();\n };\n /**\n * Get the index of an element by its value\n * @param value - Value of the element to search for\n * @return Index of the element or -1 if it is not in the heap\n */\n MinHeap.prototype.indexOf = function (value) {\n // TODO optimize\n return this._content.findIndex(function (heapElement) { return heapElement.value === value; });\n // const index = sortedIndexBy(this._content, {value, frequency: 0}, heapElement => heapElement.value)\n // if (this._content[index] !== undefined && this._content[index].value === value) {\n // return index\n // }\n // return -1\n };\n /**\n * Clear the content of the heap\n */\n MinHeap.prototype.clear = function () {\n this._content = [];\n };\n return MinHeap;\n}());\n/**\n * A TopK computes the ranking of elements in a multiset (by an arbitrary score) and returns the `k` results with the highest scores.\n * This implementation of the TopK problem sorts items based on their estimated cardinality in the multiset.\n * It is based on a Count Min Sketch, for estimating the cardinality of items, and a MinHeap, for implementing a sliding window over the `k` results with the highest scores.\n * @author Thomas Minier\n * @author Arnaud Grall\n */\nvar TopK = /** @class */ (function (_super) {\n __extends(TopK, _super);\n /**\n * Constructor\n * @param k - How many elements to store\n * @param errorRate - The error rate\n * @param accuracy - The probability of accuracy\n */\n function TopK(k, errorRate, accuracy) {\n var _this = _super.call(this) || this;\n _this._k = k;\n _this._errorRate = errorRate;\n _this._accuracy = accuracy;\n _this._sketch = count_min_sketch_1.default.create(errorRate, accuracy);\n _this._heap = new MinHeap();\n return _this;\n }\n /**\n * Add an element to the TopK\n * @param element - Element to add\n */\n TopK.prototype.add = function (element) {\n this._sketch.update(element);\n var frequency = this._sketch.count(element);\n if (this._heap.length < this._k || frequency >= this._heap.get(0).frequency) {\n var index = this._heap.indexOf(element);\n // remove the entry if it is already in the MinHeap\n if (index > -1) {\n this._heap.remove(index);\n }\n // add the new entry\n this._heap.add({\n value: element,\n frequency: frequency\n });\n // if there is more items than K, then remove the smallest item in the heap\n if (this._heap.length > this._k) {\n this._heap.popMin();\n }\n }\n };\n /**\n * Clear the content of the TopK\n */\n TopK.prototype.clear = function () {\n this._sketch = count_min_sketch_1.default.create(this._errorRate, this._accuracy);\n this._heap.clear();\n };\n /**\n * Get the top-k values as an array of objects {value: string, frequency: number, rank: number}\n * @return The top-k values as an array of objects {value: string, frequency: number, rank: number}\n */\n TopK.prototype.values = function () {\n var res = [];\n for (var i = this._heap.length - 1; i >= 0; i--) {\n var elt = this._heap.get(i);\n res.push({\n value: elt.value,\n frequency: elt.frequency,\n rank: this._heap.length - i\n });\n }\n return res;\n };\n /**\n * Get the top-k values as an iterator that yields objects {value: string, frequency: number, rank: number}.\n * WARNING: With this method, values are produced on-the-fly, hence you should not modify the TopK\n * while the iteration is not completed, otherwise the generated values may not respect the TopK properties.\n * @return The top-k values as an iterator of object {value: string, frequency: number, rank: number}\n */\n TopK.prototype.iterator = function () {\n var heap = this._heap;\n return function () {\n var i, elt;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n i = heap.length - 1;\n _a.label = 1;\n case 1:\n if (!(i >= 0)) return [3 /*break*/, 4];\n elt = heap.get(i);\n return [4 /*yield*/, {\n value: elt.value,\n frequency: elt.frequency,\n rank: heap.length - i\n }];\n case 2:\n _a.sent();\n _a.label = 3;\n case 3:\n i--;\n return [3 /*break*/, 1];\n case 4: return [2 /*return*/];\n }\n });\n }();\n };\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], TopK.prototype, \"_k\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], TopK.prototype, \"_errorRate\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], TopK.prototype, \"_accuracy\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", count_min_sketch_1.default)\n ], TopK.prototype, \"_sketch\", void 0);\n __decorate([\n exportable_1.Field(function (heap) { return heap.content; }, function (json) {\n var heap = new MinHeap();\n heap.content = json;\n return heap;\n }),\n __metadata(\"design:type\", MinHeap\n /**\n * Constructor\n * @param k - How many elements to store\n * @param errorRate - The error rate\n * @param accuracy - The probability of accuracy\n */\n )\n ], TopK.prototype, \"_heap\", void 0);\n TopK = __decorate([\n exportable_1.AutoExportable('TopK', ['_seed']),\n __param(0, exportable_1.Parameter('_k')), __param(1, exportable_1.Parameter('_errorRate')), __param(2, exportable_1.Parameter('_accuracy')),\n __metadata(\"design:paramtypes\", [Number, Number, Number])\n ], TopK);\n return TopK;\n}(base_filter_1.default));\nexports.default = TopK;\n", "\"use strict\";\n/* file: min-hash.ts\nMIT License\n\nCopyright (c) 2019-2020 Thomas Minier\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 all\ncopies 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 THE\nSOFTWARE.\n*/\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __read = (this && this.__read) || function (o, n) {\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n if (!m) return o;\n var i = m.call(o), r, ar = [], e;\n try {\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n }\n catch (error) { e = { error: error }; }\n finally {\n try {\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\n }\n finally { if (e) throw e.error; }\n }\n return ar;\n};\nvar __spread = (this && this.__spread) || function () {\n for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));\n return ar;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar exportable_1 = require(\"../exportable\");\nvar utils_1 = require(\"../utils\");\nvar lodash_1 = require(\"lodash\");\n/**\n * An error thrown when we try to compute the Jaccard Similarity with an empty MinHash\n * @author Thomas Minier\n */\nvar EmptyMinHashError = /** @class */ (function (_super) {\n __extends(EmptyMinHashError, _super);\n function EmptyMinHashError() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n return EmptyMinHashError;\n}(Error));\n/**\n * Apply a hash function to a number to produce a hash\n * @param x - Value to hash\n * @param fn - HashFunction to apply\n * @return The hashed value\n */\nfunction applyHashFunction(x, fn) {\n return (fn.a * x + fn.b) % fn.c;\n}\n/**\n * MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are.\n * It is able to estimate the Jaccard similarity between two large sets of numbers using random hashing.\n *\n * **WARNING**: Only the MinHash produced by the same {@link MinHashFactory} can be compared between them.\n *\n * @see \"On the resemblance and containment of documents\", by Andrei Z. Broder, in Compression and Complexity of Sequences: Proceedings, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997.\n * @author Thomas Minier\n */\nvar MinHash = /** @class */ (function (_super) {\n __extends(MinHash, _super);\n /**\n * Constructor\n * @param nbHashes - Number of hash functions to use for comouting the MinHash signature\n * @param hashFunctions - Hash functions used to compute the signature\n */\n function MinHash(nbHashes, hashFunctions) {\n var _this = _super.call(this) || this;\n _this._nbHashes = nbHashes;\n _this._hashFunctions = hashFunctions;\n _this._signature = utils_1.allocateArray(_this._nbHashes, Infinity);\n return _this;\n }\n Object.defineProperty(MinHash.prototype, \"nbHashes\", {\n /**\n * Get the number of hash functions used by the MinHash\n */\n get: function () {\n return this._nbHashes;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Test if the signature of the MinHash is empty\n * @return True if the MinHash is empty, False otherwise\n */\n MinHash.prototype.isEmpty = function () {\n return this._signature[0] === Infinity;\n };\n /**\n * Insert a value into the MinHash and update its signature.\n * @param value - Value to insert\n */\n MinHash.prototype.add = function (value) {\n for (var i = 0; i < this._nbHashes; i++) {\n this._signature[i] = Math.min(this._signature[i], applyHashFunction(value, this._hashFunctions[i]));\n }\n };\n /**\n * Ingest a set of values into the MinHash, in an efficient manner, and update its signature.\n * @param values - Set of values to load\n */\n MinHash.prototype.bulkLoad = function (values) {\n var _this = this;\n var _loop_1 = function (i) {\n var candidateSignatures = values.map(function (value) { return applyHashFunction(value, _this._hashFunctions[i]); });\n this_1._signature[i] = Math.min.apply(Math, __spread([this_1._signature[i]], candidateSignatures));\n };\n var this_1 = this;\n for (var i = 0; i < this._nbHashes; i++) {\n _loop_1(i);\n }\n };\n /**\n * Estimate the Jaccard similarity coefficient with another MinHash signature\n * @param other - MinHash to compare with\n * @return The estimated Jaccard similarity coefficient between the two sets\n */\n MinHash.prototype.compareWith = function (other) {\n if (this.isEmpty() || other.isEmpty()) {\n throw new EmptyMinHashError('Cannot compute a Jaccard similairty with a MinHash that contains no values');\n }\n return lodash_1.intersection(this._signature, other._signature).length / this._nbHashes;\n };\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], MinHash.prototype, \"_nbHashes\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], MinHash.prototype, \"_hashFunctions\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Array)\n ], MinHash.prototype, \"_signature\", void 0);\n MinHash = __decorate([\n exportable_1.AutoExportable('MinHash', ['_seed']),\n __param(0, exportable_1.Parameter('_nbHashes')), __param(1, exportable_1.Parameter('_hashFunctions')),\n __metadata(\"design:paramtypes\", [Number, Array])\n ], MinHash);\n return MinHash;\n}(base_filter_1.default));\nexports.MinHash = MinHash;\n", "\"use strict\";\n/* file: min-hash-factory.ts\nMIT License\n\nCopyright (c) 2019-2020 Thomas Minier\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 all\ncopies 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 THE\nSOFTWARE.\n*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar min_hash_1 = require(\"./min-hash\");\nvar lodash_1 = require(\"lodash\");\n/**\n * Test if a number is a prime number\n * @param x - Number to test\n * @return True if the input is a prime number, False otherwise\n */\nfunction isPrime(x) {\n if (x !== 2 && x % 2 === 0) {\n return false;\n }\n for (var i = 2; i < Math.sqrt(x); i++) {\n if (x % i === 0) {\n return false;\n }\n }\n return true;\n}\n/**\n * Find the fist prime number superior to a number\n * @param x - Input number\n * @return The fist prime number superior to the input number\n */\nfunction closestPrime(x) {\n var i = 0;\n while (true) {\n if (isPrime(x + i)) {\n return x + i;\n }\n i++;\n }\n}\n/**\n * A factory to create MinHash sketches using the same set of hash functions.\n *\n * **WARNING**: Only the MinHash produced by the same factory can be compared between them.\n * @author Thomas Minier\n */\nvar MinHashFactory = /** @class */ (function () {\n /**\n * Constructor\n * @param nbHashes - Number of hash functions to use for comouting the MinHash signature\n * @param maxValue - The highest value that can be found in the set to compare\n */\n function MinHashFactory(nbHashes, maxValue) {\n this._nbHashes = nbHashes;\n this._maxValue = maxValue;\n this._hashFunctions = [];\n // generate hash functions\n var c = closestPrime(this._maxValue);\n for (var i = 0; i < this._nbHashes; i++) {\n var a = lodash_1.random(0, this._maxValue, false);\n var b = lodash_1.random(0, this._maxValue, false);\n this._hashFunctions.push({ a: a, b: b, c: c });\n }\n }\n /**\n * Create a new MinHash set\n * @return A new MinHash set\n */\n MinHashFactory.prototype.create = function () {\n return new min_hash_1.MinHash(this._nbHashes, this._hashFunctions);\n };\n return MinHashFactory;\n}());\nexports.default = MinHashFactory;\n", "/**\n * lodash 4.0.0 (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n * Available under MIT license <https://lodash.com/license>\n */\n\n/**\n * Performs a [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'user': 'fred' };\n * var other = { 'user': 'fred' };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n", "/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n MAX_INTEGER = 1.7976931348623157e+308,\n NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n var length = array.length,\n index = fromIndex + (fromRight ? 1 : -1);\n\n while ((fromRight ? index-- : ++index < length)) {\n if (predicate(array[index], index, array)) {\n return index;\n }\n }\n return -1;\n}\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n if (value !== value) {\n return baseFindIndex(array, baseIsNaN, fromIndex);\n }\n var index = fromIndex - 1,\n length = array.length;\n\n while (++index < length) {\n if (array[index] === value) {\n return index;\n }\n }\n return -1;\n}\n\n/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n return value !== value;\n}\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Gets the index at which the first occurrence of `value` is found in `array`\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. If `fromIndex` is negative, it's used as the\n * offset from the end of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n * @example\n *\n * _.indexOf([1, 2, 1, 2], 2);\n * // => 1\n *\n * // Search from the `fromIndex`.\n * _.indexOf([1, 2, 1, 2], 2, 2);\n * // => 3\n */\nfunction indexOf(array, value, fromIndex) {\n var length = array ? array.length : 0;\n if (!length) {\n return -1;\n }\n var index = fromIndex == null ? 0 : toInteger(fromIndex);\n if (index < 0) {\n index = nativeMax(length + index, 0);\n }\n return baseIndexOf(array, value, index);\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n var type = typeof value;\n return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n return typeof value == 'symbol' ||\n (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n if (!value) {\n return value === 0 ? value : 0;\n }\n value = toNumber(value);\n if (value === INFINITY || value === -INFINITY) {\n var sign = (value < 0 ? -1 : 1);\n return sign * MAX_INTEGER;\n }\n return value === value ? value : 0;\n}\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n var result = toFinite(value),\n remainder = result % 1;\n\n return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n if (typeof value == 'number') {\n return value;\n }\n if (isSymbol(value)) {\n return NAN;\n }\n if (isObject(value)) {\n var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n value = isObject(other) ? (other + '') : other;\n }\n if (typeof value != 'string') {\n return value === 0 ? value : +value;\n }\n value = value.replace(reTrim, '');\n var isBinary = reIsBinary.test(value);\n return (isBinary || reIsOctal.test(value))\n ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = indexOf;\n", "/* file : bucket.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nvar __importStar = (this && this.__importStar) || function (mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\n result[\"default\"] = mod;\n return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar lodash_eq_1 = __importDefault(require(\"lodash.eq\"));\nvar lodash_indexof_1 = __importDefault(require(\"lodash.indexof\"));\nvar utils = __importStar(require(\"../utils\"));\nvar exportable_1 = require(\"../exportable\");\nvar exportable_2 = require(\"../exportable\");\n/**\n * A Bucket is a container of a fixed number of values, used in various bloom filters.\n * @extends Exportable\n * @author Thomas Minier\n * @private\n */\nvar Bucket = /** @class */ (function () {\n /**\n * Constructor\n * @param size - The maximum number of elements in the bucket\n */\n function Bucket(size) {\n this._elements = utils.allocateArray(size, null);\n this._size = size;\n this._length = 0;\n }\n Bucket_1 = Bucket;\n Object.defineProperty(Bucket.prototype, \"size\", {\n /**\n * Get the maximum number of element in the bucket\n */\n get: function () {\n return this._size;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(Bucket.prototype, \"length\", {\n /**\n * Get the number of elements currenlty in the bucket\n */\n get: function () {\n return this._length;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Test if the bucket has any space available\n * @return True if te bucket has any space available, False if if its full\n */\n Bucket.prototype.isFree = function () {\n return this._length < this._size;\n };\n /**\n * Get the index of the first empty slot in the bucket\n * @return The index of the first empty slot, or -1 if the bucket is full\n */\n Bucket.prototype.nextEmptySlot = function () {\n return lodash_indexof_1.default(this._elements, null);\n };\n /**\n * Get the element at the given index in the bucket\n * @param index - The index to access\n * @return The element at the given index\n */\n Bucket.prototype.at = function (index) {\n return this._elements[index];\n };\n /**\n * Try to add an element to the bucket\n * @param element - The element to add in the bucket\n * @return True if the insertion is a success, False if the bucket is full\n */\n Bucket.prototype.add = function (element) {\n if (element === null || !this.isFree()) {\n return false;\n }\n this.set(this.nextEmptySlot(), element);\n this._length++;\n return true;\n };\n /**\n * Try to remove an element from the bucket\n * @param element - The element to remove from the bucket\n * @return True if the element has been successfully removed, False if it was not in the bucket\n */\n Bucket.prototype.remove = function (element) {\n var index = lodash_indexof_1.default(this._elements, element);\n if (index <= -1) {\n return false;\n }\n this.unset(index);\n return true;\n };\n /**\n * Test an element for membership\n * @param element - The element to look for in the bucket\n * @return True is the element is in the bucket, otherwise False\n */\n Bucket.prototype.has = function (element) {\n return lodash_indexof_1.default(this._elements, element) > -1;\n };\n /**\n * Set an element at the given index in the bucket\n * @param index - The index at where the element should be inserted\n * @param element - The element to insert\n */\n Bucket.prototype.set = function (index, element) {\n this._elements[index] = element;\n };\n /**\n * Unset the element at the given index\n * @param index - The index of the element that should be unset\n */\n Bucket.prototype.unset = function (index) {\n this._elements[index] = null;\n this._length--;\n };\n /**\n * Randomly swap an element of the bucket with a given element, then return the replaced element\n * @param element - The element to be inserted\n * @param random - Factory function used to generate random function\n * @return The element that have been swapped with the parameter\n */\n Bucket.prototype.swapRandom = function (element, random) {\n if (random === void 0) { random = Math.random; }\n var index = utils.randomInt(0, this._length - 1, random);\n var tmp = this._elements[index];\n this._elements[index] = element;\n return tmp;\n };\n /**\n * Swap an element of the bucket with a given index and element, then return the replaced element\n * @param index - The index at where the element should be inserted\n * @param element - The element to be inserted\n * @return The element that have been swapped with the parameter\n */\n Bucket.prototype.swap = function (index, element) {\n var tmp = this._elements[index];\n this._elements[index] = element;\n return tmp;\n };\n /**\n * Test if two buckets are equals: they have the same size, length and content\n * @param bucket - The other bucket with which to compare\n * @return True if the two buckets are equals, False otherwise\n */\n Bucket.prototype.equals = function (bucket) {\n if ((this._size !== bucket.size) || (this._length !== bucket.length))\n return false;\n return this._elements.every(function (elt, index) { return lodash_eq_1.default(bucket.at(index), elt); });\n };\n var Bucket_1;\n Bucket = Bucket_1 = __decorate([\n exportable_1.Exportable({\n export: exportable_2.cloneObject('Bucket', '_size', '_elements'),\n import: function (json) {\n if ((json.type !== 'Bucket') || !('_size' in json), !('_elements' in json)) {\n throw new Error('Cannot create a Bucket from a JSON export which does not represent a bucket');\n }\n var bucket = new Bucket_1(json._size);\n json._elements.forEach(function (elt, i) {\n if (elt !== null) {\n bucket._elements[i] = elt;\n bucket._length++;\n }\n });\n return bucket;\n }\n }),\n __metadata(\"design:paramtypes\", [Number])\n ], Bucket);\n return Bucket;\n}());\nexports.default = Bucket;\n", "/* file : cuckoo-filter.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar bucket_1 = __importDefault(require(\"./bucket\"));\nvar exportable_1 = require(\"../exportable\");\nvar utils_1 = require(\"../utils\");\n/**\n * Compute the optimal fingerprint length in bytes for a given bucket size\n * and a false positive rate.\n * @param {int} size - The filter bucket size\n * @param {int} rate - The error rate, i.e. 'false positive' rate, targetted by the filter\n * @return {int} The optimal fingerprint length in bytes\n * @private\n */\nfunction computeFingerpintLength(size, rate) {\n var f = Math.ceil(Math.log2(1 / rate) + Math.log2(2 * size));\n return Math.ceil(f / 4); // because we use base 16 64-bits hashes\n}\n/**\n * Cuckoo filters improve on Bloom filters by supporting deletion, limited counting,\n * and bounded False positive rate with similar storage efficiency as a standard Bloom filter.\n *\n * Reference: Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014, December). Cuckoo filter: Practically better than bloom.\n * In Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies (pp. 75-88). ACM.\n * @see {@link https://www.cs.cmu.edu/~dga/papers/cuckoo-conext2014.pdf} for more details about Cuckoo filters\n * @author Thomas Minier & Arnaud Grall\n */\nvar CuckooFilter = /** @class */ (function (_super) {\n __extends(CuckooFilter, _super);\n /**\n * Constructor\n * @param size - The filter size\n * @param fLength - The length of the fingerprints\n * @param bucketSize - The size of the buckets in the filter\n * @param maxKicks - (optional) The max number of kicks when resolving collision at insertion, default to 1\n */\n function CuckooFilter(size, fLength, bucketSize, maxKicks) {\n if (maxKicks === void 0) { maxKicks = 500; }\n var _this = _super.call(this) || this;\n _this._filter = utils_1.allocateArray(size, function () { return new bucket_1.default(bucketSize); });\n _this._size = size;\n _this._bucketSize = bucketSize;\n _this._fingerprintLength = fLength;\n _this._length = 0;\n _this._maxKicks = maxKicks;\n return _this;\n }\n CuckooFilter_1 = CuckooFilter;\n /**\n * Return a new optimal CuckooFilter given the number of maximum elements to store and the error rate desired\n * @param size - The number of items to store\n * @param errorRate - The desired error rate\n * @param bucketSize - The number of buckets desired per cell\n * @param maxKicks - The number of kicks done when a collision occurs\n * @return A Cuckoo Filter optimal for these parameters\n */\n CuckooFilter.create = function (size, errorRate, bucketSize, maxKicks) {\n if (bucketSize === void 0) { bucketSize = 4; }\n if (maxKicks === void 0) { maxKicks = 500; }\n var fl = computeFingerpintLength(bucketSize, errorRate);\n var capacity = Math.ceil(size / bucketSize / 0.955);\n // const capacity = utils.power2(items)\n return new CuckooFilter_1(capacity, fl, bucketSize, maxKicks);\n };\n /**\n * Build a new optimal CuckooFilter from an iterable with a fixed error rate\n * @param items - Iterable used to populate the filter\n * @param errorRate - The error rate of the filter\n * @param bucketSize - The number of buckets desired per cell\n * @param maxKicks - The number of kicks done when a collision occurs\n * @return A new Cuckoo Filter filled with the iterable's elements\n */\n CuckooFilter.from = function (items, errorRate, bucketSize, maxKicks) {\n if (bucketSize === void 0) { bucketSize = 4; }\n if (maxKicks === void 0) { maxKicks = 500; }\n var array = Array.from(items);\n var filter = CuckooFilter_1.create(array.length, errorRate, bucketSize, maxKicks);\n array.forEach(function (item) { return filter.add(item); });\n return filter;\n };\n Object.defineProperty(CuckooFilter.prototype, \"size\", {\n /**\n * Get the filter size\n */\n get: function () {\n return this._size;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CuckooFilter.prototype, \"fullSize\", {\n /**\n * Get the filter full size, i.e., the total number of cells\n */\n get: function () {\n return this.size * this.bucketSize;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CuckooFilter.prototype, \"length\", {\n /**\n * Get the filter length, i.e. the current number of elements in the filter\n */\n get: function () {\n return this._length;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CuckooFilter.prototype, \"fingerprintLength\", {\n /**\n * Get the length of the fingerprints in the filter\n */\n get: function () {\n return this._fingerprintLength;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CuckooFilter.prototype, \"bucketSize\", {\n /**\n * Get the size of the buckets in the filter\n */\n get: function () {\n return this._bucketSize;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(CuckooFilter.prototype, \"maxKicks\", {\n /**\n * Get the max number of kicks when resolving collision at insertion\n */\n get: function () {\n return this._maxKicks;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Add an element to the filter, if false is returned, it means that the filter is considered as full.\n * @param element - The element to add\n * @return True if the insertion is a success, False if the filter is full\n * @example\n * const filter = new CuckooFilter(15, 3, 2);\n * filter.add('alice');\n * filter.add('bob');\n */\n CuckooFilter.prototype.add = function (element, throwError, destructive) {\n if (throwError === void 0) { throwError = false; }\n if (destructive === void 0) { destructive = false; }\n // TODO do the recovery if return false or throw error because we altered values\n var locations = this._locations(element);\n // store fingerprint in an available empty bucket\n if (this._filter[locations.firstIndex].isFree()) {\n this._filter[locations.firstIndex].add(locations.fingerprint);\n }\n else if (this._filter[locations.secondIndex].isFree()) {\n this._filter[locations.secondIndex].add(locations.fingerprint);\n }\n else {\n // buckets are full, we must relocate one of them\n var index = this.random() < 0.5 ? locations.firstIndex : locations.secondIndex;\n var movedElement = locations.fingerprint;\n var logs = [];\n for (var nbTry = 0; nbTry < this._maxKicks; nbTry++) {\n var rndIndex = utils_1.randomInt(0, this._filter[index].length - 1, this.random);\n var tmp = this._filter[index].at(rndIndex);\n logs.push([index, rndIndex, tmp]);\n this._filter[index].set(rndIndex, movedElement);\n movedElement = tmp;\n // movedElement = this._filter[index].set(rndswapRandom(movedElement, this._rng)\n var newHash = utils_1.hashAsInt(movedElement, this.seed, 64);\n index = Math.abs((index ^ Math.abs(newHash))) % this._filter.length;\n // add the moved element to the bucket if possible\n if (this._filter[index].isFree()) {\n this._filter[index].add(movedElement);\n this._length++;\n return true;\n }\n }\n if (!destructive) {\n // rollback all modified entries to their initial states\n for (var i = logs.length - 1; i >= 0; i--) {\n var log = logs[i];\n this._filter[log[0]].set(log[1], log[2]);\n }\n }\n // considered full\n if (throwError) {\n // rollback all operations\n throw new Error(\"The Cuckoo Filter is full, cannot insert element \\\"\" + element + \"\\\"\");\n }\n else {\n return false;\n }\n }\n this._length++;\n return true;\n };\n /**\n * Remove an element from the filter\n * @param element - The element to remove\n * @return True if the element has been removed from the filter, False if it wasn't in the filter\n * @example\n * const filter = new CuckooFilter(15, 3, 2);\n * filter.add('alice');\n * filter.add('bob');\n *\n * // remove an element\n * filter.remove('bob');\n */\n CuckooFilter.prototype.remove = function (element) {\n var locations = this._locations(element);\n if (this._filter[locations.firstIndex].has(locations.fingerprint)) {\n this._filter[locations.firstIndex].remove(locations.fingerprint);\n this._length--;\n return true;\n }\n else if (this._filter[locations.secondIndex].has(locations.fingerprint)) {\n this._filter[locations.secondIndex].remove(locations.fingerprint);\n this._length--;\n return true;\n }\n return false;\n };\n /**\n * Test an element for membership\n * @param element - The element to look for in the filter\n * @return False if the element is definitively not in the filter, True is the element might be in the filter\n * @example\n * const filter = new CuckooFilter(15, 3, 2);\n * filter.add('alice');\n *\n * console.log(filter.has('alice')); // output: true\n * console.log(filter.has('bob')); // output: false\n */\n CuckooFilter.prototype.has = function (element) {\n var locations = this._locations(element);\n return this._filter[locations.firstIndex].has(locations.fingerprint) || this._filter[locations.secondIndex].has(locations.fingerprint);\n };\n /**\n * Return the false positive rate for this cuckoo filter\n * @return The false positive rate\n */\n CuckooFilter.prototype.rate = function () {\n var load = this._computeHashTableLoad();\n var c = this._fingerprintLength / load.load;\n return Math.pow(2, Math.log2(2 * this._bucketSize) - (load.load * c));\n };\n /**\n * Return the load of this filter\n * @return {Object} load: is the load, size is the number of entries, free is the free number of entries, used is the number of entry used\n */\n CuckooFilter.prototype._computeHashTableLoad = function () {\n var max = this._filter.length * this._bucketSize;\n var used = this._filter.reduce(function (acc, val) { return acc + val.length; }, 0);\n return {\n used: used,\n free: max - used,\n size: max,\n load: used / max\n };\n };\n /**\n * For a element, compute its fingerprint and the index of its two buckets\n * @param element - The element to hash\n * @return The fingerprint of the element and the index of its two buckets\n * @private\n */\n CuckooFilter.prototype._locations = function (element) {\n var hashes = utils_1.hashIntAndString(element, this.seed, 16, 64);\n var hash = hashes.int;\n if (this._fingerprintLength > hashes.string.length) {\n throw new Error(\"The fingerprint length (\" + this._fingerprintLength + \") is higher than the hash length (\" + hashes.string.length + \"). Please reduce the fingerprint length or report if it is an unexpected behavior.\");\n }\n var fingerprint = hashes.string.substring(0, this._fingerprintLength);\n var firstIndex = Math.abs(hash);\n var secondHash = Math.abs(utils_1.hashAsInt(fingerprint, this.seed, 64));\n var secondIndex = Math.abs(firstIndex ^ secondHash);\n var res = {\n fingerprint: fingerprint,\n firstIndex: firstIndex % this._size,\n secondIndex: secondIndex % this._size\n };\n return res;\n };\n /**\n * Check if another Cuckoo filter is equal to this one\n * @param filter - The cuckoo filter to compare to this one\n * @return True if they are equal, false otherwise\n */\n CuckooFilter.prototype.equals = function (filter) {\n var i = 0;\n var res = true;\n while (res && i < this._filter.length) {\n var bucket = this._filter[i];\n if (!filter._filter[i].equals(bucket)) {\n res = false;\n }\n i++;\n }\n return res;\n };\n var CuckooFilter_1;\n CuckooFilter = CuckooFilter_1 = __decorate([\n exportable_1.Exportable({\n export: exportable_1.cloneObject('CuckooFilter', '_size', '_fingerprintLength', '_length', '_maxKicks', '_filter', '_seed'),\n import: function (json) {\n if ((json.type !== 'CuckooFilter') || !('_size' in json) || !('_fingerprintLength' in json) || !('_length' in json) || !('_maxKicks' in json) || !('_filter' in json) || !('_seed' in json)) {\n throw new Error('Cannot create a CuckooFilter from a JSON export which does not represent a cuckoo filter');\n }\n var filter = new CuckooFilter_1(json._size, json._fingerprintLength, json._bucketSize, json._maxKicks);\n filter._length = json._length;\n filter._filter = json._filter.map(function (j) {\n var bucket = new bucket_1.default(j._size);\n j._elements.forEach(function (elt, i) {\n if (elt !== null) {\n bucket._elements[i] = elt;\n bucket._length++;\n }\n });\n return bucket;\n });\n filter.seed = json.seed;\n return filter;\n }\n }),\n __metadata(\"design:paramtypes\", [Number, Number, Number, Number])\n ], CuckooFilter);\n return CuckooFilter;\n}(base_filter_1.default));\nexports.default = CuckooFilter;\n", "/* file: cell.ts\nMIT License\n\nCopyright (c) 2019-2020 Thomas Minier\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar buffer_1 = require(\"buffer\");\nvar utils_1 = require(\"../utils\");\nvar exportable_1 = require(\"../exportable\");\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar inspect = Symbol.for('nodejs.util.inspect.custom');\n/**\n * A cell is an internal datastructure of an {@link InvertibleBloomFilter}.\n * It is composed of an idSum (the XOR of all element inserted in that cell), a hashSum (the XOR of all hashed element in that cell) and a counter (the number of elements inserted in that cell).\n * @author Arnaud Grall\n * @author Thomas Minier\n */\nvar Cell = /** @class */ (function (_super) {\n __extends(Cell, _super);\n /**\n * Constructor.\n * To create an empty cell, you might want to use the static Cell#empty() method.\n * @param idSum - The XOR of all element inserted in that cell\n * @param hashSum - The XOR of all hashed element in that cell\n * @param count - The number of elements inserted in that cell\n */\n function Cell(idSum, hashSum, count) {\n var _this = _super.call(this) || this;\n _this._idSum = idSum;\n _this._hashSum = hashSum;\n _this._count = count;\n return _this;\n }\n Cell_1 = Cell;\n /**\n * Create an empty cell\n * @return An empty Cell\n */\n Cell.empty = function () {\n return new Cell_1(buffer_1.Buffer.allocUnsafe(0).fill(0), buffer_1.Buffer.allocUnsafe(0).fill(0), 0);\n };\n Cell.prototype[inspect] = function () {\n return \"Cell:<\" + JSON.stringify(this._idSum.toJSON().data) + \", \" + JSON.stringify(this._hashSum.toJSON().data) + \", \" + this._count + \">\";\n };\n Object.defineProperty(Cell.prototype, \"idSum\", {\n /**\n * Get the id sum of the Cell (The XOR of all element inserted in that cell)\n */\n get: function () {\n return this._idSum;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(Cell.prototype, \"hashSum\", {\n /**\n * Get the hash sum of the Cell (The XOR of all hashed element in that cell)\n */\n get: function () {\n return this._hashSum;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(Cell.prototype, \"count\", {\n /**\n * Get the number of elements inserted in that cell\n */\n get: function () {\n return this._count;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Add an element in this cell\n * @param idSum - The element to XOR in this cell\n * @param hashSum - The hash of the element to XOR in this cell\n */\n Cell.prototype.add = function (idSum, hashSum) {\n this._idSum = utils_1.xorBuffer(this._idSum, idSum);\n this._hashSum = utils_1.xorBuffer(this._hashSum, hashSum);\n this._count++;\n };\n /**\n * Perform the XOR operation between this Cell and another one and returns a resulting Cell.\n * A XOR between two cells is the XOR between their id sum and hash sum,\n * and the difference between their count.\n * @param cell - Cell to perform XOR with\n * @return A new Cell, resulting from the XOR operation\n */\n Cell.prototype.xorm = function (cell) {\n return new Cell_1(utils_1.xorBuffer(this._idSum, cell.idSum), utils_1.xorBuffer(this._hashSum, cell.hashSum), this._count - cell.count);\n };\n /**\n * Test if the Cell is empty\n * @return True if the Cell is empty, False otherwise\n */\n Cell.prototype.isEmpty = function () {\n return this._idSum.equals(buffer_1.Buffer.from('')) && this._hashSum.equals(buffer_1.Buffer.from('')) && this._count === 0;\n };\n /**\n * Test if another Cell is equals to this one\n * @param cell - The cell to compare with\n * @return True if the two Cells are equals, False otherwise\n */\n Cell.prototype.equals = function (cell) {\n return this._count === cell.count && this._idSum.equals(cell.idSum) && this._hashSum.equals(cell.hashSum);\n };\n /**\n * Test if the cell is \"Pure\".\n * A pure cell is a cell with a counter equal to 1 or -1, and with a hash sum equal to the id sum\n * @return True if the cell ius pure, False otherwise\n */\n Cell.prototype.isPure = function () {\n // A pure cell cannot be empty or must have a count equals to 1 or -1\n if (this.isEmpty() || (this._count !== 1 && this._count !== -1)) {\n return false;\n }\n // compare the hashes\n var hashes = utils_1.hashTwiceAsString(JSON.stringify(this._idSum.toJSON()), this.seed);\n return this._hashSum.equals(buffer_1.Buffer.from(hashes.first));\n };\n var Cell_1;\n __decorate([\n exportable_1.Field(function (elt) { return elt.toString(); }, buffer_1.Buffer.from),\n __metadata(\"design:type\", Object)\n ], Cell.prototype, \"_idSum\", void 0);\n __decorate([\n exportable_1.Field(function (elt) { return elt.toString(); }, buffer_1.Buffer.from),\n __metadata(\"design:type\", Object)\n ], Cell.prototype, \"_hashSum\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], Cell.prototype, \"_count\", void 0);\n Cell = Cell_1 = __decorate([\n exportable_1.AutoExportable('Cell', ['_seed']),\n __param(0, exportable_1.Parameter('_idSum')), __param(1, exportable_1.Parameter('_hashSum')), __param(2, exportable_1.Parameter('_count')),\n __metadata(\"design:paramtypes\", [Object, Object, Number])\n ], Cell);\n return Cell;\n}(base_filter_1.default));\nexports.default = Cell;\n", "/* file : invertible-bloom-lookup-tables.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nvar __extends = (this && this.__extends) || (function () {\n var extendStatics = function (d, b) {\n extendStatics = Object.setPrototypeOf ||\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n return extendStatics(d, b);\n };\n return function (d, b) {\n extendStatics(d, b);\n function __() { this.constructor = d; }\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n };\n})();\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __metadata = (this && this.__metadata) || function (k, v) {\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(k, v);\n};\nvar __param = (this && this.__param) || function (paramIndex, decorator) {\n return function (target, key) { decorator(target, key, paramIndex); }\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (_) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar buffer_1 = require(\"buffer\");\nvar base_filter_1 = __importDefault(require(\"../base-filter\"));\nvar cell_1 = __importDefault(require(\"./cell\"));\nvar exportable_1 = require(\"../exportable\");\nvar utils_1 = require(\"../utils\");\nvar formulas_1 = require(\"../formulas\");\n/**\n * An Invertible Bloom Lookup Table is a space-efficient and probabilistic data-structure for solving the set-difference problem efficiently without the use of logs or other prior context. It computes the set difference with communication proportional to the size of the difference between the sets being compared.\n * They can simultaneously calculate D(A\u2212B) and D(B\u2212A) using O(d) space. This data structure encodes sets in a fashion that is similar in spirit to Tornado codes\u2019 construction [6], in that it randomly combines elements using the XOR function\n * Reference: Eppstein, D., Goodrich, M. T., Uyeda, F., & Varghese, G. (2011). What's the difference?: efficient set reconciliation without prior context. ACM SIGCOMM Computer Communication Review, 41(4), 218-229.\n * @see {@link http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.220.6282&rep=rep1&type=pdf} for more details about Invertible Bloom Lookup Tables\n * @author Arnaud Grall\n * @author Thomas Minier\n */\nvar InvertibleBloomFilter = /** @class */ (function (_super) {\n __extends(InvertibleBloomFilter, _super);\n /**\n * Construct an Invertible Bloom Lookup Table\n * @param size - The number of cells in the InvertibleBloomFilter. It should be set to d * alpha, where d is the number of difference and alpha is a constant\n * @param hashCount - The number of hash functions used (empirically studied to be 3 or 4 in most cases)\n */\n function InvertibleBloomFilter(size, hashCount) {\n if (hashCount === void 0) { hashCount = 3; }\n var _this = _super.call(this) || this;\n if (buffer_1.Buffer === undefined) {\n throw new Error('No native Buffer implementation bound in your JavaScript env. If you are in a Web browser, consider importing the polyfill \"feross/buffer\" (https://github.com/feross/buffer).');\n }\n if (hashCount <= 0) {\n throw new Error('The hashCount must be a non-zero, positive integer');\n }\n _this._size = size;\n _this._hashCount = hashCount;\n // the number of elements in the array is n = alpha * size\n _this._elements = utils_1.allocateArray(_this._size, function () { return cell_1.default.empty(); });\n return _this;\n }\n InvertibleBloomFilter_1 = InvertibleBloomFilter;\n /**\n * Create an Invertible Bloom filter optimal for an expected size and error rate.\n * @param nbItems - Number of items expected to insert into the IBLT\n * @param errorRate - Expected error rate\n * @return A new Invertible Bloom filter optimal for the given parameters.\n */\n InvertibleBloomFilter.create = function (nbItems, errorRate) {\n var size = formulas_1.optimalFilterSize(nbItems, errorRate);\n var nbHashes = formulas_1.optimalHashes(size, nbItems);\n return new InvertibleBloomFilter_1(size, nbHashes);\n };\n /**\n * Create an Invertible Bloom filter from a set of Buffer and optimal for an error rate.\n * @param items - An iterable to yield Buffers to be inserted into the filter\n * @param errorRate - Expected error rate\n * @return A new Invertible Bloom filter filled with the iterable's items.\n */\n InvertibleBloomFilter.from = function (items, errorRate) {\n var array = Array.from(items);\n var filter = InvertibleBloomFilter_1.create(array.length, errorRate);\n array.forEach(function (item) { return filter.add(item); });\n return filter;\n };\n Object.defineProperty(InvertibleBloomFilter.prototype, \"hashCount\", {\n /**\n * Return the number of hash functions used\n * @return {Number}\n */\n get: function () {\n return this._hashCount;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(InvertibleBloomFilter.prototype, \"size\", {\n /**\n * Get the number of cells of the filter\n */\n get: function () {\n return this._size;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(InvertibleBloomFilter.prototype, \"length\", {\n /**\n * Get the number of elements added in the filter\n * Complexity in time: O(alpha*d)\n */\n get: function () {\n return this._elements.reduce(function (a, b) { return a + b.count; }, 0) / this._hashCount;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(InvertibleBloomFilter.prototype, \"elements\", {\n /**\n * Return the cells used to store elements in this InvertibleBloomFilter\n */\n get: function () {\n return this._elements;\n },\n enumerable: true,\n configurable: true\n });\n /**\n * Add an element to the InvertibleBloomFilter\n * @param element - The element to insert\n */\n InvertibleBloomFilter.prototype.add = function (element) {\n var hashes = utils_1.allInOneHashTwice(JSON.stringify(element.toJSON()), this.seed);\n var indexes = utils_1.getDistinctIndices(hashes.string.first, this._size, this._hashCount, this.seed);\n for (var i = 0; i < this._hashCount; ++i) {\n this._elements[indexes[i]].add(element, buffer_1.Buffer.from(hashes.string.first));\n }\n };\n /**\n * Remove an element from the filter\n * @param element - The element to remove\n * @return True if the element has been removed, False otheriwse\n */\n InvertibleBloomFilter.prototype.remove = function (element) {\n var hashes = utils_1.allInOneHashTwice(JSON.stringify(element.toJSON()), this.seed);\n var indexes = utils_1.getDistinctIndices(hashes.string.first, this.size, this._hashCount, this.seed);\n for (var i = 0; i < this._hashCount; ++i) {\n this._elements[indexes[i]] = this._elements[indexes[i]].xorm(new cell_1.default(buffer_1.Buffer.from(element), buffer_1.Buffer.from(hashes.string.first), 1));\n }\n return true;\n };\n /**\n * Test if an item is in the filter.\n * @param element - The element to test\n * @return False if the element is not in the filter, true if \"may be\" in the filter.\n */\n InvertibleBloomFilter.prototype.has = function (element) {\n var hashes = utils_1.allInOneHashTwice(JSON.stringify(element.toJSON()), this.seed);\n var indexes = utils_1.getDistinctIndices(hashes.string.first, this.size, this._hashCount, this.seed);\n for (var i = 0; i < this._hashCount; ++i) {\n if (this._elements[indexes[i]].count === 0) {\n return false;\n }\n else if (this._elements[indexes[i]].count === 1) {\n if (this._elements[indexes[i]].idSum.equals(element)) {\n return true;\n }\n else {\n return false;\n }\n }\n }\n return true;\n };\n /**\n * List all entries from the filter using a Generator.\n * The generator ends with True if the operation has not failed, False otheriwse.\n * It is not recommended to modify an IBLT while listing its entries!\n * @return A generator that yields all filter's entries.\n */\n InvertibleBloomFilter.prototype.listEntries = function () {\n var that = this;\n var seenBefore = [];\n return function () {\n var _loop_1, index, state_1;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n _loop_1 = function (index) {\n var localCell;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n localCell = that._elements[index];\n if (!(localCell.count > 0 && seenBefore.findIndex(function (b) { return b.equals(localCell.idSum); }) === -1)) return [3 /*break*/, 3];\n if (!that.has(localCell.idSum)) return [3 /*break*/, 2];\n seenBefore.push(localCell.idSum);\n return [4 /*yield*/, localCell.idSum];\n case 1:\n _a.sent();\n return [3 /*break*/, 3];\n case 2: return [2 /*return*/, { value: false }];\n case 3: return [2 /*return*/];\n }\n });\n };\n index = 0;\n _a.label = 1;\n case 1:\n if (!(index < that._elements.length - 1)) return [3 /*break*/, 4];\n return [5 /*yield**/, _loop_1(index)];\n case 2:\n state_1 = _a.sent();\n if (typeof state_1 === \"object\")\n return [2 /*return*/, state_1.value];\n _a.label = 3;\n case 3:\n index++;\n return [3 /*break*/, 1];\n case 4: return [2 /*return*/, true];\n }\n });\n }();\n };\n /**\n * Substract the filter with another {@link InvertibleBloomFilter}, and returns the resulting filter.\n * @param remote - The filter to substract with\n * @return A new InvertibleBloomFilter which is the XOR of the local and remote one\n */\n InvertibleBloomFilter.prototype.substract = function (iblt) {\n if (this.size !== iblt.size) {\n throw new Error('The two Invertible Bloom Filters must be of the same size');\n }\n var res = new InvertibleBloomFilter_1(iblt._size, iblt._hashCount);\n res.seed = this.seed;\n for (var i = 0; i < this.size; ++i) {\n res._elements[i] = this._elements[i].xorm(iblt._elements[i]);\n }\n return res;\n };\n /**\n * Test if two InvertibleBloomFilters are equals\n * @param iblt - The filter to compare with\n * @return True if the two filters are equals, False otherwise\n */\n InvertibleBloomFilter.prototype.equals = function (iblt) {\n if (iblt._size !== this._size || iblt._hashCount !== this._hashCount || iblt.seed !== this.seed) {\n return false;\n }\n else {\n for (var i = 0; i < iblt._elements.length; ++i) {\n if (!iblt._elements[i].equals(this._elements[i])) {\n return false;\n }\n }\n return true;\n }\n };\n /**\n * Decode an InvertibleBloomFilter based on its substracted version\n * @return The results of the deconding process\n */\n InvertibleBloomFilter.prototype.decode = function (additional, missing) {\n if (additional === void 0) { additional = []; }\n if (missing === void 0) { missing = []; }\n var pureList = [];\n var cell = null;\n // checking for all pure cells\n for (var i = 0; i < this._elements.length; ++i) {\n cell = this._elements[i];\n if (cell.isPure()) {\n pureList.push(i);\n }\n }\n while (pureList.length !== 0) {\n cell = this._elements[pureList.pop()];\n var id = cell.idSum;\n var c = cell.count;\n if (cell.isPure()) {\n if (c === 1) {\n additional.push(id);\n }\n else if (c === -1) {\n missing.push(id);\n }\n else {\n throw new Error('Please report, not possible');\n }\n var hashes = utils_1.allInOneHashTwice(JSON.stringify(id.toJSON()), this.seed);\n var indexes = utils_1.getDistinctIndices(hashes.string.first, this._size, this._hashCount, this.seed);\n for (var i = 0; i < indexes.length; ++i) {\n this._elements[indexes[i]] = this._elements[indexes[i]].xorm(new cell_1.default(id, buffer_1.Buffer.from(hashes.string.first), c));\n if (this._elements[indexes[i]].isPure()) {\n pureList.push(indexes[i]);\n }\n }\n }\n }\n if (this._elements.findIndex(function (e) { return !e.isEmpty(); }) > -1) {\n return {\n success: false,\n reason: {\n cell: cell,\n iblt: this\n },\n additional: additional,\n missing: missing\n };\n }\n else {\n return {\n success: true,\n additional: additional,\n missing: missing\n };\n }\n };\n var InvertibleBloomFilter_1;\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], InvertibleBloomFilter.prototype, \"_size\", void 0);\n __decorate([\n exportable_1.Field(),\n __metadata(\"design:type\", Number)\n ], InvertibleBloomFilter.prototype, \"_hashCount\", void 0);\n __decorate([\n exportable_1.Field(undefined, function (json) {\n return json.map(function (elt) {\n var c = new cell_1.default(buffer_1.Buffer.from(elt._idSum), buffer_1.Buffer.from(elt._hashSum), elt._count);\n c.seed = elt._seed;\n return c;\n });\n }),\n __metadata(\"design:type\", Array)\n ], InvertibleBloomFilter.prototype, \"_elements\", void 0);\n InvertibleBloomFilter = InvertibleBloomFilter_1 = __decorate([\n exportable_1.AutoExportable('InvertibleBloomFilter', ['_seed']),\n __param(0, exportable_1.Parameter('_size')), __param(1, exportable_1.Parameter('_hashCount')),\n __metadata(\"design:paramtypes\", [Number, Number])\n ], InvertibleBloomFilter);\n return InvertibleBloomFilter;\n}(base_filter_1.default));\nexports.default = InvertibleBloomFilter;\n", "/* file : api.ts\nMIT License\n\nCopyright (c) 2017-2020 Thomas Minier & Arnaud Grall\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 all\ncopies 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 THE\nSOFTWARE.\n*/\n'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar bloom_filter_1 = require(\"./bloom/bloom-filter\");\nexports.BloomFilter = bloom_filter_1.default;\nvar counting_bloom_filter_1 = require(\"./bloom/counting-bloom-filter\");\nexports.CountingBloomFilter = counting_bloom_filter_1.default;\nvar partitioned_bloom_filter_1 = require(\"./bloom/partitioned-bloom-filter\");\nexports.PartitionedBloomFilter = partitioned_bloom_filter_1.default;\nvar count_min_sketch_1 = require(\"./sketch/count-min-sketch\");\nexports.CountMinSketch = count_min_sketch_1.default;\nvar hyperloglog_1 = require(\"./sketch/hyperloglog\");\nexports.HyperLogLog = hyperloglog_1.default;\nvar topk_1 = require(\"./sketch/topk\");\nexports.TopK = topk_1.default;\nvar min_hash_1 = require(\"./sketch/min-hash\");\nexports.MinHash = min_hash_1.MinHash;\nvar min_hash_factory_1 = require(\"./sketch/min-hash-factory\");\nexports.MinHashFactory = min_hash_factory_1.default;\nvar cuckoo_filter_1 = require(\"./cuckoo/cuckoo-filter\");\nexports.CuckooFilter = cuckoo_filter_1.default;\nvar invertible_bloom_lookup_tables_1 = require(\"./iblt/invertible-bloom-lookup-tables\");\nexports.InvertibleBloomFilter = invertible_bloom_lookup_tables_1.default;\nvar cell_1 = require(\"./iblt/cell\");\nexports.Cell = cell_1.default;\n", "import localforage from 'localforage'\n\nimport * as common from './common/index'\nimport * as identifiers from './common/identifiers'\nimport * as ipfs from './ipfs/index'\nimport * as pathing from './path'\nimport * as crypto from './crypto/index'\nimport * as storage from './storage/index'\nimport * as ucan from './ucan/internal'\nimport * as ucanPermissions from './ucan/permissions'\nimport { setup } from './setup/internal'\nimport * as did from './did/index'\n\nimport { USERNAME_STORAGE_KEY, Maybe } from './common/index'\nimport { Permissions } from './ucan/permissions'\nimport { loadFileSystem } from './filesystem'\n\nimport FileSystem from './fs/index'\n\n\n// SCENARIO\n\n\nexport enum Scenario {\n NotAuthorised = \"NOT_AUTHORISED\",\n AuthSucceeded = \"AUTH_SUCCEEDED\",\n AuthCancelled = \"AUTH_CANCELLED\",\n Continuation = \"CONTINUATION\"\n}\n\n\n\n// STATE\n\n\nexport type State\n = NotAuthorised\n | AuthSucceeded\n | AuthCancelled\n | Continuation\n\nexport type NotAuthorised = {\n scenario: Scenario.NotAuthorised\n permissions: Maybe<Permissions>\n\n authenticated: false\n}\n\nexport type AuthSucceeded = {\n scenario: Scenario.AuthSucceeded\n permissions: Maybe<Permissions>\n\n authenticated: true\n newUser: boolean\n throughLobby: true\n username: string\n\n fs?: FileSystem\n}\n\nexport type AuthCancelled = {\n scenario: Scenario.AuthCancelled\n permissions: Maybe<Permissions>\n\n authenticated: false\n cancellationReason: string\n throughLobby: true\n}\n\nexport type Continuation = {\n scenario: Scenario.Continuation\n permissions: Maybe<Permissions>\n\n authenticated: true\n newUser: false\n throughLobby: false\n username: string\n\n fs?: FileSystem\n}\n\n\n\n// ERRORS\n\n\n/**\n * Initialisation error\n */\nexport enum InitialisationError {\n InsecureContext = \"INSECURE_CONTEXT\",\n UnsupportedBrowser = \"UNSUPPORTED_BROWSER\"\n}\n\n\n\n// INTIALISE\n\n\n/**\n * Check if we're authenticated, process any lobby query-parameters present in the URL,\n * and initiate the user's file system if authenticated (can be disabled).\n *\n * See `loadFileSystem` if you want to load the user's file system yourself.\n * NOTE: Only works on the main/ui thread, as it uses `window.location`.\n */\nexport async function initialise(\n options: {\n permissions?: Permissions\n\n // Options\n autoRemoveUrlParams?: boolean\n loadFileSystem?: boolean\n rootKey?: string\n }\n): Promise<State> {\n options = options || {}\n\n const permissions = options.permissions || null\n const { autoRemoveUrlParams = true, rootKey } = options\n\n const maybeLoadFs = async (username: string): Promise<undefined | FileSystem> => {\n return options.loadFileSystem === false\n ? undefined\n : await loadFileSystem(permissions, username, rootKey)\n }\n\n // Check if browser is supported\n if (globalThis.isSecureContext === false) throw InitialisationError.InsecureContext\n if (await isSupported() === false) throw InitialisationError.UnsupportedBrowser\n\n // URL things\n const url = new URL(window.location.href)\n const authorised = url.searchParams.get(\"authorised\")\n const cancellation = url.searchParams.get(\"cancelled\")\n\n // Determine scenario\n if (authorised) {\n const newUser = url.searchParams.get(\"newUser\") === \"t\"\n const username = url.searchParams.get(\"username\") || \"\"\n\n await importClassifiedInfo(\n authorised === \"via-postmessage\"\n ? await getClassifiedViaPostMessage()\n : await ipfs.cat(authorised) // in any other case we expect it to be a CID\n )\n\n await storage.setItem(USERNAME_STORAGE_KEY, username)\n\n if (autoRemoveUrlParams) {\n url.searchParams.delete(\"authorised\")\n url.searchParams.delete(\"newUser\")\n url.searchParams.delete(\"username\")\n history.replaceState(null, document.title, url.toString())\n }\n\n if (permissions && await validateSecrets(permissions) === false) {\n console.warn(\"Unable to validate filesystem secrets\")\n return scenarioNotAuthorised(permissions)\n }\n\n if (permissions && ucan.validatePermissions(permissions, username) === false) {\n console.warn(\"Unable to validate UCAN permissions\")\n return scenarioNotAuthorised(permissions)\n }\n\n return scenarioAuthSucceeded(\n permissions,\n newUser,\n username,\n await maybeLoadFs(username)\n )\n\n } else if (cancellation) {\n const c = (() => {\n switch (cancellation) {\n case \"DENIED\": return \"User denied authorisation\"\n default: return \"Unknown reason\"\n }\n })()\n\n return scenarioAuthCancelled(permissions, c)\n\n } else {\n // trigger build for internal ucan dictionary\n await ucan.store([])\n\n }\n\n const authedUsername = await common.authenticatedUsername()\n\n if (authedUsername && permissions) {\n const validSecrets = await validateSecrets(permissions)\n const validUcans = ucan.validatePermissions(permissions, authedUsername)\n\n if (validSecrets && validUcans) {\n return scenarioContinuation(permissions, authedUsername, await maybeLoadFs(authedUsername))\n } else {\n return scenarioNotAuthorised(permissions)\n }\n\n } else if (authedUsername) {\n return scenarioContinuation(permissions, authedUsername, await maybeLoadFs(authedUsername))\n\n } else {\n return scenarioNotAuthorised(permissions)\n\n }\n}\n\n\n/**\n * Alias for `initialise`.\n */\nexport { initialise as initialize }\n\n\n\n// SUPPORTED\n\n\nexport async function isSupported(): Promise<boolean> {\n return localforage.supports(localforage.INDEXEDDB)\n\n // Firefox in private mode can't use indexedDB properly,\n // so we test if we can actually make a database.\n && await (() => new Promise(resolve => {\n const db = indexedDB.open(\"testDatabase\")\n db.onsuccess = () => resolve(true)\n db.onerror = () => resolve(false)\n }))() as boolean\n}\n\n\n\n// EXPORT\n\n\nexport * from './auth'\nexport * from './filesystem'\nexport * from './common/version'\n\nexport const fs = FileSystem\n\nexport * as apps from './apps/index'\nexport * as dataRoot from './data-root'\nexport * as did from './did/index'\nexport * as errors from './errors'\nexport * as lobby from './lobby/index'\nexport * as path from './path'\nexport * as setup from './setup'\nexport * as ucan from './ucan/index'\n\nexport * as dns from './dns/index'\nexport * as ipfs from './ipfs/index'\nexport * as keystore from './keystore'\nexport * as machinery from './common/index'\nexport * as crypto from './crypto/index'\nexport * as cbor from 'cborg'\n\n\n\n// \u3299\uFE0F \u269B SCENARIOS\n\n\nfunction scenarioAuthSucceeded(\n permissions: Maybe<Permissions>,\n newUser: boolean,\n username: string,\n fs: FileSystem | undefined\n): AuthSucceeded {\n return {\n scenario: Scenario.AuthSucceeded,\n permissions,\n\n authenticated: true,\n throughLobby: true,\n fs,\n newUser,\n username\n }\n}\n\nfunction scenarioAuthCancelled(\n permissions: Maybe<Permissions>,\n cancellationReason: string\n): AuthCancelled {\n return {\n scenario: Scenario.AuthCancelled,\n permissions,\n\n authenticated: false,\n throughLobby: true,\n cancellationReason\n }\n}\n\nfunction scenarioContinuation(\n permissions: Maybe<Permissions>,\n username: string,\n fs: FileSystem | undefined\n): Continuation {\n return {\n scenario: Scenario.Continuation,\n permissions,\n\n authenticated: true,\n newUser: false,\n throughLobby: false,\n fs,\n username\n }\n}\n\nfunction scenarioNotAuthorised(\n permissions: Maybe<Permissions>\n): NotAuthorised {\n return {\n scenario: Scenario.NotAuthorised,\n permissions,\n\n authenticated: false\n }\n}\n\n\n\n// \u3299\uFE0F\n\ninterface AuthLobbyClassifiedInfo {\n sessionKey: string\n secrets: string\n iv: string\n}\n\n\nasync function importClassifiedInfo(\n classified : string\n): Promise<void> {\n const info: AuthLobbyClassifiedInfo = JSON.parse(classified)\n\n // Extract session key and its iv\n const rawSessionKey = await crypto.keystore.decrypt(info.sessionKey)\n\n // Decrypt secrets\n const secretsStr = await crypto.aes.decryptGCM(info.secrets, rawSessionKey, info.iv)\n const secrets = JSON.parse(secretsStr)\n\n const fsSecrets: Record<string, { key: string; bareNameFilter: string }> = secrets.fs\n const ucans = secrets.ucans\n\n // Import read keys and bare name filters\n await Promise.all(\n Object.entries(fsSecrets).map(async ([posixPath, { bareNameFilter, key }]) => {\n const path = pathing.fromPosix(posixPath)\n const readKeyId = await identifiers.readKey({ path })\n const bareNameFilterId = await identifiers.bareNameFilter({ path })\n\n await crypto.keystore.importSymmKey(key, readKeyId)\n await storage.setItem(bareNameFilterId, bareNameFilter)\n })\n )\n\n // Add UCANs to the storage\n await ucan.store(ucans)\n}\n\nasync function getClassifiedViaPostMessage(): Promise<string> {\n const iframe: HTMLIFrameElement = await new Promise(resolve => {\n const iframe = document.createElement(\"iframe\")\n iframe.id = \"webnative-secret-exchange\"\n iframe.style.width = \"0\"\n iframe.style.height = \"0\"\n iframe.style.border = \"none\"\n iframe.style.display = \"none\"\n document.body.appendChild(iframe)\n\n iframe.onload = () => {\n resolve(iframe)\n }\n\n iframe.src = `${setup.endpoints.lobby}/exchange.html`\n })\n\n try {\n\n const answer: Promise<string> = new Promise((resolve, reject) => {\n window.addEventListener(\"message\", listen)\n\n function listen(event: MessageEvent<string>) {\n window.removeEventListener(\"message\", listen)\n if (event.data) {\n resolve(event.data)\n } else {\n reject(new Error(\"Can't import UCANs & readKey(s): Missing data\"))\n }\n }\n })\n\n if (iframe.contentWindow == null) throw new Error(\"Can't import UCANs & readKey(s): No access to its contentWindow\")\n const message = {\n webnative: \"exchange-secrets\",\n didExchange: await did.exchange()\n }\n iframe.contentWindow.postMessage(message, iframe.src)\n\n return await answer\n\n } finally {\n document.body.removeChild(iframe)\n }\n}\n\nasync function validateSecrets(permissions: Permissions): Promise<boolean> {\n return ucanPermissions.paths(permissions).reduce(\n (acc, path) => acc.then(async bool => {\n if (bool === false) return bool\n if (pathing.isBranch(pathing.Branch.Public, path)) return bool\n\n const keyName = await identifiers.readKey({ path })\n return await crypto.keystore.keyExists(keyName)\n }),\n Promise.resolve(true)\n )\n}\n", "import * as api from './api'\nimport * as arrbufs from './arrbufs'\nimport * as base64 from './base64'\nimport * as blob from './blob'\nimport * as storage from '../storage/index'\n\nexport * from './types'\nexport * from './type-checks'\nexport * from './util'\nexport * from './version'\nexport * from './browser'\nexport { api, arrbufs, base64, blob }\n\nexport const UCANS_STORAGE_KEY = \"webnative.auth_ucans\"\nexport const USERNAME_STORAGE_KEY = \"webnative.auth_username\"\n\n\n/**\n * Retrieve the authenticated username.\n */\nexport async function authenticatedUsername(): Promise<string | null> {\n return storage.getItem(USERNAME_STORAGE_KEY).then((u: unknown) => u ? u as string : null)\n}\n", "import * as dns from '../dns/index'\nimport { setup } from '../setup/internal'\n\n\nconst didCache: {\n did: string | null\n host: string | null\n lastFetched: number\n} = {\n did: null,\n host: null,\n lastFetched: 0,\n}\n\n\n/**\n * Lookup the DID of a Fission API.\n * This function caches the DID for 3 hours.\n */\nexport async function did(): Promise<string> {\n const host = setup.endpoints.api.replace(/^https?:\\/\\//, '').replace(/\\/$/, '')\n const now = Date.now() // in milliseconds\n\n if (\n didCache.host !== host ||\n didCache.lastFetched + 1000 * 60 * 60 * 3 <= now\n ) {\n didCache.did = await dns.lookupTxtRecord('_did.' + host)\n didCache.host = host\n didCache.lastFetched = now\n }\n\n if (!didCache.did) throw new Error(\"Couldn't get the Fission API DID\")\n return didCache.did\n}\n", "import { race } from '../common/async'\n\n/**\n * Lookup a DNS TXT record.\n *\n * Race lookups to Google & Cloudflare, return the first to finish\n *\n * @param domain The domain to get the TXT record from.\n * @returns Contents of the TXT record.\n */\nexport async function lookupTxtRecord(domain: string): Promise<string | null> {\n return race([\n googleLookup(domain),\n cloudflareLookup(domain)\n ])\n}\n\n/**\n * Lookup DNS TXT record using Google DNS-over-HTTPS\n * \n * @param domain The domain to get the TXT record from.\n * @returns Contents of the TXT record.\n */ \nexport async function googleLookup(domain: string): Promise<string | null> {\n return dnsOverHttps(`https://dns.google/resolve?name=${domain}&type=txt`)\n}\n\n/**\n * Lookup DNS TXT record using Cloudflare DNS-over-HTTPS\n * \n * @param domain The domain to get the TXT record from.\n * @returns Contents of the TXT record.\n */ \nexport function cloudflareLookup(domain: string): Promise<string| null> {\n return dnsOverHttps(`https://cloudflare-dns.com/dns-query?name=${domain}&type=txt`)\n}\n\n/**\n * Lookup a DNS TXT record.\n *\n * If there are multiple records, they will be joined together.\n * Records are sorted by a decimal prefix before they are joined together.\n * Prefixes have a format of `001;` \u2192 `999;`\n *\n * @param url The DNS-over-HTTPS endpoint to hit.\n * @returns Contents of the TXT record.\n */\nexport function dnsOverHttps(url: string): Promise<string | null> {\n return fetch(url, {\n headers: {\n \"accept\": \"application/dns-json\"\n }\n })\n .then(r => r.json())\n .then(r => {\n if (r.Answer) {\n // Remove double-quotes from beginning and end of the resulting string (if present)\n const answers: Array<string> = r.Answer.map((a: { data: string }) => {\n return (a.data || \"\").replace(/^\"+|\"+$/g, \"\")\n })\n\n // Sort by prefix, if prefix is present,\n // and then add the answers together as one string.\n if (answers[0][3] === \";\") {\n return answers\n .sort((a, b) => a.slice(0, 4).localeCompare(b.slice(0, 4)))\n .map(a => a.slice(4))\n .join(\"\")\n\n } else {\n return answers.join(\"\")\n\n }\n\n } else {\n return null\n\n }\n })\n}\n\n/**\n * Lookup a DNSLink.\n *\n * @param domain The domain to get the DNSLink from.\n * @returns Contents of the DNSLink with the \"ipfs/\" prefix removed.\n */\nexport async function lookupDnsLink(domain: string): Promise<string | null> {\n const txt = await lookupTxtRecord(\n domain.startsWith(\"_dnslink.\")\n ? domain\n : `_dnslink.${domain}`\n )\n\n return txt && !txt.includes(\"/ipns/\")\n ? txt.replace(/^dnslink=/, \"\").replace(/^\\/ipfs\\//, \"\")\n : null\n}\n", "/**\n * Race an array of promises, returning whichever finishes first\n */\nexport function race <T>(promises: Promise<T>[]): Promise<T> {\n return new Promise((resolve, reject) => {\n for(const promise of promises)\n promise.then(resolve, reject)\n })\n}\n", "export type Endpoints = {\n api: string\n lobby: string\n user: string\n}\n\n\n/**\n * @internal\n */\nexport const setup = {\n debug: false,\n\n endpoints: {\n api: \"https://runfission.com\",\n lobby: \"https://auth.fission.codes\",\n user: \"fission.name\"\n }\n}\n", "export const equal = (aBuf: ArrayBuffer, bBuf: ArrayBuffer): boolean => {\n const a = new Uint8Array(aBuf)\n const b = new Uint8Array(bBuf)\n if (a.length !== b.length) return false\n for (let i = 0; i < a.length; i++) {\n if (a[i] !== b[i]) return false\n }\n return true\n}\n", "import { Buffer } from 'buffer'\n\nexport function decode(base64: string): string {\n return Buffer.from(base64, 'base64').toString('binary')\n}\n\nexport function encode(str: string): string {\n return Buffer.from(str, 'binary').toString('base64')\n}\n\nexport function urlDecode(base64: string): string {\n return decode(makeUrlUnsafe(base64))\n}\n\nexport function urlEncode(str: string): string {\n return makeUrlSafe(encode(str))\n}\n\nexport function makeUrlSafe(a: string): string {\n return a.replace(/\\//g, \"_\").replace(/\\+/g, \"-\").replace(/=+$/, \"\")\n}\n\nexport function makeUrlUnsafe(a: string): string {\n return a.replace(/_/g, \"/\").replace(/-/g, \"+\")\n}\n", "import { Buffer } from 'buffer'\n\nexport const toBuffer = async (blob: Blob): Promise<Buffer> => {\n return new Promise((resolve, reject) => {\n const fail: (() => void) = () => reject(new Error(\"Failed to read file\"))\n const reader = new FileReader()\n reader.addEventListener('load', (e) => {\n const arrbuf = e?.target?.result || null\n if (arrbuf === null) {\n fail()\n }\n resolve(Buffer.from(arrbuf as ArrayBuffer))\n })\n reader.addEventListener('error', () => reader.abort())\n reader.addEventListener('abort', fail)\n reader.readAsArrayBuffer(blob)\n })\n}\n", "import * as ed25519 from 'noble-ed25519'\nimport rsaOperations from 'keystore-idb/rsa/index'\nimport utils from 'keystore-idb/utils'\nimport aes from 'keystore-idb/aes/index'\nimport { CharSize, SymmKeyLength } from 'keystore-idb/types'\n\nimport { assertBrowser } from '../common/browser'\nimport * as keystore from '../keystore'\n\n\nexport const encrypt = async (data: Uint8Array, keyStr: string): Promise<Uint8Array> => {\n assertBrowser('aes.encrypt')\n const key = await aes.importKey(keyStr, { length: SymmKeyLength.B256 })\n const encrypted = await aes.encryptBytes(data.buffer, key)\n return new Uint8Array(encrypted)\n}\n\nexport const decrypt = async (encrypted: Uint8Array, keyStr: string): Promise<Uint8Array> => {\n assertBrowser('aes.decrypt')\n const key = await aes.importKey(keyStr, { length: SymmKeyLength.B256 })\n const decryptedBuf = await aes.decryptBytes(encrypted.buffer, key)\n return new Uint8Array(decryptedBuf)\n}\n\nexport const genKeyStr = async (): Promise<string> => {\n assertBrowser('aes.genKeyStr')\n const key = await aes.makeKey({ length: SymmKeyLength.B256 })\n return aes.exportKey(key)\n}\n\nexport const decryptGCM = async (encrypted: string, keyStr: string, ivStr: string): Promise<string> => {\n assertBrowser('aes.decryptGCM')\n const iv = utils.base64ToArrBuf(ivStr)\n const sessionKey = await crypto.subtle.importKey(\n \"raw\",\n utils.base64ToArrBuf(keyStr),\n \"AES-GCM\",\n false,\n [ \"encrypt\", \"decrypt\" ]\n )\n\n // Decrypt secrets\n const decrypted = await crypto.subtle.decrypt(\n {\n name: \"AES-GCM\",\n iv: iv\n },\n sessionKey,\n utils.base64ToArrBuf(encrypted)\n )\n return utils.arrBufToStr(decrypted, CharSize.B8)\n}\n\nexport const sha256 = async (bytes: Uint8Array): Promise<Uint8Array> => {\n assertBrowser('hash.sha256')\n const buf = bytes.buffer\n const hash = await crypto.subtle.digest('SHA-256', buf)\n return new Uint8Array(hash)\n}\n\nexport const rsaVerify = (message: Uint8Array, signature: Uint8Array, publicKey: Uint8Array): Promise<boolean> => {\n assertBrowser('rsa.verify')\n const keyStr = utils.arrBufToBase64(publicKey.buffer)\n return rsaOperations.verify(message, signature, keyStr)\n}\n\nexport const ed25519Verify = (message: Uint8Array, signature: Uint8Array, publicKey: Uint8Array): Promise<boolean> => {\n return ed25519.verify(signature, message, publicKey)\n}\n\nexport const ksPublicReadKey = async (): Promise<string> => {\n assertBrowser('keystore.publicReadKey')\n const ks = await keystore.get()\n return ks.publicReadKey()\n}\n\nexport const ksPublicWriteKey = async (): Promise<string> => {\n assertBrowser('keystore.publicWriteKey')\n const ks = await keystore.get()\n return ks.publicWriteKey()\n}\n\nexport const ksDecrypt = async (encrypted: string): Promise<string> => {\n assertBrowser('keystore.decrypt')\n const ks = await keystore.get()\n return ks.decrypt(encrypted)\n}\n\nexport const ksSign = async (message: string, charSize: number): Promise<string> => {\n assertBrowser('keystore.sign')\n const ks = await keystore.get()\n return ks.sign(message, { charSize })\n}\n\nexport const ksImportSymmKey = async (key: string, name: string): Promise<void> => {\n assertBrowser('keystore.importSymmKey')\n const ks = await keystore.get()\n return ks.importSymmKey(key, name)\n}\n\nexport const ksExportSymmKey = async (name: string): Promise<string> => {\n assertBrowser('keystore.exportSymmKey')\n const ks = await keystore.get()\n return ks.exportSymmKey(name)\n}\n\nexport const ksKeyExists = async (name:string): Promise<boolean> => {\n assertBrowser('keystore.keyExists')\n const ks = await keystore.get()\n return ks.keyExists(name)\n}\n\nexport const ksGetAlg = async (): Promise<string> => {\n assertBrowser('keystore.getAlg')\n const ks = await keystore.get()\n return ks.cfg.type\n}\n\nexport const ksClear = async (): Promise<void> => {\n assertBrowser('keystore.clear')\n return keystore.clear()\n}\n", "export const isBrowser = typeof self !== \"undefined\" && typeof self.location === \"object\"\n\nexport const assertBrowser = (method: string): void => {\n if (!isBrowser) {\n throw new Error(`Must be in browser to use method. Provide a node-compatible implementation for ${method}`)\n }\n}\n", "import keystore from 'keystore-idb'\nimport RSAKeyStore from 'keystore-idb/rsa/keystore'\nimport { CryptoSystem } from 'keystore-idb/types'\n\nconst KEYSTORE_CFG = { type: CryptoSystem.RSA }\n\n\nlet ks: RSAKeyStore | null = null\n\n\nexport const clear = async (): Promise<void> => {\n ks = await get()\n await ks.destroy()\n ks = null\n}\n\nexport const create = async (): Promise<RSAKeyStore> => {\n return (await keystore.init(KEYSTORE_CFG)) as RSAKeyStore\n}\n\nexport const set = async (userKeystore: RSAKeyStore): Promise<void> => {\n ks = userKeystore\n}\n\nexport const get = async (): Promise<RSAKeyStore> => {\n if (ks) return ks\n ks = (await keystore.init(KEYSTORE_CFG)) as RSAKeyStore\n return ks\n}\n", "import localforage from 'localforage'\nimport { assertBrowser } from '../common/browser'\n\nexport const getItem = <T>(key: string): Promise<T | null> => {\n assertBrowser('storage.getItem')\n return localforage.getItem(key)\n}\n\nexport const setItem = <T>(key: string, val: T): Promise<T> => {\n assertBrowser('storage.setItem')\n return localforage.setItem(key, val)\n}\n\nexport const removeItem = (key: string): Promise<void> => {\n assertBrowser('storage.removeItem')\n return localforage.removeItem(key)\n}\n\nexport const clear = (): Promise<void> => {\n assertBrowser('storage.clear')\n return localforage.clear()\n}\n\n", "import * as browserCrypto from '../crypto/browser'\nimport * as browserStorage from '../storage/browser'\n\nexport const DEFAULT_IMPLEMENTATION: Dependencies = { \n hash: {\n sha256: browserCrypto.sha256\n },\n aes: {\n encrypt: browserCrypto.encrypt,\n decrypt: browserCrypto.decrypt,\n genKeyStr: browserCrypto.genKeyStr,\n decryptGCM: browserCrypto.decryptGCM,\n },\n rsa: {\n verify: browserCrypto.rsaVerify\n },\n ed25519: {\n verify: browserCrypto.ed25519Verify\n },\n keystore: {\n publicReadKey: browserCrypto.ksPublicReadKey,\n publicWriteKey: browserCrypto.ksPublicWriteKey,\n decrypt: browserCrypto.ksDecrypt,\n sign: browserCrypto.ksSign,\n importSymmKey: browserCrypto.ksImportSymmKey,\n exportSymmKey: browserCrypto.ksExportSymmKey,\n keyExists: browserCrypto.ksKeyExists,\n getAlg: browserCrypto.ksGetAlg,\n clear: browserCrypto.ksClear,\n },\n storage: {\n getItem: browserStorage.getItem,\n setItem: browserStorage.setItem,\n removeItem: browserStorage.removeItem,\n clear: browserStorage.clear,\n }\n}\n\nexport let impl: Dependencies = DEFAULT_IMPLEMENTATION\n\nexport const setDependencies = (fns: Partial<Dependencies>): Dependencies => {\n impl = {\n hash: merge(impl.hash, fns.hash),\n aes: merge(impl.aes, fns.aes),\n rsa: merge(impl.rsa, fns.rsa),\n ed25519: merge(impl.ed25519, fns.ed25519),\n keystore: merge(impl.keystore, fns.keystore),\n storage: merge(impl.storage, fns.storage),\n }\n return impl\n}\n\nconst merge = <T>(first: T, second: Partial<T> | undefined): T => {\n return {\n ...first,\n ...(second || {})\n }\n}\n\nexport interface Dependencies {\n hash: {\n sha256: (bytes: Uint8Array) => Promise<Uint8Array>\n }\n aes: {\n encrypt: (bytes: Uint8Array, key: string) => Promise<Uint8Array>\n decrypt: (bytes: Uint8Array, key: string) => Promise<Uint8Array>\n genKeyStr: () => Promise<string>\n decryptGCM: (encrypted: string, keyStr: string, ivStr: string) => Promise<string> \n }\n rsa: {\n verify: (message: Uint8Array, signature: Uint8Array, publicKey: Uint8Array) => Promise<boolean>\n }\n ed25519: {\n verify: (message: Uint8Array, signature: Uint8Array, publicKey: Uint8Array) => Promise<boolean>\n }\n keystore: {\n publicReadKey: () => Promise<string>\n publicWriteKey: () => Promise<string>\n decrypt: (encrypted: string) => Promise<string>\n sign: (message: string, charSize: number) => Promise<string>\n importSymmKey: (key: string, name: string) => Promise<void>\n exportSymmKey: (name: string) => Promise<string>\n keyExists: (keyName:string) => Promise<boolean>\n getAlg: () => Promise<string>\n clear: () => Promise<void>\n }\n storage: {\n getItem: <T>(key: string) => Promise<T | null>\n setItem: <T>(key: string, val: T) => Promise<T>\n removeItem: (key: string) => Promise<void>\n clear: () => Promise<void>\n }\n}\n", "import { impl } from '../setup/dependencies'\n\n\nexport const getItem = <T>(key: string): Promise<T | null> => \n impl.storage.getItem(key)\n\nexport const setItem = <T>(key: string, val: T): Promise<T> => \n impl.storage.setItem(key, val)\n\nexport const removeItem = (key: string): Promise<void> => \n impl.storage.removeItem(key)\n\nexport const clear = (): Promise<void> => \n impl.storage.clear()\n", "export const isDefined = <T>(val: T | undefined): val is T => {\n return val !== undefined\n}\n\nexport const notNull = <T>(val: T | null): val is T => {\n return val !== null\n}\n\nexport const isJust = notNull\n\nexport const isValue = <T>(val: T | undefined | null): val is T => {\n return isDefined(val) && notNull(val)\n}\n\nexport const isBool = (val: unknown): val is boolean => {\n return typeof val === 'boolean'\n}\n\nexport const isNum = (val: unknown): val is number => {\n return typeof val === 'number'\n}\n\nexport const isString = (val: unknown): val is string => {\n return typeof val === 'string'\n}\n\nexport const isObject = <T>(val: unknown): val is Record<string, T> => {\n return val !== null && typeof val === 'object'\n}\n\nexport const isBlob = (val: unknown): val is Blob => {\n if (typeof Blob === 'undefined') return false\n return val instanceof Blob || (isObject(val) && val?.constructor?.name === 'Blob')\n}\n", "import { Maybe } from \"./types\"\n\nexport const removeKeyFromObj = <T> (\n obj: {[key: string]: T},\n key: string\n ): {[key: string]: T} => {\n const { [key]: omit, ...rest } = obj // eslint-disable-line\n return rest\n}\n\nexport const updateOrRemoveKeyFromObj = <T> (\n obj: {[key: string]: T},\n key: string,\n val: Maybe<T>\n ): {[key: string]: T} => (\n val === null\n ? removeKeyFromObj(obj, key)\n : {\n ...obj,\n [key]: val\n }\n)\n\nexport const mapObj = <T, S> (\n obj: {[key: string]: T},\n fn: (val: T, key: string) => S\n ): {[key: string]: S} => {\n const newObj = {} as {[key: string]: S}\n Object.entries(obj).forEach(([key, value]) => {\n newObj[key] = fn(value, key)\n })\n return newObj\n}\n\nexport const mapObjAsync = async <T, S> (\n obj: {[key: string]: T},\n fn: (val: T, key: string) => Promise<S>\n ): Promise<{[key: string]: S}> => {\n const newObj = {} as {[key: string]: S}\n await Promise.all(\n Object.entries(obj).map(async ([key, value]) => {\n newObj[key] = await fn(value, key)\n })\n )\n return newObj\n}\n\nexport const arrContains = <T>(arr: T[], val: T): boolean => {\n return arr.indexOf(val) > -1\n}\n\nexport const asyncWaterfall = async <T>(val: T, operations: ((val: T) => Promise<T>)[]): Promise<T> => {\n let acc = val\n for(let i=0; i<operations.length; i++){\n acc = await operations[i](acc)\n }\n return acc\n}\n", "export const VERSION = \"0.26.0\"\n", "import { strToArrBuf } from 'keystore-idb/utils'\nimport * as hex from '../common/hex'\nimport { impl } from '../setup/dependencies'\n\nexport const sha256Str = async(str: string): Promise<string> => {\n const buf = strToArrBuf(str, 8)\n const arr = new Uint8Array(buf)\n const hash = await impl.hash.sha256(arr)\n return hex.fromBytes(hash)\n}\n\nexport const hash = {\n sha256: (bytes: Uint8Array): Promise<Uint8Array> =>\n impl.hash.sha256(bytes),\n sha256Str: sha256Str\n}\nexport const aes = {\n encrypt: (bytes: Uint8Array, key: string): Promise<Uint8Array> => \n impl.aes.encrypt(bytes, key),\n decrypt: (bytes: Uint8Array, key: string): Promise<Uint8Array> => \n impl.aes.decrypt(bytes, key),\n genKeyStr: (): Promise<string> =>\n impl.aes.genKeyStr(),\n decryptGCM: (encrypted: string, keyStr: string, ivStr: string): Promise<string> =>\n impl.aes.decryptGCM(encrypted, keyStr, ivStr)\n}\n\nexport const rsa = {\n verify: (message: Uint8Array, signature: Uint8Array, publicKey: Uint8Array): Promise<boolean> =>\n impl.rsa.verify(message, signature, publicKey)\n}\nexport const ed25519 = {\n verify: (message: Uint8Array, signature: Uint8Array, publicKey: Uint8Array): Promise<boolean> =>\n impl.ed25519.verify(message, signature, publicKey)\n}\n\nexport const keystore = {\n publicReadKey: (): Promise<string> =>\n impl.keystore.publicReadKey(),\n publicWriteKey: (): Promise<string> =>\n impl.keystore.publicWriteKey(),\n decrypt: (encrypted: string): Promise<string> =>\n impl.keystore.decrypt(encrypted),\n sign: (message: string, charSize: number): Promise<string> =>\n impl.keystore.sign(message, charSize),\n importSymmKey: (key: string, name: string): Promise<void> =>\n impl.keystore.importSymmKey(key, name),\n exportSymmKey: (name: string): Promise<string> =>\n impl.keystore.exportSymmKey(name),\n keyExists: (keyName:string): Promise<boolean> =>\n impl.keystore.keyExists(keyName),\n getAlg: (): Promise<string> =>\n impl.keystore.getAlg(),\n clear: (): Promise<void> =>\n impl.keystore.clear()\n}\n", "export const fromBytes = (bytes: Uint8Array): string => {\n return Array.prototype.map.call(\n bytes, \n x => ('00' + x.toString(16)).slice(-2) // '00' is for left padding\n ).join('')\n}\n\nexport const toBytes = (hex: string): Uint8Array => {\n const arr = new Uint8Array(hex.length/2)\n for(let i=0; i < arr.length; i++) {\n arr[i] = parseInt(hex.slice(i*2, i*2 + 2), 16)\n }\n return arr\n}\n", "import { Maybe } from './common/types'\n\n\nexport enum Branch {\n Public = 'public',\n Pretty = 'p',\n Private = 'private',\n PrivateLog = 'privateLog',\n Version = 'version'\n}\n\nexport enum Kind {\n Directory = \"directory\",\n File = \"file\"\n}\n\nexport type Path = string[]\n\nexport type DirectoryPath = { directory: Path }\nexport type FilePath = { file: Path }\n\n/**\n * The primarily used type for paths.\n */\nexport type DistinctivePath = DirectoryPath | FilePath\n\n\n\n// CREATION\n\n\n/**\n * Utility function to create a `DirectoryPath`\n */\nexport function directory(...args: Path): DirectoryPath {\n if (args.some(p => p.includes(\"/\"))) {\n throw new Error(\"Forward slashes `/` are not allowed\")\n }\n return { directory: args }\n}\n\n/**\n * Utility function to create a `FilePath`\n */\nexport function file(...args: Path): FilePath {\n if (args.some(p => p.includes(\"/\"))) {\n throw new Error(\"Forward slashes `/` are not allowed\")\n }\n return { file: args }\n}\n\n/**\n * Utility function to create a root `DirectoryPath`\n */\nexport function root(): DirectoryPath {\n return { directory: [] }\n}\n\n\n\n// POSIX\n\n\n/**\n * Transform a string into a `DistinctivePath`.\n *\n * Directories should have the format `path/to/dir/` and\n * files should have the format `path/to/file`.\n *\n * Leading forward slashes are removed too, so you can pass absolute paths.\n */\nexport function fromPosix(path: string): DistinctivePath {\n const split = path.replace(/^\\/+/, \"\").split(\"/\")\n if (path.endsWith(\"/\")) return { directory: split.slice(0, -1) }\n else if (path === \"\") return root()\n return { file: split }\n}\n\n/**\n * Transform a `DistinctivePath` into a string.\n *\n * Directories will have the format `path/to/dir/` and\n * files will have the format `path/to/file`.\n */\nexport function toPosix(\n path: DistinctivePath,\n { absolute }: { absolute: boolean } = { absolute: false }\n): string {\n const prefix = absolute ? \"/\" : \"\"\n const joinedPath = unwrap(path).join(\"/\")\n if (isDirectory(path)) return prefix + joinedPath + (joinedPath.length ? \"/\" : \"\")\n return prefix + joinedPath\n}\n\n\n\n// \uD83D\uDEE0\n\n\n/**\n * Combine two `DistinctivePath`s.\n */\nexport function combine(a: DirectoryPath, b: DistinctivePath): DistinctivePath {\n return map(p => unwrap(a).concat(p), b)\n}\n\n/**\n * Is this `DistinctivePath` of the given `Branch`?\n */\nexport function isBranch(branch: Branch, path: DistinctivePath): boolean {\n return unwrap(path)[0] === branch\n}\n\n/**\n * Is this `DistinctivePath` a directory?\n */\nexport function isDirectory(path: DistinctivePath): path is DirectoryPath {\n return !!(path as DirectoryPath).directory\n}\n\n/**\n * Is this `DistinctivePath` a file?\n */\nexport function isFile(path: DistinctivePath): path is FilePath {\n return !!(path as FilePath).file\n}\n\n/**\n * Is this `DirectoryPath` a root directory?\n */\nexport function isRootDirectory(path: DirectoryPath): boolean {\n return path.directory.length === 0\n}\n\n/**\n * Check if two `DistinctivePath` have the same `Branch`.\n */\nexport function isSameBranch(a: DistinctivePath, b: DistinctivePath): boolean {\n return unwrap(a)[0] === unwrap(b)[0]\n}\n\n/**\n * Check if two `DistinctivePath` are of the same kind.\n */\nexport function isSameKind(a: DistinctivePath, b: DistinctivePath): boolean {\n if (isDirectory(a) && isDirectory(b)) return true\n else if (isFile(a) && isFile(b)) return true\n else return false\n}\n\n/**\n * What `Kind` of path are we dealing with?\n */\nexport function kind(path: DistinctivePath): Kind {\n if (isDirectory(path)) return Kind.Directory\n return Kind.File\n}\n\n/**\n * Map a `DistinctivePath`.\n */\nexport function map(fn: (p: Path) => Path, path: DistinctivePath): DistinctivePath {\n if (isDirectory(path)) return { directory: fn(path.directory) }\n else if (isFile(path)) return { file: fn(path.file) }\n return path\n}\n\n/**\n * Get the parent directory of a `DistinctivePath`.\n */\nexport function parent(path: DistinctivePath): Maybe<DirectoryPath> {\n return isDirectory(path) && isRootDirectory(path as DirectoryPath)\n ? null\n : directory(...unwrap(path).slice(0, -1))\n}\n\n/**\n * Remove the `Branch` of a `DistinctivePath` (ie. the top-level directory)\n */\nexport function removeBranch(path: DistinctivePath): DistinctivePath {\n return map(\n p => isDirectory(path) || p.length > 1 ? p.slice(1) : p,\n path\n )\n}\n\n/**\n * Unwrap a `DistinctivePath`.\n */\nexport function unwrap(path: DistinctivePath): Path {\n if (isDirectory(path)) {\n return path.directory\n } else if (isFile(path)) {\n return path.file\n }\n\n return []\n}\n\n\n\n// \u2697\uFE0F\n\n\n/**\n * Render a raw `Path` to a string for logging purposes.\n */\nexport function log(path: Path): string {\n return `[ ${path.join(\", \")} ]`\n}\n", "import { DistinctivePath } from '../path'\nimport * as crypto from '../crypto/index'\n\nimport * as pathing from '../path'\n\n\nexport async function bareNameFilter({ path }: { path: DistinctivePath }): Promise<string> {\n const hash = await crypto.hash.sha256Str(pathToString(path))\n return `wnfs__bareNameFilter__${hash}`\n}\n\nexport async function readKey({ path }: { path: DistinctivePath }): Promise<string> {\n const hash = await crypto.hash.sha256Str(pathToString(path))\n return `wnfs__readKey__${hash}`\n}\n\n\n/**\n * This bit needs to backwards compatible.\n *\n * In webnative version < 0.24, we used to have `readKey({ path: \"/private\" })`\n * for the private root tree (aka. directory).\n */\nfunction pathToString(path: DistinctivePath) {\n return \"/\" + pathing.unwrap(path).join(\"/\")\n}\n", "export * from './types'\nexport * from './config'\nexport * from './basic'\nexport * from './constants'\nexport * as encoded from './encoded'\n", "import IpfsMessagePortClient from 'ipfs-message-port-client'\nimport type { IPFS } from 'ipfs-core'\nimport { setup } from '../setup/internal'\n\n\nlet ipfs: IPFS | null = null\n\n\nexport const set = (userIpfs: unknown): void => {\n ipfs = userIpfs as IPFS\n}\n\nexport const get = async (): Promise<IPFS> => {\n if (!ipfs) {\n const port = await iframe()\n ipfs = IpfsMessagePortClient.from(port) as unknown as IPFS\n }\n return ipfs\n}\n\nexport function iframe(): Promise<MessagePort> {\n return new Promise((resolve, reject) => {\n const iframe = document.createElement(\"iframe\")\n iframe.id = \"webnative-ipfs\"\n iframe.style.width = \"0\"\n iframe.style.height = \"0\"\n iframe.style.border = \"none\"\n iframe.style.display = \"none\"\n document.body.appendChild(iframe)\n\n iframe.onload = () => {\n const channel = new MessageChannel()\n channel.port1.onmessage = ({ ports }) => resolve(ports[0])\n iframe.contentWindow\n ? iframe.contentWindow.postMessage(\"connect\", \"*\", [ channel.port2 ])\n : reject(new Error(\"Don't have access to iframe.contentWindow\"))\n }\n\n iframe.src = `${setup.endpoints.lobby}/ipfs.html`\n })\n}\n", "import { Buffer } from 'buffer'\nimport CIDObj from 'cids'\nimport dagPB, { DAGLink, DAGNode } from 'ipld-dag-pb'\nimport type { IPFSEntry } from 'ipfs-core-types/src/root'\nimport type { ImportCandidate } from 'ipfs-core-types/src/utils'\n\nimport { get as getIpfs } from './config'\nimport { CID, AddResult } from './types'\nimport * as util from './util'\nimport { DAG_NODE_DATA } from './constants'\n\n\nexport const add = async (content: ImportCandidate): Promise<AddResult> => {\n const ipfs = await getIpfs()\n const result = await ipfs.add(content, { cidVersion: 1, pin: true })\n\n return {\n cid: result.cid.toString(),\n size: result.size,\n isFile: true\n }\n}\n\nexport const catRaw = async (cid: CID): Promise<Uint8Array[]> => {\n const ipfs = await getIpfs()\n const chunks = []\n await attemptPin(cid)\n for await (const chunk of ipfs.cat(cid)) {\n chunks.push(chunk)\n }\n return chunks\n}\n\nexport const catBuf = async (cid: CID): Promise<Uint8Array> => {\n const raw = await catRaw(cid)\n return Buffer.concat(raw)\n}\n\nexport const cat = async (cid: CID): Promise<string> => {\n const buf = await catBuf(cid)\n return buf.toString()\n}\n\nexport const ls = async (cid: CID): Promise<IPFSEntry[]> => {\n const ipfs = await getIpfs()\n const links = []\n for await (const link of ipfs.ls(cid)) {\n links.push(link)\n }\n return links\n}\n\nexport const dagGet = async (cid: CID): Promise<DAGNode> => {\n const ipfs = await getIpfs()\n await attemptPin(cid)\n const raw = await ipfs.dag.get(new CIDObj(cid))\n const node = util.rawToDAGNode(raw)\n return node\n}\n\nexport const dagPut = async (node: DAGNode): Promise<AddResult> => {\n const ipfs = await getIpfs()\n // using this format because Gateway doesn't like `dag-cbor` nodes.\n // I think this is because UnixFS requires `dag-pb` & the gateway requires UnixFS for directory traversal\n const cidObj = await ipfs.dag.put(node, { format: 'dag-pb', hashAlg: 'sha2-256' })\n const cid = cidObj.toV1().toString()\n await attemptPin(cid)\n const nodeSize = await size(cid)\n return {\n cid,\n size: nodeSize,\n isFile: false\n }\n}\n\nexport const dagPutLinks = async (links: DAGLink[]): Promise<AddResult> => {\n const node = new dagPB.DAGNode(DAG_NODE_DATA, links)\n return dagPut(node)\n}\n\nexport const size = async (cid: CID): Promise<number> => {\n const ipfs = await getIpfs()\n const stat = await ipfs.files.stat(`/ipfs/${cid}`)\n return stat.cumulativeSize\n}\n\nexport const attemptPin = async (cid: CID): Promise<void> => {\n const ipfs = await getIpfs()\n try {\n await ipfs.pin.add(cid, { recursive: false })\n } catch (err) {\n if (!err.message || !err.message.includes(\"already pinned recursively\")) {\n throw new Error(err)\n }\n }\n}\n", "import dagPB, { DAGLink, DAGNode } from 'ipld-dag-pb'\nimport type { GetResult } from 'ipfs-core-types/src/dag'\nimport { CID } from 'ipfs-message-port-client/src/block'\n\ntype RawDAGLink = {\n Name: string\n Hash: CID\n Tsize: number\n}\n\nconst rawToDAGLink = (raw: RawDAGLink): DAGLink => {\n return new dagPB.DAGLink(raw.Name, raw.Tsize, raw.Hash)\n}\n\nexport const rawToDAGNode = (raw: GetResult): DAGNode => {\n const data = raw?.value?.Data\n const links = raw?.value?.Links?.map(rawToDAGLink)\n return new dagPB.DAGNode(data, links)\n}\n", "import { Buffer } from 'buffer'\n\n// These bytes in the \"data\" field of an IPFS node indicate that the node is an IPLD DAG Node\nexport const DAG_NODE_DATA = Buffer.from([8, 1])\n\nexport default {\n DAG_NODE_DATA\n}\n", "import * as cbor from 'cborg'\n\nimport { isBlob, isJust } from '../common/type-checks'\nimport { Maybe } from '../common/types'\nimport * as blob from '../common/blob'\nimport * as crypto from '../crypto/index'\n\n// IPFS\n\nimport { CID, FileContent, AddResult } from './types'\nimport * as basic from './basic'\n\n\nexport const add = async (content: FileContent, key: Maybe<string>): Promise<AddResult> => {\n // can't cbor encode blobs ie file streams\n const normalized = isBlob(content) ? await blob.toBuffer(content) : content\n const encoded = cbor.encode(normalized)\n const toAdd = isJust(key) ? await crypto.aes.encrypt(encoded, key) : encoded\n return basic.add(toAdd)\n}\n\nexport const catAndDecode = async (cid: CID, key: Maybe<string>): Promise<unknown> => {\n const buf = await basic.catBuf(cid)\n const toDecode = isJust(key) ? await crypto.aes.decrypt(buf, key) : buf\n return cbor.decode(toDecode)\n}\n", "import { encode } from './lib/encode.js';\nimport { decode } from './lib/decode.js';\nimport {\n Token,\n Type\n} from './lib/token.js';\nexport {\n decode,\n encode,\n Token,\n Type\n};", "const typeofs = [\n 'string',\n 'number',\n 'bigint',\n 'symbol'\n];\nconst objectTypeNames = [\n 'Function',\n 'Generator',\n 'AsyncGenerator',\n 'GeneratorFunction',\n 'AsyncGeneratorFunction',\n 'AsyncFunction',\n 'Observable',\n 'Array',\n 'Buffer',\n 'Object',\n 'RegExp',\n 'Date',\n 'Error',\n 'Map',\n 'Set',\n 'WeakMap',\n 'WeakSet',\n 'ArrayBuffer',\n 'SharedArrayBuffer',\n 'DataView',\n 'Promise',\n 'URL',\n 'HTMLElement',\n 'Int8Array',\n 'Uint8Array',\n 'Uint8ClampedArray',\n 'Int16Array',\n 'Uint16Array',\n 'Int32Array',\n 'Uint32Array',\n 'Float32Array',\n 'Float64Array',\n 'BigInt64Array',\n 'BigUint64Array'\n];\nexport function is(value) {\n if (value === null) {\n return 'null';\n }\n if (value === undefined) {\n return 'undefined';\n }\n if (value === true || value === false) {\n return 'boolean';\n }\n const typeOf = typeof value;\n if (typeofs.includes(typeOf)) {\n return typeOf;\n }\n if (typeOf === 'function') {\n return 'Function';\n }\n if (Array.isArray(value)) {\n return 'Array';\n }\n if (isBuffer(value)) {\n return 'Buffer';\n }\n const objectType = getObjectType(value);\n if (objectType) {\n return objectType;\n }\n return 'Object';\n}\nfunction isBuffer(value) {\n return value && value.constructor && value.constructor.isBuffer && value.constructor.isBuffer.call(null, value);\n}\nfunction getObjectType(value) {\n const objectTypeName = Object.prototype.toString.call(value).slice(8, -1);\n if (objectTypeNames.includes(objectTypeName)) {\n return objectTypeName;\n }\n return undefined;\n}", "class Type {\n constructor(major, name, terminal) {\n this.major = major;\n this.majorEncoded = major << 5;\n this.name = name;\n this.terminal = terminal;\n }\n toString() {\n return `Type[${ this.major }].${ this.name }`;\n }\n compare(typ) {\n return this.major < typ.major ? -1 : this.major > typ.major ? 1 : 0;\n }\n}\nType.uint = new Type(0, 'uint', true);\nType.negint = new Type(1, 'negint', true);\nType.bytes = new Type(2, 'bytes', true);\nType.string = new Type(3, 'string', true);\nType.array = new Type(4, 'array', false);\nType.map = new Type(5, 'map', false);\nType.tag = new Type(6, 'tag', false);\nType.float = new Type(7, 'float', true);\nType.false = new Type(7, 'false', true);\nType.true = new Type(7, 'true', true);\nType.null = new Type(7, 'null', true);\nType.undefined = new Type(7, 'undefined', true);\nType.break = new Type(7, 'break', true);\nclass Token {\n constructor(type, value, encodedLength) {\n this.type = type;\n this.value = value;\n this.encodedLength = encodedLength;\n this.encodedBytes = undefined;\n }\n toString() {\n return `Token[${ this.type }].${ this.value }`;\n }\n}\nexport {\n Type,\n Token\n};", "export const useBuffer = globalThis.process && !globalThis.process.browser && globalThis.Buffer && typeof globalThis.Buffer.isBuffer === 'function';\nconst textDecoder = new TextDecoder();\nconst textEncoder = new TextEncoder();\nfunction isBuffer(buf) {\n return useBuffer && globalThis.Buffer.isBuffer(buf);\n}\nexport function asU8A(buf) {\n if (!(buf instanceof Uint8Array)) {\n return Uint8Array.from(buf);\n }\n return isBuffer(buf) ? new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength) : buf;\n}\nexport const toString = useBuffer ? (bytes, start, end) => {\n return end - start > 64 ? globalThis.Buffer.from(bytes.subarray(start, end)).toString('utf8') : utf8Slice(bytes, start, end);\n} : (bytes, start, end) => {\n return end - start > 64 ? textDecoder.decode(bytes.subarray(start, end)) : utf8Slice(bytes, start, end);\n};\nexport const fromString = useBuffer ? string => {\n return string.length > 64 ? globalThis.Buffer.from(string) : utf8ToBytes(string);\n} : string => {\n return string.length > 64 ? textEncoder.encode(string) : utf8ToBytes(string);\n};\nexport const fromArray = arr => {\n return Uint8Array.from(arr);\n};\nexport const slice = useBuffer ? (bytes, start, end) => {\n if (isBuffer(bytes)) {\n return new Uint8Array(bytes.subarray(start, end));\n }\n return bytes.slice(start, end);\n} : (bytes, start, end) => {\n return bytes.slice(start, end);\n};\nexport const concat = useBuffer ? (chunks, length) => {\n chunks = chunks.map(c => c instanceof Uint8Array ? c : globalThis.Buffer.from(c));\n return asU8A(globalThis.Buffer.concat(chunks, length));\n} : (chunks, length) => {\n const out = new Uint8Array(length);\n let off = 0;\n for (let b of chunks) {\n if (off + b.length > out.length) {\n b = b.subarray(0, out.length - off);\n }\n out.set(b, off);\n off += b.length;\n }\n return out;\n};\nexport const alloc = useBuffer ? size => {\n return globalThis.Buffer.allocUnsafe(size);\n} : size => {\n return new Uint8Array(size);\n};\nexport const toHex = useBuffer ? d => {\n if (typeof d === 'string') {\n return d;\n }\n return globalThis.Buffer.from(toBytes(d)).toString('hex');\n} : d => {\n if (typeof d === 'string') {\n return d;\n }\n return Array.prototype.reduce.call(toBytes(d), (p, c) => `${ p }${ c.toString(16).padStart(2, '0') }`, '');\n};\nexport const fromHex = useBuffer ? hex => {\n if (hex instanceof Uint8Array) {\n return hex;\n }\n return globalThis.Buffer.from(hex, 'hex');\n} : hex => {\n if (hex instanceof Uint8Array) {\n return hex;\n }\n if (!hex.length) {\n return new Uint8Array(0);\n }\n return new Uint8Array(hex.split('').map((c, i, d) => i % 2 === 0 ? `0x${ c }${ d[i + 1] }` : '').filter(Boolean).map(e => parseInt(e, 16)));\n};\nfunction toBytes(obj) {\n if (obj instanceof Uint8Array && obj.constructor.name === 'Uint8Array') {\n return obj;\n }\n if (obj instanceof ArrayBuffer) {\n return new Uint8Array(obj);\n }\n if (ArrayBuffer.isView(obj)) {\n return new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength);\n }\n throw new Error('Unknown type, must be binary type');\n}\nexport function compare(b1, b2) {\n if (isBuffer(b1) && isBuffer(b2)) {\n return b1.compare(b2);\n }\n for (let i = 0; i < b1.length; i++) {\n if (b1[i] === b2[i]) {\n continue;\n }\n return b1[i] < b2[i] ? -1 : 1;\n }\n return 0;\n}\nfunction utf8ToBytes(string, units = Infinity) {\n let codePoint;\n const length = string.length;\n let leadSurrogate = null;\n const bytes = [];\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i);\n if (codePoint > 55295 && codePoint < 57344) {\n if (!leadSurrogate) {\n if (codePoint > 56319) {\n if ((units -= 3) > -1)\n bytes.push(239, 191, 189);\n continue;\n } else if (i + 1 === length) {\n if ((units -= 3) > -1)\n bytes.push(239, 191, 189);\n continue;\n }\n leadSurrogate = codePoint;\n continue;\n }\n if (codePoint < 56320) {\n if ((units -= 3) > -1)\n bytes.push(239, 191, 189);\n leadSurrogate = codePoint;\n continue;\n }\n codePoint = (leadSurrogate - 55296 << 10 | codePoint - 56320) + 65536;\n } else if (leadSurrogate) {\n if ((units -= 3) > -1)\n bytes.push(239, 191, 189);\n }\n leadSurrogate = null;\n if (codePoint < 128) {\n if ((units -= 1) < 0)\n break;\n bytes.push(codePoint);\n } else if (codePoint < 2048) {\n if ((units -= 2) < 0)\n break;\n bytes.push(codePoint >> 6 | 192, codePoint & 63 | 128);\n } else if (codePoint < 65536) {\n if ((units -= 3) < 0)\n break;\n bytes.push(codePoint >> 12 | 224, codePoint >> 6 & 63 | 128, codePoint & 63 | 128);\n } else if (codePoint < 1114112) {\n if ((units -= 4) < 0)\n break;\n bytes.push(codePoint >> 18 | 240, codePoint >> 12 & 63 | 128, codePoint >> 6 & 63 | 128, codePoint & 63 | 128);\n } else {\n throw new Error('Invalid code point');\n }\n }\n return bytes;\n}\nfunction utf8Slice(buf, offset, end) {\n const res = [];\n while (offset < end) {\n const firstByte = buf[offset];\n let codePoint = null;\n let bytesPerSequence = firstByte > 239 ? 4 : firstByte > 223 ? 3 : firstByte > 191 ? 2 : 1;\n if (offset + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint;\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 128) {\n codePoint = firstByte;\n }\n break;\n case 2:\n secondByte = buf[offset + 1];\n if ((secondByte & 192) === 128) {\n tempCodePoint = (firstByte & 31) << 6 | secondByte & 63;\n if (tempCodePoint > 127) {\n codePoint = tempCodePoint;\n }\n }\n break;\n case 3:\n secondByte = buf[offset + 1];\n thirdByte = buf[offset + 2];\n if ((secondByte & 192) === 128 && (thirdByte & 192) === 128) {\n tempCodePoint = (firstByte & 15) << 12 | (secondByte & 63) << 6 | thirdByte & 63;\n if (tempCodePoint > 2047 && (tempCodePoint < 55296 || tempCodePoint > 57343)) {\n codePoint = tempCodePoint;\n }\n }\n break;\n case 4:\n secondByte = buf[offset + 1];\n thirdByte = buf[offset + 2];\n fourthByte = buf[offset + 3];\n if ((secondByte & 192) === 128 && (thirdByte & 192) === 128 && (fourthByte & 192) === 128) {\n tempCodePoint = (firstByte & 15) << 18 | (secondByte & 63) << 12 | (thirdByte & 63) << 6 | fourthByte & 63;\n if (tempCodePoint > 65535 && tempCodePoint < 1114112) {\n codePoint = tempCodePoint;\n }\n }\n }\n }\n if (codePoint === null) {\n codePoint = 65533;\n bytesPerSequence = 1;\n } else if (codePoint > 65535) {\n codePoint -= 65536;\n res.push(codePoint >>> 10 & 1023 | 55296);\n codePoint = 56320 | codePoint & 1023;\n }\n res.push(codePoint);\n offset += bytesPerSequence;\n }\n return decodeCodePointsArray(res);\n}\nconst MAX_ARGUMENTS_LENGTH = 4096;\nexport function decodeCodePointsArray(codePoints) {\n const len = codePoints.length;\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints);\n }\n let res = '';\n let i = 0;\n while (i < len) {\n res += String.fromCharCode.apply(String, codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH));\n }\n return res;\n}", "import {\n alloc,\n concat,\n slice\n} from './byte-utils.js';\nconst defaultChunkSize = 256;\nexport class Bl {\n constructor(chunkSize = defaultChunkSize) {\n this.chunkSize = chunkSize;\n this.cursor = 0;\n this.maxCursor = -1;\n this.chunks = [];\n this._initReuseChunk = null;\n }\n reset() {\n this.chunks = [];\n this.cursor = 0;\n this.maxCursor = -1;\n if (this._initReuseChunk !== null) {\n this.chunks.push(this._initReuseChunk);\n this.maxCursor = this._initReuseChunk.length - 1;\n }\n }\n push(bytes) {\n let topChunk = this.chunks[this.chunks.length - 1];\n const newMax = this.cursor + bytes.length;\n if (newMax <= this.maxCursor + 1) {\n const chunkPos = topChunk.length - (this.maxCursor - this.cursor) - 1;\n topChunk.set(bytes, chunkPos);\n } else {\n if (topChunk) {\n const chunkPos = topChunk.length - (this.maxCursor - this.cursor) - 1;\n if (chunkPos < topChunk.length) {\n this.chunks[this.chunks.length - 1] = topChunk.subarray(0, chunkPos);\n this.maxCursor = this.cursor - 1;\n }\n }\n if (bytes.length < 64 && bytes.length < this.chunkSize) {\n topChunk = alloc(this.chunkSize);\n this.chunks.push(topChunk);\n this.maxCursor += topChunk.length;\n if (this._initReuseChunk === null) {\n this._initReuseChunk = topChunk;\n }\n topChunk.set(bytes, 0);\n } else {\n this.chunks.push(bytes);\n this.maxCursor += bytes.length;\n }\n }\n this.cursor += bytes.length;\n }\n toBytes(reset = false) {\n let byts;\n if (this.chunks.length === 1) {\n const chunk = this.chunks[0];\n if (reset && this.cursor > chunk.length / 2) {\n byts = this.cursor === chunk.length ? chunk : chunk.subarray(0, this.cursor);\n this._initReuseChunk = null;\n this.chunks = [];\n } else {\n byts = slice(chunk, 0, this.cursor);\n }\n } else {\n byts = concat(this.chunks, this.cursor);\n }\n if (reset) {\n this.reset();\n }\n return byts;\n }\n}", "const decodeErrPrefix = 'CBOR decode error:';\nconst encodeErrPrefix = 'CBOR encode error:';\nconst uintMinorPrefixBytes = [];\nuintMinorPrefixBytes[23] = 1;\nuintMinorPrefixBytes[24] = 2;\nuintMinorPrefixBytes[25] = 3;\nuintMinorPrefixBytes[26] = 5;\nuintMinorPrefixBytes[27] = 9;\nfunction assertEnoughData(data, pos, need) {\n if (data.length - pos < need) {\n throw new Error(`${ decodeErrPrefix } not enough data for type`);\n }\n}\nexport {\n decodeErrPrefix,\n encodeErrPrefix,\n uintMinorPrefixBytes,\n assertEnoughData\n};", "import {\n Token,\n Type\n} from './token.js';\nimport {\n decodeErrPrefix,\n assertEnoughData\n} from './common.js';\nexport const uintBoundaries = [\n 24,\n 256,\n 65536,\n 4294967296,\n BigInt('18446744073709551616')\n];\nexport function readUint8(data, offset, options) {\n assertEnoughData(data, offset, 1);\n const value = data[offset];\n if (options.strict === true && value < uintBoundaries[0]) {\n throw new Error(`${ decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n }\n return value;\n}\nexport function readUint16(data, offset, options) {\n assertEnoughData(data, offset, 2);\n const value = data[offset] << 8 | data[offset + 1];\n if (options.strict === true && value < uintBoundaries[1]) {\n throw new Error(`${ decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n }\n return value;\n}\nexport function readUint32(data, offset, options) {\n assertEnoughData(data, offset, 4);\n const value = data[offset] * 16777216 + (data[offset + 1] << 16) + (data[offset + 2] << 8) + data[offset + 3];\n if (options.strict === true && value < uintBoundaries[2]) {\n throw new Error(`${ decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n }\n return value;\n}\nexport function readUint64(data, offset, options) {\n assertEnoughData(data, offset, 8);\n const hi = data[offset] * 16777216 + (data[offset + 1] << 16) + (data[offset + 2] << 8) + data[offset + 3];\n const lo = data[offset + 4] * 16777216 + (data[offset + 5] << 16) + (data[offset + 6] << 8) + data[offset + 7];\n const value = (BigInt(hi) << BigInt(32)) + BigInt(lo);\n if (options.strict === true && value < uintBoundaries[3]) {\n throw new Error(`${ decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n }\n if (value <= Number.MAX_SAFE_INTEGER) {\n return Number(value);\n }\n if (options.allowBigInt === true) {\n return value;\n }\n throw new Error(`${ decodeErrPrefix } integers outside of the safe integer range are not supported`);\n}\nexport function decodeUint8(data, pos, _minor, options) {\n return new Token(Type.uint, readUint8(data, pos + 1, options), 2);\n}\nexport function decodeUint16(data, pos, _minor, options) {\n return new Token(Type.uint, readUint16(data, pos + 1, options), 3);\n}\nexport function decodeUint32(data, pos, _minor, options) {\n return new Token(Type.uint, readUint32(data, pos + 1, options), 5);\n}\nexport function decodeUint64(data, pos, _minor, options) {\n return new Token(Type.uint, readUint64(data, pos + 1, options), 9);\n}\nexport function encodeUint(buf, token) {\n return encodeUintValue(buf, 0, token.value);\n}\nexport function encodeUintValue(buf, major, uint) {\n if (uint < uintBoundaries[0]) {\n const nuint = Number(uint);\n buf.push([major | nuint]);\n } else if (uint < uintBoundaries[1]) {\n const nuint = Number(uint);\n buf.push([\n major | 24,\n nuint\n ]);\n } else if (uint < uintBoundaries[2]) {\n const nuint = Number(uint);\n buf.push([\n major | 25,\n nuint >>> 8,\n nuint & 255\n ]);\n } else if (uint < uintBoundaries[3]) {\n const nuint = Number(uint);\n buf.push([\n major | 26,\n nuint >>> 24 & 255,\n nuint >>> 16 & 255,\n nuint >>> 8 & 255,\n nuint & 255\n ]);\n } else {\n const buint = BigInt(uint);\n if (buint < uintBoundaries[4]) {\n const set = [\n major | 27,\n 0,\n 0,\n 0,\n 0,\n 0,\n 0,\n 0\n ];\n let lo = Number(buint & BigInt(4294967295));\n let hi = Number(buint >> BigInt(32) & BigInt(4294967295));\n set[8] = lo & 255;\n lo = lo >> 8;\n set[7] = lo & 255;\n lo = lo >> 8;\n set[6] = lo & 255;\n lo = lo >> 8;\n set[5] = lo & 255;\n set[4] = hi & 255;\n hi = hi >> 8;\n set[3] = hi & 255;\n hi = hi >> 8;\n set[2] = hi & 255;\n hi = hi >> 8;\n set[1] = hi & 255;\n buf.push(set);\n } else {\n throw new Error(`${ decodeErrPrefix } encountered BigInt larger than allowable range`);\n }\n }\n}\nencodeUint.encodedSize = function encodedSize(token) {\n return encodeUintValue.encodedSize(token.value);\n};\nencodeUintValue.encodedSize = function encodedSize(uint) {\n if (uint < uintBoundaries[0]) {\n return 1;\n }\n if (uint < uintBoundaries[1]) {\n return 2;\n }\n if (uint < uintBoundaries[2]) {\n return 3;\n }\n if (uint < uintBoundaries[3]) {\n return 5;\n }\n return 9;\n};\nencodeUint.compareTokens = function compareTokens(tok1, tok2) {\n return tok1.value < tok2.value ? -1 : tok1.value > tok2.value ? 1 : 0;\n};", "import {\n Token,\n Type\n} from './token.js';\nimport * as uint from './0uint.js';\nimport { decodeErrPrefix } from './common.js';\nexport function decodeNegint8(data, pos, _minor, options) {\n return new Token(Type.negint, -1 - uint.readUint8(data, pos + 1, options), 2);\n}\nexport function decodeNegint16(data, pos, _minor, options) {\n return new Token(Type.negint, -1 - uint.readUint16(data, pos + 1, options), 3);\n}\nexport function decodeNegint32(data, pos, _minor, options) {\n return new Token(Type.negint, -1 - uint.readUint32(data, pos + 1, options), 5);\n}\nconst neg1b = BigInt(-1);\nconst pos1b = BigInt(1);\nexport function decodeNegint64(data, pos, _minor, options) {\n const int = uint.readUint64(data, pos + 1, options);\n if (typeof int !== 'bigint') {\n const value = -1 - int;\n if (value >= Number.MIN_SAFE_INTEGER) {\n return new Token(Type.negint, value, 9);\n }\n }\n if (options.allowBigInt !== true) {\n throw new Error(`${ decodeErrPrefix } integers outside of the safe integer range are not supported`);\n }\n return new Token(Type.negint, neg1b - BigInt(int), 9);\n}\nexport function encodeNegint(buf, token) {\n const negint = token.value;\n const unsigned = typeof negint === 'bigint' ? negint * neg1b - pos1b : negint * -1 - 1;\n uint.encodeUintValue(buf, token.type.majorEncoded, unsigned);\n}\nencodeNegint.encodedSize = function encodedSize(token) {\n const negint = token.value;\n const unsigned = typeof negint === 'bigint' ? negint * neg1b - pos1b : negint * -1 - 1;\n if (unsigned < uint.uintBoundaries[0]) {\n return 1;\n }\n if (unsigned < uint.uintBoundaries[1]) {\n return 2;\n }\n if (unsigned < uint.uintBoundaries[2]) {\n return 3;\n }\n if (unsigned < uint.uintBoundaries[3]) {\n return 5;\n }\n return 9;\n};\nencodeNegint.compareTokens = function compareTokens(tok1, tok2) {\n return tok1.value < tok2.value ? 1 : tok1.value > tok2.value ? -1 : 0;\n};", "import {\n Token,\n Type\n} from './token.js';\nimport {\n assertEnoughData,\n decodeErrPrefix\n} from './common.js';\nimport * as uint from './0uint.js';\nimport {\n compare,\n fromString,\n slice\n} from './byte-utils.js';\nfunction toToken(data, pos, prefix, length) {\n assertEnoughData(data, pos, prefix + length);\n const buf = slice(data, pos + prefix, pos + prefix + length);\n return new Token(Type.bytes, buf, prefix + length);\n}\nexport function decodeBytesCompact(data, pos, minor, _options) {\n return toToken(data, pos, 1, minor);\n}\nexport function decodeBytes8(data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options));\n}\nexport function decodeBytes16(data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options));\n}\nexport function decodeBytes32(data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options));\n}\nexport function decodeBytes64(data, pos, _minor, options) {\n const l = uint.readUint64(data, pos + 1, options);\n if (typeof l === 'bigint') {\n throw new Error(`${ decodeErrPrefix } 64-bit integer bytes lengths not supported`);\n }\n return toToken(data, pos, 9, l);\n}\nfunction tokenBytes(token) {\n if (token.encodedBytes === undefined) {\n token.encodedBytes = token.type === Type.string ? fromString(token.value) : token.value;\n }\n return token.encodedBytes;\n}\nexport function encodeBytes(buf, token) {\n const bytes = tokenBytes(token);\n uint.encodeUintValue(buf, token.type.majorEncoded, bytes.length);\n buf.push(bytes);\n}\nencodeBytes.encodedSize = function encodedSize(token) {\n const bytes = tokenBytes(token);\n return uint.encodeUintValue.encodedSize(bytes.length) + bytes.length;\n};\nencodeBytes.compareTokens = function compareTokens(tok1, tok2) {\n return compareBytes(tokenBytes(tok1), tokenBytes(tok2));\n};\nexport function compareBytes(b1, b2) {\n return b1.length < b2.length ? -1 : b1.length > b2.length ? 1 : compare(b1, b2);\n}", "import {\n Token,\n Type\n} from './token.js';\nimport {\n assertEnoughData,\n decodeErrPrefix\n} from './common.js';\nimport * as uint from './0uint.js';\nimport { encodeBytes } from './2bytes.js';\nimport { toString } from './byte-utils.js';\nfunction toToken(data, pos, prefix, length) {\n const totLength = prefix + length;\n assertEnoughData(data, pos, totLength);\n return new Token(Type.string, toString(data, pos + prefix, pos + totLength), totLength);\n}\nexport function decodeStringCompact(data, pos, minor, _options) {\n return toToken(data, pos, 1, minor);\n}\nexport function decodeString8(data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options));\n}\nexport function decodeString16(data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options));\n}\nexport function decodeString32(data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options));\n}\nexport function decodeString64(data, pos, _minor, options) {\n const l = uint.readUint64(data, pos + 1, options);\n if (typeof l === 'bigint') {\n throw new Error(`${ decodeErrPrefix } 64-bit integer string lengths not supported`);\n }\n return toToken(data, pos, 9, l);\n}\nexport const encodeString = encodeBytes;", "import {\n Token,\n Type\n} from './token.js';\nimport * as uint from './0uint.js';\nimport { decodeErrPrefix } from './common.js';\nfunction toToken(_data, _pos, prefix, length) {\n return new Token(Type.array, length, prefix);\n}\nexport function decodeArrayCompact(data, pos, minor, _options) {\n return toToken(data, pos, 1, minor);\n}\nexport function decodeArray8(data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options));\n}\nexport function decodeArray16(data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options));\n}\nexport function decodeArray32(data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options));\n}\nexport function decodeArray64(data, pos, _minor, options) {\n const l = uint.readUint64(data, pos + 1, options);\n if (typeof l === 'bigint') {\n throw new Error(`${ decodeErrPrefix } 64-bit integer array lengths not supported`);\n }\n return toToken(data, pos, 9, l);\n}\nexport function decodeArrayIndefinite(data, pos, _minor, options) {\n if (options.allowIndefinite === false) {\n throw new Error(`${ decodeErrPrefix } indefinite length items not allowed`);\n }\n return toToken(data, pos, 1, Infinity);\n}\nexport function encodeArray(buf, token) {\n uint.encodeUintValue(buf, Type.array.majorEncoded, token.value);\n}\nencodeArray.compareTokens = uint.encodeUint.compareTokens;", "import {\n Token,\n Type\n} from './token.js';\nimport * as uint from './0uint.js';\nimport { decodeErrPrefix } from './common.js';\nfunction toToken(_data, _pos, prefix, length) {\n return new Token(Type.map, length, prefix);\n}\nexport function decodeMapCompact(data, pos, minor, _options) {\n return toToken(data, pos, 1, minor);\n}\nexport function decodeMap8(data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options));\n}\nexport function decodeMap16(data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options));\n}\nexport function decodeMap32(data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options));\n}\nexport function decodeMap64(data, pos, _minor, options) {\n const l = uint.readUint64(data, pos + 1, options);\n if (typeof l === 'bigint') {\n throw new Error(`${ decodeErrPrefix } 64-bit integer map lengths not supported`);\n }\n return toToken(data, pos, 9, l);\n}\nexport function decodeMapIndefinite(data, pos, _minor, options) {\n if (options.allowIndefinite === false) {\n throw new Error(`${ decodeErrPrefix } indefinite length items not allowed`);\n }\n return toToken(data, pos, 1, Infinity);\n}\nexport function encodeMap(buf, token) {\n uint.encodeUintValue(buf, Type.map.majorEncoded, token.value);\n}\nencodeMap.compareTokens = uint.encodeUint.compareTokens;", "import {\n Token,\n Type\n} from './token.js';\nimport * as uint from './0uint.js';\nexport function decodeTagCompact(_data, _pos, minor, _options) {\n return new Token(Type.tag, minor, 1);\n}\nexport function decodeTag8(data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint8(data, pos + 1, options), 2);\n}\nexport function decodeTag16(data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint16(data, pos + 1, options), 3);\n}\nexport function decodeTag32(data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint32(data, pos + 1, options), 5);\n}\nexport function decodeTag64(data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint64(data, pos + 1, options), 9);\n}\nexport function encodeTag(buf, token) {\n uint.encodeUintValue(buf, Type.tag.majorEncoded, token.value);\n}\nencodeTag.compareTokens = uint.encodeUint.compareTokens;", "import {\n Token,\n Type\n} from './token.js';\nimport { decodeErrPrefix } from './common.js';\nimport { encodeUint } from './0uint.js';\nconst MINOR_FALSE = 20;\nconst MINOR_TRUE = 21;\nconst MINOR_NULL = 22;\nconst MINOR_UNDEFINED = 23;\nexport function decodeUndefined(_data, _pos, _minor, options) {\n if (options.allowUndefined === false) {\n throw new Error(`${ decodeErrPrefix } undefined values are not supported`);\n }\n return new Token(Type.undefined, undefined, 1);\n}\nexport function decodeBreak(_data, _pos, _minor, options) {\n if (options.allowIndefinite === false) {\n throw new Error(`${ decodeErrPrefix } indefinite length items not allowed`);\n }\n return new Token(Type.break, undefined, 1);\n}\nfunction createToken(value, bytes, options) {\n if (options) {\n if (options.allowNaN === false && Number.isNaN(value)) {\n throw new Error(`${ decodeErrPrefix } NaN values are not supported`);\n }\n if (options.allowInfinity === false && (value === Infinity || value === -Infinity)) {\n throw new Error(`${ decodeErrPrefix } Infinity values are not supported`);\n }\n }\n return new Token(Type.float, value, bytes);\n}\nexport function decodeFloat16(data, pos, _minor, options) {\n return createToken(readFloat16(data, pos + 1), 3, options);\n}\nexport function decodeFloat32(data, pos, _minor, options) {\n return createToken(readFloat32(data, pos + 1), 5, options);\n}\nexport function decodeFloat64(data, pos, _minor, options) {\n return createToken(readFloat64(data, pos + 1), 9, options);\n}\nexport function encodeFloat(buf, token, options) {\n const float = token.value;\n if (float === false) {\n buf.push([Type.float.majorEncoded | MINOR_FALSE]);\n } else if (float === true) {\n buf.push([Type.float.majorEncoded | MINOR_TRUE]);\n } else if (float === null) {\n buf.push([Type.float.majorEncoded | MINOR_NULL]);\n } else if (float === undefined) {\n buf.push([Type.float.majorEncoded | MINOR_UNDEFINED]);\n } else {\n let decoded;\n let success = false;\n if (!options || options.float64 !== true) {\n encodeFloat16(float);\n decoded = readFloat16(ui8a, 1);\n if (float === decoded || Number.isNaN(float)) {\n ui8a[0] = 249;\n buf.push(ui8a.slice(0, 3));\n success = true;\n } else {\n encodeFloat32(float);\n decoded = readFloat32(ui8a, 1);\n if (float === decoded) {\n ui8a[0] = 250;\n buf.push(ui8a.slice(0, 5));\n success = true;\n }\n }\n }\n if (!success) {\n encodeFloat64(float);\n decoded = readFloat64(ui8a, 1);\n ui8a[0] = 251;\n buf.push(ui8a.slice(0, 9));\n }\n }\n}\nencodeFloat.encodedSize = function encodedSize(token, options) {\n const float = token.value;\n if (float === false || float === true || float === null || float === undefined) {\n return 1;\n }\n let decoded;\n if (!options || options.float64 !== true) {\n encodeFloat16(float);\n decoded = readFloat16(ui8a, 1);\n if (float === decoded || Number.isNaN(float)) {\n return 3;\n }\n encodeFloat32(float);\n decoded = readFloat32(ui8a, 1);\n if (float === decoded) {\n return 5;\n }\n }\n return 9;\n};\nconst buffer = new ArrayBuffer(9);\nconst dataView = new DataView(buffer, 1);\nconst ui8a = new Uint8Array(buffer, 0);\nfunction encodeFloat16(inp) {\n if (inp === Infinity) {\n dataView.setUint16(0, 31744, false);\n } else if (inp === -Infinity) {\n dataView.setUint16(0, 64512, false);\n } else if (Number.isNaN(inp)) {\n dataView.setUint16(0, 32256, false);\n } else {\n dataView.setFloat32(0, inp);\n const valu32 = dataView.getUint32(0);\n const exponent = (valu32 & 2139095040) >> 23;\n const mantissa = valu32 & 8388607;\n if (exponent === 255) {\n dataView.setUint16(0, 31744, false);\n } else if (exponent === 0) {\n dataView.setUint16(0, (inp & 2147483648) >> 16 | mantissa >> 13, false);\n } else {\n const logicalExponent = exponent - 127;\n if (logicalExponent < -24) {\n dataView.setUint16(0, 0);\n } else if (logicalExponent < -14) {\n dataView.setUint16(0, (valu32 & 2147483648) >> 16 | 1 << 24 + logicalExponent, false);\n } else {\n dataView.setUint16(0, (valu32 & 2147483648) >> 16 | logicalExponent + 15 << 10 | mantissa >> 13, false);\n }\n }\n }\n}\nfunction readFloat16(ui8a, pos) {\n if (ui8a.length - pos < 2) {\n throw new Error(`${ decodeErrPrefix } not enough data for float16`);\n }\n const half = (ui8a[pos] << 8) + ui8a[pos + 1];\n if (half === 31744) {\n return Infinity;\n }\n if (half === 64512) {\n return -Infinity;\n }\n if (half === 32256) {\n return NaN;\n }\n const exp = half >> 10 & 31;\n const mant = half & 1023;\n let val;\n if (exp === 0) {\n val = mant * 2 ** -24;\n } else if (exp !== 31) {\n val = (mant + 1024) * 2 ** (exp - 25);\n } else {\n val = mant === 0 ? Infinity : NaN;\n }\n return half & 32768 ? -val : val;\n}\nfunction encodeFloat32(inp) {\n dataView.setFloat32(0, inp, false);\n}\nfunction readFloat32(ui8a, pos) {\n if (ui8a.length - pos < 4) {\n throw new Error(`${ decodeErrPrefix } not enough data for float32`);\n }\n const offset = (ui8a.byteOffset || 0) + pos;\n return new DataView(ui8a.buffer, offset, 4).getFloat32(0, false);\n}\nfunction encodeFloat64(inp) {\n dataView.setFloat64(0, inp, false);\n}\nfunction readFloat64(ui8a, pos) {\n if (ui8a.length - pos < 8) {\n throw new Error(`${ decodeErrPrefix } not enough data for float64`);\n }\n const offset = (ui8a.byteOffset || 0) + pos;\n return new DataView(ui8a.buffer, offset, 8).getFloat64(0, false);\n}\nencodeFloat.compareTokens = encodeUint.compareTokens;", "import {\n Token,\n Type\n} from './token.js';\nimport * as uint from './0uint.js';\nimport * as negint from './1negint.js';\nimport * as bytes from './2bytes.js';\nimport * as string from './3string.js';\nimport * as array from './4array.js';\nimport * as map from './5map.js';\nimport * as tag from './6tag.js';\nimport * as float from './7float.js';\nimport { decodeErrPrefix } from './common.js';\nimport { fromArray } from './byte-utils.js';\nfunction invalidMinor(data, pos, minor) {\n throw new Error(`${ decodeErrPrefix } encountered invalid minor (${ minor }) for major ${ data[pos] >>> 5 }`);\n}\nfunction errorer(msg) {\n return () => {\n throw new Error(`${ decodeErrPrefix } ${ msg }`);\n };\n}\nexport const jump = [];\nfor (let i = 0; i <= 23; i++) {\n jump[i] = invalidMinor;\n}\njump[24] = uint.decodeUint8;\njump[25] = uint.decodeUint16;\njump[26] = uint.decodeUint32;\njump[27] = uint.decodeUint64;\njump[28] = invalidMinor;\njump[29] = invalidMinor;\njump[30] = invalidMinor;\njump[31] = invalidMinor;\nfor (let i = 32; i <= 55; i++) {\n jump[i] = invalidMinor;\n}\njump[56] = negint.decodeNegint8;\njump[57] = negint.decodeNegint16;\njump[58] = negint.decodeNegint32;\njump[59] = negint.decodeNegint64;\njump[60] = invalidMinor;\njump[61] = invalidMinor;\njump[62] = invalidMinor;\njump[63] = invalidMinor;\nfor (let i = 64; i <= 87; i++) {\n jump[i] = bytes.decodeBytesCompact;\n}\njump[88] = bytes.decodeBytes8;\njump[89] = bytes.decodeBytes16;\njump[90] = bytes.decodeBytes32;\njump[91] = bytes.decodeBytes64;\njump[92] = invalidMinor;\njump[93] = invalidMinor;\njump[94] = invalidMinor;\njump[95] = errorer('indefinite length bytes/strings are not supported');\nfor (let i = 96; i <= 119; i++) {\n jump[i] = string.decodeStringCompact;\n}\njump[120] = string.decodeString8;\njump[121] = string.decodeString16;\njump[122] = string.decodeString32;\njump[123] = string.decodeString64;\njump[124] = invalidMinor;\njump[125] = invalidMinor;\njump[126] = invalidMinor;\njump[127] = errorer('indefinite length bytes/strings are not supported');\nfor (let i = 128; i <= 151; i++) {\n jump[i] = array.decodeArrayCompact;\n}\njump[152] = array.decodeArray8;\njump[153] = array.decodeArray16;\njump[154] = array.decodeArray32;\njump[155] = array.decodeArray64;\njump[156] = invalidMinor;\njump[157] = invalidMinor;\njump[158] = invalidMinor;\njump[159] = array.decodeArrayIndefinite;\nfor (let i = 160; i <= 183; i++) {\n jump[i] = map.decodeMapCompact;\n}\njump[184] = map.decodeMap8;\njump[185] = map.decodeMap16;\njump[186] = map.decodeMap32;\njump[187] = map.decodeMap64;\njump[188] = invalidMinor;\njump[189] = invalidMinor;\njump[190] = invalidMinor;\njump[191] = map.decodeMapIndefinite;\nfor (let i = 192; i <= 215; i++) {\n jump[i] = tag.decodeTagCompact;\n}\njump[216] = tag.decodeTag8;\njump[217] = tag.decodeTag16;\njump[218] = tag.decodeTag32;\njump[219] = tag.decodeTag64;\njump[220] = invalidMinor;\njump[221] = invalidMinor;\njump[222] = invalidMinor;\njump[223] = invalidMinor;\nfor (let i = 224; i <= 243; i++) {\n jump[i] = errorer('simple values are not supported');\n}\njump[244] = invalidMinor;\njump[245] = invalidMinor;\njump[246] = invalidMinor;\njump[247] = float.decodeUndefined;\njump[248] = errorer('simple values are not supported');\njump[249] = float.decodeFloat16;\njump[250] = float.decodeFloat32;\njump[251] = float.decodeFloat64;\njump[252] = invalidMinor;\njump[253] = invalidMinor;\njump[254] = invalidMinor;\njump[255] = float.decodeBreak;\nexport const quick = [];\nfor (let i = 0; i < 24; i++) {\n quick[i] = new Token(Type.uint, i, 1);\n}\nfor (let i = -1; i >= -24; i--) {\n quick[31 - i] = new Token(Type.negint, i, 1);\n}\nquick[64] = new Token(Type.bytes, new Uint8Array(0), 1);\nquick[96] = new Token(Type.string, '', 1);\nquick[128] = new Token(Type.array, 0, 1);\nquick[160] = new Token(Type.map, 0, 1);\nquick[244] = new Token(Type.false, false, 1);\nquick[245] = new Token(Type.true, true, 1);\nquick[246] = new Token(Type.null, null, 1);\nexport function quickEncodeToken(token) {\n switch (token.type) {\n case Type.false:\n return fromArray([244]);\n case Type.true:\n return fromArray([245]);\n case Type.null:\n return fromArray([246]);\n case Type.bytes:\n if (!token.value.length) {\n return fromArray([64]);\n }\n return;\n case Type.string:\n if (token.value === '') {\n return fromArray([96]);\n }\n return;\n case Type.array:\n if (token.value === 0) {\n return fromArray([128]);\n }\n return;\n case Type.map:\n if (token.value === 0) {\n return fromArray([160]);\n }\n return;\n case Type.uint:\n if (token.value < 24) {\n return fromArray([Number(token.value)]);\n }\n return;\n case Type.negint:\n if (token.value >= -24) {\n return fromArray([31 - Number(token.value)]);\n }\n }\n}", "import { is } from './is.js';\nimport {\n Token,\n Type\n} from './token.js';\nimport { Bl } from './bl.js';\nimport { encodeErrPrefix } from './common.js';\nimport { quickEncodeToken } from './jump.js';\nimport { asU8A } from './byte-utils.js';\nimport { encodeUint } from './0uint.js';\nimport { encodeNegint } from './1negint.js';\nimport { encodeBytes } from './2bytes.js';\nimport { encodeString } from './3string.js';\nimport { encodeArray } from './4array.js';\nimport { encodeMap } from './5map.js';\nimport { encodeTag } from './6tag.js';\nimport { encodeFloat } from './7float.js';\nconst defaultEncodeOptions = {\n float64: false,\n mapSorter,\n quickEncodeToken\n};\nconst cborEncoders = [];\ncborEncoders[Type.uint.major] = encodeUint;\ncborEncoders[Type.negint.major] = encodeNegint;\ncborEncoders[Type.bytes.major] = encodeBytes;\ncborEncoders[Type.string.major] = encodeString;\ncborEncoders[Type.array.major] = encodeArray;\ncborEncoders[Type.map.major] = encodeMap;\ncborEncoders[Type.tag.major] = encodeTag;\ncborEncoders[Type.float.major] = encodeFloat;\nconst buf = new Bl();\nclass Ref {\n constructor(obj, parent) {\n this.obj = obj;\n this.parent = parent;\n }\n includes(obj) {\n let p = this;\n do {\n if (p.obj === obj) {\n return true;\n }\n } while (p = p.parent);\n return false;\n }\n static createCheck(stack, obj) {\n if (stack && stack.includes(obj)) {\n throw new Error(`${ encodeErrPrefix } object contains circular references`);\n }\n return new Ref(obj, stack);\n }\n}\nconst simpleTokens = {\n null: new Token(Type.null, null),\n undefined: new Token(Type.undefined, undefined),\n true: new Token(Type.true, true),\n false: new Token(Type.false, false),\n emptyArray: new Token(Type.array, 0),\n emptyMap: new Token(Type.map, 0)\n};\nconst typeEncoders = {\n number(obj, _typ, _options, _refStack) {\n if (!Number.isInteger(obj) || !Number.isSafeInteger(obj)) {\n return new Token(Type.float, obj);\n } else if (obj >= 0) {\n return new Token(Type.uint, obj);\n } else {\n return new Token(Type.negint, obj);\n }\n },\n bigint(obj, _typ, _options, _refStack) {\n if (obj >= BigInt(0)) {\n return new Token(Type.uint, obj);\n } else {\n return new Token(Type.negint, obj);\n }\n },\n Uint8Array(obj, _typ, _options, _refStack) {\n return new Token(Type.bytes, obj);\n },\n string(obj, _typ, _options, _refStack) {\n return new Token(Type.string, obj);\n },\n boolean(obj, _typ, _options, _refStack) {\n return obj ? simpleTokens.true : simpleTokens.false;\n },\n null(_obj, _typ, _options, _refStack) {\n return simpleTokens.null;\n },\n undefined(_obj, _typ, _options, _refStack) {\n return simpleTokens.undefined;\n },\n ArrayBuffer(obj, _typ, _options, _refStack) {\n return new Token(Type.bytes, new Uint8Array(obj));\n },\n DataView(obj, _typ, _options, _refStack) {\n return new Token(Type.bytes, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength));\n },\n Array(obj, _typ, options, refStack) {\n if (!obj.length) {\n if (options.addBreakTokens === true) {\n return [\n simpleTokens.emptyArray,\n new Token(Type.break)\n ];\n }\n return simpleTokens.emptyArray;\n }\n refStack = Ref.createCheck(refStack, obj);\n const entries = [];\n let i = 0;\n for (const e of obj) {\n entries[i++] = objectToTokens(e, options, refStack);\n }\n if (options.addBreakTokens) {\n return [\n new Token(Type.array, obj.length),\n entries,\n new Token(Type.break)\n ];\n }\n return [\n new Token(Type.array, obj.length),\n entries\n ];\n },\n Object(obj, typ, options, refStack) {\n const isMap = typ !== 'Object';\n const keys = isMap ? obj.keys() : Object.keys(obj);\n const length = isMap ? obj.size : keys.length;\n if (!length) {\n if (options.addBreakTokens === true) {\n return [\n simpleTokens.emptyMap,\n new Token(Type.break)\n ];\n }\n return simpleTokens.emptyMap;\n }\n refStack = Ref.createCheck(refStack, obj);\n const entries = [];\n let i = 0;\n for (const key of keys) {\n entries[i++] = [\n objectToTokens(key, options, refStack),\n objectToTokens(isMap ? obj.get(key) : obj[key], options, refStack)\n ];\n }\n sortMapEntries(entries, options);\n if (options.addBreakTokens) {\n return [\n new Token(Type.map, length),\n entries,\n new Token(Type.break)\n ];\n }\n return [\n new Token(Type.map, length),\n entries\n ];\n }\n};\ntypeEncoders.Map = typeEncoders.Object;\ntypeEncoders.Buffer = typeEncoders.Uint8Array;\nfor (const typ of 'Uint8Clamped Uint16 Uint32 Int8 Int16 Int32 BigUint64 BigInt64 Float32 Float64'.split(' ')) {\n typeEncoders[`${ typ }Array`] = typeEncoders.DataView;\n}\nfunction objectToTokens(obj, options = {}, refStack) {\n const typ = is(obj);\n const customTypeEncoder = options && options.typeEncoders && options.typeEncoders[typ] || typeEncoders[typ];\n if (typeof customTypeEncoder === 'function') {\n const tokens = customTypeEncoder(obj, typ, options, refStack);\n if (tokens != null) {\n return tokens;\n }\n }\n const typeEncoder = typeEncoders[typ];\n if (!typeEncoder) {\n throw new Error(`${ encodeErrPrefix } unsupported type: ${ typ }`);\n }\n return typeEncoder(obj, typ, options, refStack);\n}\nfunction sortMapEntries(entries, options) {\n if (options.mapSorter) {\n entries.sort(options.mapSorter);\n }\n}\nfunction mapSorter(e1, e2) {\n const keyToken1 = Array.isArray(e1[0]) ? e1[0][0] : e1[0];\n const keyToken2 = Array.isArray(e2[0]) ? e2[0][0] : e2[0];\n if (keyToken1.type !== keyToken2.type) {\n return keyToken1.type.compare(keyToken2.type);\n }\n const major = keyToken1.type.major;\n const tcmp = cborEncoders[major].compareTokens(keyToken1, keyToken2);\n if (tcmp === 0) {\n console.warn('WARNING: complex key types used, CBOR key sorting guarantees are gone');\n }\n return tcmp;\n}\nfunction tokensToEncoded(buf, tokens, encoders, options) {\n if (Array.isArray(tokens)) {\n for (const token of tokens) {\n tokensToEncoded(buf, token, encoders, options);\n }\n } else {\n encoders[tokens.type.major](buf, tokens, options);\n }\n}\nfunction encodeCustom(data, encoders, options) {\n const tokens = objectToTokens(data, options);\n if (!Array.isArray(tokens) && options.quickEncodeToken) {\n const quickBytes = options.quickEncodeToken(tokens);\n if (quickBytes) {\n return quickBytes;\n }\n const encoder = encoders[tokens.type.major];\n if (encoder.encodedSize) {\n const size = encoder.encodedSize(tokens, options);\n const buf = new Bl(size);\n encoder(buf, tokens, options);\n if (buf.chunks.length !== 1) {\n throw new Error(`Unexpected error: pre-calculated length for ${ tokens } was wrong`);\n }\n return asU8A(buf.chunks[0]);\n }\n }\n tokensToEncoded(buf, tokens, encoders, options);\n return buf.toBytes(true);\n}\nfunction encode(data, options) {\n options = Object.assign({}, defaultEncodeOptions, options);\n return encodeCustom(data, cborEncoders, options);\n}\nexport {\n objectToTokens,\n encode,\n encodeCustom,\n Ref\n};", "import { decodeErrPrefix } from './common.js';\nimport { Type } from './token.js';\nimport {\n jump,\n quick\n} from './jump.js';\nconst defaultDecodeOptions = {\n strict: false,\n allowIndefinite: true,\n allowUndefined: true,\n allowBigInt: true\n};\nclass Tokeniser {\n constructor(data, options = {}) {\n this.pos = 0;\n this.data = data;\n this.options = options;\n }\n done() {\n return this.pos >= this.data.length;\n }\n next() {\n const byt = this.data[this.pos];\n let token = quick[byt];\n if (token === undefined) {\n const decoder = jump[byt];\n if (!decoder) {\n throw new Error(`${ decodeErrPrefix } no decoder for major type ${ byt >>> 5 } (byte 0x${ byt.toString(16).padStart(2, '0') })`);\n }\n const minor = byt & 31;\n token = decoder(this.data, this.pos, minor, this.options);\n }\n this.pos += token.encodedLength;\n return token;\n }\n}\nconst DONE = Symbol.for('DONE');\nconst BREAK = Symbol.for('BREAK');\nfunction tokenToArray(token, tokeniser, options) {\n const arr = [];\n for (let i = 0; i < token.value; i++) {\n const value = tokensToObject(tokeniser, options);\n if (value === BREAK) {\n if (token.value === Infinity) {\n break;\n }\n throw new Error(`${ decodeErrPrefix } got unexpected break to lengthed array`);\n }\n if (value === DONE) {\n throw new Error(`${ decodeErrPrefix } found array but not enough entries (got ${ i }, expected ${ token.value })`);\n }\n arr[i] = value;\n }\n return arr;\n}\nfunction tokenToMap(token, tokeniser, options) {\n const useMaps = options.useMaps === true;\n const obj = useMaps ? undefined : {};\n const m = useMaps ? new Map() : undefined;\n for (let i = 0; i < token.value; i++) {\n const key = tokensToObject(tokeniser, options);\n if (key === BREAK) {\n if (token.value === Infinity) {\n break;\n }\n throw new Error(`${ decodeErrPrefix } got unexpected break to lengthed map`);\n }\n if (key === DONE) {\n throw new Error(`${ decodeErrPrefix } found map but not enough entries (got ${ i } [no key], expected ${ token.value })`);\n }\n if (useMaps !== true && typeof key !== 'string') {\n throw new Error(`${ decodeErrPrefix } non-string keys not supported (got ${ typeof key })`);\n }\n const value = tokensToObject(tokeniser, options);\n if (value === DONE) {\n throw new Error(`${ decodeErrPrefix } found map but not enough entries (got ${ i } [no value], expected ${ token.value })`);\n }\n if (useMaps) {\n m.set(key, value);\n } else {\n obj[key] = value;\n }\n }\n return useMaps ? m : obj;\n}\nfunction tokensToObject(tokeniser, options) {\n if (tokeniser.done()) {\n return DONE;\n }\n const token = tokeniser.next();\n if (token.type === Type.break) {\n return BREAK;\n }\n if (token.type.terminal) {\n return token.value;\n }\n if (token.type === Type.array) {\n return tokenToArray(token, tokeniser, options);\n }\n if (token.type === Type.map) {\n return tokenToMap(token, tokeniser, options);\n }\n if (token.type === Type.tag) {\n if (options.tags && typeof options.tags[token.value] === 'function') {\n const tagged = tokensToObject(tokeniser, options);\n return options.tags[token.value](tagged);\n }\n throw new Error(`${ decodeErrPrefix } tag not supported (${ token.value })`);\n }\n throw new Error('unsupported');\n}\nfunction decode(data, options) {\n if (!(data instanceof Uint8Array)) {\n throw new Error(`${ decodeErrPrefix } data to decode must be a Uint8Array`);\n }\n options = Object.assign({}, defaultDecodeOptions, options);\n const tokeniser = options.tokenizer || new Tokeniser(data, options);\n const decoded = tokensToObject(tokeniser, options);\n if (decoded === DONE) {\n throw new Error(`${ decodeErrPrefix } did not find any content to decode`);\n }\n if (decoded === BREAK) {\n throw new Error(`${ decodeErrPrefix } got unexpected break`);\n }\n if (!tokeniser.done()) {\n throw new Error(`${ decodeErrPrefix } too many terminals, data makes no sense`);\n }\n return decoded;\n}\nexport {\n Tokeniser,\n tokensToObject,\n decode\n};", "import * as pathing from '../path'\nimport { DirectoryPath, DistinctivePath } from '../path'\nimport { Potency, Resource } from \"../ucan/index\"\n\nexport type Permissions = {\n app?: AppInfo\n fs?: FileSystemPermissions\n platform?: PlatformPermissions\n raw?: RawPermissions\n}\n\nexport type AppInfo = {\n name: string\n creator: string\n}\n\nexport type FileSystemPermissions = {\n private?: Array<DistinctivePath>\n public?: Array<DistinctivePath>\n}\n\nexport type PlatformPermissions = {\n apps: '*' | Array<string>\n}\n\nexport type RawPermissions = Array<RawPermission>\n\nexport type RawPermission = {\n exp: number\n rsc: Resource\n ptc: Potency\n}\n\n\n/**\n * Path for `AppInfo`.\n */\nexport function appDataPath(app: AppInfo): DirectoryPath {\n return pathing.directory(pathing.Branch.Private, \"Apps\", app.creator, app.name)\n}\n\n\n/**\n * Lists the filesystems paths for a set of `Permissions`.\n * This'll return a list of `DistinctivePath`s.\n */\nexport function paths(permissions: Permissions): DistinctivePath[] {\n let list = [] as DistinctivePath[]\n\n if (permissions.app) list.push(appDataPath(permissions.app))\n if (permissions.fs?.private) list = list.concat(\n permissions.fs?.private.map(p => pathing.combine(\n pathing.directory(pathing.Branch.Private),\n p\n ))\n )\n if (permissions.fs?.public) list = list.concat(\n permissions.fs?.public.map(p => pathing.combine(\n pathing.directory(pathing.Branch.Public),\n p\n ))\n )\n\n return list\n}\n", "import * as pathing from '../path'\nimport * as common from '../common/index'\n\nimport * as token from './token'\n\nimport { Resource } from './types'\nimport { getDictionary } from './store'\nimport { DistinctivePath } from '../path'\n\n\n// CONSTANTS\n\n\n// TODO: Waiting on API change.\n// Should be `dnslink`\nexport const WNFS_PREFIX = \"wnfs\"\n\n\n\n// FUNCTIONS\n\n\n/**\n * Given a list of UCANs, generate a dictionary.\n * The key will be in the form of `${resourceKey}:${resourceValue}`\n */\nexport function compile(ucans: Array<string>): Record<string, string> {\n return ucans.reduce((acc, ucanString) => {\n const ucan = token.decode(ucanString)\n\n if (token.isExpired(ucan)) return acc\n\n const label = resourceLabel(ucan.payload.rsc)\n return { ...acc, [label]: ucanString }\n }, {})\n}\n\n/**\n * Creates the label for a given resource in the UCAN dictionary\n */\nexport function resourceLabel(rsc: Resource): string {\n if (typeof rsc !== \"object\") {\n return rsc\n }\n\n const resource = Array.from(Object.entries(rsc))[0]\n return resource[0] + \":\" + (\n resource[0] === WNFS_PREFIX\n ? resource[1].replace(/^\\/+/, \"\")\n : resource[1]\n )\n}\n\n/**\n * Lookup the prefix for a filesystem key in the dictionary.\n */\nexport function filesystemPrefix(username: string): string {\n // const host = `${username}.${setup.endpoints.user}`\n // TODO: Waiting on API change.\n // Should be `${WNFS_PREFIX}:${host}/`\n return WNFS_PREFIX + \":\"\n}\n\n/**\n * Look up a UCAN by label\n */\nexport function lookup(label: string): string | null {\n return getDictionary()[label]\n}\n\n/**\n * Look up a UCAN for a platform app.\n */\nexport async function lookupAppUcan(domain: string): Promise<string | null> {\n const dictionary = getDictionary()\n return dictionary[\"*\"] || dictionary[\"app:*\"] || dictionary[`app:${domain}`]\n}\n\n/**\n * Look up a UCAN with a file system path.\n */\nexport async function lookupFilesystemUcan(path: DistinctivePath | \"*\"): Promise<string | null> {\n if (lookup(\"*\")) {\n return lookup(\"*\")\n }\n\n const all = path === \"*\"\n const isDirectory = all ? false : pathing.isDirectory(path as DistinctivePath)\n const pathParts = all ? [ \"*\" ] : pathing.unwrap(path as DistinctivePath)\n const username = await common.authenticatedUsername()\n const prefix = username ? filesystemPrefix(username) : \"\"\n\n return pathParts.reduce(\n (acc: string | null, part: string, idx: number) => {\n if (acc) return acc\n\n const isLastPart = idx === 0\n const partsSlice = pathParts.slice(0, pathParts.length - idx)\n\n const partialPath = pathing.toPosix(\n isLastPart && !isDirectory\n ? pathing.file(...partsSlice)\n : pathing.directory(...partsSlice)\n )\n\n return lookup(`${prefix}${partialPath}`) || null\n },\n null\n )\n}\n\n", "import cjsModule from '../index.js';\nexport const encode = cjsModule.encode;\nexport const decode = cjsModule.decode;\n", "import * as base58 from 'base58-universal'\nimport * as utils from 'keystore-idb/utils'\n\nimport { BASE58_DID_PREFIX, magicBytes, parseMagicBytes } from './util'\nimport { KeyType } from './types'\n\n\n/**\n * Convert a base64 public key to a DID (did:key).\n */\nexport function publicKeyToDid(\n publicKey: string,\n type: KeyType\n): string {\n const pubKeyBuf = utils.base64ToArrBuf(publicKey)\n\n // Prefix public-write key\n const prefix = magicBytes(type)\n if (prefix === null) {\n throw new Error(`Key type '${type}' not supported`)\n }\n\n const prefixedBuf = utils.joinBufs(prefix, pubKeyBuf)\n\n // Encode prefixed\n return BASE58_DID_PREFIX + base58.encode(new Uint8Array(prefixedBuf))\n}\n\n/**\n * Convert a DID (did:key) to a base64 public key.\n */\nexport function didToPublicKey(did: string): {\n publicKey: string\n type: KeyType\n} {\n if (!did.startsWith(BASE58_DID_PREFIX)) {\n throw new Error(\"Please use a base58-encoded DID formatted `did:key:z...`\")\n }\n\n const didWithoutPrefix = did.substr(BASE58_DID_PREFIX.length)\n const magicalBuf = base58.decode(didWithoutPrefix)\n const { keyBuffer, type } = parseMagicBytes(magicalBuf)\n\n return {\n publicKey: utils.arrBufToBase64(keyBuffer),\n type\n }\n}\n", "export enum KeyType {\n RSA = 'rsa',\n Edwards = 'ed25519',\n BLS = 'bls12-381'\n}\n", "import { arrbufs } from '../common/index'\nimport { KeyType } from './types'\n\n\nexport const EDWARDS_DID_PREFIX = new Uint8Array([ 0xed, 0x01 ])\nexport const BLS_DID_PREFIX = new Uint8Array([ 0xea, 0x01 ])\nexport const RSA_DID_PREFIX = new Uint8Array([ 0x00, 0xf5, 0x02 ])\nexport const BASE58_DID_PREFIX = 'did:key:z'\n\n/**\n * Magic bytes.\n */\nexport function magicBytes(keyType: KeyType): Uint8Array | null {\n switch (keyType) {\n case KeyType.Edwards: return EDWARDS_DID_PREFIX\n case KeyType.RSA: return RSA_DID_PREFIX\n case KeyType.BLS: return BLS_DID_PREFIX\n default: return null\n }\n}\n\n/**\n * Parse magic bytes on prefixed key-buffer\n * to determine cryptosystem & the unprefixed key-buffer.\n */\nexport const parseMagicBytes = (prefixedKey: Uint8Array): {\n keyBuffer: Uint8Array\n type: KeyType\n} => {\n // RSA\n if (hasPrefix(prefixedKey, RSA_DID_PREFIX)) {\n return {\n keyBuffer: prefixedKey.slice(RSA_DID_PREFIX.byteLength),\n type: KeyType.RSA\n }\n\n // EDWARDS\n } else if (hasPrefix(prefixedKey, EDWARDS_DID_PREFIX)) {\n return {\n keyBuffer: prefixedKey.slice(EDWARDS_DID_PREFIX.byteLength),\n type: KeyType.Edwards\n }\n\n // BLS\n } else if (hasPrefix(prefixedKey, BLS_DID_PREFIX)) {\n return {\n keyBuffer: prefixedKey.slice(BLS_DID_PREFIX.byteLength),\n type: KeyType.BLS\n }\n\n }\n\n throw new Error(\"Unsupported key algorithm. Try using RSA.\")\n}\n\n/**\n * Determines if an ArrayBuffer has a given indeterminate length-prefix.\n */\nexport const hasPrefix = (prefixedKey: ArrayBuffer, prefix: ArrayBuffer): boolean => {\n return arrbufs.equal(prefix, prefixedKey.slice(0, prefix.byteLength))\n}\n\nexport const toKeyType = (str: string): KeyType => {\n switch(str) {\n case 'rsa': return KeyType.RSA\n case 'ed25519': return KeyType.Edwards\n case 'bls12-381': return KeyType.BLS\n }\n throw new Error(`Key Type ${str} not supported`)\n}\n", "import * as crypto from '../crypto/index'\nimport { publicKeyToDid } from './transformers'\nimport { toKeyType } from './util'\n\n\n/**\n * Create a DID based on the exchange key-pair.\n */\nexport async function exchange(): Promise<string> {\n const pubKeyB64 = await crypto.keystore.publicReadKey()\n const ksAlg = await crypto.keystore.getAlg()\n\n return publicKeyToDid(\n pubKeyB64,\n toKeyType(ksAlg)\n )\n}\n\n/**\n * Alias `write` to `ucan`\n */\nexport { write as ucan }\n\n/**\n * Create a DID based on the write key-pair.\n */\nexport async function write(): Promise<string> {\n const pubKeyB64 = await crypto.keystore.publicWriteKey()\n const ksAlg = await crypto.keystore.getAlg()\n\n return publicKeyToDid(\n pubKeyB64,\n toKeyType(ksAlg)\n )\n}\n", "\nimport * as crypto from '../crypto/index'\nimport * as utils from 'keystore-idb/utils'\nimport { didToPublicKey } from './transformers'\nimport { KeyType } from './types'\n\n\n/**\n * Verify the signature of some data (string, ArrayBuffer or Uint8Array), given a DID.\n */\nexport async function verifySignedData({ charSize = 16, data, did, signature }: {\n charSize?: number\n data: string\n did: string\n signature: string\n}): Promise<boolean> {\n try {\n const { type, publicKey } = didToPublicKey(did)\n\n const sigBytes = new Uint8Array(utils.base64ToArrBuf(signature))\n const dataBytes = new Uint8Array(utils.normalizeUnicodeToBuf(data, charSize))\n const keyBytes = new Uint8Array(utils.base64ToArrBuf(publicKey))\n\n switch (type) {\n\n case KeyType.Edwards:\n return await crypto.ed25519.verify(dataBytes, sigBytes, keyBytes)\n\n case KeyType.RSA: \n return await crypto.rsa.verify(dataBytes, sigBytes, keyBytes)\n\n default: return false\n }\n\n } catch (_) {\n return false\n\n }\n}\n\n", "import * as did from '../did/local'\nimport { verifySignedData } from '../did/validation'\nimport * as crypto from '../crypto/index'\nimport { base64 } from '../common/index'\nimport { Potency, Fact, Resource, Ucan, UcanHeader, UcanPayload } from './types'\n\n\n/**\n * Create a UCAN, User Controlled Authorization Networks, JWT.\n * This JWT can be used for authorization.\n *\n * ### Header\n *\n * `alg`, Algorithm, the type of signature.\n * `typ`, Type, the type of this data structure, JWT.\n * `uav`, UCAN version.\n *\n * ### Payload\n *\n * `aud`, Audience, the ID of who it's intended for.\n * `exp`, Expiry, unix timestamp of when the jwt is no longer valid.\n * `iss`, Issuer, the ID of who sent this.\n * `nbf`, Not Before, unix timestamp of when the jwt becomes valid.\n * `prf`, Proof, an optional nested token with equal or greater privileges.\n * `ptc`, Potency, which rights come with the token.\n * `rsc`, Resource, the involved resource.\n *\n */\nexport async function build({\n addSignature = true,\n audience,\n facts = [],\n issuer,\n lifetimeInSeconds = 30,\n expiration,\n potency = 'APPEND',\n proof,\n resource\n}: {\n addSignature?: boolean\n audience: string\n facts?: Array<Fact>\n issuer?: string\n lifetimeInSeconds?: number\n expiration?: number\n potency?: Potency\n proof?: string\n resource?: Resource\n}): Promise<Ucan> {\n const currentTimeInSeconds = Math.floor(Date.now() / 1000)\n const decodedProof = proof && decode(proof)\n const ksAlg = await crypto.keystore.getAlg()\n\n // Header\n const header = {\n alg: jwtAlgorithm(ksAlg) || 'UnknownAlgorithm',\n typ: 'JWT',\n uav: '1.0.0' // actually 0.3.1 but server isn't updated yet\n }\n\n // Timestamps\n let exp = expiration || (currentTimeInSeconds + lifetimeInSeconds)\n let nbf = currentTimeInSeconds - 60\n\n if (decodedProof) {\n const prf = decodedProof.payload\n\n exp = Math.min(prf.exp, exp)\n nbf = Math.max(prf.nbf, nbf)\n }\n\n // Payload\n const payload = {\n aud: audience,\n exp: exp,\n fct: facts,\n iss: issuer || await did.ucan(),\n nbf: nbf,\n prf: proof || null,\n ptc: potency,\n rsc: resource ? resource : (decodedProof ? decodedProof.payload.rsc : '*'),\n }\n\n const signature = addSignature ? await sign(header, payload) : null\n\n return {\n header,\n payload,\n signature\n }\n}\n\n/**\n * Try to decode a UCAN.\n * Will throw if it fails.\n *\n * @param ucan The encoded UCAN to decode\n */\nexport function decode(ucan: string): Ucan {\n const split = ucan.split(\".\")\n const header = JSON.parse(base64.urlDecode(split[0]))\n const payload = JSON.parse(base64.urlDecode(split[1]))\n\n return {\n header,\n payload,\n signature: split[2] || null\n }\n}\n\n/**\n * Encode a UCAN.\n *\n * @param ucan The UCAN to encode\n */\nexport function encode(ucan: Ucan): string {\n const encodedHeader = encodeHeader(ucan.header)\n const encodedPayload = encodePayload(ucan.payload)\n\n return encodedHeader + '.' +\n encodedPayload + '.' +\n ucan.signature\n}\n\n/**\n * Encode the header of a UCAN.\n *\n * @param header The UcanHeader to encode\n */\n export function encodeHeader(header: UcanHeader): string {\n return base64.urlEncode(JSON.stringify(header))\n}\n\n/**\n * Encode the payload of a UCAN.\n *\n * @param payload The UcanPayload to encode\n */\nexport function encodePayload(payload: UcanPayload): string {\n return base64.urlEncode(JSON.stringify({\n ...payload\n }))\n}\n\n/**\n * Check if a UCAN is expired.\n *\n * @param ucan The UCAN to validate\n */\nexport function isExpired(ucan: Ucan): boolean {\n return ucan.payload.exp <= Math.floor(Date.now() / 1000)\n}\n\n/**\n * Check if a UCAN is valid.\n *\n * @param ucan The decoded UCAN\n * @param did The DID associated with the signature of the UCAN\n */\n export async function isValid(ucan: Ucan): Promise<boolean> {\n const encodedHeader = encodeHeader(ucan.header)\n const encodedPayload = encodePayload(ucan.payload)\n\n const a = await verifySignedData({\n charSize: 8,\n data: `${encodedHeader}.${encodedPayload}`,\n did: ucan.payload.iss,\n signature: base64.makeUrlUnsafe(ucan.signature || \"\")\n })\n\n if (!a) return a\n if (!ucan.payload.prf) return true\n\n // Verify proofs\n const prf = decode(ucan.payload.prf)\n const b = prf.payload.aud === ucan.payload.iss\n if (!b) return b\n\n return await isValid(prf)\n}\n\n/**\n * Given a UCAN, lookup the root issuer.\n *\n * Throws when given an improperly formatted UCAN.\n * This could be a nested UCAN (ie. proof).\n *\n * @param ucan A UCAN.\n * @returns The root issuer.\n */\nexport function rootIssuer(ucan: string, level = 0): string {\n const p = extractPayload(ucan, level)\n if (p.prf) return rootIssuer(p.prf, level + 1)\n return p.iss\n}\n\n/**\n * Generate UCAN signature.\n */\nexport async function sign(header: UcanHeader, payload: UcanPayload): Promise<string> {\n const encodedHeader = encodeHeader(header)\n const encodedPayload = encodePayload(payload)\n\n return base64.makeUrlSafe(\n await crypto.keystore.sign(`${encodedHeader}.${encodedPayload}`, 8)\n )\n}\n\n\n// \u3299\uFE0F\n\n\n/**\n * JWT algorithm to be used in a JWT header.\n */\nfunction jwtAlgorithm(cryptoSystem: string): string | null {\n switch (cryptoSystem) {\n case \"ed25519\": return 'EdDSA'\n case \"rsa\": return 'RS256'\n default: return null\n }\n}\n\n\n/**\n * Extract the payload of a UCAN.\n *\n * Throws when given an improperly formatted UCAN.\n */\nfunction extractPayload(ucan: string, level: number): { iss: string; prf: string | null } {\n try {\n return JSON.parse(base64.urlDecode(ucan.split(\".\")[1]))\n } catch (_) {\n throw new Error(`Invalid UCAN (${level} level${level === 1 ? \"\" : \"s\"} deep): \\`${ucan}\\``)\n }\n}\n", "import * as storage from '../storage/index'\nimport { UCANS_STORAGE_KEY } from '../common/index'\n\nlet dictionary: Record<string, string> = {}\n\n/**\n * Retrieve dictionary\n */\nexport function getDictionary(): Record<string, string> {\n return dictionary\n}\n\n/**\n * Retrieve dictionary\n */\nexport function setDictionary(updated: Record<string, string>): void {\n dictionary = updated\n}\n\n/**\n * You didn't see anything \uD83D\uDC40\n */\nexport async function clearStorage(): Promise<void> {\n dictionary = {}\n await storage.removeItem(UCANS_STORAGE_KEY)\n}\n\n\n", "import * as pathing from '../path'\nimport * as permissions from './permissions'\nimport * as storage from '../storage/index'\n\nimport * as dictionary from './dictionary'\nimport * as token from './token'\nimport { getDictionary, setDictionary } from './store'\n\nimport { UCANS_STORAGE_KEY } from '../common/index'\nimport { Permissions } from './permissions'\n\n\n\n/**\n * Store UCANs and update the in-memory dictionary.\n */\nexport async function store(ucans: Array<string>): Promise<void> {\n const existing = await storage.getItem(UCANS_STORAGE_KEY) as Array<string>\n const newList = (existing || []).concat(ucans)\n\n setDictionary(dictionary.compile(newList))\n\n const filteredList = listFromDictionary()\n await storage.setItem(UCANS_STORAGE_KEY, filteredList)\n}\n\n/**\n * See if the stored UCANs in the in-memory dictionary\n * conform to the given `Permissions`.\n */\nexport function validatePermissions(\n { app, fs, raw }: Permissions,\n username: string\n): boolean {\n const prefix = dictionary.filesystemPrefix(username)\n\n // Root access\n const rootUcan = dictionary.lookup(\"*\")\n if (rootUcan && !token.isExpired(token.decode(rootUcan))) return true\n\n // Check permissions\n if (app) {\n const k = prefix + pathing.toPosix(permissions.appDataPath(app))\n const u = dictionary.lookup(k)\n if (!u || token.isExpired(token.decode(u))) return false\n }\n\n if (fs?.private) {\n const priv = fs.private.every(path => {\n const pathWithPrefix = `${prefix}private/` + pathing.toPosix(path)\n const u = dictionary.lookup(pathWithPrefix)\n return u && !token.isExpired(token.decode(u))\n })\n if (!priv) return false\n }\n\n if (fs?.public) {\n const publ = fs.public.every(path => {\n const pathWithPrefix = `${prefix}public/` + pathing.toPosix(path)\n const u = dictionary.lookup(pathWithPrefix)\n return u && !token.isExpired(token.decode(u))\n })\n if (!publ) return false\n }\n\n if (raw) {\n const hasRaw = raw.every(r => {\n const label = dictionary.resourceLabel(r.rsc)\n const u = dictionary.lookup(label)\n return u && !token.isExpired(token.decode(u))\n })\n if(!hasRaw) return false\n }\n\n return true\n}\n\n\n\n// \u3299\uFE0F\n\n\nfunction listFromDictionary(): Array<string> {\n return Object.values(getDictionary())\n}\n", "export * from './getters'\nexport * from './transformers'\nexport * from './types'\nexport * from './validation'\n", "import * as common from '../common/index'\n\nimport * as dns from '../dns/index'\nimport { isString } from '../common/index'\nimport { getDictionary } from '../ucan/store'\nimport { rootIssuer } from '../ucan/token'\nimport { setup } from '../setup/internal'\n\nexport * from './local'\n\n\n/**\n * Get the root write-key DID for a user.\n * Stored at `_did.${username}.${endpoints.user}`\n */\nexport async function root(\n username: string\n): Promise<string> {\n const domain = setup.endpoints.user\n\n try {\n const maybeDid = await dns.lookupTxtRecord(`_did.${username}.${domain}`)\n if (maybeDid !== null) return maybeDid\n } catch (_err) { \n // lookup failed\n }\n\n throw new Error(\"Could not locate user DID in DNS.\")\n}\n\n/**\n * Get a user's own root write-key DID.\n */\nexport async function ownRoot(): Promise<string> {\n // first try looking in UCAN dictionary\n const dict = getDictionary()\n const first = Object.values(dict)[0]\n if (first !== undefined) {\n return rootIssuer(first[1])\n }\n\n // if that fails look up user DNS root\n const username = await common.authenticatedUsername()\n if(!isString(username)) {\n throw new Error(\"No logged in user\")\n }\n return root(username)\n}\n", "/* eslint-disable no-undefined,no-param-reassign,no-shadow */\n\n/**\n * Throttle execution of a function. Especially useful for rate limiting\n * execution of handlers on events like resize and scroll.\n *\n * @param {number} delay - A zero-or-greater delay in milliseconds. For event callbacks, values around 100 or 250 (or even higher) are most useful.\n * @param {boolean} [noTrailing] - Optional, defaults to false. If noTrailing is true, callback will only execute every `delay` milliseconds while the\n * throttled-function is being called. If noTrailing is false or unspecified, callback will be executed one final time\n * after the last throttled-function call. (After the throttled-function has not been called for `delay` milliseconds,\n * the internal counter is reset).\n * @param {Function} callback - A function to be executed after delay milliseconds. The `this` context and all arguments are passed through, as-is,\n * to `callback` when the throttled-function is executed.\n * @param {boolean} [debounceMode] - If `debounceMode` is true (at begin), schedule `clear` to execute after `delay` ms. If `debounceMode` is false (at end),\n * schedule `callback` to execute after `delay` ms.\n *\n * @returns {Function} A new, throttled, function.\n */\nexport default function (delay, noTrailing, callback, debounceMode) {\n\t/*\n\t * After wrapper has stopped being called, this timeout ensures that\n\t * `callback` is executed at the proper times in `throttle` and `end`\n\t * debounce modes.\n\t */\n\tlet timeoutID;\n\tlet cancelled = false;\n\n\t// Keep track of the last time `callback` was executed.\n\tlet lastExec = 0;\n\n\t// Function to clear existing timeout\n\tfunction clearExistingTimeout() {\n\t\tif (timeoutID) {\n\t\t\tclearTimeout(timeoutID);\n\t\t}\n\t}\n\n\t// Function to cancel next exec\n\tfunction cancel() {\n\t\tclearExistingTimeout();\n\t\tcancelled = true;\n\t}\n\n\t// `noTrailing` defaults to falsy.\n\tif (typeof noTrailing !== 'boolean') {\n\t\tdebounceMode = callback;\n\t\tcallback = noTrailing;\n\t\tnoTrailing = undefined;\n\t}\n\n\t/*\n\t * The `wrapper` function encapsulates all of the throttling / debouncing\n\t * functionality and when executed will limit the rate at which `callback`\n\t * is executed.\n\t */\n\tfunction wrapper(...arguments_) {\n\t\tlet self = this;\n\t\tlet elapsed = Date.now() - lastExec;\n\n\t\tif (cancelled) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Execute `callback` and update the `lastExec` timestamp.\n\t\tfunction exec() {\n\t\t\tlastExec = Date.now();\n\t\t\tcallback.apply(self, arguments_);\n\t\t}\n\n\t\t/*\n\t\t * If `debounceMode` is true (at begin) this is used to clear the flag\n\t\t * to allow future `callback` executions.\n\t\t */\n\t\tfunction clear() {\n\t\t\ttimeoutID = undefined;\n\t\t}\n\n\t\tif (debounceMode && !timeoutID) {\n\t\t\t/*\n\t\t\t * Since `wrapper` is being called for the first time and\n\t\t\t * `debounceMode` is true (at begin), execute `callback`.\n\t\t\t */\n\t\t\texec();\n\t\t}\n\n\t\tclearExistingTimeout();\n\n\t\tif (debounceMode === undefined && elapsed > delay) {\n\t\t\t/*\n\t\t\t * In throttle mode, if `delay` time has been exceeded, execute\n\t\t\t * `callback`.\n\t\t\t */\n\t\t\texec();\n\t\t} else if (noTrailing !== true) {\n\t\t\t/*\n\t\t\t * In trailing throttle mode, since `delay` time has not been\n\t\t\t * exceeded, schedule `callback` to execute `delay` ms after most\n\t\t\t * recent execution.\n\t\t\t *\n\t\t\t * If `debounceMode` is true (at begin), schedule `clear` to execute\n\t\t\t * after `delay` ms.\n\t\t\t *\n\t\t\t * If `debounceMode` is false (at end), schedule `callback` to\n\t\t\t * execute after `delay` ms.\n\t\t\t */\n\t\t\ttimeoutID = setTimeout(\n\t\t\t\tdebounceMode ? clear : exec,\n\t\t\t\tdebounceMode === undefined ? delay - elapsed : delay\n\t\t\t);\n\t\t}\n\t}\n\n\twrapper.cancel = cancel;\n\n\t// Return the wrapper function.\n\treturn wrapper;\n}\n", "/* eslint-disable no-undefined */\n\nimport throttle from './throttle';\n\n/**\n * Debounce execution of a function. Debouncing, unlike throttling,\n * guarantees that a function is only executed a single time, either at the\n * very beginning of a series of calls, or at the very end.\n *\n * @param {number} delay - A zero-or-greater delay in milliseconds. For event callbacks, values around 100 or 250 (or even higher) are most useful.\n * @param {boolean} [atBegin] - Optional, defaults to false. If atBegin is false or unspecified, callback will only be executed `delay` milliseconds\n * after the last debounced-function call. If atBegin is true, callback will be executed only at the first debounced-function call.\n * (After the throttled-function has not been called for `delay` milliseconds, the internal counter is reset).\n * @param {Function} callback - A function to be executed after delay milliseconds. The `this` context and all arguments are passed through, as-is,\n * to `callback` when the debounced-function is executed.\n *\n * @returns {Function} A new, debounced function.\n */\nexport default function (delay, atBegin, callback) {\n\treturn callback === undefined\n\t\t? throttle(delay, atBegin, false)\n\t\t: throttle(delay, callback, atBegin !== false);\n}\n", "import dagPB, { DAGLink } from 'ipld-dag-pb'\nimport type { IPFSEntry } from 'ipfs-core-types/src/root'\n\nimport { Link, SimpleLink } from './types'\nimport { mtimeFromMs } from './metadata'\n\n\nexport const toDAGLink = (link: SimpleLink): DAGLink => {\n const { name, cid, size } = link\n return new dagPB.DAGLink(name, size, cid)\n}\n\nexport const fromFSFile = (fsObj: IPFSEntry): Link => {\n const { name = '', cid, size, mtime, type } = fsObj\n return {\n name,\n cid: cid.toString(),\n size,\n mtime,\n isFile: type !== \"dir\"\n }\n}\n\nexport const fromDAGLink = (link: DAGLink): SimpleLink => {\n const name = link.Name\n const cid = link.Hash.toString()\n const size = link.Tsize\n return { name, cid, size }\n}\n\nexport const make = (name: string, cid: string, isFile: boolean, size: number): Link => {\n return {\n name,\n cid,\n size,\n isFile,\n mtime: mtimeFromMs(Date.now())\n }\n}\n\ntype HasName = { name: string }\n\nexport const arrToMap = <T extends HasName>(arr: T[]): { [name: string]: T } => {\n return arr.reduce((acc, cur) => {\n acc[cur.name] = cur\n return acc\n }, {} as { [name: string]: T})\n}\n", "import { Maybe } from '../common/index'\n\n\n// TYPES\nexport type SemVer = {\n major: number\n minor: number\n patch: number\n}\n\n\n// FUNCTIONS\nexport const encode = (major: number, minor: number, patch: number): SemVer => {\n return {\n major,\n minor,\n patch\n }\n}\n\nexport const fromString = (str: string): Maybe<SemVer> => {\n const parts = str.split('.').map(x => parseInt(x)) // dont shorten this because parseInt has a second param\n if (parts.length !== 3 || parts.some(p => typeof p !== 'number')) {\n return null\n }\n return {\n major: parts[0],\n minor: parts[1],\n patch: parts[2]\n }\n}\n\nexport const toString = (version: SemVer): string => {\n const { major, minor, patch } = version\n return `${major}.${minor}.${patch}`\n}\n\n\n// VERSIONS\nexport const v0 = encode(0, 0, 0)\nexport const v1 = encode(1, 0, 0)\nexport const latest = encode(1, 0, 0)\n", "import type { Mtime } from 'ipfs-unixfs'\nimport * as semver from './semver'\nimport { SemVer } from './semver'\n\nexport type UnixFileMode = number\n\nexport enum UnixNodeType {\n Raw = 'raw',\n Directory = 'dir',\n File = 'file',\n Metadata = 'metadata',\n Symlink = 'symlink',\n HAMTShard = 'hamtShard',\n}\n\nexport type UnixMeta = { \n mtime: number\n ctime: number\n mode: UnixFileMode\n _type: string\n}\n\nexport type Metadata = {\n unixMeta: UnixMeta\n isFile: boolean\n version: SemVer\n}\n\nexport const emptyUnix = (isFile: boolean): UnixMeta => ({\n mtime: Date.now(),\n ctime: Date.now(),\n mode: isFile ? 644 : 755,\n _type: isFile ? UnixNodeType.File : UnixNodeType.Directory,\n})\n\nexport const empty = (isFile: boolean): Metadata => ({\n isFile,\n version: semver.latest,\n unixMeta: emptyUnix(isFile)\n})\n\nexport const updateMtime = (metadata: Metadata): Metadata => ({\n ...metadata,\n unixMeta: {\n ...metadata.unixMeta,\n mtime: Date.now()\n }\n})\n\nexport function mtimeFromMs(ms: number): Mtime {\n const secs = Math.floor(ms / 1000)\n return {\n secs: secs,\n nsecs: (ms - (secs * 1000)) * 1000\n }\n}\n", "/** @internal */\nimport type { ImportCandidate } from 'ipfs-core-types/src/utils'\n\nimport * as ipfs from '../../ipfs/index'\nimport { CID, FileContent, AddResult } from '../../ipfs/index'\n\nimport { SimpleLinks, Links } from '../types'\nimport * as link from '../link'\n\n\nexport const getFile = async (cid: CID): Promise<Uint8Array> => {\n return ipfs.catBuf(cid)\n}\n\nexport const getEncryptedFile = async (cid: CID, key: string): Promise<FileContent> => {\n return ipfs.encoded.catAndDecode(cid, key) as Promise<FileContent>\n}\n\nexport const putFile = async (content: ImportCandidate): Promise<AddResult> => {\n return ipfs.add(content)\n}\n\nexport const putEncryptedFile = async (content: FileContent, key: string): Promise<AddResult> => {\n return ipfs.encoded.add(content, key)\n}\n\nexport const getSimpleLinks = async (cid: CID): Promise<SimpleLinks> => {\n const dagNode = await ipfs.dagGet(cid)\n return link.arrToMap(\n dagNode.Links.map(link.fromDAGLink)\n )\n}\n\nexport const getLinks = async (cid: CID): Promise<Links> => {\n const raw = await ipfs.ls(cid)\n const links = link.arrToMap(\n raw.map(link.fromFSFile)\n )\n // ipfs.ls does not return size, so we need to interpolate that in ourselves\n // @@TODO: split into two functions: getLinks & getLinksDetailed. mtime & isFile are stored in our FS format in all but the pretty tree\n const dagNode = await ipfs.dagGet(cid)\n dagNode.Links.forEach((l) => {\n if(links[l.Name] && links[l.Name].size === 0){\n links[l.Name].size = l.Tsize\n }\n })\n return links\n}\n\nexport const putLinks = async (links: Links | SimpleLinks): Promise<AddResult> => {\n const dagLinks = Object.values(links)\n .filter(l => l !== undefined)\n .map(link.toDAGLink)\n return ipfs.dagPutLinks(dagLinks)\n}\n", "/** @internal */\n\n/** @internal */\nimport { Link, Links } from '../../types'\nimport { TreeInfo, FileInfo, Skeleton, PutDetails } from './types'\nimport { Metadata } from '../../metadata'\nimport { isString } from '../../../common/type-checks'\nimport * as check from '../../types/check'\n\nimport { isValue, Maybe, blob } from '../../../common/index'\nimport * as ipfs from '../../../ipfs/index'\nimport { CID, FileContent } from '../../../ipfs/index'\nimport * as link from '../../link'\n\nimport * as basic from '../basic'\n\nexport const putTree = async (\n links: Links,\n skeletonVal: Skeleton,\n metadataVal: Metadata,\n previousCID: Maybe<CID>\n ): Promise<PutDetails> => {\n const userlandInfo = await basic.putLinks(links)\n const userland = link.make('userland', userlandInfo.cid, true, userlandInfo.size)\n const [metadata, skeleton] = await Promise.all([\n putAndMakeLink('metadata', metadataVal),\n putAndMakeLink('skeleton', skeletonVal),\n ])\n const previous = previousCID != null\n ? link.make('previous', previousCID, false, await ipfs.size(previousCID))\n : undefined\n\n const internalLinks = { metadata, skeleton, userland, previous } as Links\n const { cid, size } = await basic.putLinks(internalLinks)\n return {\n cid,\n userland: userland.cid,\n metadata: metadata.cid,\n size,\n isFile: false,\n skeleton: skeletonVal\n }\n}\n\nexport const putFile = async (\n content: FileContent,\n metadataVal: Metadata,\n previousCID: Maybe<CID>\n ): Promise<PutDetails> => {\n const userlandInfo = await basic.putFile(await normalizeFileContent(content))\n const userland = link.make('userland', userlandInfo.cid, true, userlandInfo.size)\n const metadata = await putAndMakeLink('metadata', metadataVal)\n const previous = previousCID != null\n ? link.make('previous', previousCID, false, await ipfs.size(previousCID))\n : undefined\n\n const internalLinks = { metadata, userland, previous } as Links\n const { cid, size } = await basic.putLinks(internalLinks)\n return {\n cid,\n userland: userland.cid,\n metadata: metadata.cid,\n size,\n isFile: true,\n skeleton: {}\n }\n}\n\nexport const putAndMakeLink = async (name: string, val: FileContent): Promise<Link> => {\n const { cid, size } = await ipfs.encoded.add(val, null)\n return link.make(name, cid, true, size)\n}\n\nexport const get = async (cid: CID): Promise<TreeInfo | FileInfo> => {\n const links = await basic.getLinks(cid)\n const metadata = await getAndCheckValue(links, 'metadata', check.isMetadata)\n const skeleton = metadata.isFile\n ? undefined\n : await getAndCheckValue(links, 'skeleton', check.isSkeleton)\n\n const userland = links['userland']?.cid || null\n if (!check.isCID(userland)) throw new Error(\"Could not find userland\")\n\n const previous = links['previous']?.cid || undefined\n return { userland, metadata, previous, skeleton }\n}\n\nexport const getValue = async (\n linksOrCID: Links | CID,\n name: string,\n): Promise<unknown> => {\n if (isString(linksOrCID)) {\n const links = await basic.getLinks(linksOrCID)\n return getValueFromLinks(links, name)\n }\n\n return getValueFromLinks(linksOrCID, name)\n}\n\nexport const getValueFromLinks = async (\n links: Links,\n name: string,\n): Promise<unknown> => {\n const linkCID = links[name]?.cid\n if (!linkCID) return null\n\n return ipfs.encoded.catAndDecode(linkCID, null)\n}\nexport const getAndCheckValue = async <T>(\n linksOrCid: Links | CID,\n name: string,\n checkFn: (val: any) => val is T,\n canBeNull = false\n): Promise<T> => {\n const val = await getValue(linksOrCid, name)\n return checkValue(val, name, checkFn, canBeNull)\n}\n\nexport const checkValue = <T>(val: any, name: string, checkFn: (val: any) => val is T, canBeNull = false): T => {\n if(!isValue(val)){\n if(canBeNull) return val\n throw new Error(`Could not find header value: ${name}`)\n }\n if(checkFn(val)){\n return val\n }\n throw new Error(`Improperly formatted header value: ${name}`)\n}\n\nexport async function normalizeFileContent(content: FileContent): Promise<Uint8Array> {\n if (content instanceof Uint8Array) {\n return content\n }\n if (typeof Blob !== \"undefined\" && content instanceof Blob) {\n return await blob.toBuffer(content)\n }\n\n const encoder = new TextEncoder()\n\n if (typeof content === \"string\") {\n return encoder.encode(content)\n }\n\n const json = JSON.stringify(content)\n return encoder.encode(json)\n}\n", "/** @internal */\n\n/** @internal */\nimport { isString, isObject, isNum, isBool } from '../../common/index'\nimport { CID } from '../../ipfs/index'\nimport { Tree, File, Link, Links, BaseLink } from '../types'\nimport { Skeleton, TreeInfo, FileInfo, TreeHeader, FileHeader } from '../protocol/public/types'\nimport { SemVer } from '../semver'\nimport { Metadata, UnixMeta } from '../metadata'\n\n\nexport const isFile = (obj: any): obj is File => {\n return isObject(obj) && obj.content !== undefined\n}\n\nexport const isTree = (obj: any): obj is Tree => {\n return isObject(obj) && obj.ls !== undefined\n}\n\nexport const isBaseLink = (obj: any): obj is BaseLink => {\n return isObject(obj)\n && isString(obj.name)\n && isNum(obj.size)\n && isBool(obj.isFile)\n}\n\nexport const isLink = (obj: any): obj is Link => {\n return isBaseLink(obj)\n && isCID((obj as any).cid)\n}\n\nexport const isLinks = (obj: any): obj is Links => {\n return isObject(obj)\n && Object.values(obj).every(isLink)\n}\n\nexport const isUnixMeta = (obj: any): obj is UnixMeta => {\n return isObject(obj) \n && isNum(obj.mtime)\n && isNum(obj.ctime)\n && isNum(obj.mode)\n && isString(obj._type)\n}\n\nexport const isMetadata = (obj: any): obj is Metadata => {\n return isObject(obj) \n && isUnixMeta(obj.unixMeta)\n && isBool(obj.isFile)\n && isSemVer(obj.version)\n}\n\nexport const isSkeleton = (obj: any): obj is Skeleton => {\n return isObject(obj) \n && Object.values(obj).every(val => (\n isObject(val)\n && isCID(val.cid)\n && isCID(val.userland)\n && isCID(val.metadata)\n && isSkeleton(val.subSkeleton)\n ))\n}\n\nexport const isTreeHeader = (obj: any): obj is TreeHeader => {\n return isObject(obj)\n && isSkeleton(obj.skeleton)\n && isMetadata(obj.metadata)\n && obj.metadata.isFile === false\n}\n\nexport const isTreeInfo = (obj: any): obj is TreeInfo => {\n return isTreeHeader(obj)\n && isCID((obj as any).userland)\n}\n\nexport const isFileHeader = (obj: any): obj is FileHeader => {\n return isObject(obj)\n && isMetadata(obj.metadata)\n && obj.metadata.isFile === true\n}\n\nexport const isFileInfo = (obj: any): obj is FileInfo => {\n return isFileHeader(obj)\n && isCID((obj as any).userland)\n}\n\nexport const isCID = (obj: any): obj is CID => {\n return isString(obj)\n}\n\nexport const isCIDList = (obj: any): obj is CID[] => {\n return Array.isArray(obj)\n && obj.every(isCID)\n}\n\nexport const isSemVer = (obj: any): obj is SemVer => {\n if (!isObject(obj)) return false\n const { major, minor, patch } = obj\n return isNum(major) && isNum(minor) && isNum(patch)\n}\n", "import { Maybe } from \"../../../common/index\"\nimport * as ipfs from \"../../../ipfs/index\"\nimport { CID } from \"../../../ipfs/index\"\nimport MMPT from \"./mmpt\"\nimport { DecryptedNode, PrivateAddResult, Revision } from './types'\nimport * as check from './types/check'\nimport * as namefilter from './namefilter'\nimport { BareNameFilter, PrivateName } from './namefilter'\nimport * as basic from '../basic'\n\n\nexport const addNode = async (mmpt: MMPT, node: DecryptedNode, key: string): Promise<PrivateAddResult> => {\n const { cid, size } = await basic.putEncryptedFile(node, key)\n const filter = await namefilter.addRevision(node.bareNameFilter, key, node.revision)\n const name = await namefilter.toPrivateName(filter)\n await mmpt.add(name, cid)\n\n // if the node is a file, we also add the content to the MMPT\n if (check.isPrivateFileInfo(node)) {\n const contentBareFilter = await namefilter.addToBare(node.bareNameFilter, node.key)\n const contentFilter = await namefilter.addRevision(contentBareFilter, node.key, node.revision)\n const contentName = await namefilter.toPrivateName(contentFilter)\n await mmpt.add(contentName, node.content)\n }\n\n const [skeleton, isFile] = check.isPrivateFileInfo(node) ? [{}, true] : [node.skeleton, false]\n return { cid, name, key, size, isFile, skeleton }\n}\n\nexport const readNode = async (cid: CID, key: string): Promise<DecryptedNode> => {\n const content = await ipfs.encoded.catAndDecode(cid, key)\n if (!check.isDecryptedNode(content)) {\n throw new Error(`Could not parse a valid filesystem object, ${cid}`)\n }\n return content\n}\n\nexport const getByName = async (mmpt: MMPT, name: PrivateName, key: string): Promise<Maybe<DecryptedNode>> => {\n const cid = await mmpt.get(name)\n if (cid === null) return null\n return getByCID(cid, key)\n}\n\nexport const getByCID = async (cid: CID, key: string): Promise<DecryptedNode> => {\n return await readNode(cid, key)\n}\n\nexport const getByLatestName = async (mmpt: MMPT, name: PrivateName, key: string): Promise<Maybe<DecryptedNode>> => {\n const cid = await mmpt.get(name)\n if (cid === null) return null\n return getLatestByCID(mmpt, cid, key)\n}\n\nexport const getLatestByCID = async (mmpt: MMPT, cid: CID, key: string): Promise<DecryptedNode> => {\n const node = await getByCID(cid, key)\n const latest = await findLatestRevision(mmpt, node.bareNameFilter, key, node.revision)\n return latest?.cid\n ? await getByCID(latest?.cid, key)\n : node\n}\n\nexport const getLatestByBareNameFilter = async(mmpt: MMPT, bareName: BareNameFilter, key:string): Promise<Maybe<DecryptedNode>> => {\n const revisionFilter = await namefilter.addRevision(bareName, key, 1)\n const name = await namefilter.toPrivateName(revisionFilter)\n return getByLatestName(mmpt, name, key)\n}\n\nexport const findLatestRevision = async (mmpt: MMPT, bareName: BareNameFilter, key: string, lastKnownRevision: number): Promise<Maybe<Revision>> => {\n // Exponential search forward\n let lowerBound = lastKnownRevision, upperBound = null\n let i = 0\n let lastRevision: Maybe<Revision> = null\n\n while (upperBound === null) {\n const toCheck = lastKnownRevision + Math.pow(2, i)\n const thisRevision = await getRevision(mmpt, bareName, key, toCheck)\n\n if (thisRevision !== null) {\n lastRevision = thisRevision\n lowerBound = toCheck\n } else {\n upperBound = toCheck\n }\n\n i++\n }\n\n // Binary search back\n while (lowerBound < (upperBound - 1)) {\n const midpoint = Math.floor((upperBound + lowerBound) / 2)\n const thisRevision = await getRevision(mmpt, bareName, key, midpoint)\n\n if (thisRevision !== null) {\n lastRevision = thisRevision\n lowerBound = midpoint\n } else {\n upperBound = midpoint\n }\n }\n\n return lastRevision\n}\n\nexport const getRevision = async (mmpt: MMPT, bareName: BareNameFilter, key: string, revision: number): Promise<Maybe<Revision>> => {\n const filter = await namefilter.addRevision(bareName, key, revision)\n const name = await namefilter.toPrivateName(filter)\n const cid = await mmpt.get(name)\n return cid ? { cid, name, number: revision } : null\n}\n", "import { isNum, isObject, isString } from '../../../../common/index'\nimport * as check from '../../../types/check'\nimport { PrivateFileInfo, PrivateTreeInfo, PrivateLink, PrivateLinks, DecryptedNode, PrivateSkeletonInfo, PrivateSkeleton } from '../types'\n\nexport const isDecryptedNode = (obj: any): obj is DecryptedNode => {\n return isPrivateTreeInfo(obj) || isPrivateFileInfo(obj)\n}\n\nexport const isPrivateFileInfo = (obj: any): obj is PrivateFileInfo => {\n return isObject(obj)\n && check.isMetadata(obj.metadata)\n && obj.metadata.isFile\n && isString(obj.key)\n && check.isCID(obj.content)\n}\n\nexport const isPrivateTreeInfo = (obj: any): obj is PrivateTreeInfo => {\n return isObject(obj)\n && check.isMetadata(obj.metadata)\n && obj.metadata.isFile === false\n && isNum(obj.revision)\n && isPrivateLinks(obj.links)\n && isPrivateSkeleton(obj.skeleton)\n}\n\nexport const isPrivateLink = (obj: any): obj is PrivateLink => {\n return check.isBaseLink(obj)\n && isString((obj as any).key)\n && isString((obj as any).pointer)\n}\n\nexport const isPrivateLinks = (obj: any): obj is PrivateLinks => {\n return isObject(obj)\n && Object.values(obj).every(isPrivateLink)\n}\n\nexport const isPrivateSkeleton = (obj: any): obj is PrivateSkeleton => {\n return isObject(obj)\n && Object.values(obj).every(isPrivateSkeletonInfo)\n}\n\nexport const isPrivateSkeletonInfo = (obj: any): obj is PrivateSkeletonInfo => {\n return isObject(obj)\n && check.isCID(obj.cid)\n && isString(obj.key)\n && isPrivateSkeleton(obj.subSkeleton)\n}\n", "import { BloomFilter } from 'fission-bloom-filters'\nimport * as hex from '../../../common/hex'\nimport { Opaque } from '../../../common/types'\nimport * as crypto from '../../../crypto/index'\n\n// CONSTANTS\n\nconst FILTER_SIZE = 1024\nconst HASH_COUNT = 16\nconst SATURATION_THRESHOLD = 320\n\n\n// TYPES\n\n// a hashed name filter\nexport type PrivateName = Opaque<\"PrivateName\", string>\n\n// a name filter with just path elements in it, no revision number\nexport type BareNameFilter = Opaque<\"BareNameFilter\", string>\n\n// a name filter with path elements & revision number in it\nexport type RevisionNameFilter = Opaque<\"RevisionNameFilter\", string>\n\n// a name filter with path elements & revision number in it, saturated to ~320 bits\nexport type SaturatedNameFilter = Opaque<\"SaturatedNameFilter\", string>\n\n\n\n// FUNCTIONS\n\n// create bare name filter with a single key\nexport const createBare = async (key: string): Promise<BareNameFilter> => {\n const empty = \"0\".repeat(FILTER_SIZE/4) as BareNameFilter\n return addToBare(empty, key)\n}\n\n// add some string to a name filter\nexport const addToBare = async (bareFilter: BareNameFilter, toAdd: string): Promise<BareNameFilter> => {\n const filter = fromHex(bareFilter)\n const hash = await crypto.hash.sha256Str(toAdd)\n filter.add(hash)\n return (await toHex(filter)) as BareNameFilter\n}\n\n// add the revision number to the name filter, salted with the AES key for the node\nexport const addRevision = async (bareFilter: BareNameFilter, key: string, revision: number): Promise<RevisionNameFilter> => {\n return (await addToBare(bareFilter, `${revision}${key}`)) as string as RevisionNameFilter\n}\n\n// saturate the filter to 320 bits and hash it with sha256 to give the private name that a node will be stored in the MMPT with\nexport const toPrivateName = async (revisionFilter: RevisionNameFilter): Promise<PrivateName> => {\n const saturated = await saturateFilter(fromHex(revisionFilter))\n return toHash(saturated)\n}\n\n// hash a filter with sha256\nexport const toHash = async (filter: BloomFilter): Promise<PrivateName> => {\n const filterBytes = new Uint8Array(filter.toBytes())\n const hash = await crypto.hash.sha256(filterBytes)\n return (hex.fromBytes(hash)) as PrivateName\n}\n\n// saturate a filter (string) to 320 bits\nexport const saturate = async (filter: RevisionNameFilter, threshold = SATURATION_THRESHOLD): Promise<SaturatedNameFilter> => {\n const saturated = await saturateFilter(fromHex(filter), threshold)\n return (await toHex(saturated)) as SaturatedNameFilter\n}\n\n// saturate a filter to 320 bits\nconst saturateFilter = async (filter: BloomFilter, threshold = SATURATION_THRESHOLD): Promise<BloomFilter> => {\n if(threshold > filter.toBytes().byteLength * 8) {\n throw new Error(\"threshold is bigger than filter size\")\n }\n const bits = countOnes(filter)\n if(bits >= threshold){\n return filter\n }\n\n // add hash of filter to saturate\n // theres a chance that the hash will collide with the existing filter and this gets stuck in an infinite loop\n // in that case keep re-hashing the hash & adding to the filter until there is no collision\n const before = filter.toBytes()\n let toHash = before\n do {\n const hash = await crypto.hash.sha256(toHash)\n filter.add(hex.fromBytes(hash))\n toHash = hash\n } while (bufEquals(before, filter.toBytes()))\n\n return saturateFilter(filter, threshold)\n}\n\n// count the number of 1 bits in a filter\nconst countOnes = (filter: BloomFilter): number => {\n const arr = new Uint32Array(filter.toBytes())\n let count = 0\n for(let i=0; i< arr.length; i++){\n count += bitCount32(arr[i])\n }\n return count\n}\n\n// convert a filter to hex\nexport const toHex = (filter: BloomFilter): string => {\n return hex.fromBytes(filter.toBytes())\n}\n\n// convert hex to a BloomFilter object\nexport const fromHex = (string: string): BloomFilter => {\n const buf = hex.toBytes(string)\n return BloomFilter.fromBytes(buf, HASH_COUNT)\n}\n\nconst bufEquals = (buf1: ArrayBuffer, buf2: ArrayBuffer): boolean => {\n if(buf1.byteLength !== buf2.byteLength) return false\n const arr1 = new Uint8Array(buf1)\n const arr2 = new Uint8Array(buf2)\n for(let i=0; i<arr1.length; i++){\n if(arr1[i] !== arr2[i]) {\n return false\n }\n }\n return true\n}\n\n// counts the number of 1s in a uint32\n// from: https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel\nconst bitCount32 = (num: number): number => {\n const a = num - ((num >> 1) & 0x55555555)\n const b = (a & 0x33333333) + ((a >> 2) & 0x33333333)\n return ((b + (b >> 4) & 0xF0F0F0F) * 0x1010101) >> 24\n}\n", "/** @internal */\n\n/** @internal */\nimport { File } from '../types'\nimport { AddResult, CID, FileContent } from '../../ipfs/index'\n\n\nexport abstract class BaseFile implements File {\n\n content: FileContent\n\n constructor(content: FileContent) {\n this.content = content\n }\n\n async put(): Promise<CID> {\n const { cid } = await this.putDetailed()\n return cid\n }\n\n async updateContent(content: FileContent): Promise<this> {\n this.content = content\n return this\n }\n\n abstract putDetailed(): Promise<AddResult>\n}\n\n\nexport default BaseFile\n", "import { AddResult, CID, FileContent } from '../../ipfs/index'\nimport * as protocol from '../protocol/index'\nimport BaseFile from '../base/file'\nimport { isObject } from '../../common/index'\n\n\nexport class BareFile extends BaseFile {\n\n static create(content: FileContent): BareFile {\n return new BareFile(content)\n }\n\n static async fromCID(cid: CID): Promise<BareFile> {\n const content = await protocol.basic.getFile(cid)\n return new BareFile(content)\n }\n\n static instanceOf (obj: any): obj is BareFile {\n return isObject(obj) && obj.content !== undefined\n }\n\n async put(): Promise<CID> {\n const { cid } = await this.putDetailed()\n return cid\n }\n\n async putDetailed(): Promise<AddResult> {\n return protocol.basic.putFile(await protocol.pub.normalizeFileContent(this.content))\n }\n}\n\n\nexport default BareFile\n", "import * as check from '../types/check'\nimport * as pathing from '../../path'\n\nimport { AddResult, CID, FileContent } from '../../ipfs/index'\nimport { Maybe } from '../../common/index'\nimport { Path } from '../../path'\nimport { SemVer } from '../semver'\nimport { Tree, File, UnixTree, BaseLinks, UpdateCallback } from '../types'\n\n\nabstract class BaseTree implements Tree, UnixTree {\n\n version: SemVer\n\n constructor(version: SemVer) {\n this.version = version\n }\n\n async put(): Promise<CID> {\n const { cid } = await this.putDetailed()\n return cid\n }\n\n async ls(path: Path): Promise<BaseLinks> {\n const dir = await this.get(path)\n if (dir === null) {\n throw new Error(\"Path does not exist\")\n } else if (check.isFile(dir)) {\n throw new Error('Can not `ls` a file')\n }\n return dir.getLinks()\n }\n\n async cat(path: Path): Promise<FileContent> {\n const file = await this.get(path)\n if (file === null) {\n throw new Error(\"Path does not exist\")\n } else if (!check.isFile(file)) {\n throw new Error('Can not `cat` a directory')\n }\n return file.content\n }\n\n async mkdir(path: Path): Promise<this> {\n return this.mkdirRecurse(path, () => this.put())\n }\n\n async mkdirRecurse(path: Path, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n const [ head, ...nextPath ] = path\n\n if (!head) {\n throw new Error(\"Invalid path: empty\")\n }\n\n const child = await this.getOrCreateDirectChild(head, onUpdate)\n\n if (check.isFile(child)) {\n throw new Error(`There is a file along the given path: ${pathing.log(path)}`)\n }\n\n if (nextPath.length) {\n await child.mkdirRecurse(nextPath, () => this.updateDirectChild(child, head, onUpdate) )\n }\n\n return this\n }\n\n async add(path: Path, content: FileContent): Promise<this> {\n await this.addRecurse(path, content, () => this.put())\n return this\n }\n\n async addRecurse(path: Path, content: FileContent, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n const [ head, ...nextPath ] = path\n\n if (!head) {\n throw new Error(\"Invalid path: empty\")\n }\n\n if (nextPath.length === 0) {\n await this.createOrUpdateChildFile(content, head, onUpdate)\n\n } else {\n const child = await this.getOrCreateDirectChild(head, onUpdate)\n if (check.isFile(child)) {\n throw new Error(`There is a file along the given path: ${pathing.log(path)}`)\n }\n await child.addRecurse(nextPath, content, async () => {\n await this.updateDirectChild(child, head, onUpdate)\n })\n\n }\n\n return this\n }\n\n async rm(path: Path): Promise<this> {\n await this.rmRecurse(path, () => this.put())\n return this\n }\n\n async rmRecurse(path: Path, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n const [ head, ...nextPath ] = path\n\n if (!head) {\n throw new Error(\"Invalid path: empty\")\n }\n\n if (nextPath.length === 0) {\n this.removeDirectChild(head)\n onUpdate && await onUpdate()\n\n } else {\n const child = await this.getDirectChild(head)\n if (child === null) {\n throw new Error(\"Invalid path: does not exist\")\n } else if(check.isFile(child)) {\n throw new Error(`There is a file along the given path: ${pathing.log(path)}`)\n }\n await child.rmRecurse(nextPath, async () => {\n await this.updateDirectChild(child, head, onUpdate)\n })\n\n }\n\n return this\n }\n\n async mv(from: Path, to: Path): Promise<this> {\n const node = await this.get(from)\n if (node === null) {\n throw new Error(`Path does not exist: ${pathing.log(from)}`)\n }\n\n if (to.length < 1) {\n throw new Error(`Path does not exist: ${pathing.log(to)}`)\n }\n\n const parentPath = to.slice(0, -1)\n let parent = await this.get(parentPath)\n\n if (!parent) {\n await this.mkdir(parentPath)\n parent = await this.get(parentPath)\n } else if (check.isFile(parent)) {\n throw new Error(`Can not \\`mv\\` to a file: ${pathing.log(parentPath)}`)\n }\n\n await this.rm(from)\n await [...to].reverse().reduce((acc, part, idx) => {\n return acc.then(async child => {\n const childParentParts = to.slice(0, -(idx + 1))\n const tree = childParentParts.length\n ? await this.get(childParentParts)\n : this\n\n if (tree && !check.isFile(tree)) {\n await tree.updateDirectChild(child, part, null)\n return tree\n } else {\n throw new Error(\"Failed to update tree while moving node\")\n }\n })\n }, Promise.resolve(node))\n\n return this\n }\n\n async exists(path: Path): Promise<boolean> {\n const node = await this.get(path)\n return node !== null\n }\n\n read(path: Path): Promise<Tree | File | null> {\n return this.get(path)\n }\n\n write(path: Path, content: FileContent): Promise<this> {\n return this.add(path, content)\n }\n\n async getOrCreateDirectChild(name: string, onUpdate: Maybe<UpdateCallback>): Promise<Tree | File> {\n const node = await this.getDirectChild(name)\n return node !== null\n ? node\n : this.createChildTree(name, onUpdate)\n }\n\n abstract createChildTree(name: string, onUpdate: Maybe<UpdateCallback>): Promise<Tree>\n abstract createOrUpdateChildFile(content: FileContent, name: string, onUpdate: Maybe<UpdateCallback>): Promise<File>\n\n abstract putDetailed(): Promise<AddResult>\n\n abstract updateDirectChild (child: Tree | File, name: string, onUpdate: Maybe<UpdateCallback>): Promise<this>\n abstract removeDirectChild(name: string): this\n abstract getDirectChild(name: string): Promise<Tree | File | null>\n\n abstract get(path: Path): Promise<Tree | File | null>\n\n abstract updateLink(name: string, result: AddResult): this\n abstract getLinks(): BaseLinks\n}\n\n\nexport default BaseTree\n", "import * as check from '../types/check'\nimport * as protocol from '../protocol/index'\nimport * as link from '../link'\nimport * as semver from '../semver'\n\nimport { AddResult, CID, FileContent } from '../../ipfs/index'\nimport { Links, BaseLinks, Tree, File, Puttable, UpdateCallback } from '../types'\nimport { Maybe } from '../../common/index'\nimport { Path } from '../../path'\n\nimport BareFile from '../bare/file'\nimport BaseTree from '../base/tree'\n\n\nclass BareTree extends BaseTree {\n\n links: Links\n children: { [name: string]: Tree | File }\n\n constructor(links: Links) {\n super(semver.v0)\n this.links = links\n this.children = {}\n }\n\n static async empty(): Promise<BareTree> {\n return new BareTree({})\n }\n\n static async fromCID(cid: CID): Promise<BareTree> {\n const links = await protocol.basic.getLinks(cid)\n return new BareTree(links)\n }\n\n static fromLinks(links: Links): BareTree {\n return new BareTree(links)\n }\n\n async createChildTree(name: string, onUpdate: Maybe<UpdateCallback>): Promise<Tree> {\n const child = await BareTree.empty()\n\n const existing = this.children[name]\n if(existing) {\n if(BareFile.instanceOf(existing)) {\n throw new Error(`There is a file at the given path: ${name}`)\n }\n return existing\n }\n\n await this.updateDirectChild(child, name, onUpdate)\n return child\n }\n\n async createOrUpdateChildFile(content: FileContent, name: string, onUpdate: Maybe<UpdateCallback>): Promise<BareFile> {\n const existing = await this.getDirectChild(name)\n let file: BareFile\n if(existing === null){\n file = await BareFile.create(content)\n } else if (BareFile.instanceOf(existing)) {\n file = await existing.updateContent(content)\n }else {\n throw new Error(`There is already a directory with that name: ${name}`)\n }\n await this.updateDirectChild(file, name, onUpdate)\n return file\n }\n\n async putDetailed(): Promise<AddResult> {\n return protocol.basic.putLinks(this.links)\n }\n\n async putAndUpdateLink(child: Puttable, name: string, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n const details = await child.putDetailed()\n this.updateLink(name, details)\n onUpdate && await onUpdate()\n return this\n }\n\n async updateDirectChild(child: Tree | File, name: string, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n this.children[name] = child\n return this.putAndUpdateLink(child, name, onUpdate)\n }\n\n removeDirectChild(name: string): this {\n delete this.links[name]\n if(this.children[name]) {\n delete this.children[name]\n }\n return this\n }\n\n async getDirectChild(name: string): Promise<Tree | File | null> {\n if(this.children[name]) {\n return this.children[name]\n }\n\n const link = this.links[name] || null\n if(link === null) return null\n const child = link.isFile\n ? await BareFile.fromCID(link.cid)\n : await BareTree.fromCID(link.cid)\n\n // check that the child wasn't added while retrieving the content from the network\n if(this.children[name]) {\n return this.children[name]\n }\n\n this.children[name] = child\n return child\n }\n\n // TODO\n async get(path: Path): Promise<Tree | File | null> {\n const [ head, ...nextPath ] = path\n\n if (!head) return this\n const nextTree = await this.getDirectChild(head)\n\n if (!nextPath.length) {\n return nextTree\n } else if (nextTree === null || check.isFile(nextTree)) {\n return null\n }\n\n return nextTree.get(nextPath)\n }\n\n updateLink(name: string, result: AddResult): this {\n const { cid, size, isFile } = result\n this.links[name] = link.make(name, cid, isFile, size)\n return this\n }\n\n getLinks(): BaseLinks {\n return this.links\n }\n}\n\n\nexport default BareTree\n", "import { AddResult, CID } from \"../../../ipfs/index\"\nimport * as basic from '../basic'\nimport * as link from '../../link'\nimport { Puttable, SimpleLinks } from '../../types'\n\nconst nibbles = {\n \"0\": true, \"1\": true, \"2\": true, \"3\": true, \"4\": true, \"5\": true, \"6\": true, \"7\": true,\n \"8\": true, \"9\": true, \"a\": true, \"b\": true, \"c\": true, \"d\": true, \"e\": true, \"f\": true,\n} as { [key: string]: boolean }\nconst isNibble = (str: string): boolean => nibbles[str] === true\n\ntype Member = {\n name: string\n cid: string\n}\n\n/**\n * Modified Merkle Patricia Tree\n * The tree has a node weight of 16\n * It stores items with hexidecimal keys and creates a new layer when a given layer has two keys that start with the same nibble\n */\nexport default class MMPT implements Puttable {\n\n links: SimpleLinks\n children: { [name: string]: MMPT }\n\n constructor(links: SimpleLinks) {\n this.links = links\n this.children = {}\n }\n\n static create(): MMPT {\n return new MMPT({})\n }\n\n static async fromCID(cid: CID): Promise<MMPT> {\n const links = await basic.getSimpleLinks(cid)\n return new MMPT(links)\n }\n\n async putDetailed(): Promise<AddResult> {\n return basic.putLinks(this.links)\n }\n\n async put(): Promise<CID> {\n const { cid } = await this.putDetailed()\n return cid\n }\n\n async add(name: string, value: CID): Promise<void> {\n if (!isNibble(name[0])) {\n throw new Error(`Not a valid name, must be hexadecimal`)\n }\n const nextNameOrSib = this.nextTreeOrSiblingName(name)\n\n // if already in tree, then skip\n if (name === nextNameOrSib) {\n // skip\n }\n\n // if no children starting with first char of name, then add with entire name as key\n else if (nextNameOrSib === null) {\n this.links[name] = link.make(name, value, true, 0)\n }\n\n // if multiple children with first char of names, then add to that tree\n else if (nextNameOrSib.length === 1) {\n const nextTree = await this.getDirectChild(nextNameOrSib)\n await nextTree.add(name.slice(1), value)\n await this.putAndUpdateChildLink(nextNameOrSib)\n }\n\n // if one other child with first char of name, then put both into a child tree\n else {\n const newTree = this.addEmptyChild(name[0])\n const nextCID = this.links[nextNameOrSib].cid\n this.removeChild(nextNameOrSib)\n await Promise.all([\n newTree.add(name.slice(1), value),\n newTree.add(nextNameOrSib.slice(1), nextCID)\n ])\n await this.putAndUpdateChildLink(name[0])\n }\n }\n\n async putAndUpdateChildLink(name: string): Promise<void> {\n const cidBefore = this.links[name]?.cid\n const { cid, size } = await this.children[name].putDetailed()\n const cidNow = this.links[name]?.cid\n\n if (cidBefore != cidNow) {\n // If there are changes in-between, we have to\n // re-try updating. Otherwise we can overwrite changes that\n // a concurrent update made\n return await this.putAndUpdateChildLink(name)\n }\n\n this.links[name] = link.make(name, cid, false, size)\n }\n\n addEmptyChild(name: string): MMPT {\n const tree = MMPT.create()\n this.children[name] = tree\n return tree\n }\n\n async get(name: string): Promise<CID | null> {\n const nextName = this.nextTreeName(name)\n if (nextName === null) return null\n\n if (nextName.length > 1) {\n return this.links[nextName].cid\n }\n const nextTree = await this.getDirectChild(nextName)\n return nextTree.get(name.slice(1))\n }\n\n async exists(name: string): Promise<boolean> {\n return (await this.get(name)) !== null\n }\n\n async members(): Promise<Array<Member>> {\n const children = await Promise.all(\n Object.values(this.links).map(async ({ name, cid }) => {\n if (name.length > 1) {\n return [{ name, cid }]\n }\n const child = await MMPT.fromCID(cid)\n const childMembers = await child.members()\n return childMembers.map(mem => ({\n ...mem,\n name: name + mem.name\n }))\n })\n )\n return children.reduce((acc, cur) => acc.concat(cur))\n }\n\n private async getDirectChild(name: string): Promise<MMPT> {\n if (this.children[name]) {\n return this.children[name]\n }\n\n const child = await MMPT.fromCID(this.links[name].cid)\n // check that the child wasn't added while retrieving the mmpt from the network\n if (this.children[name]) {\n return this.children[name]\n }\n\n this.children[name] = child\n return child\n }\n\n private removeChild(name: string): void {\n delete this.links[name]\n if (this.children[name]) {\n delete this.children[name]\n }\n }\n\n private directChildExists(name: string): boolean {\n return this.links[name] !== undefined || this.children[name] !== undefined\n }\n\n private nextTreeName(name: string): string | null {\n if (this.directChildExists(name[0])) {\n return name[0]\n } else if (this.directChildExists(name)) {\n return name\n }\n return null\n }\n\n private nextTreeOrSiblingName(name: string): string | null {\n const nibble = name[0]\n if (this.directChildExists(nibble)) {\n return nibble\n }\n return Object.keys(this.links).find(child => nibble === child[0]) || null\n }\n}\n", "import { CID } from '../../ipfs/index'\nimport { Maybe } from '../../common/index'\nimport { Metadata } from '../metadata'\n\n\nexport type Node = {\n constructor: {\n fromCID: (cid: CID) => Node\n },\n header: {\n metadata: Metadata,\n previous: CID\n }\n}\n\n\nexport default class PublicHistory {\n\n constructor(readonly node: Node) {}\n\n /**\n * Go back one or more versions.\n *\n * @param delta Optional negative number to specify how far to go back\n */\n back(delta: number = -1): Promise<Maybe<Node>> {\n const length = Math.abs(Math.min(delta, -1))\n\n return Array.from({ length }, (_, i) => i).reduce(\n (promise: Promise<Maybe<Node>>) => promise.then(\n (n: Maybe<Node>) => n ? PublicHistory._getPreviousVersion(n) : null\n ),\n Promise.resolve(this.node)\n )\n }\n\n // async forward(delta: number = 1): Promise<Maybe<Node>> {}\n\n /**\n * Get a version before a given timestamp.\n *\n * @param timestamp Unix timestamp in seconds\n */\n async prior(timestamp: number): Promise<Maybe<Node>> {\n return PublicHistory._prior(this.node, timestamp)\n }\n\n /**\n * List earlier versions along with the timestamp they were created.\n */\n async list(amount: number = 5): Promise<Array<{ delta: number, timestamp: number }>> {\n const { acc } = await Array.from({ length: amount }, (_, i) => i).reduce(\n (promise, i) => promise.then(({ node, acc }) => {\n if (!node) return Promise.resolve({ node: null, acc })\n\n return PublicHistory\n ._getPreviousVersion(node)\n .then(n => ({\n node: n,\n acc: [\n ...acc,\n { delta: -(i + 1), timestamp: node.header.metadata.unixMeta.mtime }\n ]\n }))\n }),\n PublicHistory\n ._getPreviousVersion(this.node)\n .then(n => (\n { node: n, acc: [] } as {\n node: Maybe<Node>,\n acc: Array<{ delta: number, timestamp: number }>\n }\n ))\n )\n\n return acc\n }\n\n /**\n * @internal\n */\n static async _getPreviousVersion(node: Node): Promise<Maybe<Node>> {\n if (!node.header.previous) return Promise.resolve(null)\n return node.constructor.fromCID(node.header.previous)\n }\n\n /**\n * @internal\n */\n static async _prior(node: Node, timestamp: number): Promise<Maybe<Node>> {\n if (node.header.metadata.unixMeta.mtime < timestamp) return node\n const previous = await PublicHistory._getPreviousVersion(node)\n return previous ? PublicHistory._prior(previous, timestamp) : null\n }\n\n}\n", "import { FileInfo, FileHeader, PutDetails } from '../protocol/public/types'\nimport { CID, FileContent } from '../../ipfs/index'\nimport BaseFile from '../base/file'\nimport PublicHistory from './PublicHistory'\nimport * as check from '../types/check'\nimport * as history from './PublicHistory'\nimport * as metadata from '../metadata'\nimport * as protocol from '../protocol/index'\nimport { isObject, Maybe } from '../../common/index'\n\n\ntype ConstructorParams = {\n cid: Maybe<CID>\n content: FileContent\n header: FileHeader\n}\n\nexport class PublicFile extends BaseFile {\n\n cid: Maybe<CID>\n header: FileHeader\n history: PublicHistory\n\n constructor({ content, header, cid }: ConstructorParams) {\n super(content)\n\n this.cid = cid\n this.header = header\n this.history = new PublicHistory(this as unknown as history.Node)\n }\n\n static instanceOf(obj: unknown): obj is PublicFile {\n return isObject(obj)\n && obj.content !== undefined\n && check.isFileHeader(obj.header)\n }\n\n static async create(content: FileContent): Promise<PublicFile> {\n return new PublicFile({\n content,\n header: { metadata: metadata.empty(true) },\n cid: null\n })\n }\n\n static async fromCID(cid: CID): Promise<PublicFile> {\n const info = await protocol.pub.get(cid)\n return PublicFile.fromInfo(info, cid)\n }\n\n static async fromInfo(info: FileInfo, cid: CID): Promise<PublicFile> {\n const { userland, metadata, previous } = info\n const content = await protocol.basic.getFile(userland)\n return new PublicFile({\n content,\n header: { metadata, previous },\n cid\n })\n }\n\n async putDetailed(): Promise<PutDetails> {\n const details = await protocol.pub.putFile(\n this.content,\n metadata.updateMtime(this.header.metadata),\n this.cid\n )\n this.cid = details.cid\n return details\n }\n\n}\n\nexport default PublicFile\n", "import { Skeleton, SkeletonInfo } from \"./types\"\nimport { NonEmptyPath } from '../../types'\n\n\nexport const getPath = (skeleton: Skeleton, path: NonEmptyPath): SkeletonInfo | null => {\n const head = path[0]\n const child = skeleton[head] || null\n const nextPath = nextNonEmpty(path)\n if(child === null || nextPath === null) {\n return child\n }else {\n return getPath(child.subSkeleton, nextPath)\n }\n}\n\n\nfunction nextNonEmpty(parts: NonEmptyPath): NonEmptyPath | null {\n const next = parts.slice(1)\n if (next.length < 1) {\n return null\n }\n return next as NonEmptyPath\n}\n", "import { CID, FileContent } from '../../ipfs/index'\nimport { Links, NonEmptyPath, UpdateCallback } from '../types'\nimport { Maybe } from '../../common/index'\nimport { Path } from '../../path'\nimport { TreeInfo, TreeHeader, PutDetails } from '../protocol/public/types'\n\nimport BaseTree from '../base/tree'\nimport BareTree from '../bare/tree'\nimport PublicFile from './PublicFile'\nimport PublicHistory from './PublicHistory'\n\nimport * as check from '../types/check'\nimport * as history from './PublicHistory'\nimport * as link from '../link'\nimport * as metadata from '../metadata'\nimport * as protocol from '../protocol/index'\nimport * as skeleton from '../protocol/public/skeleton'\n\n\ntype ConstructorParams = {\n cid: Maybe<CID>\n links: Links\n header: TreeHeader\n}\n\ntype Child =\n PublicFile | PublicTree | BareTree\n\n\nexport class PublicTree extends BaseTree {\n\n children: { [name: string]: Child }\n cid: Maybe<CID>\n links: Links\n header: TreeHeader\n history: PublicHistory\n\n constructor({ links, header, cid }: ConstructorParams) {\n super(header.metadata.version)\n\n this.children = {}\n this.cid = cid\n this.links = links\n this.header = header\n this.history = new PublicHistory(this as unknown as history.Node)\n }\n\n static async empty (): Promise<PublicTree> {\n return new PublicTree({\n links: {},\n header: {\n metadata: metadata.empty(false),\n skeleton: {},\n },\n cid: null\n })\n }\n\n static async fromCID (cid: CID): Promise<PublicTree> {\n const info = await protocol.pub.get(cid)\n if(!check.isTreeInfo(info)) {\n throw new Error(`Could not parse a valid public tree at: ${cid}`)\n }\n return PublicTree.fromInfo(info, cid)\n }\n\n static async fromInfo(info: TreeInfo, cid: CID): Promise<PublicTree> {\n const { userland, metadata, previous, skeleton } = info\n const links = await protocol.basic.getLinks(userland)\n return new PublicTree({\n links,\n header: { metadata, previous, skeleton },\n cid\n })\n }\n\n static instanceOf(obj: any): obj is PublicTree {\n return check.isLinks(obj.links) && check.isTreeHeader(obj.header)\n }\n\n async createChildTree(name: string, onUpdate: Maybe<UpdateCallback>): Promise<PublicTree> {\n const child = await PublicTree.empty()\n\n const existing = this.children[name]\n if (existing) {\n if (PublicFile.instanceOf(existing)) {\n throw new Error(`There is a file at the given path: ${name}`)\n } else if (!PublicTree.instanceOf(existing)) {\n throw new Error(`Not a public tree at the given path: ${name}`)\n } else {\n return existing\n }\n }\n\n await this.updateDirectChild(child, name, onUpdate)\n return child\n }\n\n async createOrUpdateChildFile(content: FileContent, name: string, onUpdate: Maybe<UpdateCallback>): Promise<PublicFile> {\n const existing = await this.getDirectChild(name)\n let file: PublicFile\n if(existing === null){\n file = await PublicFile.create(content)\n } else if (PublicFile.instanceOf(existing)) {\n file = await existing.updateContent(content)\n }else {\n throw new Error(`There is already a directory with that name: ${name}`)\n }\n await this.updateDirectChild(file, name, onUpdate)\n return file\n }\n\n async putDetailed(): Promise<PutDetails> {\n const details = await protocol.pub.putTree(\n this.links,\n this.header.skeleton,\n this.header.metadata,\n this.cid\n )\n this.header.previous = this.cid || undefined\n this.cid = details.cid\n return details\n }\n\n async updateDirectChild(child: PublicTree | PublicFile, name: string, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n this.children[name] = child\n const details = await child.putDetailed()\n this.updateLink(name, details)\n onUpdate && await onUpdate()\n return this\n }\n\n removeDirectChild(name: string): this {\n delete this.links[name]\n delete this.header.skeleton[name]\n if(this.children[name]) {\n delete this.children[name]\n }\n return this\n }\n\n async getDirectChild(name: string): Promise<Child | null> {\n if(this.children[name]) {\n return this.children[name]\n }\n\n const childInfo = this.header.skeleton[name] || null\n if(childInfo === null) return null\n const child = childInfo.isFile\n ? await PublicFile.fromCID(childInfo.cid)\n : await PublicTree.fromCID(childInfo.cid)\n\n // check that the child wasn't added while retrieving the content from the network\n if(this.children[name]) {\n return this.children[name]\n }\n\n this.children[name] = child\n return child\n }\n\n async get(path: Path): Promise<Child | null> {\n if (path.length < 1) return this\n\n const skeletonInfo = skeleton.getPath(this.header.skeleton, path as NonEmptyPath)\n if (skeletonInfo === null) return null\n\n const info = await protocol.pub.get(skeletonInfo.cid)\n return check.isFileInfo(info)\n ? PublicFile.fromInfo(info, skeletonInfo.cid)\n : PublicTree.fromInfo(info, skeletonInfo.cid)\n }\n\n getLinks(): Links {\n // add missing metadata into links\n return Object.values(this.links).reduce((acc, cur) => {\n return {\n ...acc,\n [cur.name]: {\n ...cur,\n isFile: this.header.skeleton[cur.name]?.isFile,\n }\n }\n }, {} as Links)\n }\n\n updateLink(name: string, result: PutDetails): this {\n const { cid, metadata, userland, size, isFile, skeleton } = result\n this.links[name] = link.make(name, cid, false, size)\n this.header.skeleton[name] = {\n cid,\n metadata,\n userland,\n subSkeleton: skeleton,\n isFile\n }\n this.header.metadata.unixMeta.mtime = Date.now()\n return this\n }\n}\n\n\nexport default PublicTree\n", "import MMPT from \"../protocol/private/mmpt\"\nimport { BareNameFilter } from '../protocol/private/namefilter'\nimport { DecryptedNode, Revision } from \"../protocol/private/types\"\nimport { Maybe } from '../../common/index'\nimport { Metadata } from '../metadata'\nimport * as protocol from '../protocol/index'\n\n\nexport type Node = {\n constructor: {\n fromInfo: (mmpt: MMPT, key: string, info: DecryptedNode) => Node\n },\n header: {\n bareNameFilter: BareNameFilter,\n metadata: Metadata,\n revision: number\n },\n key: string,\n mmpt: MMPT\n}\n\n\nexport default class PrivateHistory {\n\n constructor(readonly node: Node) {}\n\n /**\n * Go back one or more versions.\n *\n * @param delta Optional negative number to specify how far to go back\n */\n async back(delta: number = -1): Promise<Maybe<Node>> {\n const n = Math.min(delta, -1)\n const revision = this.node.header?.revision\n return (revision && await this._getRevision(revision + n)) || null\n }\n\n // async forward(delta: number = 1): Promise<Maybe<Node>> {\n // const n = Math.max(delta, 1)\n // const revision = this.node.header?.revision\n // return (revision && await this._getRevision(revision + n)) || null\n // }\n\n /**\n * Get a version before a given timestamp.\n *\n * @param timestamp Unix timestamp in seconds\n */\n async prior(timestamp: number): Promise<Maybe<Node>> {\n if (this.node.header.metadata.unixMeta.mtime < timestamp) {\n return this.node\n } else {\n return this._prior(this.node.header.revision - 1, timestamp)\n }\n }\n\n /**\n * List earlier versions along with the timestamp they were created.\n */\n async list(amount: number = 5): Promise<Array<{ delta: number, timestamp: number }>> {\n const max = this.node.header.revision\n\n return Promise.all(\n Array.from({ length: amount }, (_, i) => {\n const n = i + 1\n return this._getRevisionInfoFromNumber(max - n).then(info => ({\n revisionInfo: info,\n delta: -n\n }))\n })\n ).then(\n list => list.filter(a => !!a.revisionInfo) as Array<{ revisionInfo: DecryptedNode, delta: number }>\n ).then(\n list => list.map(a => {\n const mtime = a.revisionInfo.metadata.unixMeta.mtime\n return { delta: a.delta, timestamp: mtime }\n })\n )\n }\n\n /**\n * @internal\n */\n async _getRevision(revision: number): Promise<Maybe<Node>> {\n const info = await this._getRevisionInfoFromNumber(revision)\n return info && await this.node.constructor.fromInfo(\n this.node.mmpt,\n this.node.key,\n info\n )\n }\n\n /**\n * @internal\n */\n _getRevisionInfo(revision: Revision): Promise<DecryptedNode> {\n return protocol.priv.readNode(revision.cid, this.node.key)\n }\n\n /**\n * @internal\n */\n async _getRevisionInfoFromNumber(revision: number): Promise<Maybe<DecryptedNode>> {\n const { key, mmpt } = this.node\n const { bareNameFilter } = this.node.header\n\n const r = await protocol.priv.getRevision(mmpt, bareNameFilter, key, revision)\n return r && this._getRevisionInfo(r)\n }\n\n /**\n * @internal\n */\n async _prior(revision: number, timestamp: number): Promise<Maybe<Node>> {\n const info = await this._getRevisionInfoFromNumber(revision)\n if (!info?.revision) return null\n\n if (info.metadata.unixMeta.mtime < timestamp) {\n return this._getRevision(info.revision)\n } else {\n return this._prior(info.revision - 1, timestamp)\n }\n }\n\n}\n", "import BaseFile from '../base/file'\nimport MMPT from '../protocol/private/mmpt'\nimport PrivateHistory from './PrivateHistory'\nimport { FileContent } from '../../ipfs/index'\nimport { PrivateName, BareNameFilter } from '../protocol/private/namefilter'\nimport { DecryptedNode, PrivateAddResult, PrivateFileInfo } from '../protocol/private/types'\nimport { isObject } from '../../common/type-checks'\nimport { Maybe } from '../../common/index'\nimport * as crypto from '../../crypto/index'\nimport * as check from '../protocol/private/types/check'\nimport * as history from './PrivateHistory'\nimport * as metadata from '../metadata'\nimport * as protocol from '../protocol/index'\nimport * as namefilter from '../protocol/private/namefilter'\n\n\ntype ConstructorParams = {\n content: FileContent\n key: string\n header: PrivateFileInfo\n mmpt: MMPT\n}\n\n\nexport class PrivateFile extends BaseFile {\n\n header: PrivateFileInfo\n history: PrivateHistory\n key: string\n mmpt: MMPT\n\n constructor({ content, mmpt, key, header }: ConstructorParams) {\n super(content)\n\n this.header = header\n this.history = new PrivateHistory(this as unknown as history.Node)\n this.key = key\n this.mmpt = mmpt\n }\n\n static instanceOf(obj: any): obj is PrivateFile {\n return isObject(obj)\n && obj.content !== undefined\n && obj.mmpt !== undefined\n && check.isPrivateFileInfo(obj.header)\n }\n\n static async create(mmpt: MMPT, content: FileContent, parentNameFilter: BareNameFilter, key: string): Promise<PrivateFile> {\n const bareNameFilter = await namefilter.addToBare(parentNameFilter, key)\n const contentKey = await crypto.aes.genKeyStr()\n const contentInfo = await protocol.basic.putEncryptedFile(content, contentKey)\n return new PrivateFile({\n content,\n mmpt,\n key,\n header: {\n bareNameFilter,\n key: contentKey,\n revision: 1,\n metadata: metadata.empty(true),\n content: contentInfo.cid\n }\n })\n }\n\n static async fromBareNameFilter(mmpt: MMPT, bareNameFilter: BareNameFilter, key: string): Promise<PrivateFile> {\n const info = await protocol.priv.getLatestByBareNameFilter(mmpt, bareNameFilter, key)\n return this.fromInfo(mmpt, key, info)\n }\n\n static async fromLatestName(mmpt: MMPT, name: PrivateName, key: string): Promise<PrivateFile> {\n const info = await protocol.priv.getByLatestName(mmpt, name, key)\n return PrivateFile.fromInfo(mmpt, key, info)\n }\n\n static async fromName(mmpt: MMPT, name: PrivateName, key: string): Promise<PrivateFile> {\n const info = await protocol.priv.getByName(mmpt, name, key)\n return PrivateFile.fromInfo(mmpt, key, info)\n }\n\n static async fromInfo(mmpt: MMPT, key: string, info: Maybe<DecryptedNode>): Promise<PrivateFile> {\n if (!check.isPrivateFileInfo(info)) {\n throw new Error(`Could not parse a valid private file using the given key`)\n }\n\n const content = await protocol.basic.getEncryptedFile(info.content, info.key)\n return new PrivateFile({\n content,\n key,\n mmpt,\n header: info\n })\n }\n\n async getName(): Promise<PrivateName> {\n const { bareNameFilter, revision } = this.header\n const revisionFilter = await namefilter.addRevision(bareNameFilter, this.key, revision)\n return namefilter.toPrivateName(revisionFilter)\n }\n\n async updateParentNameFilter(parentNameFilter: BareNameFilter): Promise<this> {\n this.header.bareNameFilter = await namefilter.addToBare(parentNameFilter, this.header.key)\n return this\n }\n\n async updateContent(content: FileContent): Promise<this> {\n const contentInfo = await protocol.basic.putEncryptedFile(content, this.header.key)\n this.content = content\n this.header = {\n ...this.header,\n revision: this.header.revision + 1,\n content: contentInfo.cid\n }\n return this\n }\n\n async putDetailed(): Promise<PrivateAddResult> {\n return protocol.priv.addNode(this.mmpt, {\n ...this.header,\n metadata: metadata.updateMtime(this.header.metadata)\n }, this.key)\n }\n\n}\n\nexport default PrivateFile\n", "import BaseTree from '../base/tree'\nimport MMPT from '../protocol/private/mmpt'\nimport PrivateFile from './PrivateFile'\nimport PrivateHistory from './PrivateHistory'\n\nimport { BaseLinks, UpdateCallback } from '../types'\nimport { DecryptedNode, PrivateSkeletonInfo, PrivateTreeInfo, PrivateAddResult } from '../protocol/private/types'\nimport { FileContent } from '../../ipfs/index'\nimport { Path } from '../../path'\nimport { PrivateName, BareNameFilter } from '../protocol/private/namefilter'\nimport { isObject, mapObj, Maybe, removeKeyFromObj } from '../../common/index'\nimport * as crypto from '../../crypto/index'\nimport * as check from '../protocol/private/types/check'\nimport * as history from './PrivateHistory'\nimport * as metadata from '../metadata'\nimport * as namefilter from '../protocol/private/namefilter'\nimport * as protocol from '../protocol/index'\nimport * as semver from '../semver'\n\n\ntype ConstructorParams = {\n header: PrivateTreeInfo\n key: string\n mmpt: MMPT\n}\n\n\nexport default class PrivateTree extends BaseTree {\n\n children: { [name: string]: PrivateTree | PrivateFile }\n header: PrivateTreeInfo\n history: PrivateHistory\n key: string\n mmpt: MMPT\n\n constructor({ mmpt, key, header }: ConstructorParams) {\n super(semver.v1)\n\n this.children = {}\n this.header = header\n this.history = new PrivateHistory(this as unknown as history.Node)\n this.key = key\n this.mmpt = mmpt\n }\n\n static instanceOf(obj: any): obj is PrivateTree {\n return isObject(obj)\n && obj.mmpt !== undefined\n && check.isPrivateTreeInfo(obj.header)\n }\n\n static async create(mmpt: MMPT, key: string, parentNameFilter: Maybe<BareNameFilter>): Promise<PrivateTree> {\n const bareNameFilter = parentNameFilter\n ? await namefilter.addToBare(parentNameFilter, key)\n : await namefilter.createBare(key)\n return new PrivateTree({\n mmpt,\n key,\n header: {\n metadata: metadata.empty(false),\n bareNameFilter,\n revision: 1,\n links: {},\n skeleton: {},\n }\n })\n }\n\n static async fromBaseKey(mmpt: MMPT, key: string): Promise<PrivateTree> {\n const bareNameFilter = await namefilter.createBare(key)\n return this.fromBareNameFilter(mmpt, bareNameFilter, key)\n }\n\n static async fromBareNameFilter(mmpt: MMPT, bareNameFilter: BareNameFilter, key: string): Promise<PrivateTree> {\n const info = await protocol.priv.getLatestByBareNameFilter(mmpt, bareNameFilter, key)\n return this.fromInfo(mmpt, key, info)\n }\n\n static async fromLatestName(mmpt: MMPT, name: PrivateName, key: string): Promise<PrivateTree> {\n const info = await protocol.priv.getByLatestName(mmpt, name, key)\n return this.fromInfo(mmpt, key, info)\n }\n\n static async fromName(mmpt: MMPT, name: PrivateName, key: string): Promise<PrivateTree> {\n const info = await protocol.priv.getByName(mmpt, name, key)\n return this.fromInfo(mmpt, key, info)\n }\n\n static async fromInfo(mmpt: MMPT, key: string, info: Maybe<DecryptedNode>): Promise<PrivateTree> {\n if (!check.isPrivateTreeInfo(info)) {\n throw new Error(`Could not parse a valid private tree using the given key`)\n }\n\n return new PrivateTree({ mmpt, key, header: info })\n }\n\n async createChildTree(name: string, onUpdate: Maybe<UpdateCallback>): Promise<PrivateTree> {\n const key = await crypto.aes.genKeyStr()\n const child = await PrivateTree.create(this.mmpt, key, this.header.bareNameFilter)\n\n const existing = this.children[name]\n if (existing) {\n if (PrivateFile.instanceOf(existing)) {\n throw new Error(`There is a file at the given path: ${name}`)\n }\n return existing\n }\n\n await this.updateDirectChild(child, name, onUpdate)\n return child\n }\n\n async createOrUpdateChildFile(content: FileContent, name: string, onUpdate: Maybe<UpdateCallback>): Promise<PrivateFile>{\n const existing = await this.getDirectChild(name)\n\n let file: PrivateFile\n if (existing === null) {\n const key = await crypto.aes.genKeyStr()\n file = await PrivateFile.create(this.mmpt, content, this.header.bareNameFilter, key)\n } else if (PrivateFile.instanceOf(existing)) {\n file = await existing.updateContent(content)\n } else {\n throw new Error(`There is already a directory with that name: ${name}`)\n }\n await this.updateDirectChild(file, name, onUpdate)\n return file\n }\n\n async putDetailed(): Promise<PrivateAddResult> {\n // copy the object, so we're putting the current version & don't include any revisions\n const nodeCopy = Object.assign({}, this.header)\n return protocol.priv.addNode(this.mmpt, nodeCopy, this.key)\n }\n\n async updateDirectChild(child: PrivateTree | PrivateFile, name: string, onUpdate: Maybe<UpdateCallback>): Promise<this> {\n await child.updateParentNameFilter(this.header.bareNameFilter)\n this.children[name] = child\n const details = await child.putDetailed()\n this.updateLink(name, details)\n onUpdate && await onUpdate()\n return this\n }\n\n removeDirectChild(name: string): this {\n this.header = {\n ...this.header,\n revision: this.header.revision + 1,\n links: removeKeyFromObj(this.header.links, name),\n skeleton: removeKeyFromObj(this.header.skeleton, name)\n }\n if(this.children[name]) {\n delete this.children[name]\n }\n return this\n }\n\n async getDirectChild(name: string): Promise<PrivateTree | PrivateFile | null>{\n if(this.children[name]) {\n return this.children[name]\n }\n\n const childInfo = this.header.links[name]\n if(childInfo === undefined) return null\n const child = childInfo.isFile\n ? await PrivateFile.fromLatestName(this.mmpt, childInfo.pointer, childInfo.key)\n : await PrivateTree.fromLatestName(this.mmpt, childInfo.pointer, childInfo.key)\n\n // check that the child wasn't added while retrieving the content from the network\n if(this.children[name]) {\n return this.children[name]\n }\n\n this.children[name] = child\n return child\n }\n\n async getName(): Promise<PrivateName> {\n const { bareNameFilter, revision } = this.header\n const revisionFilter = await namefilter.addRevision(bareNameFilter, this.key, revision)\n return namefilter.toPrivateName(revisionFilter)\n }\n\n async updateParentNameFilter(parentNameFilter: BareNameFilter): Promise<this> {\n this.header.bareNameFilter = await namefilter.addToBare(parentNameFilter, this.key)\n return this\n }\n\n async get(path: Path): Promise<PrivateTree | PrivateFile | null> {\n if (path.length === 0) return this\n\n const [head, ...rest] = path\n\n const next = this.header.skeleton[head]\n if (next === undefined) return null\n\n const result = await this.getRecurse(next, rest)\n if (result === null) return null\n\n return check.isPrivateFileInfo(result.node)\n ? PrivateFile.fromInfo(this.mmpt, result.key, result.node)\n : PrivateTree.fromInfo(this.mmpt, result.key, result.node)\n }\n\n async getRecurse(nodeInfo: PrivateSkeletonInfo, parts: string[]): Promise<Maybe<{ key: string, node: DecryptedNode }>> {\n const [head, ...rest] = parts\n if (head === undefined) return {\n key: nodeInfo.key,\n node: await protocol.priv.getLatestByCID(this.mmpt, nodeInfo.cid, nodeInfo.key)\n }\n\n const nextChild = nodeInfo.subSkeleton[head]\n if (nextChild !== undefined) {\n return this.getRecurse(nextChild, rest)\n }\n\n const reloadedNode = await protocol.priv.getLatestByCID(this.mmpt, nodeInfo.cid, nodeInfo.key)\n if (!check.isPrivateTreeInfo(reloadedNode)) {\n return null\n }\n\n const reloadedNext = reloadedNode.skeleton[head]\n return reloadedNext === undefined ? null : this.getRecurse(reloadedNext, rest)\n }\n\n getLinks(): BaseLinks {\n return mapObj(this.header.links, (link) => {\n const { key, ...rest } = link\n return { ...rest }\n })\n }\n\n updateLink(name: string, result: PrivateAddResult): this {\n const now = Date.now()\n const { cid, size, key, isFile, skeleton } = result\n const pointer = result.name\n this.header.links[name] = { name, key, pointer, size, isFile: isFile, mtime: metadata.mtimeFromMs(now) }\n this.header.skeleton[name] = { cid, key, subSkeleton: skeleton }\n this.header.revision = this.header.revision + 1\n this.header.metadata.unixMeta.mtime = now\n return this\n }\n\n}\n", "import { AddResult, CID } from '../../ipfs/index'\nimport { BareNameFilter } from '../protocol/private/namefilter'\nimport { Links, Puttable, SimpleLink } from '../types'\nimport { Branch, DistinctivePath } from '../../path'\nimport { Maybe } from '../../common/index'\nimport { Permissions } from '../../ucan/permissions'\nimport { SemVer } from '../semver'\n\nimport * as crypto from '../../crypto/index'\nimport * as identifiers from '../../common/identifiers'\nimport * as ipfs from '../../ipfs/index'\nimport * as link from '../link'\nimport * as pathing from '../../path'\nimport * as protocol from '../protocol/index'\nimport * as semver from '../semver'\nimport * as storage from '../../storage/index'\nimport * as ucanPermissions from '../../ucan/permissions'\nimport * as check from '../protocol/private/types/check'\n\nimport BareTree from '../bare/tree'\nimport MMPT from '../protocol/private/mmpt'\nimport PublicTree from '../v1/PublicTree'\nimport PrivateTree from '../v1/PrivateTree'\nimport PrivateFile from '../v1/PrivateFile'\n\n\ntype PrivateNode = PrivateTree | PrivateFile\n\n\nexport default class RootTree implements Puttable {\n\n links: Links\n mmpt: MMPT\n privateLog: Array<SimpleLink>\n\n publicTree: PublicTree\n prettyTree: BareTree\n privateNodes: Record<string, PrivateNode>\n\n constructor({ links, mmpt, privateLog, publicTree, prettyTree, privateNodes }: {\n links: Links,\n mmpt: MMPT,\n privateLog: Array<SimpleLink>,\n\n publicTree: PublicTree,\n prettyTree: BareTree,\n privateNodes: Record<string, PrivateNode>,\n }) {\n this.links = links\n this.mmpt = mmpt\n this.privateLog = privateLog\n\n this.publicTree = publicTree\n this.prettyTree = prettyTree\n this.privateNodes = privateNodes\n }\n\n\n // INITIALISATION\n // --------------\n\n static async empty({ rootKey }: { rootKey: string }): Promise<RootTree> {\n const publicTree = await PublicTree.empty()\n const prettyTree = await BareTree.empty()\n const mmpt = MMPT.create()\n\n // Private tree\n const rootPath = pathing.toPosix(pathing.directory(pathing.Branch.Private))\n const rootTree = await PrivateTree.create(mmpt, rootKey, null)\n await rootTree.put()\n\n // Construct tree\n const tree = new RootTree({\n links: {},\n mmpt,\n privateLog: [],\n\n publicTree,\n prettyTree,\n privateNodes: {\n [rootPath]: rootTree\n }\n })\n\n // Store root key\n await RootTree.storeRootKey(rootKey)\n\n // Set version and store new sub trees\n tree.setVersion(semver.v1)\n\n await Promise.all([\n tree.updatePuttable(Branch.Public, publicTree),\n tree.updatePuttable(Branch.Pretty, prettyTree),\n tree.updatePuttable(Branch.Private, mmpt)\n ])\n\n // Fin\n return tree\n }\n\n static async fromCID(\n { cid, permissions }: { cid: CID, permissions?: Permissions }\n ): Promise<RootTree> {\n const links = await protocol.basic.getLinks(cid)\n const keys = permissions ? await permissionKeys(permissions) : []\n\n // Load public parts\n const publicCID = links[Branch.Public]?.cid || null\n const publicTree = publicCID === null\n ? await PublicTree.empty()\n : await PublicTree.fromCID(publicCID)\n\n const prettyTree = links[Branch.Pretty]\n ? await BareTree.fromCID(links[Branch.Pretty].cid)\n : await BareTree.empty()\n\n // Load private bits\n const privateCID = links[Branch.Private]?.cid || null\n\n let mmpt, privateNodes\n if (privateCID === null) {\n mmpt = await MMPT.create()\n privateNodes = {}\n } else {\n mmpt = await MMPT.fromCID(privateCID)\n privateNodes = await loadPrivateNodes(keys, mmpt)\n }\n\n const privateLogCid = links[Branch.PrivateLog]?.cid\n const privateLog = privateLogCid\n ? await ipfs.dagGet(privateLogCid)\n .then(dagNode => dagNode.Links.map(link.fromDAGLink))\n .then(links => links.sort((a, b) => {\n return parseInt(a.name, 10) - parseInt(b.name, 10)\n }))\n : []\n\n // Construct tree\n const tree = new RootTree({\n links,\n mmpt,\n privateLog,\n\n publicTree,\n prettyTree,\n privateNodes\n })\n\n // Fin\n return tree\n }\n\n\n // MUTATIONS\n // ---------\n\n async put(): Promise<CID> {\n const { cid } = await this.putDetailed()\n return cid\n }\n\n async putDetailed(): Promise<AddResult> {\n return protocol.basic.putLinks(this.links)\n }\n\n updateLink(name: string, result: AddResult): this {\n const { cid, size, isFile } = result\n this.links[name] = link.make(name, cid, isFile, size)\n return this\n }\n\n async updatePuttable(name: string, puttable: Puttable): Promise<this> {\n return this.updateLink(name, await puttable.putDetailed())\n }\n\n\n // PRIVATE TREES\n // -------------\n\n static async storeRootKey(rootKey: string): Promise<void> {\n const path = pathing.directory(pathing.Branch.Private)\n const rootKeyId = await identifiers.readKey({ path })\n await crypto.keystore.importSymmKey(rootKey, rootKeyId)\n }\n\n findPrivateNode(path: DistinctivePath): [DistinctivePath, PrivateNode | null] {\n return findPrivateNode(this.privateNodes, path)\n }\n\n\n // PRIVATE LOG\n // -----------\n // CBOR array containing chunks.\n //\n // Chunk size is based on the default IPFS block size,\n // which is 1024 * 256 bytes. 1 log chunk should fit in 1 block.\n // We'll use the CSV format for the data in the chunks.\n static LOG_CHUNK_SIZE = 1020 // Math.floor((1024 * 256) / (256 + 1))\n\n\n async addPrivateLogEntry(cid: string): Promise<void> {\n const log = [...this.privateLog]\n let idx = Math.max(0, log.length - 1)\n\n // get last chunk\n let lastChunk = log[idx]?.cid\n ? (await ipfs.cat(log[idx].cid)).split(\",\")\n : []\n\n // needs new chunk\n const needsNewChunk = lastChunk.length + 1 > RootTree.LOG_CHUNK_SIZE\n if (needsNewChunk) {\n idx = idx + 1\n lastChunk = []\n }\n\n // add to chunk\n const hashedCid = await crypto.hash.sha256Str(cid)\n const updatedChunk = [...lastChunk, hashedCid]\n const updatedChunkDeposit = await protocol.basic.putFile(\n updatedChunk.join(\",\")\n )\n\n log[idx] = {\n name: idx.toString(),\n cid: updatedChunkDeposit.cid,\n size: updatedChunkDeposit.size\n }\n\n // save log\n const logDeposit = await ipfs.dagPutLinks(\n log.map(link.toDAGLink)\n )\n\n this.updateLink(Branch.PrivateLog, {\n cid: logDeposit.cid,\n isFile: false,\n size: await ipfs.size(logDeposit.cid)\n })\n\n this.privateLog = log\n }\n\n\n // VERSION\n // -------\n\n async setVersion(version: SemVer): Promise<this> {\n const result = await protocol.basic.putFile(semver.toString(version))\n return this.updateLink(Branch.Version, result)\n }\n\n}\n\n\n\n// \u3299\uFE0F\n\n\ntype PathKey = { path: DistinctivePath, key: string }\n\n\nasync function findBareNameFilter(\n map: Record<string, PrivateNode>,\n path: DistinctivePath\n): Promise<Maybe<BareNameFilter>> {\n const bareNameFilterId = await identifiers.bareNameFilter({ path })\n const bareNameFilter: Maybe<BareNameFilter> = await storage.getItem(bareNameFilterId)\n if (bareNameFilter) return bareNameFilter\n\n const [nodePath, node] = findPrivateNode(map, path)\n if (!node) return null\n\n const unwrappedPath = pathing.unwrap(path)\n const relativePath = unwrappedPath.slice(pathing.unwrap(nodePath).length)\n\n if (PrivateFile.instanceOf(node)) {\n return relativePath.length === 0 ? node.header.bareNameFilter : null\n }\n\n if (!node.exists(relativePath)) {\n if (pathing.isDirectory(path)) await node.mkdir(relativePath)\n else await node.add(relativePath, \"\")\n }\n\n return node.get(relativePath).then(t => t ? t.header.bareNameFilter : null)\n}\n\nfunction findPrivateNode(\n map: Record<string, PrivateNode>,\n path: DistinctivePath\n): [DistinctivePath, PrivateNode | null] {\n const t = map[pathing.toPosix(path)]\n if (t) return [ path, t ]\n\n const parent = pathing.parent(path)\n\n return parent\n ? findPrivateNode(map, parent)\n : [ path, null ]\n}\n\nfunction loadPrivateNodes(\n pathKeys: PathKey[],\n mmpt: MMPT\n): Promise<Record<string, PrivateNode>> {\n return sortedPathKeys(pathKeys).reduce((acc, { path, key }) => {\n return acc.then(async map => {\n let privateNode\n\n const unwrappedPath = pathing.unwrap(path)\n\n // if root, no need for bare name filter\n if (unwrappedPath.length === 1 && unwrappedPath[0] === pathing.Branch.Private) {\n privateNode = await PrivateTree.fromBaseKey(mmpt, key)\n\n } else {\n const bareNameFilter = await findBareNameFilter(map, path)\n if (!bareNameFilter) throw new Error(`Was trying to load the PrivateTree for the path \\`${path}\\`, but couldn't find the bare name filter for it.`)\n if (pathing.isDirectory(path)) {\n privateNode = await PrivateTree.fromBareNameFilter(mmpt, bareNameFilter, key)\n } else {\n privateNode = await PrivateFile.fromBareNameFilter(mmpt, bareNameFilter, key)\n }\n }\n\n const posixPath = pathing.toPosix(path)\n return { ...map, [posixPath]: privateNode }\n })\n }, Promise.resolve({}))\n}\n\nasync function permissionKeys(\n permissions: Permissions\n): Promise<PathKey[]> {\n return ucanPermissions.paths(permissions).reduce(async (\n acc: Promise<PathKey[]>,\n path: DistinctivePath\n ): Promise<PathKey[]> => {\n if (pathing.isBranch(pathing.Branch.Public, path)) return acc\n\n const name = await identifiers.readKey({ path })\n const key = await crypto.keystore.exportSymmKey(name)\n const pk: PathKey = { path: path, key: key }\n\n return acc.then(\n list => [ ...list, pk ]\n )\n }, Promise.resolve(\n []\n ))\n}\n\n/**\n * Sort keys alphabetically by path.\n * This is used to sort paths by parent first.\n */\nfunction sortedPathKeys(list: PathKey[]): PathKey[] {\n return list.sort(\n (a, b) => pathing.toPosix(a.path).localeCompare(pathing.toPosix(b.path))\n )\n}\n", "import * as storage from '../storage/index'\nimport { setup } from '../setup/internal'\n\n\nconst FS_CID_LOG_PREFIX = \"webnative.wnfs_cid_log\"\n\n\nfunction key() {\n return FS_CID_LOG_PREFIX + \"-\" + setup.endpoints.lobby\n}\n\n\n// QUERYING\n\n\nexport async function get(): Promise<Array<string>> {\n return (await storage.getItem(key())) || []\n}\n\nexport async function index(cid: string): Promise<[number, number]> {\n const log = await get()\n return [ log.indexOf(cid), log.length ]\n}\n\nexport async function newest(): Promise<string> {\n return (await get())[0]\n}\n\n\n\n// MUTATION\n\n\nexport async function add(cid: string): Promise<void> {\n const log = await get()\n const newLog = [ cid, ...log ].slice(0, 1000)\n await storage.setItem(key(), newLog)\n}\n\n\nexport async function clear(): Promise<void> {\n await storage.removeItem(key())\n}\n", "import * as check from './fs/types/check'\nimport * as debug from './common/debug'\nimport * as did from './did/index'\nimport * as dns from './dns/index'\nimport * as ucan from './ucan/index'\nimport { CID } from './ipfs/index'\nimport { api } from './common/index'\nimport { Ucan } from './ucan/index'\nimport { setup } from './setup/internal'\n\n/**\n * CID representing an empty string. We use to to speed up DNS propagation\n * However, we treat that as a null value in the code\n */\nconst EMPTY_CID = 'Qmc5m94Gu7z62RC8waSKkZUrCCBJPyHbkpmGzEePxy2oXJ'\n\n/**\n * Get the CID of a user's data root.\n * First check Fission server, then check DNS\n *\n * @param username The username of the user that we want to get the data root of.\n */\nexport async function lookup(\n username: string\n): Promise<CID | null> {\n const maybeRoot = await lookupOnFisson(username)\n if(maybeRoot === EMPTY_CID) return null\n if(maybeRoot !== null) return maybeRoot\n\n try {\n const cid = await dns.lookupDnsLink(username + '.files.' + setup.endpoints.user)\n return cid === EMPTY_CID ? null : cid\n } catch(err) {\n console.error(err)\n throw new Error('Could not locate user root in dns')\n }\n}\n\n/**\n * Get the CID of a user's data root from the Fission server.\n *\n * @param username The username of the user that we want to get the data root of.\n */\nexport async function lookupOnFisson(\n username: string\n): Promise<CID | null> {\n try {\n const resp = await fetch(\n `${setup.endpoints.api}/user/data/${username}`,\n { cache: 'reload' } // don't use cache\n )\n const cid = await resp.json()\n if (!check.isCID(cid)) {\n throw new Error(\"Did not receive a CID\")\n }\n return cid\n\n } catch(err) {\n debug.log('Could not locate user root on Fission server: ', err.toString())\n return null\n\n }\n}\n\n/**\n * Update a user's data root.\n *\n * @param cid The CID of the data root.\n * @param proof The proof to use in the UCAN sent to the API.\n */\nexport async function update(\n cid: CID | string,\n proof: string\n): Promise<{ success: boolean }> {\n const apiEndpoint = setup.endpoints.api\n\n // Debug\n debug.log(\"\uD83C\uDF0A Updating your DNSLink:\", cid)\n\n // Make API call\n return await fetchWithRetry(`${apiEndpoint}/user/data/${cid}`, {\n headers: async () => {\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n potency: \"APPEND\",\n proof,\n\n // TODO: Waiting on API change.\n // Should be `username.fission.name/*`\n resource: ucan.decode(proof).payload.rsc\n }))\n\n return { 'authorization': `Bearer ${jwt}` }\n },\n retries: 100,\n retryDelay: 5000,\n retryOn: [ 502, 503, 504 ],\n\n }, {\n method: 'PATCH'\n\n }).then((response: Response) => {\n if (response.status < 300) debug.log(\"\uD83E\uDEB4 DNSLink updated:\", cid)\n else debug.log(\"\uD83D\uDD25 Failed to update DNSLink for:\", cid)\n return { success: response.status < 300 }\n\n }).catch(err => {\n debug.log(\"\uD83D\uDD25 Failed to update DNSLink for:\", cid)\n console.error(err)\n return { success: false }\n\n })\n}\n\n\n\n// \u3299\uFE0F\n\n\ntype RetryOptions = {\n headers: () => Promise<{ [_: string]: string }>\n retries: number\n retryDelay: number\n retryOn: Array<number>\n}\n\n\nasync function fetchWithRetry(\n url: string,\n retryOptions: RetryOptions,\n fetchOptions: RequestInit,\n retry: number = 0\n): Promise<Response> {\n const headers = await retryOptions.headers()\n const response = await fetch(url, {\n ...fetchOptions,\n headers: { ...fetchOptions.headers, ...headers }\n })\n\n if (retryOptions.retryOn.includes(response.status)) {\n if (retry < retryOptions.retries) {\n return await new Promise((resolve, reject) => setTimeout(\n () => fetchWithRetry(url, retryOptions, fetchOptions, retry + 1).then(resolve, reject),\n retryOptions.retryDelay\n ))\n } else {\n throw new Error(\"Too many retries for fetch\")\n }\n }\n\n return response\n}\n", "import { setup } from '../setup/internal'\n\n\nexport function log(...args: unknown[]): void {\n if (setup.debug) console.log(...args)\n}\n", "export * from './types'\nexport * from './token'\nexport * as dictionary from './dictionary'\n", "export class NoPermissionError extends Error {\n constructor(message: string) {\n super(message)\n this.name = \"NoPermissionError\"\n }\n}\n", "import { throttle } from 'throttle-debounce'\n\nimport { BaseLinks } from './types'\nimport { Branch, DistinctivePath, DirectoryPath, FilePath, Path } from '../path'\nimport { PublishHook, UnixTree, Tree, File } from './types'\nimport { SemVer } from './semver'\nimport BareTree from './bare/tree'\nimport RootTree from './root/tree'\nimport PublicTree from './v1/PublicTree'\nimport PrivateFile from './v1/PrivateFile'\nimport PrivateTree from './v1/PrivateTree'\n\nimport * as cidLog from '../common/cid-log'\nimport * as dataRoot from '../data-root'\nimport * as debug from '../common/debug'\nimport * as crypto from '../crypto/index'\nimport * as pathing from '../path'\nimport * as typeCheck from './types/check'\nimport * as ucan from '../ucan/index'\n\nimport { CID, FileContent } from '../ipfs/index'\nimport { NoPermissionError } from '../errors'\nimport { Permissions, appDataPath } from '../ucan/permissions'\n\n\n// TYPES\n\n\ntype AppPath =\n (path?: DistinctivePath) => DistinctivePath\n\ntype ConstructorParams = {\n localOnly?: boolean\n permissions?: Permissions\n root: RootTree\n}\n\ntype FileSystemOptions = {\n localOnly?: boolean\n permissions?: Permissions\n version?: SemVer\n}\n\ntype NewFileSystemOptions = FileSystemOptions & {\n rootKey?: string\n}\n\ntype MutationOptions = {\n publish?: boolean\n}\n\n\n// CLASS\n\n\nexport class FileSystem {\n\n root: RootTree\n readonly localOnly: boolean\n\n appPath: AppPath | undefined\n proofs: { [_: string]: string }\n publishHooks: Array<PublishHook>\n\n _publishWhenOnline: Array<[CID, string]>\n _publishing: false | [CID, true]\n\n\n constructor({ root, permissions, localOnly }: ConstructorParams) {\n this.localOnly = localOnly || false\n this.proofs = {}\n this.publishHooks = []\n this.root = root\n\n this._publishWhenOnline = []\n this._publishing = false\n\n this._whenOnline = this._whenOnline.bind(this)\n this._beforeLeaving = this._beforeLeaving.bind(this)\n\n const globe = (globalThis as any)\n globe.filesystems = globe.filesystems || []\n globe.filesystems.push(this)\n\n if (\n permissions &&\n permissions.app &&\n permissions.app.creator &&\n permissions.app.name\n ) {\n this.appPath = appPath(permissions)\n }\n\n // Add the root CID of the file system to the CID log\n // (reverse list, newest cid first)\n const logCid = (cid: CID) => {\n cidLog.add(cid)\n debug.log(\"\uD83D\uDCD3 Adding to the CID ledger:\", cid)\n }\n\n // Update the user's data root when making changes\n const updateDataRootWhenOnline = throttle(3000, false, (cid, proof) => {\n if (globalThis.navigator.onLine) {\n this._publishing = [cid, true]\n return dataRoot.update(cid, proof).then(() => {\n if (this._publishing && this._publishing[0] === cid) {\n this._publishing = false\n }\n })\n }\n\n this._publishWhenOnline.push([ cid, proof ])\n }, false)\n\n this.publishHooks.push(logCid)\n this.publishHooks.push(updateDataRootWhenOnline)\n\n if (!this.localOnly) {\n // Publish when coming back online\n globalThis.addEventListener('online', this._whenOnline)\n \n // Show an alert when leaving the page while updating the data root\n globalThis.addEventListener('beforeunload', this._beforeLeaving)\n }\n }\n\n\n // INITIALISATION\n // --------------\n\n /**\n * Creates a file system with an empty public tree & an empty private tree at the root.\n */\n static async empty(opts: NewFileSystemOptions = {}): Promise<FileSystem> {\n const { permissions, localOnly } = opts\n const rootKey = opts.rootKey || await crypto.aes.genKeyStr()\n const root = await RootTree.empty({ rootKey })\n\n const fs = new FileSystem({\n root,\n permissions,\n localOnly\n })\n\n return fs\n }\n\n /**\n * Loads an existing file system from a CID.\n */\n static async fromCID(cid: CID, opts: FileSystemOptions = {}): Promise<FileSystem | null> {\n const { permissions, localOnly } = opts\n const root = await RootTree.fromCID({ cid, permissions })\n\n const fs = new FileSystem({\n root,\n permissions,\n localOnly\n })\n\n return fs\n }\n\n\n // DEACTIVATE\n // ----------\n\n /**\n * Deactivate a file system.\n *\n * Use this when a user signs out.\n * The only function of this is to stop listing to online/offline events.\n */\n deactivate(): void {\n if (this.localOnly) return\n const globe = (globalThis as any)\n globe.filesystems = globe.filesystems.filter((a: FileSystem) => a !== this)\n globe.removeEventListener('online', this._whenOnline)\n globe.removeEventListener('beforeunload', this._beforeLeaving)\n }\n\n\n // POSIX INTERFACE (DIRECTORIES)\n // -----------------------------\n\n async ls(path: DirectoryPath): Promise<BaseLinks> {\n if (pathing.isFile(path)) throw new Error(\"`ls` only accepts directory paths\")\n return this.runOnNode(path, false, (node, relPath) => {\n if (typeCheck.isFile(node)) {\n throw new Error(\"Tried to `ls` a file\")\n } else {\n return node.ls(relPath)\n }\n })\n }\n\n async mkdir(path: DirectoryPath, options: MutationOptions = {}): Promise<this> {\n if (pathing.isFile(path)) throw new Error(\"`mkdir` only accepts directory paths\")\n await this.runOnNode(path, true, (node, relPath) => {\n if (typeCheck.isFile(node)) {\n throw new Error(\"Tried to `mkdir` a file\")\n } else {\n return node.mkdir(relPath)\n }\n })\n if (options.publish) {\n await this.publish()\n }\n return this\n }\n\n // POSIX INTERFACE (FILES)\n // -----------------------\n\n async add(path: FilePath, content: FileContent, options: MutationOptions = {}): Promise<this> {\n if (pathing.isDirectory(path)) throw new Error(\"`add` only accepts file paths\")\n await this.runOnNode(path, true, async (node, relPath) => {\n return typeCheck.isFile(node)\n ? node.updateContent(content)\n : node.add(relPath, content)\n })\n if (options.publish) {\n await this.publish()\n }\n return this\n }\n\n async cat(path: FilePath): Promise<FileContent> {\n if (pathing.isDirectory(path)) throw new Error(\"`cat` only accepts file paths\")\n return this.runOnNode(path, false, async (node, relPath) => {\n return typeCheck.isFile(node)\n ? node.content\n : node.cat(relPath)\n })\n }\n\n async read(path: FilePath): Promise<FileContent | null> {\n if (pathing.isDirectory(path)) throw new Error(\"`read` only accepts file paths\")\n return this.cat(path)\n }\n\n async write(path: FilePath, content: FileContent, options: MutationOptions = {}): Promise<this> {\n if (pathing.isDirectory(path)) throw new Error(\"`write` only accepts file paths\")\n return this.add(path, content, options)\n }\n\n // POSIX INTERFACE (GENERAL)\n // -------------------------\n\n async exists(path: DistinctivePath): Promise<boolean> {\n return this.runOnNode(path, false, async (node, relPath) => {\n return typeCheck.isFile(node)\n ? true // tried to check the existance of itself\n : node.exists(relPath)\n })\n }\n\n async get(path: DistinctivePath): Promise<Tree | File | null> {\n return this.runOnNode(path, false, async (node, relPath) => {\n return typeCheck.isFile(node)\n ? node // tried to get itself\n : node.get(relPath)\n })\n }\n\n // This is only implemented on the same tree for now and will error otherwise\n async mv(from: DistinctivePath, to: DistinctivePath): Promise<this> {\n const sameTree = pathing.isSameBranch(from, to)\n\n if (!pathing.isSameKind(from, to)) {\n const kindFrom = pathing.kind(from)\n const kindTo = pathing.kind(to)\n throw new Error(`Can't move to a different kind of path, from is a ${kindFrom} and to is a ${kindTo}`)\n }\n\n if (!sameTree) {\n throw new Error(\"`mv` is only supported on the same tree for now\")\n }\n\n if (await this.exists(to)) {\n throw new Error(\"Destination already exists\")\n }\n\n await this.runOnNode(from, true, (node, relPath) => {\n if (typeCheck.isFile(node)) {\n throw new Error(\"Tried to `mv` within a file\")\n }\n\n const [ head, ...nextPath ] = pathing.unwrap(to)\n return node.mv(relPath, nextPath)\n })\n\n return this\n }\n\n async rm(path: DistinctivePath): Promise<this> {\n await this.runOnNode(path, true, (node, relPath) => {\n if (typeCheck.isFile(node)) {\n throw new Error(\"Cannot `rm` a file you've asked permission for\")\n } else {\n return node.rm(relPath)\n }\n })\n\n return this\n }\n\n\n // PUBLISH\n // -------\n\n /**\n * Ensures the latest version of the file system is added to IPFS,\n * updates your data root, and returns the root CID.\n */\n async publish(): Promise<CID> {\n const proofs = Array.from(Object.entries(this.proofs))\n this.proofs = {}\n\n const cid = await this.root.put()\n\n proofs.forEach(([_, proof]) => {\n this.publishHooks.forEach(hook => hook(cid, proof))\n })\n\n return cid\n }\n\n\n\n // INTERNAL\n // --------\n\n /** @internal */\n async runOnNode<a>(\n path: DistinctivePath,\n isMutation: boolean,\n fn: (node: UnixTree | File, relPath: Path) => Promise<a>\n ): Promise<a> {\n const parts = pathing.unwrap(path)\n const head = parts[0]\n const relPath = parts.slice(1)\n\n const operation = isMutation\n ? \"make changes to\"\n : \"query\"\n\n if (!this.localOnly) {\n const proof = await ucan.dictionary.lookupFilesystemUcan(path)\n const decodedProof = proof && ucan.decode(proof)\n\n if (!proof || !decodedProof || ucan.isExpired(decodedProof) || !decodedProof.signature) {\n throw new NoPermissionError(`I don't have the necessary permissions to ${operation} the file system at \"${pathing.toPosix(path)}\"`)\n }\n\n this.proofs[decodedProof.signature] = proof\n }\n\n let result: a\n let resultPretty: a\n\n if (head === Branch.Public) {\n result = await fn(this.root.publicTree, relPath)\n\n if (isMutation && PublicTree.instanceOf(result)) {\n resultPretty = await fn(this.root.prettyTree, relPath)\n\n this.root.publicTree = result\n this.root.prettyTree = resultPretty as unknown as BareTree\n\n await Promise.all([\n this.root.updatePuttable(Branch.Public, this.root.publicTree),\n this.root.updatePuttable(Branch.Pretty, this.root.prettyTree)\n ])\n }\n\n } else if (head === Branch.Private) {\n const [nodePath, node] = this.root.findPrivateNode(\n path\n )\n\n if (!node) {\n throw new NoPermissionError(`I don't have the necessary permissions to ${operation} the file system at \"${pathing.toPosix(path)}\"`)\n }\n\n result = await fn(\n node,\n parts.slice(pathing.unwrap(nodePath).length)\n )\n\n if (\n isMutation &&\n (PrivateTree.instanceOf(result) || PrivateFile.instanceOf(result))\n ) {\n this.root.privateNodes[pathing.toPosix(nodePath)] = result\n await result.put()\n await this.root.updatePuttable(Branch.Private, this.root.mmpt)\n\n const cid = await this.root.mmpt.put()\n await this.root.addPrivateLogEntry(cid)\n }\n\n } else if (head === Branch.Pretty && isMutation) {\n throw new Error(\"The pretty path is read only\")\n\n } else if (head === Branch.Pretty) {\n result = await fn(this.root.prettyTree, relPath)\n\n } else {\n throw new Error(\"Not a valid FileSystem path\")\n\n }\n\n return result\n }\n\n /** @internal */\n _whenOnline(): void {\n const toPublish = [...this._publishWhenOnline]\n this._publishWhenOnline = []\n\n toPublish.forEach(([cid, proof]) => {\n this.publishHooks.forEach(hook => hook(cid, proof))\n })\n }\n\n /** @internal */\n _beforeLeaving(e: Event): void | string {\n const msg = \"Are you sure you want to leave? We don't control the browser so you may lose your data.\"\n\n if (this._publishing || this._publishWhenOnline.length) {\n (e || globalThis.event).returnValue = msg as any\n return msg\n }\n }\n}\n\n\nexport default FileSystem\n\n\n\n// \u3299\uFE0F\n\n\nfunction appPath(permissions: Permissions): AppPath {\n if (!permissions.app) throw Error(\"Only works with app permissions\")\n const base = appDataPath(permissions.app)\n\n return path => {\n if (path) return pathing.combine(base, path)\n return base\n }\n}\n", "import FileSystem from './filesystem'\n\n\n/**\n * The FileSystem class.\n */\nexport default FileSystem\n", "import FileSystem from './fs/index'\n\nimport * as cidLog from './common/cid-log'\nimport * as debug from './common/debug'\nimport * as dataRoot from './data-root'\nimport * as ucan from './ucan/internal'\n\nimport { Branch } from './path'\nimport { Maybe, authenticatedUsername } from './common/index'\nimport { Permissions } from './ucan/permissions'\n\n\n/**\n * Load a user's file system.\n *\n * @param permissions The permissions from initialise.\n * Pass `null` if working without permissions\n * @param username Optional, username of the user to load the file system from.\n * Will try to load the file system of the authenticated user\n * by default. Throws an error if there's no authenticated user.\n * @param rootKey Optional, AES key to be the root key of a new filesystem.\n * Will be used if a filesystem hasn't been created yet.\n */\nexport async function loadFileSystem(\n permissions: Maybe<Permissions>,\n username?: string,\n rootKey?: string\n): Promise<FileSystem> {\n let cid, fs\n\n // Look for username\n username = username || (await authenticatedUsername() || undefined)\n if (!username) throw new Error(\"User hasn't authenticated yet\")\n\n // Ensure internal UCAN dictionary\n await ucan.store([])\n\n // Determine the correct CID of the file system to load\n const dataCid = navigator.onLine ? await dataRoot.lookup(username) : null\n const [ logIdx, logLength ] = dataCid ? await cidLog.index(dataCid) : [ -1, 0 ]\n\n if (!navigator.onLine) {\n // Offline, use local CID\n cid = await cidLog.newest()\n\n } else if (!dataCid) {\n // No DNS CID yet\n cid = await cidLog.newest()\n if (cid) debug.log(\"\uD83D\uDCD3 No DNSLink, using local CID:\", cid)\n else debug.log(\"\uD83D\uDCD3 Creating a new file system\")\n\n } else if (logIdx === 0) {\n // DNS is up to date\n cid = dataCid\n debug.log(\"\uD83D\uDCD3 DNSLink is up to date:\", cid)\n\n } else if (logIdx > 0) {\n // DNS is outdated\n cid = await cidLog.newest()\n const idxLog = logIdx === 1 ? \"1 newer local entry\" : logIdx + \" newer local entries\"\n debug.log(\"\uD83D\uDCD3 DNSLink is outdated (\" + idxLog + \"), using local CID:\", cid)\n\n } else {\n // DNS is newer\n cid = dataCid\n await cidLog.add(cid)\n debug.log(\"\uD83D\uDCD3 DNSLink is newer:\", cid)\n\n }\n\n // If a file system exists, load it and return it\n const p = permissions || undefined\n\n fs = cid ? await FileSystem.fromCID(cid, { permissions: p }) : null\n if (fs) return fs\n\n // Otherwise make a new one\n if (!rootKey) throw new Error(\"Can't make new filesystem without a root AES key\")\n fs = await FileSystem.empty({ permissions: p, rootKey })\n await addSampleData(fs)\n\n // Fin\n return fs\n}\n\n\n\n// \u3299\uFE0F\n\n\nasync function addSampleData(fs: FileSystem): Promise<void> {\n await fs.mkdir({ directory: [ Branch.Private, \"Apps\" ] })\n await fs.mkdir({ directory: [ Branch.Private, \"Audio\" ] })\n await fs.mkdir({ directory: [ Branch.Private, \"Documents\" ] })\n await fs.mkdir({ directory: [ Branch.Private, \"Photos\" ] })\n await fs.mkdir({ directory: [ Branch.Private, \"Video\" ] })\n await fs.publish()\n}\n", "import * as cidLog from './common/cid-log'\nimport * as common from './common/index'\nimport * as base64 from './common/base64'\nimport * as did from './did/index'\nimport * as path from './path'\nimport * as crypto from './crypto/index'\nimport * as storage from './storage/index'\nimport * as ucan from './ucan/store'\n\nimport { USERNAME_STORAGE_KEY, Maybe, VERSION } from './common/index'\nimport { FileSystem } from './fs/filesystem'\nimport { Permissions } from './ucan/permissions'\nimport { setup } from './setup/internal'\n\n\n// FUNCTIONS\n\n\n/**\n * Retrieve the authenticated username.\n */\nexport async function authenticatedUsername(): Promise<string | null> {\n return common.authenticatedUsername()\n}\n\n/**\n * Leave.\n *\n * Removes any trace of the user and redirects to the lobby.\n */\nexport async function leave({ withoutRedirect }: { withoutRedirect?: boolean } = {}): Promise<void> {\n await storage.removeItem(USERNAME_STORAGE_KEY)\n await ucan.clearStorage()\n await cidLog.clear()\n await crypto.keystore.clear()\n\n ;((globalThis as any).filesystems || []).forEach((f: FileSystem) => f.deactivate())\n\n if (!withoutRedirect && globalThis.location) {\n globalThis.location.href = setup.endpoints.lobby\n }\n}\n\n/**\n * Redirects to a lobby.\n *\n * NOTE: Only works on the main thread, as it uses `window.location`.\n *\n * @param permissions The permissions from `initialise`.\n * Pass `null` if working without permissions.\n * @param redirectTo Specify the URL you want users to return to.\n * Uses the current url by default.\n */\nexport async function redirectToLobby(\n permissions: Maybe<Permissions>,\n redirectTo?: string\n): Promise<void> {\n const app = permissions?.app\n const fs = permissions?.fs\n const platform = permissions?.platform\n const raw = permissions?.raw\n\n const exchangeDid = await did.exchange()\n const writeDid = await did.write()\n const sharedRepo = !!document.body.querySelector(\"iframe#webnative-ipfs\") && typeof SharedWorker === \"function\"\n\n redirectTo = redirectTo || window.location.href\n\n // Compile params\n const params = [\n [ \"didExchange\", exchangeDid ],\n [ \"didWrite\", writeDid ],\n [ \"redirectTo\", redirectTo ],\n [ \"sdk\", VERSION.toString() ],\n [ \"sharedRepo\", sharedRepo ? \"t\" : \"f\" ]\n\n ].concat(\n app ? [[ \"appFolder\", `${app.creator}/${app.name}` ]] : [],\n fs?.private ? fs.private.map(p => [ \"privatePath\", path.toPosix(p, { absolute: true }) ]) : [],\n fs?.public ? fs.public.map(p => [ \"publicPath\", path.toPosix(p, { absolute: true }) ]) : [],\n raw ? [[\"raw\", base64.urlEncode(JSON.stringify(raw))]] : []\n\n ).concat((() => {\n const apps = platform?.apps\n\n switch (typeof apps) {\n case \"string\": return [[ \"app\", apps ]]\n case \"object\": return apps.map(a => [ \"app\", a ])\n default: return []\n }\n\n })())\n\n // And, go!\n window.location.href = setup.endpoints.lobby + \"?\" +\n params\n .map(([k, v]) => encodeURIComponent(k) + \"=\" + encodeURIComponent(v))\n .join(\"&\")\n}\n", "import * as did from '../did/index'\nimport * as ucan from '../ucan/index'\nimport { api, Maybe, isString } from '../common/index'\nimport { setup } from '../setup/internal'\nimport { CID } from '../ipfs/index'\n\n\nexport type App = {\n domain: string\n}\n\n\n\n/**\n * Get A list of all of your apps and their associated domain names\n */\nexport async function index(): Promise<Array<App>> {\n const apiEndpoint = setup.endpoints.api\n\n const localUcan = await ucan.dictionary.lookupAppUcan(\"*\")\n if (localUcan === null) {\n throw \"Could not find your local UCAN\"\n }\n\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n proof: localUcan,\n potency: null\n }))\n\n const response = await fetch(`${apiEndpoint}/app`, {\n method: 'GET',\n headers: {\n 'authorization': `Bearer ${jwt}`\n }\n })\n\n const data = await response.json()\n return Object\n .values(data)\n .filter(v => (v as Array<string>).length > 0)\n .map(v => ({ domain: (v as Array<string>)[0] }))\n}\n\n/**\n * Creates a new app, assigns an initial subdomain, and sets an asset placeholder\n *\n * @param subdomain Subdomain to create the fission app with\n */\nexport async function create(\n subdomain: Maybe<string>\n): Promise<App> {\n const apiEndpoint = setup.endpoints.api\n\n const localUcan = await ucan.dictionary.lookupAppUcan(\"*\")\n if (localUcan === null) {\n throw \"Could not find your local UCAN\"\n }\n\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n proof: localUcan,\n potency: null\n }))\n\n const url = isString(subdomain)\n ? `${apiEndpoint}/app?subdomain=${encodeURIComponent(subdomain)}`\n : `${apiEndpoint}/app`\n\n const response = await fetch(url, {\n method: 'POST',\n headers: {\n 'authorization': `Bearer ${jwt}`\n }\n })\n const data = await response.json()\n return { domain: data }\n}\n\n/**\n * Destroy app by any associated domain\n *\n * @param domain The domain associated with the app we want to delete\n */\nexport async function deleteByDomain(\n domain: string\n): Promise<void> {\n const apiEndpoint = setup.endpoints.api\n\n const localUcan = await ucan.dictionary.lookupAppUcan(domain)\n if (localUcan === null) {\n throw new Error(\"Could not find your local UCAN\")\n }\n\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n proof: localUcan,\n potency: null\n }))\n\n const appIndexResponse = await fetch(`${apiEndpoint}/app`, {\n method: 'GET',\n headers: {\n 'authorization': `Bearer ${jwt}`\n }\n })\n\n const index = await appIndexResponse.json() as { [_: string]: string[] }\n const appToDelete = Object.entries(index).find(([_, domains]) => domains.includes(domain))\n if (appToDelete == null) {\n throw new Error(`Couldn't find an app with domain ${domain}`)\n }\n\n await fetch(`${apiEndpoint}/app/${encodeURIComponent(appToDelete[0])}`, {\n method: 'DELETE',\n headers: {\n 'authorization': `Bearer ${jwt}`\n }\n })\n}\n\n/**\n * Updates an app by CID\n *\n * @param subdomain Subdomain to create the fission app with\n */\nexport async function publish(\n domain: string,\n cid: CID,\n): Promise<void> {\n const apiEndpoint = setup.endpoints.api\n\n const localUcan = await ucan.dictionary.lookupAppUcan(domain)\n if (localUcan === null) {\n throw \"Could not find your local UCAN\"\n }\n\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n proof: localUcan, \n potency: null\n }))\n\n const url = `${apiEndpoint}/app/${domain}/${cid}`\n\n await fetch(url, {\n method: 'PATCH',\n headers: {\n 'authorization': `Bearer ${jwt}`\n }\n })\n}\n", "import * as did from '../did/index'\nimport * as ucan from '../ucan/index'\nimport * as ucanStore from '../ucan/store'\nimport { api } from '../common/index'\nimport { setup } from '../setup/internal'\nimport RootTree from '../fs/root/tree'\n\nexport * from './username'\n\n\n/**\n * Create a user account.\n */\nexport async function createAccount(\n userProps: {\n email: string\n username: string\n }\n): Promise<{ success: boolean }> {\n const apiEndpoint = setup.endpoints.api\n\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n }))\n\n const response = await fetch(`${apiEndpoint}/user`, {\n method: 'PUT',\n headers: {\n 'authorization': `Bearer ${jwt}`,\n 'content-type': 'application/json'\n },\n body: JSON.stringify(userProps)\n })\n\n return {\n success: response.status < 300\n }\n}\n\n\n/**\n * Ask the fission server to send another verification email to the\n * user currently logged in.\n *\n * Throws if the user is not logged in.\n */\nexport async function resendVerificationEmail(): Promise<{ success: boolean }> {\n const apiEndpoint = setup.endpoints.api\n\n // We've not implemented an \"administer account\" resource/ucan, so authenticating\n // with any kind of ucan will work server-side\n const localUcan = Object.values(ucanStore.getDictionary())[0]\n if (localUcan === null) {\n throw \"Could not find your local UCAN\"\n }\n\n const jwt = ucan.encode(await ucan.build({\n audience: await api.did(),\n issuer: await did.ucan(),\n proof: localUcan,\n potency: null\n }))\n\n const response = await fetch(`${apiEndpoint}/user/email/resend`, {\n method: 'POST',\n headers: {\n 'authorization': `Bearer ${jwt}`\n }\n })\n return {\n success: response.status < 300\n }\n}\n\n\n/**\n * Store the read key for the root `PrivateTree` (ie. `/private`)\n */\nexport function storeFileSystemRootKey(key: string): Promise<void> {\n return RootTree.storeRootKey(key)\n}\n", "/**\n * Blocklist for usernames.\n *\n * Keep in sync with the Fission API.\n * https://github.com/fission-suite/fission/blob/master/library/Fission/User/Username/Validation.hs\n */\nexport const USERNAME_BLOCKLIST =\n [ \"fission\"\n , \"ipfs\"\n , \"ipns\"\n , \"did\"\n , \"id\"\n , \"identity\"\n , \".htaccess\"\n , \"htaccess\"\n , \".htpasswd\"\n , \"htpasswd\"\n , \".well-known\"\n , \"well-known\"\n , \"400\"\n , \"401\"\n , \"403\"\n , \"404\"\n , \"405\"\n , \"406\"\n , \"407\"\n , \"408\"\n , \"409\"\n , \"410\"\n , \"411\"\n , \"412\"\n , \"413\"\n , \"414\"\n , \"415\"\n , \"416\"\n , \"417\"\n , \"421\"\n , \"422\"\n , \"423\"\n , \"424\"\n , \"426\"\n , \"428\"\n , \"429\"\n , \"431\"\n , \"500\"\n , \"501\"\n , \"502\"\n , \"503\"\n , \"504\"\n , \"505\"\n , \"506\"\n , \"507\"\n , \"508\"\n , \"509\"\n , \"510\"\n , \"511\"\n , \"_domainkey\"\n , \"about\"\n , \"about-us\"\n , \"abuse\"\n , \"access\"\n , \"account\"\n , \"accounts\"\n , \"ad\"\n , \"add\"\n , \"admin\"\n , \"administration\"\n , \"administrator\"\n , \"ads\"\n , \"ads.txt\"\n , \"advertise\"\n , \"advertising\"\n , \"aes128-ctr\"\n , \"aes128-gcm\"\n , \"aes192-ctr\"\n , \"aes256-ctr\"\n , \"aes256-gcm\"\n , \"affiliate\"\n , \"affiliates\"\n , \"ajax\"\n , \"alert\"\n , \"alerts\"\n , \"alpha\"\n , \"amp\"\n , \"analytics\"\n , \"api\"\n , \"app\"\n , \"app-ads.txt\"\n , \"apps\"\n , \"asc\"\n , \"assets\"\n , \"atom\"\n , \"auth\"\n , \"authentication\"\n , \"authorize\"\n , \"autoconfig\"\n , \"autodiscover\"\n , \"avatar\"\n , \"backup\"\n , \"banner\"\n , \"banners\"\n , \"bbs\"\n , \"beta\"\n , \"billing\"\n , \"billings\"\n , \"blog\"\n , \"blogs\"\n , \"board\"\n , \"bookmark\"\n , \"bookmarks\"\n , \"broadcasthost\"\n , \"business\"\n , \"buy\"\n , \"cache\"\n , \"calendar\"\n , \"campaign\"\n , \"captcha\"\n , \"careers\"\n , \"cart\"\n , \"cas\"\n , \"categories\"\n , \"category\"\n , \"cdn\"\n , \"cgi\"\n , \"cgi-bin\"\n , \"chacha20-poly1305\"\n , \"change\"\n , \"channel\"\n , \"channels\"\n , \"chart\"\n , \"chat\"\n , \"checkout\"\n , \"clear\"\n , \"client\"\n , \"close\"\n , \"cloud\"\n , \"cms\"\n , \"com\"\n , \"comment\"\n , \"comments\"\n , \"community\"\n , \"compare\"\n , \"compose\"\n , \"config\"\n , \"connect\"\n , \"contact\"\n , \"contest\"\n , \"cookies\"\n , \"copy\"\n , \"copyright\"\n , \"count\"\n , \"cp\"\n , \"cpanel\"\n , \"create\"\n , \"crossdomain.xml\"\n , \"css\"\n , \"curve25519-sha256\"\n , \"customer\"\n , \"customers\"\n , \"customize\"\n , \"dashboard\"\n , \"db\"\n , \"deals\"\n , \"debug\"\n , \"delete\"\n , \"desc\"\n , \"destroy\"\n , \"dev\"\n , \"developer\"\n , \"developers\"\n , \"diffie-hellman-group-exchange-sha256\"\n , \"diffie-hellman-group14-sha1\"\n , \"disconnect\"\n , \"discuss\"\n , \"dns\"\n , \"dns0\"\n , \"dns1\"\n , \"dns2\"\n , \"dns3\"\n , \"dns4\"\n , \"docs\"\n , \"documentation\"\n , \"domain\"\n , \"download\"\n , \"downloads\"\n , \"downvote\"\n , \"draft\"\n , \"drop\"\n , \"ecdh-sha2-nistp256\"\n , \"ecdh-sha2-nistp384\"\n , \"ecdh-sha2-nistp521\"\n , \"edit\"\n , \"editor\"\n , \"email\"\n , \"enterprise\"\n , \"error\"\n , \"errors\"\n , \"event\"\n , \"events\"\n , \"example\"\n , \"exception\"\n , \"exit\"\n , \"explore\"\n , \"export\"\n , \"extensions\"\n , \"false\"\n , \"family\"\n , \"faq\"\n , \"faqs\"\n , \"favicon.ico\"\n , \"features\"\n , \"feed\"\n , \"feedback\"\n , \"feeds\"\n , \"file\"\n , \"files\"\n , \"filter\"\n , \"follow\"\n , \"follower\"\n , \"followers\"\n , \"following\"\n , \"fonts\"\n , \"forgot\"\n , \"forgot-password\"\n , \"forgotpassword\"\n , \"form\"\n , \"forms\"\n , \"forum\"\n , \"forums\"\n , \"friend\"\n , \"friends\"\n , \"ftp\"\n , \"get\"\n , \"git\"\n , \"go\"\n , \"graphql\"\n , \"group\"\n , \"groups\"\n , \"guest\"\n , \"guidelines\"\n , \"guides\"\n , \"head\"\n , \"header\"\n , \"help\"\n , \"hide\"\n , \"hmac-sha\"\n , \"hmac-sha1\"\n , \"hmac-sha1-etm\"\n , \"hmac-sha2-256\"\n , \"hmac-sha2-256-etm\"\n , \"hmac-sha2-512\"\n , \"hmac-sha2-512-etm\"\n , \"home\"\n , \"host\"\n , \"hosting\"\n , \"hostmaster\"\n , \"htpasswd\"\n , \"http\"\n , \"httpd\"\n , \"https\"\n , \"humans.txt\"\n , \"icons\"\n , \"images\"\n , \"imap\"\n , \"img\"\n , \"import\"\n , \"index\"\n , \"info\"\n , \"insert\"\n , \"investors\"\n , \"invitations\"\n , \"invite\"\n , \"invites\"\n , \"invoice\"\n , \"is\"\n , \"isatap\"\n , \"issues\"\n , \"it\"\n , \"jobs\"\n , \"join\"\n , \"js\"\n , \"json\"\n , \"keybase.txt\"\n , \"learn\"\n , \"legal\"\n , \"license\"\n , \"licensing\"\n , \"like\"\n , \"limit\"\n , \"live\"\n , \"load\"\n , \"local\"\n , \"localdomain\"\n , \"localhost\"\n , \"lock\"\n , \"login\"\n , \"logout\"\n , \"lost-password\"\n , \"m\"\n , \"mail\"\n , \"mail0\"\n , \"mail1\"\n , \"mail2\"\n , \"mail3\"\n , \"mail4\"\n , \"mail5\"\n , \"mail6\"\n , \"mail7\"\n , \"mail8\"\n , \"mail9\"\n , \"mailer-daemon\"\n , \"mailerdaemon\"\n , \"map\"\n , \"marketing\"\n , \"marketplace\"\n , \"master\"\n , \"me\"\n , \"media\"\n , \"member\"\n , \"members\"\n , \"message\"\n , \"messages\"\n , \"metrics\"\n , \"mis\"\n , \"mobile\"\n , \"moderator\"\n , \"modify\"\n , \"more\"\n , \"mx\"\n , \"mx1\"\n , \"my\"\n , \"net\"\n , \"network\"\n , \"new\"\n , \"news\"\n , \"newsletter\"\n , \"newsletters\"\n , \"next\"\n , \"nil\"\n , \"no-reply\"\n , \"nobody\"\n , \"noc\"\n , \"none\"\n , \"noreply\"\n , \"notification\"\n , \"notifications\"\n , \"ns\"\n , \"ns0\"\n , \"ns1\"\n , \"ns2\"\n , \"ns3\"\n , \"ns4\"\n , \"ns5\"\n , \"ns6\"\n , \"ns7\"\n , \"ns8\"\n , \"ns9\"\n , \"null\"\n , \"oauth\"\n , \"oauth2\"\n , \"offer\"\n , \"offers\"\n , \"online\"\n , \"openid\"\n , \"order\"\n , \"orders\"\n , \"overview\"\n , \"owa\"\n , \"owner\"\n , \"page\"\n , \"pages\"\n , \"partners\"\n , \"passwd\"\n , \"password\"\n , \"pay\"\n , \"payment\"\n , \"payments\"\n , \"photo\"\n , \"photos\"\n , \"pixel\"\n , \"plans\"\n , \"plugins\"\n , \"policies\"\n , \"policy\"\n , \"pop\"\n , \"pop3\"\n , \"popular\"\n , \"portal\"\n , \"portfolio\"\n , \"post\"\n , \"postfix\"\n , \"postmaster\"\n , \"poweruser\"\n , \"preferences\"\n , \"premium\"\n , \"press\"\n , \"previous\"\n , \"pricing\"\n , \"print\"\n , \"privacy\"\n , \"privacy-policy\"\n , \"private\"\n , \"prod\"\n , \"product\"\n , \"production\"\n , \"profile\"\n , \"profiles\"\n , \"project\"\n , \"projects\"\n , \"public\"\n , \"purchase\"\n , \"put\"\n , \"quota\"\n , \"recover\"\n , \"recovery\"\n , \"redirect\"\n , \"reduce\"\n , \"refund\"\n , \"refunds\"\n , \"register\"\n , \"registration\"\n , \"remove\"\n , \"replies\"\n , \"reply\"\n , \"report\"\n , \"request\"\n , \"request-password\"\n , \"reset\"\n , \"reset-password\"\n , \"response\"\n , \"return\"\n , \"returns\"\n , \"review\"\n , \"reviews\"\n , \"robots.txt\"\n , \"root\"\n , \"rootuser\"\n , \"rsa-sha2-2\"\n , \"rsa-sha2-512\"\n , \"rss\"\n , \"rules\"\n , \"sales\"\n , \"save\"\n , \"script\"\n , \"sdk\"\n , \"search\"\n , \"secure\"\n , \"security\"\n , \"select\"\n , \"services\"\n , \"session\"\n , \"sessions\"\n , \"settings\"\n , \"setup\"\n , \"share\"\n , \"shift\"\n , \"shop\"\n , \"signin\"\n , \"signup\"\n , \"site\"\n , \"sitemap\"\n , \"sites\"\n , \"smtp\"\n , \"sort\"\n , \"source\"\n , \"sql\"\n , \"ssh\"\n , \"ssh-rsa\"\n , \"ssl\"\n , \"ssladmin\"\n , \"ssladministrator\"\n , \"sslwebmaster\"\n , \"stage\"\n , \"staging\"\n , \"stat\"\n , \"static\"\n , \"statistics\"\n , \"stats\"\n , \"status\"\n , \"store\"\n , \"style\"\n , \"styles\"\n , \"stylesheet\"\n , \"stylesheets\"\n , \"subdomain\"\n , \"subscribe\"\n , \"sudo\"\n , \"super\"\n , \"superuser\"\n , \"support\"\n , \"survey\"\n , \"sync\"\n , \"sysadmin\"\n , \"system\"\n , \"tablet\"\n , \"tag\"\n , \"tags\"\n , \"team\"\n , \"telnet\"\n , \"terms\"\n , \"terms-of-use\"\n , \"test\"\n , \"testimonials\"\n , \"theme\"\n , \"themes\"\n , \"today\"\n , \"tools\"\n , \"topic\"\n , \"topics\"\n , \"tour\"\n , \"training\"\n , \"translate\"\n , \"translations\"\n , \"trending\"\n , \"trial\"\n , \"true\"\n , \"umac-128\"\n , \"umac-128-etm\"\n , \"umac-64\"\n , \"umac-64-etm\"\n , \"undefined\"\n , \"unfollow\"\n , \"unlike\"\n , \"unsubscribe\"\n , \"update\"\n , \"upgrade\"\n , \"usenet\"\n , \"user\"\n , \"username\"\n , \"users\"\n , \"uucp\"\n , \"var\"\n , \"verify\"\n , \"video\"\n , \"view\"\n , \"void\"\n , \"vote\"\n , \"vpn\"\n , \"webmail\"\n , \"webmaster\"\n , \"website\"\n , \"widget\"\n , \"widgets\"\n , \"wiki\"\n , \"wpad\"\n , \"write\"\n , \"www\"\n , \"www-data\"\n , \"www1\"\n , \"www2\"\n , \"www3\"\n , \"www4\"\n , \"you\"\n , \"yourname\"\n , \"yourusername\"\n , \"zlib\"\n ]\n", "import { setup } from '../setup/internal'\n\nimport { USERNAME_BLOCKLIST } from './blocklist'\n\n/**\n * Check if a username is available.\n */\nexport async function isUsernameAvailable(\n username: string\n): Promise<boolean> {\n const resp = await fetch(`${setup.endpoints.api}/user/data/${username}`)\n return !resp.ok\n}\n\n/**\n * Check if a username is valid.\n */\nexport function isUsernameValid(username: string): boolean {\n return !username.startsWith(\"-\") &&\n !username.endsWith(\"-\") &&\n !username.startsWith(\"_\") &&\n /^[a-zA-Z0-9_-]+$/.test(username) &&\n !USERNAME_BLOCKLIST.includes(username.toLowerCase())\n}\n", "import { Endpoints, setup as internalSetup } from './setup/internal'\n\n\ntype UnknownObject =\n { [key: string]: unknown }\n\n\n/**\n * Toggle debug mode.\n *\n * Only adds a few `console.log`s at this moment.\n */\nexport function debug({ enabled }: { enabled: boolean }): boolean {\n internalSetup.debug = enabled\n return internalSetup.debug\n}\n\n\n/**\n * Override endpoints.\n *\n * You can override each of these,\n * no need to provide them all here.\n *\n * `api` Location of the Fission API\n * (default `https://runfission.com`)\n * `lobby` Location of the authentication lobby.\n * (default `https://auth.fission.codes`)\n * `user` User's domain to use, will be prefixed by username.\n * (default `fission.name`)\n */\nexport function endpoints(e: Partial<Endpoints>): Endpoints {\n internalSetup.endpoints = { ...internalSetup.endpoints, ...e }\n return { ...internalSetup.endpoints }\n}\n\nexport { setDependencies } from './setup/dependencies'\n"],
5 "mappings": "w1BAAA,mBAMA,AAAC,UAAS,EAAE,CAAC,GAAG,MAAO,KAAU,UAAU,MAAO,KAAS,YAAa,GAAO,QAAQ,YAAY,MAAO,SAAS,YAAY,OAAO,IAAK,OAAO,GAAG,OAAO,CAAC,GAAI,GAAE,AAAG,MAAO,SAAS,YAAa,EAAE,OAAY,AAAG,MAAO,SAAS,YAAa,EAAE,OAAY,AAAG,MAAO,OAAO,YAAa,EAAE,KAAU,EAAE,KAAK,EAAE,YAAc,OAAO,UAAU,CAAC,GAAI,GAAO,EAAO,EAAQ,MAAQ,YAAW,EAAE,EAAE,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAI,GAAE,MAAO,KAAS,YAAY,GAAQ,GAAG,CAAC,GAAG,EAAE,MAAO,GAAE,EAAE,IAAI,GAAG,EAAE,MAAO,GAAE,EAAE,IAAI,GAAI,GAAE,GAAI,OAAM,uBAAuB,EAAE,KAAK,KAAO,GAAE,KAAK,mBAAoB,EAAG,GAAI,GAAE,EAAE,GAAG,CAAC,QAAQ,IAAI,EAAE,GAAG,GAAG,KAAK,EAAE,QAAQ,SAAS,EAAE,CAAC,GAAI,IAAE,EAAE,GAAG,GAAG,GAAG,MAAO,GAAE,IAAI,IAAI,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,MAAO,GAAE,GAAG,QAAkD,OAAtC,GAAE,MAAO,KAAS,YAAY,GAAgB,EAAE,EAAE,EAAE,EAAE,OAAO,IAAI,EAAE,EAAE,IAAI,MAAO,IAAI,CAAC,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CACr1B,AAAC,UAAU,EAAO,CAClB,aACA,GAAI,GAAW,EAAO,kBAAoB,EAAO,uBAE7C,EAGF,GAAI,EAAU,CACZ,GAAI,GAAS,EACT,EAAW,GAAI,GAAS,GACxB,EAAU,EAAO,SAAS,eAAe,IAC7C,EAAS,QAAQ,EAAS,CACxB,cAAe,KAEjB,EAAgB,UAAY,CAC1B,EAAQ,KAAQ,EAAS,EAAE,EAAS,WAE7B,CAAC,EAAO,cAAgB,MAAO,GAAO,gBAAmB,YAAa,CAC/E,GAAI,GAAU,GAAI,GAAO,eACzB,EAAQ,MAAM,UAAY,EAC1B,EAAgB,UAAY,CAC1B,EAAQ,MAAM,YAAY,QAEvB,AAAI,YAAc,IAAU,sBAAwB,GAAO,SAAS,cAAc,UACvF,EAAgB,UAAY,CAI1B,GAAI,GAAW,EAAO,SAAS,cAAc,UAC7C,EAAS,mBAAqB,UAAY,CACxC,IAEA,EAAS,mBAAqB,KAC9B,EAAS,WAAW,YAAY,GAChC,EAAW,MAEb,EAAO,SAAS,gBAAgB,YAAY,IAG9C,EAAgB,UAAY,CAC1B,WAAW,EAAU,IAK3B,GAAI,GACA,EAAQ,GAEZ,YAAoB,CAClB,EAAW,GAGX,OAFI,GAAG,GACH,EAAM,EAAM,OACT,GAAK,CAIV,IAHA,GAAW,EACX,EAAQ,GACR,EAAI,GACG,EAAE,EAAI,GACX,GAAS,KAEX,EAAM,EAAM,OAEd,EAAW,GAGb,EAAO,QAAU,GACjB,YAAmB,EAAM,CACvB,AAAI,EAAM,KAAK,KAAU,GAAK,CAAC,GAC7B,OAID,KAAK,KAAK,MAAO,SAAW,YAAc,OAAS,MAAO,OAAS,YAAc,KAAO,MAAO,SAAW,YAAc,OAAS,KAClI,IAAI,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CACzC,aACA,GAAI,GAAY,EAAQ,GAGxB,YAAoB,EAEpB,GAAI,GAAW,GAEX,EAAW,CAAC,YACZ,EAAY,CAAC,aACb,EAAU,CAAC,WAEf,EAAO,QAAU,EAEjB,WAAiB,EAAU,CACzB,GAAI,MAAO,IAAa,WACtB,KAAM,IAAI,WAAU,+BAEtB,KAAK,MAAQ,EACb,KAAK,MAAQ,GACb,KAAK,QAAU,OACX,IAAa,GACf,GAAsB,KAAM,GAIhC,EAAQ,UAAU,MAAW,SAAU,EAAY,CACjD,MAAO,MAAK,KAAK,KAAM,IAEzB,EAAQ,UAAU,KAAO,SAAU,EAAa,GAAY,CAC1D,GAAI,MAAO,IAAgB,YAAc,KAAK,QAAU,GACtD,MAAO,KAAe,YAAc,KAAK,QAAU,EACnD,MAAO,MAET,GAAI,IAAU,GAAI,MAAK,YAAY,GACnC,GAAI,KAAK,QAAU,EAAS,CAC1B,GAAI,IAAW,KAAK,QAAU,EAAY,EAAc,GACxD,EAAO,GAAS,GAAU,KAAK,aAE/B,MAAK,MAAM,KAAK,GAAI,GAAU,GAAS,EAAa,KAGtD,MAAO,KAET,WAAmB,EAAS,GAAa,GAAY,CACnD,KAAK,QAAU,EACX,MAAO,KAAgB,YACzB,MAAK,YAAc,GACnB,KAAK,cAAgB,KAAK,oBAExB,MAAO,KAAe,YACxB,MAAK,WAAa,GAClB,KAAK,aAAe,KAAK,mBAG7B,EAAU,UAAU,cAAgB,SAAU,EAAO,CACnD,EAAS,QAAQ,KAAK,QAAS,IAEjC,EAAU,UAAU,mBAAqB,SAAU,EAAO,CACxD,EAAO,KAAK,QAAS,KAAK,YAAa,IAEzC,EAAU,UAAU,aAAe,SAAU,EAAO,CAClD,EAAS,OAAO,KAAK,QAAS,IAEhC,EAAU,UAAU,kBAAoB,SAAU,EAAO,CACvD,EAAO,KAAK,QAAS,KAAK,WAAY,IAGxC,WAAgB,EAAS,GAAM,GAAO,CACpC,EAAU,UAAY,CACpB,GAAI,IACJ,GAAI,CACF,GAAc,GAAK,UACZ,GAAP,CACA,MAAO,GAAS,OAAO,EAAS,IAElC,AAAI,KAAgB,EAClB,EAAS,OAAO,EAAS,GAAI,WAAU,uCAEvC,EAAS,QAAQ,EAAS,MAKhC,EAAS,QAAU,SAAU,EAAM,GAAO,CACxC,GAAI,IAAS,EAAS,EAAS,IAC/B,GAAI,GAAO,SAAW,QACpB,MAAO,GAAS,OAAO,EAAM,GAAO,OAEtC,GAAI,IAAW,GAAO,MAEtB,GAAI,GACF,GAAsB,EAAM,QACvB,CACL,EAAK,MAAQ,EACb,EAAK,QAAU,GAGf,OAFI,IAAI,GACJ,GAAM,EAAK,MAAM,OACd,EAAE,GAAI,IACX,EAAK,MAAM,IAAG,cAAc,IAGhC,MAAO,IAET,EAAS,OAAS,SAAU,EAAM,GAAO,CACvC,EAAK,MAAQ,EACb,EAAK,QAAU,GAGf,OAFI,IAAI,GACJ,GAAM,EAAK,MAAM,OACd,EAAE,GAAI,IACX,EAAK,MAAM,IAAG,aAAa,IAE7B,MAAO,IAGT,WAAiB,EAAK,CAEpB,GAAI,IAAO,GAAO,EAAI,KACtB,GAAI,GAAQ,OAAO,IAAQ,UAAY,MAAO,IAAQ,aAAe,MAAO,KAAS,WACnF,MAAO,WAAoB,CACzB,GAAK,MAAM,EAAK,YAKtB,YAA+B,EAAM,GAAU,CAE7C,GAAI,IAAS,GACb,YAAiB,GAAO,CACtB,AAAI,IAGJ,IAAS,GACT,EAAS,OAAO,EAAM,KAGxB,YAAmB,GAAO,CACxB,AAAI,IAGJ,IAAS,GACT,EAAS,QAAQ,EAAM,KAGzB,aAAuB,CACrB,GAAS,GAAW,IAGtB,GAAI,IAAS,EAAS,IACtB,AAAI,GAAO,SAAW,SACpB,GAAQ,GAAO,OAInB,WAAkB,EAAM,GAAO,CAC7B,GAAI,IAAM,GACV,GAAI,CACF,GAAI,MAAQ,EAAK,IACjB,GAAI,OAAS,gBACN,GAAP,CACA,GAAI,OAAS,QACb,GAAI,MAAQ,GAEd,MAAO,IAGT,EAAQ,QAAU,GAClB,YAAiB,EAAO,CACtB,MAAI,aAAiB,MACZ,EAEF,EAAS,QAAQ,GAAI,MAAK,GAAW,GAG9C,EAAQ,OAAS,EACjB,WAAgB,EAAQ,CACtB,GAAI,IAAU,GAAI,MAAK,GACvB,MAAO,GAAS,OAAO,GAAS,GAGlC,EAAQ,IAAM,GACd,YAAa,EAAU,CACrB,GAAI,IAAO,KACX,GAAI,OAAO,UAAU,SAAS,KAAK,KAAc,iBAC/C,MAAO,MAAK,OAAO,GAAI,WAAU,qBAGnC,GAAI,IAAM,EAAS,OACf,GAAS,GACb,GAAI,CAAC,GACH,MAAO,MAAK,QAAQ,IAQtB,OALI,IAAS,GAAI,OAAM,IACnB,GAAW,EACX,GAAI,GACJ,GAAU,GAAI,MAAK,GAEhB,EAAE,GAAI,IACX,GAAY,EAAS,IAAI,IAE3B,MAAO,IACP,YAAqB,GAAO,GAAG,CAC7B,GAAK,QAAQ,IAAO,KAAK,GAAgB,SAAU,GAAO,CACxD,AAAK,IACH,IAAS,GACT,EAAS,OAAO,GAAS,OAG7B,YAAwB,GAAU,CAChC,GAAO,IAAK,GACR,EAAE,KAAa,IAAO,CAAC,IACzB,IAAS,GACT,EAAS,QAAQ,GAAS,OAMlC,EAAQ,KAAO,GACf,YAAc,EAAU,CACtB,GAAI,IAAO,KACX,GAAI,OAAO,UAAU,SAAS,KAAK,KAAc,iBAC/C,MAAO,MAAK,OAAO,GAAI,WAAU,qBAGnC,GAAI,IAAM,EAAS,OACf,GAAS,GACb,GAAI,CAAC,GACH,MAAO,MAAK,QAAQ,IAMtB,OAHI,IAAI,GACJ,GAAU,GAAI,MAAK,GAEhB,EAAE,GAAI,IACX,GAAS,EAAS,KAEpB,MAAO,IACP,YAAkB,GAAO,CACvB,GAAK,QAAQ,IAAO,KAAK,SAAU,GAAU,CAC3C,AAAK,IACH,IAAS,GACT,EAAS,QAAQ,GAAS,MAE3B,SAAU,GAAO,CAClB,AAAK,IACH,IAAS,GACT,EAAS,OAAO,GAAS,UAM/B,CAAC,IAAI,IAAI,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CAC9C,AAAC,UAAU,EAAO,CAClB,aACA,AAAI,MAAO,GAAO,SAAY,YAC5B,GAAO,QAAU,EAAQ,MAGxB,KAAK,KAAK,MAAO,SAAW,YAAc,OAAS,MAAO,OAAS,YAAc,KAAO,MAAO,SAAW,YAAc,OAAS,KAClI,CAAC,IAAI,IAAI,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CAC9C,aAEA,GAAI,GAAU,MAAO,SAAW,YAAc,MAAO,QAAO,UAAa,SAAW,SAAU,EAAK,CAAE,MAAO,OAAO,IAAS,SAAU,EAAK,CAAE,MAAO,IAAO,MAAO,SAAW,YAAc,EAAI,cAAgB,QAAU,IAAQ,OAAO,UAAY,SAAW,MAAO,IAEtQ,WAAyB,EAAU,EAAa,CAAE,GAAI,CAAE,aAAoB,IAAgB,KAAM,IAAI,WAAU,qCAEhH,YAAkB,CAEd,GAAI,CACA,GAAI,MAAO,YAAc,YACrB,MAAO,WAEX,GAAI,MAAO,kBAAoB,YAC3B,MAAO,iBAEX,GAAI,MAAO,eAAiB,YACxB,MAAO,cAEX,GAAI,MAAO,aAAe,YACtB,MAAO,YAEX,GAAI,MAAO,cAAgB,YACvB,MAAO,mBAEN,EAAP,CACE,QAIR,GAAI,GAAM,IAEV,YAA4B,CACxB,GAAI,CAGA,GAAI,CAAC,GAAO,CAAC,EAAI,KACb,MAAO,GAMX,GAAI,GAAW,MAAO,eAAiB,aAAe,4BAA4B,KAAK,UAAU,YAAc,CAAC,SAAS,KAAK,UAAU,YAAc,CAAC,aAAa,KAAK,UAAU,UAE/K,EAAW,MAAO,QAAU,YAAc,MAAM,WAAW,QAAQ,kBAAoB,GAQ3F,MAAQ,EAAC,GAAY,IAAa,MAAO,YAAc,aAKvD,MAAO,cAAgB,kBAClB,EAAP,CACE,MAAO,IAUf,WAAoB,EAAO,EAAY,CAEnC,EAAQ,GAAS,GACjB,EAAa,GAAc,GAC3B,GAAI,CACA,MAAO,IAAI,MAAK,EAAO,SAClB,EAAP,CACE,GAAI,EAAE,OAAS,YACX,KAAM,GAIV,OAFI,GAAU,MAAO,cAAgB,YAAc,YAAc,MAAO,gBAAkB,YAAc,cAAgB,MAAO,iBAAmB,YAAc,eAAiB,kBAC7K,EAAU,GAAI,GACT,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EACnC,EAAQ,OAAO,EAAM,IAEzB,MAAO,GAAQ,QAAQ,EAAW,OAM1C,AAAI,MAAO,UAAY,aAGnB,EAAQ,GAEZ,GAAI,GAAY,QAEhB,WAAyB,EAAS,EAAU,CACxC,AAAI,GACA,EAAQ,KAAK,SAAU,EAAQ,CAC3B,EAAS,KAAM,IAChB,SAAU,EAAO,CAChB,EAAS,KAKrB,WAA6B,EAAS,EAAU,EAAe,CAC3D,AAAI,MAAO,IAAa,YACpB,EAAQ,KAAK,GAGb,MAAO,IAAkB,YACzB,EAAQ,MAAS,GAIzB,WAAsB,EAAK,CAEvB,MAAI,OAAO,IAAQ,UACf,SAAQ,KAAK,EAAM,2CACnB,EAAM,OAAO,IAGV,EAGX,aAAuB,CACnB,GAAI,UAAU,QAAU,MAAO,WAAU,UAAU,OAAS,IAAO,WAC/D,MAAO,WAAU,UAAU,OAAS,GAO5C,GAAI,GAA4B,mCAC5B,GAAgB,OAChB,EAAa,GACb,GAAW,OAAO,UAAU,SAG5B,GAAY,WACZ,EAAa,YAOjB,YAAiC,EAAK,CAIlC,OAHI,GAAS,EAAI,OACb,EAAM,GAAI,aAAY,GACtB,EAAM,GAAI,YAAW,GAChB,EAAI,EAAG,EAAI,EAAQ,IACxB,EAAI,GAAK,EAAI,WAAW,GAE5B,MAAO,GAkBX,YAAyC,EAAK,CAC1C,MAAO,IAAI,GAAU,SAAU,EAAS,CACpC,GAAI,GAAM,EAAI,YAAY,EAA2B,GACjD,EAAO,EAAW,CAAC,KACvB,EAAI,YAAY,GAA2B,IAAI,EAAM,OAErD,EAAI,QAAU,SAAU,EAAG,CAGvB,EAAE,iBACF,EAAE,kBACF,EAAQ,KAGZ,EAAI,WAAa,UAAY,CACzB,GAAI,GAAgB,UAAU,UAAU,MAAM,iBAC1C,EAAc,UAAU,UAAU,MAAM,UAG5C,EAAQ,GAAe,CAAC,GAAiB,SAAS,EAAc,GAAI,KAAO,OAEhF,MAAS,UAAY,CACpB,MAAO,KAIf,YAA2B,EAAK,CAC5B,MAAI,OAAO,KAAkB,UAClB,EAAU,QAAQ,IAEtB,GAAgC,GAAK,KAAK,SAAU,EAAO,CAC9D,UAAgB,EACT,KAIf,YAAyB,EAAQ,CAC7B,GAAI,GAAY,EAAW,EAAO,MAG9B,EAAoB,GAExB,EAAkB,QAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACjE,EAAkB,QAAU,EAC5B,EAAkB,OAAS,IAI/B,EAAU,mBAAmB,KAAK,GAGlC,AAAK,EAAU,QAGX,EAAU,QAAU,EAAU,QAAQ,KAAK,UAAY,CACnD,MAAO,GAAkB,UAH7B,EAAU,QAAU,EAAkB,QAQ9C,YAA2B,EAAQ,CAC/B,GAAI,GAAY,EAAW,EAAO,MAG9B,EAAoB,EAAU,mBAAmB,MAIrD,GAAI,EACA,SAAkB,UACX,EAAkB,QAIjC,YAA0B,EAAQ,EAAK,CACnC,GAAI,GAAY,EAAW,EAAO,MAG9B,EAAoB,EAAU,mBAAmB,MAIrD,GAAI,EACA,SAAkB,OAAO,GAClB,EAAkB,QAIjC,YAAwB,EAAQ,EAAe,CAC3C,MAAO,IAAI,GAAU,SAAU,EAAS,EAAQ,CAG5C,GAFA,EAAW,EAAO,MAAQ,EAAW,EAAO,OAAS,KAEjD,EAAO,GACP,GAAI,EACA,GAAgB,GAChB,EAAO,GAAG,YAEV,OAAO,GAAQ,EAAO,IAI9B,GAAI,GAAS,CAAC,EAAO,MAErB,AAAI,GACA,EAAO,KAAK,EAAO,SAGvB,GAAI,GAAU,EAAI,KAAK,MAAM,EAAK,GAElC,AAAI,GACA,GAAQ,gBAAkB,SAAU,GAAG,CACnC,GAAI,IAAK,EAAQ,OACjB,GAAI,CACA,GAAG,kBAAkB,EAAO,WACxB,GAAE,YAAc,GAEhB,GAAG,kBAAkB,SAEpB,GAAP,CACE,GAAI,GAAG,OAAS,kBACZ,QAAQ,KAAK,iBAAmB,EAAO,KAAO,oCAA2C,GAAE,WAAa,eAAiB,GAAE,WAAa,sBAAwB,EAAO,UAAY,yBAEnL,MAAM,OAMtB,EAAQ,QAAU,SAAU,GAAG,CAC3B,GAAE,iBACF,EAAO,EAAQ,QAGnB,EAAQ,UAAY,UAAY,CAC5B,EAAQ,EAAQ,QAChB,GAAkB,MAK9B,YAAgC,EAAQ,CACpC,MAAO,IAAe,EAAQ,IAGlC,YAAgC,EAAQ,CACpC,MAAO,IAAe,EAAQ,IAGlC,YAA0B,EAAQ,EAAgB,CAC9C,GAAI,CAAC,EAAO,GACR,MAAO,GAGX,GAAI,GAAa,CAAC,EAAO,GAAG,iBAAiB,SAAS,EAAO,WACzD,EAAc,EAAO,QAAU,EAAO,GAAG,QACzC,EAAY,EAAO,QAAU,EAAO,GAAG,QAY3C,GAVI,GAGI,GAAO,UAAY,GACnB,QAAQ,KAAK,iBAAmB,EAAO,KAAO,sCAA6C,EAAO,GAAG,QAAU,eAAiB,EAAO,QAAU,KAGrJ,EAAO,QAAU,EAAO,GAAG,SAG3B,GAAa,EAAY,CAIzB,GAAI,EAAY,CACZ,GAAI,GAAa,EAAO,GAAG,QAAU,EACrC,AAAI,EAAa,EAAO,SACpB,GAAO,QAAU,GAIzB,MAAO,GAGX,MAAO,GAIX,YAAqB,EAAM,CACvB,MAAO,IAAI,GAAU,SAAU,EAAS,EAAQ,CAC5C,GAAI,GAAS,GAAI,YACjB,EAAO,QAAU,EACjB,EAAO,UAAY,SAAU,EAAG,CAC5B,GAAI,GAAS,KAAK,EAAE,OAAO,QAAU,IACrC,EAAQ,CACJ,4BAA6B,GAC7B,KAAM,EACN,KAAM,EAAK,QAGnB,EAAO,mBAAmB,KAKlC,YAAqB,EAAa,CAC9B,GAAI,GAAY,GAAwB,KAAK,EAAY,OACzD,MAAO,GAAW,CAAC,GAAY,CAAE,KAAM,EAAY,OAIvD,YAAwB,EAAO,CAC3B,MAAO,IAAS,EAAM,4BAO1B,YAAqB,EAAU,CAC3B,GAAI,GAAO,KAEP,EAAU,EAAK,aAAa,KAAK,UAAY,CAC7C,GAAI,GAAY,EAAW,EAAK,QAAQ,MAExC,GAAI,GAAa,EAAU,QACvB,MAAO,GAAU,UAIzB,SAAoB,EAAS,EAAU,GAChC,EAMX,YAAuB,EAAQ,CAC3B,GAAgB,GAKhB,OAHI,GAAY,EAAW,EAAO,MAC9B,EAAU,EAAU,QAEf,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACrC,GAAI,GAAS,EAAQ,GACrB,AAAI,EAAO,QAAQ,IACf,GAAO,QAAQ,GAAG,QAClB,EAAO,QAAQ,GAAK,MAG5B,SAAO,GAAK,KAEL,GAAuB,GAAQ,KAAK,SAAU,EAAI,CAErD,MADA,GAAO,GAAK,EACR,GAAiB,GAEV,GAAuB,GAE3B,IACR,KAAK,SAAU,EAAI,CAGlB,EAAO,GAAK,EAAU,GAAK,EAC3B,OAAS,IAAI,EAAG,GAAI,EAAQ,OAAQ,KAChC,EAAQ,IAAG,QAAQ,GAAK,IAE7B,MAAS,SAAU,EAAK,CACvB,SAAiB,EAAQ,GACnB,IAMd,YAA2B,EAAQ,EAAM,EAAU,EAAS,CACxD,AAAI,IAAY,QACZ,GAAU,GAGd,GAAI,CACA,GAAI,GAAK,EAAO,GAAG,YAAY,EAAO,UAAW,GACjD,EAAS,KAAM,SACV,EAAP,CACE,GAAI,EAAU,GAAM,EAAC,EAAO,IAAM,EAAI,OAAS,qBAAuB,EAAI,OAAS,iBAC/E,MAAO,GAAU,UAAU,KAAK,UAAY,CACxC,GAAI,CAAC,EAAO,IAAM,EAAI,OAAS,iBAAmB,CAAC,EAAO,GAAG,iBAAiB,SAAS,EAAO,YAAc,EAAO,SAAW,EAAO,GAAG,QAEpI,MAAI,GAAO,IACP,GAAO,QAAU,EAAO,GAAG,QAAU,GAGlC,GAAuB,KAEnC,KAAK,UAAY,CAChB,MAAO,IAAc,GAAQ,KAAK,UAAY,CAC1C,GAAkB,EAAQ,EAAM,EAAU,EAAU,OAEzD,MAAS,GAGhB,EAAS,IAIjB,aAA2B,CACvB,MAAO,CAEH,QAAS,GAET,GAAI,KAEJ,QAAS,KAET,mBAAoB,IAM5B,YAAsB,EAAS,CAC3B,GAAI,GAAO,KACP,EAAS,CACT,GAAI,MAGR,GAAI,EACA,OAAS,KAAK,GACV,EAAO,GAAK,EAAQ,GAK5B,GAAI,GAAY,EAAW,EAAO,MAGlC,AAAK,GACD,GAAY,KAEZ,EAAW,EAAO,MAAQ,GAI9B,EAAU,QAAQ,KAAK,GAGlB,EAAK,YACN,GAAK,WAAa,EAAK,MACvB,EAAK,MAAQ,IAIjB,GAAI,GAAe,GAEnB,aAAwB,CAGpB,MAAO,GAAU,UAGrB,OAAS,IAAI,EAAG,GAAI,EAAU,QAAQ,OAAQ,KAAK,CAC/C,GAAI,IAAS,EAAU,QAAQ,IAC/B,AAAI,KAAW,GAEX,EAAa,KAAK,GAAO,aAAa,MAAS,KAKvD,GAAI,IAAU,EAAU,QAAQ,MAAM,GAItC,MAAO,GAAU,IAAI,GAAc,KAAK,UAAY,CAChD,SAAO,GAAK,EAAU,GAEf,GAAuB,KAC/B,KAAK,SAAU,GAAI,CAElB,MADA,GAAO,GAAK,GACR,GAAiB,EAAQ,EAAK,eAAe,SAEtC,GAAuB,GAE3B,KACR,KAAK,SAAU,GAAI,CAClB,EAAO,GAAK,EAAU,GAAK,GAC3B,EAAK,QAAU,EAEf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAS,GAAQ,IACrB,AAAI,KAAW,GAEX,IAAO,QAAQ,GAAK,EAAO,GAC3B,GAAO,QAAQ,QAAU,EAAO,YAMhD,WAAiB,EAAK,EAAU,CAC5B,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,GAAK,GAAa,CACnE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,IAAI,GAEpB,GAAI,UAAY,UAAY,CACxB,GAAI,IAAQ,GAAI,OAChB,AAAI,KAAU,QACV,IAAQ,MAER,GAAe,KACf,IAAQ,GAAY,KAExB,EAAQ,KAGZ,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAIX,YAAiB,EAAU,EAAU,CACjC,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,GAAK,GAAa,CACnE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,aACZ,GAAkB,EAEtB,GAAI,UAAY,UAAY,CACxB,GAAI,IAAS,GAAI,OAEjB,GAAI,GAAQ,CACR,GAAI,IAAQ,GAAO,MACnB,AAAI,GAAe,KACf,IAAQ,GAAY,KAExB,GAAI,IAAS,EAAS,GAAO,GAAO,IAAK,MAKzC,AAAI,KAAW,OACX,EAAQ,IAER,GAAO,eAGX,MAIR,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAElB,EAGX,YAAiB,EAAK,EAAO,EAAU,CACnC,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,GAAI,GAAU,SAAU,EAAS,GAAQ,CACnD,GAAI,IACJ,EAAK,QAAQ,KAAK,UAAY,CAE1B,MADA,IAAS,EAAK,QACV,GAAS,KAAK,KAAW,gBAClB,GAAkB,GAAO,IAAI,KAAK,SAAU,GAAa,CAC5D,MAAI,IACO,EAEJ,GAAY,KAGpB,IACR,KAAK,SAAU,GAAO,CACrB,GAAkB,EAAK,QAAS,EAAY,SAAU,GAAK,GAAa,CACpE,GAAI,GACA,MAAO,IAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAMjD,AAAI,KAAU,MACV,IAAQ,QAGZ,GAAI,IAAM,GAAM,IAAI,GAAO,GAE3B,GAAY,WAAa,UAAY,CAOjC,AAAI,KAAU,QACV,IAAQ,MAGZ,EAAQ,KAEZ,GAAY,QAAU,GAAY,QAAU,UAAY,CACpD,GAAI,IAAM,GAAI,MAAQ,GAAI,MAAQ,GAAI,YAAY,MAClD,GAAO,WAEN,GAAP,CACE,GAAO,SAGhB,MAAS,MAGhB,SAAgB,EAAS,GAClB,EAGX,YAAoB,EAAK,EAAU,CAC/B,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,EAAY,SAAU,GAAK,GAAa,CACpE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAM7C,GAAM,GAAM,OAAU,GAC1B,GAAY,WAAa,UAAY,CACjC,KAGJ,GAAY,QAAU,UAAY,CAC9B,EAAO,GAAI,QAKf,GAAY,QAAU,UAAY,CAC9B,GAAI,IAAM,GAAI,MAAQ,GAAI,MAAQ,GAAI,YAAY,MAClD,EAAO,WAEN,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAe,EAAU,CACrB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,EAAY,SAAU,EAAK,GAAa,CACpE,GAAI,EACA,MAAO,GAAO,GAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,QAEhB,GAAY,WAAa,UAAY,CACjC,KAGJ,GAAY,QAAU,GAAY,QAAU,UAAY,CACpD,GAAI,IAAM,GAAI,MAAQ,GAAI,MAAQ,GAAI,YAAY,MAClD,EAAO,WAEN,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAgB,EAAU,CACtB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,EAAK,GAAa,CACnE,GAAI,EACA,MAAO,GAAO,GAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,QAEhB,GAAI,UAAY,UAAY,CACxB,EAAQ,GAAI,SAGhB,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAa,EAAG,EAAU,CACtB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,GAAI,EAAI,EAAG,CACP,EAAQ,MAER,OAGJ,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,GAAK,GAAa,CACnE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAW,GACX,GAAM,GAAM,gBAEhB,GAAI,UAAY,UAAY,CACxB,GAAI,IAAS,GAAI,OACjB,GAAI,CAAC,GAAQ,CAET,EAAQ,MAER,OAGJ,AAAI,IAAM,GAKD,GAFL,EAAQ,GAAO,KAKX,IAAW,GACX,GAAO,QAAQ,KAQ3B,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAc,EAAU,CACpB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,EAAK,GAAa,CACnE,GAAI,EACA,MAAO,GAAO,GAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,gBACZ,GAAO,GAEX,GAAI,UAAY,UAAY,CACxB,GAAI,IAAS,GAAI,OAEjB,GAAI,CAAC,GAAQ,CACT,EAAQ,IACR,OAGJ,GAAK,KAAK,GAAO,KACjB,GAAO,YAGX,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAsB,EAAS,EAAU,CACrC,EAAW,GAAY,MAAM,KAAM,WAEnC,GAAI,GAAgB,KAAK,SACzB,EAAU,MAAO,IAAY,YAAc,GAAW,GACjD,EAAQ,MACT,GAAQ,KAAO,EAAQ,MAAQ,EAAc,KAC7C,EAAQ,UAAY,EAAQ,WAAa,EAAc,WAG3D,GAAI,GAAO,KACP,EACJ,GAAI,CAAC,EAAQ,KACT,EAAU,EAAU,OAAO,yBACxB,CACH,GAAI,GAAc,EAAQ,OAAS,EAAc,MAAQ,EAAK,QAAQ,GAElE,GAAY,EAAc,EAAU,QAAQ,EAAK,QAAQ,IAAM,GAAuB,GAAS,KAAK,SAAU,GAAI,CAClH,GAAI,IAAY,EAAW,EAAQ,MAC/B,GAAU,GAAU,QACxB,GAAU,GAAK,GACf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAChC,GAAQ,IAAG,QAAQ,GAAK,GAE5B,MAAO,MAGX,AAAK,EAAQ,UA6CT,EAAU,GAAU,KAAK,SAAU,GAAI,CACnC,GAAI,EAAC,GAAG,iBAAiB,SAAS,EAAQ,WAI1C,IAAI,IAAa,GAAG,QAAU,EAE9B,GAAgB,GAEhB,GAAI,IAAY,EAAW,EAAQ,MAC/B,GAAU,GAAU,QAExB,GAAG,QACH,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAS,GAAQ,IACrB,GAAO,QAAQ,GAAK,KACpB,GAAO,QAAQ,QAAU,GAG7B,GAAI,IAAoB,GAAI,GAAU,SAAU,GAAS,GAAQ,CAC7D,GAAI,IAAM,EAAI,KAAK,EAAQ,KAAM,IAEjC,GAAI,QAAU,SAAU,GAAK,CACzB,GAAI,IAAK,GAAI,OACb,GAAG,QACH,GAAO,KAGX,GAAI,gBAAkB,UAAY,CAC9B,GAAI,IAAK,GAAI,OACb,GAAG,kBAAkB,EAAQ,YAGjC,GAAI,UAAY,UAAY,CACxB,GAAI,IAAK,GAAI,OACb,GAAG,QACH,GAAQ,OAIhB,MAAO,IAAkB,KAAK,SAAU,GAAI,CACxC,GAAU,GAAK,GACf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAW,GAAQ,IACvB,GAAS,QAAQ,GAAK,GACtB,GAAkB,GAAS,YAEhC,MAAS,SAAU,GAAK,CACvB,KAAC,IAAiB,EAAS,KAAQ,EAAU,WAAW,MAAS,UAAY,IACvE,QA7Fd,EAAU,GAAU,KAAK,SAAU,GAAI,CACnC,GAAgB,GAEhB,GAAI,IAAY,EAAW,EAAQ,MAC/B,GAAU,GAAU,QAExB,GAAG,QACH,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAS,GAAQ,IACrB,GAAO,QAAQ,GAAK,KAGxB,GAAI,IAAgB,GAAI,GAAU,SAAU,GAAS,GAAQ,CACzD,GAAI,IAAM,EAAI,eAAe,EAAQ,MAErC,GAAI,QAAU,GAAI,UAAY,SAAU,GAAK,CACzC,GAAI,IAAK,GAAI,OACb,AAAI,IACA,GAAG,QAEP,GAAO,KAGX,GAAI,UAAY,UAAY,CACxB,GAAI,IAAK,GAAI,OACb,AAAI,IACA,GAAG,QAEP,GAAQ,OAIhB,MAAO,IAAc,KAAK,SAAU,GAAI,CACpC,GAAU,GAAK,GACf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAU,GAAQ,IACtB,GAAkB,GAAQ,YAE/B,MAAS,SAAU,GAAK,CACvB,KAAC,IAAiB,EAAS,KAAQ,EAAU,WAAW,MAAS,UAAY,IACvE,OA2DtB,SAAgB,EAAS,GAClB,EAGX,GAAI,IAAe,CACf,QAAS,eACT,aAAc,GACd,SAAU,IACV,QAAS,GACT,QAAS,EACT,QAAS,GACT,WAAY,GACZ,MAAO,GACP,OAAQ,GACR,IAAK,GACL,KAAM,GACN,aAAc,IAGlB,aAAyB,CACrB,MAAO,OAAO,eAAiB,WAMnC,GAAI,IAAa,mEAEb,GAAmB,uBACnB,GAAyB,gCAEzB,GAAoB,YACpB,GAA2B,GAAkB,OAG7C,GAAmB,OACnB,GAAY,OACZ,GAAiB,OACjB,EAAkB,OAClB,GAAyB,OACzB,GAAkB,OAClB,GAAkB,OAClB,GAAmB,OACnB,GAAmB,OACnB,GAAoB,OACpB,GAAoB,OACpB,GAAgC,GAA2B,GAAiB,OAE5E,GAAa,OAAO,UAAU,SAElC,YAAwB,EAAkB,CAEtC,GAAI,GAAe,EAAiB,OAAS,IACzC,EAAM,EAAiB,OACvB,EACA,EAAI,EACJ,EAAU,GAAU,GAAU,GAElC,AAAI,EAAiB,EAAiB,OAAS,KAAO,KAClD,KACI,EAAiB,EAAiB,OAAS,KAAO,KAClD,KAIR,GAAI,IAAS,GAAI,aAAY,GACzB,GAAQ,GAAI,YAAW,IAE3B,IAAK,EAAI,EAAG,EAAI,EAAK,GAAK,EACtB,EAAW,GAAW,QAAQ,EAAiB,IAC/C,GAAW,GAAW,QAAQ,EAAiB,EAAI,IACnD,GAAW,GAAW,QAAQ,EAAiB,EAAI,IACnD,GAAW,GAAW,QAAQ,EAAiB,EAAI,IAGnD,GAAM,KAAO,GAAY,EAAI,IAAY,EACzC,GAAM,KAAQ,IAAW,KAAO,EAAI,IAAY,EAChD,GAAM,KAAQ,IAAW,IAAM,EAAI,GAAW,GAElD,MAAO,IAKX,YAAwB,EAAQ,CAE5B,GAAI,GAAQ,GAAI,YAAW,GACvB,EAAe,GACf,EAEJ,IAAK,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EAE/B,GAAgB,GAAW,EAAM,IAAM,GACvC,GAAgB,GAAY,GAAM,GAAK,IAAM,EAAI,EAAM,EAAI,IAAM,GACjE,GAAgB,GAAY,GAAM,EAAI,GAAK,KAAO,EAAI,EAAM,EAAI,IAAM,GACtE,GAAgB,GAAW,EAAM,EAAI,GAAK,IAG9C,MAAI,GAAM,OAAS,GAAM,EACrB,EAAe,EAAa,UAAU,EAAG,EAAa,OAAS,GAAK,IAC7D,EAAM,OAAS,GAAM,GAC5B,GAAe,EAAa,UAAU,EAAG,EAAa,OAAS,GAAK,MAGjE,EAMX,YAAmB,EAAO,EAAU,CAChC,GAAI,GAAY,GAShB,GARI,GACA,GAAY,GAAW,KAAK,IAO5B,GAAU,KAAc,wBAA0B,EAAM,QAAU,GAAW,KAAK,EAAM,UAAY,wBAAyB,CAG7H,GAAI,GACA,EAAS,GAEb,AAAI,YAAiB,aACjB,GAAS,EACT,GAAU,IAEV,GAAS,EAAM,OAEf,AAAI,IAAc,qBACd,GAAU,GACP,AAAI,IAAc,sBACrB,GAAU,EACP,AAAI,IAAc,6BACrB,GAAU,GACP,AAAI,IAAc,sBACrB,GAAU,GACP,AAAI,IAAc,uBACrB,GAAU,GACP,AAAI,IAAc,sBACrB,GAAU,GACP,AAAI,IAAc,uBACrB,GAAU,GACP,AAAI,IAAc,wBACrB,GAAU,GACP,AAAI,IAAc,wBACrB,GAAU,GAEV,EAAS,GAAI,OAAM,wCAI3B,EAAS,EAAS,GAAe,YAC1B,IAAc,gBAAiB,CAEtC,GAAI,GAAa,GAAI,YAErB,EAAW,OAAS,UAAY,CAE5B,GAAI,IAAM,GAAmB,EAAM,KAAO,IAAM,GAAe,KAAK,QAEpE,EAAS,GAAoB,GAAY,KAG7C,EAAW,kBAAkB,OAE7B,IAAI,CACA,EAAS,KAAK,UAAU,UACnB,GAAP,CACE,QAAQ,MAAM,8CAA+C,GAE7D,EAAS,KAAM,KAa3B,YAAqB,EAAO,CAIxB,GAAI,EAAM,UAAU,EAAG,MAA8B,GACjD,MAAO,MAAK,MAAM,GAMtB,GAAI,GAAmB,EAAM,UAAU,IACnC,EAAO,EAAM,UAAU,GAA0B,IAEjD,EAGJ,GAAI,IAAS,IAAa,GAAuB,KAAK,GAAmB,CACrE,GAAI,GAAU,EAAiB,MAAM,IACrC,EAAW,EAAQ,GACnB,EAAmB,EAAiB,UAAU,EAAQ,GAAG,QAE7D,GAAI,GAAS,GAAe,GAI5B,OAAQ,OACC,IACD,MAAO,OACN,IACD,MAAO,GAAW,CAAC,GAAS,CAAE,KAAM,QACnC,IACD,MAAO,IAAI,WAAU,OACpB,GACD,MAAO,IAAI,YAAW,OACrB,IACD,MAAO,IAAI,mBAAkB,OAC5B,IACD,MAAO,IAAI,YAAW,OACrB,IACD,MAAO,IAAI,aAAY,OACtB,IACD,MAAO,IAAI,YAAW,OACrB,IACD,MAAO,IAAI,aAAY,OACtB,IACD,MAAO,IAAI,cAAa,OACvB,IACD,MAAO,IAAI,cAAa,WAExB,KAAM,IAAI,OAAM,gBAAkB,IAI9C,GAAI,IAAwB,CACxB,UAAW,GACX,YAAa,GACb,eAAgB,GAChB,eAAgB,IAapB,YAAuB,EAAG,EAAQ,EAAU,EAAe,CACvD,EAAE,WAAW,8BAAgC,EAAO,UAAY,+CAAqD,GAAI,EAAU,GAKvI,YAAwB,EAAS,CAC7B,GAAI,GAAO,KACP,EAAS,CACT,GAAI,MAGR,GAAI,EACA,OAAS,KAAK,GACV,EAAO,GAAK,MAAO,GAAQ,IAAO,SAAW,EAAQ,GAAG,WAAa,EAAQ,GAIrF,GAAI,GAAgB,GAAI,GAAU,SAAU,EAAS,GAAQ,CAGzD,GAAI,CACA,EAAO,GAAK,aAAa,EAAO,KAAM,OAAO,EAAO,SAAU,EAAO,YAAa,EAAO,YACpF,GAAP,CACE,MAAO,IAAO,IAIlB,EAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,EAAQ,UAAY,CACjC,EAAK,QAAU,EACf,KACD,SAAU,GAAG,GAAO,CACnB,GAAO,OAEZ,MAGP,SAAO,WAAa,GACb,EAGX,YAAuB,EAAG,EAAQ,EAAc,EAAM,EAAU,EAAe,CAC3E,EAAE,WAAW,EAAc,EAAM,EAAU,SAAU,GAAG,GAAO,CAC3D,AAAI,GAAM,OAAS,GAAM,WACrB,GAAE,WAAW,iEAAuE,CAAC,EAAO,WAAY,SAAU,GAAG,GAAS,CAC1H,AAAK,GAAQ,KAAK,OAOd,EAAc,GAAG,IAJjB,GAAc,GAAG,EAAQ,UAAY,CACjC,GAAE,WAAW,EAAc,EAAM,EAAU,IAC5C,IAIR,GAEH,EAAc,GAAG,KAEtB,GAGP,YAAmB,EAAK,EAAU,CAC9B,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAClB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,iBAAmB,GAAO,UAAY,yBAA0B,CAAC,GAAM,SAAU,GAAG,GAAS,CAClH,GAAI,IAAS,GAAQ,KAAK,OAAS,GAAQ,KAAK,KAAK,GAAG,MAAQ,KAIhE,AAAI,IACA,IAAS,GAAO,WAAW,YAAY,KAG3C,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAmB,EAAU,EAAU,CACnC,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAElB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,iBAAmB,GAAO,UAAW,GAAI,SAAU,GAAG,GAAS,CAIpF,OAHI,IAAO,GAAQ,KACf,GAAS,GAAK,OAET,GAAI,EAAG,GAAI,GAAQ,KAAK,CAC7B,GAAI,IAAO,GAAK,KAAK,IACjB,GAAS,GAAK,MAYlB,GARI,IACA,IAAS,GAAO,WAAW,YAAY,KAG3C,GAAS,EAAS,GAAQ,GAAK,IAAK,GAAI,GAIpC,KAAW,OAAQ,CACnB,EAAQ,IACR,QAIR,KACD,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAkB,EAAK,EAAO,EAAU,EAAa,CACjD,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,GAAI,GAAU,SAAU,GAAS,GAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAI1B,AAAI,IAAU,QACV,GAAQ,MAIZ,GAAI,IAAgB,EAEhB,GAAS,EAAK,QAClB,GAAO,WAAW,UAAU,EAAO,SAAU,GAAO,GAAO,CACvD,AAAI,GACA,GAAO,IAEP,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,0BAA4B,GAAO,UAAY,8BAAoC,CAAC,EAAK,IAAQ,UAAY,CAClI,GAAQ,KACT,SAAU,GAAG,GAAO,CACnB,GAAO,OAEZ,SAAU,GAAU,CAGnB,GAAI,GAAS,OAAS,GAAS,UAAW,CAQtC,GAAI,EAAc,EAAG,CACjB,GAAQ,GAAS,MAAM,EAAM,CAAC,EAAK,GAAe,EAAU,EAAc,KAC1E,OAEJ,GAAO,WAKxB,MAAS,MAGhB,SAAgB,EAAS,GAClB,EAGX,YAAmB,EAAK,EAAO,EAAU,CACrC,MAAO,IAAS,MAAM,KAAM,CAAC,EAAK,EAAO,EAAU,IAGvD,YAAsB,EAAK,EAAU,CACjC,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAClB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,eAAiB,GAAO,UAAY,iBAAkB,CAAC,GAAM,UAAY,CAC9F,KACD,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAKX,YAAiB,EAAU,CACvB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,GAAS,EAAK,QAClB,EAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,EAAQ,eAAiB,EAAO,UAAW,GAAI,UAAY,CACxE,KACD,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAKX,YAAkB,EAAU,CACxB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,GAAS,EAAK,QAClB,EAAO,GAAG,YAAY,SAAU,GAAG,CAE/B,GAAc,GAAG,EAAQ,+BAAiC,EAAO,UAAW,GAAI,SAAU,GAAG,GAAS,CAClG,GAAI,IAAS,GAAQ,KAAK,KAAK,GAAG,EAClC,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAUX,YAAe,EAAG,EAAU,CACxB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAClB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,mBAAqB,GAAO,UAAY,wBAAyB,CAAC,EAAI,GAAI,SAAU,GAAG,GAAS,CACrH,GAAI,IAAS,GAAQ,KAAK,OAAS,GAAQ,KAAK,KAAK,GAAG,IAAM,KAC9D,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAGX,YAAgB,EAAU,CACtB,GAAI,GAAO,KAEP,EAAU,GAAI,GAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,GAAS,EAAK,QAClB,EAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,EAAQ,mBAAqB,EAAO,UAAW,GAAI,SAAU,GAAG,GAAS,CAGtF,OAFI,IAAO,GAEF,GAAI,EAAG,GAAI,GAAQ,KAAK,OAAQ,KACrC,GAAK,KAAK,GAAQ,KAAK,KAAK,IAAG,KAGnC,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,SAAgB,EAAS,GAClB,EAKX,YAA0B,EAAI,CAC1B,MAAO,IAAI,GAAU,SAAU,EAAS,EAAQ,CAC5C,EAAG,YAAY,SAAU,EAAG,CACxB,EAAE,WAAW,8FAAoG,GAAI,SAAU,EAAG,EAAS,CAGvI,OAFI,IAAa,GAER,GAAI,EAAG,GAAI,EAAQ,KAAK,OAAQ,KACrC,GAAW,KAAK,EAAQ,KAAK,KAAK,IAAG,MAGzC,EAAQ,CACJ,GAAI,EACJ,WAAY,MAEjB,SAAU,EAAG,EAAO,CACnB,EAAO,MAEZ,SAAU,EAAU,CACnB,EAAO,OAKnB,YAAwB,EAAS,EAAU,CACvC,EAAW,GAAY,MAAM,KAAM,WAEnC,GAAI,GAAgB,KAAK,SACzB,EAAU,MAAO,IAAY,YAAc,GAAW,GACjD,EAAQ,MACT,GAAQ,KAAO,EAAQ,MAAQ,EAAc,KAC7C,EAAQ,UAAY,EAAQ,WAAa,EAAc,WAG3D,GAAI,GAAO,KACP,EACJ,MAAK,GAAQ,KAGT,EAAU,GAAI,GAAU,SAAU,EAAS,CACvC,GAAI,IACJ,AAAI,EAAQ,OAAS,EAAc,KAE/B,GAAK,EAAK,QAAQ,GAElB,GAAK,aAAa,EAAQ,KAAM,GAAI,GAAI,GAG5C,AAAK,EAAQ,UAIT,EAAQ,CACJ,GAAI,GACJ,WAAY,CAAC,EAAQ,aAJzB,EAAQ,GAAiB,OAO9B,KAAK,SAAU,EAAe,CAC7B,MAAO,IAAI,GAAU,SAAU,GAAS,GAAQ,CAC5C,EAAc,GAAG,YAAY,SAAU,GAAG,CACtC,YAAmB,GAAW,CAC1B,MAAO,IAAI,GAAU,SAAU,GAAS,GAAQ,CAC5C,GAAE,WAAW,wBAA0B,GAAW,GAAI,UAAY,CAC9D,MACD,SAAU,GAAG,GAAO,CACnB,GAAO,QAMnB,OADI,IAAa,GACR,GAAI,EAAG,GAAM,EAAc,WAAW,OAAQ,GAAI,GAAK,KAC5D,GAAW,KAAK,GAAU,EAAc,WAAW,MAGvD,EAAU,IAAI,IAAY,KAAK,UAAY,CACvC,OACD,MAAS,SAAU,GAAG,CACrB,GAAO,OAEZ,SAAU,GAAU,CACnB,GAAO,UA5CnB,EAAU,EAAU,OAAO,qBAkD/B,EAAgB,EAAS,GAClB,EAGX,GAAI,IAAgB,CAChB,QAAS,gBACT,aAAc,GACd,SAAU,KACV,QAAS,GACT,QAAS,GACT,QAAS,GACT,WAAY,GACZ,MAAO,GACP,OAAQ,GACR,IAAK,GACL,KAAM,GACN,aAAc,IAGlB,aAA+B,CAC3B,GAAI,CACA,MAAO,OAAO,eAAiB,aAAe,WAAa,eAE3D,CAAC,CAAC,aAAa,cACV,EAAP,CACE,MAAO,IAIf,YAAuB,EAAS,EAAe,CAC3C,GAAI,GAAY,EAAQ,KAAO,IAE/B,MAAI,GAAQ,YAAc,EAAc,WACpC,IAAa,EAAQ,UAAY,KAE9B,EAIX,aAAqC,CACjC,GAAI,GAAsB,4BAE1B,GAAI,CACA,oBAAa,QAAQ,EAAqB,IAC1C,aAAa,WAAW,GAEjB,SACF,EAAP,CACE,MAAO,IAQf,aAAiC,CAC7B,MAAO,CAAC,MAA+B,aAAa,OAAS,EAIjE,YAAwB,EAAS,CAC7B,GAAI,GAAO,KACP,EAAS,GACb,GAAI,EACA,OAAS,KAAK,GACV,EAAO,GAAK,EAAQ,GAM5B,MAFA,GAAO,UAAY,GAAc,EAAS,EAAK,gBAE3C,AAAC,KAIL,GAAK,QAAU,EACf,EAAO,WAAa,GAEb,EAAU,WANN,EAAU,SAWzB,YAAiB,EAAU,CACvB,GAAI,GAAO,KACP,EAAU,EAAK,QAAQ,KAAK,UAAY,CAGxC,OAFI,GAAY,EAAK,QAAQ,UAEpB,EAAI,aAAa,OAAS,EAAG,GAAK,EAAG,IAAK,CAC/C,GAAI,GAAM,aAAa,IAAI,GAE3B,AAAI,EAAI,QAAQ,KAAe,GAC3B,aAAa,WAAW,MAKpC,SAAgB,EAAS,GAClB,EAMX,YAAmB,EAAK,EAAU,CAC9B,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,EAAK,QAAQ,KAAK,UAAY,CACxC,GAAI,GAAS,EAAK,QACd,EAAS,aAAa,QAAQ,EAAO,UAAY,GAMrD,MAAI,IACA,GAAS,EAAO,WAAW,YAAY,IAGpC,IAGX,SAAgB,EAAS,GAClB,EAIX,YAAmB,EAAU,EAAU,CACnC,GAAI,GAAO,KAEP,EAAU,EAAK,QAAQ,KAAK,UAAY,CAcxC,OAbI,GAAS,EAAK,QACd,EAAY,EAAO,UACnB,GAAkB,EAAU,OAC5B,GAAS,aAAa,OAQtB,GAAkB,EAEb,GAAI,EAAG,GAAI,GAAQ,KAAK,CAC7B,GAAI,IAAM,aAAa,IAAI,IAC3B,GAAI,GAAI,QAAQ,KAAe,EAG/B,IAAI,IAAQ,aAAa,QAAQ,IAYjC,GANI,IACA,IAAQ,EAAO,WAAW,YAAY,KAG1C,GAAQ,EAAS,GAAO,GAAI,UAAU,IAAkB,MAEpD,KAAU,OACV,MAAO,QAKnB,SAAgB,EAAS,GAClB,EAIX,YAAe,EAAG,EAAU,CACxB,GAAI,GAAO,KACP,EAAU,EAAK,QAAQ,KAAK,UAAY,CACxC,GAAI,GAAS,EAAK,QACd,EACJ,GAAI,CACA,EAAS,aAAa,IAAI,SACrB,GAAP,CACE,EAAS,KAIb,MAAI,IACA,GAAS,EAAO,UAAU,EAAO,UAAU,SAGxC,IAGX,SAAgB,EAAS,GAClB,EAGX,YAAgB,EAAU,CACtB,GAAI,GAAO,KACP,EAAU,EAAK,QAAQ,KAAK,UAAY,CAKxC,OAJI,GAAS,EAAK,QACd,EAAS,aAAa,OACtB,EAAO,GAEF,GAAI,EAAG,GAAI,EAAQ,KAAK,CAC7B,GAAI,IAAU,aAAa,IAAI,IAC/B,AAAI,GAAQ,QAAQ,EAAO,aAAe,GACtC,EAAK,KAAK,GAAQ,UAAU,EAAO,UAAU,SAIrD,MAAO,KAGX,SAAgB,EAAS,GAClB,EAIX,YAAkB,EAAU,CACxB,GAAI,GAAO,KACP,EAAU,EAAK,OAAO,KAAK,SAAU,EAAM,CAC3C,MAAO,GAAK,SAGhB,SAAgB,EAAS,GAClB,EAIX,YAAsB,EAAK,EAAU,CACjC,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,EAAK,QAAQ,KAAK,UAAY,CACxC,GAAI,GAAS,EAAK,QAClB,aAAa,WAAW,EAAO,UAAY,KAG/C,SAAgB,EAAS,GAClB,EAOX,YAAmB,EAAK,EAAO,EAAU,CACrC,GAAI,GAAO,KAEX,EAAM,EAAa,GAEnB,GAAI,GAAU,EAAK,QAAQ,KAAK,UAAY,CAGxC,AAAI,IAAU,QACV,GAAQ,MAIZ,GAAI,GAAgB,EAEpB,MAAO,IAAI,GAAU,SAAU,GAAS,GAAQ,CAC5C,GAAI,IAAS,EAAK,QAClB,GAAO,WAAW,UAAU,EAAO,SAAU,GAAO,GAAO,CACvD,GAAI,GACA,GAAO,QAEP,IAAI,CACA,aAAa,QAAQ,GAAO,UAAY,EAAK,IAC7C,GAAQ,SACH,GAAP,CAGE,AAAI,IAAE,OAAS,sBAAwB,GAAE,OAAS,+BAC9C,GAAO,IAEX,GAAO,WAO3B,SAAgB,EAAS,GAClB,EAGX,YAAwB,EAAS,EAAU,CAIvC,GAHA,EAAW,GAAY,MAAM,KAAM,WAEnC,EAAU,MAAO,IAAY,YAAc,GAAW,GAClD,CAAC,EAAQ,KAAM,CACf,GAAI,GAAgB,KAAK,SACzB,EAAQ,KAAO,EAAQ,MAAQ,EAAc,KAC7C,EAAQ,UAAY,EAAQ,WAAa,EAAc,UAG3D,GAAI,GAAO,KACP,EACJ,MAAK,GAAQ,KAGT,EAAU,GAAI,GAAU,SAAU,EAAS,CACvC,AAAK,EAAQ,UAGT,EAAQ,GAAc,EAAS,EAAK,iBAFpC,EAAQ,EAAQ,KAAO,OAI5B,KAAK,SAAU,EAAW,CACzB,OAAS,IAAI,aAAa,OAAS,EAAG,IAAK,EAAG,KAAK,CAC/C,GAAI,IAAM,aAAa,IAAI,IAE3B,AAAI,GAAI,QAAQ,KAAe,GAC3B,aAAa,WAAW,OAbpC,EAAU,EAAU,OAAO,qBAmB/B,EAAgB,EAAS,GAClB,EAGX,GAAI,IAAsB,CACtB,QAAS,sBACT,aAAc,GACd,SAAU,KACV,QAAS,GACT,QAAS,GACT,QAAS,GACT,WAAY,GACZ,MAAO,GACP,OAAQ,GACR,IAAK,GACL,KAAM,GACN,aAAc,IAGd,GAAY,SAAmB,EAAG,EAAG,CACrC,MAAO,KAAM,GAAK,MAAO,IAAM,UAAY,MAAO,IAAM,UAAY,MAAM,IAAM,MAAM,IAGtF,GAAW,SAAkB,EAAO,EAAe,CAGnD,OAFI,GAAM,EAAM,OACZ,EAAI,EACD,EAAI,GAAK,CACZ,GAAI,GAAU,EAAM,GAAI,GACpB,MAAO,GAEX,IAGJ,MAAO,IAGP,GAAU,MAAM,SAAW,SAAU,EAAK,CAC1C,MAAO,QAAO,UAAU,SAAS,KAAK,KAAS,kBAK/C,GAAiB,GAEjB,GAAgB,GAEhB,GAAiB,CACjB,UAAW,GACX,OAAQ,GACR,aAAc,IAGd,GAAqB,CAAC,GAAe,UAAU,QAAS,GAAe,OAAO,QAAS,GAAe,aAAa,SAEnH,GAAwB,CAAC,gBAEzB,GAAiB,CAAC,QAAS,UAAW,UAAW,MAAO,OAAQ,SAAU,aAAc,WAAW,OAAO,IAE1G,GAAgB,CAChB,YAAa,GACb,OAAQ,GAAmB,QAC3B,KAAM,cAGN,KAAM,QACN,UAAW,gBACX,QAAS,GAGb,YAAuB,EAAqB,EAAe,CACvD,EAAoB,GAAiB,UAAY,CAC7C,GAAI,GAAQ,UACZ,MAAO,GAAoB,QAAQ,KAAK,UAAY,CAChD,MAAO,GAAoB,GAAe,MAAM,EAAqB,MAKjF,aAAkB,CACd,OAAS,GAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,CACvC,GAAI,GAAM,UAAU,GAEpB,GAAI,EACA,OAAS,KAAQ,GACb,AAAI,EAAI,eAAe,IACnB,CAAI,GAAQ,EAAI,IACZ,UAAU,GAAG,GAAQ,EAAI,GAAM,QAE/B,UAAU,GAAG,GAAQ,EAAI,IAO7C,MAAO,WAAU,GAGrB,GAAI,IAAc,UAAY,CAC1B,WAAqB,EAAS,CAC1B,EAAgB,KAAM,GAEtB,OAAS,KAAiB,IACtB,GAAI,GAAe,eAAe,GAAgB,CAC9C,GAAI,GAAS,GAAe,GACxB,EAAa,EAAO,QACxB,KAAK,GAAiB,EAEjB,GAAe,IAIhB,KAAK,aAAa,GAK9B,KAAK,eAAiB,GAAO,GAAI,IACjC,KAAK,QAAU,GAAO,GAAI,KAAK,eAAgB,GAC/C,KAAK,WAAa,KAClB,KAAK,YAAc,KACnB,KAAK,OAAS,GACd,KAAK,QAAU,KAEf,KAAK,+BACL,KAAK,UAAU,KAAK,QAAQ,QAAQ,MAAS,UAAY,IAS7D,SAAY,UAAU,OAAS,SAAgB,EAAS,CAIpD,GAAK,OAAO,IAAY,YAAc,YAAc,EAAQ,MAAc,SAAU,CAGhF,GAAI,KAAK,OACL,MAAO,IAAI,OAAM,wDAGrB,OAAS,KAAK,GAAS,CAKnB,GAJI,IAAM,aACN,GAAQ,GAAK,EAAQ,GAAG,QAAQ,MAAO,MAGvC,IAAM,WAAa,MAAO,GAAQ,IAAO,SACzC,MAAO,IAAI,OAAM,sCAGrB,KAAK,QAAQ,GAAK,EAAQ,GAK9B,MAAI,UAAY,IAAW,EAAQ,OACxB,KAAK,UAAU,KAAK,QAAQ,QAGhC,OACJ,OAAI,OAAO,IAAY,SACnB,KAAK,QAAQ,GAEb,KAAK,SAQpB,EAAY,UAAU,aAAe,SAAsB,EAAc,EAAU,EAAe,CAC9F,GAAI,GAAU,GAAI,GAAU,SAAU,GAAS,GAAQ,CACnD,GAAI,CACA,GAAI,IAAa,EAAa,QAC1B,GAAkB,GAAI,OAAM,wFAIhC,GAAI,CAAC,EAAa,QAAS,CACvB,GAAO,IACP,OAIJ,OADI,IAAgB,GAAe,OAAO,gBACjC,GAAI,EAAG,GAAM,GAAc,OAAQ,GAAI,GAAK,KAAK,CACtD,GAAI,IAAmB,GAAc,IAIjC,GAAa,CAAC,GAAS,GAAuB,IAClD,GAAK,KAAc,EAAa,MAAsB,MAAO,GAAa,KAAsB,WAAY,CACxG,GAAO,IACP,QAIR,GAAI,IAA0B,UAAmC,CAU7D,OATI,IAA8B,SAAqC,GAAY,CAC/E,MAAO,WAAY,CACf,GAAI,IAAQ,GAAI,OAAM,UAAY,GAAa,6CAC3C,GAAU,EAAU,OAAO,IAC/B,SAAgB,GAAS,UAAU,UAAU,OAAS,IAC/C,KAIN,GAAK,EAAG,GAAO,GAAsB,OAAQ,GAAK,GAAM,KAAM,CACnE,GAAI,IAAuB,GAAsB,IACjD,AAAK,EAAa,KACd,GAAa,IAAwB,GAA4B,OAK7E,KAEA,GAAI,IAAmB,SAA0B,GAAS,CACtD,AAAI,GAAe,KACf,QAAQ,KAAK,kCAAoC,IAErD,GAAe,IAAc,EAC7B,GAAc,IAAc,GAI5B,MAGJ,AAAI,YAAc,GACd,AAAI,EAAa,UAAY,MAAO,GAAa,UAAa,WAC1D,EAAa,WAAW,KAAK,GAAkB,IAE/C,GAAiB,CAAC,CAAC,EAAa,UAGpC,GAAiB,UAEhB,GAAP,CACE,GAAO,OAIf,SAAoB,EAAS,EAAU,GAChC,GAGX,EAAY,UAAU,OAAS,UAAkB,CAC7C,MAAO,MAAK,SAAW,MAG3B,EAAY,UAAU,UAAY,SAAmB,EAAY,EAAU,EAAe,CACtF,GAAI,GAAmB,GAAe,GAAc,EAAU,QAAQ,GAAe,IAAe,EAAU,OAAO,GAAI,OAAM,sBAE/H,SAAoB,EAAkB,EAAU,GACzC,GAGX,EAAY,UAAU,cAAgB,SAAuB,EAAU,CACnE,GAAI,GAAoB,EAAU,QAAQ,IAC1C,SAAoB,EAAmB,GAChC,GAGX,EAAY,UAAU,MAAQ,SAAe,EAAU,CACnD,GAAI,GAAO,KAEP,EAAU,EAAK,WAAW,KAAK,UAAY,CAC3C,MAAI,GAAK,SAAW,MAChB,GAAK,OAAS,EAAK,eAGhB,EAAK,SAGhB,SAAoB,EAAS,EAAU,GAChC,GAGX,EAAY,UAAU,UAAY,SAAmB,EAAS,EAAU,EAAe,CACnF,GAAI,GAAO,KAEX,AAAK,GAAQ,IACT,GAAU,CAAC,IAGf,GAAI,IAAmB,KAAK,qBAAqB,GAEjD,aAA6B,CACzB,EAAK,QAAQ,OAAS,EAAK,SAG/B,YAA8B,GAAQ,CAClC,SAAK,QAAQ,IACb,KAEA,EAAK,OAAS,EAAK,aAAa,EAAK,SAC9B,EAAK,OAGhB,YAAoB,GAAkB,CAClC,MAAO,WAAY,CACf,GAAI,IAAqB,EAEzB,aAA6B,CACzB,KAAO,GAAqB,GAAiB,QAAQ,CACjD,GAAI,IAAa,GAAiB,IAClC,YAEA,EAAK,QAAU,KACf,EAAK,OAAS,KAEP,EAAK,UAAU,IAAY,KAAK,IAAsB,MAAS,IAG1E,KACA,GAAI,IAAQ,GAAI,OAAM,sCACtB,SAAK,WAAa,EAAU,OAAO,IAC5B,EAAK,WAGhB,MAAO,OAOf,GAAI,IAAmB,KAAK,aAAe,KAAO,KAAK,WAAW,MAAS,UAAY,CACnF,MAAO,GAAU,YAChB,EAAU,UAEf,YAAK,WAAa,GAAiB,KAAK,UAAY,CAChD,GAAI,IAAa,GAAiB,GAClC,SAAK,QAAU,KACf,EAAK,OAAS,KAEP,EAAK,UAAU,IAAY,KAAK,SAAU,GAAQ,CACrD,EAAK,QAAU,GAAO,QACtB,KACA,EAAK,+BACL,EAAK,YAAc,GAAW,QAEnC,MAAS,UAAY,CACpB,KACA,GAAI,IAAQ,GAAI,OAAM,sCACtB,SAAK,WAAa,EAAU,OAAO,IAC5B,EAAK,aAGhB,EAAoB,KAAK,WAAY,EAAU,GACxC,KAAK,YAGhB,EAAY,UAAU,SAAW,SAAkB,EAAY,CAC3D,MAAO,CAAC,CAAC,GAAc,IAG3B,EAAY,UAAU,QAAU,SAAiB,EAA6B,CAC1E,GAAO,KAAM,IAGjB,EAAY,UAAU,qBAAuB,SAA8B,EAAS,CAEhF,OADI,GAAmB,GACd,EAAI,EAAG,EAAM,EAAQ,OAAQ,EAAI,EAAK,IAAK,CAChD,GAAI,IAAa,EAAQ,GACzB,AAAI,KAAK,SAAS,KACd,EAAiB,KAAK,IAG9B,MAAO,IAGX,EAAY,UAAU,6BAA+B,UAAwC,CAKzF,OAAS,GAAI,EAAG,EAAM,GAAe,OAAQ,EAAI,EAAK,IAClD,GAAc,KAAM,GAAe,KAI3C,EAAY,UAAU,eAAiB,SAAwB,EAAS,CACpE,MAAO,IAAI,GAAY,IAGpB,KAOP,GAAiB,GAAI,IAEzB,EAAO,QAAU,IAEf,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,OC/uFpB,2BAEA,GAAQ,WAAa,GACrB,GAAQ,YAAc,GACtB,GAAQ,cAAgB,GAExB,GAAI,IAAS,GACT,GAAY,GACZ,GAAM,MAAO,aAAe,YAAc,WAAa,MAEvD,GAAO,mEACX,OAAS,IAAI,EAAG,GAAM,GAAK,OAAQ,GAAI,GAAK,EAAE,GAC5C,GAAO,IAAK,GAAK,IACjB,GAAU,GAAK,WAAW,KAAM,GAKlC,GAAU,IAAI,WAAW,IAAM,GAC/B,GAAU,IAAI,WAAW,IAAM,GAE/B,YAAkB,EAAK,CACrB,GAAI,GAAM,EAAI,OAEd,GAAI,EAAM,EAAI,EACZ,KAAM,IAAI,OAAM,kDAKlB,GAAI,GAAW,EAAI,QAAQ,KAC3B,AAAI,IAAa,IAAI,GAAW,GAEhC,GAAI,GAAkB,IAAa,EAC/B,EACA,EAAK,EAAW,EAEpB,MAAO,CAAC,EAAU,GAIpB,YAAqB,EAAK,CACxB,GAAI,GAAO,GAAQ,GACf,EAAW,EAAK,GAChB,EAAkB,EAAK,GAC3B,MAAS,GAAW,GAAmB,EAAI,EAAK,EAGlD,YAAsB,EAAK,EAAU,EAAiB,CACpD,MAAS,GAAW,GAAmB,EAAI,EAAK,EAGlD,YAAsB,EAAK,CACzB,GAAI,GACA,EAAO,GAAQ,GACf,EAAW,EAAK,GAChB,EAAkB,EAAK,GAEvB,EAAM,GAAI,IAAI,GAAY,EAAK,EAAU,IAEzC,EAAU,EAGV,EAAM,EAAkB,EACxB,EAAW,EACX,EAEA,EACJ,IAAK,EAAI,EAAG,EAAI,EAAK,GAAK,EACxB,EACG,GAAU,EAAI,WAAW,KAAO,GAChC,GAAU,EAAI,WAAW,EAAI,KAAO,GACpC,GAAU,EAAI,WAAW,EAAI,KAAO,EACrC,GAAU,EAAI,WAAW,EAAI,IAC/B,EAAI,KAAc,GAAO,GAAM,IAC/B,EAAI,KAAc,GAAO,EAAK,IAC9B,EAAI,KAAa,EAAM,IAGzB,MAAI,KAAoB,GACtB,GACG,GAAU,EAAI,WAAW,KAAO,EAChC,GAAU,EAAI,WAAW,EAAI,KAAO,EACvC,EAAI,KAAa,EAAM,KAGrB,IAAoB,GACtB,GACG,GAAU,EAAI,WAAW,KAAO,GAChC,GAAU,EAAI,WAAW,EAAI,KAAO,EACpC,GAAU,EAAI,WAAW,EAAI,KAAO,EACvC,EAAI,KAAc,GAAO,EAAK,IAC9B,EAAI,KAAa,EAAM,KAGlB,EAGT,YAA0B,EAAK,CAC7B,MAAO,IAAO,GAAO,GAAK,IACxB,GAAO,GAAO,GAAK,IACnB,GAAO,GAAO,EAAI,IAClB,GAAO,EAAM,IAGjB,YAAsB,EAAO,EAAO,EAAK,CAGvC,OAFI,GACA,EAAS,GACJ,EAAI,EAAO,EAAI,EAAK,GAAK,EAChC,EACI,GAAM,IAAM,GAAM,UAClB,GAAM,EAAI,IAAM,EAAK,OACtB,GAAM,EAAI,GAAK,KAClB,EAAO,KAAK,GAAgB,IAE9B,MAAO,GAAO,KAAK,IAGrB,YAAwB,EAAO,CAQ7B,OAPI,GACA,EAAM,EAAM,OACZ,EAAa,EAAM,EACnB,EAAQ,GACR,EAAiB,MAGZ,EAAI,EAAG,EAAO,EAAM,EAAY,EAAI,EAAM,GAAK,EACtD,EAAM,KAAK,GAAY,EAAO,EAAI,EAAI,EAAkB,EAAO,EAAQ,EAAI,IAI7E,MAAI,KAAe,EACjB,GAAM,EAAM,EAAM,GAClB,EAAM,KACJ,GAAO,GAAO,GACd,GAAQ,GAAO,EAAK,IACpB,OAEO,IAAe,GACxB,GAAO,GAAM,EAAM,IAAM,GAAK,EAAM,EAAM,GAC1C,EAAM,KACJ,GAAO,GAAO,IACd,GAAQ,GAAO,EAAK,IACpB,GAAQ,GAAO,EAAK,IACpB,MAIG,EAAM,KAAK,OCpJpB,cACA,GAAQ,KAAO,SAAU,EAAQ,EAAQ,EAAM,EAAM,EAAQ,CAC3D,GAAI,GAAG,EACH,EAAQ,EAAS,EAAK,EAAO,EAC7B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAQ,GACR,EAAI,EAAQ,EAAS,EAAK,EAC1B,EAAI,EAAO,GAAK,EAChB,EAAI,EAAO,EAAS,GAOxB,IALA,GAAK,EAEL,EAAI,EAAM,IAAM,CAAC,GAAU,EAC3B,IAAO,CAAC,EACR,GAAS,EACF,EAAQ,EAAG,EAAK,EAAI,IAAO,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAG,CAK1E,IAHA,EAAI,EAAM,IAAM,CAAC,GAAU,EAC3B,IAAO,CAAC,EACR,GAAS,EACF,EAAQ,EAAG,EAAK,EAAI,IAAO,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAG,CAE1E,GAAI,IAAM,EACR,EAAI,EAAI,MACH,IAAI,IAAM,EACf,MAAO,GAAI,IAAQ,GAAI,GAAK,GAAK,SAEjC,EAAI,EAAI,KAAK,IAAI,EAAG,GACpB,EAAI,EAAI,EAEV,MAAQ,GAAI,GAAK,GAAK,EAAI,KAAK,IAAI,EAAG,EAAI,IAG5C,GAAQ,MAAQ,SAAU,EAAQ,EAAO,EAAQ,EAAM,EAAM,EAAQ,CACnE,GAAI,GAAG,EAAG,EACN,EAAQ,EAAS,EAAK,EAAO,EAC7B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAM,IAAS,GAAK,KAAK,IAAI,EAAG,KAAO,KAAK,IAAI,EAAG,KAAO,EAC1D,EAAI,EAAO,EAAK,EAAS,EACzB,EAAI,EAAO,EAAI,GACf,EAAI,EAAQ,GAAM,IAAU,GAAK,EAAI,EAAQ,EAAK,EAAI,EAmC1D,IAjCA,EAAQ,KAAK,IAAI,GAEjB,AAAI,MAAM,IAAU,IAAU,SAC5B,GAAI,MAAM,GAAS,EAAI,EACvB,EAAI,GAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAS,KAAK,KAClC,EAAS,GAAI,KAAK,IAAI,EAAG,CAAC,IAAM,GAClC,KACA,GAAK,GAEP,AAAI,EAAI,GAAS,EACf,GAAS,EAAK,EAEd,GAAS,EAAK,KAAK,IAAI,EAAG,EAAI,GAE5B,EAAQ,GAAK,GACf,KACA,GAAK,GAGP,AAAI,EAAI,GAAS,EACf,GAAI,EACJ,EAAI,GACC,AAAI,EAAI,GAAS,EACtB,GAAM,GAAQ,EAAK,GAAK,KAAK,IAAI,EAAG,GACpC,EAAI,EAAI,GAER,GAAI,EAAQ,KAAK,IAAI,EAAG,EAAQ,GAAK,KAAK,IAAI,EAAG,GACjD,EAAI,IAID,GAAQ,EAAG,EAAO,EAAS,GAAK,EAAI,IAAM,GAAK,EAAG,GAAK,IAAK,GAAQ,EAAG,CAI9E,IAFA,EAAK,GAAK,EAAQ,EAClB,GAAQ,EACD,EAAO,EAAG,EAAO,EAAS,GAAK,EAAI,IAAM,GAAK,EAAG,GAAK,IAAK,GAAQ,EAAG,CAE7E,EAAO,EAAS,EAAI,IAAM,EAAI,OCnFhC,cAQA,aAEA,GAAM,IAAS,KACT,GAAU,KACV,GACH,MAAO,SAAW,YAAc,MAAO,QAAO,KAAW,WACtD,OAAO,IAAO,8BACd,KAEN,GAAQ,OAAS,GACjB,GAAQ,WAAa,GACrB,GAAQ,kBAAoB,GAE5B,GAAM,IAAe,WACrB,GAAQ,WAAa,GAgBrB,GAAO,oBAAsB,KAE7B,AAAI,CAAC,GAAO,qBAAuB,MAAO,UAAY,aAClD,MAAO,SAAQ,OAAU,YAC3B,QAAQ,MACN,iJAKJ,aAA8B,CAE5B,GAAI,CACF,GAAM,GAAM,GAAI,YAAW,GACrB,EAAQ,CAAE,IAAK,UAAY,CAAE,MAAO,MAC1C,cAAO,eAAe,EAAO,WAAW,WACxC,OAAO,eAAe,EAAK,GACpB,EAAI,QAAU,SACd,EAAP,CACA,MAAO,IAIX,OAAO,eAAe,GAAO,UAAW,SAAU,CAChD,WAAY,GACZ,IAAK,UAAY,CACf,GAAI,EAAC,GAAO,SAAS,MACrB,MAAO,MAAK,UAIhB,OAAO,eAAe,GAAO,UAAW,SAAU,CAChD,WAAY,GACZ,IAAK,UAAY,CACf,GAAI,EAAC,GAAO,SAAS,MACrB,MAAO,MAAK,cAIhB,YAAuB,EAAQ,CAC7B,GAAI,EAAS,GACX,KAAM,IAAI,YAAW,cAAgB,EAAS,kCAGhD,GAAM,GAAM,GAAI,YAAW,GAC3B,cAAO,eAAe,EAAK,GAAO,WAC3B,EAaT,YAAiB,EAAK,EAAkB,EAAQ,CAE9C,GAAI,MAAO,IAAQ,SAAU,CAC3B,GAAI,MAAO,IAAqB,SAC9B,KAAM,IAAI,WACR,sEAGJ,MAAO,IAAY,GAErB,MAAO,IAAK,EAAK,EAAkB,GAGrC,GAAO,SAAW,KAElB,YAAe,EAAO,EAAkB,EAAQ,CAC9C,GAAI,MAAO,IAAU,SACnB,MAAO,IAAW,EAAO,GAG3B,GAAI,YAAY,OAAO,GACrB,MAAO,IAAc,GAGvB,GAAI,GAAS,KACX,KAAM,IAAI,WACR,kHAC0C,MAAO,IASrD,GALI,GAAW,EAAO,cACjB,GAAS,GAAW,EAAM,OAAQ,cAInC,MAAO,oBAAsB,aAC5B,IAAW,EAAO,oBAClB,GAAS,GAAW,EAAM,OAAQ,oBACrC,MAAO,IAAgB,EAAO,EAAkB,GAGlD,GAAI,MAAO,IAAU,SACnB,KAAM,IAAI,WACR,yEAIJ,GAAM,GAAU,EAAM,SAAW,EAAM,UACvC,GAAI,GAAW,MAAQ,IAAY,EACjC,MAAO,IAAO,KAAK,EAAS,EAAkB,GAGhD,GAAM,GAAI,GAAW,GACrB,GAAI,EAAG,MAAO,GAEd,GAAI,MAAO,SAAW,aAAe,OAAO,aAAe,MACvD,MAAO,GAAM,OAAO,cAAiB,WACvC,MAAO,IAAO,KAAK,EAAM,OAAO,aAAa,UAAW,EAAkB,GAG5E,KAAM,IAAI,WACR,kHAC0C,MAAO,IAYrD,GAAO,KAAO,SAAU,EAAO,EAAkB,EAAQ,CACvD,MAAO,IAAK,EAAO,EAAkB,IAKvC,OAAO,eAAe,GAAO,UAAW,WAAW,WACnD,OAAO,eAAe,GAAQ,YAE9B,YAAqB,EAAM,CACzB,GAAI,MAAO,IAAS,SAClB,KAAM,IAAI,WAAU,0CACf,GAAI,EAAO,EAChB,KAAM,IAAI,YAAW,cAAgB,EAAO,kCAIhD,YAAgB,EAAM,EAAM,EAAU,CAEpC,MADA,IAAW,GACP,GAAQ,EACH,GAAa,GAElB,IAAS,OAIJ,MAAO,IAAa,SACvB,GAAa,GAAM,KAAK,EAAM,GAC9B,GAAa,GAAM,KAAK,GAEvB,GAAa,GAOtB,GAAO,MAAQ,SAAU,EAAM,EAAM,EAAU,CAC7C,MAAO,IAAM,EAAM,EAAM,IAG3B,YAAsB,EAAM,CAC1B,UAAW,GACJ,GAAa,EAAO,EAAI,EAAI,GAAQ,GAAQ,GAMrD,GAAO,YAAc,SAAU,EAAM,CACnC,MAAO,IAAY,IAKrB,GAAO,gBAAkB,SAAU,EAAM,CACvC,MAAO,IAAY,IAGrB,YAAqB,EAAQ,EAAU,CAKrC,GAJI,OAAO,IAAa,UAAY,IAAa,KAC/C,GAAW,QAGT,CAAC,GAAO,WAAW,GACrB,KAAM,IAAI,WAAU,qBAAuB,GAG7C,GAAM,GAAS,GAAW,EAAQ,GAAY,EAC1C,EAAM,GAAa,GAEjB,EAAS,EAAI,MAAM,EAAQ,GAEjC,MAAI,KAAW,GAIb,GAAM,EAAI,MAAM,EAAG,IAGd,EAGT,YAAwB,EAAO,CAC7B,GAAM,GAAS,EAAM,OAAS,EAAI,EAAI,GAAQ,EAAM,QAAU,EACxD,EAAM,GAAa,GACzB,OAAS,GAAI,EAAG,EAAI,EAAQ,GAAK,EAC/B,EAAI,GAAK,EAAM,GAAK,IAEtB,MAAO,GAGT,YAAwB,EAAW,CACjC,GAAI,GAAW,EAAW,YAAa,CACrC,GAAM,GAAO,GAAI,YAAW,GAC5B,MAAO,IAAgB,EAAK,OAAQ,EAAK,WAAY,EAAK,YAE5D,MAAO,IAAc,GAGvB,YAA0B,EAAO,EAAY,EAAQ,CACnD,GAAI,EAAa,GAAK,EAAM,WAAa,EACvC,KAAM,IAAI,YAAW,wCAGvB,GAAI,EAAM,WAAa,EAAc,IAAU,GAC7C,KAAM,IAAI,YAAW,wCAGvB,GAAI,GACJ,MAAI,KAAe,QAAa,IAAW,OACzC,EAAM,GAAI,YAAW,GAChB,AAAI,IAAW,OACpB,EAAM,GAAI,YAAW,EAAO,GAE5B,EAAM,GAAI,YAAW,EAAO,EAAY,GAI1C,OAAO,eAAe,EAAK,GAAO,WAE3B,EAGT,YAAqB,EAAK,CACxB,GAAI,GAAO,SAAS,GAAM,CACxB,GAAM,GAAM,GAAQ,EAAI,QAAU,EAC5B,EAAM,GAAa,GAEzB,MAAI,GAAI,SAAW,GAInB,EAAI,KAAK,EAAK,EAAG,EAAG,GACb,EAGT,GAAI,EAAI,SAAW,OACjB,MAAI,OAAO,GAAI,QAAW,UAAY,GAAY,EAAI,QAC7C,GAAa,GAEf,GAAc,GAGvB,GAAI,EAAI,OAAS,UAAY,MAAM,QAAQ,EAAI,MAC7C,MAAO,IAAc,EAAI,MAI7B,YAAkB,EAAQ,CAGxB,GAAI,GAAU,GACZ,KAAM,IAAI,YAAW,0DACa,GAAa,SAAS,IAAM,UAEhE,MAAO,GAAS,EAGlB,YAAqB,EAAQ,CAC3B,MAAI,CAAC,GAAU,GACb,GAAS,GAEJ,GAAO,MAAM,CAAC,GAGvB,GAAO,SAAW,SAAmB,EAAG,CACtC,MAAO,IAAK,MAAQ,EAAE,YAAc,IAClC,IAAM,GAAO,WAGjB,GAAO,QAAU,SAAkB,EAAG,EAAG,CAGvC,GAFI,GAAW,EAAG,aAAa,GAAI,GAAO,KAAK,EAAG,EAAE,OAAQ,EAAE,aAC1D,GAAW,EAAG,aAAa,GAAI,GAAO,KAAK,EAAG,EAAE,OAAQ,EAAE,aAC1D,CAAC,GAAO,SAAS,IAAM,CAAC,GAAO,SAAS,GAC1C,KAAM,IAAI,WACR,yEAIJ,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,GAAI,EAAE,OACN,EAAI,EAAE,OAEV,OAAS,GAAI,EAAG,EAAM,KAAK,IAAI,EAAG,GAAI,EAAI,EAAK,EAAE,EAC/C,GAAI,EAAE,KAAO,EAAE,GAAI,CACjB,EAAI,EAAE,GACN,EAAI,EAAE,GACN,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,GAGT,GAAO,WAAa,SAAqB,EAAU,CACjD,OAAQ,OAAO,GAAU,mBAClB,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,WACH,MAAO,WAEP,MAAO,KAIb,GAAO,OAAS,SAAiB,EAAM,EAAQ,CAC7C,GAAI,CAAC,MAAM,QAAQ,GACjB,KAAM,IAAI,WAAU,+CAGtB,GAAI,EAAK,SAAW,EAClB,MAAO,IAAO,MAAM,GAGtB,GAAI,GACJ,GAAI,IAAW,OAEb,IADA,EAAS,EACJ,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAC7B,GAAU,EAAK,GAAG,OAItB,GAAM,GAAS,GAAO,YAAY,GAC9B,EAAM,EACV,IAAK,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAAG,CAChC,GAAI,GAAM,EAAK,GACf,GAAI,GAAW,EAAK,YAClB,AAAI,EAAM,EAAI,OAAS,EAAO,OACvB,IAAO,SAAS,IAAM,GAAM,GAAO,KAAK,IAC7C,EAAI,KAAK,EAAQ,IAEjB,WAAW,UAAU,IAAI,KACvB,EACA,EACA,WAGM,GAAO,SAAS,GAG1B,EAAI,KAAK,EAAQ,OAFjB,MAAM,IAAI,WAAU,+CAItB,GAAO,EAAI,OAEb,MAAO,IAGT,YAAqB,EAAQ,EAAU,CACrC,GAAI,GAAO,SAAS,GAClB,MAAO,GAAO,OAEhB,GAAI,YAAY,OAAO,IAAW,GAAW,EAAQ,aACnD,MAAO,GAAO,WAEhB,GAAI,MAAO,IAAW,SACpB,KAAM,IAAI,WACR,2FACmB,MAAO,IAI9B,GAAM,GAAM,EAAO,OACb,EAAa,UAAU,OAAS,GAAK,UAAU,KAAO,GAC5D,GAAI,CAAC,GAAa,IAAQ,EAAG,MAAO,GAGpC,GAAI,GAAc,GAClB,OACE,OAAQ,OACD,YACA,aACA,SACH,MAAO,OACJ,WACA,QACH,MAAO,IAAY,GAAQ,WACxB,WACA,YACA,cACA,WACH,MAAO,GAAM,MACV,MACH,MAAO,KAAQ,MACZ,SACH,MAAO,IAAc,GAAQ,eAE7B,GAAI,EACF,MAAO,GAAY,GAAK,GAAY,GAAQ,OAE9C,EAAY,IAAK,GAAU,cAC3B,EAAc,IAItB,GAAO,WAAa,GAEpB,YAAuB,EAAU,EAAO,EAAK,CAC3C,GAAI,GAAc,GA8BlB,GArBI,KAAU,QAAa,EAAQ,IACjC,GAAQ,GAIN,EAAQ,KAAK,QAIb,MAAQ,QAAa,EAAM,KAAK,SAClC,GAAM,KAAK,QAGT,GAAO,IAKX,MAAS,EACT,KAAW,EAEP,GAAO,GACT,MAAO,GAKT,IAFK,GAAU,GAAW,UAGxB,OAAQ,OACD,MACH,MAAO,IAAS,KAAM,EAAO,OAE1B,WACA,QACH,MAAO,IAAU,KAAM,EAAO,OAE3B,QACH,MAAO,IAAW,KAAM,EAAO,OAE5B,aACA,SACH,MAAO,IAAY,KAAM,EAAO,OAE7B,SACH,MAAO,IAAY,KAAM,EAAO,OAE7B,WACA,YACA,cACA,WACH,MAAO,IAAa,KAAM,EAAO,WAGjC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAuB,GAC5D,EAAY,GAAW,IAAI,cAC3B,EAAc,IAWtB,GAAO,UAAU,UAAY,GAE7B,YAAe,EAAG,EAAG,EAAG,CACtB,GAAM,GAAI,EAAE,GACZ,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EAGT,GAAO,UAAU,OAAS,UAAmB,CAC3C,GAAM,GAAM,KAAK,OACjB,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAEpB,MAAO,OAGT,GAAO,UAAU,OAAS,UAAmB,CAC3C,GAAM,GAAM,KAAK,OACjB,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAClB,GAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,OAGT,GAAO,UAAU,OAAS,UAAmB,CAC3C,GAAM,GAAM,KAAK,OACjB,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAClB,GAAK,KAAM,EAAI,EAAG,EAAI,GACtB,GAAK,KAAM,EAAI,EAAG,EAAI,GACtB,GAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,OAGT,GAAO,UAAU,SAAW,UAAqB,CAC/C,GAAM,GAAS,KAAK,OACpB,MAAI,KAAW,EAAU,GACrB,UAAU,SAAW,EAAU,GAAU,KAAM,EAAG,GAC/C,GAAa,MAAM,KAAM,YAGlC,GAAO,UAAU,eAAiB,GAAO,UAAU,SAEnD,GAAO,UAAU,OAAS,SAAiB,EAAG,CAC5C,GAAI,CAAC,GAAO,SAAS,GAAI,KAAM,IAAI,WAAU,6BAC7C,MAAI,QAAS,EAAU,GAChB,GAAO,QAAQ,KAAM,KAAO,GAGrC,GAAO,UAAU,QAAU,UAAoB,CAC7C,GAAI,GAAM,GACJ,EAAM,GAAQ,kBACpB,SAAM,KAAK,SAAS,MAAO,EAAG,GAAK,QAAQ,UAAW,OAAO,OACzD,KAAK,OAAS,GAAK,IAAO,SACvB,WAAa,EAAM,KAE5B,AAAI,IACF,IAAO,UAAU,IAAuB,GAAO,UAAU,SAG3D,GAAO,UAAU,QAAU,SAAkB,EAAQ,EAAO,EAAK,EAAW,EAAS,CAInF,GAHI,GAAW,EAAQ,aACrB,GAAS,GAAO,KAAK,EAAQ,EAAO,OAAQ,EAAO,aAEjD,CAAC,GAAO,SAAS,GACnB,KAAM,IAAI,WACR,iFACoB,MAAO,IAiB/B,GAbI,IAAU,QACZ,GAAQ,GAEN,IAAQ,QACV,GAAM,EAAS,EAAO,OAAS,GAE7B,IAAc,QAChB,GAAY,GAEV,IAAY,QACd,GAAU,KAAK,QAGb,EAAQ,GAAK,EAAM,EAAO,QAAU,EAAY,GAAK,EAAU,KAAK,OACtE,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAa,GAAW,GAAS,EACnC,MAAO,GAET,GAAI,GAAa,EACf,MAAO,GAET,GAAI,GAAS,EACX,MAAO,GAQT,GALA,KAAW,EACX,KAAS,EACT,KAAe,EACf,KAAa,EAET,OAAS,EAAQ,MAAO,GAE5B,GAAI,GAAI,EAAU,EACd,EAAI,EAAM,EACR,EAAM,KAAK,IAAI,EAAG,GAElB,EAAW,KAAK,MAAM,EAAW,GACjC,EAAa,EAAO,MAAM,EAAO,GAEvC,OAAS,GAAI,EAAG,EAAI,EAAK,EAAE,EACzB,GAAI,EAAS,KAAO,EAAW,GAAI,CACjC,EAAI,EAAS,GACb,EAAI,EAAW,GACf,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,GAYT,YAA+B,EAAQ,EAAK,EAAY,EAAU,EAAK,CAErE,GAAI,EAAO,SAAW,EAAG,MAAO,GAmBhC,GAhBA,AAAI,MAAO,IAAe,SACxB,GAAW,EACX,EAAa,GACR,AAAI,EAAa,WACtB,EAAa,WACJ,EAAa,aACtB,GAAa,aAEf,EAAa,CAAC,EACV,GAAY,IAEd,GAAa,EAAM,EAAK,EAAO,OAAS,GAItC,EAAa,GAAG,GAAa,EAAO,OAAS,GAC7C,GAAc,EAAO,OAAQ,CAC/B,GAAI,EAAK,MAAO,GACX,EAAa,EAAO,OAAS,UACzB,EAAa,EACtB,GAAI,EAAK,EAAa,MACjB,OAAO,GASd,GALI,MAAO,IAAQ,UACjB,GAAM,GAAO,KAAK,EAAK,IAIrB,GAAO,SAAS,GAElB,MAAI,GAAI,SAAW,EACV,GAEF,GAAa,EAAQ,EAAK,EAAY,EAAU,GAClD,GAAI,MAAO,IAAQ,SAExB,MADA,GAAM,EAAM,IACR,MAAO,YAAW,UAAU,SAAY,WACtC,EACK,WAAW,UAAU,QAAQ,KAAK,EAAQ,EAAK,GAE/C,WAAW,UAAU,YAAY,KAAK,EAAQ,EAAK,GAGvD,GAAa,EAAQ,CAAC,GAAM,EAAY,EAAU,GAG3D,KAAM,IAAI,WAAU,wCAGtB,YAAuB,EAAK,EAAK,EAAY,EAAU,EAAK,CAC1D,GAAI,GAAY,EACZ,EAAY,EAAI,OAChB,EAAY,EAAI,OAEpB,GAAI,IAAa,QACf,GAAW,OAAO,GAAU,cACxB,IAAa,QAAU,IAAa,SACpC,IAAa,WAAa,IAAa,YAAY,CACrD,GAAI,EAAI,OAAS,GAAK,EAAI,OAAS,EACjC,MAAO,GAET,EAAY,EACZ,GAAa,EACb,GAAa,EACb,GAAc,EAIlB,WAAe,EAAK,EAAG,CACrB,MAAI,KAAc,EACT,EAAI,GAEJ,EAAI,aAAa,EAAI,GAIhC,GAAI,GACJ,GAAI,EAAK,CACP,GAAI,GAAa,GACjB,IAAK,EAAI,EAAY,EAAI,EAAW,IAClC,GAAI,EAAK,EAAK,KAAO,EAAK,EAAK,IAAe,GAAK,EAAI,EAAI,IAEzD,GADI,IAAe,IAAI,GAAa,GAChC,EAAI,EAAa,IAAM,EAAW,MAAO,GAAa,MAE1D,AAAI,KAAe,IAAI,IAAK,EAAI,GAChC,EAAa,OAKjB,KADI,EAAa,EAAY,GAAW,GAAa,EAAY,GAC5D,EAAI,EAAY,GAAK,EAAG,IAAK,CAChC,GAAI,GAAQ,GACZ,OAAS,GAAI,EAAG,EAAI,EAAW,IAC7B,GAAI,EAAK,EAAK,EAAI,KAAO,EAAK,EAAK,GAAI,CACrC,EAAQ,GACR,MAGJ,GAAI,EAAO,MAAO,GAItB,MAAO,GAGT,GAAO,UAAU,SAAW,SAAmB,EAAK,EAAY,EAAU,CACxE,MAAO,MAAK,QAAQ,EAAK,EAAY,KAAc,IAGrD,GAAO,UAAU,QAAU,SAAkB,EAAK,EAAY,EAAU,CACtE,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,KAG/D,GAAO,UAAU,YAAc,SAAsB,EAAK,EAAY,EAAU,CAC9E,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,KAG/D,YAAmB,EAAK,EAAQ,EAAQ,EAAQ,CAC9C,EAAS,OAAO,IAAW,EAC3B,GAAM,GAAY,EAAI,OAAS,EAC/B,AAAK,EAGH,GAAS,OAAO,GACZ,EAAS,GACX,GAAS,IAJX,EAAS,EAQX,GAAM,GAAS,EAAO,OAEtB,AAAI,EAAS,EAAS,GACpB,GAAS,EAAS,GAEpB,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAC3B,GAAM,GAAS,SAAS,EAAO,OAAO,EAAI,EAAG,GAAI,IACjD,GAAI,GAAY,GAAS,MAAO,GAChC,EAAI,EAAS,GAAK,EAEpB,MAAO,GAGT,YAAoB,EAAK,EAAQ,EAAQ,EAAQ,CAC/C,MAAO,IAAW,GAAY,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG3E,YAAqB,EAAK,EAAQ,EAAQ,EAAQ,CAChD,MAAO,IAAW,GAAa,GAAS,EAAK,EAAQ,GAGvD,YAAsB,EAAK,EAAQ,EAAQ,EAAQ,CACjD,MAAO,IAAW,GAAc,GAAS,EAAK,EAAQ,GAGxD,YAAoB,EAAK,EAAQ,EAAQ,EAAQ,CAC/C,MAAO,IAAW,GAAe,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG9E,GAAO,UAAU,MAAQ,SAAgB,EAAQ,EAAQ,EAAQ,EAAU,CAEzE,GAAI,IAAW,OACb,EAAW,OACX,EAAS,KAAK,OACd,EAAS,UAEA,IAAW,QAAa,MAAO,IAAW,SACnD,EAAW,EACX,EAAS,KAAK,OACd,EAAS,UAEA,SAAS,GAClB,EAAS,IAAW,EACpB,AAAI,SAAS,GACX,GAAS,IAAW,EAChB,IAAa,QAAW,GAAW,SAEvC,GAAW,EACX,EAAS,YAGX,MAAM,IAAI,OACR,2EAIJ,GAAM,GAAY,KAAK,OAAS,EAGhC,GAFI,KAAW,QAAa,EAAS,IAAW,GAAS,GAEpD,EAAO,OAAS,GAAM,GAAS,GAAK,EAAS,IAAO,EAAS,KAAK,OACrE,KAAM,IAAI,YAAW,0CAGvB,AAAK,GAAU,GAAW,QAE1B,GAAI,GAAc,GAClB,OACE,OAAQ,OACD,MACH,MAAO,IAAS,KAAM,EAAQ,EAAQ,OAEnC,WACA,QACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,OAEpC,YACA,aACA,SACH,MAAO,IAAW,KAAM,EAAQ,EAAQ,OAErC,SAEH,MAAO,IAAY,KAAM,EAAQ,EAAQ,OAEtC,WACA,YACA,cACA,WACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,WAGvC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAuB,GAC5D,EAAY,IAAK,GAAU,cAC3B,EAAc,KAKtB,GAAO,UAAU,OAAS,UAAmB,CAC3C,MAAO,CACL,KAAM,SACN,KAAM,MAAM,UAAU,MAAM,KAAK,KAAK,MAAQ,KAAM,KAIxD,YAAsB,EAAK,EAAO,EAAK,CACrC,MAAI,KAAU,GAAK,IAAQ,EAAI,OACtB,GAAO,cAAc,GAErB,GAAO,cAAc,EAAI,MAAM,EAAO,IAIjD,YAAoB,EAAK,EAAO,EAAK,CACnC,EAAM,KAAK,IAAI,EAAI,OAAQ,GAC3B,GAAM,GAAM,GAER,EAAI,EACR,KAAO,EAAI,GAAK,CACd,GAAM,GAAY,EAAI,GAClB,EAAY,KACZ,EAAoB,EAAY,IAChC,EACC,EAAY,IACT,EACC,EAAY,IACT,EACA,EAEZ,GAAI,EAAI,GAAoB,EAAK,CAC/B,GAAI,GAAY,EAAW,EAAY,EAEvC,OAAQ,OACD,GACH,AAAI,EAAY,KACd,GAAY,GAEd,UACG,GACH,EAAa,EAAI,EAAI,GAChB,GAAa,MAAU,KAC1B,GAAiB,GAAY,KAAS,EAAO,EAAa,GACtD,EAAgB,KAClB,GAAY,IAGhB,UACG,GACH,EAAa,EAAI,EAAI,GACrB,EAAY,EAAI,EAAI,GACf,GAAa,MAAU,KAAS,GAAY,MAAU,KACzD,GAAiB,GAAY,KAAQ,GAAO,GAAa,KAAS,EAAO,EAAY,GACjF,EAAgB,MAAU,GAAgB,OAAU,EAAgB,QACtE,GAAY,IAGhB,UACG,GACH,EAAa,EAAI,EAAI,GACrB,EAAY,EAAI,EAAI,GACpB,EAAa,EAAI,EAAI,GAChB,GAAa,MAAU,KAAS,GAAY,MAAU,KAAS,GAAa,MAAU,KACzF,GAAiB,GAAY,KAAQ,GAAQ,GAAa,KAAS,GAAO,GAAY,KAAS,EAAO,EAAa,GAC/G,EAAgB,OAAU,EAAgB,SAC5C,GAAY,KAMtB,AAAI,IAAc,KAGhB,GAAY,MACZ,EAAmB,GACV,EAAY,OAErB,IAAa,MACb,EAAI,KAAK,IAAc,GAAK,KAAQ,OACpC,EAAY,MAAS,EAAY,MAGnC,EAAI,KAAK,GACT,GAAK,EAGP,MAAO,IAAsB,GAM/B,GAAM,IAAuB,KAE7B,YAAgC,EAAY,CAC1C,GAAM,GAAM,EAAW,OACvB,GAAI,GAAO,GACT,MAAO,QAAO,aAAa,MAAM,OAAQ,GAI3C,GAAI,GAAM,GACN,EAAI,EACR,KAAO,EAAI,GACT,GAAO,OAAO,aAAa,MACzB,OACA,EAAW,MAAM,EAAG,GAAK,KAG7B,MAAO,GAGT,YAAqB,EAAK,EAAO,EAAK,CACpC,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,GAAK,KAEtC,MAAO,GAGT,YAAsB,EAAK,EAAO,EAAK,CACrC,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,IAEjC,MAAO,GAGT,YAAmB,EAAK,EAAO,EAAK,CAClC,GAAM,GAAM,EAAI,OAEhB,AAAI,EAAC,GAAS,EAAQ,IAAG,GAAQ,GAC7B,EAAC,GAAO,EAAM,GAAK,EAAM,IAAK,GAAM,GAExC,GAAI,GAAM,GACV,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,GAAoB,EAAI,IAEjC,MAAO,GAGT,YAAuB,EAAK,EAAO,EAAK,CACtC,GAAM,GAAQ,EAAI,MAAM,EAAO,GAC3B,EAAM,GAEV,OAAS,GAAI,EAAG,EAAI,EAAM,OAAS,EAAG,GAAK,EACzC,GAAO,OAAO,aAAa,EAAM,GAAM,EAAM,EAAI,GAAK,KAExD,MAAO,GAGT,GAAO,UAAU,MAAQ,SAAgB,EAAO,EAAK,CACnD,GAAM,GAAM,KAAK,OACjB,EAAQ,CAAC,CAAC,EACV,EAAM,IAAQ,OAAY,EAAM,CAAC,CAAC,EAElC,AAAI,EAAQ,EACV,IAAS,EACL,EAAQ,GAAG,GAAQ,IACd,EAAQ,GACjB,GAAQ,GAGV,AAAI,EAAM,EACR,IAAO,EACH,EAAM,GAAG,GAAM,IACV,EAAM,GACf,GAAM,GAGJ,EAAM,GAAO,GAAM,GAEvB,GAAM,GAAS,KAAK,SAAS,EAAO,GAEpC,cAAO,eAAe,EAAQ,GAAO,WAE9B,GAMT,YAAsB,EAAQ,EAAK,EAAQ,CACzC,GAAK,EAAS,GAAO,GAAK,EAAS,EAAG,KAAM,IAAI,YAAW,sBAC3D,GAAI,EAAS,EAAM,EAAQ,KAAM,IAAI,YAAW,yCAGlD,GAAO,UAAU,WACjB,GAAO,UAAU,WAAa,SAAqB,EAAQ,EAAY,EAAU,CAC/E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAEpD,GAAI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACR,KAAO,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAG5B,MAAO,IAGT,GAAO,UAAU,WACjB,GAAO,UAAU,WAAa,SAAqB,EAAQ,EAAY,EAAU,CAC/E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GACH,GAAY,EAAQ,EAAY,KAAK,QAGvC,GAAI,GAAM,KAAK,EAAS,EAAE,GACtB,EAAM,EACV,KAAO,EAAa,GAAM,IAAO,MAC/B,GAAO,KAAK,EAAS,EAAE,GAAc,EAGvC,MAAO,IAGT,GAAO,UAAU,UACjB,GAAO,UAAU,UAAY,SAAoB,EAAQ,EAAU,CACjE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,IAGd,GAAO,UAAU,aACjB,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,GAAW,KAAK,EAAS,IAAM,GAG7C,GAAO,UAAU,aACjB,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACnC,KAAK,IAAW,EAAK,KAAK,EAAS,IAG7C,GAAO,UAAU,aACjB,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAElC,MAAK,GACT,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAAM,IACpB,KAAK,EAAS,GAAK,UAG1B,GAAO,UAAU,aACjB,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,GAAU,SACnB,MAAK,EAAS,IAAM,GACrB,KAAK,EAAS,IAAM,EACrB,KAAK,EAAS,KAGlB,GAAO,UAAU,gBAAkB,GAAmB,SAA0B,EAAQ,CACtF,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GAAK,EACT,KAAK,EAAE,GAAU,GAAK,EACtB,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,GAElB,EAAK,KAAK,EAAE,GAChB,KAAK,EAAE,GAAU,GAAK,EACtB,KAAK,EAAE,GAAU,GAAK,GACtB,EAAO,GAAK,GAEd,MAAO,QAAO,GAAO,QAAO,IAAO,OAAO,OAG5C,GAAO,UAAU,gBAAkB,GAAmB,SAA0B,EAAQ,CACtF,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GAAK,EAAQ,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,EACtB,KAAK,EAAE,GAEH,EAAK,KAAK,EAAE,GAAU,GAAK,GAC/B,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,EACtB,EAEF,MAAQ,QAAO,IAAO,OAAO,KAAO,OAAO,KAG7C,GAAO,UAAU,UAAY,SAAoB,EAAQ,EAAY,EAAU,CAC7E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAEpD,GAAI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACR,KAAO,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAE5B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,GAGT,GAAO,UAAU,UAAY,SAAoB,EAAQ,EAAY,EAAU,CAC7E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAEpD,GAAI,GAAI,EACJ,EAAM,EACN,EAAM,KAAK,EAAS,EAAE,GAC1B,KAAO,EAAI,GAAM,IAAO,MACtB,GAAO,KAAK,EAAS,EAAE,GAAK,EAE9B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,GAGT,GAAO,UAAU,SAAW,SAAmB,EAAQ,EAAU,CAG/D,MAFA,GAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACvC,AAAE,KAAK,GAAU,IACZ,KAAO,KAAK,GAAU,GAAK,GADA,KAAK,IAI3C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,EAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAM,GAAM,KAAK,GAAW,KAAK,EAAS,IAAM,EAChD,MAAQ,GAAM,MAAU,EAAM,WAAa,GAG7C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,EAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAM,GAAM,KAAK,EAAS,GAAM,KAAK,IAAW,EAChD,MAAQ,GAAM,MAAU,EAAM,WAAa,GAG7C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,GACV,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAAM,GACpB,KAAK,EAAS,IAAM,IAGzB,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,IAAW,GACrB,KAAK,EAAS,IAAM,GACpB,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAGnB,GAAO,UAAU,eAAiB,GAAmB,SAAyB,EAAQ,CACpF,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GAAM,KAAK,EAAS,GACxB,KAAK,EAAS,GAAK,GAAK,EACxB,KAAK,EAAS,GAAK,GAAK,GACvB,IAAQ,IAEX,MAAQ,QAAO,IAAQ,OAAO,KAC5B,OAAO,EACP,KAAK,EAAE,GAAU,GAAK,EACtB,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,MAG1B,GAAO,UAAU,eAAiB,GAAmB,SAAyB,EAAQ,CACpF,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GAAO,IAAS,IACpB,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,EACtB,KAAK,EAAE,GAET,MAAQ,QAAO,IAAQ,OAAO,KAC5B,OAAO,KAAK,EAAE,GAAU,GAAK,GAC7B,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,EACtB,KAGJ,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAM,GAAI,IAG9C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAO,GAAI,IAG/C,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAM,GAAI,IAG9C,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAO,GAAI,IAG/C,YAAmB,EAAK,EAAO,EAAQ,EAAK,EAAK,EAAK,CACpD,GAAI,CAAC,GAAO,SAAS,GAAM,KAAM,IAAI,WAAU,+CAC/C,GAAI,EAAQ,GAAO,EAAQ,EAAK,KAAM,IAAI,YAAW,qCACrD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBAGtD,GAAO,UAAU,YACjB,GAAO,UAAU,YAAc,SAAsB,EAAO,EAAQ,EAAY,EAAU,CAIxF,GAHA,EAAQ,CAAC,EACT,EAAS,IAAW,EACpB,EAAa,IAAe,EACxB,CAAC,EAAU,CACb,GAAM,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC/C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAM,EACN,EAAI,EAER,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,IAAO,MACjC,KAAK,EAAS,GAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,GAGlB,GAAO,UAAU,YACjB,GAAO,UAAU,YAAc,SAAsB,EAAO,EAAQ,EAAY,EAAU,CAIxF,GAHA,EAAQ,CAAC,EACT,EAAS,IAAW,EACpB,EAAa,IAAe,EACxB,CAAC,EAAU,CACb,GAAM,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC/C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAI,EAAa,EACjB,EAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,IAAO,MACzB,KAAK,EAAS,GAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,GAGlB,GAAO,UAAU,WACjB,GAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAU,CAC1E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,GACtD,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,GAAO,UAAU,cACjB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,KAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EACvB,EAAS,GAGlB,GAAO,UAAU,cACjB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,KAAK,GAAW,IAAU,EAC1B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,GAAO,UAAU,cACjB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,GAAO,UAAU,cACjB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,KAAK,GAAW,IAAU,GAC1B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,YAAyB,EAAK,EAAO,EAAQ,EAAK,EAAK,CACrD,GAAW,EAAO,EAAK,EAAK,EAAK,EAAQ,GAEzC,GAAI,GAAK,OAAO,EAAQ,OAAO,aAC/B,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,GAAI,GAAK,OAAO,GAAS,OAAO,IAAM,OAAO,aAC7C,SAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EACT,EAGT,YAAyB,EAAK,EAAO,EAAQ,EAAK,EAAK,CACrD,GAAW,EAAO,EAAK,EAAK,EAAK,EAAQ,GAEzC,GAAI,GAAK,OAAO,EAAQ,OAAO,aAC/B,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,GAAI,GAAK,OAAO,GAAS,OAAO,IAAM,OAAO,aAC7C,SAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,GAAU,EACP,EAAS,EAGlB,GAAO,UAAU,iBAAmB,GAAmB,SAA2B,EAAO,EAAS,EAAG,CACnG,MAAO,IAAe,KAAM,EAAO,EAAQ,OAAO,GAAI,OAAO,yBAG/D,GAAO,UAAU,iBAAmB,GAAmB,SAA2B,EAAO,EAAS,EAAG,CACnG,MAAO,IAAe,KAAM,EAAO,EAAQ,OAAO,GAAI,OAAO,yBAG/D,GAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAY,EAAU,CAGtF,GAFA,EAAQ,CAAC,EACT,EAAS,IAAW,EAChB,CAAC,EAAU,CACb,GAAM,GAAQ,KAAK,IAAI,EAAI,EAAI,EAAc,GAE7C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EACJ,EAAM,EACN,EAAM,EAEV,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,IAAO,MACjC,AAAI,EAAQ,GAAK,IAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,GAAM,GAER,KAAK,EAAS,GAAO,GAAQ,GAAQ,GAAK,EAAM,IAGlD,MAAO,GAAS,GAGlB,GAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAY,EAAU,CAGtF,GAFA,EAAQ,CAAC,EACT,EAAS,IAAW,EAChB,CAAC,EAAU,CACb,GAAM,GAAQ,KAAK,IAAI,EAAI,EAAI,EAAc,GAE7C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EAAa,EACjB,EAAM,EACN,EAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,IAAO,MACzB,AAAI,EAAQ,GAAK,IAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,GAAM,GAER,KAAK,EAAS,GAAO,GAAQ,GAAQ,GAAK,EAAM,IAGlD,MAAO,GAAS,GAGlB,GAAO,UAAU,UAAY,SAAoB,EAAO,EAAQ,EAAU,CACxE,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,MAClD,EAAQ,GAAG,GAAQ,IAAO,EAAQ,GACtC,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,KAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EACvB,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,KAAK,GAAW,IAAU,EAC1B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aAC5D,KAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,GACvB,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aACxD,EAAQ,GAAG,GAAQ,WAAa,EAAQ,GAC5C,KAAK,GAAW,IAAU,GAC1B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,GAAO,UAAU,gBAAkB,GAAmB,SAA0B,EAAO,EAAS,EAAG,CACjG,MAAO,IAAe,KAAM,EAAO,EAAQ,CAAC,OAAO,sBAAuB,OAAO,yBAGnF,GAAO,UAAU,gBAAkB,GAAmB,SAA0B,EAAO,EAAS,EAAG,CACjG,MAAO,IAAe,KAAM,EAAO,EAAQ,CAAC,OAAO,sBAAuB,OAAO,yBAGnF,YAAuB,EAAK,EAAO,EAAQ,EAAK,EAAK,EAAK,CACxD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBACpD,GAAI,EAAS,EAAG,KAAM,IAAI,YAAW,sBAGvC,YAAqB,EAAK,EAAO,EAAQ,EAAc,EAAU,CAC/D,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GACH,GAAa,EAAK,EAAO,EAAQ,EAAG,qBAAwB,uBAE9D,GAAQ,MAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GAC7C,EAAS,EAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAM,IAG/C,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAO,IAGhD,YAAsB,EAAK,EAAO,EAAQ,EAAc,EAAU,CAChE,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GACH,GAAa,EAAK,EAAO,EAAQ,EAAG,sBAAyB,wBAE/D,GAAQ,MAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GAC7C,EAAS,EAGlB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAM,IAGhD,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAO,IAIjD,GAAO,UAAU,KAAO,SAAe,EAAQ,EAAa,EAAO,EAAK,CACtE,GAAI,CAAC,GAAO,SAAS,GAAS,KAAM,IAAI,WAAU,+BASlD,GARK,GAAO,GAAQ,GAChB,CAAC,GAAO,IAAQ,GAAG,GAAM,KAAK,QAC9B,GAAe,EAAO,QAAQ,GAAc,EAAO,QAClD,GAAa,GAAc,GAC5B,EAAM,GAAK,EAAM,GAAO,GAAM,GAG9B,IAAQ,GACR,EAAO,SAAW,GAAK,KAAK,SAAW,EAAG,MAAO,GAGrD,GAAI,EAAc,EAChB,KAAM,IAAI,YAAW,6BAEvB,GAAI,EAAQ,GAAK,GAAS,KAAK,OAAQ,KAAM,IAAI,YAAW,sBAC5D,GAAI,EAAM,EAAG,KAAM,IAAI,YAAW,2BAGlC,AAAI,EAAM,KAAK,QAAQ,GAAM,KAAK,QAC9B,EAAO,OAAS,EAAc,EAAM,GACtC,GAAM,EAAO,OAAS,EAAc,GAGtC,GAAM,GAAM,EAAM,EAElB,MAAI,QAAS,GAAU,MAAO,YAAW,UAAU,YAAe,WAEhE,KAAK,WAAW,EAAa,EAAO,GAEpC,WAAW,UAAU,IAAI,KACvB,EACA,KAAK,SAAS,EAAO,GACrB,GAIG,GAOT,GAAO,UAAU,KAAO,SAAe,EAAK,EAAO,EAAK,EAAU,CAEhE,GAAI,MAAO,IAAQ,SAAU,CAS3B,GARA,AAAI,MAAO,IAAU,SACnB,GAAW,EACX,EAAQ,EACR,EAAM,KAAK,QACF,MAAO,IAAQ,UACxB,GAAW,EACX,EAAM,KAAK,QAET,IAAa,QAAa,MAAO,IAAa,SAChD,KAAM,IAAI,WAAU,6BAEtB,GAAI,MAAO,IAAa,UAAY,CAAC,GAAO,WAAW,GACrD,KAAM,IAAI,WAAU,qBAAuB,GAE7C,GAAI,EAAI,SAAW,EAAG,CACpB,GAAM,GAAO,EAAI,WAAW,GAC5B,AAAK,KAAa,QAAU,EAAO,KAC/B,IAAa,WAEf,GAAM,QAGL,AAAI,OAAO,IAAQ,SACxB,EAAM,EAAM,IACH,MAAO,IAAQ,WACxB,GAAM,OAAO,IAIf,GAAI,EAAQ,GAAK,KAAK,OAAS,GAAS,KAAK,OAAS,EACpD,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAO,EACT,MAAO,MAGT,EAAQ,IAAU,EAClB,EAAM,IAAQ,OAAY,KAAK,OAAS,IAAQ,EAE3C,GAAK,GAAM,GAEhB,GAAI,GACJ,GAAI,MAAO,IAAQ,SACjB,IAAK,EAAI,EAAO,EAAI,EAAK,EAAE,EACzB,KAAK,GAAK,MAEP,CACL,GAAM,GAAQ,GAAO,SAAS,GAC1B,EACA,GAAO,KAAK,EAAK,GACf,EAAM,EAAM,OAClB,GAAI,IAAQ,EACV,KAAM,IAAI,WAAU,cAAgB,EAClC,qCAEJ,IAAK,EAAI,EAAG,EAAI,EAAM,EAAO,EAAE,EAC7B,KAAK,EAAI,GAAS,EAAM,EAAI,GAIhC,MAAO,OAOT,GAAM,IAAS,GACf,YAAY,EAAK,EAAY,EAAM,CACjC,GAAO,GAAO,aAAwB,EAAK,CACzC,aAAe,CACb,QAEA,OAAO,eAAe,KAAM,UAAW,CACrC,MAAO,EAAW,MAAM,KAAM,WAC9B,SAAU,GACV,aAAc,KAIhB,KAAK,KAAO,GAAG,KAAK,SAAS,KAG7B,KAAK,MAEL,MAAO,MAAK,QAGV,OAAQ,CACV,MAAO,MAGL,MAAM,EAAO,CACf,OAAO,eAAe,KAAM,OAAQ,CAClC,aAAc,GACd,WAAY,GACZ,QACA,SAAU,KAId,UAAY,CACV,MAAO,GAAG,KAAK,SAAS,OAAS,KAAK,YAK5C,GAAE,2BACA,SAAU,EAAM,CACd,MAAI,GACK,GAAG,gCAGL,kDACN,YACL,GAAE,uBACA,SAAU,EAAM,EAAQ,CACtB,MAAO,QAAQ,qDAAwD,MAAO,MAC7E,WACL,GAAE,mBACA,SAAU,EAAK,EAAO,EAAO,CAC3B,GAAI,GAAM,iBAAiB,sBACvB,EAAW,EACf,MAAI,QAAO,UAAU,IAAU,KAAK,IAAI,GAAS,GAAK,GACpD,EAAW,GAAsB,OAAO,IAC/B,MAAO,IAAU,UAC1B,GAAW,OAAO,GACd,GAAQ,OAAO,IAAM,OAAO,KAAO,EAAQ,CAAE,QAAO,IAAM,OAAO,OACnE,GAAW,GAAsB,IAEnC,GAAY,KAEd,GAAO,eAAe,eAAmB,IAClC,GACN,YAEL,YAAgC,EAAK,CACnC,GAAI,GAAM,GACN,EAAI,EAAI,OACN,EAAQ,EAAI,KAAO,IAAM,EAAI,EACnC,KAAO,GAAK,EAAQ,EAAG,GAAK,EAC1B,EAAM,IAAI,EAAI,MAAM,EAAI,EAAG,KAAK,IAElC,MAAO,GAAG,EAAI,MAAM,EAAG,KAAK,IAM9B,YAAsB,EAAK,EAAQ,EAAY,CAC7C,GAAe,EAAQ,UACnB,GAAI,KAAY,QAAa,EAAI,EAAS,KAAgB,SAC5D,GAAY,EAAQ,EAAI,OAAU,GAAa,IAInD,YAAqB,EAAO,EAAK,EAAK,EAAK,EAAQ,EAAY,CAC7D,GAAI,EAAQ,GAAO,EAAQ,EAAK,CAC9B,GAAM,GAAI,MAAO,IAAQ,SAAW,IAAM,GACtC,EACJ,KAAI,GAAa,EACf,AAAI,IAAQ,GAAK,IAAQ,OAAO,GAC9B,EAAQ,OAAO,YAAY,QAAS,GAAa,GAAK,IAAI,IAE1D,EAAQ,SAAS,QAAS,GAAa,GAAK,EAAI,IAAI,iBACxC,GAAa,GAAK,EAAI,IAAI,IAGxC,EAAQ,MAAM,IAAM,YAAY,IAAM,IAElC,GAAI,IAAO,iBAAiB,QAAS,EAAO,GAEpD,GAAY,EAAK,EAAQ,GAG3B,YAAyB,EAAO,EAAM,CACpC,GAAI,MAAO,IAAU,SACnB,KAAM,IAAI,IAAO,qBAAqB,EAAM,SAAU,GAI1D,YAAsB,EAAO,EAAQ,EAAM,CACzC,KAAI,MAAK,MAAM,KAAW,EACxB,IAAe,EAAO,GAChB,GAAI,IAAO,iBAAiB,GAAQ,SAAU,aAAc,IAGhE,EAAS,EACL,GAAI,IAAO,yBAGb,GAAI,IAAO,iBAAiB,GAAQ,SACR,MAAM,EAAO,EAAI,YAAY,IAC7B,GAMpC,GAAM,IAAoB,oBAE1B,YAAsB,EAAK,CAMzB,GAJA,EAAM,EAAI,MAAM,KAAK,GAErB,EAAM,EAAI,OAAO,QAAQ,GAAmB,IAExC,EAAI,OAAS,EAAG,MAAO,GAE3B,KAAO,EAAI,OAAS,GAAM,GACxB,EAAM,EAAM,IAEd,MAAO,GAGT,YAAsB,EAAQ,EAAO,CACnC,EAAQ,GAAS,SACjB,GAAI,GACE,EAAS,EAAO,OAClB,EAAgB,KACd,EAAQ,GAEd,OAAS,GAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAI/B,GAHA,EAAY,EAAO,WAAW,GAG1B,EAAY,OAAU,EAAY,MAAQ,CAE5C,GAAI,CAAC,EAAe,CAElB,GAAI,EAAY,MAAQ,CAEtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,iBACS,EAAI,IAAM,EAAQ,CAE3B,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,SAIF,EAAgB,EAEhB,SAIF,GAAI,EAAY,MAAQ,CACtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,EAAgB,EAChB,SAIF,EAAa,GAAgB,OAAU,GAAK,EAAY,OAAU,UAC7D,AAAI,IAEJ,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAMhD,GAHA,EAAgB,KAGZ,EAAY,IAAM,CACpB,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KAAK,WACF,EAAY,KAAO,CAC5B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,EAAM,IACnB,EAAY,GAAO,aAEZ,EAAY,MAAS,CAC9B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,GAAM,IACnB,GAAa,EAAM,GAAO,IAC1B,EAAY,GAAO,aAEZ,EAAY,QAAU,CAC/B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,GAAO,IACpB,GAAa,GAAM,GAAO,IAC1B,GAAa,EAAM,GAAO,IAC1B,EAAY,GAAO,SAGrB,MAAM,IAAI,OAAM,sBAIpB,MAAO,GAGT,YAAuB,EAAK,CAC1B,GAAM,GAAY,GAClB,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,EAAE,EAEhC,EAAU,KAAK,EAAI,WAAW,GAAK,KAErC,MAAO,GAGT,YAAyB,EAAK,EAAO,CACnC,GAAI,GAAG,EAAI,EACL,EAAY,GAClB,OAAS,GAAI,EAAG,EAAI,EAAI,QACjB,MAAS,GAAK,GADW,EAAE,EAGhC,EAAI,EAAI,WAAW,GACnB,EAAK,GAAK,EACV,EAAK,EAAI,IACT,EAAU,KAAK,GACf,EAAU,KAAK,GAGjB,MAAO,GAGT,YAAwB,EAAK,CAC3B,MAAO,IAAO,YAAY,GAAY,IAGxC,YAAqB,EAAK,EAAK,EAAQ,EAAQ,CAC7C,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,GACT,IAAI,GAAU,EAAI,QAAY,GAAK,EAAI,QADtB,EAAE,EAExB,EAAI,EAAI,GAAU,EAAI,GAExB,MAAO,GAMT,YAAqB,EAAK,EAAM,CAC9B,MAAO,aAAe,IACnB,GAAO,MAAQ,EAAI,aAAe,MAAQ,EAAI,YAAY,MAAQ,MACjE,EAAI,YAAY,OAAS,EAAK,KAEpC,YAAsB,EAAK,CAEzB,MAAO,KAAQ,EAKjB,GAAM,IAAuB,UAAY,CACvC,GAAM,GAAW,mBACX,EAAQ,GAAI,OAAM,KACxB,OAAS,GAAI,EAAG,EAAI,GAAI,EAAE,EAAG,CAC3B,GAAM,GAAM,EAAI,GAChB,OAAS,GAAI,EAAG,EAAI,GAAI,EAAE,EACxB,EAAM,EAAM,GAAK,EAAS,GAAK,EAAS,GAG5C,MAAO,MAIT,YAA6B,EAAI,CAC/B,MAAO,OAAO,SAAW,YAAc,GAAyB,EAGlE,aAAmC,CACjC,KAAM,IAAI,OAAM,2BCxjElB,iBCAA,2BACA,AACA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAQ,MAAQ,GAAQ,OAAS,GAAQ,KAAO,GAAQ,aAAe,GAAQ,WAAa,GAAQ,UAAY,GAAQ,MAAQ,GAAQ,cAAgB,GAAQ,MAAQ,OACxK,GAAM,IAAQ,CACV,EAAG,CAAC,GACJ,EAAG,+EACH,EAAG,IAAM,KAAO,IAChB,EAAG,IAAM,KAAO,wCAChB,EAAG,GACH,GAAI,+EACJ,GAAI,gFAER,GAAQ,MAAQ,GAChB,GAAM,IAAM,GACN,GAAU,+EACV,GAAoB,+EACpB,GAAoB,+EACpB,GAAiB,8EACjB,GAAiB,+EACvB,QAAoB,CAChB,YAAY,EAAG,EAAG,EAAG,EAAG,CACpB,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,QAEN,YAAW,EAAG,CACjB,GAAI,CAAE,aAAa,KACf,KAAM,IAAI,WAAU,4CAExB,MAAI,GAAE,OAAO,GAAM,MACR,GAAc,KAClB,GAAI,IAAc,EAAE,EAAG,EAAE,EAAG,GAAI,GAAI,EAAE,EAAI,EAAE,UAEhD,eAAc,EAAQ,CACzB,GAAM,GAAQ,GAAY,EAAO,IAAI,AAAC,GAAM,EAAE,IAC9C,MAAO,GAAO,IAAI,CAAC,EAAG,IAAM,EAAE,SAAS,EAAM,WAE1C,YAAW,EAAQ,CACtB,MAAO,MAAK,cAAc,GAAQ,IAAI,KAAK,kBAExC,mBAAkB,EAAM,CAC3B,GAAM,GAAK,GAAmB,EAAK,MAAM,EAAG,KACtC,EAAK,KAAK,0BAA0B,GACpC,EAAK,GAAmB,EAAK,MAAM,GAAK,GAAM,IAC9C,EAAK,KAAK,0BAA0B,GAC1C,MAAO,GAAG,IAAI,SAEX,2BAA0B,EAAI,CACjC,GAAM,CAAE,KAAM,GACR,EAAI,GAAI,GAAU,EAAK,GACvB,EAAK,GAAK,GAAI,IAAM,IACtB,EAAI,CAAC,GACH,EAAI,GAAK,GAAI,EAAI,GAAK,GAAI,EAAI,IAChC,CAAE,QAAS,EAAY,MAAO,GAAM,GAAQ,EAAI,GAChD,EAAK,GAAI,EAAI,GACjB,AAAK,GAAa,IACd,GAAK,GAAI,CAAC,IACT,GACD,GAAI,GACH,GACD,GAAI,GACR,GAAM,GAAK,GAAI,EAAK,GAAI,IAAM,GAAiB,GACzC,EAAK,EAAI,EACT,EAAK,GAAK,GAAI,GAAK,GACnB,EAAK,GAAI,EAAK,IACd,EAAK,GAAI,GAAK,GACd,EAAK,GAAI,GAAK,GACpB,MAAO,IAAI,IAAc,GAAI,EAAK,GAAK,GAAI,EAAK,GAAK,GAAI,EAAK,GAAK,GAAI,EAAK,UAEzE,oBAAmB,EAAO,CAC7B,GAAM,CAAE,IAAG,KAAM,GACX,EAAO,4EACP,EAAI,GAAmB,GAC7B,GAAI,CAAC,GAAW,GAAoB,EAAG,IAAM,IAAU,GAAa,GAChE,KAAM,IAAI,OAAM,GACpB,GAAM,GAAK,GAAI,EAAI,GACb,EAAK,GAAI,GAAK,EAAI,GAClB,EAAK,GAAI,GAAK,EAAI,GAClB,EAAO,GAAI,EAAK,GAChB,EAAO,GAAI,EAAK,GAChB,EAAI,GAAI,EAAI,EAAI,EAAO,GACvB,CAAE,UAAS,MAAO,GAAM,GAAW,GAAI,EAAI,IAC3C,EAAK,GAAI,EAAI,GACb,EAAK,GAAI,EAAI,EAAK,GACpB,GAAI,GAAK,GAAI,GAAK,GACtB,AAAI,GAAa,KACb,IAAI,GAAI,CAAC,KACb,GAAM,GAAI,GAAI,EAAK,GACb,GAAI,GAAI,GAAI,GAClB,GAAI,CAAC,GAAW,GAAa,KAAM,IAAM,GACrC,KAAM,IAAI,OAAM,GACpB,MAAO,IAAI,IAAc,GAAG,EAAG,GAAI,IAEvC,kBAAmB,CACf,GAAI,CAAE,IAAG,IAAG,IAAG,KAAM,KACf,EAAK,GAAK,GAAI,GAAM,GAAI,IACxB,EAAK,GAAI,EAAI,GACb,CAAE,MAAO,GAAY,GAAW,GAAI,EAAK,GAAM,KAC/C,EAAK,GAAI,EAAU,GACnB,EAAK,GAAI,EAAU,GACnB,EAAO,GAAI,EAAK,EAAK,GACvB,EACJ,AAAI,GAAa,EAAI,GACjB,EAAC,EAAG,GAAK,CAAC,GAAI,EAAI,IAAU,GAAI,EAAI,KACpC,EAAI,GAAI,EAAK,KAGb,EAAI,EAEJ,GAAa,EAAI,IACjB,GAAI,GAAI,CAAC,IACb,GAAI,GAAI,GAAK,GAAI,GAAK,GACtB,MAAI,IAAa,IACb,GAAI,GAAI,CAAC,IACN,GAAoB,EAAG,IAElC,OAAO,EAAO,CACV,GAAM,GAAI,KACJ,EAAI,EACJ,CAAC,EAAI,EAAI,EAAI,GAAM,CAAC,EAAE,EAAG,EAAE,EAAG,EAAE,EAAG,EAAE,GAC3C,MAAO,IAAI,EAAK,KAAQ,GAAI,EAAK,GAErC,QAAS,CACL,MAAO,IAAI,IAAc,GAAI,CAAC,KAAK,GAAI,KAAK,EAAG,KAAK,EAAG,GAAI,CAAC,KAAK,IAErE,QAAS,CACL,GAAM,GAAK,KAAK,EACV,EAAK,KAAK,EACV,EAAK,KAAK,EACV,CAAE,KAAM,GACR,EAAI,GAAI,GAAM,IACd,EAAI,GAAI,GAAM,IACd,EAAI,GAAI,GAAK,GAAM,IACnB,EAAI,GAAI,EAAI,GACZ,EAAI,GAAK,GAAK,IAAO,GAAK,EAAI,GAC9B,EAAI,GAAI,EAAI,GACZ,EAAI,GAAI,EAAI,GACZ,EAAI,GAAI,EAAI,GACZ,EAAK,GAAI,EAAI,GACb,EAAK,GAAI,EAAI,GACb,EAAK,GAAI,EAAI,GACb,GAAK,GAAI,EAAI,GACnB,MAAO,IAAI,IAAc,EAAI,EAAI,GAAI,GAEzC,IAAI,EAAO,CACP,GAAM,GAAK,KAAK,EACV,EAAK,KAAK,EACV,EAAK,KAAK,EACV,EAAK,KAAK,EACV,EAAK,EAAM,EACX,EAAK,EAAM,EACX,EAAK,EAAM,EACX,EAAK,EAAM,EACX,EAAI,GAAK,GAAK,GAAO,GAAK,IAC1B,EAAI,GAAK,GAAK,GAAO,GAAK,IAC1B,EAAI,GAAI,EAAI,GAClB,GAAI,IAAM,GACN,MAAO,MAAK,SAEhB,GAAM,GAAI,GAAI,EAAK,GAAK,GAClB,EAAI,GAAI,EAAK,GAAK,GAClB,EAAI,GAAI,EAAI,GACZ,GAAI,GAAI,EAAI,GACZ,EAAI,GAAI,EAAI,GACZ,GAAK,GAAI,EAAI,GACb,EAAK,GAAI,GAAI,GACb,GAAK,GAAI,EAAI,GACb,GAAK,GAAI,EAAI,IACnB,MAAO,IAAI,IAAc,GAAI,EAAI,GAAI,IAEzC,SAAS,EAAO,CACZ,MAAO,MAAK,IAAI,EAAM,UAE1B,eAAe,EAAQ,CACnB,GAAI,CAAC,GAAc,GACf,KAAM,IAAI,WAAU,6CACxB,GAAI,GAAI,GAAI,OAAO,GAAS,GAAM,GAClC,GAAI,IAAM,GACN,MAAO,MACX,GAAI,GAAI,GAAc,KAClB,EAAI,KACR,KAAO,EAAI,IACP,AAAI,EAAI,IACJ,GAAI,EAAE,IAAI,IACd,EAAI,EAAE,SACN,IAAM,GAEV,MAAO,GAEX,iBAAiB,EAAG,CAChB,GAAM,GAAU,IAAM,EAAI,EACtB,EAAS,GACT,EAAI,KACJ,EAAO,EACX,OAAS,GAAS,EAAG,EAAS,EAAS,IAAU,CAC7C,EAAO,EACP,EAAO,KAAK,GACZ,OAAS,GAAI,EAAG,EAAI,GAAM,GAAI,GAAI,IAC9B,EAAO,EAAK,IAAI,GAChB,EAAO,KAAK,GAEhB,EAAI,EAAK,SAEb,MAAO,GAEX,KAAK,EAAG,EAAa,CACjB,AAAI,CAAC,GAAe,KAAK,OAAO,GAAc,OAC1C,GAAc,GAAM,MACxB,GAAM,GAAK,GAAe,EAAY,cAAiB,EACvD,GAAI,IAAM,EACN,KAAM,IAAI,OAAM,iEAEpB,GAAI,GAAc,GAAe,GAAiB,IAAI,GACtD,AAAK,GACD,GAAc,KAAK,iBAAiB,GAChC,GAAe,IAAM,GACrB,GAAc,GAAc,WAAW,GACvC,GAAiB,IAAI,EAAa,KAG1C,GAAI,GAAI,GAAc,KAClB,EAAI,GAAc,KAChB,EAAU,IAAM,EAAI,EACpB,EAAa,GAAM,GAAI,GACvB,EAAO,OAAO,GAAK,EAAI,GACvB,EAAY,GAAK,EACjB,EAAU,OAAO,GACvB,OAAS,GAAS,EAAG,EAAS,EAAS,IAAU,CAC7C,GAAM,GAAS,EAAS,EACpB,EAAQ,OAAO,EAAI,GAMvB,GALA,IAAM,EACF,EAAQ,GACR,IAAS,EACT,GAAK,IAEL,IAAU,EACV,EAAI,EAAE,IAAI,EAAS,EAAI,EAAY,GAAQ,SAAW,EAAY,QAEjE,CACD,GAAM,GAAS,EAAY,EAAS,KAAK,IAAI,GAAS,GACtD,EAAI,EAAE,IAAI,EAAQ,EAAI,EAAO,SAAW,IAGhD,MAAO,CAAC,EAAG,GAEf,SAAS,EAAQ,EAAa,CAC1B,GAAI,CAAC,GAAc,GACf,KAAM,IAAI,WAAU,6CACxB,GAAM,GAAI,GAAI,OAAO,GAAS,GAAM,GACpC,MAAO,IAAc,WAAW,KAAK,KAAK,EAAG,IAAc,GAE/D,SAAS,EAAO,GAAO,KAAK,GAAI,CAC5B,GAAM,GAAI,GAAI,KAAK,EAAI,GACjB,EAAI,GAAI,KAAK,EAAI,GACvB,MAAO,IAAI,IAAM,EAAG,KAG5B,GAAQ,cAAgB,GACxB,GAAc,KAAO,GAAI,IAAc,GAAM,GAAI,GAAM,GAAI,GAAI,GAAI,GAAM,GAAK,GAAM,KACpF,GAAc,KAAO,GAAI,IAAc,GAAI,GAAI,GAAI,IACnD,GAAM,IAAmB,GAAI,SAC7B,QAAY,CACR,YAAY,EAAG,EAAG,CACd,KAAK,EAAI,EACT,KAAK,EAAI,EAEb,eAAe,EAAY,CACvB,KAAK,aAAe,EACpB,GAAiB,OAAO,YAErB,SAAQ,EAAM,CACjB,GAAM,CAAE,IAAG,KAAM,GACX,EAAQ,YAAgB,YAAa,EAAO,GAAW,GAC7D,GAAI,EAAM,SAAW,GACjB,KAAM,IAAI,OAAM,oCACpB,GAAM,GAAO,EAAM,IACb,EAAa,EAAO,CAAC,IACrB,EAAiB,GAAO,MAAU,EAClC,EAAS,WAAW,KAAK,MAAM,KAAK,EAAM,MAAM,EAAG,KAAK,OAAO,IAC/D,EAAI,GAAgB,GAC1B,GAAI,GAAK,EACL,KAAM,IAAI,OAAM,mCACpB,GAAM,GAAK,GAAI,EAAI,GACb,EAAI,GAAI,EAAK,IACb,EAAI,GAAI,EAAI,EAAK,IACnB,CAAE,UAAS,MAAO,GAAM,GAAQ,EAAG,GACvC,GAAI,CAAC,EACD,KAAM,IAAI,OAAM,uCACpB,GAAM,GAAU,GAAI,MAAQ,GAC5B,MAAI,KAAkB,GAClB,GAAI,GAAI,CAAC,IAEN,GAAI,IAAM,EAAG,eAEX,gBAAe,EAAY,CACpC,GAAM,GAAY,KAAM,IAAQ,MAAM,OAAO,GAAoB,IACjE,MAAO,IAAM,KAAK,SAAS,GAAc,IAE7C,YAAa,CACT,GAAM,GAAM,GAAY,KAAK,GACvB,EAAK,GAAI,YAAW,IAC1B,OAAS,GAAI,EAAI,OAAS,EAAG,EAAI,EAAG,EAAI,IAAO,GAAK,EAAG,GAAK,EAAG,IAC3D,EAAG,GAAK,OAAO,SAAS,EAAI,GAAK,EAAI,EAAI,GAAI,IAEjD,GAAM,GAAO,KAAK,EAAI,GAAK,IAAO,EAClC,SAAG,GAAM,IAAM,EACR,EAEX,OAAQ,CACJ,MAAO,IAAW,KAAK,cAE3B,UAAW,CACP,MAAO,IAAK,IAAK,KAAK,GAAK,GAAO,GAAK,KAAK,IAEhD,OAAO,EAAO,CACV,MAAO,MAAK,IAAM,EAAM,GAAK,KAAK,IAAM,EAAM,EAElD,QAAS,CACL,MAAO,IAAI,IAAM,GAAI,CAAC,KAAK,GAAI,KAAK,GAExC,IAAI,EAAO,CACP,MAAO,IAAc,WAAW,MAAM,IAAI,GAAc,WAAW,IAAQ,WAE/E,SAAS,EAAO,CACZ,MAAO,MAAK,IAAI,EAAM,UAE1B,SAAS,EAAQ,CACb,MAAO,IAAc,WAAW,MAAM,SAAS,EAAQ,MAAM,aAGrE,GAAQ,MAAQ,GAChB,GAAM,KAAO,GAAI,IAAM,GAAM,GAAI,GAAM,IACvC,GAAM,KAAO,GAAI,IAAM,GAAI,IAC3B,YAAgB,CACZ,YAAY,EAAG,EAAG,CACd,KAAK,EAAI,EACT,KAAK,EAAI,QAEN,SAAQ,EAAK,CAChB,EAAM,GAAY,GAClB,GAAM,GAAI,GAAM,QAAQ,EAAI,MAAM,EAAG,KAC/B,EAAI,GAAgB,EAAI,MAAM,KACpC,GAAI,CAAC,GAAmB,GACpB,KAAM,IAAI,OAAM,0CACpB,MAAO,IAAI,IAAU,EAAG,GAE5B,YAAa,CACT,GAAM,GAAc,GAAW,GAAY,KAAK,IAAI,UAC9C,EAAS,GAAI,YAAW,IAC9B,EAAO,IAAI,GACX,GAAM,GAAM,GAAI,YAAW,GAAM,GACjC,SAAI,IAAI,KAAK,EAAE,cACf,EAAI,IAAI,EAAQ,IACT,EAEX,OAAQ,CACJ,MAAO,IAAW,KAAK,gBAG/B,GAAQ,UAAY,GACpB,GAAQ,WAAa,GACrB,eAAwB,EAAQ,CAC5B,GAAI,EAAO,SAAW,EAClB,MAAO,GAAO,GAClB,GAAM,GAAS,EAAO,OAAO,CAAC,EAAG,IAAQ,EAAI,EAAI,OAAQ,GACnD,EAAS,GAAI,YAAW,GAC9B,OAAS,GAAI,EAAG,EAAM,EAAG,EAAI,EAAO,OAAQ,IAAK,CAC7C,GAAM,GAAM,EAAO,GACnB,EAAO,IAAI,EAAK,GAChB,GAAO,EAAI,OAEf,MAAO,GAEX,YAAoB,EAAQ,CACxB,GAAI,GAAM,GACV,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,GAAO,EAAO,GAAG,SAAS,IAAI,SAAS,EAAG,KAE9C,MAAO,GAEX,YAAoB,EAAK,CACrB,GAAI,MAAO,IAAQ,UAAY,EAAI,OAAS,EACxC,KAAM,IAAI,OAAM,sBACpB,GAAM,GAAQ,GAAI,YAAW,EAAI,OAAS,GAC1C,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACnC,GAAM,GAAI,EAAI,EACd,EAAM,GAAK,OAAO,SAAS,EAAI,MAAM,EAAG,EAAI,GAAI,IAEpD,MAAO,GAEX,YAAqB,EAAK,CACtB,GAAM,GAAM,EAAI,SAAS,IACzB,MAAO,GAAI,OAAS,EAAI,IAAI,IAAQ,EAExC,YAA6B,EAAK,EAAS,GAAK,CAC5C,GAAM,GAAM,GAAY,GAAK,SAAS,EAAS,EAAG,KAClD,MAAO,IAAW,GAAK,UAE3B,YAAsB,EAAK,CACvB,MAAQ,IAAI,GAAO,MAAQ,GAE/B,YAAuB,EAAK,CAGxB,MAFI,SAAO,IAAQ,UAAY,EAAM,IAEjC,MAAO,IAAQ,UAAY,EAAM,GAAK,OAAO,cAAc,IAInE,YAAyB,EAAQ,CAC7B,GAAI,GAAQ,GACZ,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAC/B,GAAS,OAAO,EAAO,KAAQ,GAAK,OAAO,GAE/C,MAAO,GAEX,YAA4B,EAAO,CAC/B,MAAO,IAAI,GAAgB,GAAU,IAAM,KAAO,IAEtD,YAAa,EAAG,EAAI,GAAM,EAAG,CACzB,GAAM,GAAM,EAAI,EAChB,MAAO,IAAO,GAAK,EAAM,EAAI,EAEjC,YAAgB,EAAQ,EAAS,GAAM,EAAG,CACtC,GAAI,IAAW,IAAM,GAAU,GAC3B,KAAM,IAAI,OAAM,6CAA6C,SAAc,KAE/E,GAAI,GAAI,GAAI,EAAQ,GAChB,EAAI,EACJ,CAAC,EAAG,EAAG,EAAG,GAAK,CAAC,GAAI,GAAI,GAAI,IAChC,KAAO,IAAM,IAAI,CACb,GAAM,GAAI,EAAI,EACR,EAAI,EAAI,EACR,EAAI,EAAI,EAAI,EACZ,EAAI,EAAI,EAAI,EAClB,CAAC,EAAG,GAAK,CAAC,EAAG,GACb,CAAC,EAAG,GAAK,CAAC,EAAG,GACb,CAAC,EAAG,GAAK,CAAC,EAAG,GAGjB,GAAI,AADQ,IACA,GACR,KAAM,IAAI,OAAM,0BACpB,MAAO,IAAI,EAAG,GAElB,YAAqB,EAAM,EAAI,GAAM,EAAG,CACpC,GAAM,GAAM,EAAK,OACX,EAAU,GAAI,OAAM,GACtB,EAAM,GACV,OAAS,GAAI,EAAG,EAAI,EAAK,IACrB,AAAI,EAAK,KAAO,IAEhB,GAAQ,GAAK,EACb,EAAM,GAAI,EAAM,EAAK,GAAI,IAE7B,EAAM,GAAO,EAAK,GAClB,OAAS,GAAI,EAAM,EAAG,GAAK,EAAG,IAAK,CAC/B,GAAI,EAAK,KAAO,GACZ,SACJ,GAAI,GAAM,GAAI,EAAM,EAAK,GAAI,GAC7B,EAAK,GAAK,GAAI,EAAM,EAAQ,GAAI,GAChC,EAAM,EAEV,MAAO,GAEX,YAAc,EAAG,EAAO,CACpB,GAAM,CAAE,KAAM,GACV,EAAM,EACV,KAAO,KAAU,IACb,GAAO,EACP,GAAO,EAEX,MAAO,GAEX,YAAqB,EAAG,CACpB,GAAM,CAAE,KAAM,GAER,EAAM,AADA,EAAI,EAAK,EACJ,EAAK,EAChB,EAAM,GAAK,EAAI,IAAM,EAAM,EAC3B,EAAM,GAAK,EAAI,IAAM,EAAK,EAC1B,EAAO,GAAK,EAAI,IAAM,EAAM,EAC5B,EAAO,GAAK,EAAK,KAAO,EAAO,EAC/B,EAAO,GAAK,EAAK,KAAO,EAAO,EAC/B,EAAO,GAAK,EAAK,KAAO,EAAO,EAC/B,EAAQ,GAAK,EAAK,KAAO,EAAO,EAChC,EAAQ,GAAK,EAAM,KAAO,EAAO,EACjC,EAAQ,GAAK,EAAM,KAAO,EAAO,EAEvC,MADmB,IAAK,EAAM,IAAM,EAAK,EAG7C,YAAiB,EAAG,EAAG,CACnB,GAAM,GAAK,GAAI,EAAI,EAAI,GACjB,EAAK,GAAI,EAAK,EAAK,GACrB,EAAI,GAAI,EAAI,EAAK,GAAY,EAAI,IAC/B,EAAM,GAAI,EAAI,EAAI,GAClB,EAAQ,EACR,EAAQ,GAAI,EAAI,IAChB,EAAW,IAAQ,EACnB,EAAW,IAAQ,GAAI,CAAC,GACxB,EAAS,IAAQ,GAAI,CAAC,EAAI,IAChC,MAAI,IACA,GAAI,GACJ,IAAY,IACZ,GAAI,GACJ,GAAa,IACb,GAAI,GAAI,CAAC,IACN,CAAE,QAAS,GAAY,EAAU,MAAO,GAEnD,YAAoB,EAAQ,CACxB,MAAO,IAAQ,GAAI,GAEvB,qBAAmC,EAAM,CACrC,GAAM,GAAe,GAAY,GAAG,GAC9B,EAAO,KAAM,IAAQ,MAAM,OAAO,GAClC,EAAQ,GAAgB,GAC9B,MAAO,IAAI,EAAO,GAAM,GAE5B,YAAmB,EAAc,CAC7B,MAAO,GAAa,MAAM,IAE9B,YAAuB,EAAc,CACjC,GAAM,GAAO,GAAM,EACb,EAAO,EAAa,MAAM,EAAG,IACnC,SAAK,IAAM,IACX,EAAK,IAAS,IACd,EAAK,IAAS,GACP,GAAI,GAAgB,GAAO,GAAM,GAE5C,YAAoB,EAAI,EAAI,CACxB,GAAI,EAAG,SAAW,EAAG,OACjB,MAAO,GAEX,OAAS,GAAI,EAAG,EAAI,EAAG,OAAQ,IAC3B,GAAI,EAAG,KAAO,EAAG,GACb,MAAO,GAGf,MAAO,GAEX,YAAqB,EAAM,CACvB,MAAO,aAAgB,YAAa,EAAO,GAAW,GAE1D,YAA4B,EAAK,CAC7B,MAAO,GAAI,GAAO,EAAM,GAAM,EAElC,YAA6B,EAAK,CAC9B,GAAI,GAKJ,GAJI,OAAO,IAAQ,UAAa,MAAO,IAAQ,UAAY,OAAO,cAAc,IAAQ,EAAM,IAC1F,GAAM,OAAO,GACb,EAAM,EAAI,SAAS,IAAI,SAAS,GAAM,EAAG,MAEzC,MAAO,IAAQ,SAAU,CACzB,GAAI,EAAI,SAAW,GACf,KAAM,IAAI,OAAM,oCACpB,MAAO,IAAW,WAEb,YAAe,YAAY,CAChC,GAAI,EAAI,SAAW,GACf,KAAM,IAAI,OAAM,oCACpB,MAAO,OAGP,MAAM,IAAI,WAAU,8BAG5B,kBAA4B,EAAY,CACpC,GAAM,GAAM,KAAM,IAAM,eAAe,GACvC,MAAO,OAAO,IAAe,SAAW,EAAI,QAAU,EAAI,aAE9D,GAAQ,aAAe,GACvB,kBAAoB,EAAM,EAAY,CAClC,GAAM,GAAY,KAAM,IAAQ,MAAM,OAAO,GAAoB,IAC3D,EAAI,GAAc,GAClB,EAAI,GAAM,KAAK,SAAS,GACxB,EAAM,GAAY,GAClB,EAAI,KAAM,IAAiB,GAAU,GAAY,GACjD,EAAI,GAAM,KAAK,SAAS,GACxB,EAAI,KAAM,IAAiB,EAAE,aAAc,EAAE,aAAc,GAC3D,EAAI,GAAI,EAAI,EAAI,EAAG,GAAM,GACzB,EAAM,GAAI,IAAU,EAAG,GAC7B,MAAO,OAAO,IAAS,SAAW,EAAI,QAAU,EAAI,aAExD,GAAQ,KAAO,GACf,kBAAsB,EAAW,EAAM,EAAW,CAC9C,EAAO,GAAY,GACb,YAAqB,KACvB,GAAY,GAAM,QAAQ,IACxB,YAAqB,KACvB,GAAY,GAAU,QAAQ,IAClC,GAAM,GAAK,KAAM,IAAiB,EAAU,EAAE,aAAc,EAAU,aAAc,GAC9E,EAAK,GAAc,WAAW,GAAW,eAAe,GACxD,EAAK,GAAc,KAAK,SAAS,EAAU,GAEjD,MAAO,AADK,IAAc,WAAW,EAAU,GAAG,IAAI,GAC3C,SAAS,GAAI,eAAe,IAAI,OAAO,GAAc,MAEpE,GAAQ,OAAS,GACjB,GAAM,KAAK,eAAe,GAC1B,GAAQ,MAAQ,CACZ,iBAAkB,CACd,mEACA,mEACA,mEACA,mEACA,mEACA,mEACA,mEACA,oEAEJ,iBAAkB,CAAC,EAAc,KAAO,CACpC,GAAI,MAAO,SAAU,UAAY,UAAY,QACzC,MAAO,QAAO,OAAO,gBAAgB,GAAI,YAAW,IAEnD,GAAI,MAAO,UAAY,UAAY,QAAU,SAAQ,SAAU,CAChE,GAAM,CAAE,eAAgB,KACxB,MAAO,IAAI,YAAW,EAAY,GAAa,YAG/C,MAAM,IAAI,OAAM,sDAGxB,OAAQ,KAAO,IAAY,CACvB,GAAI,MAAO,SAAU,UAAY,UAAY,QAAQ,CACjD,GAAM,GAAS,KAAM,QAAO,OAAO,OAAO,OAAO,UAAW,EAAQ,QACpE,MAAO,IAAI,YAAW,WAEjB,MAAO,UAAY,UAAY,QAAU,SAAQ,SAAU,CAChE,GAAM,CAAE,cAAe,KACjB,EAAO,EAAW,UACxB,SAAK,OAAO,GACL,WAAW,KAAK,EAAK,cAG5B,MAAM,IAAI,OAAM,iDAGxB,WAAW,EAAa,EAAG,EAAQ,GAAM,KAAM,CAC3C,GAAM,GAAS,EAAM,OAAO,GAAM,MAAQ,EAAQ,GAAI,IAAM,EAAM,EAAG,EAAM,GAC3E,SAAO,eAAe,GACtB,EAAO,SAAS,IACT,mFCpmBf,GAAY,IAAZ,AAAA,UAAY,EAAY,CACtB,EAAA,IAAA,MACA,EAAA,IAAA,QAFU,GAAA,GAAA,cAAA,IAAA,aAAY,KAKxB,GAAY,IAAZ,AAAA,UAAY,EAAQ,CAClB,EAAA,MAAA,QACA,EAAA,MAAA,QACA,EAAA,MAAA,UAHU,GAAA,GAAA,UAAA,IAAA,SAAQ,KAMpB,GAAY,IAAZ,AAAA,UAAY,EAAO,CACjB,EAAA,EAAA,MAAA,MAAA,QACA,EAAA,EAAA,MAAA,MAAA,QACA,EAAA,EAAA,MAAA,MAAA,UAHU,GAAA,GAAA,SAAA,IAAA,QAAO,KAMnB,GAAY,IAAZ,AAAA,UAAY,EAAO,CACjB,EAAA,QAAA,UACA,EAAA,QAAA,YAFU,GAAA,GAAA,SAAA,IAAA,QAAO,KAKnB,GAAY,IAAZ,AAAA,UAAY,EAAa,CACvB,EAAA,EAAA,KAAA,KAAA,OACA,EAAA,EAAA,KAAA,KAAA,OACA,EAAA,EAAA,KAAA,KAAA,SAHU,GAAA,GAAA,eAAA,IAAA,cAAa,KAMzB,GAAY,IAAZ,AAAA,UAAY,EAAO,CACjB,EAAA,MAAA,QACA,EAAA,QAAA,UACA,EAAA,QAAA,UACA,EAAA,QAAA,YAJU,GAAA,GAAA,SAAA,IAAA,QAAO,KAOnB,GAAY,IAAZ,AAAA,UAAY,EAAQ,CAClB,EAAA,EAAA,GAAA,GAAA,KACA,EAAA,EAAA,IAAA,IAAA,QAFU,GAAA,GAAA,UAAA,IAAA,SAAQ,KAKpB,GAAY,IAAZ,AAAA,UAAY,EAAM,CAChB,EAAA,KAAA,OACA,EAAA,MAAA,UAFU,GAAA,GAAA,QAAA,IAAA,OAAM,oFCnElB,GAAA,IAAA,KAEa,GAAA,aAAe,OACf,GAAA,cAAgB,QAChB,GAAA,aAAe,WACf,GAAA,cAAgB,oBAChB,GAAA,YAAc,IAEd,GAAA,qBAAuB,MACvB,GAAA,kBAAoB,GAAA,SAAS,MAC7B,GAAA,iBAAmB,GAAA,QAAQ,MAE3B,GAAA,iBAAmB,GAAA,QAAQ,QAC3B,GAAA,iBAAmB,GAAA,cAAc,KACjC,GAAA,gBAAkB,GAElB,GAAA,iBAAmB,GAAA,QAAQ,QAC3B,GAAA,kBAAoB,GAAA,SAAS,IAE7B,GAAA,mBAAqB,WACrB,GAAA,sBAAwB,WACxB,GAAA,uBAAyB,YAEtC,GAAA,QAAe,CACb,aAAY,GAAA,aACZ,cAAa,GAAA,cACb,aAAY,GAAA,aACZ,cAAa,GAAA,cACb,YAAW,GAAA,YACX,qBAAoB,GAAA,qBACpB,kBAAiB,GAAA,kBACjB,iBAAgB,GAAA,iBAChB,iBAAgB,GAAA,iBAChB,gBAAe,GAAA,gBACf,iBAAgB,GAAA,iBAChB,kBAAiB,GAAA,kBACjB,mBAAkB,GAAA,mBAClB,sBAAqB,GAAA,sBACrB,uBAAsB,GAAA,6+CCtCxB,GAAA,IAAA,KACA,GAAA,KAEA,YAA4B,EAAkB,EAAkB,CAC9D,GAAM,GAAM,IAAa,EAAI,GAAI,YAAW,GAAO,GAAI,aAAY,GACnE,MAAO,OAAM,KAAK,GACf,IAAI,SAAA,EAAC,CAAI,MAAA,QAAO,aAAa,KAC7B,KAAK,IAJV,GAAA,YAAA,GAOA,YAA+B,EAAgB,CAC7C,GAAM,GAAM,GAAY,EAAK,GAC7B,MAAO,IAAA,OAAO,KAAK,EAAK,UAAU,SAAS,UAF7C,GAAA,eAAA,GAKA,YAA4B,EAAa,EAAkB,CAGzD,OAFM,GACJ,IAAa,EAAI,GAAI,YAAW,EAAI,QAAU,GAAI,aAAY,EAAI,QAC3D,EAAI,EAAG,EAAS,EAAI,OAAQ,EAAI,EAAQ,IAC/C,EAAK,GAAK,EAAI,WAAW,GAE3B,MAAO,GAAK,OANd,GAAA,YAAA,GASA,YAA+B,EAAc,CAC3C,GAAM,GAAM,GAAA,OAAO,KAAK,EAAQ,UAAU,SAAS,UACnD,MAAO,IAAY,EAAK,GAF1B,GAAA,eAAA,GAKA,aAA8B,CAC5B,MAAO,IAAI,YAAW,CAAC,EAAM,EAAM,IADrC,GAAA,eAAA,GAIA,YAA0B,EAAc,CACtC,GAAM,GAAM,GAAI,YAAW,GAC3B,kBAAW,OAAO,gBAAgB,GAC3B,EAAI,OAHb,GAAA,UAAA,GAMA,YAAyB,EAAkB,EAAgB,CACzD,GAAM,GAAQ,GAAI,YAAW,GACvB,EAAQ,GAAI,YAAW,GACvB,EAAS,GAAI,YAAW,EAAM,OAAS,EAAM,QACnD,SAAO,IAAI,GACX,EAAO,IAAI,EAAO,EAAM,QACjB,EAAO,OANhB,GAAA,SAAA,GASa,GAAA,mBAAqB,SAAC,EAAQ,CACzC,MAAO,IAAA,eAAe,EAAK,SAAC,EAAG,CAAK,MAAA,IAAY,EAAK,GAAA,SAAS,OAGnD,GAAA,oBAAsB,SAAC,EAAQ,CAC1C,MAAO,IAAA,eAAe,EAAK,SAAC,EAAG,CAAK,MAAA,IAAY,EAAK,GAAA,SAAS,QAGnD,GAAA,qBAAuB,SAAC,EAAQ,CAC3C,MAAO,IAAA,eAAe,EAAK,KAGhB,GAAA,sBAAwB,SAAC,EAAU,EAAkB,CAChE,OAAQ,OACD,GAAG,MAAO,IAAA,mBAAmB,WACzB,MAAO,IAAA,oBAAoB,KAI3B,GAAA,eAAiB,SAAC,EAAU,EAAqC,CAC5E,GAAI,MAAO,IAAQ,SACjB,MAAO,GAAQ,GACV,GAAI,MAAO,IAAQ,UAAY,EAAI,aAAe,OAAW,CAElE,GAAM,GAAO,GAAI,YAAW,GAC5B,MAAO,GAAK,WAEZ,MAAM,IAAI,OAAM,8DAKpB,YAAsC,EAAQ,oEAC5C,MAAA,CAAA,EAAO,GAAI,SAAQ,SAAA,EAAO,CAClB,GAAA,GAAA,GAAA,gBAAE,EAAA,EAAA,MAAO,EAAA,EAAA,MACf,EAAM,UAAY,SAAA,EAAE,CAAI,MAAA,GAAQ,EAAG,OACnC,EAAM,YAAY,UAJtB,GAAA,gBAAA,GAQA,GAAA,QAAe,CACb,YAAW,GACX,eAAc,GACd,YAAW,GACX,eAAc,GACd,eAAc,GACd,UAAS,GACT,SAAQ,GACR,mBAAkB,GAAA,mBAClB,oBAAmB,GAAA,oBACnB,qBAAoB,GAAA,qBACpB,eAAc,GAAA,eACd,gBAAe,mFCpGjB,GAAA,IAAA,KAEa,GAAA,gBAAkB,GAAI,OAAM,yEAC5B,GAAA,WAAa,GAAI,OAAM,uGACvB,GAAA,OAAS,GAAI,OAAM,wGACnB,GAAA,cAAgB,GAAI,OAAM,gEAC1B,GAAA,kBAAoB,GAAI,OAAM,qDAC9B,GAAA,cAAgB,GAAI,OAAM,gDAEvC,YAA+B,EAAY,CACzC,GAAG,CAAC,GAAW,IAAY,KACzB,KAAM,IAAA,gBACD,GAAG,EAAQ,aAAe,OAC/B,KAAM,IAAA,WAER,MAAO,GANT,GAAA,eAAA,GASA,YAA2B,EAAQ,CACjC,GAAG,CAAC,GAAO,IAAQ,KACjB,KAAM,IAAA,gBACD,GAAI,EAAI,aAAe,QAAa,EAAI,YAAc,OAC3D,KAAM,IAAA,OAER,MAAO,GANT,GAAA,WAAA,GASA,YAAuC,EAAkB,CACvD,GAAW,EAAM,CAAC,GAAA,aAAa,IAAK,GAAA,aAAa,KAAM,GAAA,mBADzD,GAAA,uBAAA,GAIA,YAAiC,EAAW,CAC1C,GAAW,EAAK,CAAC,GAAA,OAAO,KAAM,GAAA,OAAO,OAAQ,GAAA,eAD/C,GAAA,iBAAA,GAIA,YAAuB,EAAY,EAAW,EAAY,CACxD,GAAM,GAAQ,EAAK,KAAK,SAAA,EAAG,CAAI,MAAA,KAAQ,IACvC,GAAG,CAAC,EACF,KAAM,GAIV,GAAA,QAAe,CACb,gBAAe,GAAA,gBACf,WAAU,GAAA,WACV,OAAM,GAAA,OACN,cAAa,GAAA,cACb,kBAAiB,GAAA,kBACjB,cAAa,GAAA,cACb,eAAc,GACd,WAAU,GACV,uBAAsB,GACtB,iBAAgB,y9CCpDlB,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KAEA,YACE,EACA,EACA,EAAW,4EAEX,UAAA,iBAAiB,GACX,EAAM,IAAQ,GAAA,OAAO,KAAO,GAAA,aAAe,GAAA,cAC3C,EAAmB,IAAQ,GAAA,OAAO,KAAO,CAAC,UAAW,WAAa,CAAC,OAAQ,UACjF,CAAA,EAAO,WAAW,OAAO,OAAO,YAC9B,CACE,KAAM,EACN,cAAe,EACf,eAAgB,GAAA,QAAM,iBACtB,KAAM,CAAE,KAAM,IAEhB,GACA,QAhBJ,GAAA,YAAA,GAoBA,YAAwB,EAAiB,CACvC,MAAO,GACJ,QAAQ;EAAgC,IACxC,QAAQ;0BAA8B,IAG3C,YAAsC,EAAmB,EAAkB,EAAW,8EACpF,UAAA,iBAAiB,GACX,EAAM,IAAQ,GAAA,OAAO,KAAO,GAAA,aAAe,GAAA,cAC3C,EAAmB,IAAQ,GAAA,OAAO,KAAO,CAAC,WAAa,CAAC,UACxD,EAAM,GAAA,QAAM,eAAe,GAAe,IAChD,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,OACA,EACA,CAAE,KAAM,EAAK,KAAM,CAAC,KAAM,IAC1B,GACA,QAVJ,GAAA,gBAAA,GAcA,GAAA,QAAe,CACb,YAAW,GACX,gBAAe,y9CC/CjB,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KAGA,YACE,EACA,EACA,EAAsC,CAAtC,MAAA,KAAA,QAAA,GAAqB,GAAA,+EAErB,MAAA,CAAA,EAAO,WAAW,OAAO,OAAO,KAC9B,CAAE,KAAM,GAAA,cAAe,WAAY,GAAA,aACnC,EACA,GAAA,sBAAsB,EAAK,SAR/B,GAAA,KAAA,GAYA,YACE,EACA,EACA,EACA,EACA,EAAmC,CADnC,MAAA,KAAA,QAAA,GAAqB,GAAA,mBACrB,IAAA,QAAA,GAAmB,GAAA,uHAEZ,GAAA,GAAA,WAAW,OAAO,QAAO,UAC9B,CAAE,KAAM,GAAA,cAAe,WAAY,GAAA,cACnC,MAAO,IAAc,SAArB,CAAA,EAAA,GACI,CAAA,EAAM,GAAA,QAAK,gBAAgB,EAAW,EAAS,GAAA,OAAO,eAAtD,SAAA,EAAA,oBACA,EAAA,mBAJN,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,EAAA,OAAA,CAAA,EAKL,GAAA,qBAAqB,GACrB,GAAA,sBAAsB,EAAK,YAb/B,GAAA,OAAA,GAiBA,YACE,EACA,EACA,EACA,EAAmC,CADnC,MAAA,KAAA,QAAA,GAAqB,GAAA,mBACrB,IAAA,QAAA,GAAmB,GAAA,uHAEZ,GAAA,GAAA,WAAW,OAAO,QAAO,WAC9B,CAAE,KAAM,GAAA,eACR,MAAO,IAAc,SAArB,CAAA,EAAA,GACI,CAAA,EAAM,GAAA,QAAK,gBAAgB,EAAW,EAAS,GAAA,OAAO,cAAtD,SAAA,EAAA,oBACA,EAAA,mBAJN,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,EAAA,OAAA,CAAA,EAKL,GAAA,sBAAsB,EAAK,YAX/B,GAAA,QAAA,GAeA,YACE,EACA,EAAsB,0EAEhB,SAAa,GAAA,qBAAqB,GACxC,CAAA,EAAO,WAAW,OAAO,OAAO,QAC9B,CAAE,KAAM,GAAA,cACR,EACA,QARJ,GAAA,QAAA,GAYA,YAAmC,EAAsB,iGAC1C,MAAA,CAAA,EAAM,WAAW,OAAO,OAAO,UAAU,OAAQ,EAAQ,mBAAhE,SAAO,EAAA,OACb,CAAA,EAAO,GAAA,QAAM,eAAe,SAF9B,GAAA,aAAA,GAKA,GAAA,QAAe,CACb,KAAI,GACJ,OAAM,GACN,QAAO,GACP,QAAO,GACP,aAAY,y9CCxEd,GAAA,IAAA,KACA,GAAA,KAGA,YAA4B,EAAY,CACtC,MAAO,IAAA,QAAY,eAAe,CAAE,KAAI,IAD1C,GAAA,YAAA,GAIA,YAA2C,EAAY,EAAkD,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,kGACzH,MAAA,CAAA,EAAM,GAAO,EAAI,WAApB,MAAG,GAAA,OACD,CAAA,GAEU,CAAA,EAAM,YAAZ,SAAM,EAAA,OACZ,CAAA,EAAM,GAAI,EAAI,EAAK,WAAnB,SAAA,gBALF,GAAA,qBAAA,GASA,YAA0B,EAAY,EAAgC,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,qEAC1F,MAAA,CAAA,EAAO,EAAM,QAAQ,EAAI,QAD1B,GAAA,IAAA,GAKA,YAAiC,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,qEAChE,MAAA,CAAA,EAAO,GAAI,EAAI,GAAA,eAAgB,QADjC,GAAA,WAAA,GAKA,YAA6B,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,qEAC5D,MAAA,CAAA,EAAO,GAAI,EAAI,GAAA,WAAY,QAD7B,GAAA,OAAA,GAKA,YAA6B,EAAY,EAAqC,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,kGACpF,MAAA,CAAA,EAAM,EAAM,QAAQ,WAA3B,SAAO,EAAA,OACb,CAAA,EAAO,IAAS,KAAO,KAAO,EAAQ,SAFxC,GAAA,IAAA,GAMA,YAA6B,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,kGAChD,MAAA,CAAA,EAAM,EAAM,QAAQ,WAA1B,SAAM,EAAA,OACZ,CAAA,EAAO,IAAQ,WAFjB,GAAA,OAAA,GAMA,YAAyB,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAqB,GAAA,qEACxD,MAAA,CAAA,EAAO,EAAM,WAAW,QAD1B,GAAA,GAAA,GAIA,YAAgC,EAAkB,oEAChD,MAAA,CAAA,EAAO,EAAM,oBADf,GAAA,UAAA,GAKA,YAA4B,EAAmB,oEAC7C,MAAG,GACD,CAAA,EAAO,GAAU,IAEjB,CAAA,EAAO,GAAA,QAAY,aAJvB,GAAA,MAAA,GAQA,GAAA,QAAe,CACb,YAAW,GACX,qBAAoB,GACpB,IAAG,GACH,WAAU,GACX,OAAM,GACL,OAAM,GACN,GAAE,GACF,UAAS,GACV,MAAK,y9CCtEN,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KAEA,YACE,EACA,EAAW,4EAEX,UAAA,iBAAiB,GACX,EAAM,IAAQ,GAAA,OAAO,KAAO,GAAA,aAAe,GAAA,cAC3C,EACJ,IAAQ,GAAA,OAAO,KAAO,CAAC,YAAa,cAAgB,CAAC,OAAQ,UAC/D,CAAA,EAAO,WAAW,OAAO,OAAO,YAC9B,CAAE,KAAM,EAAK,WAAY,GACzB,GACA,QAXJ,GAAA,YAAA,GAeA,YAAsC,EAAmB,EAAiB,EAAW,8EACnF,UAAA,iBAAiB,GACX,EAAM,IAAQ,GAAA,OAAO,KAAO,GAAA,aAAe,GAAA,cAC3C,EACJ,IAAQ,GAAA,OAAO,KAAO,GAAK,CAAC,UACxB,EAAM,GAAA,QAAM,eAAe,GACjC,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,MACA,EACA,CAAE,KAAM,EAAK,WAAY,GACzB,GACA,QAXJ,GAAA,gBAAA,GAeA,GAAA,QAAe,CACb,YAAW,GACX,gBAAe,gsDCrCjB,GAAA,IAAA,KACA,GAAA,KAYA,GAAA,KACA,GAAA,KAEa,GAAA,cAAgB,CAC3B,KAAM,GAAA,qBACN,MAAO,GAAA,kBACP,QAAS,GAAA,iBACT,QAAS,GAAA,iBACT,QAAS,GAAA,iBACT,QAAS,GAAA,iBACT,SAAU,GAAA,kBACV,UAAW,GAAA,mBACX,YAAa,GAAA,sBACb,aAAc,GAAA,wBAGhB,YACE,EACA,EAA0B,CAA1B,AAAA,IAAA,QAAA,GAAA,IAEA,GAAI,GACJ,MAAK,GAGH,EAAG,GAAA,GAAA,GACE,GAAA,eACA,GAJL,EAAM,GAAA,cAOH,IAAQ,KAAA,OAAR,EAAU,OACb,GAAI,KAAO,EAAa,GAAA,aAAa,IAAM,GAAA,aAAa,KAEnD,EAhBT,GAAA,UAAA,GAqBA,aAAgC,mGACd,MAAA,CAAA,EAAM,GAAA,QAAI,YAAY,GAAA,kBAAmB,GAAA,OAAO,cAA1D,EAAU,EAAA,qDAEd,CAAA,EAAM,GAAA,QAAM,gBAAgB,WAA5B,SAAA,sCAEA,CAAA,EAAO,WAET,MAAA,CAAA,EAAO,SAPT,GAAA,WAAA,GAUA,YAAsB,EAAa,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,IACjC,GAAA,GAAA,GACK,GACA,GAHP,GAAA,MAAA,GAOA,YAA4B,EAAW,CACrC,MAAO,CAAE,IAAK,EAAI,QAAS,OAAQ,EAAI,SADzC,GAAA,YAAA,GAIA,GAAA,QAAe,CACb,cAAa,GAAA,cACb,UAAS,GACT,WAAU,GACV,MAAK,GACL,YAAW,y9CC5Eb,GAAA,IAAA,KACA,GAAA,KAGA,YAA8B,EAA2B,oEACvD,MAAA,CAAA,EAAO,WAAW,OAAO,OAAO,YAC9B,CACE,KAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GAAA,iBACnB,OAAQ,IAAI,KAAA,OAAJ,EAAM,SAAU,GAAA,kBAE1B,GACA,CAAC,UAAW,iBAPhB,GAAA,QAAA,GAWA,YAAgC,EAAmB,EAA2B,0EACtE,SAAM,GAAA,QAAM,eAAe,GACjC,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,MACA,EACA,CACE,KAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GAAA,iBACnB,OAAQ,IAAI,KAAA,OAAJ,EAAM,SAAU,GAAA,kBAE1B,GACA,CAAC,UAAW,iBAVhB,GAAA,UAAA,GAcA,GAAA,QAAe,CACb,QAAO,GACP,UAAS,y9CC/BX,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KAEA,YACE,EACA,EACA,EAA2B,iHAErB,GAAO,GAAA,QAAM,oBAAoB,GACnB,MAAO,IAAQ,SAAf,CAAA,EAAA,GAA0B,CAAA,EAAM,GAAA,QAAK,UAAU,EAAK,WAA1B,SAAA,EAAA,oBAAkC,EAAA,mBAA1E,SAAW,EACX,EAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GAAA,iBACnB,EAAK,IAAI,KAAA,OAAJ,EAAM,KAAM,GAAA,QAAM,UAAU,IACrB,CAAA,EAAM,WAAW,OAAO,OAAO,QAC/C,CACE,KAAM,EAEN,GAAI,IAAQ,GAAA,QAAQ,QAAU,OAAY,EAC1C,QAAS,IAAQ,GAAA,QAAQ,QAAU,GAAI,YAAW,GAAM,OACxD,OAAQ,IAAQ,GAAA,QAAQ,QAAU,GAAA,gBAAkB,QAEtD,EACA,WATI,SAAY,EAAA,OAWlB,CAAA,EAAO,GAAA,QAAM,SAAS,EAAI,SApB5B,GAAA,aAAA,GAuBA,YACE,EACA,EACA,EAA2B,mHAErB,GAAa,GAAA,QAAM,qBAAqB,GAC1B,MAAO,IAAQ,SAAf,CAAA,EAAA,GAA0B,CAAA,EAAM,GAAA,QAAK,UAAU,EAAK,WAA1B,SAAA,EAAA,oBAAkC,EAAA,mBAA1E,SAAW,EACX,EAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GAAA,iBACnB,EAAK,EAAW,MAAM,EAAG,IACzB,EAAc,EAAW,MAAM,IACrB,CAAA,EAAM,WAAW,OAAO,OAAO,QAC7C,CAAE,KAAM,EAEN,GAAI,IAAQ,GAAA,QAAQ,QAAU,OAAY,EAC1C,QAAS,IAAQ,GAAA,QAAQ,QAAU,GAAI,YAAW,GAAM,OACxD,OAAQ,IAAQ,GAAA,QAAQ,QAAU,GAAA,gBAAkB,QAEtD,EACA,WARI,SAAU,EAAA,OAUhB,CAAA,EAAO,QApBT,GAAA,aAAA,GAuBA,YACE,EACA,EACA,EAA2B,iGAER,MAAA,CAAA,EAAM,GAAa,EAAK,EAAK,WAA1C,SAAa,EAAA,OACnB,CAAA,EAAO,GAAA,QAAM,eAAe,SAN9B,GAAA,QAAA,GASA,YACE,EACA,EACA,EAA2B,iGAEV,MAAA,CAAA,EAAM,GAAa,EAAK,EAAK,WAAxC,SAAW,EAAA,OACjB,CAAA,EAAO,GAAA,QAAM,YAAY,EAAU,UANrC,GAAA,QAAA,GAUA,YAAgC,EAAY,iGAC9B,MAAA,CAAA,EAAM,WAAW,OAAO,OAAO,UAAU,MAAO,WAAtD,SAAM,EAAA,OACZ,CAAA,EAAO,GAAA,QAAM,eAAe,SAF9B,GAAA,UAAA,GAKA,GAAA,QAAe,CACb,aAAY,GACZ,aAAY,GACZ,QAAO,GACP,QAAO,GACP,UAAS,+XChFX,GAAA,IAAA,KACA,GAAA,KAEA,GAAA,MACA,GAAA,MAEA,GAAA,QAAA,GAAA,GAAA,GACK,GAAA,SACA,GAAA,89CCRL,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KAEA,GAAA,KAEA,GAAA,UAAA,CAKE,WAAY,EAAa,EAAkB,CACzC,KAAK,IAAM,EACX,KAAK,MAAQ,EAGT,SAAA,UAAA,SAAN,UAAA,iGACmB,MAAA,CAAA,EAAM,GAAA,QAAI,WAAW,KAAK,IAAI,aAAc,KAAK,eAA5D,SAAW,EAAA,OACjB,CAAA,EAAO,GAAA,eAAe,UAGlB,EAAA,UAAA,QAAN,UAAA,iGACmB,MAAA,CAAA,EAAM,GAAA,QAAI,WAAW,KAAK,IAAI,YAAa,KAAK,eAA3D,SAAW,EAAA,OACjB,CAAA,EAAO,GAAA,eAAe,UAGlB,EAAA,UAAA,WAAN,SAAiB,EAAiB,EAAqB,qGAC/C,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GACxB,CAAA,EAAM,GAAA,QAAI,OAAO,EAAS,KAAK,eAChD,MADM,GAAW,EAAA,OACd,IAAa,KACd,CAAA,EAAO,GAEG,CAAA,EAAM,GAAA,QAAI,QAAQ,GAAA,QAAO,YAAY,YAA3C,SAAM,EAAA,OACZ,CAAA,EAAM,GAAA,QAAI,IAAI,EAAS,EAAK,KAAK,eAAjC,SAAA,OACA,CAAA,EAAO,SAGH,EAAA,UAAA,UAAN,SAAgB,EAAe,iGACjB,MAAA,CAAA,EAAM,GAAA,QAAI,OAAO,EAAS,KAAK,eAArC,SAAM,EAAA,OACZ,CAAA,EAAO,IAAQ,YAGX,EAAA,UAAA,UAAN,SAAgB,EAAe,oEAC7B,MAAA,CAAA,EAAO,GAAA,QAAI,GAAG,EAAS,KAAK,aAGxB,EAAA,UAAA,QAAN,UAAA,oEACE,MAAA,CAAA,EAAO,GAAA,QAAI,UAAU,KAAK,aAGtB,EAAA,UAAA,cAAN,SAAoB,EAAgB,EAAiB,EAAqB,mGAClE,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GAC7B,CAAA,EAAM,GAAA,QAAI,UAAU,EAAQ,GAAA,QAAO,YAAY,YAArD,SAAM,EAAA,OACZ,CAAA,EAAM,GAAA,QAAI,IAAI,EAAS,EAAK,KAAK,eAAjC,SAAA,iBAGI,EAAA,UAAA,cAAN,SAAoB,EAAiB,EAAqB,iGAC5C,MAAA,CAAA,EAAM,KAAK,WAAW,EAAS,WAArC,SAAM,EAAA,OACZ,CAAA,EAAO,GAAA,QAAI,UAAU,UAGjB,EAAA,UAAA,mBAAN,SAAyB,EAAa,EAAiB,EAAqB,qGACpE,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GAC7B,CAAA,EAAM,KAAK,WAAW,EAAS,WAArC,SAAM,EAAA,OACO,CAAA,EAAM,GAAA,QAAI,aAC3B,GAAA,QAAM,YAAY,EAAK,EAAU,UACjC,EACA,GAAA,QAAO,YAAY,YAHf,SAAa,EAAA,OAKnB,CAAA,EAAO,GAAA,QAAM,eAAe,UAGxB,EAAA,UAAA,mBAAN,SAAyB,EAAoB,EAAiB,EAAqB,qGAC3E,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GAC7B,CAAA,EAAM,KAAK,WAAW,EAAS,WAArC,SAAM,EAAA,OACK,CAAA,EAAM,GAAA,QAAI,aACzB,GAAA,QAAM,eAAe,GACrB,EACA,GAAA,QAAO,YAAY,YAHf,SAAW,EAAA,OAKjB,CAAA,EAAO,GAAA,QAAM,YAAY,EAAU,EAAU,iBAEjD,8iECnFA,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KACA,GAAA,KAEA,GAAA,SAAA,EAAA,CAAiC,GAAA,EAAA,GAAjC,YAAA,gDAEe,SAAA,KAAb,SAAkB,EAA0B,6GACpC,SAAM,GAAA,QAAO,UAAS,GAAA,GAAA,GACtB,GAAY,IAAG,CACnB,KAAM,GAAA,aAAa,OAGb,EAA2D,EAAG,QAArD,EAAkD,EAAG,QAA5C,EAAyC,EAAG,UAAjC,EAA8B,EAAG,YAApB,EAAiB,EAAG,aAChE,EAAQ,GAAA,QAAI,YAAY,GAE9B,CAAA,EAAM,GAAA,QAAI,qBAAqB,EAAa,UAAA,CAAM,MAChD,IAAA,QAAK,YAAY,EAAS,EAAS,GAAA,OAAO,OACzC,WAFH,SAAA,OAGA,CAAA,EAAM,GAAA,QAAI,qBAAqB,EAAc,UAAA,CAAM,MACjD,IAAA,QAAK,YAAY,EAAS,EAAS,GAAA,OAAO,QACzC,WAFH,SAAA,OAIA,CAAA,EAAO,GAAI,GAAY,EAAK,UAIxB,EAAA,UAAA,KAAN,SAAW,EAAU,EAAqB,uGAClC,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GACxB,CAAA,EAAM,KAAK,mBAAtB,SAAW,EAAA,OAEV,EAAA,GAAA,GAAA,SAAM,eAAe,CAAA,EAAM,GAAA,QAAW,KAC3C,EACA,EAAS,WACT,EAAU,kBAHZ,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,CAAqB,EAAA,gBAOxB,EAAA,UAAA,OAAN,SACE,EACA,EACA,EACA,EAAqB,0EAEf,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GAEzC,CAAA,EAAO,GAAA,QAAW,OAChB,EACA,EACA,EACA,EAAU,SACV,EAAU,eAIR,EAAA,UAAA,QAAN,SACE,EACA,EACA,EAAqB,qGAEf,SAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GAElC,EAAA,GAAA,GAAA,SAAM,eAAe,CAAA,EAAM,GAAA,QAAW,QAC3C,EACA,EACA,EAAU,SACV,EAAU,iBAJZ,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,CAAqB,EAAA,gBAQxB,EAAA,UAAA,QAAN,SACE,EACA,EACA,EAAqB,uGAEL,MAAA,CAAA,EAAM,KAAK,kBAArB,SAAU,EAAA,OACV,EAAY,GAAA,QAAO,MAAM,KAAK,IAAK,GAElC,EAAA,GAAA,GAAA,SAAM,YACX,CAAA,EAAM,GAAA,QAAW,QACf,EACA,EAAQ,oBAHZ,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,CACL,EAAA,OAIA,EAAU,kBAIR,EAAA,UAAA,cAAN,UAAA,iGACkB,MAAA,CAAA,EAAM,KAAK,kBAArB,SAAU,EAAA,OAChB,CAAA,EAAO,GAAA,QAAW,aAAa,UAG3B,EAAA,UAAA,eAAN,UAAA,iGACmB,MAAA,CAAA,EAAM,KAAK,mBAAtB,SAAW,EAAA,OACjB,CAAA,EAAO,GAAA,QAAW,aAAa,UAEnC,GA3FiC,GAAA,SAApB,GAAA,YAAA,GA6Fb,GAAA,QAAe,8XCrGf,GAAA,IAAA,KACA,GAAA,KACA,GAAA,KAEA,GAAA,MACA,GAAA,MACA,GAAA,MAEA,GAAA,QAAA,GAAA,GAAA,GAAA,GACK,GAAA,SACA,GAAA,SACA,GAAA,+jECXL,AAAC,UAAU,EAAQ,CACjB,MAAO,aAAe,UACpB,MACE,IACC,GAAO,eAAe,EAAO,UAAW,MAAO,CAC9C,aAAc,GACd,IAAK,IACH,MAER,YAAe,CACb,GAAI,GAAS,MAAQ,KACrB,EAAO,WAAa,EACpB,MAAO,GAAO,UAAU,OAE1B,yVCdF,AAMA,AAAC,UAAS,EAAE,CAA4D,EAAA,QAAe,MAAgP,UAAU,CAA2B,MAAQ,YAAW,EAAE,EAAE,EAAE,CAAC,WAAW,GAAE,GAAE,CAAC,GAAG,CAAC,EAAE,IAAG,CAAC,GAAG,CAAC,EAAE,IAAG,CAAC,GAAI,IAAE,MAAO,IAAS,YAAY,EAAQ,GAAG,CAAC,IAAG,GAAE,MAAO,IAAE,GAAE,IAAI,GAAG,EAAE,MAAO,GAAE,GAAE,IAAI,GAAI,IAAE,GAAI,OAAM,uBAAuB,GAAE,KAAK,KAAO,IAAE,KAAK,mBAAoB,GAAG,GAAI,IAAE,EAAE,IAAG,CAAC,QAAQ,IAAI,EAAE,IAAG,GAAG,KAAK,GAAE,QAAQ,SAAS,GAAE,CAAC,GAAI,IAAE,EAAE,IAAG,GAAG,IAAG,MAAO,GAAE,IAAI,KAAI,GAAE,GAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,MAAO,GAAE,IAAG,QAAkD,OAAtC,GAAE,MAAO,IAAS,YAAY,EAAgB,GAAE,EAAE,GAAE,EAAE,OAAO,KAAI,EAAE,EAAE,KAAI,MAAO,IAAI,CAAC,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CACr1B,AAAC,UAAU,EAAO,CAElB,GAAI,GAAW,EAAO,kBAAoB,EAAO,uBAE7C,EAGF,GAAI,EAAU,CACZ,GAAI,IAAS,EACT,GAAW,GAAI,GAAS,IACxB,GAAU,EAAO,SAAS,eAAe,IAC7C,GAAS,QAAQ,GAAS,CACxB,cAAe,KAEjB,EAAgB,UAAY,CAC1B,GAAQ,KAAQ,GAAS,EAAE,GAAS,WAE7B,CAAC,EAAO,cAAgB,MAAO,GAAO,gBAAmB,YAAa,CAC/E,GAAI,IAAU,GAAI,GAAO,eACzB,GAAQ,MAAM,UAAY,GAC1B,EAAgB,UAAY,CAC1B,GAAQ,MAAM,YAAY,QAEvB,AAAI,YAAc,IAAU,sBAAwB,GAAO,SAAS,cAAc,UACvF,EAAgB,UAAY,CAI1B,GAAI,IAAW,EAAO,SAAS,cAAc,UAC7C,GAAS,mBAAqB,UAAY,CACxC,KAEA,GAAS,mBAAqB,KAC9B,GAAS,WAAW,YAAY,IAChC,GAAW,MAEb,EAAO,SAAS,gBAAgB,YAAY,KAG9C,EAAgB,UAAY,CAC1B,WAAW,GAAU,IAK3B,GAAI,IACA,GAAQ,GAEZ,aAAoB,CAClB,GAAW,GAGX,OAFI,IAAG,GACH,GAAM,GAAM,OACT,IAAK,CAIV,IAHA,GAAW,GACX,GAAQ,GACR,GAAI,GACG,EAAE,GAAI,IACX,GAAS,MAEX,GAAM,GAAM,OAEd,GAAW,GAGb,EAAO,QAAU,GACjB,YAAmB,GAAM,CACvB,AAAI,GAAM,KAAK,MAAU,GAAK,CAAC,IAC7B,OAID,KAAK,KAAK,MAAO,IAAW,YAAc,EAAS,MAAO,OAAS,YAAc,KAAO,MAAO,SAAW,YAAc,OAAS,KAClI,IAAI,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CAEzC,GAAI,GAAY,EAAQ,GAGxB,YAAoB,EAEpB,GAAI,GAAW,GAEX,GAAW,CAAC,YACZ,GAAY,CAAC,aACb,GAAU,CAAC,WAEf,EAAO,QAAU,GAEjB,YAAiB,GAAU,CACzB,GAAI,MAAO,KAAa,WACtB,KAAM,IAAI,WAAU,+BAEtB,KAAK,MAAQ,GACb,KAAK,MAAQ,GACb,KAAK,QAAU,OACX,KAAa,GACf,GAAsB,KAAM,IAIhC,GAAQ,UAAU,MAAW,SAAU,GAAY,CACjD,MAAO,MAAK,KAAK,KAAM,KAEzB,GAAQ,UAAU,KAAO,SAAU,GAAa,GAAY,CAC1D,GAAI,MAAO,KAAgB,YAAc,KAAK,QAAU,IACtD,MAAO,KAAe,YAAc,KAAK,QAAU,GACnD,MAAO,MAET,GAAI,IAAU,GAAI,MAAK,YAAY,GACnC,GAAI,KAAK,QAAU,GAAS,CAC1B,GAAI,IAAW,KAAK,QAAU,GAAY,GAAc,GACxD,GAAO,GAAS,GAAU,KAAK,aAE/B,MAAK,MAAM,KAAK,GAAI,IAAU,GAAS,GAAa,KAGtD,MAAO,KAET,YAAmB,GAAS,GAAa,GAAY,CACnD,KAAK,QAAU,GACX,MAAO,KAAgB,YACzB,MAAK,YAAc,GACnB,KAAK,cAAgB,KAAK,oBAExB,MAAO,KAAe,YACxB,MAAK,WAAa,GAClB,KAAK,aAAe,KAAK,mBAG7B,GAAU,UAAU,cAAgB,SAAU,GAAO,CACnD,EAAS,QAAQ,KAAK,QAAS,KAEjC,GAAU,UAAU,mBAAqB,SAAU,GAAO,CACxD,GAAO,KAAK,QAAS,KAAK,YAAa,KAEzC,GAAU,UAAU,aAAe,SAAU,GAAO,CAClD,EAAS,OAAO,KAAK,QAAS,KAEhC,GAAU,UAAU,kBAAoB,SAAU,GAAO,CACvD,GAAO,KAAK,QAAS,KAAK,WAAY,KAGxC,YAAgB,GAAS,GAAM,GAAO,CACpC,EAAU,UAAY,CACpB,GAAI,IACJ,GAAI,CACF,GAAc,GAAK,UACZ,GAAP,CACA,MAAO,GAAS,OAAO,GAAS,IAElC,AAAI,KAAgB,GAClB,EAAS,OAAO,GAAS,GAAI,WAAU,uCAEvC,EAAS,QAAQ,GAAS,MAKhC,EAAS,QAAU,SAAU,GAAM,GAAO,CACxC,GAAI,IAAS,GAAS,GAAS,IAC/B,GAAI,GAAO,SAAW,QACpB,MAAO,GAAS,OAAO,GAAM,GAAO,OAEtC,GAAI,IAAW,GAAO,MAEtB,GAAI,GACF,GAAsB,GAAM,QACvB,CACL,GAAK,MAAQ,GACb,GAAK,QAAU,GAGf,OAFI,IAAI,GACJ,GAAM,GAAK,MAAM,OACd,EAAE,GAAI,IACX,GAAK,MAAM,IAAG,cAAc,IAGhC,MAAO,KAET,EAAS,OAAS,SAAU,GAAM,GAAO,CACvC,GAAK,MAAQ,GACb,GAAK,QAAU,GAGf,OAFI,IAAI,GACJ,GAAM,GAAK,MAAM,OACd,EAAE,GAAI,IACX,GAAK,MAAM,IAAG,aAAa,IAE7B,MAAO,KAGT,YAAiB,GAAK,CAEpB,GAAI,IAAO,IAAO,GAAI,KACtB,GAAI,IAAQ,OAAO,KAAQ,UAAY,MAAO,KAAQ,aAAe,MAAO,KAAS,WACnF,MAAO,WAAoB,CACzB,GAAK,MAAM,GAAK,YAKtB,YAA+B,GAAM,GAAU,CAE7C,GAAI,IAAS,GACb,YAAiB,GAAO,CACtB,AAAI,IAGJ,IAAS,GACT,EAAS,OAAO,GAAM,KAGxB,YAAmB,GAAO,CACxB,AAAI,IAGJ,IAAS,GACT,EAAS,QAAQ,GAAM,KAGzB,aAAuB,CACrB,GAAS,GAAW,IAGtB,GAAI,IAAS,GAAS,IACtB,AAAI,GAAO,SAAW,SACpB,GAAQ,GAAO,OAInB,YAAkB,GAAM,GAAO,CAC7B,GAAI,IAAM,GACV,GAAI,CACF,GAAI,MAAQ,GAAK,IACjB,GAAI,OAAS,gBACN,GAAP,CACA,GAAI,OAAS,QACb,GAAI,MAAQ,GAEd,MAAO,IAGT,GAAQ,QAAU,GAClB,YAAiB,GAAO,CACtB,MAAI,cAAiB,MACZ,GAEF,EAAS,QAAQ,GAAI,MAAK,GAAW,IAG9C,GAAQ,OAAS,GACjB,YAAgB,GAAQ,CACtB,GAAI,IAAU,GAAI,MAAK,GACvB,MAAO,GAAS,OAAO,GAAS,IAGlC,GAAQ,IAAM,GACd,YAAa,GAAU,CACrB,GAAI,IAAO,KACX,GAAI,OAAO,UAAU,SAAS,KAAK,MAAc,iBAC/C,MAAO,MAAK,OAAO,GAAI,WAAU,qBAGnC,GAAI,IAAM,GAAS,OACf,GAAS,GACb,GAAI,CAAC,GACH,MAAO,MAAK,QAAQ,IAQtB,OALI,IAAS,GAAI,OAAM,IACnB,GAAW,EACX,GAAI,GACJ,GAAU,GAAI,MAAK,GAEhB,EAAE,GAAI,IACX,GAAY,GAAS,IAAI,IAE3B,MAAO,IACP,YAAqB,GAAO,GAAG,CAC7B,GAAK,QAAQ,IAAO,KAAK,GAAgB,SAAU,GAAO,CACxD,AAAK,IACH,IAAS,GACT,EAAS,OAAO,GAAS,OAG7B,YAAwB,GAAU,CAChC,GAAO,IAAK,GACR,EAAE,KAAa,IAAO,CAAC,IACzB,IAAS,GACT,EAAS,QAAQ,GAAS,OAMlC,GAAQ,KAAO,GACf,YAAc,GAAU,CACtB,GAAI,IAAO,KACX,GAAI,OAAO,UAAU,SAAS,KAAK,MAAc,iBAC/C,MAAO,MAAK,OAAO,GAAI,WAAU,qBAGnC,GAAI,IAAM,GAAS,OACf,GAAS,GACb,GAAI,CAAC,GACH,MAAO,MAAK,QAAQ,IAMtB,OAHI,IAAI,GACJ,GAAU,GAAI,MAAK,GAEhB,EAAE,GAAI,IACX,GAAS,GAAS,KAEpB,MAAO,IACP,YAAkB,GAAO,CACvB,GAAK,QAAQ,IAAO,KAAK,SAAU,GAAU,CAC3C,AAAK,IACH,IAAS,GACT,EAAS,QAAQ,GAAS,MAE3B,SAAU,GAAO,CAClB,AAAK,IACH,IAAS,GACT,EAAS,OAAO,GAAS,UAM/B,CAAC,IAAI,IAAI,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CAC9C,AAAC,UAAU,EAAO,CAElB,AAAI,MAAO,GAAO,SAAY,YAC5B,GAAO,QAAU,EAAQ,MAGxB,KAAK,KAAK,MAAO,IAAW,YAAc,EAAS,MAAO,OAAS,YAAc,KAAO,MAAO,SAAW,YAAc,OAAS,KAClI,CAAC,IAAI,IAAI,EAAE,CAAC,SAAS,EAAQ,EAAO,EAAQ,CAG9C,GAAI,GAAU,MAAO,SAAW,YAAc,MAAO,QAAO,UAAa,SAAW,SAAU,EAAK,CAAE,MAAO,OAAO,IAAS,SAAU,EAAK,CAAE,MAAO,IAAO,MAAO,SAAW,YAAc,EAAI,cAAgB,QAAU,IAAQ,OAAO,UAAY,SAAW,MAAO,IAEtQ,WAAyB,EAAU,EAAa,CAAE,GAAI,CAAE,aAAoB,IAAgB,KAAM,IAAI,WAAU,qCAEhH,YAAkB,CAEd,GAAI,CACA,GAAI,MAAO,YAAc,YACrB,MAAO,WAEX,GAAI,MAAO,kBAAoB,YAC3B,MAAO,iBAEX,GAAI,MAAO,eAAiB,YACxB,MAAO,cAEX,GAAI,MAAO,aAAe,YACtB,MAAO,YAEX,GAAI,MAAO,cAAgB,YACvB,MAAO,mBAEN,EAAP,CACE,QAIR,GAAI,IAAM,IAEV,aAA4B,CACxB,GAAI,CAGA,GAAI,CAAC,GACD,MAAO,GAMX,GAAI,GAAW,MAAO,eAAiB,aAAe,4BAA4B,KAAK,UAAU,YAAc,CAAC,SAAS,KAAK,UAAU,YAAc,CAAC,aAAa,KAAK,UAAU,UAE/K,EAAW,MAAO,QAAU,YAAc,MAAM,WAAW,QAAQ,kBAAoB,GAI3F,MAAQ,EAAC,GAAY,IAAa,MAAO,YAAc,aAKvD,MAAO,cAAgB,kBAClB,EAAP,CACE,MAAO,IAUf,YAAoB,EAAO,EAAY,CAEnC,EAAQ,GAAS,GACjB,EAAa,GAAc,GAC3B,GAAI,CACA,MAAO,IAAI,MAAK,EAAO,SAClB,EAAP,CACE,GAAI,EAAE,OAAS,YACX,KAAM,GAIV,OAFI,GAAU,MAAO,cAAgB,YAAc,YAAc,MAAO,gBAAkB,YAAc,cAAgB,MAAO,iBAAmB,YAAc,eAAiB,kBAC7K,EAAU,GAAI,GACT,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EACnC,EAAQ,OAAO,EAAM,IAEzB,MAAO,GAAQ,QAAQ,EAAW,OAM1C,AAAI,MAAO,UAAY,aAGnB,EAAQ,GAEZ,GAAI,IAAY,QAEhB,YAAyB,EAAS,EAAU,CACxC,AAAI,GACA,EAAQ,KAAK,SAAU,EAAQ,CAC3B,EAAS,KAAM,IAChB,SAAU,EAAO,CAChB,EAAS,KAKrB,YAA6B,EAAS,EAAU,EAAe,CAC3D,AAAI,MAAO,IAAa,YACpB,EAAQ,KAAK,GAGb,MAAO,IAAkB,YACzB,EAAQ,MAAS,GAIzB,YAAsB,EAAK,CAEvB,MAAI,OAAO,IAAQ,UACf,SAAQ,KAAK,EAAM,2CACnB,EAAM,OAAO,IAGV,EAGX,aAAuB,CACnB,GAAI,UAAU,QAAU,MAAO,WAAU,UAAU,OAAS,IAAO,WAC/D,MAAO,WAAU,UAAU,OAAS,GAO5C,GAAI,IAA4B,mCAC5B,GAAgB,OAChB,GAAa,GACb,GAAW,OAAO,UAAU,SAG5B,GAAY,WACZ,GAAa,YAOjB,YAAiC,EAAK,CAIlC,OAHI,GAAS,EAAI,OACb,EAAM,GAAI,aAAY,GACtB,EAAM,GAAI,YAAW,GAChB,EAAI,EAAG,EAAI,EAAQ,IACxB,EAAI,GAAK,EAAI,WAAW,GAE5B,MAAO,GAkBX,YAAyC,EAAK,CAC1C,MAAO,IAAI,IAAU,SAAU,EAAS,CACpC,GAAI,GAAM,EAAI,YAAY,GAA2B,IACjD,EAAO,GAAW,CAAC,KACvB,EAAI,YAAY,IAA2B,IAAI,EAAM,OAErD,EAAI,QAAU,SAAU,EAAG,CAGvB,EAAE,iBACF,EAAE,kBACF,EAAQ,KAGZ,EAAI,WAAa,UAAY,CACzB,GAAI,GAAgB,UAAU,UAAU,MAAM,iBAC1C,EAAc,UAAU,UAAU,MAAM,UAG5C,EAAQ,GAAe,CAAC,GAAiB,SAAS,EAAc,GAAI,KAAO,OAEhF,MAAS,UAAY,CACpB,MAAO,KAIf,YAA2B,EAAK,CAC5B,MAAI,OAAO,KAAkB,UAClB,GAAU,QAAQ,IAEtB,GAAgC,GAAK,KAAK,SAAU,EAAO,CAC9D,UAAgB,EACT,KAIf,YAAyB,EAAQ,CAC7B,GAAI,GAAY,GAAW,EAAO,MAG9B,EAAoB,GAExB,EAAkB,QAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACjE,EAAkB,QAAU,EAC5B,EAAkB,OAAS,IAI/B,EAAU,mBAAmB,KAAK,GAGlC,AAAK,EAAU,QAGX,EAAU,QAAU,EAAU,QAAQ,KAAK,UAAY,CACnD,MAAO,GAAkB,UAH7B,EAAU,QAAU,EAAkB,QAQ9C,YAA2B,EAAQ,CAC/B,GAAI,GAAY,GAAW,EAAO,MAG9B,EAAoB,EAAU,mBAAmB,MAIrD,GAAI,EACA,SAAkB,UACX,EAAkB,QAIjC,YAA0B,EAAQ,EAAK,CACnC,GAAI,GAAY,GAAW,EAAO,MAG9B,EAAoB,EAAU,mBAAmB,MAIrD,GAAI,EACA,SAAkB,OAAO,GAClB,EAAkB,QAIjC,YAAwB,EAAQ,EAAe,CAC3C,MAAO,IAAI,IAAU,SAAU,EAAS,EAAQ,CAG5C,GAFA,GAAW,EAAO,MAAQ,GAAW,EAAO,OAAS,KAEjD,EAAO,GACP,GAAI,EACA,GAAgB,GAChB,EAAO,GAAG,YAEV,OAAO,GAAQ,EAAO,IAI9B,GAAI,GAAS,CAAC,EAAO,MAErB,AAAI,GACA,EAAO,KAAK,EAAO,SAGvB,GAAI,GAAU,GAAI,KAAK,MAAM,GAAK,GAElC,AAAI,GACA,GAAQ,gBAAkB,SAAU,GAAG,CACnC,GAAI,IAAK,EAAQ,OACjB,GAAI,CACA,GAAG,kBAAkB,EAAO,WACxB,GAAE,YAAc,GAEhB,GAAG,kBAAkB,UAEpB,GAAP,CACE,GAAI,GAAG,OAAS,kBACZ,QAAQ,KAAK,iBAAmB,EAAO,KAAO,oCAA2C,GAAE,WAAa,eAAiB,GAAE,WAAa,sBAAwB,EAAO,UAAY,yBAEnL,MAAM,OAMtB,EAAQ,QAAU,SAAU,GAAG,CAC3B,GAAE,iBACF,EAAO,EAAQ,QAGnB,EAAQ,UAAY,UAAY,CAC5B,EAAQ,EAAQ,QAChB,GAAkB,MAK9B,YAAgC,EAAQ,CACpC,MAAO,IAAe,EAAQ,IAGlC,YAAgC,EAAQ,CACpC,MAAO,IAAe,EAAQ,IAGlC,YAA0B,EAAQ,EAAgB,CAC9C,GAAI,CAAC,EAAO,GACR,MAAO,GAGX,GAAI,GAAa,CAAC,EAAO,GAAG,iBAAiB,SAAS,EAAO,WACzD,EAAc,EAAO,QAAU,EAAO,GAAG,QACzC,EAAY,EAAO,QAAU,EAAO,GAAG,QAY3C,GAVI,GAGI,GAAO,UAAY,GACnB,QAAQ,KAAK,iBAAmB,EAAO,KAAO,sCAA6C,EAAO,GAAG,QAAU,eAAiB,EAAO,QAAU,KAGrJ,EAAO,QAAU,EAAO,GAAG,SAG3B,GAAa,EAAY,CAIzB,GAAI,EAAY,CACZ,GAAI,GAAa,EAAO,GAAG,QAAU,EACrC,AAAI,EAAa,EAAO,SACpB,GAAO,QAAU,GAIzB,MAAO,GAGX,MAAO,GAIX,YAAqB,EAAM,CACvB,MAAO,IAAI,IAAU,SAAU,EAAS,EAAQ,CAC5C,GAAI,GAAS,GAAI,YACjB,EAAO,QAAU,EACjB,EAAO,UAAY,SAAU,EAAG,CAC5B,GAAI,GAAS,KAAK,EAAE,OAAO,QAAU,IACrC,EAAQ,CACJ,4BAA6B,GAC7B,KAAM,EACN,KAAM,EAAK,QAGnB,EAAO,mBAAmB,KAKlC,YAAqB,EAAa,CAC9B,GAAI,GAAY,GAAwB,KAAK,EAAY,OACzD,MAAO,IAAW,CAAC,GAAY,CAAE,KAAM,EAAY,OAIvD,YAAwB,EAAO,CAC3B,MAAO,IAAS,EAAM,4BAO1B,YAAqB,EAAU,CAC3B,GAAI,GAAO,KAEP,EAAU,EAAK,aAAa,KAAK,UAAY,CAC7C,GAAI,GAAY,GAAW,EAAK,QAAQ,MAExC,GAAI,GAAa,EAAU,QACvB,MAAO,GAAU,UAIzB,UAAoB,EAAS,EAAU,GAChC,EAMX,YAAuB,EAAQ,CAC3B,GAAgB,GAKhB,OAHI,GAAY,GAAW,EAAO,MAC9B,EAAU,EAAU,QAEf,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAK,CACrC,GAAI,GAAS,EAAQ,GACrB,AAAI,EAAO,QAAQ,IACf,GAAO,QAAQ,GAAG,QAClB,EAAO,QAAQ,GAAK,MAG5B,SAAO,GAAK,KAEL,GAAuB,GAAQ,KAAK,SAAU,EAAI,CAErD,MADA,GAAO,GAAK,EACR,GAAiB,GAEV,GAAuB,GAE3B,IACR,KAAK,SAAU,EAAI,CAGlB,EAAO,GAAK,EAAU,GAAK,EAC3B,OAAS,IAAI,EAAG,GAAI,EAAQ,OAAQ,KAChC,EAAQ,IAAG,QAAQ,GAAK,IAE7B,MAAS,SAAU,EAAK,CACvB,SAAiB,EAAQ,GACnB,IAMd,YAA2B,EAAQ,EAAM,EAAU,EAAS,CACxD,AAAI,IAAY,QACZ,GAAU,GAGd,GAAI,CACA,GAAI,GAAK,EAAO,GAAG,YAAY,EAAO,UAAW,GACjD,EAAS,KAAM,SACV,EAAP,CACE,GAAI,EAAU,GAAM,EAAC,EAAO,IAAM,EAAI,OAAS,qBAAuB,EAAI,OAAS,iBAC/E,MAAO,IAAU,UAAU,KAAK,UAAY,CACxC,GAAI,CAAC,EAAO,IAAM,EAAI,OAAS,iBAAmB,CAAC,EAAO,GAAG,iBAAiB,SAAS,EAAO,YAAc,EAAO,SAAW,EAAO,GAAG,QAEpI,MAAI,GAAO,IACP,GAAO,QAAU,EAAO,GAAG,QAAU,GAGlC,GAAuB,KAEnC,KAAK,UAAY,CAChB,MAAO,IAAc,GAAQ,KAAK,UAAY,CAC1C,GAAkB,EAAQ,EAAM,EAAU,EAAU,OAEzD,MAAS,GAGhB,EAAS,IAIjB,aAA2B,CACvB,MAAO,CAEH,QAAS,GAET,GAAI,KAEJ,QAAS,KAET,mBAAoB,IAM5B,YAAsB,EAAS,CAC3B,GAAI,GAAO,KACP,EAAS,CACT,GAAI,MAGR,GAAI,EACA,OAAS,KAAK,GACV,EAAO,GAAK,EAAQ,GAK5B,GAAI,GAAY,GAAW,EAAO,MAGlC,AAAK,GACD,GAAY,KAEZ,GAAW,EAAO,MAAQ,GAI9B,EAAU,QAAQ,KAAK,GAGlB,EAAK,YACN,GAAK,WAAa,EAAK,MACvB,EAAK,MAAQ,IAIjB,GAAI,GAAe,GAEnB,aAAwB,CAGpB,MAAO,IAAU,UAGrB,OAAS,IAAI,EAAG,GAAI,EAAU,QAAQ,OAAQ,KAAK,CAC/C,GAAI,IAAS,EAAU,QAAQ,IAC/B,AAAI,KAAW,GAEX,EAAa,KAAK,GAAO,aAAa,MAAS,KAKvD,GAAI,IAAU,EAAU,QAAQ,MAAM,GAItC,MAAO,IAAU,IAAI,GAAc,KAAK,UAAY,CAChD,SAAO,GAAK,EAAU,GAEf,GAAuB,KAC/B,KAAK,SAAU,GAAI,CAElB,MADA,GAAO,GAAK,GACR,GAAiB,EAAQ,EAAK,eAAe,SAEtC,GAAuB,GAE3B,KACR,KAAK,SAAU,GAAI,CAClB,EAAO,GAAK,EAAU,GAAK,GAC3B,EAAK,QAAU,EAEf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAS,GAAQ,IACrB,AAAI,KAAW,GAEX,IAAO,QAAQ,GAAK,EAAO,GAC3B,GAAO,QAAQ,QAAU,EAAO,YAMhD,YAAiB,EAAK,EAAU,CAC5B,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,GAAK,GAAa,CACnE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,IAAI,GAEpB,GAAI,UAAY,UAAY,CACxB,GAAI,IAAQ,GAAI,OAChB,AAAI,KAAU,QACV,IAAQ,MAER,GAAe,KACf,IAAQ,GAAY,KAExB,EAAQ,KAGZ,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAIX,YAAiB,EAAU,EAAU,CACjC,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,GAAK,GAAa,CACnE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,aACZ,GAAkB,EAEtB,GAAI,UAAY,UAAY,CACxB,GAAI,IAAS,GAAI,OAEjB,GAAI,GAAQ,CACR,GAAI,IAAQ,GAAO,MACnB,AAAI,GAAe,KACf,IAAQ,GAAY,KAExB,GAAI,IAAS,EAAS,GAAO,GAAO,IAAK,MAKzC,AAAI,KAAW,OACX,EAAQ,IAER,GAAO,eAGX,MAIR,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAElB,EAGX,YAAiB,EAAK,EAAO,EAAU,CACnC,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,GAAI,IAAU,SAAU,EAAS,GAAQ,CACnD,GAAI,IACJ,EAAK,QAAQ,KAAK,UAAY,CAE1B,MADA,IAAS,EAAK,QACV,GAAS,KAAK,KAAW,gBAClB,GAAkB,GAAO,IAAI,KAAK,SAAU,GAAa,CAC5D,MAAI,IACO,EAEJ,GAAY,KAGpB,IACR,KAAK,SAAU,GAAO,CACrB,GAAkB,EAAK,QAAS,GAAY,SAAU,GAAK,GAAa,CACpE,GAAI,GACA,MAAO,IAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAMjD,AAAI,KAAU,MACV,IAAQ,QAGZ,GAAI,IAAM,GAAM,IAAI,GAAO,GAE3B,GAAY,WAAa,UAAY,CAOjC,AAAI,KAAU,QACV,IAAQ,MAGZ,EAAQ,KAEZ,GAAY,QAAU,GAAY,QAAU,UAAY,CACpD,GAAI,IAAM,GAAI,MAAQ,GAAI,MAAQ,GAAI,YAAY,MAClD,GAAO,WAEN,GAAP,CACE,GAAO,SAGhB,MAAS,MAGhB,UAAgB,EAAS,GAClB,EAGX,YAAoB,EAAK,EAAU,CAC/B,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAY,SAAU,GAAK,GAAa,CACpE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAM7C,GAAM,GAAM,OAAU,GAC1B,GAAY,WAAa,UAAY,CACjC,KAGJ,GAAY,QAAU,UAAY,CAC9B,EAAO,GAAI,QAKf,GAAY,QAAU,UAAY,CAC9B,GAAI,IAAM,GAAI,MAAQ,GAAI,MAAQ,GAAI,YAAY,MAClD,EAAO,WAEN,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAe,EAAU,CACrB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAY,SAAU,EAAK,GAAa,CACpE,GAAI,EACA,MAAO,GAAO,GAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,QAEhB,GAAY,WAAa,UAAY,CACjC,KAGJ,GAAY,QAAU,GAAY,QAAU,UAAY,CACpD,GAAI,IAAM,GAAI,MAAQ,GAAI,MAAQ,GAAI,YAAY,MAClD,EAAO,WAEN,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAgB,EAAU,CACtB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,EAAK,GAAa,CACnE,GAAI,EACA,MAAO,GAAO,GAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,QAEhB,GAAI,UAAY,UAAY,CACxB,EAAQ,GAAI,SAGhB,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAa,EAAG,EAAU,CACtB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,GAAI,EAAI,EAAG,CACP,EAAQ,MAER,OAGJ,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,GAAK,GAAa,CACnE,GAAI,GACA,MAAO,GAAO,IAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAW,GACX,GAAM,GAAM,aAEhB,GAAI,UAAY,UAAY,CACxB,GAAI,IAAS,GAAI,OACjB,GAAI,CAAC,GAAQ,CAET,EAAQ,MAER,OAGJ,AAAI,IAAM,GAKD,GAFL,EAAQ,GAAO,KAKX,IAAW,GACX,GAAO,QAAQ,KAQ3B,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,WAAc,EAAU,CACpB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAkB,EAAK,QAAS,GAAW,SAAU,EAAK,GAAa,CACnE,GAAI,EACA,MAAO,GAAO,GAGlB,GAAI,CACA,GAAI,IAAQ,GAAY,YAAY,EAAK,QAAQ,WAC7C,GAAM,GAAM,aACZ,GAAO,GAEX,GAAI,UAAY,UAAY,CACxB,GAAI,IAAS,GAAI,OAEjB,GAAI,CAAC,GAAQ,CACT,EAAQ,IACR,OAGJ,GAAK,KAAK,GAAO,KACjB,GAAO,YAGX,GAAI,QAAU,UAAY,CACtB,EAAO,GAAI,cAEV,GAAP,CACE,EAAO,SAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAsB,EAAS,EAAU,CACrC,EAAW,GAAY,MAAM,KAAM,WAEnC,GAAI,GAAgB,KAAK,SACzB,EAAU,MAAO,IAAY,YAAc,GAAW,GACjD,EAAQ,MACT,GAAQ,KAAO,EAAQ,MAAQ,EAAc,KAC7C,EAAQ,UAAY,EAAQ,WAAa,EAAc,WAG3D,GAAI,GAAO,KACP,EACJ,GAAI,CAAC,EAAQ,KACT,EAAU,GAAU,OAAO,yBACxB,CACH,GAAI,GAAc,EAAQ,OAAS,EAAc,MAAQ,EAAK,QAAQ,GAElE,GAAY,EAAc,GAAU,QAAQ,EAAK,QAAQ,IAAM,GAAuB,GAAS,KAAK,SAAU,GAAI,CAClH,GAAI,IAAY,GAAW,EAAQ,MAC/B,GAAU,GAAU,QACxB,GAAU,GAAK,GACf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAChC,GAAQ,IAAG,QAAQ,GAAK,GAE5B,MAAO,MAGX,AAAK,EAAQ,UA6CT,EAAU,GAAU,KAAK,SAAU,GAAI,CACnC,GAAI,EAAC,GAAG,iBAAiB,SAAS,EAAQ,WAI1C,IAAI,IAAa,GAAG,QAAU,EAE9B,GAAgB,GAEhB,GAAI,IAAY,GAAW,EAAQ,MAC/B,GAAU,GAAU,QAExB,GAAG,QACH,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAS,GAAQ,IACrB,GAAO,QAAQ,GAAK,KACpB,GAAO,QAAQ,QAAU,GAG7B,GAAI,IAAoB,GAAI,IAAU,SAAU,GAAS,GAAQ,CAC7D,GAAI,IAAM,GAAI,KAAK,EAAQ,KAAM,IAEjC,GAAI,QAAU,SAAU,GAAK,CACzB,GAAI,IAAK,GAAI,OACb,GAAG,QACH,GAAO,KAGX,GAAI,gBAAkB,UAAY,CAC9B,GAAI,IAAK,GAAI,OACb,GAAG,kBAAkB,EAAQ,YAGjC,GAAI,UAAY,UAAY,CACxB,GAAI,IAAK,GAAI,OACb,GAAG,QACH,GAAQ,OAIhB,MAAO,IAAkB,KAAK,SAAU,GAAI,CACxC,GAAU,GAAK,GACf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAW,GAAQ,IACvB,GAAS,QAAQ,GAAK,GACtB,GAAkB,GAAS,YAEhC,MAAS,SAAU,GAAK,CACvB,KAAC,IAAiB,EAAS,KAAQ,GAAU,WAAW,MAAS,UAAY,IACvE,QA7Fd,EAAU,GAAU,KAAK,SAAU,GAAI,CACnC,GAAgB,GAEhB,GAAI,IAAY,GAAW,EAAQ,MAC/B,GAAU,GAAU,QAExB,GAAG,QACH,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAS,GAAQ,IACrB,GAAO,QAAQ,GAAK,KAGxB,GAAI,IAAgB,GAAI,IAAU,SAAU,GAAS,GAAQ,CACzD,GAAI,IAAM,GAAI,eAAe,EAAQ,MAErC,GAAI,QAAU,GAAI,UAAY,SAAU,GAAK,CACzC,GAAI,IAAK,GAAI,OACb,AAAI,IACA,GAAG,QAEP,GAAO,KAGX,GAAI,UAAY,UAAY,CACxB,GAAI,IAAK,GAAI,OACb,AAAI,IACA,GAAG,QAEP,GAAQ,OAIhB,MAAO,IAAc,KAAK,SAAU,GAAI,CACpC,GAAU,GAAK,GACf,OAAS,IAAI,EAAG,GAAI,GAAQ,OAAQ,KAAK,CACrC,GAAI,IAAU,GAAQ,IACtB,GAAkB,GAAQ,YAE/B,MAAS,SAAU,GAAK,CACvB,KAAC,IAAiB,EAAS,KAAQ,GAAU,WAAW,MAAS,UAAY,IACvE,OA2DtB,UAAgB,EAAS,GAClB,EAGX,GAAI,GAAe,CACf,QAAS,eACT,aAAc,GACd,SAAU,KACV,QAAS,GACT,QAAS,GACT,QAAS,GACT,WAAY,GACZ,MAAO,GACP,OAAQ,GACR,IAAK,GACL,KAAM,EACN,aAAc,IAGlB,aAAyB,CACrB,MAAO,OAAO,eAAiB,WAMnC,GAAI,IAAa,mEAEb,GAAmB,uBACnB,GAAyB,gCAEzB,GAAoB,YACpB,GAA2B,GAAkB,OAG7C,GAAmB,OACnB,GAAY,OACZ,GAAiB,OACjB,GAAkB,OAClB,GAAyB,OACzB,GAAkB,OAClB,GAAkB,OAClB,GAAmB,OACnB,GAAmB,OACnB,GAAoB,OACpB,GAAoB,OACpB,GAAgC,GAA2B,GAAiB,OAE5E,GAAa,OAAO,UAAU,SAElC,YAAwB,EAAkB,CAEtC,GAAI,GAAe,EAAiB,OAAS,IACzC,EAAM,EAAiB,OACvB,EACA,EAAI,EACJ,EAAU,GAAU,GAAU,GAElC,AAAI,EAAiB,EAAiB,OAAS,KAAO,KAClD,KACI,EAAiB,EAAiB,OAAS,KAAO,KAClD,KAIR,GAAI,IAAS,GAAI,aAAY,GACzB,GAAQ,GAAI,YAAW,IAE3B,IAAK,EAAI,EAAG,EAAI,EAAK,GAAK,EACtB,EAAW,GAAW,QAAQ,EAAiB,IAC/C,GAAW,GAAW,QAAQ,EAAiB,EAAI,IACnD,GAAW,GAAW,QAAQ,EAAiB,EAAI,IACnD,GAAW,GAAW,QAAQ,EAAiB,EAAI,IAGnD,GAAM,KAAO,GAAY,EAAI,IAAY,EACzC,GAAM,KAAQ,IAAW,KAAO,EAAI,IAAY,EAChD,GAAM,KAAQ,IAAW,IAAM,EAAI,GAAW,GAElD,MAAO,IAKX,YAAwB,EAAQ,CAE5B,GAAI,GAAQ,GAAI,YAAW,GACvB,EAAe,GACf,EAEJ,IAAK,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EAE/B,GAAgB,GAAW,EAAM,IAAM,GACvC,GAAgB,GAAY,GAAM,GAAK,IAAM,EAAI,EAAM,EAAI,IAAM,GACjE,GAAgB,GAAY,GAAM,EAAI,GAAK,KAAO,EAAI,EAAM,EAAI,IAAM,GACtE,GAAgB,GAAW,EAAM,EAAI,GAAK,IAG9C,MAAI,GAAM,OAAS,GAAM,EACrB,EAAe,EAAa,UAAU,EAAG,EAAa,OAAS,GAAK,IAC7D,EAAM,OAAS,GAAM,GAC5B,GAAe,EAAa,UAAU,EAAG,EAAa,OAAS,GAAK,MAGjE,EAMX,YAAmB,EAAO,EAAU,CAChC,GAAI,GAAY,GAShB,GARI,GACA,GAAY,GAAW,KAAK,IAO5B,GAAU,KAAc,wBAA0B,EAAM,QAAU,GAAW,KAAK,EAAM,UAAY,wBAAyB,CAG7H,GAAI,GACA,EAAS,GAEb,AAAI,YAAiB,aACjB,GAAS,EACT,GAAU,IAEV,GAAS,EAAM,OAEf,AAAI,IAAc,qBACd,GAAU,GACP,AAAI,IAAc,sBACrB,GAAU,GACP,AAAI,IAAc,6BACrB,GAAU,GACP,AAAI,IAAc,sBACrB,GAAU,GACP,AAAI,IAAc,uBACrB,GAAU,GACP,AAAI,IAAc,sBACrB,GAAU,GACP,AAAI,IAAc,uBACrB,GAAU,GACP,AAAI,IAAc,wBACrB,GAAU,GACP,AAAI,IAAc,wBACrB,GAAU,GAEV,EAAS,GAAI,OAAM,wCAI3B,EAAS,EAAS,GAAe,YAC1B,IAAc,gBAAiB,CAEtC,GAAI,GAAa,GAAI,YAErB,EAAW,OAAS,UAAY,CAE5B,GAAI,IAAM,GAAmB,EAAM,KAAO,IAAM,GAAe,KAAK,QAEpE,EAAS,GAAoB,GAAY,KAG7C,EAAW,kBAAkB,OAE7B,IAAI,CACA,EAAS,KAAK,UAAU,UACnB,GAAP,CACE,QAAQ,MAAM,8CAA+C,GAE7D,EAAS,KAAM,KAa3B,YAAqB,EAAO,CAIxB,GAAI,EAAM,UAAU,EAAG,MAA8B,GACjD,MAAO,MAAK,MAAM,GAMtB,GAAI,GAAmB,EAAM,UAAU,IACnC,EAAO,EAAM,UAAU,GAA0B,IAEjD,EAGJ,GAAI,IAAS,IAAa,GAAuB,KAAK,GAAmB,CACrE,GAAI,GAAU,EAAiB,MAAM,IACrC,EAAW,EAAQ,GACnB,EAAmB,EAAiB,UAAU,EAAQ,GAAG,QAE7D,GAAI,GAAS,GAAe,GAI5B,OAAQ,OACC,IACD,MAAO,OACN,IACD,MAAO,IAAW,CAAC,GAAS,CAAE,KAAM,QACnC,IACD,MAAO,IAAI,WAAU,OACpB,IACD,MAAO,IAAI,YAAW,OACrB,IACD,MAAO,IAAI,mBAAkB,OAC5B,IACD,MAAO,IAAI,YAAW,OACrB,IACD,MAAO,IAAI,aAAY,OACtB,IACD,MAAO,IAAI,YAAW,OACrB,IACD,MAAO,IAAI,aAAY,OACtB,IACD,MAAO,IAAI,cAAa,OACvB,IACD,MAAO,IAAI,cAAa,WAExB,KAAM,IAAI,OAAM,gBAAkB,IAI9C,GAAI,IAAwB,CACxB,UAAW,GACX,YAAa,GACb,eAAgB,GAChB,eAAgB,IAapB,YAAuB,EAAG,EAAQ,EAAU,EAAe,CACvD,EAAE,WAAW,8BAAgC,EAAO,UAAY,+CAAqD,GAAI,EAAU,GAKvI,YAAwB,EAAS,CAC7B,GAAI,GAAO,KACP,EAAS,CACT,GAAI,MAGR,GAAI,EACA,OAAS,KAAK,GACV,EAAO,GAAK,MAAO,GAAQ,IAAO,SAAW,EAAQ,GAAG,WAAa,EAAQ,GAIrF,GAAI,GAAgB,GAAI,IAAU,SAAU,EAAS,GAAQ,CAGzD,GAAI,CACA,EAAO,GAAK,aAAa,EAAO,KAAM,OAAO,EAAO,SAAU,EAAO,YAAa,EAAO,YACpF,GAAP,CACE,MAAO,IAAO,IAIlB,EAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,EAAQ,UAAY,CACjC,EAAK,QAAU,EACf,KACD,SAAU,GAAG,GAAO,CACnB,GAAO,OAEZ,MAGP,SAAO,WAAa,GACb,EAGX,YAAuB,EAAG,EAAQ,EAAc,EAAM,EAAU,EAAe,CAC3E,EAAE,WAAW,EAAc,EAAM,EAAU,SAAU,GAAG,GAAO,CAC3D,AAAI,GAAM,OAAS,GAAM,WACrB,GAAE,WAAW,iEAAuE,CAAC,EAAO,WAAY,SAAU,GAAG,GAAS,CAC1H,AAAK,GAAQ,KAAK,OAOd,EAAc,GAAG,IAJjB,GAAc,GAAG,EAAQ,UAAY,CACjC,GAAE,WAAW,EAAc,EAAM,EAAU,IAC5C,IAIR,GAEH,EAAc,GAAG,KAEtB,GAGP,YAAmB,EAAK,EAAU,CAC9B,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAClB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,iBAAmB,GAAO,UAAY,yBAA0B,CAAC,GAAM,SAAU,GAAG,GAAS,CAClH,GAAI,IAAS,GAAQ,KAAK,OAAS,GAAQ,KAAK,KAAK,GAAG,MAAQ,KAIhE,AAAI,IACA,IAAS,GAAO,WAAW,YAAY,KAG3C,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAmB,EAAU,EAAU,CACnC,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAElB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,iBAAmB,GAAO,UAAW,GAAI,SAAU,GAAG,GAAS,CAIpF,OAHI,IAAO,GAAQ,KACf,GAAS,GAAK,OAET,GAAI,EAAG,GAAI,GAAQ,KAAK,CAC7B,GAAI,IAAO,GAAK,KAAK,IACjB,GAAS,GAAK,MAYlB,GARI,IACA,IAAS,GAAO,WAAW,YAAY,KAG3C,GAAS,EAAS,GAAQ,GAAK,IAAK,GAAI,GAIpC,KAAW,OAAQ,CACnB,EAAQ,IACR,QAIR,KACD,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAkB,EAAK,EAAO,EAAU,EAAa,CACjD,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,GAAI,IAAU,SAAU,GAAS,GAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAI1B,AAAI,IAAU,QACV,GAAQ,MAIZ,GAAI,IAAgB,EAEhB,GAAS,EAAK,QAClB,GAAO,WAAW,UAAU,EAAO,SAAU,GAAO,GAAO,CACvD,AAAI,GACA,GAAO,IAEP,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,0BAA4B,GAAO,UAAY,8BAAoC,CAAC,EAAK,IAAQ,UAAY,CAClI,GAAQ,KACT,SAAU,GAAG,GAAO,CACnB,GAAO,OAEZ,SAAU,GAAU,CAGnB,GAAI,GAAS,OAAS,GAAS,UAAW,CAQtC,GAAI,EAAc,EAAG,CACjB,GAAQ,GAAS,MAAM,EAAM,CAAC,EAAK,GAAe,EAAU,EAAc,KAC1E,OAEJ,GAAO,WAKxB,MAAS,MAGhB,UAAgB,EAAS,GAClB,EAGX,YAAmB,EAAK,EAAO,EAAU,CACrC,MAAO,IAAS,MAAM,KAAM,CAAC,EAAK,EAAO,EAAU,IAGvD,YAAsB,EAAK,EAAU,CACjC,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAClB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,eAAiB,GAAO,UAAY,iBAAkB,CAAC,GAAM,UAAY,CAC9F,KACD,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAKX,YAAiB,EAAU,CACvB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,GAAS,EAAK,QAClB,EAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,EAAQ,eAAiB,EAAO,UAAW,GAAI,UAAY,CACxE,KACD,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAKX,YAAkB,EAAU,CACxB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,GAAS,EAAK,QAClB,EAAO,GAAG,YAAY,SAAU,GAAG,CAE/B,GAAc,GAAG,EAAQ,+BAAiC,EAAO,UAAW,GAAI,SAAU,GAAG,GAAS,CAClG,GAAI,IAAS,GAAQ,KAAK,KAAK,GAAG,EAClC,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAUX,YAAe,EAAG,EAAU,CACxB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,IAAS,EAAK,QAClB,GAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,GAAQ,mBAAqB,GAAO,UAAY,wBAAyB,CAAC,EAAI,GAAI,SAAU,GAAG,GAAS,CACrH,GAAI,IAAS,GAAQ,KAAK,OAAS,GAAQ,KAAK,KAAK,GAAG,IAAM,KAC9D,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAGX,YAAgB,EAAU,CACtB,GAAI,GAAO,KAEP,EAAU,GAAI,IAAU,SAAU,EAAS,EAAQ,CACnD,EAAK,QAAQ,KAAK,UAAY,CAC1B,GAAI,GAAS,EAAK,QAClB,EAAO,GAAG,YAAY,SAAU,GAAG,CAC/B,GAAc,GAAG,EAAQ,mBAAqB,EAAO,UAAW,GAAI,SAAU,GAAG,GAAS,CAGtF,OAFI,IAAO,GAEF,GAAI,EAAG,GAAI,GAAQ,KAAK,OAAQ,KACrC,GAAK,KAAK,GAAQ,KAAK,KAAK,IAAG,KAGnC,EAAQ,KACT,SAAU,GAAG,GAAO,CACnB,EAAO,UAGhB,MAAS,KAGhB,UAAgB,EAAS,GAClB,EAKX,YAA0B,EAAI,CAC1B,MAAO,IAAI,IAAU,SAAU,EAAS,EAAQ,CAC5C,EAAG,YAAY,SAAU,EAAG,CACxB,EAAE,WAAW,8FAAoG,GAAI,SAAU,EAAG,EAAS,CAGvI,OAFI,IAAa,GAER,GAAI,EAAG,GAAI,EAAQ,KAAK,OAAQ,KACrC,GAAW,KAAK,EAAQ,KAAK,KAAK,IAAG,MAGzC,EAAQ,CACJ,GAAI,EACJ,WAAY,MAEjB,SAAU,EAAG,EAAO,CACnB,EAAO,MAEZ,SAAU,EAAU,CACnB,EAAO,OAKnB,YAAwB,EAAS,EAAU,CACvC,EAAW,GAAY,MAAM,KAAM,WAEnC,GAAI,GAAgB,KAAK,SACzB,EAAU,MAAO,IAAY,YAAc,GAAW,GACjD,EAAQ,MACT,GAAQ,KAAO,EAAQ,MAAQ,EAAc,KAC7C,EAAQ,UAAY,EAAQ,WAAa,EAAc,WAG3D,GAAI,GAAO,KACP,EACJ,MAAK,GAAQ,KAGT,EAAU,GAAI,IAAU,SAAU,EAAS,CACvC,GAAI,IACJ,AAAI,EAAQ,OAAS,EAAc,KAE/B,GAAK,EAAK,QAAQ,GAElB,GAAK,aAAa,EAAQ,KAAM,GAAI,GAAI,GAG5C,AAAK,EAAQ,UAIT,EAAQ,CACJ,GAAI,GACJ,WAAY,CAAC,EAAQ,aAJzB,EAAQ,GAAiB,OAO9B,KAAK,SAAU,EAAe,CAC7B,MAAO,IAAI,IAAU,SAAU,GAAS,GAAQ,CAC5C,EAAc,GAAG,YAAY,SAAU,GAAG,CACtC,YAAmB,GAAW,CAC1B,MAAO,IAAI,IAAU,SAAU,GAAS,GAAQ,CAC5C,GAAE,WAAW,wBAA0B,GAAW,GAAI,UAAY,CAC9D,MACD,SAAU,GAAG,GAAO,CACnB,GAAO,QAMnB,OADI,IAAa,GACR,GAAI,EAAG,GAAM,EAAc,WAAW,OAAQ,GAAI,GAAK,KAC5D,GAAW,KAAK,GAAU,EAAc,WAAW,MAGvD,GAAU,IAAI,IAAY,KAAK,UAAY,CACvC,OACD,MAAS,SAAU,GAAG,CACrB,GAAO,OAEZ,SAAU,GAAU,CACnB,GAAO,UA5CnB,EAAU,GAAU,OAAO,qBAkD/B,GAAgB,EAAS,GAClB,EAGX,GAAI,IAAgB,CAChB,QAAS,gBACT,aAAc,GACd,SAAU,KACV,QAAS,GACT,QAAS,GACT,QAAS,GACT,WAAY,GACZ,MAAO,GACP,OAAQ,GACR,IAAK,GACL,KAAM,GACN,aAAc,IAGlB,aAA+B,CAC3B,GAAI,CACA,MAAO,OAAO,eAAiB,aAAe,WAAa,eAE3D,CAAC,CAAC,aAAa,cACV,EAAP,CACE,MAAO,IAIf,YAAuB,EAAS,EAAe,CAC3C,GAAI,GAAY,EAAQ,KAAO,IAE/B,MAAI,GAAQ,YAAc,EAAc,WACpC,IAAa,EAAQ,UAAY,KAE9B,EAIX,aAAqC,CACjC,GAAI,GAAsB,4BAE1B,GAAI,CACA,oBAAa,QAAQ,EAAqB,IAC1C,aAAa,WAAW,GAEjB,SACF,EAAP,CACE,MAAO,IAQf,aAAiC,CAC7B,MAAO,CAAC,MAA+B,aAAa,OAAS,EAIjE,YAAwB,EAAS,CAC7B,GAAI,GAAO,KACP,EAAS,GACb,GAAI,EACA,OAAS,KAAK,GACV,EAAO,GAAK,EAAQ,GAM5B,MAFA,GAAO,UAAY,GAAc,EAAS,EAAK,gBAE3C,AAAC,KAIL,GAAK,QAAU,EACf,EAAO,WAAa,GAEb,GAAU,WANN,GAAU,SAWzB,YAAiB,EAAU,CACvB,GAAI,GAAO,KACP,EAAU,EAAK,QAAQ,KAAK,UAAY,CAGxC,OAFI,GAAY,EAAK,QAAQ,UAEpB,EAAI,aAAa,OAAS,EAAG,GAAK,EAAG,IAAK,CAC/C,GAAI,GAAM,aAAa,IAAI,GAE3B,AAAI,EAAI,QAAQ,KAAe,GAC3B,aAAa,WAAW,MAKpC,UAAgB,EAAS,GAClB,EAMX,YAAmB,EAAK,EAAU,CAC9B,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,EAAK,QAAQ,KAAK,UAAY,CACxC,GAAI,GAAS,EAAK,QACd,EAAS,aAAa,QAAQ,EAAO,UAAY,GAMrD,MAAI,IACA,GAAS,EAAO,WAAW,YAAY,IAGpC,IAGX,UAAgB,EAAS,GAClB,EAIX,YAAmB,EAAU,EAAU,CACnC,GAAI,GAAO,KAEP,EAAU,EAAK,QAAQ,KAAK,UAAY,CAcxC,OAbI,GAAS,EAAK,QACd,EAAY,EAAO,UACnB,GAAkB,EAAU,OAC5B,GAAS,aAAa,OAQtB,GAAkB,EAEb,GAAI,EAAG,GAAI,GAAQ,KAAK,CAC7B,GAAI,IAAM,aAAa,IAAI,IAC3B,GAAI,GAAI,QAAQ,KAAe,EAG/B,IAAI,IAAQ,aAAa,QAAQ,IAYjC,GANI,IACA,IAAQ,EAAO,WAAW,YAAY,KAG1C,GAAQ,EAAS,GAAO,GAAI,UAAU,IAAkB,MAEpD,KAAU,OACV,MAAO,QAKnB,UAAgB,EAAS,GAClB,EAIX,YAAe,EAAG,EAAU,CACxB,GAAI,GAAO,KACP,EAAU,EAAK,QAAQ,KAAK,UAAY,CACxC,GAAI,GAAS,EAAK,QACd,EACJ,GAAI,CACA,EAAS,aAAa,IAAI,SACrB,GAAP,CACE,EAAS,KAIb,MAAI,IACA,GAAS,EAAO,UAAU,EAAO,UAAU,SAGxC,IAGX,UAAgB,EAAS,GAClB,EAGX,YAAgB,EAAU,CACtB,GAAI,GAAO,KACP,EAAU,EAAK,QAAQ,KAAK,UAAY,CAKxC,OAJI,GAAS,EAAK,QACd,EAAS,aAAa,OACtB,EAAO,GAEF,GAAI,EAAG,GAAI,EAAQ,KAAK,CAC7B,GAAI,IAAU,aAAa,IAAI,IAC/B,AAAI,GAAQ,QAAQ,EAAO,aAAe,GACtC,EAAK,KAAK,GAAQ,UAAU,EAAO,UAAU,SAIrD,MAAO,KAGX,UAAgB,EAAS,GAClB,EAIX,YAAkB,EAAU,CACxB,GAAI,GAAO,KACP,EAAU,EAAK,OAAO,KAAK,SAAU,EAAM,CAC3C,MAAO,GAAK,SAGhB,UAAgB,EAAS,GAClB,EAIX,YAAsB,EAAK,EAAU,CACjC,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,EAAK,QAAQ,KAAK,UAAY,CACxC,GAAI,GAAS,EAAK,QAClB,aAAa,WAAW,EAAO,UAAY,KAG/C,UAAgB,EAAS,GAClB,EAOX,YAAmB,EAAK,EAAO,EAAU,CACrC,GAAI,GAAO,KAEX,EAAM,GAAa,GAEnB,GAAI,GAAU,EAAK,QAAQ,KAAK,UAAY,CAGxC,AAAI,IAAU,QACV,GAAQ,MAIZ,GAAI,GAAgB,EAEpB,MAAO,IAAI,IAAU,SAAU,GAAS,GAAQ,CAC5C,GAAI,IAAS,EAAK,QAClB,GAAO,WAAW,UAAU,EAAO,SAAU,GAAO,GAAO,CACvD,GAAI,GACA,GAAO,QAEP,IAAI,CACA,aAAa,QAAQ,GAAO,UAAY,EAAK,IAC7C,GAAQ,SACH,GAAP,CAGE,AAAI,IAAE,OAAS,sBAAwB,GAAE,OAAS,+BAC9C,GAAO,IAEX,GAAO,WAO3B,UAAgB,EAAS,GAClB,EAGX,YAAwB,EAAS,EAAU,CAIvC,GAHA,EAAW,GAAY,MAAM,KAAM,WAEnC,EAAU,MAAO,IAAY,YAAc,GAAW,GAClD,CAAC,EAAQ,KAAM,CACf,GAAI,GAAgB,KAAK,SACzB,EAAQ,KAAO,EAAQ,MAAQ,EAAc,KAC7C,EAAQ,UAAY,EAAQ,WAAa,EAAc,UAG3D,GAAI,GAAO,KACP,EACJ,MAAK,GAAQ,KAGT,EAAU,GAAI,IAAU,SAAU,EAAS,CACvC,AAAK,EAAQ,UAGT,EAAQ,GAAc,EAAS,EAAK,iBAFpC,EAAQ,EAAQ,KAAO,OAI5B,KAAK,SAAU,EAAW,CACzB,OAAS,IAAI,aAAa,OAAS,EAAG,IAAK,EAAG,KAAK,CAC/C,GAAI,IAAM,aAAa,IAAI,IAE3B,AAAI,GAAI,QAAQ,KAAe,GAC3B,aAAa,WAAW,OAbpC,EAAU,GAAU,OAAO,qBAmB/B,GAAgB,EAAS,GAClB,EAGX,GAAI,IAAsB,CACtB,QAAS,sBACT,aAAc,GACd,SAAU,KACV,QAAS,GACT,QAAS,GACT,QAAS,GACT,WAAY,GACZ,MAAO,GACP,OAAQ,GACR,IAAK,GACL,KAAM,GACN,aAAc,IAGd,GAAY,SAAmB,EAAG,EAAG,CACrC,MAAO,KAAM,GAAK,MAAO,IAAM,UAAY,MAAO,IAAM,UAAY,MAAM,IAAM,MAAM,IAGtF,GAAW,SAAkB,EAAO,EAAe,CAGnD,OAFI,GAAM,EAAM,OACZ,EAAI,EACD,EAAI,GAAK,CACZ,GAAI,GAAU,EAAM,GAAI,GACpB,MAAO,GAEX,IAGJ,MAAO,IAGP,GAAU,MAAM,SAAW,SAAU,EAAK,CAC1C,MAAO,QAAO,UAAU,SAAS,KAAK,KAAS,kBAK/C,GAAiB,GAEjB,GAAgB,GAEhB,GAAiB,CACjB,UAAW,EACX,OAAQ,GACR,aAAc,IAGd,GAAqB,CAAC,GAAe,UAAU,QAAS,GAAe,OAAO,QAAS,GAAe,aAAa,SAEnH,GAAwB,CAAC,gBAEzB,GAAiB,CAAC,QAAS,UAAW,UAAW,MAAO,OAAQ,SAAU,aAAc,WAAW,OAAO,IAE1G,GAAgB,CAChB,YAAa,GACb,OAAQ,GAAmB,QAC3B,KAAM,cAGN,KAAM,QACN,UAAW,gBACX,QAAS,GAGb,WAAuB,EAAqB,EAAe,CACvD,EAAoB,GAAiB,UAAY,CAC7C,GAAI,GAAQ,UACZ,MAAO,GAAoB,QAAQ,KAAK,UAAY,CAChD,MAAO,GAAoB,GAAe,MAAM,EAAqB,MAKjF,aAAkB,CACd,OAAS,GAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,CACvC,GAAI,GAAM,UAAU,GAEpB,GAAI,EACA,OAAS,KAAQ,GACb,AAAI,EAAI,eAAe,IACnB,CAAI,GAAQ,EAAI,IACZ,UAAU,GAAG,GAAQ,EAAI,GAAM,QAE/B,UAAU,GAAG,GAAQ,EAAI,IAO7C,MAAO,WAAU,GAGrB,GAAI,IAAc,UAAY,CAC1B,WAAqB,EAAS,CAC1B,EAAgB,KAAM,GAEtB,OAAS,KAAiB,IACtB,GAAI,GAAe,eAAe,GAAgB,CAC9C,GAAI,GAAS,GAAe,GACxB,EAAa,EAAO,QACxB,KAAK,GAAiB,EAEjB,GAAe,IAIhB,KAAK,aAAa,GAK9B,KAAK,eAAiB,GAAO,GAAI,IACjC,KAAK,QAAU,GAAO,GAAI,KAAK,eAAgB,GAC/C,KAAK,WAAa,KAClB,KAAK,YAAc,KACnB,KAAK,OAAS,GACd,KAAK,QAAU,KAEf,KAAK,+BACL,KAAK,UAAU,KAAK,QAAQ,QAAQ,MAAS,UAAY,IAS7D,SAAY,UAAU,OAAS,SAAgB,EAAS,CAIpD,GAAK,OAAO,IAAY,YAAc,YAAc,EAAQ,MAAc,SAAU,CAGhF,GAAI,KAAK,OACL,MAAO,IAAI,OAAM,wDAGrB,OAAS,KAAK,GAAS,CAKnB,GAJI,IAAM,aACN,GAAQ,GAAK,EAAQ,GAAG,QAAQ,MAAO,MAGvC,IAAM,WAAa,MAAO,GAAQ,IAAO,SACzC,MAAO,IAAI,OAAM,sCAGrB,KAAK,QAAQ,GAAK,EAAQ,GAK9B,MAAI,UAAY,IAAW,EAAQ,OACxB,KAAK,UAAU,KAAK,QAAQ,QAGhC,OACJ,OAAI,OAAO,IAAY,SACnB,KAAK,QAAQ,GAEb,KAAK,SAQpB,EAAY,UAAU,aAAe,SAAsB,EAAc,EAAU,EAAe,CAC9F,GAAI,GAAU,GAAI,IAAU,SAAU,GAAS,GAAQ,CACnD,GAAI,CACA,GAAI,IAAa,EAAa,QAC1B,GAAkB,GAAI,OAAM,wFAIhC,GAAI,CAAC,EAAa,QAAS,CACvB,GAAO,IACP,OAIJ,OADI,IAAgB,GAAe,OAAO,gBACjC,GAAI,EAAG,GAAM,GAAc,OAAQ,GAAI,GAAK,KAAK,CACtD,GAAI,IAAmB,GAAc,IAIjC,GAAa,CAAC,GAAS,GAAuB,IAClD,GAAK,KAAc,EAAa,MAAsB,MAAO,GAAa,KAAsB,WAAY,CACxG,GAAO,IACP,QAIR,GAAI,IAA0B,UAAmC,CAU7D,OATI,IAA8B,SAAqC,GAAY,CAC/E,MAAO,WAAY,CACf,GAAI,IAAQ,GAAI,OAAM,UAAY,GAAa,6CAC3C,GAAU,GAAU,OAAO,IAC/B,UAAgB,GAAS,UAAU,UAAU,OAAS,IAC/C,KAIN,GAAK,EAAG,GAAO,GAAsB,OAAQ,GAAK,GAAM,KAAM,CACnE,GAAI,IAAuB,GAAsB,IACjD,AAAK,EAAa,KACd,GAAa,IAAwB,GAA4B,OAK7E,KAEA,GAAI,IAAmB,SAA0B,GAAS,CACtD,AAAI,GAAe,KACf,QAAQ,KAAK,kCAAoC,IAErD,GAAe,IAAc,EAC7B,GAAc,IAAc,GAI5B,MAGJ,AAAI,YAAc,GACd,AAAI,EAAa,UAAY,MAAO,GAAa,UAAa,WAC1D,EAAa,WAAW,KAAK,GAAkB,IAE/C,GAAiB,CAAC,CAAC,EAAa,UAGpC,GAAiB,UAEhB,GAAP,CACE,GAAO,OAIf,UAAoB,EAAS,EAAU,GAChC,GAGX,EAAY,UAAU,OAAS,UAAkB,CAC7C,MAAO,MAAK,SAAW,MAG3B,EAAY,UAAU,UAAY,SAAmB,EAAY,EAAU,EAAe,CACtF,GAAI,GAAmB,GAAe,GAAc,GAAU,QAAQ,GAAe,IAAe,GAAU,OAAO,GAAI,OAAM,sBAE/H,UAAoB,EAAkB,EAAU,GACzC,GAGX,EAAY,UAAU,cAAgB,SAAuB,EAAU,CACnE,GAAI,GAAoB,GAAU,QAAQ,IAC1C,UAAoB,EAAmB,GAChC,GAGX,EAAY,UAAU,MAAQ,SAAe,EAAU,CACnD,GAAI,GAAO,KAEP,EAAU,EAAK,WAAW,KAAK,UAAY,CAC3C,MAAI,GAAK,SAAW,MAChB,GAAK,OAAS,EAAK,eAGhB,EAAK,SAGhB,UAAoB,EAAS,EAAU,GAChC,GAGX,EAAY,UAAU,UAAY,SAAmB,EAAS,EAAU,EAAe,CACnF,GAAI,GAAO,KAEX,AAAK,GAAQ,IACT,GAAU,CAAC,IAGf,GAAI,IAAmB,KAAK,qBAAqB,GAEjD,aAA6B,CACzB,EAAK,QAAQ,OAAS,EAAK,SAG/B,YAA8B,GAAQ,CAClC,SAAK,QAAQ,IACb,KAEA,EAAK,OAAS,EAAK,aAAa,EAAK,SAC9B,EAAK,OAGhB,YAAoB,GAAkB,CAClC,MAAO,WAAY,CACf,GAAI,IAAqB,EAEzB,aAA6B,CACzB,KAAO,GAAqB,GAAiB,QAAQ,CACjD,GAAI,IAAa,GAAiB,IAClC,YAEA,EAAK,QAAU,KACf,EAAK,OAAS,KAEP,EAAK,UAAU,IAAY,KAAK,IAAsB,MAAS,IAG1E,KACA,GAAI,IAAQ,GAAI,OAAM,sCACtB,SAAK,WAAa,GAAU,OAAO,IAC5B,EAAK,WAGhB,MAAO,OAOf,GAAI,IAAmB,KAAK,aAAe,KAAO,KAAK,WAAW,MAAS,UAAY,CACnF,MAAO,IAAU,YAChB,GAAU,UAEf,YAAK,WAAa,GAAiB,KAAK,UAAY,CAChD,GAAI,IAAa,GAAiB,GAClC,SAAK,QAAU,KACf,EAAK,OAAS,KAEP,EAAK,UAAU,IAAY,KAAK,SAAU,GAAQ,CACrD,EAAK,QAAU,GAAO,QACtB,KACA,EAAK,+BACL,EAAK,YAAc,GAAW,QAEnC,MAAS,UAAY,CACpB,KACA,GAAI,IAAQ,GAAI,OAAM,sCACtB,SAAK,WAAa,GAAU,OAAO,IAC5B,EAAK,aAGhB,GAAoB,KAAK,WAAY,EAAU,GACxC,KAAK,YAGhB,EAAY,UAAU,SAAW,SAAkB,EAAY,CAC3D,MAAO,CAAC,CAAC,GAAc,IAG3B,EAAY,UAAU,QAAU,SAAiB,EAA6B,CAC1E,GAAO,KAAM,IAGjB,EAAY,UAAU,qBAAuB,SAA8B,EAAS,CAEhF,OADI,GAAmB,GACd,EAAI,EAAG,EAAM,EAAQ,OAAQ,EAAI,EAAK,IAAK,CAChD,GAAI,IAAa,EAAQ,GACzB,AAAI,KAAK,SAAS,KACd,EAAiB,KAAK,IAG9B,MAAO,IAGX,EAAY,UAAU,6BAA+B,UAAwC,CAKzF,OAAS,GAAI,EAAG,EAAM,GAAe,OAAQ,EAAI,EAAK,IAClD,EAAc,KAAM,GAAe,KAI3C,EAAY,UAAU,eAAiB,SAAwB,EAAS,CACpE,MAAO,IAAI,GAAY,IAGpB,KAOP,GAAiB,GAAI,IAEzB,EAAO,QAAU,IAEf,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,OChtFR,EAAZ,AAAA,UAAY,EAAY,CACtB,EAAA,IAAA,MACA,EAAA,IAAA,QAFU,GAAA,GAAY,KAKxB,GAAY,GAAZ,AAAA,UAAY,EAAQ,CAClB,EAAA,MAAA,QACA,EAAA,MAAA,QACA,EAAA,MAAA,UAHU,GAAA,GAAQ,KAMpB,GAAY,GAAZ,AAAA,UAAY,EAAO,CACjB,EAAA,EAAA,MAAA,MAAA,QACA,EAAA,EAAA,MAAA,MAAA,QACA,EAAA,EAAA,MAAA,MAAA,UAHU,GAAA,GAAO,KAMnB,GAAY,GAAZ,AAAA,UAAY,EAAO,CACjB,EAAA,QAAA,UACA,EAAA,QAAA,YAFU,GAAA,GAAO,KAKnB,GAAY,GAAZ,AAAA,UAAY,EAAa,CACvB,EAAA,EAAA,KAAA,KAAA,OACA,EAAA,EAAA,KAAA,KAAA,OACA,EAAA,EAAA,KAAA,KAAA,SAHU,GAAA,GAAa,KAMzB,GAAY,GAAZ,AAAA,UAAY,EAAO,CACjB,EAAA,MAAA,QACA,EAAA,QAAA,UACA,EAAA,QAAA,UACA,EAAA,QAAA,YAJU,GAAA,GAAO,KAOnB,GAAY,GAAZ,AAAA,UAAY,EAAQ,CAClB,EAAA,EAAA,GAAA,GAAA,KACA,EAAA,EAAA,IAAA,IAAA,QAFU,GAAA,GAAQ,KAKpB,GAAY,IAAZ,AAAA,UAAY,EAAM,CAChB,EAAA,KAAA,OACA,EAAA,MAAA,UAFU,IAAA,IAAM,wPCjEL,GAAkB,GAAI,OAAM,yEAC5B,EAAa,GAAI,OAAM,uGACvB,GAAS,GAAI,OAAM,wGACnB,GAAgB,GAAI,OAAM,gEAC1B,EAAoB,GAAI,OAAM,qDAC9B,GAAgB,GAAI,OAAM,gDAEvC,YAA+B,EAAY,CACzC,GAAG,CAAC,GAAW,IAAY,KACzB,KAAM,IACD,GAAG,EAAQ,aAAe,OAC/B,KAAM,GAER,MAAO,GAGT,YAA2B,EAAQ,CACjC,GAAG,CAAC,GAAO,IAAQ,KACjB,KAAM,IACD,GAAI,EAAI,aAAe,QAAa,EAAI,YAAc,OAC3D,KAAM,IAER,MAAO,GAGT,YAAuC,EAAkB,CACvD,GAAW,EAAM,CAAC,EAAa,IAAK,EAAa,KAAM,GAGzD,YAAiC,EAAW,CAC1C,GAAW,EAAK,CAAC,GAAO,KAAM,GAAO,OAAQ,IAG/C,YAAuB,EAAY,EAAW,EAAY,CACxD,GAAM,GAAQ,EAAK,KAAK,SAAA,EAAG,CAAI,MAAA,KAAQ,IACvC,GAAG,CAAC,EACF,KAAM,GClCV,YAA4B,EAAY,CACtC,MAAO,GAAY,eAAe,CAAE,KAAI,IAG1C,YAA2C,EAAY,EAAkD,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,0FACpG,MAAA,CAAA,EAAM,GAAO,EAAI,WAApB,MAAG,GAAA,OACD,CAAA,GAEU,CAAA,EAAM,YAAZ,SAAM,EAAA,OACZ,CAAA,EAAM,GAAI,EAAI,EAAK,WAAnB,SAAA,gBAIF,YAA0B,EAAY,EAAgC,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,6DACrE,MAAA,CAAA,EAAO,EAAM,QAAQ,EAAI,QAI1B,YAAiC,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,6DAC3C,MAAA,CAAA,EAAO,GAAI,EAAI,GAAgB,QAIjC,YAA6B,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,6DACvC,MAAA,CAAA,EAAO,GAAI,EAAI,GAAY,QAI7B,YAA6B,EAAY,EAAqC,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,0FAC/D,MAAA,CAAA,EAAM,EAAM,QAAQ,WAA3B,SAAO,EAAA,OACb,CAAA,EAAO,IAAS,KAAO,KAAO,EAAQ,SAIxC,YAA6B,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,0FAC3B,MAAA,CAAA,EAAM,EAAM,QAAQ,WAA1B,SAAM,EAAA,OACZ,CAAA,EAAO,IAAQ,WAIjB,YAAyB,EAAY,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,6DACnC,MAAA,CAAA,EAAO,EAAM,WAAW,QAG1B,YAAgC,EAAkB,kEAChD,MAAA,CAAA,EAAO,EAAM,oBAIf,YAA4B,EAAmB,kEAC7C,MAAG,GACD,CAAA,EAAO,GAAU,IAEjB,CAAA,EAAO,EAAY,aAIvB,GAAA,IAAe,CACb,YAAW,GACX,qBAAoB,GACpB,IAAG,GACH,WAAU,GACX,OAAM,GACL,OAAM,GACN,GAAE,GACF,UAAS,GACV,MAAK,qKCtEN,EAAgB,MAAO,SAAW,YAAc,OAC9C,MAAO,OAAS,YAAc,KAC9B,MAAO,SAAW,YAAc,OAAS,GCFvC,GAAS,GACT,GAAY,GACZ,GAAM,MAAO,aAAe,YAAc,WAAa,MACvD,GAAS,GACb,aAAiB,CACf,GAAS,GAET,OADI,GAAO,mEACF,EAAI,EAAG,EAAM,EAAK,OAAQ,EAAI,EAAK,EAAE,EAC5C,GAAO,GAAK,EAAK,GACjB,GAAU,EAAK,WAAW,IAAM,EAGlC,GAAU,IAAI,WAAW,IAAM,GAC/B,GAAU,IAAI,WAAW,IAAM,GAGjC,YAAsB,EAAK,CACzB,AAAK,IACH,KAEF,GAAI,GAAG,EAAG,EAAG,EAAK,EAAc,EAC5B,EAAM,EAAI,OAEd,GAAI,EAAM,EAAI,EACZ,KAAM,IAAI,OAAM,kDAQlB,EAAe,EAAI,EAAM,KAAO,IAAM,EAAI,EAAI,EAAM,KAAO,IAAM,EAAI,EAGrE,EAAM,GAAI,IAAI,EAAM,EAAI,EAAI,GAG5B,EAAI,EAAe,EAAI,EAAM,EAAI,EAEjC,GAAI,IAAI,EAER,IAAK,EAAI,EAAG,EAAI,EAAG,EAAI,EAAG,GAAK,EAAG,GAAK,EACrC,EAAO,GAAU,EAAI,WAAW,KAAO,GAAO,GAAU,EAAI,WAAW,EAAI,KAAO,GAAO,GAAU,EAAI,WAAW,EAAI,KAAO,EAAK,GAAU,EAAI,WAAW,EAAI,IAC/J,EAAI,MAAQ,GAAO,GAAM,IACzB,EAAI,MAAQ,GAAO,EAAK,IACxB,EAAI,MAAO,EAAM,IAGnB,MAAI,KAAiB,EACnB,GAAO,GAAU,EAAI,WAAW,KAAO,EAAM,GAAU,EAAI,WAAW,EAAI,KAAO,EACjF,EAAI,MAAO,EAAM,KACR,IAAiB,GAC1B,GAAO,GAAU,EAAI,WAAW,KAAO,GAAO,GAAU,EAAI,WAAW,EAAI,KAAO,EAAM,GAAU,EAAI,WAAW,EAAI,KAAO,EAC5H,EAAI,MAAQ,GAAO,EAAK,IACxB,EAAI,MAAO,EAAM,KAGZ,EAGT,YAA0B,EAAK,CAC7B,MAAO,IAAO,GAAO,GAAK,IAAQ,GAAO,GAAO,GAAK,IAAQ,GAAO,GAAO,EAAI,IAAQ,GAAO,EAAM,IAGtG,YAAsB,EAAO,EAAO,EAAK,CAGvC,OAFI,GACA,EAAS,GACJ,EAAI,EAAO,EAAI,EAAK,GAAK,EAChC,EAAO,GAAM,IAAM,IAAO,GAAM,EAAI,IAAM,GAAM,EAAM,EAAI,GAC1D,EAAO,KAAK,GAAgB,IAE9B,MAAO,GAAO,KAAK,IAGrB,YAAwB,EAAO,CAC7B,AAAK,IACH,KAUF,OARI,GACA,EAAM,EAAM,OACZ,EAAa,EAAM,EACnB,EAAS,GACT,EAAQ,GACR,EAAiB,MAGZ,EAAI,EAAG,GAAO,EAAM,EAAY,EAAI,GAAM,GAAK,EACtD,EAAM,KAAK,GAAY,EAAO,EAAI,EAAI,EAAkB,GAAO,GAAQ,EAAI,IAI7E,MAAI,KAAe,EACjB,GAAM,EAAM,EAAM,GAClB,GAAU,GAAO,GAAO,GACxB,GAAU,GAAQ,GAAO,EAAK,IAC9B,GAAU,MACD,IAAe,GACxB,GAAO,GAAM,EAAM,IAAM,GAAM,EAAM,EAAM,GAC3C,GAAU,GAAO,GAAO,IACxB,GAAU,GAAQ,GAAO,EAAK,IAC9B,GAAU,GAAQ,GAAO,EAAK,IAC9B,GAAU,KAGZ,EAAM,KAAK,GAEJ,EAAM,KAAK,IAGpB,YAAe,EAAQ,EAAQ,EAAM,EAAM,EAAQ,CACjD,GAAI,GAAG,EACH,EAAO,EAAS,EAAI,EAAO,EAC3B,GAAQ,IAAK,GAAQ,EACrB,GAAQ,IAAQ,EAChB,GAAQ,GACR,GAAI,EAAQ,EAAS,EAAK,EAC1B,GAAI,EAAO,GAAK,EAChB,GAAI,EAAO,EAAS,IAOxB,IALA,IAAK,GAEL,EAAI,GAAM,IAAM,CAAC,IAAU,EAC3B,KAAO,CAAC,GACR,IAAS,EACF,GAAQ,EAAG,EAAI,EAAI,IAAM,EAAO,EAAS,IAAI,IAAK,GAAG,IAAS,EAAG,CAKxE,IAHA,EAAI,EAAM,IAAM,CAAC,IAAU,EAC3B,IAAO,CAAC,GACR,IAAS,EACF,GAAQ,EAAG,EAAI,EAAI,IAAM,EAAO,EAAS,IAAI,IAAK,GAAG,IAAS,EAAG,CAExE,GAAI,IAAM,EACR,EAAI,EAAI,OACH,IAAI,IAAM,GACf,MAAO,GAAI,IAAQ,IAAI,GAAK,GAAK,SAEjC,EAAI,EAAI,KAAK,IAAI,EAAG,GACpB,EAAI,EAAI,GAEV,MAAQ,IAAI,GAAK,GAAK,EAAI,KAAK,IAAI,EAAG,EAAI,GAG5C,YAAgB,EAAQ,EAAO,EAAQ,EAAM,EAAM,EAAQ,CACzD,GAAI,GAAG,EAAG,GACN,GAAO,EAAS,EAAI,EAAO,EAC3B,GAAQ,IAAK,IAAQ,EACrB,GAAQ,IAAQ,EAChB,GAAM,IAAS,GAAK,KAAK,IAAI,EAAG,KAAO,KAAK,IAAI,EAAG,KAAO,EAC1D,GAAI,EAAO,EAAK,EAAS,EACzB,GAAI,EAAO,EAAI,GACf,GAAI,EAAQ,GAAM,IAAU,GAAK,EAAI,EAAQ,EAAK,EAAI,EAmC1D,IAjCA,EAAQ,KAAK,IAAI,GAEjB,AAAI,MAAM,IAAU,IAAU,SAC5B,GAAI,MAAM,GAAS,EAAI,EACvB,EAAI,IAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAS,KAAK,KAClC,EAAS,IAAI,KAAK,IAAI,EAAG,CAAC,IAAM,GAClC,KACA,IAAK,GAEP,AAAI,EAAI,IAAS,EACf,GAAS,GAAK,GAEd,GAAS,GAAK,KAAK,IAAI,EAAG,EAAI,IAE5B,EAAQ,IAAK,GACf,KACA,IAAK,GAGP,AAAI,EAAI,IAAS,GACf,GAAI,EACJ,EAAI,IACC,AAAI,EAAI,IAAS,EACtB,GAAK,GAAQ,GAAI,GAAK,KAAK,IAAI,EAAG,GAClC,EAAI,EAAI,IAER,GAAI,EAAQ,KAAK,IAAI,EAAG,GAAQ,GAAK,KAAK,IAAI,EAAG,GACjD,EAAI,IAID,GAAQ,EAAG,EAAO,EAAS,IAAK,EAAI,IAAM,IAAK,GAAG,GAAK,IAAK,GAAQ,EAAG,CAI9E,IAFA,EAAK,GAAK,EAAQ,EAClB,IAAQ,EACD,GAAO,EAAG,EAAO,EAAS,IAAK,EAAI,IAAM,IAAK,GAAG,GAAK,IAAK,IAAQ,EAAG,CAE7E,EAAO,EAAS,GAAI,KAAM,GAAI,IAGhC,GAAI,IAAW,GAAG,SAEd,GAAU,MAAM,SAAW,SAAU,EAAK,CAC5C,MAAO,IAAS,KAAK,IAAQ,kBAG/B,AAOA,GAAI,IAAoB,GA0BxB,GAAO,oBAAsB,EAAO,sBAAwB,OACxD,EAAO,oBACP,GAOJ,aAAuB,CACrB,MAAO,IAAO,oBACV,WACA,WAGN,YAAuB,EAAM,EAAQ,CACnC,GAAI,KAAe,EACjB,KAAM,IAAI,YAAW,8BAEvB,MAAI,IAAO,oBAET,GAAO,GAAI,YAAW,GACtB,EAAK,UAAY,GAAO,WAGpB,KAAS,MACX,GAAO,GAAI,IAAO,IAEpB,EAAK,OAAS,GAGT,EAaT,YAAiB,EAAK,EAAkB,EAAQ,CAC9C,GAAI,CAAC,GAAO,qBAAuB,CAAE,gBAAgB,KACnD,MAAO,IAAI,IAAO,EAAK,EAAkB,GAI3C,GAAI,MAAO,IAAQ,SAAU,CAC3B,GAAI,MAAO,IAAqB,SAC9B,KAAM,IAAI,OACR,qEAGJ,MAAO,IAAY,KAAM,GAE3B,MAAO,IAAK,KAAM,EAAK,EAAkB,GAG3C,GAAO,SAAW,KAGlB,GAAO,SAAW,SAAU,EAAK,CAC/B,SAAI,UAAY,GAAO,UAChB,GAGT,YAAe,EAAM,EAAO,EAAkB,EAAQ,CACpD,GAAI,MAAO,IAAU,SACnB,KAAM,IAAI,WAAU,yCAGtB,MAAI,OAAO,cAAgB,aAAe,YAAiB,aAClD,GAAgB,EAAM,EAAO,EAAkB,GAGpD,MAAO,IAAU,SACZ,GAAW,EAAM,EAAO,GAG1B,GAAW,EAAM,GAW1B,GAAO,KAAO,SAAU,EAAO,EAAkB,EAAQ,CACvD,MAAO,IAAK,KAAM,EAAO,EAAkB,IAGzC,GAAO,qBACT,IAAO,UAAU,UAAY,WAAW,UACxC,GAAO,UAAY,YAGrB,WAAqB,EAAM,CACzB,GAAI,MAAO,IAAS,SAClB,KAAM,IAAI,WAAU,oCACf,GAAI,EAAO,EAChB,KAAM,IAAI,YAAW,wCAIzB,YAAgB,EAAM,EAAM,EAAM,EAAU,CAE1C,MADA,GAAW,GACP,GAAQ,EACH,GAAa,EAAM,GAExB,IAAS,OAIJ,MAAO,IAAa,SACvB,GAAa,EAAM,GAAM,KAAK,EAAM,GACpC,GAAa,EAAM,GAAM,KAAK,GAE7B,GAAa,EAAM,GAO5B,GAAO,MAAQ,SAAU,EAAM,EAAM,EAAU,CAC7C,MAAO,IAAM,KAAM,EAAM,EAAM,IAGjC,YAAsB,EAAM,EAAM,CAGhC,GAFA,EAAW,GACX,EAAO,GAAa,EAAM,EAAO,EAAI,EAAI,GAAQ,GAAQ,GACrD,CAAC,GAAO,oBACV,OAAS,GAAI,EAAG,EAAI,EAAM,EAAE,EAC1B,EAAK,GAAK,EAGd,MAAO,GAMT,GAAO,YAAc,SAAU,EAAM,CACnC,MAAO,IAAY,KAAM,IAK3B,GAAO,gBAAkB,SAAU,EAAM,CACvC,MAAO,IAAY,KAAM,IAG3B,YAAqB,EAAM,EAAQ,EAAU,CAK3C,GAJI,OAAO,IAAa,UAAY,IAAa,KAC/C,GAAW,QAGT,CAAC,GAAO,WAAW,GACrB,KAAM,IAAI,WAAU,8CAGtB,GAAI,GAAS,GAAW,EAAQ,GAAY,EAC5C,EAAO,GAAa,EAAM,GAE1B,GAAI,GAAS,EAAK,MAAM,EAAQ,GAEhC,MAAI,KAAW,GAIb,GAAO,EAAK,MAAM,EAAG,IAGhB,EAGT,YAAwB,EAAM,EAAO,CACnC,GAAI,GAAS,EAAM,OAAS,EAAI,EAAI,GAAQ,EAAM,QAAU,EAC5D,EAAO,GAAa,EAAM,GAC1B,OAAS,GAAI,EAAG,EAAI,EAAQ,GAAK,EAC/B,EAAK,GAAK,EAAM,GAAK,IAEvB,MAAO,GAGT,YAA0B,EAAM,EAAO,EAAY,EAAQ,CAGzD,GAFA,EAAM,WAEF,EAAa,GAAK,EAAM,WAAa,EACvC,KAAM,IAAI,YAAW,6BAGvB,GAAI,EAAM,WAAa,EAAc,IAAU,GAC7C,KAAM,IAAI,YAAW,6BAGvB,MAAI,KAAe,QAAa,IAAW,OACzC,EAAQ,GAAI,YAAW,GAClB,AAAI,IAAW,OACpB,EAAQ,GAAI,YAAW,EAAO,GAE9B,EAAQ,GAAI,YAAW,EAAO,EAAY,GAG5C,AAAI,GAAO,oBAET,GAAO,EACP,EAAK,UAAY,GAAO,WAGxB,EAAO,GAAc,EAAM,GAEtB,EAGT,YAAqB,EAAM,EAAK,CAC9B,GAAI,GAAiB,GAAM,CACzB,GAAI,GAAM,GAAQ,EAAI,QAAU,EAGhC,MAFA,GAAO,GAAa,EAAM,GAEtB,EAAK,SAAW,GAIpB,EAAI,KAAK,EAAM,EAAG,EAAG,GACd,EAGT,GAAI,EAAK,CACP,GAAK,MAAO,cAAgB,aACxB,EAAI,iBAAkB,cAAgB,UAAY,GACpD,MAAI,OAAO,GAAI,QAAW,UAAY,GAAM,EAAI,QACvC,GAAa,EAAM,GAErB,GAAc,EAAM,GAG7B,GAAI,EAAI,OAAS,UAAY,GAAQ,EAAI,MACvC,MAAO,IAAc,EAAM,EAAI,MAInC,KAAM,IAAI,WAAU,sFAGtB,YAAkB,EAAQ,CAGxB,GAAI,GAAU,KACZ,KAAM,IAAI,YAAW,0DACa,KAAa,SAAS,IAAM,UAEhE,MAAO,GAAS,EASlB,GAAO,SAAW,GAClB,YAA2B,EAAG,CAC5B,MAAO,CAAC,CAAE,IAAK,MAAQ,EAAE,WAG3B,GAAO,QAAU,SAAkB,EAAG,EAAG,CACvC,GAAI,CAAC,GAAiB,IAAM,CAAC,GAAiB,GAC5C,KAAM,IAAI,WAAU,6BAGtB,GAAI,IAAM,EAAG,MAAO,GAKpB,OAHI,GAAI,EAAE,OACN,EAAI,EAAE,OAED,EAAI,EAAG,EAAM,KAAK,IAAI,EAAG,GAAI,EAAI,EAAK,EAAE,EAC/C,GAAI,EAAE,KAAO,EAAE,GAAI,CACjB,EAAI,EAAE,GACN,EAAI,EAAE,GACN,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,GAGT,GAAO,WAAa,SAAqB,EAAU,CACjD,OAAQ,OAAO,GAAU,mBAClB,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,WACH,MAAO,WAEP,MAAO,KAIb,GAAO,OAAS,SAAiB,EAAM,EAAQ,CAC7C,GAAI,CAAC,GAAQ,GACX,KAAM,IAAI,WAAU,+CAGtB,GAAI,EAAK,SAAW,EAClB,MAAO,IAAO,MAAM,GAGtB,GAAI,GACJ,GAAI,IAAW,OAEb,IADA,EAAS,EACJ,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAC7B,GAAU,EAAK,GAAG,OAItB,GAAI,GAAS,GAAO,YAAY,GAC5B,EAAM,EACV,IAAK,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAAG,CAChC,GAAI,GAAM,EAAK,GACf,GAAI,CAAC,GAAiB,GACpB,KAAM,IAAI,WAAU,+CAEtB,EAAI,KAAK,EAAQ,GACjB,GAAO,EAAI,OAEb,MAAO,IAGT,YAAqB,EAAQ,EAAU,CACrC,GAAI,GAAiB,GACnB,MAAO,GAAO,OAEhB,GAAI,MAAO,cAAgB,aAAe,MAAO,aAAY,QAAW,YACnE,aAAY,OAAO,IAAW,YAAkB,cACnD,MAAO,GAAO,WAEhB,AAAI,MAAO,IAAW,UACpB,GAAS,GAAK,GAGhB,GAAI,GAAM,EAAO,OACjB,GAAI,IAAQ,EAAG,MAAO,GAItB,OADI,GAAc,KAEhB,OAAQ,OACD,YACA,aACA,SACH,MAAO,OACJ,WACA,YACA,QACH,MAAO,IAAY,GAAQ,WACxB,WACA,YACA,cACA,WACH,MAAO,GAAM,MACV,MACH,MAAO,KAAQ,MACZ,SACH,MAAO,IAAc,GAAQ,eAE7B,GAAI,EAAa,MAAO,IAAY,GAAQ,OAC5C,EAAY,IAAK,GAAU,cAC3B,EAAc,IAItB,GAAO,WAAa,GAEpB,YAAuB,EAAU,EAAO,EAAK,CAC3C,GAAI,GAAc,GA8BlB,GArBI,KAAU,QAAa,EAAQ,IACjC,GAAQ,GAIN,EAAQ,KAAK,QAIb,MAAQ,QAAa,EAAM,KAAK,SAClC,GAAM,KAAK,QAGT,GAAO,IAKX,MAAS,EACT,KAAW,EAEP,GAAO,GACT,MAAO,GAKT,IAFK,GAAU,GAAW,UAGxB,OAAQ,OACD,MACH,MAAO,IAAS,KAAM,EAAO,OAE1B,WACA,QACH,MAAO,IAAU,KAAM,EAAO,OAE3B,QACH,MAAO,IAAW,KAAM,EAAO,OAE5B,aACA,SACH,MAAO,IAAY,KAAM,EAAO,OAE7B,SACH,MAAO,IAAY,KAAM,EAAO,OAE7B,WACA,YACA,cACA,WACH,MAAO,IAAa,KAAM,EAAO,WAGjC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAuB,GAC5D,EAAY,GAAW,IAAI,cAC3B,EAAc,IAOtB,GAAO,UAAU,UAAY,GAE7B,YAAe,EAAG,EAAG,EAAG,CACtB,GAAI,GAAI,EAAE,GACV,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EAGT,GAAO,UAAU,OAAS,UAAmB,CAC3C,GAAI,GAAM,KAAK,OACf,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAEpB,MAAO,OAGT,GAAO,UAAU,OAAS,UAAmB,CAC3C,GAAI,GAAM,KAAK,OACf,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAClB,GAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,OAGT,GAAO,UAAU,OAAS,UAAmB,CAC3C,GAAI,GAAM,KAAK,OACf,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAClB,GAAK,KAAM,EAAI,EAAG,EAAI,GACtB,GAAK,KAAM,EAAI,EAAG,EAAI,GACtB,GAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,OAGT,GAAO,UAAU,SAAW,UAAqB,CAC/C,GAAI,GAAS,KAAK,OAAS,EAC3B,MAAI,KAAW,EAAU,GACrB,UAAU,SAAW,EAAU,GAAU,KAAM,EAAG,GAC/C,GAAa,MAAM,KAAM,YAGlC,GAAO,UAAU,OAAS,SAAiB,EAAG,CAC5C,GAAI,CAAC,GAAiB,GAAI,KAAM,IAAI,WAAU,6BAC9C,MAAI,QAAS,EAAU,GAChB,GAAO,QAAQ,KAAM,KAAO,GAGrC,GAAO,UAAU,QAAU,UAAoB,CAC7C,GAAI,GAAM,GACN,EAAM,GACV,MAAI,MAAK,OAAS,GAChB,GAAM,KAAK,SAAS,MAAO,EAAG,GAAK,MAAM,SAAS,KAAK,KACnD,KAAK,OAAS,GAAK,IAAO,UAEzB,WAAa,EAAM,KAG5B,GAAO,UAAU,QAAU,SAAkB,EAAQ,EAAO,EAAK,EAAW,EAAS,CACnF,GAAI,CAAC,GAAiB,GACpB,KAAM,IAAI,WAAU,6BAgBtB,GAbI,IAAU,QACZ,GAAQ,GAEN,IAAQ,QACV,GAAM,EAAS,EAAO,OAAS,GAE7B,IAAc,QAChB,GAAY,GAEV,IAAY,QACd,GAAU,KAAK,QAGb,EAAQ,GAAK,EAAM,EAAO,QAAU,EAAY,GAAK,EAAU,KAAK,OACtE,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAa,GAAW,GAAS,EACnC,MAAO,GAET,GAAI,GAAa,EACf,MAAO,GAET,GAAI,GAAS,EACX,MAAO,GAQT,GALA,KAAW,EACX,KAAS,EACT,KAAe,EACf,KAAa,EAET,OAAS,EAAQ,MAAO,GAS5B,OAPI,GAAI,EAAU,EACd,EAAI,EAAM,EACV,GAAM,KAAK,IAAI,EAAG,GAElB,GAAW,KAAK,MAAM,EAAW,GACjC,GAAa,EAAO,MAAM,EAAO,GAE5B,GAAI,EAAG,GAAI,GAAK,EAAE,GACzB,GAAI,GAAS,MAAO,GAAW,IAAI,CACjC,EAAI,GAAS,IACb,EAAI,GAAW,IACf,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,GAYT,YAA+B,EAAQ,EAAK,EAAY,EAAU,EAAK,CAErE,GAAI,EAAO,SAAW,EAAG,MAAO,GAmBhC,GAhBA,AAAI,MAAO,IAAe,SACxB,GAAW,EACX,EAAa,GACR,AAAI,EAAa,WACtB,EAAa,WACJ,EAAa,aACtB,GAAa,aAEf,EAAa,CAAC,EACV,MAAM,IAER,GAAa,EAAM,EAAK,EAAO,OAAS,GAItC,EAAa,GAAG,GAAa,EAAO,OAAS,GAC7C,GAAc,EAAO,OAAQ,CAC/B,GAAI,EAAK,MAAO,GACX,EAAa,EAAO,OAAS,UACzB,EAAa,EACtB,GAAI,EAAK,EAAa,MACjB,OAAO,GASd,GALI,MAAO,IAAQ,UACjB,GAAM,GAAO,KAAK,EAAK,IAIrB,GAAiB,GAEnB,MAAI,GAAI,SAAW,EACV,GAEF,GAAa,EAAQ,EAAK,EAAY,EAAU,GAClD,GAAI,MAAO,IAAQ,SAExB,MADA,GAAM,EAAM,IACR,GAAO,qBACP,MAAO,YAAW,UAAU,SAAY,WACtC,EACK,WAAW,UAAU,QAAQ,KAAK,EAAQ,EAAK,GAE/C,WAAW,UAAU,YAAY,KAAK,EAAQ,EAAK,GAGvD,GAAa,EAAQ,CAAE,GAAO,EAAY,EAAU,GAG7D,KAAM,IAAI,WAAU,wCAGtB,YAAuB,EAAK,EAAK,EAAY,EAAU,EAAK,CAC1D,GAAI,GAAY,EACZ,EAAY,EAAI,OAChB,EAAY,EAAI,OAEpB,GAAI,IAAa,QACf,GAAW,OAAO,GAAU,cACxB,IAAa,QAAU,IAAa,SACpC,IAAa,WAAa,IAAa,YAAY,CACrD,GAAI,EAAI,OAAS,GAAK,EAAI,OAAS,EACjC,MAAO,GAET,EAAY,EACZ,GAAa,EACb,GAAa,EACb,GAAc,EAIlB,YAAe,GAAK,GAAG,CACrB,MAAI,KAAc,EACT,GAAI,IAEJ,GAAI,aAAa,GAAI,GAIhC,GAAI,IACJ,GAAI,EAAK,CACP,GAAI,IAAa,GACjB,IAAK,GAAI,EAAY,GAAI,EAAW,KAClC,GAAI,GAAK,EAAK,MAAO,GAAK,EAAK,KAAe,GAAK,EAAI,GAAI,KAEzD,GADI,KAAe,IAAI,IAAa,IAChC,GAAI,GAAa,IAAM,EAAW,MAAO,IAAa,MAE1D,AAAI,MAAe,IAAI,KAAK,GAAI,IAChC,GAAa,OAKjB,KADI,EAAa,EAAY,GAAW,GAAa,EAAY,GAC5D,GAAI,EAAY,IAAK,EAAG,KAAK,CAEhC,OADI,IAAQ,GACH,GAAI,EAAG,GAAI,EAAW,KAC7B,GAAI,GAAK,EAAK,GAAI,MAAO,GAAK,EAAK,IAAI,CACrC,GAAQ,GACR,MAGJ,GAAI,GAAO,MAAO,IAItB,MAAO,GAGT,GAAO,UAAU,SAAW,SAAmB,EAAK,EAAY,EAAU,CACxE,MAAO,MAAK,QAAQ,EAAK,EAAY,KAAc,IAGrD,GAAO,UAAU,QAAU,SAAkB,EAAK,EAAY,EAAU,CACtE,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,KAG/D,GAAO,UAAU,YAAc,SAAsB,EAAK,EAAY,EAAU,CAC9E,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,KAG/D,YAAmB,EAAK,EAAQ,EAAQ,EAAQ,CAC9C,EAAS,OAAO,IAAW,EAC3B,GAAI,GAAY,EAAI,OAAS,EAC7B,AAAK,EAGH,GAAS,OAAO,GACZ,EAAS,GACX,GAAS,IAJX,EAAS,EASX,GAAI,GAAS,EAAO,OACpB,GAAI,EAAS,GAAM,EAAG,KAAM,IAAI,WAAU,sBAE1C,AAAI,EAAS,EAAS,GACpB,GAAS,EAAS,GAEpB,OAAS,GAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAC/B,GAAI,GAAS,SAAS,EAAO,OAAO,EAAI,EAAG,GAAI,IAC/C,GAAI,MAAM,GAAS,MAAO,GAC1B,EAAI,EAAS,GAAK,EAEpB,MAAO,GAGT,YAAoB,EAAK,EAAQ,EAAQ,EAAQ,CAC/C,MAAO,IAAW,GAAY,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG3E,YAAqB,EAAK,EAAQ,EAAQ,EAAQ,CAChD,MAAO,IAAW,GAAa,GAAS,EAAK,EAAQ,GAGvD,YAAsB,EAAK,EAAQ,EAAQ,EAAQ,CACjD,MAAO,IAAW,EAAK,EAAQ,EAAQ,GAGzC,YAAsB,EAAK,EAAQ,EAAQ,EAAQ,CACjD,MAAO,IAAW,GAAc,GAAS,EAAK,EAAQ,GAGxD,YAAoB,EAAK,EAAQ,EAAQ,EAAQ,CAC/C,MAAO,IAAW,GAAe,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG9E,GAAO,UAAU,MAAQ,SAAgB,EAAQ,EAAQ,EAAQ,EAAU,CAEzE,GAAI,IAAW,OACb,EAAW,OACX,EAAS,KAAK,OACd,EAAS,UAEA,IAAW,QAAa,MAAO,IAAW,SACnD,EAAW,EACX,EAAS,KAAK,OACd,EAAS,UAEA,SAAS,GAClB,EAAS,EAAS,EAClB,AAAI,SAAS,GACX,GAAS,EAAS,EACd,IAAa,QAAW,GAAW,SAEvC,GAAW,EACX,EAAS,YAIX,MAAM,IAAI,OACR,2EAIJ,GAAI,GAAY,KAAK,OAAS,EAG9B,GAFI,KAAW,QAAa,EAAS,IAAW,GAAS,GAEpD,EAAO,OAAS,GAAM,GAAS,GAAK,EAAS,IAAO,EAAS,KAAK,OACrE,KAAM,IAAI,YAAW,0CAGvB,AAAK,GAAU,GAAW,QAG1B,OADI,GAAc,KAEhB,OAAQ,OACD,MACH,MAAO,IAAS,KAAM,EAAQ,EAAQ,OAEnC,WACA,QACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,OAEpC,QACH,MAAO,IAAW,KAAM,EAAQ,EAAQ,OAErC,aACA,SACH,MAAO,IAAY,KAAM,EAAQ,EAAQ,OAEtC,SAEH,MAAO,IAAY,KAAM,EAAQ,EAAQ,OAEtC,WACA,YACA,cACA,WACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,WAGvC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAuB,GAC5D,EAAY,IAAK,GAAU,cAC3B,EAAc,KAKtB,GAAO,UAAU,OAAS,UAAmB,CAC3C,MAAO,CACL,KAAM,SACN,KAAM,MAAM,UAAU,MAAM,KAAK,KAAK,MAAQ,KAAM,KAIxD,YAAsB,EAAK,EAAO,EAAK,CACrC,MAAI,KAAU,GAAK,IAAQ,EAAI,OACtB,GAAc,GAEd,GAAc,EAAI,MAAM,EAAO,IAI1C,YAAoB,EAAK,EAAO,EAAK,CACnC,EAAM,KAAK,IAAI,EAAI,OAAQ,GAI3B,OAHI,GAAM,GAEN,EAAI,EACD,EAAI,GAAK,CACd,GAAI,GAAY,EAAI,GAChB,EAAY,KACZ,EAAoB,EAAY,IAAQ,EACvC,EAAY,IAAQ,EACpB,EAAY,IAAQ,EACrB,EAEJ,GAAI,EAAI,GAAoB,EAAK,CAC/B,GAAI,IAAY,GAAW,GAAY,GAEvC,OAAQ,OACD,GACH,AAAI,EAAY,KACd,GAAY,GAEd,UACG,GACH,GAAa,EAAI,EAAI,GAChB,IAAa,MAAU,KAC1B,IAAiB,GAAY,KAAS,EAAO,GAAa,GACtD,GAAgB,KAClB,GAAY,KAGhB,UACG,GACH,GAAa,EAAI,EAAI,GACrB,GAAY,EAAI,EAAI,GACf,IAAa,MAAU,KAAS,IAAY,MAAU,KACzD,IAAiB,GAAY,KAAQ,GAAO,IAAa,KAAS,EAAO,GAAY,GACjF,GAAgB,MAAU,IAAgB,OAAU,GAAgB,QACtE,GAAY,KAGhB,UACG,GACH,GAAa,EAAI,EAAI,GACrB,GAAY,EAAI,EAAI,GACpB,GAAa,EAAI,EAAI,GAChB,IAAa,MAAU,KAAS,IAAY,MAAU,KAAS,IAAa,MAAU,KACzF,IAAiB,GAAY,KAAQ,GAAQ,IAAa,KAAS,GAAO,IAAY,KAAS,EAAO,GAAa,GAC/G,GAAgB,OAAU,GAAgB,SAC5C,GAAY,MAMtB,AAAI,IAAc,KAGhB,GAAY,MACZ,EAAmB,GACV,EAAY,OAErB,IAAa,MACb,EAAI,KAAK,IAAc,GAAK,KAAQ,OACpC,EAAY,MAAS,EAAY,MAGnC,EAAI,KAAK,GACT,GAAK,EAGP,MAAO,IAAsB,GAM/B,GAAI,IAAuB,KAE3B,YAAgC,EAAY,CAC1C,GAAI,GAAM,EAAW,OACrB,GAAI,GAAO,GACT,MAAO,QAAO,aAAa,MAAM,OAAQ,GAM3C,OAFI,GAAM,GACN,EAAI,EACD,EAAI,GACT,GAAO,OAAO,aAAa,MACzB,OACA,EAAW,MAAM,EAAG,GAAK,KAG7B,MAAO,GAGT,YAAqB,EAAK,EAAO,EAAK,CACpC,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,GAAK,KAEtC,MAAO,GAGT,YAAsB,EAAK,EAAO,EAAK,CACrC,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,IAEjC,MAAO,GAGT,YAAmB,EAAK,EAAO,EAAK,CAClC,GAAI,GAAM,EAAI,OAEd,AAAI,EAAC,GAAS,EAAQ,IAAG,GAAQ,GAC7B,EAAC,GAAO,EAAM,GAAK,EAAM,IAAK,GAAM,GAGxC,OADI,GAAM,GACD,EAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,GAAM,EAAI,IAEnB,MAAO,GAGT,YAAuB,EAAK,EAAO,EAAK,CAGtC,OAFI,GAAQ,EAAI,MAAM,EAAO,GACzB,EAAM,GACD,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EACrC,GAAO,OAAO,aAAa,EAAM,GAAK,EAAM,EAAI,GAAK,KAEvD,MAAO,GAGT,GAAO,UAAU,MAAQ,SAAgB,EAAO,EAAK,CACnD,GAAI,GAAM,KAAK,OACf,EAAQ,CAAC,CAAC,EACV,EAAM,IAAQ,OAAY,EAAM,CAAC,CAAC,EAElC,AAAI,EAAQ,EACV,IAAS,EACL,EAAQ,GAAG,GAAQ,IACd,EAAQ,GACjB,GAAQ,GAGV,AAAI,EAAM,EACR,IAAO,EACH,EAAM,GAAG,GAAM,IACV,EAAM,GACf,GAAM,GAGJ,EAAM,GAAO,GAAM,GAEvB,GAAI,GACJ,GAAI,GAAO,oBACT,EAAS,KAAK,SAAS,EAAO,GAC9B,EAAO,UAAY,GAAO,cACrB,CACL,GAAI,GAAW,EAAM,EACrB,EAAS,GAAI,IAAO,EAAU,QAC9B,OAAS,GAAI,EAAG,EAAI,EAAU,EAAE,EAC9B,EAAO,GAAK,KAAK,EAAI,GAIzB,MAAO,IAMT,YAAsB,EAAQ,EAAK,EAAQ,CACzC,GAAK,EAAS,GAAO,GAAK,EAAS,EAAG,KAAM,IAAI,YAAW,sBAC3D,GAAI,EAAS,EAAM,EAAQ,KAAM,IAAI,YAAW,yCAGlD,GAAO,UAAU,WAAa,SAAqB,EAAQ,EAAY,EAAU,CAC/E,EAAS,EAAS,EAClB,EAAa,EAAa,EACrB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAKpD,OAHI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACD,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAG5B,MAAO,IAGT,GAAO,UAAU,WAAa,SAAqB,EAAQ,EAAY,EAAU,CAC/E,EAAS,EAAS,EAClB,EAAa,EAAa,EACrB,GACH,GAAY,EAAQ,EAAY,KAAK,QAKvC,OAFI,GAAM,KAAK,EAAS,EAAE,GACtB,EAAM,EACH,EAAa,GAAM,IAAO,MAC/B,GAAO,KAAK,EAAS,EAAE,GAAc,EAGvC,MAAO,IAGT,GAAO,UAAU,UAAY,SAAoB,EAAQ,EAAU,CACjE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,IAGd,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,GAAW,KAAK,EAAS,IAAM,GAG7C,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACnC,KAAK,IAAW,EAAK,KAAK,EAAS,IAG7C,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QAElC,MAAK,GACT,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAAM,IACpB,KAAK,EAAS,GAAK,UAG1B,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,GAAU,SACnB,MAAK,EAAS,IAAM,GACrB,KAAK,EAAS,IAAM,EACrB,KAAK,EAAS,KAGlB,GAAO,UAAU,UAAY,SAAoB,EAAQ,EAAY,EAAU,CAC7E,EAAS,EAAS,EAClB,EAAa,EAAa,EACrB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAKpD,OAHI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACD,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAE5B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,GAGT,GAAO,UAAU,UAAY,SAAoB,EAAQ,EAAY,EAAU,CAC7E,EAAS,EAAS,EAClB,EAAa,EAAa,EACrB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAKpD,OAHI,GAAI,EACJ,EAAM,EACN,EAAM,KAAK,EAAS,EAAE,GACnB,EAAI,GAAM,IAAO,MACtB,GAAO,KAAK,EAAS,EAAE,GAAK,EAE9B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,GAGT,GAAO,UAAU,SAAW,SAAmB,EAAQ,EAAU,CAE/D,MADK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACvC,AAAE,KAAK,GAAU,IACZ,KAAO,KAAK,GAAU,GAAK,GADA,KAAK,IAI3C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,AAAK,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAI,GAAM,KAAK,GAAW,KAAK,EAAS,IAAM,EAC9C,MAAQ,GAAM,MAAU,EAAM,WAAa,GAG7C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,AAAK,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAI,GAAM,KAAK,EAAS,GAAM,KAAK,IAAW,EAC9C,MAAQ,GAAM,MAAU,EAAM,WAAa,GAG7C,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,GACV,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAAM,GACpB,KAAK,EAAS,IAAM,IAGzB,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,IAAW,GACrB,KAAK,EAAS,IAAM,GACpB,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAGnB,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAK,KAAM,EAAQ,GAAM,GAAI,IAGtC,GAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAK,KAAM,EAAQ,GAAO,GAAI,IAGvC,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAK,KAAM,EAAQ,GAAM,GAAI,IAGtC,GAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,MAAK,IAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAK,KAAM,EAAQ,GAAO,GAAI,IAGvC,YAAmB,EAAK,EAAO,EAAQ,EAAK,EAAK,EAAK,CACpD,GAAI,CAAC,GAAiB,GAAM,KAAM,IAAI,WAAU,+CAChD,GAAI,EAAQ,GAAO,EAAQ,EAAK,KAAM,IAAI,YAAW,qCACrD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBAGtD,GAAO,UAAU,YAAc,SAAsB,EAAO,EAAQ,EAAY,EAAU,CAIxF,GAHA,EAAQ,CAAC,EACT,EAAS,EAAS,EAClB,EAAa,EAAa,EACtB,CAAC,EAAU,CACb,GAAI,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC7C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAM,EACN,EAAI,EAER,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,IAAO,MACjC,KAAK,EAAS,GAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,GAGlB,GAAO,UAAU,YAAc,SAAsB,EAAO,EAAQ,EAAY,EAAU,CAIxF,GAHA,EAAQ,CAAC,EACT,EAAS,EAAS,EAClB,EAAa,EAAa,EACtB,CAAC,EAAU,CACb,GAAI,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC7C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAI,EAAa,EACjB,EAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,IAAO,MACzB,KAAK,EAAS,GAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,GAGlB,GAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAU,CAC1E,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,GACjD,GAAO,qBAAqB,GAAQ,KAAK,MAAM,IACpD,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,YAA4B,EAAK,EAAO,EAAQ,EAAc,CAC5D,AAAI,EAAQ,GAAG,GAAQ,MAAS,EAAQ,GACxC,OAAS,GAAI,EAAG,EAAI,KAAK,IAAI,EAAI,OAAS,EAAQ,GAAI,EAAI,EAAG,EAAE,EAC7D,EAAI,EAAS,GAAM,GAAS,KAAS,EAAK,GAAe,EAAI,EAAI,MAC9D,GAAe,EAAI,EAAI,GAAK,EAInC,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,AAAI,GAAO,oBACT,MAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,GAE9B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,AAAI,GAAO,oBACT,MAAK,GAAW,IAAU,EAC1B,KAAK,EAAS,GAAM,EAAQ,KAE5B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,YAA4B,EAAK,EAAO,EAAQ,EAAc,CAC5D,AAAI,EAAQ,GAAG,GAAQ,WAAa,EAAQ,GAC5C,OAAS,GAAI,EAAG,EAAI,KAAK,IAAI,EAAI,OAAS,EAAQ,GAAI,EAAI,EAAG,EAAE,EAC7D,EAAI,EAAS,GAAM,IAAW,GAAe,EAAI,EAAI,GAAK,EAAK,IAInE,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,AAAI,GAAO,oBACT,MAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,GAAW,EAAQ,KAExB,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,AAAI,GAAO,oBACT,MAAK,GAAW,IAAU,GAC1B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,EAAQ,KAE5B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,GAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAY,EAAU,CAGtF,GAFA,EAAQ,CAAC,EACT,EAAS,EAAS,EACd,CAAC,EAAU,CACb,GAAI,GAAQ,KAAK,IAAI,EAAG,EAAI,EAAa,GAEzC,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EACJ,EAAM,EACN,GAAM,EAEV,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,IAAO,MACjC,AAAI,EAAQ,GAAK,KAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,IAAM,GAER,KAAK,EAAS,GAAO,GAAQ,GAAQ,GAAK,GAAM,IAGlD,MAAO,GAAS,GAGlB,GAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAY,EAAU,CAGtF,GAFA,EAAQ,CAAC,EACT,EAAS,EAAS,EACd,CAAC,EAAU,CACb,GAAI,GAAQ,KAAK,IAAI,EAAG,EAAI,EAAa,GAEzC,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EAAa,EACjB,EAAM,EACN,GAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,IAAO,MACzB,AAAI,EAAQ,GAAK,KAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,IAAM,GAER,KAAK,EAAS,GAAO,GAAQ,GAAQ,GAAK,GAAM,IAGlD,MAAO,GAAS,GAGlB,GAAO,UAAU,UAAY,SAAoB,EAAO,EAAQ,EAAU,CACxE,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,MACjD,GAAO,qBAAqB,GAAQ,KAAK,MAAM,IAChD,EAAQ,GAAG,GAAQ,IAAO,EAAQ,GACtC,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,AAAI,GAAO,oBACT,MAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,GAE9B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,AAAI,GAAO,oBACT,MAAK,GAAW,IAAU,EAC1B,KAAK,EAAS,GAAM,EAAQ,KAE5B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aAC5D,AAAI,GAAO,oBACT,MAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,IAE9B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,EAAS,EACb,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aACxD,EAAQ,GAAG,GAAQ,WAAa,EAAQ,GAC5C,AAAI,GAAO,oBACT,MAAK,GAAW,IAAU,GAC1B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,EAAQ,KAE5B,GAAkB,KAAM,EAAO,EAAQ,IAElC,EAAS,GAGlB,YAAuB,EAAK,EAAO,EAAQ,EAAK,EAAK,EAAK,CACxD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBACpD,GAAI,EAAS,EAAG,KAAM,IAAI,YAAW,sBAGvC,YAAqB,EAAK,EAAO,EAAQ,EAAc,EAAU,CAC/D,MAAK,IACH,GAAa,EAAK,EAAO,EAAQ,GAEnC,GAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GACrC,EAAS,EAGlB,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAM,IAG/C,GAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAO,IAGhD,YAAsB,EAAK,EAAO,EAAQ,EAAc,EAAU,CAChE,MAAK,IACH,GAAa,EAAK,EAAO,EAAQ,GAEnC,GAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GACrC,EAAS,EAGlB,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAM,IAGhD,GAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAO,IAIjD,GAAO,UAAU,KAAO,SAAe,EAAQ,EAAa,EAAO,EAAK,CAStE,GARK,GAAO,GAAQ,GAChB,CAAC,GAAO,IAAQ,GAAG,GAAM,KAAK,QAC9B,GAAe,EAAO,QAAQ,GAAc,EAAO,QAClD,GAAa,GAAc,GAC5B,EAAM,GAAK,EAAM,GAAO,GAAM,GAG9B,IAAQ,GACR,EAAO,SAAW,GAAK,KAAK,SAAW,EAAG,MAAO,GAGrD,GAAI,EAAc,EAChB,KAAM,IAAI,YAAW,6BAEvB,GAAI,EAAQ,GAAK,GAAS,KAAK,OAAQ,KAAM,IAAI,YAAW,6BAC5D,GAAI,EAAM,EAAG,KAAM,IAAI,YAAW,2BAGlC,AAAI,EAAM,KAAK,QAAQ,GAAM,KAAK,QAC9B,EAAO,OAAS,EAAc,EAAM,GACtC,GAAM,EAAO,OAAS,EAAc,GAGtC,GAAI,GAAM,EAAM,EACZ,EAEJ,GAAI,OAAS,GAAU,EAAQ,GAAe,EAAc,EAE1D,IAAK,EAAI,EAAM,EAAG,GAAK,EAAG,EAAE,EAC1B,EAAO,EAAI,GAAe,KAAK,EAAI,WAE5B,EAAM,KAAQ,CAAC,GAAO,oBAE/B,IAAK,EAAI,EAAG,EAAI,EAAK,EAAE,EACrB,EAAO,EAAI,GAAe,KAAK,EAAI,OAGrC,YAAW,UAAU,IAAI,KACvB,EACA,KAAK,SAAS,EAAO,EAAQ,GAC7B,GAIJ,MAAO,IAOT,GAAO,UAAU,KAAO,SAAe,EAAK,EAAO,EAAK,EAAU,CAEhE,GAAI,MAAO,IAAQ,SAAU,CAS3B,GARA,AAAI,MAAO,IAAU,SACnB,GAAW,EACX,EAAQ,EACR,EAAM,KAAK,QACF,MAAO,IAAQ,UACxB,GAAW,EACX,EAAM,KAAK,QAET,EAAI,SAAW,EAAG,CACpB,GAAI,GAAO,EAAI,WAAW,GAC1B,AAAI,EAAO,KACT,GAAM,GAGV,GAAI,IAAa,QAAa,MAAO,IAAa,SAChD,KAAM,IAAI,WAAU,6BAEtB,GAAI,MAAO,IAAa,UAAY,CAAC,GAAO,WAAW,GACrD,KAAM,IAAI,WAAU,qBAAuB,OAExC,AAAI,OAAO,IAAQ,UACxB,GAAM,EAAM,KAId,GAAI,EAAQ,GAAK,KAAK,OAAS,GAAS,KAAK,OAAS,EACpD,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAO,EACT,MAAO,MAGT,EAAQ,IAAU,EAClB,EAAM,IAAQ,OAAY,KAAK,OAAS,IAAQ,EAE3C,GAAK,GAAM,GAEhB,GAAI,GACJ,GAAI,MAAO,IAAQ,SACjB,IAAK,EAAI,EAAO,EAAI,EAAK,EAAE,EACzB,KAAK,GAAK,MAEP,CACL,GAAI,GAAQ,GAAiB,GACzB,EACA,GAAY,GAAI,IAAO,EAAK,GAAU,YACtC,GAAM,EAAM,OAChB,IAAK,EAAI,EAAG,EAAI,EAAM,EAAO,EAAE,EAC7B,KAAK,EAAI,GAAS,EAAM,EAAI,IAIhC,MAAO,OAMT,GAAI,IAAoB,qBAExB,YAAsB,EAAK,CAIzB,GAFA,EAAM,GAAW,GAAK,QAAQ,GAAmB,IAE7C,EAAI,OAAS,EAAG,MAAO,GAE3B,KAAO,EAAI,OAAS,GAAM,GACxB,EAAM,EAAM,IAEd,MAAO,GAGT,YAAqB,EAAK,CACxB,MAAI,GAAI,KAAa,EAAI,OAClB,EAAI,QAAQ,aAAc,IAGnC,YAAgB,EAAG,CACjB,MAAI,GAAI,GAAW,IAAM,EAAE,SAAS,IAC7B,EAAE,SAAS,IAGpB,YAAsB,EAAQ,EAAO,CACnC,EAAQ,GAAS,SAMjB,OALI,GACA,EAAS,EAAO,OAChB,EAAgB,KAChB,EAAQ,GAEH,EAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAI/B,GAHA,EAAY,EAAO,WAAW,GAG1B,EAAY,OAAU,EAAY,MAAQ,CAE5C,GAAI,CAAC,EAAe,CAElB,GAAI,EAAY,MAAQ,CAEtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,iBACS,EAAI,IAAM,EAAQ,CAE3B,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,SAIF,EAAgB,EAEhB,SAIF,GAAI,EAAY,MAAQ,CACtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,EAAgB,EAChB,SAIF,EAAa,GAAgB,OAAU,GAAK,EAAY,OAAU,UAC7D,AAAI,IAEJ,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAMhD,GAHA,EAAgB,KAGZ,EAAY,IAAM,CACpB,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KAAK,WACF,EAAY,KAAO,CAC5B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,EAAM,IACnB,EAAY,GAAO,aAEZ,EAAY,MAAS,CAC9B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,GAAM,IACnB,GAAa,EAAM,GAAO,IAC1B,EAAY,GAAO,aAEZ,EAAY,QAAU,CAC/B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,GAAO,IACpB,GAAa,GAAM,GAAO,IAC1B,GAAa,EAAM,GAAO,IAC1B,EAAY,GAAO,SAGrB,MAAM,IAAI,OAAM,sBAIpB,MAAO,GAGT,YAAuB,EAAK,CAE1B,OADI,GAAY,GACP,EAAI,EAAG,EAAI,EAAI,OAAQ,EAAE,EAEhC,EAAU,KAAK,EAAI,WAAW,GAAK,KAErC,MAAO,GAGT,YAAyB,EAAK,EAAO,CAGnC,OAFI,GAAG,EAAI,EACP,EAAY,GACP,EAAI,EAAG,EAAI,EAAI,QACjB,MAAS,GAAK,GADW,EAAE,EAGhC,EAAI,EAAI,WAAW,GACnB,EAAK,GAAK,EACV,EAAK,EAAI,IACT,EAAU,KAAK,GACf,EAAU,KAAK,GAGjB,MAAO,GAIT,YAAwB,EAAK,CAC3B,MAAO,IAAY,GAAY,IAGjC,YAAqB,EAAK,EAAK,EAAQ,EAAQ,CAC7C,OAAS,GAAI,EAAG,EAAI,GACb,IAAI,GAAU,EAAI,QAAY,GAAK,EAAI,QADlB,EAAE,EAE5B,EAAI,EAAI,GAAU,EAAI,GAExB,MAAO,GAGT,YAAgB,EAAK,CACnB,MAAO,KAAQ,EAOjB,YAAkB,EAAK,CACrB,MAAO,IAAO,MAAS,EAAC,CAAC,EAAI,WAAa,GAAa,IAAQ,GAAa,IAG9E,YAAuB,EAAK,CAC1B,MAAO,CAAC,CAAC,EAAI,aAAe,MAAO,GAAI,YAAY,UAAa,YAAc,EAAI,YAAY,SAAS,GAIzG,YAAuB,EAAK,CAC1B,MAAO,OAAO,GAAI,aAAgB,YAAc,MAAO,GAAI,OAAU,YAAc,GAAa,EAAI,MAAM,EAAG,gBCt7DnF,EAAkB,EAAkB,CAC9D,GAAM,GAAM,IAAa,EAAI,GAAI,YAAW,GAAO,GAAI,aAAY,GACnE,MAAO,OAAM,KAAK,GACf,IAAI,SAAA,EAAC,CAAI,MAAA,QAAO,aAAa,KAC7B,KAAK,IAGV,YAA+B,EAAgB,CAC7C,GAAM,GAAM,GAAY,EAAK,GAC7B,MAAO,IAAO,KAAK,EAAK,UAAU,SAAS,UAG7C,YAA4B,EAAa,EAAkB,CAGzD,OAFM,GACJ,IAAa,EAAI,GAAI,YAAW,EAAI,QAAU,GAAI,aAAY,EAAI,QAC3D,EAAI,EAAG,EAAS,EAAI,OAAQ,EAAI,EAAQ,IAC/C,EAAK,GAAK,EAAI,WAAW,GAE3B,MAAO,GAAK,OAGd,YAA+B,EAAc,CAC3C,GAAM,GAAM,GAAO,KAAK,EAAQ,UAAU,SAAS,UACnD,MAAO,IAAY,EAAK,GAG1B,aAA8B,CAC5B,MAAO,IAAI,YAAW,CAAC,EAAM,EAAM,IAGrC,YAA0B,EAAc,CACtC,GAAM,GAAM,GAAI,YAAW,GAC3B,kBAAW,OAAO,gBAAgB,GAC3B,EAAI,OAGb,YAAyB,EAAkB,EAAgB,CACzD,GAAM,GAAQ,GAAI,YAAW,GACvB,EAAQ,GAAI,YAAW,GACvB,EAAS,GAAI,YAAW,EAAM,OAAS,EAAM,QACnD,SAAO,IAAI,GACX,EAAO,IAAI,EAAO,EAAM,QACjB,EAAO,OAGT,GAAM,IAAqB,SAAC,EAAQ,CACzC,MAAO,GAAe,EAAK,SAAC,EAAG,CAAK,MAAA,IAAY,EAAK,EAAS,OAGnD,GAAsB,SAAC,EAAQ,CAC1C,MAAO,GAAe,EAAK,SAAC,EAAG,CAAK,MAAA,IAAY,EAAK,EAAS,QAGnD,GAAuB,SAAC,EAAQ,CAC3C,MAAO,GAAe,EAAK,KAGhB,GAAwB,SAAC,EAAU,EAAkB,CAChE,OAAQ,OACD,GAAG,MAAO,IAAmB,WACzB,MAAO,IAAoB,KAI3B,EAAiB,SAAC,EAAU,EAAqC,CAC5E,GAAI,MAAO,IAAQ,SACjB,MAAO,GAAQ,GACV,GAAI,MAAO,IAAQ,UAAY,EAAI,aAAe,OAAW,CAElE,GAAM,GAAO,GAAI,YAAW,GAC5B,MAAO,GAAK,WAEZ,MAAM,IAAI,OAAM,8DAKpB,WAAsC,EAAQ,kEAC5C,MAAA,CAAA,EAAO,GAAI,SAAQ,SAAA,EAAO,CAClB,GAAA,GAAA,GAAA,gBAAE,EAAA,EAAA,MAAO,EAAA,EAAA,MACf,EAAM,UAAY,SAAA,EAAE,CAAI,MAAA,GAAQ,EAAG,OACnC,EAAM,YAAY,UAItB,GAAA,GAAe,CACb,YAAW,GACX,eAAc,GACd,YAAW,GACX,eAAc,GACd,eAAc,GACd,UAAS,GACT,SAAQ,GACR,mBAAkB,GAClB,oBAAmB,GACnB,qBAAoB,GACpB,eAAc,EACd,gBAAe,6RClGJ,EAAe,OACf,EAAgB,QAChB,GAAe,WACf,GAAgB,oBAChB,GAAc,IAEd,GAAuB,MACvB,GAAoB,EAAS,MAC7B,GAAmB,EAAQ,MAE3B,GAAmB,EAAQ,QAC3B,GAAmB,EAAc,KACjC,GAAkB,GAElB,GAAmB,EAAQ,QAC3B,GAAoB,EAAS,IAE7B,GAAqB,WACrB,GAAwB,WACxB,GAAyB,YAEtC,GAAe,CACb,aAAY,EACZ,cAAa,EACb,aAAY,GACZ,cAAa,GACb,YAAW,GACX,qBAAoB,GACpB,kBAAiB,GACjB,iBAAgB,GAChB,iBAAgB,GAChB,gBAAe,GACf,iBAAgB,GAChB,kBAAiB,GACjB,mBAAkB,GAClB,sBAAqB,GACrB,uBAAsB,2XChCtB,EACA,EAAW,0EAEX,UAAiB,GACX,EAAM,IAAQ,GAAO,KAAO,EAAe,EAC3C,EACJ,IAAQ,GAAO,KAAO,CAAC,YAAa,cAAgB,CAAC,OAAQ,UAC/D,CAAA,EAAO,WAAW,OAAO,OAAO,YAC9B,CAAE,KAAM,EAAK,WAAY,GACzB,GACA,QAIJ,YAAsC,EAAmB,EAAiB,EAAW,4EACnF,UAAiB,GACX,EAAM,IAAQ,GAAO,KAAO,EAAe,EAC3C,EACJ,IAAQ,GAAO,KAAO,GAAK,CAAC,UACxB,EAAM,EAAM,eAAe,GACjC,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,MACA,EACA,CAAE,KAAM,EAAK,WAAY,GACzB,GACA,QAIJ,GAAA,IAAe,CACb,YAAW,GACX,gBAAe,gBCjCa,EAA2B,kEACvD,MAAA,CAAA,EAAO,WAAW,OAAO,OAAO,YAC9B,CACE,KAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GACnB,OAAQ,IAAI,KAAA,OAAJ,EAAM,SAAU,IAE1B,GACA,CAAC,UAAW,iBAIhB,YAAgC,EAAmB,EAA2B,wEACtE,SAAM,EAAM,eAAe,GACjC,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,MACA,EACA,CACE,KAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GACnB,OAAQ,IAAI,KAAA,OAAJ,EAAM,SAAU,IAE1B,GACA,CAAC,UAAW,iBAIhB,GAAA,IAAe,CACb,QAAO,GACP,UAAS,gBCzBT,EACA,EACA,EAA2B,kHAErB,GAAO,EAAM,oBAAoB,GACnB,MAAO,IAAQ,SAAf,CAAA,EAAA,GAA0B,CAAA,EAAM,GAAK,UAAU,EAAK,WAA1B,SAAA,GAAA,oBAAkC,EAAA,oBAA1E,SAAW,EACX,EAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GACnB,EAAK,IAAI,KAAA,OAAJ,EAAM,KAAM,EAAM,UAAU,IACrB,CAAA,EAAM,WAAW,OAAO,OAAO,QAC/C,CACE,KAAM,EAEN,GAAI,IAAQ,EAAQ,QAAU,OAAY,EAC1C,QAAS,IAAQ,EAAQ,QAAU,GAAI,YAAW,GAAM,OACxD,OAAQ,IAAQ,EAAQ,QAAU,GAAkB,QAEtD,EACA,WATI,UAAY,GAAA,OAWlB,CAAA,EAAO,EAAM,SAAS,EAAI,UAG5B,YACE,EACA,EACA,EAA2B,qHAErB,GAAa,EAAM,qBAAqB,GAC1B,MAAO,IAAQ,SAAf,CAAA,EAAA,GAA0B,CAAA,EAAM,GAAK,UAAU,EAAK,WAA1B,SAAA,GAAA,oBAAkC,EAAA,oBAA1E,SAAW,EACX,EAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GACnB,EAAK,EAAW,MAAM,EAAG,IACzB,GAAc,EAAW,MAAM,IACrB,CAAA,EAAM,WAAW,OAAO,OAAO,QAC7C,CAAE,KAAM,EAEN,GAAI,IAAQ,EAAQ,QAAU,OAAY,EAC1C,QAAS,IAAQ,EAAQ,QAAU,GAAI,YAAW,GAAM,OACxD,OAAQ,IAAQ,EAAQ,QAAU,GAAkB,QAEtD,EACA,YARI,UAAU,GAAA,OAUhB,CAAA,EAAO,SAGT,YACE,EACA,EACA,EAA2B,+FAER,MAAA,CAAA,EAAM,GAAa,EAAK,EAAK,WAA1C,SAAa,EAAA,OACnB,CAAA,EAAO,EAAM,eAAe,SAG9B,YACE,EACA,EACA,EAA2B,+FAEV,MAAA,CAAA,EAAM,GAAa,EAAK,EAAK,WAAxC,SAAW,EAAA,OACjB,CAAA,EAAO,EAAM,YAAY,EAAU,UAIrC,YAAgC,EAAY,+FAC9B,MAAA,CAAA,EAAM,WAAW,OAAO,OAAO,UAAU,MAAO,WAAtD,SAAM,EAAA,OACZ,CAAA,EAAO,EAAM,eAAe,SAG9B,GAAA,IAAe,CACb,aAAY,GACZ,aAAY,GACZ,QAAO,GACP,QAAO,GACP,UAAS,IC1EX,GAAA,EAAA,EAAA,GACK,IACA,gBCAH,EACA,EACA,EACA,EAAmC,CADnC,MAAA,KAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,8DAEA,MAAA,CAAA,EAAO,WAAW,OAAO,OAAO,KAC9B,CAAE,KAAM,EAAe,KAAM,CAAE,KAAM,IACrC,EACA,GAAsB,EAAK,SAI/B,YACE,EACA,EACA,EACA,EACA,EACA,EAAmC,CAFnC,MAAA,KAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,2GAEO,GAAA,GAAA,WAAW,OAAO,QAAO,WAC9B,CAAE,KAAM,EAAe,KAAM,CAAE,KAAM,KACrC,MAAO,IAAc,SAArB,CAAA,EAAA,GACI,CAAA,EAAM,GAAK,gBAAgB,EAAW,EAAO,GAAO,eAApD,UAAA,GAAA,oBACA,GAAA,oBAJN,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,GAAA,OAAA,CAAA,GAKL,GAAqB,GACrB,GAAsB,EAAK,YAI/B,YACE,EACA,EACA,EACA,EACA,EACA,EAA2B,CAF3B,MAAA,KAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,wGAG0B,OAAO,IAAc,SAArB,CAAA,EAAA,GACtB,CAAA,EAAM,GAAK,gBAAgB,EAAW,EAAO,GAAO,cAApD,SAAA,GAAA,oBACA,EAAA,oBAFE,SAAiB,EAIL,CAAA,EAAM,GAAa,EAAY,EAAmB,WAA9D,UAAY,GAAA,OAClB,CAAA,EAAO,GAAI,aAAa,GAAsB,EAAK,GAAW,GAAW,SAG3E,YACE,EACA,EACA,EACA,EACA,EAA2B,CAD3B,MAAA,KAAA,QAAA,GAAA,uGAG0B,OAAO,IAAc,SAArB,CAAA,EAAA,GACtB,CAAA,EAAM,GAAK,gBAAgB,EAAW,EAAO,GAAO,cAApD,SAAA,GAAA,oBACA,EAAA,oBAFE,SAAiB,EAIL,CAAA,EAAM,GAAa,EAAY,EAAmB,WAA9D,SAAY,GAAA,OAClB,CAAA,EAAO,GAAI,aAAa,GAAqB,GAAM,EAAW,SAGhE,YAAmC,EAAsB,+FAC3C,MAAA,CAAA,EAAM,WAAW,OAAO,OAAO,UAAU,MAAO,EAAQ,mBAA9D,SAAM,EAAA,OACZ,CAAA,EAAO,EAAM,eAAe,SAG9B,YAAmC,EAAwB,EAAsB,EAA2B,kEAC1G,MAAA,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,CAAE,KAAM,EAAc,OAAQ,GAC9B,EACA,CACE,KAAM,IAAI,KAAA,OAAJ,EAAM,MAAO,GACnB,OAAQ,IAAI,KAAA,OAAJ,EAAM,SAAU,IAE1B,GACA,CAAC,UAAW,iBAIhB,GAAA,IAAe,CACb,KAAI,GACJ,OAAM,GACN,QAAO,GACP,QAAO,GACP,aAAY,GACZ,aAAY,IC7ED,GAAgB,CAC3B,KAAM,GACN,MAAO,GACP,QAAS,GACT,QAAS,GACT,QAAS,GACT,QAAS,GACT,SAAU,GACV,UAAW,GACX,YAAa,GACb,aAAc,IAGhB,YACE,EACA,EAA0B,CAA1B,AAAA,IAAA,QAAA,GAAA,IAEA,GAAI,GACJ,MAAK,GAGH,EAAG,EAAA,EAAA,GACE,IACA,GAJL,EAAM,GAOH,IAAQ,KAAA,OAAR,EAAU,OACb,GAAI,KAAO,EAAa,EAAa,IAAM,EAAa,KAEnD,EAKT,aAAgC,iGACd,MAAA,CAAA,EAAM,GAAI,YAAY,GAAmB,GAAO,cAA1D,EAAU,EAAA,qDAEd,CAAA,EAAM,EAAM,gBAAgB,WAA5B,SAAA,sCAEA,CAAA,EAAO,WAET,MAAA,CAAA,EAAO,SAGT,YAAsB,EAAa,EAAgC,CAAhC,MAAA,KAAA,QAAA,GAAA,IACjC,EAAA,EAAA,GACK,GACA,GAIP,YAA4B,EAAW,CACrC,MAAO,CAAE,IAAK,EAAI,QAAS,OAAQ,EAAI,SAGzC,GAAA,IAAe,CACb,cAAa,GACb,UAAS,GACT,WAAU,GACV,MAAK,GACL,YAAW,sHCrEb,GAAA,UAAA,CAKE,WAAY,EAAa,EAAkB,CACzC,KAAK,IAAM,EACX,KAAK,MAAQ,EAGT,SAAA,UAAA,SAAN,UAAA,+FACmB,MAAA,CAAA,EAAM,GAAI,WAAW,KAAK,IAAI,aAAc,KAAK,eAA5D,SAAW,EAAA,OACjB,CAAA,EAAO,GAAe,UAGlB,EAAA,UAAA,QAAN,UAAA,+FACmB,MAAA,CAAA,EAAM,GAAI,WAAW,KAAK,IAAI,YAAa,KAAK,eAA3D,SAAW,EAAA,OACjB,CAAA,EAAO,GAAe,UAGlB,EAAA,UAAA,WAAN,SAAiB,EAAiB,EAAqB,mGAC/C,SAAY,GAAO,MAAM,KAAK,IAAK,GACxB,CAAA,EAAM,GAAI,OAAO,EAAS,KAAK,eAChD,MADM,GAAW,EAAA,OACd,IAAa,KACd,CAAA,EAAO,GAEG,CAAA,EAAM,GAAI,QAAQ,GAAO,YAAY,YAA3C,SAAM,EAAA,OACZ,CAAA,EAAM,GAAI,IAAI,EAAS,EAAK,KAAK,eAAjC,SAAA,OACA,CAAA,EAAO,SAGH,EAAA,UAAA,UAAN,SAAgB,EAAe,+FACjB,MAAA,CAAA,EAAM,GAAI,OAAO,EAAS,KAAK,eAArC,SAAM,EAAA,OACZ,CAAA,EAAO,IAAQ,YAGX,EAAA,UAAA,UAAN,SAAgB,EAAe,kEAC7B,MAAA,CAAA,EAAO,GAAI,GAAG,EAAS,KAAK,aAGxB,EAAA,UAAA,QAAN,UAAA,kEACE,MAAA,CAAA,EAAO,GAAI,UAAU,KAAK,aAGtB,EAAA,UAAA,cAAN,SAAoB,EAAgB,EAAiB,EAAqB,iGAClE,SAAY,GAAO,MAAM,KAAK,IAAK,GAC7B,CAAA,EAAM,GAAI,UAAU,EAAQ,GAAO,YAAY,YAArD,SAAM,EAAA,OACZ,CAAA,EAAM,GAAI,IAAI,EAAS,EAAK,KAAK,eAAjC,SAAA,iBAGI,EAAA,UAAA,cAAN,SAAoB,EAAiB,EAAqB,+FAC5C,MAAA,CAAA,EAAM,KAAK,WAAW,EAAS,WAArC,SAAM,EAAA,OACZ,CAAA,EAAO,GAAI,UAAU,UAGjB,EAAA,UAAA,mBAAN,SAAyB,EAAa,EAAiB,EAAqB,mGACpE,SAAY,GAAO,MAAM,KAAK,IAAK,GAC7B,CAAA,EAAM,KAAK,WAAW,EAAS,WAArC,SAAM,EAAA,OACO,CAAA,EAAM,GAAI,aAC3B,EAAM,YAAY,EAAK,EAAU,UACjC,EACA,GAAO,YAAY,YAHf,SAAa,EAAA,OAKnB,CAAA,EAAO,EAAM,eAAe,UAGxB,EAAA,UAAA,mBAAN,SAAyB,EAAoB,EAAiB,EAAqB,mGAC3E,SAAY,GAAO,MAAM,KAAK,IAAK,GAC7B,CAAA,EAAM,KAAK,WAAW,EAAS,WAArC,SAAM,EAAA,OACK,CAAA,EAAM,GAAI,aACzB,EAAM,eAAe,GACrB,EACA,GAAO,YAAY,YAHf,SAAW,EAAA,OAKjB,CAAA,EAAO,EAAM,YAAY,EAAU,EAAU,iBAEjD,KC3EA,GAAA,SAAA,EAAA,CAAiC,EAAA,EAAA,GAAjC,YAAA,gDAEe,SAAA,KAAb,SAAkB,EAA0B,4GACpC,SAAM,GAAO,UAAS,EAAA,EAAA,GACtB,GAAY,IAAE,CAClB,KAAM,EAAa,OAEb,EAAgD,EAAG,MAA5C,EAAyC,EAAG,UAAjC,EAA8B,EAAG,YAApB,EAAiB,EAAG,aAErD,GAAQ,GAAI,YAAY,GAC9B,CAAA,EAAM,GAAI,qBAAqB,EAAa,UAAA,CAAM,MAChD,IAAK,YAAY,EAAO,GAAO,OAC9B,YAFH,UAAA,OAGA,CAAA,EAAM,GAAI,qBAAqB,EAAc,UAAA,CAAM,MACjD,IAAK,YAAY,EAAO,GAAO,QAC9B,YAFH,UAAA,OAIA,CAAA,EAAO,GAAI,GAAY,EAAK,WAIxB,EAAA,UAAA,KAAN,SAAW,EAAa,EAAqB,uGACrC,SAAY,GAAO,MAAM,KAAK,IAAK,GACxB,CAAA,EAAM,KAAK,mBAAtB,SAAW,GAAA,OAEV,EAAA,GAAA,GAAM,eAAe,CAAA,EAAM,GAAW,KAC3C,EACA,EAAS,WACT,EAAU,SACV,EAAU,iBAJZ,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,CAAqB,GAAA,gBAQxB,EAAA,UAAA,OAAN,SACE,EACA,EACA,EACA,EAAqB,wEAEf,SAAY,GAAO,MAAM,KAAK,IAAK,GAEzC,CAAA,EAAO,GAAW,OAChB,EACA,EACA,EACA,EAAU,SACV,EAAU,MACV,EAAU,eAIR,EAAA,UAAA,QAAN,SACE,EACA,EACA,EAAqB,wGAEf,SAAY,GAAO,MAAM,KAAK,IAAK,GACzB,CAAA,EAAM,KAAK,kBAArB,SAAU,GAAA,OAET,GAAA,GAAA,GAAM,eAAe,CAAA,EAAM,GAAW,QAC3C,EACA,EAAQ,WACR,EACA,EAAU,SACV,EAAU,eALZ,MAAA,CAAA,EAAO,GAAA,MAAA,EAAA,CAAqB,GAAA,gBASxB,EAAA,UAAA,QAAN,SACE,EACA,EACA,EAAqB,wGAEf,SAAY,GAAO,MAAM,KAAK,IAAK,GACzB,CAAA,EAAM,KAAK,kBAArB,SAAU,GAAA,OAET,GAAA,GAAA,GAAM,YACX,CAAA,EAAM,GAAW,QACf,EACA,EAAQ,WACR,EACA,EAAU,eALd,MAAA,CAAA,EAAO,GAAA,MAAA,EAAA,CACL,GAAA,OAMA,EAAU,kBAIR,EAAA,UAAA,cAAN,UAAA,+FACkB,MAAA,CAAA,EAAM,KAAK,kBAArB,SAAU,EAAA,OAChB,CAAA,EAAO,GAAW,aAAa,UAG3B,EAAA,UAAA,eAAN,UAAA,+FACmB,MAAA,CAAA,EAAM,KAAK,mBAAtB,SAAW,EAAA,OACjB,CAAA,EAAO,GAAW,aAAa,UAEnC,GAhGiC,gBCF/B,EACA,EACA,EAAW,0EAEX,UAAiB,GACX,EAAM,IAAQ,GAAO,KAAO,GAAe,GAC3C,EAAmB,IAAQ,GAAO,KAAO,CAAC,UAAW,WAAa,CAAC,OAAQ,UACjF,CAAA,EAAO,WAAW,OAAO,OAAO,YAC9B,CACE,KAAM,EACN,cAAe,EACf,eAAgB,EAAM,iBACtB,KAAM,CAAE,KAAM,IAEhB,GACA,QAIJ,YAAwB,EAAiB,CACvC,MAAO,GACJ,QAAQ;EAAgC,IACxC,QAAQ;0BAA8B,IAG3C,YAAsC,EAAmB,EAAkB,EAAW,4EACpF,UAAiB,GACX,EAAM,IAAQ,GAAO,KAAO,GAAe,GAC3C,EAAmB,IAAQ,GAAO,KAAO,CAAC,WAAa,CAAC,UACxD,EAAM,EAAM,eAAe,GAAe,IAChD,CAAA,EAAO,WAAW,OAAO,OAAO,UAC9B,OACA,EACA,CAAE,KAAM,EAAK,KAAM,CAAC,KAAM,IAC1B,GACA,QAIJ,GAAA,IAAe,CACb,YAAW,GACX,gBAAe,gBCxCf,EACA,EACA,EAAsC,CAAtC,MAAA,KAAA,QAAA,GAAA,8DAEA,MAAA,CAAA,EAAO,WAAW,OAAO,OAAO,KAC9B,CAAE,KAAM,GAAe,WAAY,IACnC,EACA,GAAsB,EAAK,SAI/B,YACE,EACA,EACA,EACA,EACA,EAAmC,CADnC,MAAA,KAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,0GAEO,GAAA,GAAA,WAAW,OAAO,QAAO,UAC9B,CAAE,KAAM,GAAe,WAAY,KACnC,MAAO,IAAc,SAArB,CAAA,EAAA,GACI,CAAA,EAAM,GAAK,gBAAgB,EAAW,EAAS,GAAO,eAAtD,UAAA,GAAA,oBACA,GAAA,oBAJN,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,EAAA,OAAA,CAAA,GAKL,GAAqB,GACrB,GAAsB,EAAK,YAI/B,YACE,EACA,EACA,EACA,EAAmC,CADnC,MAAA,KAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,yGAEO,GAAA,GAAA,WAAW,OAAO,QAAO,WAC9B,CAAE,KAAM,KACR,MAAO,IAAc,SAArB,CAAA,EAAA,GACI,CAAA,EAAM,GAAK,gBAAgB,EAAW,EAAS,GAAO,cAAtD,SAAA,GAAA,oBACA,EAAA,oBAJN,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,EAAA,OAAA,CAAA,EAKL,GAAsB,EAAK,YAI/B,YACE,EACA,EAAsB,wEAEhB,SAAa,GAAqB,GACxC,CAAA,EAAO,WAAW,OAAO,OAAO,QAC9B,CAAE,KAAM,IACR,EACA,QAIJ,YAAmC,EAAsB,+FAC1C,MAAA,CAAA,EAAM,WAAW,OAAO,OAAO,UAAU,OAAQ,EAAQ,mBAAhE,SAAO,EAAA,OACb,CAAA,EAAO,EAAM,eAAe,SAG9B,GAAA,IAAe,CACb,KAAI,GACJ,OAAM,GACN,QAAO,GACP,QAAO,GACP,aAAY,IChEd,GAAA,SAAA,EAAA,CAAiC,EAAA,EAAA,GAAjC,YAAA,gDAEe,SAAA,KAAb,SAAkB,EAA0B,+GACpC,SAAM,GAAO,UAAS,EAAA,EAAA,GACtB,GAAY,IAAE,CAClB,KAAM,EAAa,OAGb,EAA2D,EAAG,QAArD,EAAkD,EAAG,QAA5C,EAAyC,EAAG,UAAjC,EAA8B,EAAG,YAApB,GAAiB,EAAG,aAChE,GAAQ,GAAI,YAAY,GAE9B,CAAA,EAAM,GAAI,qBAAqB,EAAa,UAAA,CAAM,MAChD,IAAK,YAAY,EAAS,EAAS,GAAO,OACzC,YAFH,UAAA,OAGA,CAAA,EAAM,GAAI,qBAAqB,GAAc,UAAA,CAAM,MACjD,IAAK,YAAY,EAAS,EAAS,GAAO,QACzC,YAFH,UAAA,OAIA,CAAA,EAAO,GAAI,GAAY,EAAK,WAIxB,EAAA,UAAA,KAAN,SAAW,EAAU,EAAqB,uGAClC,SAAY,GAAO,MAAM,KAAK,IAAK,GACxB,CAAA,EAAM,KAAK,mBAAtB,SAAW,GAAA,OAEV,EAAA,GAAA,GAAM,eAAe,CAAA,EAAM,GAAW,KAC3C,EACA,EAAS,WACT,EAAU,kBAHZ,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,CAAqB,GAAA,gBAOxB,EAAA,UAAA,OAAN,SACE,EACA,EACA,EACA,EAAqB,wEAEf,SAAY,GAAO,MAAM,KAAK,IAAK,GAEzC,CAAA,EAAO,GAAW,OAChB,EACA,EACA,EACA,EAAU,SACV,EAAU,eAIR,EAAA,UAAA,QAAN,SACE,EACA,EACA,EAAqB,qGAEf,SAAY,GAAO,MAAM,KAAK,IAAK,GAElC,EAAA,GAAA,GAAM,eAAe,CAAA,EAAM,GAAW,QAC3C,EACA,EACA,EAAU,SACV,EAAU,iBAJZ,MAAA,CAAA,EAAO,EAAA,MAAA,EAAA,CAAqB,GAAA,gBAQxB,EAAA,UAAA,QAAN,SACE,EACA,EACA,EAAqB,wGAEL,MAAA,CAAA,EAAM,KAAK,kBAArB,SAAU,GAAA,OACV,EAAY,GAAO,MAAM,KAAK,IAAK,GAElC,GAAA,GAAA,GAAM,YACX,CAAA,EAAM,GAAW,QACf,EACA,EAAQ,oBAHZ,MAAA,CAAA,EAAO,GAAA,MAAA,EAAA,CACL,GAAA,OAIA,EAAU,kBAIR,EAAA,UAAA,cAAN,UAAA,+FACkB,MAAA,CAAA,EAAM,KAAK,kBAArB,SAAU,EAAA,OAChB,CAAA,EAAO,GAAW,aAAa,UAG3B,EAAA,UAAA,eAAN,UAAA,+FACmB,MAAA,CAAA,EAAM,KAAK,mBAAtB,SAAW,EAAA,OACjB,CAAA,EAAO,GAAW,aAAa,UAEnC,GA3FiC,gBCDN,EAA0B,iGAChC,MAAA,CAAA,EAAM,GAAO,qBAChC,GADM,EAAa,EAAA,OAChB,CAAC,GAAc,IAAQ,KAAA,OAAR,EAAU,QAAS,MACnC,KAAM,IAOR,MAJM,GAAM,GAAO,UAAU,EAAU,GAEvC,GAAuB,EAAI,MAExB,EAAI,OAAS,MACd,CAAA,EAAO,GAAY,KAAK,IAExB,CAAA,EAAO,GAAY,KAAK,SAI5B,aAA2B,kEACzB,MAAA,CAAA,EAAO,GAAI,aCjBb,GAAA,IAAA,EAAA,EAAA,EAAA,GACK,IACA,IACA,2KCHL,GAAA,EAAA,EAAA,EAAA,GACK,IACA,IACA,2JCAL,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,CACE,KAAI,GACJ,MAAK,IACF,GACA,IACA,IACA,GAAK,CACR,IAAG,GACH,IAAG,GACH,IAAG,mBCpBL,2BA4BA,GAAM,IAAc,GAAS,CAC3B,GAAM,CAAE,OAAM,UAAS,QAAO,OAAM,UAAW,EAC/C,MAAO,CAAE,OAAM,UAAS,QAAO,OAAM,WAEvC,GAAQ,YAAc,GAMtB,GAAM,IAAc,GAAS,CAC3B,GAAI,YAAiB,OACnB,MAAO,GACF,CACL,GAAM,CAAE,OAAM,UAAS,QAAO,QAAS,EACvC,MAAO,QAAO,OAAO,GAAY,EAAM,GAAU,CAAE,OAAM,QAAO,WAGpE,GAAQ,YAAc,GAStB,GAAM,IAAc,CAAC,EAAM,IAAY,CACrC,OAAQ,OACD,aACH,MAAO,IAAI,YAAW,OAEnB,iBACH,MAAO,gBAAe,OAEnB,cACH,MAAO,IAAI,aAAY,OAEpB,YACH,MAAO,IAAI,WAAU,OAElB,WACH,MAAO,IAAI,UAAS,WAGpB,MAAO,IAAI,OAAM,OCzEvB,2BASA,GAAM,IAAsB,GAAU,GAAI,KAAI,GAC9C,GAAQ,oBAAsB,KCV9B,2BAEA,GAAQ,aAAe,aAA2B,MAAM,IAClD,OAAQ,CACV,MAAO,MAAK,YAAY,OAI5B,GAAQ,WAAa,aAAyB,MAAM,IAC9C,OAAQ,CACV,MAAO,MAAK,YAAY,OAI5B,GAAQ,gBAAkB,aAA8B,MAAM,IACxD,OAAQ,CACV,MAAO,MAAK,YAAY,SChB5B,gCAEA,GAAM,CAAE,gBAAgB,KAClB,CAAE,wBAAwB,KAC1B,CAAE,mBAAiB,gBAAc,eAAe,KAYtD,GAAO,QAAU,QAAuB,CAMtC,YAAa,EAAM,CACjB,KAAK,KAAO,KAIZ,KAAK,GAAK,KAAK,SACZ,SAAS,IACT,MAAM,GAGT,KAAK,OAAS,EAId,KAAK,QAAU,OAAO,OAAO,MAIzB,GACF,KAAK,QAAQ,GAYjB,QAAS,EAAO,CACd,GAAM,GAAK,GAAG,KAAK,MAAM,KAAK,WAC9B,YAAK,QAAQ,GAAM,EAGf,EAAM,QAAU,GAAK,EAAM,QAAU,UACvC,GAAM,QAAU,WAAW,GAAiB,QAAS,EAAM,QAAS,KAAM,IAGxE,EAAM,QACR,EAAM,OAAO,iBAAiB,QAAS,IAAM,KAAK,MAAM,GAAK,CAC3D,KAAM,KAMN,KAAK,MACP,GAAiB,UAAU,KAAK,KAAM,EAAI,GAGrC,EAAM,OAUf,QAAS,EAAM,CACb,GAAI,KAAK,KACP,KAAM,IAAI,OAAM,6BAEhB,KAAK,KAAO,EACZ,KAAK,KAAK,iBAAiB,UAAW,MACtC,KAAK,KAAK,QAKV,OAAW,CAAC,EAAI,IAAU,QAAO,QAAQ,KAAK,SAC5C,GAAiB,UAAU,EAAM,EAAI,GAW3C,YAAc,CACZ,GAAM,GAAQ,GAAI,IAClB,OAAW,CAAC,EAAI,IAAU,QAAO,QAAQ,KAAK,SAC5C,EAAM,KAAK,GACX,KAAK,MAAM,GAKb,AAAI,KAAK,MACP,MAAK,KAAK,oBAAoB,UAAW,MACzC,KAAK,KAAK,eAWP,SAAS,EAAM,EAAI,CACxB,GAAM,CAAE,WAAY,EACd,EAAQ,EAAQ,GACtB,AAAI,GACF,OAAO,GAAQ,GACf,EAAM,KAAK,GAAI,IAAa,sBACxB,EAAK,MACP,EAAK,KAAK,YAAY,CAAE,KAAM,QAAS,QAW7C,MAAO,EAAI,CACT,GAAM,CAAE,WAAY,KACd,EAAQ,EAAQ,GACtB,AAAI,GACF,OAAO,GAAQ,GAEf,EAAM,KAAK,GAAI,KACX,KAAK,MACP,KAAK,KAAK,YAAY,CAAE,KAAM,QAAS,OAGrC,EAAM,SAAW,MACnB,aAAa,EAAM,gBAYlB,WAAW,EAAM,EAAI,EAAO,CACjC,EAAK,YACH,CACE,KAAM,QACN,UAAW,EAAM,UACjB,OAAQ,EAAM,OACd,KACA,MAAO,EAAM,UAGf,GAAoB,EAAM,YAAc,KAS5C,YAAa,EAAO,CAClB,GAAM,CAAE,KAAI,UAAW,EAAM,KACvB,EAAQ,KAAK,QAAQ,GAK3B,AAAI,GACF,OAAO,MAAK,QAAQ,GACpB,AAAI,EAAO,GACT,EAAM,QAAQ,EAAO,OAErB,EAAM,KAAK,GAAY,EAAO,QAG5B,EAAM,SAAW,MACnB,aAAa,EAAM,cC9M3B,gCAQA,GAAO,QAAU,KAAY,CAM3B,YAAa,EAAW,EAAQ,EAAO,CAErC,KAAK,OAAS,GAAI,SAAQ,CAAC,EAAS,IAAW,CAC7C,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,EAAM,OACpB,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,OAAS,EACd,KAAK,QAAU,EAAM,SAAW,KAAO,SAAW,EAAM,QAExD,KAAK,QAAU,OASnB,QAAU,CACR,MAAO,MAAK,MAQd,UAAY,CACV,MAAO,MAAK,MAAM,aC5CtB,gCAEA,GAAM,IAAQ,KAQd,GAAO,QAAU,KAAc,CAM7B,YAAa,EAAW,EAAS,EAAW,CAC1C,KAAK,UAAY,EAIjB,GAAM,GAAM,KACZ,OAAW,KAAU,GAMnB,EAAI,GAAU,GACZ,KAAK,UAAU,QAAQ,GAAI,IAAM,EAAW,EAAO,WAAY,QC7BvE,gCAIA,GAAM,IAAU,KA+BhB,GAAO,QAAU,KAAa,CAM5B,YAAa,EAAW,EAAS,EAAW,CAE1C,KAAK,OAAU,GAAI,IAAQ,EAAW,EAAS,OC3CnD,gCAMA,YAAe,EAAU,CACvB,GAAI,EAAS,QAAU,IAAO,KAAM,IAAI,WAAU,qBAElD,OADI,GAAW,GAAI,YAAW,KACrB,EAAI,EAAG,EAAI,EAAS,OAAQ,IACnC,EAAS,GAAK,IAEhB,OAAS,GAAI,EAAG,EAAI,EAAS,OAAQ,IAAK,CACxC,GAAI,GAAI,EAAS,OAAO,GACpB,EAAK,EAAE,WAAW,GACtB,GAAI,EAAS,KAAQ,IAAO,KAAM,IAAI,WAAU,EAAI,iBACpD,EAAS,GAAM,EAEjB,GAAI,GAAO,EAAS,OAChB,EAAS,EAAS,OAAO,GACzB,EAAS,KAAK,IAAI,GAAQ,KAAK,IAAI,KACnC,EAAU,KAAK,IAAI,KAAO,KAAK,IAAI,GACvC,WAAiB,EAAQ,CAOvB,GANI,YAAkB,aACf,CAAI,YAAY,OAAO,GAC5B,EAAS,GAAI,YAAW,EAAO,OAAQ,EAAO,WAAY,EAAO,YACxD,MAAM,QAAQ,IACvB,GAAS,WAAW,KAAK,KAEvB,CAAE,aAAkB,aAAe,KAAM,IAAI,WAAU,uBAC3D,GAAI,EAAO,SAAW,EAAK,MAAO,GAMlC,OAJI,GAAS,EACT,EAAS,EACT,GAAS,EACT,EAAO,EAAO,OACX,KAAW,GAAQ,EAAO,MAAY,GAC3C,KACA,IAMF,OAHI,IAAS,GAAO,IAAU,EAAU,IAAO,EAC3C,EAAM,GAAI,YAAW,IAElB,KAAW,GAAM,CAItB,OAHI,IAAQ,EAAO,IAEf,GAAI,EACC,EAAM,GAAO,EAAI,MAAU,GAAK,GAAI,IAAY,IAAQ,GAAK,IAAO,KAC3E,IAAU,IAAM,EAAI,KAAU,EAC9B,EAAI,GAAQ,GAAQ,IAAU,EAC9B,GAAS,GAAQ,IAAU,EAE7B,GAAI,KAAU,EAAK,KAAM,IAAI,OAAM,kBACnC,EAAS,GACT,KAIF,OADI,IAAM,GAAO,EACV,KAAQ,IAAQ,EAAI,MAAS,GAClC,KAIF,OADI,IAAM,EAAO,OAAO,GACjB,GAAM,GAAM,EAAE,GAAO,IAAO,EAAS,OAAO,EAAI,KACvD,MAAO,IAET,WAAuB,EAAQ,CAC7B,GAAI,MAAO,IAAW,SAAY,KAAM,IAAI,WAAU,mBACtD,GAAI,EAAO,SAAW,EAAK,MAAO,IAAI,YACtC,GAAI,GAAM,EAEV,GAAI,EAAO,KAAS,IAIpB,QAFI,GAAS,EACT,GAAS,EACN,EAAO,KAAS,GACrB,IACA,IAMF,OAHI,GAAU,GAAO,OAAS,GAAO,EAAU,IAAO,EAClD,GAAO,GAAI,YAAW,GAEnB,EAAO,IAAM,CAElB,GAAI,GAAQ,EAAS,EAAO,WAAW,IAEvC,GAAI,IAAU,IAAO,OAErB,OADI,IAAI,EACC,GAAM,EAAO,EAAI,KAAU,GAAK,GAAI,KAAY,KAAQ,GAAK,KAAO,KAC3E,GAAU,EAAO,GAAK,MAAU,EAChC,GAAK,IAAQ,EAAQ,MAAS,EAC9B,EAAS,EAAQ,MAAS,EAE5B,GAAI,IAAU,EAAK,KAAM,IAAI,OAAM,kBACnC,GAAS,GACT,IAGF,GAAI,EAAO,KAAS,IAGpB,QADI,GAAM,EAAO,GACV,IAAQ,GAAQ,GAAK,KAAS,GACnC,IAIF,OAFI,IAAM,GAAI,YAAW,EAAU,GAAO,IACtC,GAAI,EACD,IAAQ,GACb,GAAI,MAAO,GAAK,KAElB,MAAO,MAET,WAAiB,EAAQ,CACvB,GAAI,GAAS,EAAa,GAC1B,GAAI,EAAU,MAAO,GACrB,KAAM,IAAI,OAAM,WAAa,EAAO,cAEtC,MAAO,CACL,OAAQ,EACR,aAAc,EACd,OAAQ,GAGZ,GAAO,QAAU,KC5HjB,gCAEA,GAAM,IAAc,GAAI,aAKlB,GAAa,AAAC,GAAU,GAAY,OAAO,GAE3C,GAAc,GAAI,aAKlB,GAAa,AAAC,GAAS,GAAY,OAAO,GAShD,YAAiB,EAAM,EAAQ,CAC7B,GAAM,GAAS,GAAI,YAAW,GAC1B,EAAS,EAEb,OAAW,KAAO,GAChB,EAAO,IAAI,EAAK,GAChB,GAAU,EAAI,OAGhB,MAAO,GAGT,GAAO,QAAU,CAAE,cAAY,cAAY,aCnC3C,gCAEA,GAAM,CAAE,eAAe,KAUvB,QAAW,CAOT,YAAa,EAAM,EAAM,EAAS,EAAU,CAC1C,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,QAAU,GAAW,KAAK,MAC/B,KAAK,SAAW,EAChB,KAAK,MAAQ,EAAQ,GAOvB,OAAQ,EAAK,CACX,MAAO,MAAK,MAAM,OAAO,GAO3B,OAAQ,EAAQ,CACd,OAAW,KAAQ,GACjB,GAAI,KAAK,UAAY,KAAK,SAAS,QAAQ,GAAQ,EACjD,KAAM,IAAI,OAAM,sBAAsB,UAAa,MAGvD,MAAO,MAAK,MAAM,OAAO,KAI7B,GAAO,QAAU,KCjDjB,gCAUA,GAAM,IAAS,CAAC,EAAQ,EAAU,IAAgB,CAGhD,GAAM,GAAQ,GACd,OAAS,GAAI,EAAG,EAAI,EAAS,OAAQ,EAAE,EACrC,EAAM,EAAS,IAAM,EAIvB,GAAI,GAAM,EAAO,OACjB,KAAO,EAAO,EAAM,KAAO,KACzB,EAAE,EAIJ,GAAM,GAAM,GAAI,YAAY,EAAM,EAAc,EAAK,GAGjD,EAAO,EACP,EAAS,EACT,EAAU,EACd,OAAS,GAAI,EAAG,EAAI,EAAK,EAAE,EAAG,CAE5B,GAAM,GAAQ,EAAM,EAAO,IAC3B,GAAI,IAAU,OACZ,KAAM,IAAI,aAAY,qBAAuB,EAAO,IAItD,EAAU,GAAU,EAAe,EACnC,GAAQ,EAGJ,GAAQ,GACV,IAAQ,EACR,EAAI,KAAa,IAAQ,GAAU,GAKvC,GAAI,GAAQ,GAAe,IAAQ,GAAW,EAAI,EAChD,KAAM,IAAI,aAAY,0BAGxB,MAAO,IASH,GAAS,CAAC,EAAM,EAAU,IAAgB,CAC9C,GAAM,GAAM,EAAS,EAAS,OAAS,KAAO,IACxC,EAAQ,IAAK,GAAe,EAC9B,EAAM,GAEN,EAAO,EACP,EAAS,EACb,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAMjC,IAJA,EAAU,GAAU,EAAK,EAAK,GAC9B,GAAQ,EAGD,EAAO,GACZ,GAAQ,EACR,GAAO,EAAS,EAAQ,GAAU,GAUtC,GALI,GACF,IAAO,EAAS,EAAQ,GAAW,EAAc,IAI/C,EACF,KAAQ,EAAI,OAAS,EAAe,GAClC,GAAO,IAIX,MAAO,IASH,GAAU,AAAC,GAAgB,AAAC,GACzB,EAKL,OAAQ,EAAO,CACb,MAAO,IAAO,EAAO,EAAU,IAMjC,OAAQ,EAAO,CACb,MAAO,IAAO,EAAO,EAAU,MAKrC,GAAO,QAAU,CAAE,cC1HnB,gCAEA,GAAM,IAAQ,KACR,GAAO,KACP,CAAE,YAAY,KACd,CAAE,cAAY,eAAe,KAQ7B,GAAW,IACR,EACL,OAAQ,GACR,OAAQ,KAUN,GAAY,CAChB,CAAC,WAAY,KAAQ,GAAU,IAC/B,CAAC,QAAS,IAAK,GAAQ,GAAI,MAC3B,CAAC,QAAS,IAAK,GAAQ,GAAI,YAC3B,CAAC,SAAU,IAAK,GAAO,cACvB,CAAC,SAAU,IAAK,GAAQ,GAAI,oBAC5B,CAAC,cAAe,IAAK,GAAQ,GAAI,oBACjC,CAAC,YAAa,IAAK,GAAQ,GAAI,oCAC/B,CAAC,iBAAkB,IAAK,GAAQ,GAAI,oCACpC,CAAC,eAAgB,IAAK,GAAQ,GAAI,qCAClC,CAAC,oBAAqB,IAAK,GAAQ,GAAI,qCACvC,CAAC,SAAU,IAAK,GAAQ,GAAI,oCAC5B,CAAC,cAAe,IAAK,GAAQ,GAAI,oCACjC,CAAC,YAAa,IAAK,GAAQ,GAAI,qCAC/B,CAAC,iBAAkB,IAAK,GAAQ,GAAI,qCACpC,CAAC,UAAW,IAAK,GAAQ,GAAI,oCAC7B,CAAC,SAAU,IAAK,GAAO,wCACvB,CAAC,cAAe,IAAK,GAAO,wCAC5B,CAAC,YAAa,IAAK,GAAO,8DAC1B,CAAC,eAAgB,IAAK,GAAO,8DAC7B,CAAC,SAAU,IAAK,GAAQ,GAAI,oEAC5B,CAAC,YAAa,IAAK,GAAQ,GAAI,qEAC/B,CAAC,YAAa,IAAK,GAAQ,GAAI,oEAC/B,CAAC,eAAgB,IAAK,GAAQ,GAAI,sEAI9B,GAAQ,GAAU,OAAO,CAAC,EAAM,IACpC,GAAK,EAAO,IAAM,GAAI,IAAK,EAAO,GAAI,EAAO,GAAI,EAAO,GAAI,EAAO,IAC5D,GAC+B,IAGlC,GAAQ,GAAU,OAAO,CAAC,EAAM,IACpC,GAAK,EAAO,IAAM,GAAM,EAAO,IACxB,GAC+B,IAExC,GAAO,QAAU,CACf,SACA,YClEF,mBAIA,aAEA,GAAM,IAAY,KACZ,CAAE,cAAY,cAAY,WAAW,KAe3C,YAAoB,EAAY,EAAK,CACnC,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,kCAElB,GAAM,CAAE,OAAM,WAAY,GAAS,GACnC,UAAY,EAAM,GAEX,GAAO,CAAC,EAAS,GAAM,EAAQ,OAAS,EAAI,QAYrD,YAAiB,EAAY,EAAK,CAChC,GAAM,GAAM,GAAS,GACf,EAAO,GAAW,EAAI,OAAO,IAEnC,MAAO,IAAO,CAAC,EAAI,QAAS,GAAO,EAAI,QAAQ,OAAS,EAAK,QAY/D,YAAiB,EAAM,CACrB,AAAI,YAAgB,aAClB,GAAO,GAAW,IAEpB,GAAM,GAAS,EAAK,GAGpB,MAAI,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAK,SAAS,IAC7E,GAAO,EAAK,eAGP,AADK,GAAiC,EAAK,IACvC,OAAO,EAAK,UAAU,IAQnC,YAAoB,EAAM,CAMxB,GALI,YAAgB,aAClB,GAAO,GAAW,IAIhB,OAAO,UAAU,SAAS,KAAK,KAAU,kBAC3C,MAAO,GAGT,GAAI,CAEF,MAAO,AADK,IAAiC,EAAK,IACvC,WACJ,EAAP,CACA,MAAO,IAYX,YAAsB,EAAM,EAAK,CAE/B,AADY,GAAS,GACjB,OAAO,GAAW,IAUxB,YAAmB,EAAY,CAC7B,GAAI,OAAO,UAAU,eAAe,KAAK,GAAU,MAA+B,GAChF,MAAO,IAAU,MAA8B,GAC1C,GAAI,OAAO,UAAU,eAAe,KAAK,GAAU,MAA+B,GACvF,MAAO,IAAU,MAA8B,GAE/C,KAAM,IAAI,OAAM,yBAAyB,KAW7C,YAA2B,EAAM,CAC/B,MAAI,aAAgB,aAClB,GAAO,GAAW,IAGb,GAAiC,EAAK,IAG/C,GAAU,GAAO,QAAU,GAC3B,GAAQ,OAAS,GACjB,GAAQ,OAAS,GACjB,GAAQ,UAAY,GACpB,GAAQ,SAAW,GACnB,GAAQ,iBAAmB,GAC3B,GAAM,IAAQ,OAAO,OAAO,GAAU,OAChC,GAAQ,OAAO,OAAO,GAAU,OACtC,GAAQ,MAAQ,GAChB,GAAQ,MAAQ,KCpJhB,sBAAO,QAAU,GAEjB,GAAI,IAAM,IACN,GAAO,IACP,GAAS,CAAC,GACV,GAAM,KAAK,IAAI,EAAG,IAEtB,YAAgB,EAAK,EAAK,EAAQ,CAChC,EAAM,GAAO,GACb,EAAS,GAAU,EAGnB,OAFI,GAAY,EAEV,GAAO,IACX,EAAI,KAAa,EAAM,IAAQ,GAC/B,GAAO,IAET,KAAM,EAAM,IACV,EAAI,KAAa,EAAM,IAAQ,GAC/B,KAAS,EAEX,SAAI,GAAU,EAAM,EAEpB,GAAO,MAAQ,EAAS,EAAY,EAE7B,KCxBT,sBAAO,QAAU,GAEjB,GAAI,IAAM,IACN,GAAO,IAEX,YAAc,EAAK,EAAQ,CACzB,GAAI,GAAS,EACT,EAAS,GAAU,EACnB,EAAS,EACT,EAAU,EACV,EACA,EAAI,EAAI,OAEZ,EAAG,CACD,GAAI,GAAW,EACb,SAAK,MAAQ,EACP,GAAI,YAAW,2BAEvB,EAAI,EAAI,KACR,GAAO,EAAQ,GACV,GAAI,KAAS,EACb,GAAI,IAAQ,KAAK,IAAI,EAAG,GAC7B,GAAS,QACF,GAAK,IAEd,UAAK,MAAQ,EAAU,EAEhB,KC3BT,mBACA,GAAI,IAAK,KAAK,IAAI,EAAI,GAClB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IAErB,GAAO,QAAU,SAAU,EAAO,CAChC,MACE,GAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACA,MCtBjB,sBAAO,QAAU,CACb,OAAQ,KACR,OAAQ,KACR,eAAgB,QCHpB,mBACA,aAgBA,GAAM,IAAQ,OAAO,OAAO,CAC1B,SAAY,EACZ,KAAQ,GACR,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,YAAa,GACb,YAAa,GACb,aAAc,GACd,aAAc,GACd,aAAc,GACd,aAAc,GACd,OAAU,GACV,cAAe,GACf,aAAc,GACd,eAAgB,GAChB,IAAO,IACP,IAAO,IACP,IAAO,IACP,2BAA4B,KAC5B,aAAc,KACd,aAAc,KACd,aAAc,KACd,aAAc,KACd,IAAO,KACP,eAAkB,KAClB,UAAW,MACX,YAAa,MACb,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,YAAa,MACb,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,cAAe,MACf,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,KACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,4BAA6B,MAC7B,+BAAgC,QAGlC,GAAO,QAAU,CAAE,YCnXnB,gCAEA,GAAM,CAAE,SAAU,IAAa,KACzB,GAAc,GAAI,aAAY,QAYpC,YAAkC,EAAO,CACvC,GAAI,GAAS,GAEb,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAU,OAAO,aAAa,EAAM,IAEtC,MAAO,GAcT,YAAmB,EAAO,EAAW,OAAQ,CAC3C,MAAI,KAAa,QAAU,IAAa,QAC/B,GAAY,OAAO,GAGxB,IAAa,QACR,GAAwB,GAG1B,GAAS,GAAU,OAAO,GAGnC,GAAO,QAAU,KC/CjB,gCAEA,GAAM,CAAE,SAAU,IAAa,KACzB,GAAc,GAAI,aAYxB,YAAkC,EAAQ,CACxC,GAAM,GAAQ,GAAI,YAAW,EAAO,QAEpC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAM,GAAK,EAAO,WAAW,GAG/B,MAAO,GAcT,YAAqB,EAAQ,EAAW,OAAQ,CAC9C,MAAI,KAAa,QAAU,IAAa,QAC/B,GAAY,OAAO,GAGxB,IAAa,QACR,GAAwB,GAG1B,GAAS,GAAU,OAAO,GAGnC,GAAO,QAAU,KChDjB,gCAQA,YAAiB,EAAQ,EAAQ,CAC/B,AAAK,GACH,GAAS,EAAO,OAAO,CAAC,EAAK,IAAS,EAAM,EAAK,OAAQ,IAG3D,GAAM,GAAS,GAAI,YAAW,GAC1B,EAAS,EAEb,OAAW,KAAO,GAChB,EAAO,IAAI,EAAK,GAChB,GAAU,EAAI,OAGhB,MAAO,GAGT,GAAO,QAAU,KCxBjB,mBAGA,aAEA,GAAM,IAAY,KACZ,GAAS,KACT,CAAE,UAAU,KACZ,GAAqB,KACrB,GAAuB,KACvB,GAAmB,KAEnB,GAAqD,GAG3D,OAAW,KAAO,IAAO,CACvB,GAAM,GAA+B,EACrC,GAAM,GAAM,IAAS,EAEvB,OAAO,OAAO,IAQd,YAAsB,EAAM,CAC1B,GAAI,CAAE,aAAgB,aACpB,KAAM,IAAI,OAAM,+BAGlB,MAAO,IAAmB,EAAM,UASlC,YAAwB,EAAM,CAC5B,MAAO,IAAqB,EAAM,UASpC,YAAsB,EAAM,CAC1B,GAAI,CAAE,aAAgB,aACpB,KAAM,IAAI,OAAM,+BAGlB,MAAO,IAAmB,GAAU,OAAO,YAAa,IAAO,MAAM,GASvE,YAAwB,EAAM,CAC5B,GAAM,GAAU,YAAgB,YAC5B,GAAmB,GACnB,EAEJ,MAAO,IAAU,OAAO,IAAM,GAShC,YAAiB,EAAO,CACtB,GAAI,CAAE,aAAiB,aACrB,KAAM,IAAI,OAAM,kCAGlB,GAAI,EAAM,OAAS,EACjB,KAAM,IAAI,OAAM,2CAGlB,GAAM,GAA+B,GAAO,OAAO,GACnD,GAAI,CAAC,GAAY,GACf,KAAM,IAAI,OAAM,sCAAsC,EAAK,SAAS,OAEtE,EAAQ,EAAM,MAAM,GAAO,OAAO,OAElC,GAAM,GAAM,GAAO,OAAO,GAC1B,GAAI,EAAM,EACR,KAAM,IAAI,OAAM,6BAA6B,KAI/C,GAFA,EAAQ,EAAM,MAAM,GAAO,OAAO,OAE9B,EAAM,SAAW,EACnB,KAAM,IAAI,OAAM,oCAAoC,GAAmB,EAAO,aAGhF,MAAO,CACL,OACA,KAAM,GAAM,GACZ,OAAQ,EACR,OAAQ,GAcZ,YAAiB,EAAQ,EAAM,EAAQ,CACrC,GAAI,CAAC,GAAU,IAAS,OACtB,KAAM,IAAI,OAAM,6DAIlB,GAAM,GAAS,GAAW,GAE1B,GAAI,CAAE,aAAkB,aACtB,KAAM,IAAI,OAAM,iCAOlB,GAJI,GAAU,MACZ,GAAS,EAAO,QAGd,GAAU,EAAO,SAAW,EAC9B,KAAM,IAAI,OAAM,sDAGlB,GAAM,GAAO,GAAO,OAAO,GACrB,EAAM,GAAO,OAAO,GAC1B,MAAO,IAAiB,CAAC,EAAM,EAAK,GAAS,EAAK,OAAS,EAAI,OAAS,EAAO,QAUjF,YAAqB,EAAM,CACzB,GAAI,GAAO,EAEX,GAAI,MAAO,IAAS,SAAU,CAC5B,GAAI,GAAM,KAAU,OAClB,KAAM,IAAI,OAAM,qCAAqC,KAEvD,EAAO,GAAM,GAGf,GAAI,MAAO,IAAS,SAClB,KAAM,IAAI,OAAM,+CAA+C,KAIjE,GAAI,GAAM,KAAU,QAAa,CAAC,GAAU,GAC1C,KAAM,IAAI,OAAM,+BAA+B,KAGjD,MAAO,GAST,YAAoB,EAAM,CACxB,MAAO,GAAO,GAAK,EAAO,GAS5B,YAAsB,EAAM,CAK1B,MAJI,MAAU,IAIV,GAAM,IAcZ,YAAmB,EAAW,CAC5B,GAAO,GAUT,YAAiB,EAAW,CAC1B,UAAS,GAEF,EAAU,SAAS,EAAG,GAG/B,GAAO,QAAU,CACf,SACA,SACA,eACA,iBACA,eACA,iBACA,UACA,UACA,cACA,aACA,YACA,UACA,kBCjPF,sBAAO,QAAU,GAEjB,GAAI,IAAM,IACN,GAAO,IACP,GAAS,CAAC,GACV,GAAM,KAAK,IAAI,EAAG,IAEtB,YAAgB,EAAK,EAAK,EAAQ,CAChC,EAAM,GAAO,GACb,EAAS,GAAU,EAGnB,OAFI,GAAY,EAEV,GAAO,IACX,EAAI,KAAa,EAAM,IAAQ,GAC/B,GAAO,IAET,KAAM,EAAM,IACV,EAAI,KAAa,EAAM,IAAQ,GAC/B,KAAS,EAEX,SAAI,GAAU,EAAM,EAEpB,GAAO,MAAQ,EAAS,EAAY,EAE7B,KCxBT,sBAAO,QAAU,GAEjB,GAAI,IAAM,IACN,GAAO,IAEX,YAAc,EAAK,EAAQ,CACzB,GAAI,GAAS,EACT,EAAS,GAAU,EACnB,EAAS,EACT,EAAU,EACV,EACA,EAAI,EAAI,OAEZ,EAAG,CACD,GAAI,GAAW,EACb,SAAK,MAAQ,EACP,GAAI,YAAW,2BAEvB,EAAI,EAAI,KACR,GAAO,EAAQ,GACV,GAAI,KAAS,EACb,GAAI,IAAQ,KAAK,IAAI,EAAG,GAC7B,GAAS,QACF,GAAK,IAEd,UAAK,MAAQ,EAAU,EAEhB,KC3BT,mBACA,GAAI,IAAK,KAAK,IAAI,EAAI,GAClB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IAErB,GAAO,QAAU,SAAU,EAAO,CAChC,MACE,GAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACA,MCtBjB,sBAAO,QAAU,CACb,OAAQ,KACR,OAAQ,KACR,eAAgB,QCHpB,gCAEA,GAAM,IAAS,KACT,GAAqB,KACrB,GAAuB,KAE7B,GAAO,QAAU,CACf,sBACA,sBACA,0BACA,iBAMF,YAA6B,EAAK,CAChC,MAAO,UAAS,GAAmB,EAAK,UAAW,IAMrD,YAA6B,EAAK,CAChC,GAAI,GAAY,EAAI,SAAS,IAC7B,MAAI,GAAU,OAAS,GAAM,GAC3B,GAAY,IAAM,GAEb,GAAqB,EAAW,UAMzC,YAAiC,EAAO,CACtC,MAAO,YAAW,KAAK,GAAO,OAAO,GAAmB,KAM1D,YAAuB,EAAK,CAC1B,MAAO,YAAW,KAAK,GAAO,OAAO,OC1CvC,mBAEA,aAKA,GAAM,IAAY,OAAO,OAAO,CAC9B,SAAY,EACZ,MAAS,EACT,MAAS,EACT,MAAS,EACT,IAAO,EACP,IAAO,EACP,KAAQ,GACR,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,WAAY,GACZ,YAAa,GACb,YAAa,GACb,aAAc,GACd,aAAc,GACd,aAAc,GACd,aAAc,GACd,OAAU,GACV,KAAQ,GACR,cAAe,GACf,aAAc,GACd,IAAO,GACP,QAAW,GACX,KAAQ,GACR,WAAc,GACd,UAAa,GACb,UAAa,GACb,UAAa,GACb,IAAO,GACP,KAAQ,GACR,KAAQ,GACR,QAAW,GACX,SAAY,GACZ,KAAQ,GACR,IAAO,GACP,eAAgB,GAChB,IAAO,GACP,QAAW,GACX,SAAU,IACV,WAAY,IACZ,aAAc,IACd,UAAW,IACX,eAAgB,IAChB,eAAgB,IAChB,iBAAkB,IAClB,cAAe,IACf,cAAe,IACf,KAAQ,IACR,WAAY,IACZ,WAAY,IACZ,YAAa,IACb,iBAAkB,IAClB,cAAe,IACf,SAAU,IACV,sBAAuB,IACvB,iBAAkB,IAClB,iBAAkB,IAClB,uBAAwB,IACxB,mBAAoB,IACpB,gBAAiB,IACjB,aAAc,IACd,6BAA8B,IAC9B,cAAe,IACf,WAAY,IACZ,MAAS,IACT,gBAAiB,IACjB,aAAc,IACd,IAAO,IACP,IAAO,IACP,IAAO,IACP,eAAgB,IAChB,YAAa,IACb,UAAW,IACX,UAAW,IACX,WAAY,IACZ,UAAW,IACX,QAAW,IACX,gBAAiB,IACjB,mBAAoB,IACpB,mBAAoB,IACpB,aAAc,IACd,cAAe,IACf,qBAAsB,IACtB,aAAc,IACd,UAAW,IACX,iBAAkB,IAClB,aAAc,IACd,IAAO,IACP,kBAAmB,IACnB,oBAAqB,IACrB,eAAgB,IAChB,cAAe,IACf,WAAY,IACZ,IAAO,IACP,IAAO,IACP,KAAQ,IACR,OAAU,IACV,IAAO,IACP,KAAQ,IACR,MAAS,IACT,MAAS,IACT,OAAU,IACV,SAAY,IACZ,SAAY,IACZ,IAAO,IACP,KAAQ,IACR,GAAM,IACN,IAAO,IACP,qBAAsB,IACtB,KAAQ,IACR,KAAQ,IACR,YAAe,IACf,qBAAsB,IACtB,2BAA4B,KAC5B,aAAc,KACd,aAAc,KACd,aAAc,KACd,aAAc,KACd,IAAO,KACP,WAAY,KACZ,WAAY,KACZ,WAAY,KACZ,YAAa,KACb,WAAY,KACZ,eAAgB,KAChB,eAAkB,KAClB,UAAW,MACX,YAAa,MACb,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,YAAa,MACb,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,aAAc,MACd,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,cAAe,MACf,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,cAAe,MACf,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,eAAgB,MAChB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,KACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,gBAAiB,MACjB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,iBAAkB,MAClB,4BAA6B,MAC7B,+BAAgC,MAChC,wBAAyB,MACzB,0BAA2B,MAC3B,wBAAyB,MACzB,mBAAoB,QACpB,mBAAoB,QACpB,mBAAoB,QACpB,mBAAoB,QACpB,mBAAoB,SACpB,mBAAoB,SACpB,YAAa,WAGf,GAAO,QAAU,CAAE,gBCvdnB,gCAQA,GAAM,CAAE,cAAc,KAChB,GAAe,KAAkB,aAEjC,GAAiD,GACjD,GAAgD,GAChD,GAAwC,GAG9C,OAAW,KAAQ,IAAW,CAC5B,GAAM,GAAqC,EACrC,EAAO,GAAU,GACvB,GAAa,GAAa,GAAa,GAEvC,GAAM,GAAwC,EAAU,cAAc,QAAQ,KAAM,KACpF,GAAe,GAAY,EAEtB,GAAW,IACd,IAAW,GAAQ,GAIvB,OAAO,OAAO,IACd,OAAO,OAAO,IACd,OAAO,OAAO,IACd,GAAM,IAAa,OAAO,OAAO,IACjC,GAAO,QAAU,CACf,gBACA,kBACA,cACA,iBCrCF,mBAWA,aAKA,GAAM,IAAS,KACT,GAAmB,KACnB,GAAO,KACP,CAAE,gBAAc,kBAAgB,cAAY,eAAe,KASjE,YAAoB,EAAqB,EAAM,CAC7C,GAAI,GAEJ,GAAI,YAA+B,YACjC,EAAS,GAAK,uBAAuB,WAEjC,GAAa,GACf,EAAS,GAAa,OAEtB,MAAM,IAAI,OAAM,6BAIpB,MAAO,IAAiB,CAAC,EAAQ,GAAO,EAAO,OAAS,EAAK,QAS/D,YAAmB,EAAM,CACvB,UAAO,OAA6B,GAC7B,EAAK,MAAM,GAAO,OAAO,OASlC,YAA0B,EAAc,CACtC,GAAM,GAAgC,GAAO,OAA6B,GACpE,EAAO,GAAW,GACxB,GAAI,IAAS,OACX,KAAM,IAAI,OAAM,SAAS,gBAE3B,MAAO,GAST,YAA0B,EAAO,CAC/B,MAAO,IAAW,GASpB,YAA0B,EAAM,CAC9B,GAAM,GAAO,GAAW,GACxB,GAAI,IAAS,OACX,KAAM,IAAI,OAAM,UAAU,gBAE5B,MAAO,GAST,YAA0B,EAAc,CACtC,MAAgC,IAAO,OAA6B,GAStE,YAA4B,EAAM,CAChC,GAAM,GAAO,GAAa,GAC1B,GAAI,IAAS,OACX,KAAM,IAAI,OAAM,UAAU,gBAE5B,MAAO,GAST,YAA4B,EAAM,CAChC,MAAO,IAAK,aAAa,GAU3B,YAAmB,EAAc,CAC/B,MAAO,IAAgB,GAUzB,YAAkB,EAAO,CACvB,MAAO,IAAgB,GAUzB,YAAoB,EAAM,CACxB,MAAO,IAAgB,GAUzB,YAAkB,EAAc,CAC9B,MAAO,IAAgB,GAUzB,YAAwB,EAAM,CAC5B,MAAO,IAAkB,GAU3B,YAAoB,EAAM,CACxB,MAAO,OAAM,KAAK,GAAkB,IAGtC,GAAO,QAAU,CACf,aACA,YACA,mBACA,mBACA,mBACA,mBACA,qBACA,qBAEA,YACA,WACA,aACA,WACA,iBACA,gBAEG,GAEH,gBACA,cACA,iBCvNF,gCAEA,GAAM,IAAK,KAEL,GAAU,CASd,mBAAoB,SAAU,EAAO,CACnC,GAAI,GAAS,KACX,MAAO,iCAGT,GAAI,CAAE,GAAM,UAAY,GAAK,EAAM,UAAY,GAC7C,MAAO,oDAGT,GAAI,MAAO,GAAM,OAAU,SACzB,MAAO,uBAGT,GAAI,EAAM,UAAY,EAAG,CACvB,GAAI,EAAM,QAAU,SAClB,MAAO,mCAET,GAAI,EAAM,gBAAkB,YAC1B,MAAO,8CAIX,GAAI,CAAE,GAAM,oBAAqB,aAC/B,MAAO,iCAGT,GAAI,CACF,GAAG,SAAS,EAAM,iBACX,EAAP,CACA,GAAI,GAAW,EAAI,QACnB,MAAK,IACH,GAAW,+BAEN,KAKb,GAAO,QAAU,KCnDjB,gCAQA,YAAiB,EAAG,EAAG,CACrB,GAAI,IAAM,EACR,MAAO,GAGT,GAAI,EAAE,aAAe,EAAE,WACrB,MAAO,GAGT,OAAS,GAAI,EAAG,EAAI,EAAE,WAAY,IAChC,GAAI,EAAE,KAAO,EAAE,GACb,MAAO,GAIX,MAAO,GAGT,GAAO,QAAU,KC1BjB,gCAEA,GAAM,IAAK,KACL,GAAY,KACZ,GAAa,KACb,GAAU,KACV,GAAmB,KACnB,GAAqB,KACrB,GAAmB,KAEnB,GAAS,GAAW,WACpB,GAAuC,OAAO,KAAK,IAAS,OAAO,CAAC,EAAG,IAC3E,GAAE,GAAO,IAAS,EACX,GACsC,IAEzC,GAAS,OAAO,IAAI,oBAqB1B,QAAU,CA+BR,YAAa,EAAS,EAAO,EAAW,EAAe,CA8BrD,GApBA,KAAK,QASL,KAAK,MAQL,KAAK,UAEL,OAAO,eAAe,KAAM,GAAQ,CAAE,MAAO,KACzC,GAAI,MAAM,GAAU,CAEtB,GAAM,GAAyB,EAC/B,KAAK,QAAU,EAAI,QACnB,KAAK,MAAQ,EAAI,MACjB,KAAK,UAAY,EAAI,UAGrB,KAAK,cAAgB,EAAI,eAAkB,GAAI,UAAY,EAAI,YAAc,UAC7E,OAGF,GAAI,MAAO,IAAY,SAAU,CAE/B,GAAM,GAAW,GAAU,UAAU,GACrC,GAAI,EAAU,CAEZ,GAAM,GAAM,GAAU,OAAO,GAC7B,KAAK,QAAoC,SAAS,EAAI,GAAG,WAAY,IACrE,KAAK,MAAQ,GAAW,SAAS,EAAI,MAAM,IAC3C,KAAK,UAAY,GAAW,SAAS,EAAI,MAAM,IAC/C,KAAK,cAAgB,MAGrB,MAAK,QAAU,EACf,KAAK,MAAQ,SACb,KAAK,UAAY,GAAG,cAAc,GAClC,KAAK,cAAgB,YAEvB,GAAI,YAAY,MAChB,OAAO,eAAe,KAAM,SAAU,CAAE,MAAO,IAC/C,OAGF,GAAI,YAAmB,YAAY,CACjC,GAAM,GAAI,SAAS,EAAQ,GAAG,WAAY,IAC1C,GAAI,IAAM,EAAG,CAEX,GAAM,GAAM,EACZ,KAAK,QAAU,EACf,KAAK,MAAQ,GAAW,SAAS,EAAI,MAAM,IAC3C,KAAK,UAAY,GAAW,SAAS,EAAI,MAAM,IAC/C,KAAK,cAAgB,aAGrB,MAAK,QAAU,EACf,KAAK,MAAQ,SACb,KAAK,UAAY,EACjB,KAAK,cAAgB,YAEvB,GAAI,YAAY,MAChB,OAKF,KAAK,QAAU,EAEX,MAAO,IAAU,UAEnB,GAAQ,GAAU,IAGpB,KAAK,MAAkC,EAEvC,KAAK,UAAuC,EAQ5C,KAAK,cAAgB,GAAkB,KAAY,EAAI,YAAc,UAErE,GAAI,YAAY,SASd,QAAS,CAEX,GAAI,GAAQ,KAAK,OAEjB,GAAI,CAAC,EAAO,CACV,GAAI,KAAK,UAAY,EACnB,EAAQ,KAAK,kBACJ,KAAK,UAAY,EAAG,CAC7B,GAAM,GAAQ,GAAW,cAAc,KAAK,OAC5C,EAAQ,GAAiB,CACvB,CAAC,GAAI,EAAO,KAAK,WAChB,EAAI,EAAM,WAAa,KAAK,UAAU,gBAEzC,MAAM,IAAI,OAAM,uBAIlB,OAAO,eAAe,KAAM,SAAU,CAAE,MAAO,IAGjD,MAAO,MAQL,SAAU,CACZ,GAAM,GAAQ,GAAW,cAAc,KAAK,OACtC,EAAY,GAAG,OAAO,KAAK,WAKjC,MAJe,IAAiB,CAC9B,CAAC,KAAK,SAAU,EAAO,GACtB,EAAI,EAAM,WAAa,EAAU,eAUlC,OAAQ,CACV,MAAO,IAAO,KAAK,OAQrB,MAAQ,CACN,GAAI,KAAK,QAAU,SACjB,KAAM,IAAI,OAAM,4CAGlB,GAAM,CAAE,OAAM,UAAW,GAAG,OAAO,KAAK,WAExC,GAAI,IAAS,WACX,KAAM,IAAI,OAAM,sDAGlB,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,qDAGlB,MAAO,IAAI,IAAI,EAAG,KAAK,MAAO,KAAK,WAQrC,MAAQ,CACN,MAAO,IAAI,IAAI,EAAG,KAAK,MAAO,KAAK,WASrC,oBAAqB,EAAO,KAAK,cAAe,CAE9C,GAAI,KAAK,QAAU,KAAK,OAAO,SAAW,GAAK,IAAS,KAAK,cAE3D,MAAO,MAAK,OAEd,GAAI,GACJ,GAAI,KAAK,UAAY,EAAG,CACtB,GAAI,IAAS,YACX,KAAM,IAAI,OAAM,kIAElB,EAAM,GAAG,YAAY,KAAK,mBACjB,KAAK,UAAY,EAC1B,EAAM,GAAmB,GAAU,OAAO,EAAM,KAAK,YAErD,MAAM,IAAI,OAAM,uBAElB,MAAI,KAAS,KAAK,eAEhB,OAAO,eAAe,KAAM,SAAU,CAAE,MAAO,IAE1C,GAQR,OAAO,IAAI,gCAAkC,CAC5C,MAAO,OAAS,KAAK,WAAa,IASpC,SAAU,EAAM,CACd,MAAO,MAAK,oBAAoB,GAQlC,QAAU,CACR,MAAO,CACL,MAAO,KAAK,MACZ,QAAS,KAAK,QACd,KAAM,KAAK,WAUf,OAAQ,EAAO,CACb,MAAO,MAAK,QAAU,EAAM,OAC1B,KAAK,UAAY,EAAM,SACvB,GAAiB,KAAK,UAAW,EAAM,iBAUpC,aAAa,EAAO,CACzB,GAAM,GAAW,GAAQ,mBAAmB,GAC5C,GAAI,EACF,KAAM,IAAI,OAAM,SAUb,OAAO,EAAO,CACnB,MAAO,aAAiB,KAAO,QAAQ,GAAS,EAAM,OAI1D,GAAI,OAAS,GAEb,GAAO,QAAU,KC1WjB,2BAEA,GAAM,IAAM,KAkBN,GAAY,CAAC,EAAK,IAClB,IACF,EAAS,KAAK,EAAI,UAAU,QAEvB,GAET,GAAQ,UAAY,GASpB,GAAM,IAAY,GAAc,CAE9B,GAAM,GAAO,EACb,cAAO,eAAe,EAAI,UAAW,WAAW,WAChD,OAAO,eAAe,EAAK,GAAI,WAI/B,OAAO,eAAe,EAAK,OAAO,IAAI,oBAAqB,CAAE,MAAO,KAE7D,GAET,GAAQ,UAAY,GAEpB,GAAQ,IAAM,gsDCjDd,gCAEA,GAAM,IAAM,KAEN,CAAE,YAAY,KACd,GAAc,OAAO,IAAI,6BACzB,GAAW,CAAE,SAAU,GAAO,aAAc,GAAO,WAAY,IAQrE,QAAY,CAKV,YAAa,EAAM,EAAK,CACtB,GAAI,CAAC,GAAQ,CAAE,aAAgB,aAC7B,KAAM,IAAI,OAAM,wCAGlB,GAAI,CAAC,GAAO,CAAC,GAAI,MAAM,GACrB,KAAM,IAAI,OAAM,iCAGlB,KAAK,KAAO,EACZ,KAAK,IAAM,EAEX,OAAO,iBAAiB,KAAM,CAC5B,KAAM,GACN,IAAK,QAUL,QAAS,CACX,YACO,KAAK,QASV,OAAQ,CACV,YACO,KAAK,QAGT,OAAO,cAAgB,CAC1B,MAAO,YAGJ,KAAgB,CACnB,MAAO,SASF,SAAS,EAAO,CACrB,MAAO,SAAQ,GAAS,EAAM,OAS5B,GAAY,CAAC,EAAO,IAAY,CACpC,GAAI,GAAS,GACb,MAAO,IAAM,CACX,GAAI,EAAM,KAAK,IACb,AAAK,GACH,GAAS,GAET,QAAQ,KAAK,QAGf,MAAM,IAAI,OAAM,KAKhB,GAAe,GAAU,gBAAiB,8FAC1C,GAAgB,GAAU,eAAgB,gGAEhD,GAAO,QAAU,KCrGjB,2BAEA,GAAM,CAAE,aAAW,cAAc,KAC3B,GAAQ,KAoBR,GAAc,CAAC,CAAE,MAAK,QAAQ,IAC9B,IACF,EAAS,KAAK,EAAK,QAEd,CAAE,IAAK,GAAU,EAAK,GAAW,SAE1C,GAAQ,YAAc,GAMtB,GAAM,IAAc,CAAC,CAAE,MAAK,UACnB,GAAI,IAAM,EAAM,GAAU,IAGnC,GAAQ,YAAc,GAEtB,GAAQ,MAAQ,KCzChB,gCAEA,GAAM,IAAS,KACT,CAAE,aAAW,cAAc,KAC3B,CAAE,gBAAgB,KAClB,CACJ,eACA,gBACE,KAeJ,gBAA0B,GAAO,CAI/B,YAAa,EAAW,CACtB,MAAM,QAAS,CAAC,MAAO,MAAO,KAAM,QAAS,QAezC,KAAK,EAAK,EAAU,GAAI,CAC5B,GAAM,CAAE,YAAa,EACf,CAAE,SAAU,KAAM,MAAK,OAAO,IAAI,IACnC,EACH,IAAK,GAAU,EAAK,KAEtB,MAAO,IAAY,QAyBf,KAAK,EAAO,EAAU,GAAI,CAC9B,GAAM,CAAE,YAAa,EAGrB,MAAO,GAAQ,SACf,GAAM,GAAS,KAAM,MAAK,OAAO,IAAI,IAChC,EACH,IAAK,EAAQ,KAAO,KAAO,OAAY,GAAU,EAAQ,IAAK,GAC9D,MAAO,YAAiB,YAAa,EAAQ,GAAY,EAAO,KAElE,MAAO,IAAY,EAAO,aAqBpB,GAAI,EAAM,EAAU,GAAI,CAC9B,GAAM,CAAE,YAAa,EAQrB,MAAQ,AAPQ,MAAM,MAAK,OAAO,GAAG,IAChC,EACH,KAAM,MAAM,QAAQ,GAChB,EAAK,IAAI,GAAO,GAAU,EAAK,IAC/B,CAAC,GAAU,EAAM,OAGP,IAAI,SAmBhB,MAAM,EAAK,EAAU,GAAI,CAC7B,GAAM,CAAE,YAAa,EACf,EAAS,KAAM,MAAK,OAAO,KAAK,IACjC,EACH,IAAK,GAAU,EAAK,KAGtB,MAAO,IAAK,EAAQ,IAAK,GAAU,EAAO,QAQxC,GAAgB,GAAS,CAC7B,GAAM,GAAM,GAAU,EAAM,KAC5B,MAAI,GAAM,MACD,CAAE,MAAK,MAAO,GAAY,EAAM,QAEhC,CAAE,QAIb,GAAO,QAAU,KC7JjB,2BAEA,GAAM,CAAE,aAAW,aAAW,QAAQ,KA2BhC,GAAa,CAAC,CAAE,UAAS,UAAW,CAIxC,OAAW,KAAO,GAChB,GAAU,GAGZ,MAAO,IAGT,GAAQ,WAAa,GAcrB,GAAM,IAAa,CAAC,EAAS,IAAa,CAExC,GAAM,GAAO,GACb,UAAY,EAAS,EAAM,GACpB,CAAE,UAAS,SAEpB,GAAQ,WAAa,GAYrB,GAAM,IAAc,CAAC,EAAO,EAAM,IAAa,CAC7C,GAAI,GAAS,MAAQ,MAAO,IAAU,SACpC,GAAI,GAAI,MAAM,GACZ,EAAK,KAAK,GACV,GAAU,EAAO,WACR,YAAiB,aAC1B,AAAI,GACF,EAAS,KAAK,WAEP,YAAY,OAAO,GAC5B,AAAI,GACF,EAAS,KAAK,EAAM,gBAEb,MAAM,QAAQ,GACvB,OAAW,KAAU,GACnB,GAAY,EAAQ,EAAM,OAG5B,QAAW,KAAU,QAAO,OAAO,GACjC,GAAY,EAAQ,EAAM,MC3FlC,gCAEA,GAAM,IAAS,KACT,CAAE,aAAW,cAAc,KAC3B,CAAE,cAAY,eAAe,KAgBnC,gBAAwB,GAAO,CAI7B,YAAa,EAAW,CACtB,MAAM,MAAO,CAAC,MAAO,MAAO,UAAW,QAAS,QAgB5C,KAAK,EAAS,EAAU,GAAI,CAChC,GAAM,CAAE,OAAQ,EAEV,EAAa,KAAM,MAAK,OAAO,IAAI,IACpC,EACH,IAAK,GAAO,KAAO,GAAU,GAAO,OACpC,QAAS,GAAW,EAAS,EAAQ,YAGvC,MAAO,IAAU,QAab,KAAK,EAAK,EAAU,GAAI,CAC5B,GAAM,CAAE,QAAO,iBAAkB,KAAM,MAAK,OAAO,IAAI,IAClD,EACH,IAAK,GAAU,EAAK,EAAQ,YAG9B,MAAO,CAAE,MAAO,GAAW,GAAQ,sBAgB/B,SAAS,EAAK,EAAU,GAAI,CAChC,GAAM,CAAE,IAAK,EAAY,iBAAkB,KAAM,MAAK,OAAO,QAAQ,IAChE,EACH,IAAK,GAAgB,EAAK,EAAQ,YAGpC,MAAO,CAAE,IAAK,GAAU,GAAa,uBAe/B,KAAM,EAAK,EAAU,GAAI,CAM/B,MALc,KAAM,MAAK,OAAO,KAAK,IAChC,EACH,IAAK,GAAU,EAAK,EAAQ,cAY5B,GAAkB,CAAC,EAAO,IAC1B,MAAO,IAAU,SACZ,EAEA,GAAU,EAAO,GAI5B,GAAO,QAAU,KCjIjB,2BAGA,GAAM,CAAE,eAAa,gBAAgB,KAC/B,CAAE,wBAAwB,KAkD1B,GAAiB,gBAAkB,CAAE,QAAQ,EAAQ,CAIzD,GAAI,GAAU,GAAS,GAIjB,EAAO,IAAM,GAAI,SAAQ,GAAY,EAAU,GAC/C,EAAO,IACX,GAAK,YAAY,CAAE,OAAQ,SACpB,KAOT,EAAK,UAAY,GAAS,EAAQ,EAAM,MAExC,GAAI,GAAS,GACb,GAAI,CACF,KAAO,CAAC,GAAQ,CACd,GAAM,CAAE,OAAM,QAAO,SAAU,KAAM,KAErC,GADA,EAAS,EACL,GAAS,KACX,KAAM,IAAY,GACb,AAAI,GAAS,MAClB,MAAM,GAAO,YAGjB,CACA,AAAK,GACH,EAAK,YAAY,CAAE,OAAQ,WAE7B,EAAK,UAGT,GAAQ,eAAiB,GASzB,GAAM,IAAiB,CAAC,EAAU,EAAQ,IAAa,CACrD,GAAM,CAAE,MAAO,EAAM,MAAO,GAAW,GAAI,gBAErC,EAAW,GAAW,GAE5B,SAAK,UAAY,MAAO,CAAE,KAAM,CAAE,aAAe,CAC/C,OAAQ,OACD,OAAQ,CACX,GAAI,CACF,GAAM,CAAE,OAAM,SAAU,KAAM,GAAS,OACvC,GAAI,EACF,EAAK,YAAY,CAAE,KAAM,OAAQ,KAAM,KACvC,EAAK,YACA,CAEL,GAAM,GAAe,GACf,EAAe,EAAO,EAAO,GAEnC,EAAK,YACH,CACE,KAAM,OACN,KAAM,GACN,MAAO,GAGT,GAAoB,WAGjB,EAAP,CACA,EAAK,YAAY,CACf,KAAM,QACN,MAAO,GAAY,KAErB,EAAK,QAEP,UAEG,SAAU,CACb,EAAK,QACD,EAAS,QACX,EAAS,SAEX,cAGA,QAIN,EAAK,QACL,EAAS,KAAK,GAEP,CAAE,KAAM,iBAAkB,KAAM,IAEzC,GAAQ,eAAiB,GAOzB,GAAM,IAAa,GAAY,CAC7B,GAAI,GAAY,KAAM,CACpB,GAAI,MAAO,GAAS,OAAO,gBAAmB,WAC5C,MAAO,GAAS,OAAO,iBAGzB,GAAI,MAAO,GAAS,OAAO,WAAc,WACvC,MAAO,GAAS,OAAO,YAI3B,KAAM,WAAU,yCAQZ,GAAiB,CAAC,EAAU,IAAa,CAE7C,GAAM,CAAE,MAAO,EAAM,MAAO,GAAW,GAAI,gBAC3C,SAAK,UAAY,CAAC,CAAE,UAAW,EAAS,MAAM,KAAM,GACpD,EAAS,KAAK,GACP,CAAE,KAAM,iBAAkB,KAAM,IAEzC,GAAQ,eAAiB,GAOzB,GAAM,IAAiB,CAAC,CAAE,UAMP,CAAC,EAAM,EAAW,KAAO,CAExC,EAAK,YAAY,EAAM,GAAI,KAAI,KAKnC,GAAQ,eAAiB,KChNzB,gCAcA,kBAA4C,EAAQ,EAAU,GAAI,CAChE,GAAM,GAAS,EAAO,YAEtB,GAAI,CACF,OAAa,CACX,GAAM,GAAS,KAAM,GAAO,OAE5B,GAAI,EAAO,KACT,OAGF,KAAM,GAAO,cAEf,CACA,AAAI,EAAQ,gBAAkB,IAC5B,EAAO,SAGT,EAAO,eAIX,GAAO,QAAU,KCpCjB,gCAIA,GAAM,IAAS,KACT,CAAE,aAAW,aAAW,QAAQ,KAChC,CACJ,kBACA,kBACA,mBACE,KAGE,GAAwB,KA+C9B,gBAAyB,GAAO,CAI9B,YAAa,EAAW,CACtB,MAAM,OAAQ,CAAC,MAAO,SAAU,MAAO,MAAO,SAYxC,OAAQ,EAAO,EAAU,GAAI,CACnC,GAAM,CAAE,UAAS,UAAW,EACtB,EAAW,CAAC,GAAI,EAAQ,UAAY,IACpC,EAAW,EAAQ,SACrB,GAAe,EAAQ,SAAU,GACjC,OAEE,EAAS,KAAM,MAAK,OAAO,OAAO,IACnC,EACH,MAAO,GAAkB,EAAO,GAChC,WACA,WACA,UACA,WAEF,MAAQ,GAAe,EAAO,KAAM,SAYhC,KAAK,EAAO,EAAU,GAAI,CAC9B,GAAM,CAAE,UAAS,UAAW,EACtB,EAAW,CAAC,GAAI,EAAQ,UAAY,IACpC,EAAW,EAAQ,SACrB,GAAe,EAAQ,SAAU,GACjC,OAEE,EAAS,KAAM,MAAK,OAAO,IAAI,IAChC,EACH,MAAO,GAAe,EAAO,GAC7B,WACA,WACA,UACA,WAGF,MAAO,IAAgB,EAAO,YAcxB,IAAK,EAAW,EAAU,GAAI,CACpC,GAAM,GAAQ,GAAI,MAAM,GAAa,GAAU,GAAa,EACtD,EAAS,KAAM,MAAK,OAAO,IAAI,IAAK,EAAS,KAAM,IACzD,MAAQ,GAAe,EAAO,KAAM,UAc9B,GAAI,EAAW,EAAU,GAAI,CACnC,GAAM,GAAQ,GAAI,MAAM,GAAa,GAAU,GAAa,EACtD,EAAS,KAAM,MAAK,OAAO,GAAG,IAAK,EAAS,KAAM,IAExD,MAAQ,GAAe,EAAO,KAAM,MAUlC,GAAkB,CAAC,CAAE,OAAM,MAAK,OAAM,QAAO,UAC1C,EACL,OACA,IAAK,GAAU,GACf,OACA,QACA,SAQE,GAAgB,CAAC,CAAE,QAAO,OAAM,OAAM,OAAM,MAAK,OAAM,OAAM,WAAa,EAC9E,IAAK,GAAU,GACf,OACA,OACA,OACA,OACA,QACA,OACA,UAQI,GAAW,AAAC,GAAM,EAUlB,GAAiB,CAAC,EAAO,IAAa,CAE1C,GAAI,YAAiB,MACnB,MAAO,GACF,GAAI,MAAO,IAAU,SAC1B,MAAO,GACF,GAAI,YAAiB,aAC1B,MAAO,GACF,GAAI,YAAY,OAAO,GAE5B,MAAO,GACF,CAGL,GAAM,GAAW,GAAW,GAC5B,GAAI,EACF,MAAO,IAAe,EAAU,GAAuB,GAGzD,GAAM,GAAgB,GAAgB,GACtC,GAAI,EACF,MAAO,IACL,EACA,GACA,GAIJ,GAAM,GAAiB,GAAiB,GACxC,GAAI,EACF,MAAO,IACL,GAAsB,GACtB,GACA,GAIJ,GAAM,GAAO,GAAa,GAC1B,GAAI,EACF,MAAO,IAAiB,EAAM,GAGhC,KAAM,WAAU,qBAAuB,MAAO,MAY5C,GAAoB,CAAC,EAAO,IAAa,CAG7C,GAAM,GAAW,GAAW,GAC5B,GAAI,EACF,MAAO,IAAe,EAAU,GAAuB,GAGzD,GAAM,GAAgB,GAAgB,GACtC,GAAI,EACF,MAAO,IACL,EACA,GACA,GAIJ,GAAM,GAAiB,GAAiB,GACxC,GAAI,EACF,MAAO,IACL,GAAsB,GACtB,GACA,GAIJ,KAAM,WAAU,qBAAuB,MAAO,KAW1C,GAA6B,CAAC,EAAS,IAAa,CACxD,GAAI,YAAmB,aACrB,MAAO,GACF,GAAI,YAAY,OAAO,GAC5B,MAAO,GACF,GAAI,YAAmB,MAC5B,MAAO,CAAE,KAAM,GAAI,WACd,GAAI,MAAO,IAAY,SAC5B,MAAO,CAAE,KAAM,GAAI,WACd,CACL,GAAM,GAAO,GAAa,GAC1B,GAAI,EACF,MAAO,IAAiB,EAAM,GAE9B,KAAM,WAAU,qBAAuB,MAAO,MAU9C,GAAwB,CAAC,EAAS,IAAa,CACnD,GAAI,MAAO,IAAY,SACrB,KAAM,WAAU,wCACX,GAAI,YAAmB,aAC5B,MAAO,GACF,GAAI,YAAY,OAAO,GAC5B,MAAO,GACF,GAAI,YAAmB,MAC5B,MAAO,CAAE,KAAM,GAAI,WACd,GAAI,MAAO,IAAY,SAC5B,MAAO,CAAE,KAAM,GAAI,WACd,CACL,GAAM,GAAO,GAAa,GAC1B,GAAI,EACF,MAAO,IAAiB,EAAM,GAE9B,KAAM,WAAU,qBAAuB,MAAO,MAU9C,GAAmB,CAAC,CAAE,OAAM,OAAM,QAAO,WAAW,IACjD,EACL,OACA,OACA,QACA,QAAS,EAAU,GAAkB,EAAS,GAAY,SAUxD,GAAoB,CAAC,EAAS,IAAa,CAC/C,GAAI,GAAW,KACb,MAAO,GACF,GAAI,YAAmB,cAAe,YAAY,OAAO,GAC9D,MAAO,GACF,GAAI,YAAmB,MAC5B,MAAO,GACF,GAAI,MAAO,IAAY,SAC5B,MAAO,GACF,CACL,GAAM,GAAW,GAAW,GAC5B,GAAI,EACF,MAAO,IAAe,EAAU,GAAuB,GAGzD,GAAM,GAAgB,GAAgB,GACtC,GAAI,EACF,MAAO,IACL,EACA,GACA,GAIJ,GAAM,GAAiB,GAAiB,GACxC,GAAI,EACF,MAAO,IACL,GAAsB,GACtB,GACA,GAIJ,KAAM,WAAU,qBAAuB,MAAO,MAY5C,GAAa,AAAC,GAAU,CAE5B,GAAM,GAAS,EACf,MAAI,IAAU,MAAO,GAAO,OAAO,WAAc,WACxC,EAEA,MAYL,GAAkB,AAAC,GAAU,CAEjC,GAAM,GAAS,EACf,MAAI,IAAU,MAAO,GAAO,OAAO,gBAAmB,WAC7C,EAEA,MAWL,GAAmB,AAAC,GACpB,GAAS,MAAO,GAAM,WAAc,WAC/B,EAEA,KAWL,GAAe,AAAC,GAChB,MAAO,IAAU,UAAa,GAAM,MAAQ,EAAM,SAC7C,EAEA,KAIX,GAAO,QAAU,KChdjB,gCAGA,GAAM,IAAS,KACT,CAAE,aAAW,QAAQ,KAY3B,gBAA0B,GAAO,CAI/B,YAAa,EAAW,CACtB,MAAM,QAAS,CAAC,QAAS,QAwBrB,MAAM,EAAW,EAAU,GAAI,CACnC,GAAM,CAAE,OAAM,OAAM,YAAW,UAAS,UAAW,EAC7C,CAAE,QAAS,KAAM,MAAK,OAAO,KAAK,CACtC,KAAM,GAAe,GACrB,OACA,OACA,YACA,UACA,WAEF,MAAO,IAAW,KAGtB,GAAO,QAAU,GAQjB,GAAM,IAAiB,GACrB,GAAI,MAAM,GAAa,SAAS,EAAU,aAAe,EAOrD,GAAa,GACV,KAAK,EAAM,IAAK,GAAU,EAAK,SC3ExC,gCAGA,GAAM,IAAS,KACT,CAAE,aAAW,QAAQ,KAa3B,gBAAwB,GAAO,CAI7B,YAAa,EAAW,CACtB,MAAM,MAAO,CAAC,OAAQ,QAGlB,KAAK,EAAW,EAAU,GAAI,CAClC,GAAM,CAAE,YAAW,UAAS,UAAW,EACjC,CAAE,OAAQ,KAAM,MAAK,OAAO,IAAI,CACpC,KAAM,GAAe,GACrB,YACA,UACA,WAEF,MAAO,IAAU,KAGrB,GAAO,QAAU,GAQjB,GAAM,IAAiB,GACrB,GAAI,MAAM,GAAa,SAAS,EAAU,aAAe,GAAG,MC7C9D,gCAGA,GAAM,IAAmB,KACnB,GAAc,KACd,GAAY,KACZ,GAAa,KACb,GAAc,KACd,GAAY,KASlB,gBAAyB,GAAW,CAIlC,YAAa,EAAW,CACtB,MAAM,GACN,KAAK,UAAY,EACjB,KAAK,MAAQ,GAAI,IAAY,KAAK,WAClC,KAAK,IAAM,GAAI,IAAU,KAAK,WAC9B,KAAK,MAAQ,GAAI,IAAY,KAAK,WAClC,KAAK,IAAM,GAAI,IAAU,KAAK,iBAUzB,QAAQ,EAAM,EAAM,CACzB,EAAK,UAAU,QAAQ,SAWlB,WAAY,CACjB,MAAO,IAAI,IAAW,GAAI,IAAiB,eAUtC,MAAM,EAAM,CACjB,MAAO,IAAI,IAAW,GAAI,IAAiB,MAI/C,GAAO,QAAU,KCjEjB,gCACA,GAAO,QAAU,GAmBjB,YAAmB,EAAI,EAAmB,CAKtC,OAJI,GAAU,GAAI,OAAM,UAAU,OAAS,GACvC,EAAU,EACV,EAAU,EACV,EAAU,GACP,EAAQ,UAAU,QACrB,EAAO,KAAY,UAAU,KACjC,MAAO,IAAI,SAAQ,SAAkB,EAAS,EAAQ,CAClD,EAAO,GAAU,SAAkB,EAAmB,CAClD,GAAI,EAEA,GADA,EAAU,GACN,EACA,EAAO,OACN,CAGD,OAFI,GAAS,GAAI,OAAM,UAAU,OAAS,GACtC,EAAS,EACN,EAAS,EAAO,QACnB,EAAO,KAAY,UAAU,GACjC,EAAQ,MAAM,KAAM,KAIhC,GAAI,CACA,EAAG,MAAM,GAAO,KAAM,SACjB,EAAP,CACE,AAAI,GACA,GAAU,GACV,EAAO,UC/CvB,2BAOA,GAAI,IAAS,GAOb,GAAO,OAAS,SAAgB,EAAQ,CACpC,GAAI,GAAI,EAAO,OACf,GAAI,CAAC,EACD,MAAO,GAEX,OADI,GAAI,EACD,EAAE,EAAI,EAAI,GAAK,EAAO,OAAO,KAAO,KACvC,EAAE,EACN,MAAO,MAAK,KAAK,EAAO,OAAS,GAAK,EAAI,GAI9C,GAAI,IAAM,GAAI,OAAM,IAGhB,GAAM,GAAI,OAAM,KAGpB,OAAS,IAAI,EAAG,GAAI,IAChB,GAAI,GAAI,IAAK,GAAI,GAAK,GAAI,GAAK,GAAI,GAAK,GAAI,GAAK,GAAI,GAAK,GAAI,EAAI,GAAI,GAAK,IAAM,KASrF,GAAO,OAAS,SAAgB,EAAQ,EAAO,EAAK,CAMhD,OALI,GAAQ,KACR,EAAQ,GACR,EAAI,EACJ,EAAI,EACJ,EACG,EAAQ,GAAK,CAChB,GAAI,GAAI,EAAO,KACf,OAAQ,OACC,GACD,EAAM,KAAO,GAAI,GAAK,GACtB,EAAK,GAAI,IAAM,EACf,EAAI,EACJ,UACC,GACD,EAAM,KAAO,GAAI,EAAI,GAAK,GAC1B,EAAK,GAAI,KAAO,EAChB,EAAI,EACJ,UACC,GACD,EAAM,KAAO,GAAI,EAAI,GAAK,GAC1B,EAAM,KAAO,GAAI,EAAI,IACrB,EAAI,EACJ,MAER,AAAI,EAAI,MACH,KAAU,GAAQ,KAAK,KAAK,OAAO,aAAa,MAAM,OAAQ,IAC/D,EAAI,GASZ,MANI,IACA,GAAM,KAAO,GAAI,GACjB,EAAM,KAAO,GACT,IAAM,GACN,GAAM,KAAO,KAEjB,EACI,IACA,EAAM,KAAK,OAAO,aAAa,MAAM,OAAQ,EAAM,MAAM,EAAG,KACzD,EAAM,KAAK,KAEf,OAAO,aAAa,MAAM,OAAQ,EAAM,MAAM,EAAG,KAG5D,GAAI,IAAkB,mBAUtB,GAAO,OAAS,SAAgB,EAAQ,EAAQ,EAAQ,CAIpD,OAHI,GAAQ,EACR,EAAI,EACJ,EACK,EAAI,EAAG,EAAI,EAAO,QAAS,CAChC,GAAI,GAAI,EAAO,WAAW,KAC1B,GAAI,IAAM,IAAM,EAAI,EAChB,MACJ,GAAK,GAAI,GAAI,MAAQ,OACjB,KAAM,OAAM,IAChB,OAAQ,OACC,GACD,EAAI,EACJ,EAAI,EACJ,UACC,GACD,EAAO,KAAY,GAAK,EAAK,GAAI,KAAO,EACxC,EAAI,EACJ,EAAI,EACJ,UACC,GACD,EAAO,KAAa,GAAI,KAAO,EAAK,GAAI,KAAO,EAC/C,EAAI,EACJ,EAAI,EACJ,UACC,GACD,EAAO,KAAa,GAAI,IAAM,EAAI,EAClC,EAAI,EACJ,OAGZ,GAAI,IAAM,EACN,KAAM,OAAM,IAChB,MAAO,GAAS,GAQpB,GAAO,KAAO,SAAc,EAAQ,CAChC,MAAO,mEAAmE,KAAK,MCzInF,gCACA,GAAO,QAAU,GAQjB,aAAwB,CAOpB,KAAK,WAAa,GAUtB,GAAa,UAAU,GAAK,SAAY,EAAK,EAAI,EAAK,CAClD,MAAC,MAAK,WAAW,IAAS,MAAK,WAAW,GAAO,KAAK,KAAK,CACvD,GAAM,EACN,IAAM,GAAO,OAEV,MASX,GAAa,UAAU,IAAM,SAAa,EAAK,EAAI,CAC/C,GAAI,IAAQ,OACR,KAAK,WAAa,WAEd,IAAO,OACP,KAAK,WAAW,GAAO,OAGvB,QADI,GAAY,KAAK,WAAW,GACvB,EAAI,EAAG,EAAI,EAAU,QAC1B,AAAI,EAAU,GAAG,KAAO,EACpB,EAAU,OAAO,EAAG,GAEpB,EAAE,EAGlB,MAAO,OASX,GAAa,UAAU,KAAO,SAAc,EAAK,CAC7C,GAAI,GAAY,KAAK,WAAW,GAChC,GAAI,EAAW,CAGX,OAFI,GAAO,GACP,EAAI,EACD,EAAI,UAAU,QACjB,EAAK,KAAK,UAAU,MACxB,IAAK,EAAI,EAAG,EAAI,EAAU,QACtB,EAAU,GAAG,GAAG,MAAM,EAAU,KAAK,IAAK,GAElD,MAAO,SC1EX,gCAEA,GAAO,QAAU,GAAQ,IAqFzB,YAAiB,EAAS,CAGtB,MAAI,OAAO,eAAiB,YAAc,UAAW,CAEjD,GAAI,GAAM,GAAI,cAAa,CAAE,KACzB,EAAM,GAAI,YAAW,EAAI,QACzB,EAAM,EAAI,KAAO,IAErB,WAA4B,EAAK,EAAK,EAAK,CACvC,EAAI,GAAK,EACT,EAAI,GAAW,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GAGvB,WAA4B,EAAK,EAAK,EAAK,CACvC,EAAI,GAAK,EACT,EAAI,GAAW,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GAIvB,EAAQ,aAAe,EAAK,EAAqB,EAEjD,EAAQ,aAAe,EAAK,EAAqB,EAEjD,WAA2B,EAAK,EAAK,CACjC,SAAI,GAAK,EAAI,GACb,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACZ,EAAI,GAGf,WAA2B,EAAK,EAAK,CACjC,SAAI,GAAK,EAAI,GACb,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACZ,EAAI,GAIf,EAAQ,YAAc,EAAK,EAAoB,EAE/C,EAAQ,YAAc,EAAK,EAAoB,KAGvC,UAAW,CAEnB,WAA4B,EAAW,EAAK,EAAK,EAAK,CAClD,GAAI,GAAO,EAAM,EAAI,EAAI,EAGzB,GAFI,GACA,GAAM,CAAC,GACP,IAAQ,EACR,EAAU,EAAI,EAAM,EAAmB,EAAqB,WAAY,EAAK,WACxE,MAAM,GACX,EAAU,WAAY,EAAK,WACtB,EAAM,qBACX,EAAW,IAAQ,GAAK,cAAgB,EAAG,EAAK,WAC3C,EAAM,sBACX,EAAW,IAAQ,GAAK,KAAK,MAAM,EAAM,yBAA4B,EAAG,EAAK,OAC5E,CACD,GAAI,GAAW,KAAK,MAAM,KAAK,IAAI,GAAO,KAAK,KAC3C,EAAW,KAAK,MAAM,EAAM,KAAK,IAAI,EAAG,CAAC,GAAY,SAAW,QACpE,EAAW,IAAQ,GAAK,EAAW,KAAO,GAAK,KAAc,EAAG,EAAK,IAI7E,EAAQ,aAAe,EAAmB,KAAK,KAAM,IACrD,EAAQ,aAAe,EAAmB,KAAK,KAAM,IAErD,WAA2B,EAAU,EAAK,EAAK,CAC3C,GAAI,GAAO,EAAS,EAAK,GACrB,EAAQ,IAAQ,IAAM,EAAI,EAC1B,EAAW,IAAS,GAAK,IACzB,EAAW,EAAO,QACtB,MAAO,KAAa,IACd,EACA,IACA,EAAO,SACP,IAAa,EACb,EAAO,qBAAwB,EAC/B,EAAO,KAAK,IAAI,EAAG,EAAW,KAAQ,GAAW,SAG3D,EAAQ,YAAc,EAAkB,KAAK,KAAM,IACnD,EAAQ,YAAc,EAAkB,KAAK,KAAM,OAKvD,AAAI,MAAO,eAAiB,YAAc,UAAW,CAEjD,GAAI,GAAM,GAAI,cAAa,CAAC,KACxB,EAAM,GAAI,YAAW,EAAI,QACzB,EAAM,EAAI,KAAO,IAErB,WAA6B,EAAK,EAAK,EAAK,CACxC,EAAI,GAAK,EACT,EAAI,GAAW,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GAGvB,WAA6B,EAAK,EAAK,EAAK,CACxC,EAAI,GAAK,EACT,EAAI,GAAW,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GACnB,EAAI,EAAM,GAAK,EAAI,GAIvB,EAAQ,cAAgB,EAAK,EAAsB,EAEnD,EAAQ,cAAgB,EAAK,EAAsB,EAEnD,WAA4B,EAAK,EAAK,CAClC,SAAI,GAAK,EAAI,GACb,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACZ,EAAI,GAGf,WAA4B,EAAK,EAAK,CAClC,SAAI,GAAK,EAAI,GACb,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACnB,EAAI,GAAK,EAAI,EAAM,GACZ,EAAI,GAIf,EAAQ,aAAe,EAAK,EAAqB,EAEjD,EAAQ,aAAe,EAAK,EAAqB,KAGzC,UAAW,CAEnB,WAA6B,EAAW,EAAM,EAAM,EAAK,EAAK,EAAK,CAC/D,GAAI,GAAO,EAAM,EAAI,EAAI,EAGzB,GAFI,GACA,GAAM,CAAC,GACP,IAAQ,EACR,EAAU,EAAG,EAAK,EAAM,GACxB,EAAU,EAAI,EAAM,EAAmB,EAAqB,WAAY,EAAK,EAAM,WAC5E,MAAM,GACb,EAAU,EAAG,EAAK,EAAM,GACxB,EAAU,WAAY,EAAK,EAAM,WAC1B,EAAM,sBACb,EAAU,EAAG,EAAK,EAAM,GACxB,EAAW,IAAQ,GAAK,cAAgB,EAAG,EAAK,EAAM,OACnD,CACH,GAAI,GACJ,GAAI,EAAM,uBACN,EAAW,EAAM,OACjB,EAAU,IAAa,EAAG,EAAK,EAAM,GACrC,EAAW,IAAQ,GAAK,EAAW,cAAgB,EAAG,EAAK,EAAM,OAC9D,CACH,GAAI,GAAW,KAAK,MAAM,KAAK,IAAI,GAAO,KAAK,KAC/C,AAAI,IAAa,MACb,GAAW,MACf,EAAW,EAAM,KAAK,IAAI,EAAG,CAAC,GAC9B,EAAU,EAAW,mBAAqB,EAAG,EAAK,EAAM,GACxD,EAAW,IAAQ,GAAK,EAAW,MAAQ,GAAK,EAAW,QAAU,WAAa,EAAG,EAAK,EAAM,KAK5G,EAAQ,cAAgB,EAAoB,KAAK,KAAM,GAAa,EAAG,GACvE,EAAQ,cAAgB,EAAoB,KAAK,KAAM,GAAa,EAAG,GAEvE,WAA4B,EAAU,EAAM,EAAM,EAAK,EAAK,CACxD,GAAI,GAAK,EAAS,EAAK,EAAM,GACzB,EAAK,EAAS,EAAK,EAAM,GACzB,EAAQ,IAAM,IAAM,EAAI,EACxB,EAAW,IAAO,GAAK,KACvB,EAAW,WAAc,GAAK,SAAW,EAC7C,MAAO,KAAa,KACd,EACA,IACA,EAAO,SACP,IAAa,EACb,EAAO,OAAS,EAChB,EAAO,KAAK,IAAI,EAAG,EAAW,MAAS,GAAW,kBAG5D,EAAQ,aAAe,EAAmB,KAAK,KAAM,GAAY,EAAG,GACpE,EAAQ,aAAe,EAAmB,KAAK,KAAM,GAAY,EAAG,MAIjE,EAKX,YAAqB,EAAK,EAAK,EAAK,CAChC,EAAI,GAAY,EAAa,IAC7B,EAAI,EAAM,GAAM,IAAQ,EAAK,IAC7B,EAAI,EAAM,GAAM,IAAQ,GAAK,IAC7B,EAAI,EAAM,GAAM,IAAQ,GAG5B,YAAqB,EAAK,EAAK,EAAK,CAChC,EAAI,GAAY,IAAQ,GACxB,EAAI,EAAM,GAAM,IAAQ,GAAK,IAC7B,EAAI,EAAM,GAAM,IAAQ,EAAK,IAC7B,EAAI,EAAM,GAAM,EAAa,IAGjC,YAAoB,EAAK,EAAK,CAC1B,MAAQ,GAAI,GACJ,EAAI,EAAM,IAAM,EAChB,EAAI,EAAM,IAAM,GAChB,EAAI,EAAM,IAAM,MAAQ,EAGpC,YAAoB,EAAK,EAAK,CAC1B,MAAQ,GAAI,IAAY,GAChB,EAAI,EAAM,IAAM,GAChB,EAAI,EAAM,IAAM,EAChB,EAAI,EAAM,MAAQ,KC7U9B,yCACA,OAAO,QAAU,QAQjB,iBAAiB,WAAY,CACzB,GAAI,CACA,GAAI,KAAM,KAAK,QAAQ,QAAQ,IAAI,OAAO,YAC1C,GAAI,KAAQ,KAAI,QAAU,OAAO,KAAK,KAAK,QACvC,MAAO,WACN,EAAP,EACF,MAAO,SCfX,2BAOA,GAAI,IAAO,GAOX,GAAK,OAAS,SAAqB,EAAQ,CAGvC,OAFI,GAAM,EACN,EAAI,EACC,EAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EACjC,EAAI,EAAO,WAAW,GACtB,AAAI,EAAI,IACJ,GAAO,EACN,AAAI,EAAI,KACT,GAAO,EACN,AAAK,GAAI,QAAY,OAAW,GAAO,WAAW,EAAI,GAAK,QAAY,MACxE,GAAE,EACF,GAAO,GAEP,GAAO,EAEf,MAAO,IAUX,GAAK,KAAO,SAAmB,EAAQ,EAAO,EAAK,CAC/C,GAAI,GAAM,EAAM,EAChB,GAAI,EAAM,EACN,MAAO,GAKX,OAJI,GAAQ,KACR,EAAQ,GACR,EAAI,EACJ,EACG,EAAQ,GACX,EAAI,EAAO,KACX,AAAI,EAAI,IACJ,EAAM,KAAO,EACZ,AAAI,EAAI,KAAO,EAAI,IACpB,EAAM,KAAQ,GAAI,KAAO,EAAI,EAAO,KAAW,GAC9C,AAAI,EAAI,KAAO,EAAI,IACpB,GAAM,IAAI,IAAM,GAAM,GAAO,KAAW,KAAO,GAAM,GAAO,KAAW,KAAO,EAAI,EAAO,KAAW,IAAM,MAC1G,EAAM,KAAO,MAAU,IAAK,IAC5B,EAAM,KAAO,MAAU,GAAI,OAE3B,EAAM,KAAQ,GAAI,KAAO,GAAM,GAAO,KAAW,KAAO,EAAI,EAAO,KAAW,GAC9E,EAAI,MACH,KAAU,GAAQ,KAAK,KAAK,OAAO,aAAa,MAAM,OAAQ,IAC/D,EAAI,GAGZ,MAAI,GACI,IACA,EAAM,KAAK,OAAO,aAAa,MAAM,OAAQ,EAAM,MAAM,EAAG,KACzD,EAAM,KAAK,KAEf,OAAO,aAAa,MAAM,OAAQ,EAAM,MAAM,EAAG,KAU5D,GAAK,MAAQ,SAAoB,EAAQ,EAAQ,EAAQ,CAIrD,OAHI,GAAQ,EACR,EACA,EACK,EAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EACjC,EAAK,EAAO,WAAW,GACvB,AAAI,EAAK,IACL,EAAO,KAAY,EAChB,AAAI,EAAK,KACZ,GAAO,KAAY,GAAM,EAAU,IACnC,EAAO,KAAY,EAAW,GAAK,KAChC,AAAK,GAAK,QAAY,OAAY,IAAK,EAAO,WAAW,EAAI,IAAM,QAAY,MAClF,GAAK,MAAY,IAAK,OAAW,IAAO,GAAK,MAC7C,EAAE,EACF,EAAO,KAAY,GAAM,GAAU,IACnC,EAAO,KAAY,GAAM,GAAK,GAAK,IACnC,EAAO,KAAY,GAAM,EAAK,GAAK,IACnC,EAAO,KAAY,EAAW,GAAK,KAEnC,GAAO,KAAY,GAAM,GAAU,IACnC,EAAO,KAAY,GAAM,EAAK,GAAK,IACnC,EAAO,KAAY,EAAW,GAAK,KAG3C,MAAO,GAAS,KCvGpB,gCACA,GAAO,QAAU,GA6BjB,YAAc,EAAO,EAAO,EAAM,CAC9B,GAAI,GAAS,GAAQ,KACjB,EAAS,IAAS,EAClB,EAAS,KACT,EAAS,EACb,MAAO,UAAoB,EAAM,CAC7B,GAAI,EAAO,GAAK,EAAO,EACnB,MAAO,GAAM,GACjB,AAAI,EAAS,EAAO,GAChB,GAAO,EAAM,GACb,EAAS,GAEb,GAAI,GAAM,EAAM,KAAK,EAAM,EAAQ,GAAU,GAC7C,MAAI,GAAS,GACT,GAAU,GAAS,GAAK,GACrB,MC7Cf,gCACA,GAAO,QAAU,GAEjB,GAAI,IAAO,KAUX,YAAkB,EAAI,EAAI,CAStB,KAAK,GAAK,IAAO,EAMjB,KAAK,GAAK,IAAO,EAQrB,GAAI,IAAO,GAAS,KAAO,GAAI,IAAS,EAAG,GAE3C,GAAK,SAAW,UAAW,CAAE,MAAO,IACpC,GAAK,SAAW,GAAK,SAAW,UAAW,CAAE,MAAO,OACpD,GAAK,OAAS,UAAW,CAAE,MAAO,IAOlC,GAAI,IAAW,GAAS,SAAW,mBAOnC,GAAS,WAAa,SAAoB,EAAO,CAC7C,GAAI,IAAU,EACV,MAAO,IACX,GAAI,GAAO,EAAQ,EACnB,AAAI,GACA,GAAQ,CAAC,GACb,GAAI,GAAK,IAAU,EACf,EAAM,GAAQ,GAAM,aAAe,EACvC,MAAI,IACA,GAAK,CAAC,IAAO,EACb,EAAK,CAAC,IAAO,EACT,EAAE,EAAK,YACP,GAAK,EACD,EAAE,EAAK,YACP,GAAK,KAGV,GAAI,IAAS,EAAI,IAQ5B,GAAS,KAAO,SAAc,EAAO,CACjC,GAAI,MAAO,IAAU,SACjB,MAAO,IAAS,WAAW,GAC/B,GAAI,GAAK,SAAS,GAEd,GAAI,GAAK,KACL,EAAQ,GAAK,KAAK,WAAW,OAE7B,OAAO,IAAS,WAAW,SAAS,EAAO,KAEnD,MAAO,GAAM,KAAO,EAAM,KAAO,GAAI,IAAS,EAAM,MAAQ,EAAG,EAAM,OAAS,GAAK,IAQvF,GAAS,UAAU,SAAW,SAAkB,EAAU,CACtD,GAAI,CAAC,GAAY,KAAK,KAAO,GAAI,CAC7B,GAAI,GAAK,CAAC,KAAK,GAAK,IAAM,EACtB,EAAK,CAAC,KAAK,KAAW,EAC1B,MAAK,IACD,GAAK,EAAK,IAAM,GACb,CAAE,GAAK,EAAK,YAEvB,MAAO,MAAK,GAAK,KAAK,GAAK,YAQ/B,GAAS,UAAU,OAAS,SAAgB,EAAU,CAClD,MAAO,IAAK,KACN,GAAI,IAAK,KAAK,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,QAAQ,IAEhD,CAAE,IAAK,KAAK,GAAK,EAAG,KAAM,KAAK,GAAK,EAAG,SAAU,QAAQ,KAGnE,GAAI,IAAa,OAAO,UAAU,WAOlC,GAAS,SAAW,SAAkB,EAAM,CACxC,MAAI,KAAS,GACF,GACJ,GAAI,IACL,IAAW,KAAK,EAAM,GACtB,GAAW,KAAK,EAAM,IAAM,EAC5B,GAAW,KAAK,EAAM,IAAM,GAC5B,GAAW,KAAK,EAAM,IAAM,MAAQ,EAEpC,IAAW,KAAK,EAAM,GACtB,GAAW,KAAK,EAAM,IAAM,EAC5B,GAAW,KAAK,EAAM,IAAM,GAC5B,GAAW,KAAK,EAAM,IAAM,MAAQ,IAQ9C,GAAS,UAAU,OAAS,UAAkB,CAC1C,MAAO,QAAO,aACV,KAAK,GAAY,IACjB,KAAK,KAAO,EAAK,IACjB,KAAK,KAAO,GAAK,IACjB,KAAK,KAAO,GACZ,KAAK,GAAY,IACjB,KAAK,KAAO,EAAK,IACjB,KAAK,KAAO,GAAK,IACjB,KAAK,KAAO,KAQpB,GAAS,UAAU,SAAW,UAAoB,CAC9C,GAAI,GAAS,KAAK,IAAM,GACxB,YAAK,GAAQ,OAAK,IAAM,EAAI,KAAK,KAAO,IAAM,KAAU,EACxD,KAAK,GAAQ,MAAK,IAAM,EAAsB,KAAU,EACjD,MAOX,GAAS,UAAU,SAAW,UAAoB,CAC9C,GAAI,GAAO,CAAE,MAAK,GAAK,GACvB,YAAK,GAAQ,OAAK,KAAO,EAAI,KAAK,IAAM,IAAM,KAAU,EACxD,KAAK,GAAQ,MAAK,KAAO,EAAqB,KAAU,EACjD,MAOX,GAAS,UAAU,OAAS,UAAkB,CAC1C,GAAI,GAAS,KAAK,GACd,EAAS,MAAK,KAAO,GAAK,KAAK,IAAM,KAAO,EAC5C,EAAS,KAAK,KAAO,GACzB,MAAO,KAAU,EACV,IAAU,EACR,EAAQ,MACN,EAAQ,IAAM,EAAI,EAClB,EAAQ,QAAU,EAAI,EACxB,EAAQ,MACN,EAAQ,IAAM,EAAI,EAClB,EAAQ,QAAU,EAAI,EAC1B,EAAQ,IAAM,EAAI,MCtM7B,2BACA,GAAI,IAAO,GAGX,GAAK,UAAY,KAGjB,GAAK,OAAS,KAGd,GAAK,aAAe,KAGpB,GAAK,MAAQ,KAGb,GAAK,QAAU,KAGf,GAAK,KAAO,KAGZ,GAAK,KAAO,KAGZ,GAAK,SAAW,KAOhB,GAAK,OAAS,QAAQ,MAAO,SAAW,aAClB,QACA,OAAO,SACP,OAAO,QAAQ,UACf,OAAO,QAAQ,SAAS,MAO9C,GAAK,OAAS,GAAK,QAAU,QACf,MAAO,SAAW,aAAe,QACjC,MAAO,OAAW,aAAe,MACjC,GAQd,GAAK,WAAa,OAAO,OAAS,OAAO,OAAO,IAAiC,GAOjF,GAAK,YAAc,OAAO,OAAS,OAAO,OAAO,IAAiC,GAQlF,GAAK,UAAY,OAAO,WAAwC,SAAmB,EAAO,CACtF,MAAO,OAAO,IAAU,UAAY,SAAS,IAAU,KAAK,MAAM,KAAW,GAQjF,GAAK,SAAW,SAAkB,EAAO,CACrC,MAAO,OAAO,IAAU,UAAY,YAAiB,SAQzD,GAAK,SAAW,SAAkB,EAAO,CACrC,MAAO,IAAS,MAAO,IAAU,UAWrC,GAAK,MAQL,GAAK,MAAQ,SAAe,EAAK,EAAM,CACnC,GAAI,GAAQ,EAAI,GAChB,MAAI,IAAS,MAAQ,EAAI,eAAe,GAC7B,MAAO,IAAU,UAAa,OAAM,QAAQ,GAAS,EAAM,OAAS,OAAO,KAAK,GAAO,QAAU,EACrG,IAcX,GAAK,OAAU,UAAW,CACtB,GAAI,CACA,GAAI,GAAS,GAAK,QAAQ,UAAU,OAEpC,MAAO,GAAO,UAAU,UAAY,EAAoC,WACnE,EAAP,CAEE,MAAO,UAKf,GAAK,aAAe,KAGpB,GAAK,oBAAsB,KAO3B,GAAK,UAAY,SAAmB,EAAa,CAE7C,MAAO,OAAO,IAAgB,SACxB,GAAK,OACD,GAAK,oBAAoB,GACzB,GAAI,IAAK,MAAM,GACnB,GAAK,OACD,GAAK,aAAa,GAClB,MAAO,aAAe,YAClB,EACA,GAAI,YAAW,IAOjC,GAAK,MAAQ,MAAO,aAAe,YAAc,WAAwC,MAezF,GAAK,KAAkC,GAAK,OAAO,SAAsC,GAAK,OAAO,QAAQ,MACtE,GAAK,OAAO,MACvC,GAAK,QAAQ,QAOzB,GAAK,OAAS,mBAOd,GAAK,QAAU,wBAOf,GAAK,QAAU,6CAOf,GAAK,WAAa,SAAoB,EAAO,CACzC,MAAO,GACD,GAAK,SAAS,KAAK,GAAO,SAC1B,GAAK,SAAS,UASxB,GAAK,aAAe,SAAsB,EAAM,EAAU,CACtD,GAAI,GAAO,GAAK,SAAS,SAAS,GAClC,MAAI,IAAK,KACE,GAAK,KAAK,SAAS,EAAK,GAAI,EAAK,GAAI,GACzC,EAAK,SAAS,QAAQ,KAWjC,YAAe,EAAK,EAAK,EAAU,CAC/B,OAAS,GAAO,OAAO,KAAK,GAAM,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EACxD,AAAI,GAAI,EAAK,MAAQ,QAAa,CAAC,IAC/B,GAAI,EAAK,IAAM,EAAI,EAAK,KAChC,MAAO,GAGX,GAAK,MAAQ,GAOb,GAAK,QAAU,SAAiB,EAAK,CACjC,MAAO,GAAI,OAAO,GAAG,cAAgB,EAAI,UAAU,IASvD,YAAkB,EAAM,CAEpB,WAAqB,EAAS,EAAY,CAEtC,GAAI,CAAE,gBAAgB,IAClB,MAAO,IAAI,GAAY,EAAS,GAKpC,OAAO,eAAe,KAAM,UAAW,CAAE,IAAK,UAAW,CAAE,MAAO,MAGlE,AAAI,MAAM,kBACN,MAAM,kBAAkB,KAAM,GAE9B,OAAO,eAAe,KAAM,QAAS,CAAE,MAAO,GAAI,SAAQ,OAAS,KAEnE,GACA,GAAM,KAAM,GAGpB,MAAC,GAAY,UAAY,OAAO,OAAO,MAAM,YAAY,YAAc,EAEvE,OAAO,eAAe,EAAY,UAAW,OAAQ,CAAE,IAAK,UAAW,CAAE,MAAO,MAEhF,EAAY,UAAU,SAAW,UAAoB,CACjD,MAAO,MAAK,KAAO,KAAO,KAAK,SAG5B,EAGX,GAAK,SAAW,GAmBhB,GAAK,cAAgB,GAAS,iBAoB9B,GAAK,YAAc,SAAkB,EAAY,CAE7C,OADI,GAAW,GACN,EAAI,EAAG,EAAI,EAAW,OAAQ,EAAE,EACrC,EAAS,EAAW,IAAM,EAO9B,MAAO,WAAW,CACd,OAAS,GAAO,OAAO,KAAK,MAAO,EAAI,EAAK,OAAS,EAAG,EAAI,GAAI,EAAE,EAC9D,GAAI,EAAS,EAAK,MAAQ,GAAK,KAAK,EAAK,MAAQ,QAAa,KAAK,EAAK,MAAQ,KAC5E,MAAO,GAAK,KAiB5B,GAAK,YAAc,SAAkB,EAAY,CAQ7C,MAAO,UAAS,EAAM,CAClB,OAAS,GAAI,EAAG,EAAI,EAAW,OAAQ,EAAE,EACrC,AAAI,EAAW,KAAO,GAClB,MAAO,MAAK,EAAW,MAoBvC,GAAK,cAAgB,CACjB,MAAO,OACP,MAAO,OACP,MAAO,OACP,KAAM,IAIV,GAAK,WAAa,UAAW,CACzB,GAAI,GAAS,GAAK,OAElB,GAAI,CAAC,EAAQ,CACT,GAAK,aAAe,GAAK,oBAAsB,KAC/C,OAIJ,GAAK,aAAe,EAAO,OAAS,WAAW,MAAQ,EAAO,MAE1D,SAAqB,EAAO,EAAU,CAClC,MAAO,IAAI,GAAO,EAAO,IAEjC,GAAK,oBAAsB,EAAO,aAE9B,SAA4B,EAAM,CAC9B,MAAO,IAAI,GAAO,OCla9B,gCACA,GAAO,QAAU,GAEjB,GAAI,IAAY,KAEZ,GAEA,GAAY,GAAK,SACjB,GAAY,GAAK,OACjB,GAAY,GAAK,KAWrB,YAAY,EAAI,EAAK,EAAK,CAMtB,KAAK,GAAK,EAMV,KAAK,IAAM,EAMX,KAAK,KAAO,OAMZ,KAAK,IAAM,EAIf,aAAgB,EAUhB,YAAe,EAAQ,CAMnB,KAAK,KAAO,EAAO,KAMnB,KAAK,KAAO,EAAO,KAMnB,KAAK,IAAM,EAAO,IAMlB,KAAK,KAAO,EAAO,OAQvB,aAAkB,CAMd,KAAK,IAAM,EAMX,KAAK,KAAO,GAAI,IAAG,GAAM,EAAG,GAM5B,KAAK,KAAO,KAAK,KAMjB,KAAK,OAAS,KASlB,GAAI,IAAS,UAAkB,CAC3B,MAAO,IAAK,OACN,UAA+B,CAC7B,MAAQ,IAAO,OAAS,UAAyB,CAC7C,MAAO,IAAI,SAIjB,UAAwB,CACtB,MAAO,IAAI,MASvB,GAAO,OAAS,KAOhB,GAAO,MAAQ,SAAe,EAAM,CAChC,MAAO,IAAI,IAAK,MAAM,IAK1B,AAAI,GAAK,QAAU,OACf,IAAO,MAAQ,GAAK,KAAK,GAAO,MAAO,GAAK,MAAM,UAAU,WAUhE,GAAO,UAAU,MAAQ,SAAc,EAAI,EAAK,EAAK,CACjD,YAAK,KAAO,KAAK,KAAK,KAAO,GAAI,IAAG,EAAI,EAAK,GAC7C,KAAK,KAAO,EACL,MAGX,YAAmB,EAAK,EAAK,EAAK,CAC9B,EAAI,GAAO,EAAM,IAGrB,YAAuB,EAAK,EAAK,EAAK,CAClC,KAAO,EAAM,KACT,EAAI,KAAS,EAAM,IAAM,IACzB,KAAS,EAEb,EAAI,GAAO,EAYf,YAAkB,EAAK,EAAK,CACxB,KAAK,IAAM,EACX,KAAK,KAAO,OACZ,KAAK,IAAM,EAGf,GAAS,UAAY,OAAO,OAAO,GAAG,WACtC,GAAS,UAAU,GAAK,GAOxB,GAAO,UAAU,OAAS,SAAsB,EAAO,CAGnD,YAAK,KAAQ,MAAK,KAAO,KAAK,KAAK,KAAO,GAAI,IACzC,GAAQ,IAAU,GACT,IAAY,EACpB,EAAQ,MAAY,EACpB,EAAQ,QAAY,EACpB,EAAQ,UAAY,EACA,EAC1B,IAAQ,IACD,MASX,GAAO,UAAU,MAAQ,SAAqB,EAAO,CACjD,MAAO,GAAQ,EACT,KAAK,MAAM,GAAe,GAAI,GAAS,WAAW,IAClD,KAAK,OAAO,IAQtB,GAAO,UAAU,OAAS,SAAsB,EAAO,CACnD,MAAO,MAAK,OAAQ,IAAS,EAAI,GAAS,MAAQ,IAGtD,YAAuB,EAAK,EAAK,EAAK,CAClC,KAAO,EAAI,IACP,EAAI,KAAS,EAAI,GAAK,IAAM,IAC5B,EAAI,GAAM,GAAI,KAAO,EAAI,EAAI,IAAM,MAAQ,EAC3C,EAAI,MAAQ,EAEhB,KAAO,EAAI,GAAK,KACZ,EAAI,KAAS,EAAI,GAAK,IAAM,IAC5B,EAAI,GAAK,EAAI,KAAO,EAExB,EAAI,KAAS,EAAI,GASrB,GAAO,UAAU,OAAS,SAAsB,EAAO,CACnD,GAAI,GAAO,GAAS,KAAK,GACzB,MAAO,MAAK,MAAM,GAAe,EAAK,SAAU,IAUpD,GAAO,UAAU,MAAQ,GAAO,UAAU,OAQ1C,GAAO,UAAU,OAAS,SAAsB,EAAO,CACnD,GAAI,GAAO,GAAS,KAAK,GAAO,WAChC,MAAO,MAAK,MAAM,GAAe,EAAK,SAAU,IAQpD,GAAO,UAAU,KAAO,SAAoB,EAAO,CAC/C,MAAO,MAAK,MAAM,GAAW,EAAG,EAAQ,EAAI,IAGhD,YAAsB,EAAK,EAAK,EAAK,CACjC,EAAI,GAAY,EAAc,IAC9B,EAAI,EAAM,GAAM,IAAQ,EAAM,IAC9B,EAAI,EAAM,GAAM,IAAQ,GAAM,IAC9B,EAAI,EAAM,GAAM,IAAQ,GAQ5B,GAAO,UAAU,QAAU,SAAuB,EAAO,CACrD,MAAO,MAAK,MAAM,GAAc,EAAG,IAAU,IASjD,GAAO,UAAU,SAAW,GAAO,UAAU,QAQ7C,GAAO,UAAU,QAAU,SAAuB,EAAO,CACrD,GAAI,GAAO,GAAS,KAAK,GACzB,MAAO,MAAK,MAAM,GAAc,EAAG,EAAK,IAAI,MAAM,GAAc,EAAG,EAAK,KAU5E,GAAO,UAAU,SAAW,GAAO,UAAU,QAQ7C,GAAO,UAAU,MAAQ,SAAqB,EAAO,CACjD,MAAO,MAAK,MAAM,GAAK,MAAM,aAAc,EAAG,IASlD,GAAO,UAAU,OAAS,SAAsB,EAAO,CACnD,MAAO,MAAK,MAAM,GAAK,MAAM,cAAe,EAAG,IAGnD,GAAI,IAAa,GAAK,MAAM,UAAU,IAChC,SAAwB,EAAK,EAAK,EAAK,CACrC,EAAI,IAAI,EAAK,IAGf,SAAwB,EAAK,EAAK,EAAK,CACrC,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,EAAE,EAC9B,EAAI,EAAM,GAAK,EAAI,IAQ/B,GAAO,UAAU,MAAQ,SAAqB,EAAO,CACjD,GAAI,GAAM,EAAM,SAAW,EAC3B,GAAI,CAAC,EACD,MAAO,MAAK,MAAM,GAAW,EAAG,GACpC,GAAI,GAAK,SAAS,GAAQ,CACtB,GAAI,GAAM,GAAO,MAAM,EAAM,GAAO,OAAO,IAC3C,GAAO,OAAO,EAAO,EAAK,GAC1B,EAAQ,EAEZ,MAAO,MAAK,OAAO,GAAK,MAAM,GAAY,EAAK,IAQnD,GAAO,UAAU,OAAS,SAAsB,EAAO,CACnD,GAAI,GAAM,GAAK,OAAO,GACtB,MAAO,GACD,KAAK,OAAO,GAAK,MAAM,GAAK,MAAO,EAAK,GACxC,KAAK,MAAM,GAAW,EAAG,IAQnC,GAAO,UAAU,KAAO,UAAgB,CACpC,YAAK,OAAS,GAAI,IAAM,MACxB,KAAK,KAAO,KAAK,KAAO,GAAI,IAAG,GAAM,EAAG,GACxC,KAAK,IAAM,EACJ,MAOX,GAAO,UAAU,MAAQ,UAAiB,CACtC,MAAI,MAAK,OACL,MAAK,KAAS,KAAK,OAAO,KAC1B,KAAK,KAAS,KAAK,OAAO,KAC1B,KAAK,IAAS,KAAK,OAAO,IAC1B,KAAK,OAAS,KAAK,OAAO,MAE1B,MAAK,KAAO,KAAK,KAAO,GAAI,IAAG,GAAM,EAAG,GACxC,KAAK,IAAO,GAET,MAOX,GAAO,UAAU,OAAS,UAAkB,CACxC,GAAI,GAAO,KAAK,KACZ,EAAO,KAAK,KACZ,EAAO,KAAK,IAChB,YAAK,QAAQ,OAAO,GAChB,GACA,MAAK,KAAK,KAAO,EAAK,KACtB,KAAK,KAAO,EACZ,KAAK,KAAO,GAET,MAOX,GAAO,UAAU,OAAS,UAAkB,CAIxC,OAHI,GAAO,KAAK,KAAK,KACjB,EAAO,KAAK,YAAY,MAAM,KAAK,KACnC,EAAO,EACJ,GACH,EAAK,GAAG,EAAK,IAAK,EAAK,GACvB,GAAO,EAAK,IACZ,EAAO,EAAK,KAGhB,MAAO,IAGX,GAAO,WAAa,SAAS,EAAe,CACxC,GAAe,EACf,GAAO,OAAS,KAChB,GAAa,gBC/cjB,gCACA,GAAO,QAAU,GAGjB,GAAI,IAAS,KACb,AAAC,IAAa,UAAY,OAAO,OAAO,GAAO,YAAY,YAAc,GAEzE,GAAI,IAAO,KAQX,aAAwB,CACpB,GAAO,KAAK,MAGhB,GAAa,WAAa,UAAY,CAOlC,GAAa,MAAQ,GAAK,oBAE1B,GAAa,iBAAmB,GAAK,QAAU,GAAK,OAAO,oBAAqB,aAAc,GAAK,OAAO,UAAU,IAAI,OAAS,MAC3H,SAA8B,EAAK,EAAK,EAAK,CAC7C,EAAI,IAAI,EAAK,IAIb,SAA+B,EAAK,EAAK,EAAK,CAC9C,GAAI,EAAI,KACN,EAAI,KAAK,EAAK,EAAK,EAAG,EAAI,YACvB,QAAS,GAAI,EAAG,EAAI,EAAI,QAC3B,EAAI,KAAS,EAAI,OAQ7B,GAAa,UAAU,MAAQ,SAA4B,EAAO,CAC9D,AAAI,GAAK,SAAS,IACd,GAAQ,GAAK,aAAa,EAAO,WACrC,GAAI,GAAM,EAAM,SAAW,EAC3B,YAAK,OAAO,GACR,GACA,KAAK,MAAM,GAAa,iBAAkB,EAAK,GAC5C,MAGX,YAA2B,EAAK,EAAK,EAAK,CACtC,AAAI,EAAI,OAAS,GACb,GAAK,KAAK,MAAM,EAAK,EAAK,GACzB,AAAI,EAAI,UACT,EAAI,UAAU,EAAK,GAEnB,EAAI,MAAM,EAAK,GAMvB,GAAa,UAAU,OAAS,SAA6B,EAAO,CAChE,GAAI,GAAM,GAAK,OAAO,WAAW,GACjC,YAAK,OAAO,GACR,GACA,KAAK,MAAM,GAAmB,EAAK,GAChC,MAWX,GAAa,eCpFb,gCACA,GAAO,QAAU,GAEjB,GAAI,IAAY,KAEZ,GAEA,GAAY,GAAK,SACjB,GAAY,GAAK,KAGrB,YAAyB,EAAQ,EAAa,CAC1C,MAAO,YAAW,uBAAyB,EAAO,IAAM,MAAS,IAAe,GAAK,MAAQ,EAAO,KASxG,YAAgB,EAAQ,CAMpB,KAAK,IAAM,EAMX,KAAK,IAAM,EAMX,KAAK,IAAM,EAAO,OAGtB,GAAI,IAAe,MAAO,aAAe,YACnC,SAA4B,EAAQ,CAClC,GAAI,YAAkB,aAAc,MAAM,QAAQ,GAC9C,MAAO,IAAI,IAAO,GACtB,KAAM,OAAM,mBAGd,SAAsB,EAAQ,CAC5B,GAAI,MAAM,QAAQ,GACd,MAAO,IAAI,IAAO,GACtB,KAAM,OAAM,mBAGhB,GAAS,UAAkB,CAC3B,MAAO,IAAK,OACN,SAA6B,EAAQ,CACnC,MAAQ,IAAO,OAAS,SAAuB,EAAQ,CACnD,MAAO,IAAK,OAAO,SAAS,GACtB,GAAI,IAAa,GAEjB,GAAa,KACpB,IAGL,IAUV,GAAO,OAAS,KAEhB,GAAO,UAAU,OAAS,GAAK,MAAM,UAAU,UAAuC,GAAK,MAAM,UAAU,MAO3G,GAAO,UAAU,OAAU,UAA6B,CACpD,GAAI,GAAQ,WACZ,MAAO,WAAuB,CAKgC,GAJ1D,EAAkB,MAAK,IAAI,KAAK,KAAO,OAAgB,EAAO,KAAK,IAAI,KAAK,OAAS,KACrF,GAAS,GAAS,MAAK,IAAI,KAAK,KAAO,MAAS,KAAO,EAAO,KAAK,IAAI,KAAK,OAAS,MACrF,GAAS,GAAS,MAAK,IAAI,KAAK,KAAO,MAAQ,MAAQ,EAAO,KAAK,IAAI,KAAK,OAAS,MACrF,GAAS,GAAS,MAAK,IAAI,KAAK,KAAO,MAAQ,MAAQ,EAAO,KAAK,IAAI,KAAK,OAAS,MACrF,GAAS,GAAS,MAAK,IAAI,KAAK,KAAQ,KAAO,MAAQ,EAAO,KAAK,IAAI,KAAK,OAAS,KAAK,MAAO,GAGjG,GAAK,MAAK,KAAO,GAAK,KAAK,IACvB,WAAK,IAAM,KAAK,IACV,GAAgB,KAAM,IAEhC,MAAO,OAQf,GAAO,UAAU,MAAQ,UAAsB,CAC3C,MAAO,MAAK,SAAW,GAO3B,GAAO,UAAU,OAAS,UAAuB,CAC7C,GAAI,GAAQ,KAAK,SACjB,MAAO,KAAU,EAAI,CAAE,GAAQ,GAAK,GAKxC,aAA0B,CAEtB,GAAI,GAAO,GAAI,IAAS,EAAG,GACvB,EAAI,EACR,GAAI,KAAK,IAAM,KAAK,IAAM,EAAG,CACzB,KAAO,EAAI,EAAG,EAAE,EAGZ,GADA,EAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,KAAO,MAAQ,EAAI,KAAO,EAC1D,KAAK,IAAI,KAAK,OAAS,IACvB,MAAO,GAKf,GAFA,EAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,KAAO,MAAQ,MAAQ,EAC3D,EAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,KAAO,MAAS,KAAO,EACvD,KAAK,IAAI,KAAK,OAAS,IACvB,MAAO,GACX,EAAI,MACD,CACH,KAAO,EAAI,EAAG,EAAE,EAAG,CAEf,GAAI,KAAK,KAAO,KAAK,IACjB,KAAM,IAAgB,MAG1B,GADA,EAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,KAAO,MAAQ,EAAI,KAAO,EAC1D,KAAK,IAAI,KAAK,OAAS,IACvB,MAAO,GAGf,SAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,OAAS,MAAQ,EAAI,KAAO,EACzD,EAEX,GAAI,KAAK,IAAM,KAAK,IAAM,GACtB,KAAO,EAAI,EAAG,EAAE,EAGZ,GADA,EAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,KAAO,MAAQ,EAAI,EAAI,KAAO,EAC9D,KAAK,IAAI,KAAK,OAAS,IACvB,MAAO,OAGf,MAAO,EAAI,EAAG,EAAE,EAAG,CAEf,GAAI,KAAK,KAAO,KAAK,IACjB,KAAM,IAAgB,MAG1B,GADA,EAAK,GAAM,GAAK,GAAM,MAAK,IAAI,KAAK,KAAO,MAAQ,EAAI,EAAI,KAAO,EAC9D,KAAK,IAAI,KAAK,OAAS,IACvB,MAAO,GAInB,KAAM,OAAM,2BA8BhB,GAAO,UAAU,KAAO,UAAqB,CACzC,MAAO,MAAK,WAAa,GAG7B,YAAyB,EAAK,EAAK,CAC/B,MAAQ,GAAI,EAAM,GACV,EAAI,EAAM,IAAM,EAChB,EAAI,EAAM,IAAM,GAChB,EAAI,EAAM,IAAM,MAAQ,EAOpC,GAAO,UAAU,QAAU,UAAwB,CAG/C,GAAI,KAAK,IAAM,EAAI,KAAK,IACpB,KAAM,IAAgB,KAAM,GAEhC,MAAO,IAAgB,KAAK,IAAK,KAAK,KAAO,IAOjD,GAAO,UAAU,SAAW,UAAyB,CAGjD,GAAI,KAAK,IAAM,EAAI,KAAK,IACpB,KAAM,IAAgB,KAAM,GAEhC,MAAO,IAAgB,KAAK,IAAK,KAAK,KAAO,GAAK,GAKtD,aAAyC,CAGrC,GAAI,KAAK,IAAM,EAAI,KAAK,IACpB,KAAM,IAAgB,KAAM,GAEhC,MAAO,IAAI,IAAS,GAAgB,KAAK,IAAK,KAAK,KAAO,GAAI,GAAgB,KAAK,IAAK,KAAK,KAAO,IAwBxG,GAAO,UAAU,MAAQ,UAAsB,CAG3C,GAAI,KAAK,IAAM,EAAI,KAAK,IACpB,KAAM,IAAgB,KAAM,GAEhC,GAAI,GAAQ,GAAK,MAAM,YAAY,KAAK,IAAK,KAAK,KAClD,YAAK,KAAO,EACL,GAQX,GAAO,UAAU,OAAS,UAAuB,CAG7C,GAAI,KAAK,IAAM,EAAI,KAAK,IACpB,KAAM,IAAgB,KAAM,GAEhC,GAAI,GAAQ,GAAK,MAAM,aAAa,KAAK,IAAK,KAAK,KACnD,YAAK,KAAO,EACL,GAOX,GAAO,UAAU,MAAQ,UAAsB,CAC3C,GAAI,GAAS,KAAK,SACd,EAAS,KAAK,IACd,EAAS,KAAK,IAAM,EAGxB,GAAI,EAAM,KAAK,IACX,KAAM,IAAgB,KAAM,GAGhC,MADA,MAAK,KAAO,EACR,MAAM,QAAQ,KAAK,KACZ,KAAK,IAAI,MAAM,EAAO,GAC1B,IAAU,EACX,GAAI,MAAK,IAAI,YAAY,GACzB,KAAK,OAAO,KAAK,KAAK,IAAK,EAAO,IAO5C,GAAO,UAAU,OAAS,UAAuB,CAC7C,GAAI,GAAQ,KAAK,QACjB,MAAO,IAAK,KAAK,EAAO,EAAG,EAAM,SAQrC,GAAO,UAAU,KAAO,SAAc,EAAQ,CAC1C,GAAI,MAAO,IAAW,SAAU,CAE5B,GAAI,KAAK,IAAM,EAAS,KAAK,IACzB,KAAM,IAAgB,KAAM,GAChC,KAAK,KAAO,MAEZ,GAEI,IAAI,KAAK,KAAO,KAAK,IACjB,KAAM,IAAgB,YACrB,KAAK,IAAI,KAAK,OAAS,KAEpC,MAAO,OAQX,GAAO,UAAU,SAAW,SAAS,EAAU,CAC3C,OAAQ,OACC,GACD,KAAK,OACL,UACC,GACD,KAAK,KAAK,GACV,UACC,GACD,KAAK,KAAK,KAAK,UACf,UACC,GACD,KAAQ,GAAW,KAAK,SAAW,IAAO,GACtC,KAAK,SAAS,GAElB,UACC,GACD,KAAK,KAAK,GACV,cAIA,KAAM,OAAM,qBAAuB,EAAW,cAAgB,KAAK,KAE3E,MAAO,OAGX,GAAO,WAAa,SAAS,EAAe,CACxC,GAAe,EACf,GAAO,OAAS,KAChB,GAAa,aAEb,GAAI,GAAK,GAAK,KAAO,SAAsC,WAC3D,GAAK,MAAM,GAAO,UAAW,CAEzB,MAAO,UAAsB,CACzB,MAAO,IAAe,KAAK,MAAM,GAAI,KAGzC,OAAQ,UAAuB,CAC3B,MAAO,IAAe,KAAK,MAAM,GAAI,KAGzC,OAAQ,UAAuB,CAC3B,MAAO,IAAe,KAAK,MAAM,WAAW,GAAI,KAGpD,QAAS,UAAwB,CAC7B,MAAO,IAAY,KAAK,MAAM,GAAI,KAGtC,SAAU,UAAyB,CAC/B,MAAO,IAAY,KAAK,MAAM,GAAI,UCtZ9C,gCACA,GAAO,QAAU,GAGjB,GAAI,IAAS,KACb,AAAC,IAAa,UAAY,OAAO,OAAO,GAAO,YAAY,YAAc,GAEzE,GAAI,IAAO,KASX,YAAsB,EAAQ,CAC1B,GAAO,KAAK,KAAM,GAStB,GAAa,WAAa,UAAY,CAElC,AAAI,GAAK,QACL,IAAa,UAAU,OAAS,GAAK,OAAO,UAAU,QAO9D,GAAa,UAAU,OAAS,UAA8B,CAC1D,GAAI,GAAM,KAAK,SACf,MAAO,MAAK,IAAI,UACV,KAAK,IAAI,UAAU,KAAK,IAAK,KAAK,IAAM,KAAK,IAAI,KAAK,IAAM,EAAK,KAAK,MACtE,KAAK,IAAI,SAAS,QAAS,KAAK,IAAK,KAAK,IAAM,KAAK,IAAI,KAAK,IAAM,EAAK,KAAK,OAUxF,GAAa,eClDb,gCACA,GAAO,QAAU,GAEjB,GAAI,IAAO,KAGX,AAAC,IAAQ,UAAY,OAAO,OAAO,GAAK,aAAa,YAAY,YAAc,GAmC/E,YAAiB,EAAS,EAAkB,EAAmB,CAE3D,GAAI,MAAO,IAAY,WACnB,KAAM,WAAU,8BAEpB,GAAK,aAAa,KAAK,MAMvB,KAAK,QAAU,EAMf,KAAK,iBAAmB,QAAQ,GAMhC,KAAK,kBAAoB,QAAQ,GAcrC,GAAQ,UAAU,QAAU,WAAiB,EAAQ,EAAa,EAAc,EAAS,EAAU,CAE/F,GAAI,CAAC,EACD,KAAM,WAAU,6BAEpB,GAAI,GAAO,KACX,GAAI,CAAC,EACD,MAAO,IAAK,UAAU,EAAS,EAAM,EAAQ,EAAa,EAAc,GAE5E,GAAI,CAAC,EAAK,QAAS,CACf,WAAW,UAAW,CAAE,EAAS,MAAM,mBAAsB,GAC7D,OAGJ,GAAI,CACA,MAAO,GAAK,QACR,EACA,EAAY,EAAK,iBAAmB,kBAAoB,UAAU,GAAS,SAC3E,SAAqB,EAAK,EAAU,CAEhC,GAAI,EACA,SAAK,KAAK,QAAS,EAAK,GACjB,EAAS,GAGpB,GAAI,IAAa,KAAM,CACnB,EAAK,IAAqB,IAC1B,OAGJ,GAAI,CAAE,aAAoB,IACtB,GAAI,CACA,EAAW,EAAa,EAAK,kBAAoB,kBAAoB,UAAU,SAC1E,EAAP,CACE,SAAK,KAAK,QAAS,EAAK,GACjB,EAAS,GAIxB,SAAK,KAAK,OAAQ,EAAU,GACrB,EAAS,KAAM,WAGzB,EAAP,CACE,EAAK,KAAK,QAAS,EAAK,GACxB,WAAW,UAAW,CAAE,EAAS,IAAS,GAC1C,SASR,GAAQ,UAAU,IAAM,SAAa,EAAY,CAC7C,MAAI,MAAK,SACA,IACD,KAAK,QAAQ,KAAM,KAAM,MAC7B,KAAK,QAAU,KACf,KAAK,KAAK,OAAO,OAEd,QC5IX,2BAMA,GAAI,IAAM,GA6BV,GAAI,QAAU,OCnCd,gCACA,GAAO,QAAU,KCDjB,2BACA,GAAI,IAAW,GAQf,GAAS,MAAQ,UAGjB,GAAS,OAAe,KACxB,GAAS,aAAe,KACxB,GAAS,OAAe,KACxB,GAAS,aAAe,KAGxB,GAAS,KAAe,KACxB,GAAS,IAAe,KACxB,GAAS,MAAe,KACxB,GAAS,UAAe,GAOxB,aAAqB,CACjB,GAAS,KAAK,aACd,GAAS,OAAO,WAAW,GAAS,cACpC,GAAS,OAAO,WAAW,GAAS,cAIxC,OCnCA,mBAEA,aACA,GAAO,QAAU,OCHjB,mBACA,aAEA,GAAI,IAAY,KAGZ,GAAU,GAAU,OAAQ,GAAU,GAAU,OAAQ,GAAQ,GAAU,KAG1E,GAAQ,GAAU,MAAM,SAAe,IAAU,MAAM,QAAa,IAExE,GAAM,OAAU,UAAW,CAmBvB,WAAgB,EAAG,CACf,GAAI,EACA,OAAS,GAAK,OAAO,KAAK,GAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,EAAE,EAClD,AAAI,EAAE,EAAG,KAAO,MACZ,MAAK,EAAG,IAAM,EAAE,EAAG,KASnC,SAAO,UAAU,KAAO,GAAM,UAAU,IAQxC,EAAO,UAAU,KAAO,GAQxB,EAAO,UAAU,MAAQ,GAAM,KAAO,GAAM,KAAK,SAAS,EAAE,EAAE,IAAQ,EAWtE,EAAO,OAAS,SAAgB,EAAG,EAAG,CAClC,MAAK,IACD,GAAI,GAAQ,UACZ,EAAE,MAAQ,MAAQ,OAAO,eAAe,KAAK,EAAG,SAChD,EAAE,OAAO,IAAI,MAAM,EAAE,MACrB,EAAE,MAAQ,MAAQ,OAAO,eAAe,KAAK,EAAG,SAChD,EAAE,OAAO,IAAI,OAAO,EAAE,MACtB,EAAE,OAAS,MAAQ,OAAO,eAAe,KAAK,EAAG,UACjD,EAAE,OAAO,IAAI,OAAO,EAAE,OACnB,GAcX,EAAO,OAAS,SAAgB,EAAG,EAAG,CAClC,AAAM,YAAa,KACf,GAAI,GAAQ,OAAO,IAEvB,OADI,GAAI,IAAM,OAAY,EAAE,IAAM,EAAE,IAAM,EAAG,EAAI,GAAI,IAAM,OACpD,EAAE,IAAM,GAAG,CACd,GAAI,GAAI,EAAE,SACV,OAAQ,IAAM,OACT,GACD,EAAE,KAAO,EAAE,QACX,UACC,GACD,EAAE,KAAO,EAAE,SACX,UACC,GACD,EAAE,MAAQ,EAAE,SACZ,cAEA,EAAE,SAAS,EAAI,GACf,OAGR,MAAO,IAWX,EAAO,WAAa,SAAoB,EAAG,CACvC,GAAI,YAAa,IAAM,OACnB,MAAO,GACX,GAAI,GAAI,GAAI,IAAM,OAClB,MAAI,GAAE,MAAQ,MACV,CAAI,MAAO,GAAE,MAAS,SAClB,GAAM,OAAO,OAAO,EAAE,KAAM,EAAE,KAAO,GAAM,UAAU,GAAM,OAAO,OAAO,EAAE,OAAQ,GAC9E,EAAE,KAAK,QACZ,GAAE,KAAO,EAAE,OAEf,EAAE,MAAQ,MACV,GAAE,KAAO,OAAO,EAAE,OAElB,EAAE,OAAS,MACX,CAAI,GAAM,KACL,GAAE,MAAQ,GAAM,KAAK,UAAU,EAAE,QAAQ,SAAW,GACpD,AAAI,MAAO,GAAE,OAAU,SACxB,EAAE,MAAQ,SAAS,EAAE,MAAO,IAC3B,AAAI,MAAO,GAAE,OAAU,SACxB,EAAE,MAAQ,EAAE,MACP,MAAO,GAAE,OAAU,UACxB,GAAE,MAAQ,GAAI,IAAM,SAAS,EAAE,MAAM,MAAQ,EAAG,EAAE,MAAM,OAAS,GAAG,SAAS,MAE9E,GAYX,EAAO,SAAW,SAAkB,EAAG,EAAG,CACtC,AAAK,GACD,GAAI,IACR,GAAI,GAAI,GACR,GAAI,EAAE,SASF,GARA,AAAI,EAAE,QAAU,OACZ,EAAE,KAAO,GAET,GAAE,KAAO,GACL,EAAE,QAAU,OACZ,GAAE,KAAO,GAAM,UAAU,EAAE,QAEnC,EAAE,KAAO,GACL,GAAM,KAAM,CACZ,GAAI,GAAI,GAAI,IAAM,KAAK,EAAG,EAAG,IAC7B,EAAE,MAAQ,EAAE,QAAU,OAAS,EAAE,WAAa,EAAE,QAAU,OAAS,EAAE,WAAa,MAElF,GAAE,MAAQ,EAAE,QAAU,OAAS,IAAM,EAE7C,MAAI,GAAE,MAAQ,MAAQ,EAAE,eAAe,SACnC,GAAE,KAAO,EAAE,QAAU,OAAS,GAAM,OAAO,OAAO,EAAE,KAAM,EAAG,EAAE,KAAK,QAAU,EAAE,QAAU,MAAQ,MAAM,UAAU,MAAM,KAAK,EAAE,MAAQ,EAAE,MAEzI,EAAE,MAAQ,MAAQ,EAAE,eAAe,SACnC,GAAE,KAAO,EAAE,MAEX,EAAE,OAAS,MAAQ,EAAE,eAAe,UACpC,CAAI,MAAO,GAAE,OAAU,SACnB,EAAE,MAAQ,EAAE,QAAU,OAAS,OAAO,EAAE,OAAS,EAAE,MAEnD,EAAE,MAAQ,EAAE,QAAU,OAAS,GAAM,KAAK,UAAU,SAAS,KAAK,EAAE,OAAS,EAAE,QAAU,OAAS,GAAI,IAAM,SAAS,EAAE,MAAM,MAAQ,EAAG,EAAE,MAAM,OAAS,GAAG,SAAS,IAAQ,EAAE,OAEhL,GAUX,EAAO,UAAU,OAAS,UAAkB,CACxC,MAAO,MAAK,YAAY,SAAS,KAAM,GAAU,KAAK,gBAGnD,KAGX,GAAM,OAAU,UAAW,CAkBvB,WAAgB,EAAG,CAEf,GADA,KAAK,MAAQ,GACT,EACA,OAAS,GAAK,OAAO,KAAK,GAAI,EAAI,EAAG,EAAI,EAAG,OAAQ,EAAE,EAClD,AAAI,EAAE,EAAG,KAAO,MACZ,MAAK,EAAG,IAAM,EAAE,EAAG,KASnC,SAAO,UAAU,MAAQ,GAAM,WAQ/B,EAAO,UAAU,KAAO,GAAM,UAAU,IAWxC,EAAO,OAAS,SAAgB,EAAG,EAAG,CAKlC,GAJK,GACD,GAAI,GAAQ,UACZ,EAAE,MAAQ,MAAQ,OAAO,eAAe,KAAK,EAAG,SAChD,EAAE,OAAO,IAAI,MAAM,EAAE,MACrB,EAAE,OAAS,MAAQ,EAAE,MAAM,OAC3B,OAAS,GAAI,EAAG,EAAI,EAAE,MAAM,OAAQ,EAAE,EAClC,GAAM,OAAO,OAAO,EAAE,MAAM,GAAI,EAAE,OAAO,IAAI,QAAQ,SAE7D,MAAO,IAcX,EAAO,OAAS,SAAgB,EAAG,EAAG,CAClC,AAAM,YAAa,KACf,GAAI,GAAQ,OAAO,IAEvB,OADI,GAAI,IAAM,OAAY,EAAE,IAAM,EAAE,IAAM,EAAG,EAAI,GAAI,IAAM,OACpD,EAAE,IAAM,GAAG,CACd,GAAI,GAAI,EAAE,SACV,OAAQ,IAAM,OACT,GACD,AAAM,EAAE,OAAS,EAAE,MAAM,QACrB,GAAE,MAAQ,IACd,EAAE,MAAM,KAAK,GAAM,OAAO,OAAO,EAAG,EAAE,WACtC,UACC,GACD,EAAE,KAAO,EAAE,QACX,cAEA,EAAE,SAAS,EAAI,GACf,OAGR,MAAO,IAWX,EAAO,WAAa,SAAoB,EAAG,CACvC,GAAI,YAAa,IAAM,OACnB,MAAO,GACX,GAAI,GAAI,GAAI,IAAM,OAClB,GAAI,EAAE,MAAO,CACT,GAAI,CAAC,MAAM,QAAQ,EAAE,OACjB,KAAM,WAAU,iCACpB,EAAE,MAAQ,GACV,OAAS,GAAI,EAAG,EAAI,EAAE,MAAM,OAAQ,EAAE,EAAG,CACrC,GAAI,MAAO,GAAE,MAAM,IAAO,SACtB,KAAM,WAAU,kCACpB,EAAE,MAAM,GAAK,GAAM,OAAO,WAAW,EAAE,MAAM,KAGrD,MAAI,GAAE,MAAQ,MACV,CAAI,MAAO,GAAE,MAAS,SAClB,GAAM,OAAO,OAAO,EAAE,KAAM,EAAE,KAAO,GAAM,UAAU,GAAM,OAAO,OAAO,EAAE,OAAQ,GAC9E,EAAE,KAAK,QACZ,GAAE,KAAO,EAAE,OAEZ,GAYX,EAAO,SAAW,SAAkB,EAAG,EAAG,CACtC,AAAK,GACD,GAAI,IACR,GAAI,GAAI,GAgBR,GAfI,GAAE,QAAU,EAAE,WACd,GAAE,MAAQ,IAEV,EAAE,UACF,CAAI,EAAE,QAAU,OACZ,EAAE,KAAO,GAET,GAAE,KAAO,GACL,EAAE,QAAU,OACZ,GAAE,KAAO,GAAM,UAAU,EAAE,SAGnC,EAAE,MAAQ,MAAQ,EAAE,eAAe,SACnC,GAAE,KAAO,EAAE,QAAU,OAAS,GAAM,OAAO,OAAO,EAAE,KAAM,EAAG,EAAE,KAAK,QAAU,EAAE,QAAU,MAAQ,MAAM,UAAU,MAAM,KAAK,EAAE,MAAQ,EAAE,MAEzI,EAAE,OAAS,EAAE,MAAM,OAAQ,CAC3B,EAAE,MAAQ,GACV,OAAS,GAAI,EAAG,EAAI,EAAE,MAAM,OAAQ,EAAE,EAClC,EAAE,MAAM,GAAK,GAAM,OAAO,SAAS,EAAE,MAAM,GAAI,GAGvD,MAAO,IAUX,EAAO,UAAU,OAAS,UAAkB,CACxC,MAAO,MAAK,YAAY,SAAS,KAAM,GAAU,KAAK,gBAGnD,KAGX,GAAO,QAAU,KCnYjB,gCAEA,GAAM,IAAM,KACN,GAAuB,KAK7B,QAAc,CAMZ,YAAa,EAAM,EAAM,EAAK,CAC5B,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,qCAMlB,KAAK,KAAO,GAAQ,GACpB,KAAK,MAAQ,EACb,KAAK,KAAO,GAAI,IAAI,GAEpB,OAAO,iBAAiB,KAAM,CAC5B,SAAU,CAAE,MAAO,KAAM,SAAU,GAAM,WAAY,MAIzD,UAAY,CACV,MAAO,YAAY,KAAK,KAAK,kCAAkC,KAAK,gBAAgB,KAAK,SAG3F,QAAU,CACR,MAAK,MAAK,OACR,MAAK,MAAQ,OAAO,OAAO,CACzB,KAAM,KAAK,KACX,KAAM,KAAK,MACX,IAAK,KAAK,KAAK,yBAIZ,OAAO,OAAO,GAAI,KAAK,UAM5B,eAAgB,CAClB,MAAI,MAAK,UAAY,KACZ,KAAK,SAGd,MAAK,SAAW,GAAqB,KAAK,MACnC,KAAK,YAIhB,GAAO,QAAU,KC5DjB,mBACA,AAEA,AAAC,UAAU,EAAQ,EAAS,CAC1B,MAAO,KAAY,UAAY,MAAO,KAAW,YAAc,GAAO,QAAU,IAChF,MAAO,SAAW,YAAc,OAAO,IAAM,OAAO,GACnD,EAAO,OAAS,MACjB,GAAO,UAAY,CAAE,aAKrB,GAAI,GAAS,SAAU,EAAK,EAAM,CAChC,MAAO,GAAK,EAAI,QAAS,IAG3B,EAAO,QAAU,SAAU,EAAK,EAAM,CACpC,GAAI,GAAS,EAAK,EAAK,GAIvB,MAAI,KAAW,GACb,EAAK,EAAQ,KAAM,EAAI,OAAQ,GAG1B,GAKT,WAAc,EAAK,EAAM,CACvB,AAAI,MAAO,IAAU,YACnB,GAAO,SAAU,EAAG,EAAG,CACrB,MAAO,QAAO,GAAG,cAAc,KAKnC,GAAI,GAAM,EAAI,OACd,GAAI,GAAO,EACT,MAAO,GAOT,OADI,GAAS,GAAI,OAAM,GACd,EAAM,EAAG,EAAM,EAAK,GAAO,EAAG,CACrC,EAAK,EAAK,EAAM,EAAK,GAErB,GAAI,GAAM,EACV,EAAM,EACN,EAAS,EAGX,MAAO,GAIT,GAAI,GAAO,SAAU,EAAK,EAAM,EAAK,EAAQ,CAC3C,GAAI,GAAM,EAAI,OACV,EAAI,EAEJ,EAAM,EAAM,EAEZ,EAAG,EAAG,EAEN,EAAI,EAGR,IAAK,EAAI,EAAG,EAAI,EAAK,GAAK,EASxB,IARA,EAAI,EAAI,EACR,EAAI,EAAI,EACJ,EAAI,GAAK,GAAI,GACb,EAAI,GAAK,GAAI,GAGjB,EAAK,EACL,EAAK,IAGH,GAAI,EAAK,GAAK,EAAK,EAGjB,AAAI,EAAK,EAAI,GAAK,EAAI,KAAQ,EAC5B,EAAO,KAAO,EAAI,KAGlB,EAAO,KAAO,EAAI,aAIb,EAAK,EACZ,EAAO,KAAO,EAAI,aAEX,EAAK,EACZ,EAAO,KAAO,EAAI,SAIlB,QAMR,MAAO,OC1GT,gCAQA,YAAkB,EAAG,EAAG,CACtB,OAAS,GAAI,EAAG,EAAI,EAAE,WAAY,IAAK,CACrC,GAAI,EAAE,GAAK,EAAE,GACX,MAAO,GAGT,GAAI,EAAE,GAAK,EAAE,GACX,MAAO,GAIX,MAAI,GAAE,WAAa,EAAE,WACZ,EAGL,EAAE,WAAa,EAAE,WACZ,GAGF,EAGT,GAAO,QAAU,KC9BjB,gCAEA,GAAM,IAAO,KACP,GAAoB,KAWpB,GAAW,CAAC,EAAG,IAAM,CACzB,GAAM,GAAO,EAAE,aACT,EAAO,EAAE,aAEf,MAAO,IAAkB,EAAM,IAS3B,GAAY,AAAC,GAAU,CAC3B,GAAK,QAAQ,EAAO,KAGtB,GAAO,QAAU,KC/BjB,gCAEA,GAAM,IAAU,KAKhB,YAA0C,EAAM,CAC9C,MAAO,IAAI,IACT,EAAK,MAAQ,EAAK,MAAQ,GAC1B,EAAK,OAAS,EAAK,MAAQ,EAAK,MAAQ,EACxC,EAAK,MAAQ,EAAK,MAAQ,EAAK,WAAa,EAAK,KAIrD,GAAO,QAAU,CACf,sCChBF,gCAEA,GAAM,IAAW,KACX,CACJ,WACE,KAEE,CACJ,oCACE,KAaE,GAAa,AAAC,GAAS,CAC3B,GAAM,GAAM,GAEZ,MAAI,GAAK,MAAQ,EAAK,KAAK,WAAa,EACtC,EAAI,KAAO,EAAK,KAIhB,EAAI,KAAO,KAGb,AAAI,EAAK,OAAS,EAAK,MAAM,OAAS,EACpC,EAAI,MAAQ,EAAK,MACd,IAAI,AAAC,GAAU,EACd,KAAM,EAAK,KAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,SAGhB,EAAI,MAAQ,KAGP,GAQH,GAAmB,AAAC,GACjB,GAAO,GAAW,IASrB,GAAuB,CAAC,EAAM,EAAQ,KAAO,CACjD,GAAM,GAAO,CACX,KAAM,EACN,MAAO,EAAM,IAAI,AAAC,GACT,GAAgC,KAI3C,MAAO,IAAO,GAAW,KAG3B,GAAO,QAAU,CACf,oBACA,yBAWF,YAAiB,EAAK,CACpB,GAAM,GAAS,GAAS,OAAO,SAE/B,GAAI,EAAI,OAAS,KACf,OAAS,GAAI,EAAG,EAAI,EAAI,MAAM,OAAQ,IACpC,GAAO,OAAO,EAAI,MAAM,GAAI,EAAO,OAAO,IAAI,QAAQ,SAI1D,MAAI,GAAI,MAAQ,MACd,EAAO,OAAO,IAAI,MAAM,EAAI,MAGvB,EAAO,YCnGhB,gCAcA,YAAgB,EAAK,EAAO,CACxB,OAAW,KAAO,GACd,OAAO,eAAe,EAAK,EAAK,CAC5B,MAAO,EAAM,GACb,WAAY,GACZ,aAAc,KAItB,MAAO,GAUX,YAAqB,EAAK,EAAM,EAAO,CACnC,GAAI,CAAC,GAAO,MAAO,IAAQ,SACvB,KAAM,IAAI,WAAU,oCAGxB,AAAK,GACD,GAAQ,IAGR,MAAO,IAAS,UAChB,GAAQ,EACR,EAAO,IAGP,GACA,GAAM,KAAO,GAGjB,GAAI,CACA,MAAO,IAAO,EAAK,SACd,EAAP,CACE,EAAM,QAAU,EAAI,QACpB,EAAM,MAAQ,EAAI,MAElB,GAAM,GAAW,UAAY,GAE7B,SAAS,UAAY,OAAO,OAAO,OAAO,eAAe,IAG1C,GAAO,GAAI,GAAY,IAM9C,GAAO,QAAU,KCpEjB,mBASA,AAAC,WAAY,CACX,aAEA,GAAI,GAAc,wBACd,EAAiB,0BACjB,EAAS,MAAO,SAAW,SAC3B,EAAO,EAAS,OAAS,GAC7B,AAAI,EAAK,mBACP,GAAS,IAEX,GAAI,GAAa,CAAC,GAAU,MAAO,OAAS,SACxC,EAAU,CAAC,EAAK,oBAAsB,MAAO,UAAY,UAAY,QAAQ,UAAY,QAAQ,SAAS,KAC9G,AAAI,EACF,EAAO,OACE,GACT,GAAO,MAET,GAAI,GAAY,CAAC,EAAK,sBAAwB,MAAO,KAAW,UAAY,GAAO,QAC/E,EAAM,MAAO,SAAW,YAAc,OAAO,IAC7C,EAAe,CAAC,EAAK,yBAA2B,MAAO,cAAgB,YACvE,EAAY,mBAAmB,MAAM,IACrC,EAAgB,CAAC,GAAI,KAAM,QAAS,WACpC,EAAiB,CAAC,EAAG,KAAM,OAAQ,UACnC,EAAiB,CAAC,EAAG,IAAK,MAAO,UACjC,EAAU,CAAC,EAAG,KAAM,OAAQ,WAC5B,EAAQ,CAAC,EAAG,EAAG,GAAI,IACnB,EAAK,CAAC,EAAG,EAAG,MAAO,EAAG,MAAO,WAAY,WAAY,WAAY,MAAO,EAAG,WAC7E,EAAG,WAAY,WAAY,MAAO,WAAY,IAAK,EAAG,IAAK,EAAG,WAAY,EAC1E,WAAY,EAAG,WAAY,EAAG,IAAK,WAAY,MAAO,WAAY,MAClE,WAAY,MAAO,WAAY,IAAK,WAAY,MAAO,EAAG,WAAY,WACtE,WAAY,WAAY,MAAO,WAAY,WAAY,EAAG,WAAY,YACpE,GAAO,CAAC,IAAK,IAAK,IAAK,KACvB,EAAa,CAAC,IAAK,KACnB,GAAe,CAAC,MAAO,SAAU,cAAe,QAAS,UACzD,EAAiB,CACnB,MAAO,IACP,MAAO,KAGT,AAAI,GAAK,oBAAsB,CAAC,MAAM,UACpC,OAAM,QAAU,SAAU,EAAK,CAC7B,MAAO,QAAO,UAAU,SAAS,KAAK,KAAS,mBAI/C,GAAiB,GAAK,iCAAmC,CAAC,YAAY,SACxE,aAAY,OAAS,SAAU,EAAK,CAClC,MAAO,OAAO,IAAQ,UAAY,EAAI,QAAU,EAAI,OAAO,cAAgB,cAgG/E,OA5FI,IAAqB,SAAU,EAAM,GAAS,GAAY,CAC5D,MAAO,UAAU,GAAS,CACxB,MAAO,IAAI,IAAO,EAAM,GAAS,GAAM,OAAO,IAAS,QAIvD,GAA0B,SAAU,EAAM,GAAS,GAAY,CACjE,MAAO,UAAU,GAAS,GAAY,CACpC,MAAO,IAAI,IAAO,EAAM,GAAS,IAAY,OAAO,IAAS,QAI7D,EAA2B,SAAU,EAAM,GAAS,GAAY,CAClE,MAAO,UAAU,GAAS,GAAY,GAAG,GAAG,CAC1C,MAAO,IAAQ,SAAW,GAAM,OAAO,GAAS,GAAY,GAAG,IAAG,QAIlE,GAAyB,SAAU,EAAM,GAAS,GAAY,CAChE,MAAO,UAAU,GAAK,GAAS,GAAY,GAAG,CAC5C,MAAO,IAAQ,OAAS,GAAM,OAAO,GAAK,GAAS,GAAY,IAAG,QAIlE,GAAsB,SAAU,EAAQ,GAAc,GAAM,GAAS,CACvE,OAAS,IAAI,EAAG,GAAI,GAAa,OAAQ,EAAE,GAAG,CAC5C,GAAI,IAAO,GAAa,IACxB,EAAO,IAAQ,GAAa,GAAM,GAAS,IAE7C,MAAO,IAGL,GAAe,SAAU,EAAM,GAAS,CAC1C,GAAI,IAAS,GAAmB,EAAM,GAAS,OAC/C,UAAO,OAAS,UAAY,CAC1B,MAAO,IAAI,IAAO,EAAM,GAAS,IAEnC,GAAO,OAAS,SAAU,GAAS,CACjC,MAAO,IAAO,SAAS,OAAO,KAEzB,GAAoB,GAAQ,GAAoB,EAAM,KAG3D,GAAoB,SAAU,EAAM,GAAS,CAC/C,GAAI,IAAS,GAAwB,EAAM,GAAS,OACpD,UAAO,OAAS,SAAU,GAAY,CACpC,MAAO,IAAI,IAAO,EAAM,GAAS,KAEnC,GAAO,OAAS,SAAU,GAAS,GAAY,CAC7C,MAAO,IAAO,OAAO,IAAY,OAAO,KAEnC,GAAoB,GAAQ,GAAyB,EAAM,KAGhE,GAAqB,SAAU,EAAM,GAAS,CAChD,GAAI,IAAI,EAAe,GACnB,GAAS,EAAyB,EAAM,GAAS,OACrD,UAAO,OAAS,SAAU,GAAY,GAAG,GAAG,CAC1C,MAAI,CAAC,IAAK,CAAC,GACF,GAAQ,QAAU,GAAM,OAAO,IAE/B,GAAI,IAAO,EAAM,GAAS,IAAY,QAAQ,CAAC,GAAG,IAAI,KAGjE,GAAO,OAAS,SAAU,GAAS,GAAY,GAAG,GAAG,CACnD,MAAO,IAAO,OAAO,GAAY,GAAG,IAAG,OAAO,KAEzC,GAAoB,GAAQ,EAA0B,EAAM,KAGjE,GAAmB,SAAU,EAAM,GAAS,CAC9C,GAAI,IAAI,EAAe,GACnB,GAAS,GAAuB,EAAM,GAAS,OACnD,UAAO,OAAS,SAAU,GAAK,GAAY,GAAG,CAC5C,MAAO,IAAI,IAAK,EAAM,GAAS,IAAY,QAAQ,CAAC,OAAQ,IAAI,IAAG,QAAQ,CAAC,IAAM,KAEpF,GAAO,OAAS,SAAU,GAAK,GAAS,GAAY,GAAG,CACrD,MAAO,IAAO,OAAO,GAAK,GAAY,IAAG,OAAO,KAE3C,GAAoB,GAAQ,GAAwB,EAAM,KAG/D,GAAa,CACf,CAAE,KAAM,SAAU,QAAS,EAAgB,KAAM,GAAM,aAAc,IACrE,CAAE,KAAM,OAAQ,QAAS,EAAS,KAAM,GAAM,aAAc,IAC5D,CAAE,KAAM,QAAS,QAAS,EAAe,KAAM,EAAY,aAAc,IACzE,CAAE,KAAM,SAAU,QAAS,EAAgB,KAAM,EAAY,aAAc,IAC3E,CAAE,KAAM,OAAQ,QAAS,EAAgB,KAAM,EAAY,aAAc,KAGvE,GAAU,GAAI,GAAc,GAEvB,GAAI,EAAG,GAAI,GAAW,OAAQ,EAAE,GAGvC,OAFI,IAAY,GAAW,IACvB,GAAO,GAAU,KACZ,GAAI,EAAG,GAAI,GAAK,OAAQ,EAAE,GAAG,CACpC,GAAI,IAAa,GAAU,KAAO,IAAM,GAAK,IAG7C,GAFA,GAAY,KAAK,IACjB,GAAQ,IAAc,GAAU,aAAa,GAAK,IAAI,GAAU,SAC5D,GAAU,OAAS,OAAQ,CAC7B,GAAI,IAAgB,GAAU,KAAO,GAAK,IAC1C,GAAY,KAAK,IACjB,GAAQ,IAAiB,GAAQ,KAKvC,YAAgB,EAAM,GAAS,GAAY,CACzC,KAAK,OAAS,GACd,KAAK,EAAI,GACT,KAAK,QAAU,GACf,KAAK,WAAa,GAClB,KAAK,MAAQ,GACb,KAAK,UAAY,GACjB,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,WAAc,KAAQ,IAAQ,IAAO,EAC1C,KAAK,UAAY,KAAK,YAAc,EACpC,KAAK,aAAe,IAAc,EAClC,KAAK,WAAc,IAAa,KAAO,EAEvC,OAAS,IAAI,EAAG,GAAI,GAAI,EAAE,GACxB,KAAK,EAAE,IAAK,EAIhB,GAAO,UAAU,OAAS,SAAU,EAAS,CAC3C,GAAI,KAAK,UACP,KAAM,IAAI,OAAM,GAElB,GAAI,IAAW,GAAO,MAAO,GAC7B,GAAI,KAAS,SAAU,CACrB,GAAI,KAAS,SAAU,CACrB,GAAI,IAAY,KACd,KAAM,IAAI,OAAM,GACX,GAAI,GAAgB,EAAQ,cAAgB,YACjD,EAAU,GAAI,YAAW,WAChB,CAAC,MAAM,QAAQ,IACpB,EAAC,GAAgB,CAAC,YAAY,OAAO,IACvC,KAAM,IAAI,OAAM,OAIpB,MAAM,IAAI,OAAM,GAElB,GAAY,GAKd,OAHI,IAAS,KAAK,OAAQ,GAAY,KAAK,UAAW,GAAS,EAAQ,OACrE,GAAa,KAAK,WAAY,GAAQ,EAAG,GAAI,KAAK,EAAG,GAAG,GAEnD,GAAQ,IAAQ,CACrB,GAAI,KAAK,MAGP,IAFA,KAAK,MAAQ,GACb,GAAO,GAAK,KAAK,MACZ,GAAI,EAAG,GAAI,GAAa,EAAG,EAAE,GAChC,GAAO,IAAK,EAGhB,GAAI,GACF,IAAK,GAAI,KAAK,MAAO,GAAQ,IAAU,GAAI,GAAW,EAAE,GACtD,GAAO,IAAK,IAAM,EAAQ,KAAU,EAAM,KAAM,OAGlD,KAAK,GAAI,KAAK,MAAO,GAAQ,IAAU,GAAI,GAAW,EAAE,GACtD,GAAO,EAAQ,WAAW,IAC1B,AAAI,GAAO,IACT,GAAO,IAAK,IAAM,IAAQ,EAAM,KAAM,GACjC,AAAI,GAAO,KAChB,IAAO,IAAK,IAAO,KAAQ,IAAQ,IAAO,EAAM,KAAM,GACtD,GAAO,IAAK,IAAO,KAAQ,GAAO,KAAU,EAAM,KAAM,IACnD,AAAI,GAAO,OAAU,IAAQ,MAClC,IAAO,IAAK,IAAO,KAAQ,IAAQ,KAAQ,EAAM,KAAM,GACvD,GAAO,IAAK,IAAO,KAAS,IAAQ,EAAK,KAAU,EAAM,KAAM,GAC/D,GAAO,IAAK,IAAO,KAAQ,GAAO,KAAU,EAAM,KAAM,IAExD,IAAO,MAAa,KAAO,OAAU,GAAO,EAAQ,WAAW,EAAE,IAAS,MAC1E,GAAO,IAAK,IAAO,KAAQ,IAAQ,KAAQ,EAAM,KAAM,GACvD,GAAO,IAAK,IAAO,KAAS,IAAQ,GAAM,KAAU,EAAM,KAAM,GAChE,GAAO,IAAK,IAAO,KAAS,IAAQ,EAAK,KAAU,EAAM,KAAM,GAC/D,GAAO,IAAK,IAAO,KAAQ,GAAO,KAAU,EAAM,KAAM,IAK9D,GADA,KAAK,cAAgB,GACjB,IAAK,GAAW,CAGlB,IAFA,KAAK,MAAQ,GAAI,GACjB,KAAK,MAAQ,GAAO,IACf,GAAI,EAAG,GAAI,GAAY,EAAE,GAC5B,GAAE,KAAM,GAAO,IAEjB,GAAE,IACF,KAAK,MAAQ,OAEb,MAAK,MAAQ,GAGjB,MAAO,OAGT,GAAO,UAAU,OAAS,SAAU,EAAG,GAAO,CAC5C,GAAI,IAAI,EAAI,IAAK,GAAI,EACjB,GAAQ,CAAC,IAGb,IAFA,EAAI,GAAK,EACT,GAAI,EAAI,IACD,GAAI,GACT,GAAM,QAAQ,IACd,EAAI,GAAK,EACT,GAAI,EAAI,IACR,EAAE,GAEJ,MAAI,IACF,GAAM,KAAK,IAEX,GAAM,QAAQ,IAEhB,KAAK,OAAO,IACL,GAAM,QAGf,GAAO,UAAU,aAAe,SAAU,EAAK,CAC7C,GAAI,IAAW,GAAO,MAAO,GAC7B,GAAI,KAAS,SAAU,CACrB,GAAI,KAAS,SAAU,CACrB,GAAI,IAAQ,KACV,KAAM,IAAI,OAAM,GACX,GAAI,GAAgB,EAAI,cAAgB,YAC7C,EAAM,GAAI,YAAW,WACZ,CAAC,MAAM,QAAQ,IACpB,EAAC,GAAgB,CAAC,YAAY,OAAO,IACvC,KAAM,IAAI,OAAM,OAIpB,MAAM,IAAI,OAAM,GAElB,GAAY,GAEd,GAAI,IAAQ,EAAG,GAAS,EAAI,OAC5B,GAAI,GACF,GAAQ,OAER,QAAS,IAAI,EAAG,GAAI,EAAI,OAAQ,EAAE,GAAG,CACnC,GAAI,IAAO,EAAI,WAAW,IAC1B,AAAI,GAAO,IACT,IAAS,EACJ,AAAI,GAAO,KAChB,IAAS,EACJ,AAAI,GAAO,OAAU,IAAQ,MAClC,IAAS,EAET,IAAO,MAAa,KAAO,OAAU,GAAO,EAAI,WAAW,EAAE,IAAK,MAClE,IAAS,GAIf,WAAS,KAAK,OAAO,GAAQ,GAC7B,KAAK,OAAO,GACL,IAGT,GAAO,UAAU,QAAU,SAAU,EAAM,GAAG,CAE5C,OADI,IAAQ,KAAK,OAAO,IACf,GAAI,EAAG,GAAI,EAAK,OAAQ,EAAE,GACjC,IAAS,KAAK,aAAa,EAAK,KAElC,GAAI,IAAe,GAAI,GAAQ,GAC3B,GAAQ,GACZ,UAAM,OAAS,GACf,KAAK,OAAO,IACL,MAGT,GAAO,UAAU,SAAW,UAAY,CACtC,GAAI,MAAK,UAGT,MAAK,UAAY,GACjB,GAAI,GAAS,KAAK,OAAQ,GAAI,KAAK,cAAe,GAAa,KAAK,WAAY,GAAI,KAAK,EAEzF,GADA,EAAO,IAAK,IAAM,KAAK,QAAQ,GAAI,GAC/B,KAAK,gBAAkB,KAAK,UAE9B,IADA,EAAO,GAAK,EAAO,IACd,GAAI,EAAG,GAAI,GAAa,EAAG,EAAE,GAChC,EAAO,IAAK,EAIhB,IADA,EAAO,GAAa,IAAM,WACrB,GAAI,EAAG,GAAI,GAAY,EAAE,GAC5B,GAAE,KAAM,EAAO,IAEjB,GAAE,MAGJ,GAAO,UAAU,SAAW,GAAO,UAAU,IAAM,UAAY,CAC7D,KAAK,WAKL,OAHI,GAAa,KAAK,WAAY,GAAI,KAAK,EAAG,GAAe,KAAK,aAChE,GAAa,KAAK,WAAY,GAAI,EAAG,GAAI,EACvC,GAAM,GAAI,GACP,GAAI,IAAc,CACvB,IAAK,GAAI,EAAG,GAAI,GAAc,GAAI,GAAc,EAAE,GAAG,EAAE,GACrD,GAAQ,GAAE,IACV,IAAO,EAAW,IAAS,EAAK,IAAQ,EAAU,GAAQ,IACxD,EAAW,IAAS,GAAM,IAAQ,EAAW,IAAS,EAAK,IAC3D,EAAW,IAAS,GAAM,IAAQ,EAAW,IAAS,GAAM,IAC5D,EAAW,IAAS,GAAM,IAAQ,EAAW,IAAS,GAAM,IAEhE,AAAI,GAAI,GAAe,GACrB,IAAE,IACF,GAAI,GAGR,MAAI,KACF,IAAQ,GAAE,IACV,IAAO,EAAW,IAAS,EAAK,IAAQ,EAAU,GAAQ,IACtD,GAAa,GACf,KAAO,EAAW,IAAS,GAAM,IAAQ,EAAW,IAAS,EAAK,KAEhE,GAAa,GACf,KAAO,EAAW,IAAS,GAAM,IAAQ,EAAW,IAAS,GAAM,MAGhE,IAGT,GAAO,UAAU,YAAc,UAAY,CACzC,KAAK,WAEL,GAAI,GAAa,KAAK,WAAY,GAAI,KAAK,EAAG,GAAe,KAAK,aAChE,GAAa,KAAK,WAAY,GAAI,EAAG,GAAI,EACvC,GAAQ,KAAK,YAAc,EAC3B,GACJ,AAAI,GACF,GAAS,GAAI,aAAa,GAAe,GAAM,GAE/C,GAAS,GAAI,aAAY,IAG3B,OADI,IAAQ,GAAI,aAAY,IACrB,GAAI,IAAc,CACvB,IAAK,GAAI,EAAG,GAAI,GAAc,GAAI,GAAc,EAAE,GAAG,EAAE,GACrD,GAAM,IAAK,GAAE,IAEf,AAAI,GAAI,GAAe,GACrB,GAAE,IAGN,MAAI,KACF,IAAM,IAAK,GAAE,IACb,GAAS,GAAO,MAAM,EAAG,KAEpB,IAGT,GAAO,UAAU,OAAS,GAAO,UAAU,YAE3C,GAAO,UAAU,OAAS,GAAO,UAAU,MAAQ,UAAY,CAC7D,KAAK,WAKL,OAHI,GAAa,KAAK,WAAY,GAAI,KAAK,EAAG,GAAe,KAAK,aAChE,GAAa,KAAK,WAAY,GAAI,EAAG,GAAI,EACvC,GAAQ,GAAI,GAAQ,GACjB,GAAI,IAAc,CACvB,IAAK,GAAI,EAAG,GAAI,GAAc,GAAI,GAAc,EAAE,GAAG,EAAE,GACrD,GAAS,IAAK,EACd,GAAQ,GAAE,IACV,GAAM,IAAU,GAAQ,IACxB,GAAM,GAAS,GAAM,IAAS,EAAK,IACnC,GAAM,GAAS,GAAM,IAAS,GAAM,IACpC,GAAM,GAAS,GAAM,IAAS,GAAM,IAEtC,AAAI,GAAI,GAAe,GACrB,GAAE,IAGN,MAAI,KACF,IAAS,IAAK,EACd,GAAQ,GAAE,IACV,GAAM,IAAU,GAAQ,IACpB,GAAa,GACf,IAAM,GAAS,GAAM,IAAS,EAAK,KAEjC,GAAa,GACf,IAAM,GAAS,GAAM,IAAS,GAAM,MAGjC,IAGT,YAAc,EAAM,GAAS,GAAY,CACvC,GAAO,KAAK,KAAM,EAAM,GAAS,IAGnC,GAAK,UAAY,GAAI,IAErB,GAAK,UAAU,SAAW,UAAY,CACpC,YAAK,OAAO,KAAK,WAAY,IACtB,GAAO,UAAU,SAAS,KAAK,OAGxC,GAAI,IAAI,SAAU,EAAG,CACnB,GAAI,IAAG,GAAG,GAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC/C,GAAI,GAAI,GAAI,GAAI,GAAI,EAAI,GAAI,GAAI,GAAI,GAAI,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAC3E,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAC3E,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAC7E,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,EACvB,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IACtC,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IAEtC,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,EAAE,IAAM,GACR,EAAE,IAAM,GACR,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,EAAE,IAAM,GACR,EAAE,IAAM,GACR,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,EAAE,IAAM,GACR,EAAE,IAAM,GACR,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,EAAE,IAAM,GACR,EAAE,IAAM,GACR,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,GAAI,GAAO,KAAM,EAAM,KAAO,IAC9B,EAAE,IAAM,GACR,EAAE,IAAM,GACR,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GACT,EAAE,KAAO,GAET,GAAK,EAAE,GACP,GAAK,EAAE,GACP,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,IAAM,EAAM,EAAE,KAAO,GAC9B,GAAO,EAAE,IAAM,EAAM,EAAE,KAAO,GAC9B,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,IAAM,GAAO,EAAE,KAAO,EAC/B,GAAO,EAAE,IAAM,GAAO,EAAE,KAAO,EAC/B,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,EAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,IAAM,GAAO,EAAE,KAAO,EAC/B,GAAO,EAAE,IAAM,GAAO,EAAE,KAAO,EAC/B,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,EACjC,GAAO,EAAE,IAAM,GAAO,EAAE,KAAO,EAC/B,GAAO,EAAE,IAAM,GAAO,EAAE,KAAO,EAC/B,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,GAAO,EAAE,MAAQ,GACjC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAO,EAAE,KAAO,EAAM,EAAE,MAAQ,GAChC,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAChC,GAAM,EAAE,KAAO,GAAO,EAAE,MAAQ,GAEhC,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,GAAK,GAAM,CAAC,GAAK,EACnB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,GAAK,GAAM,CAAC,EAAK,GACnB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,GAAK,EAAM,CAAC,GAAK,GACnB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,GAAK,GAAM,CAAC,GAAK,GACnB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GACtB,EAAE,IAAM,GAAO,CAAC,GAAM,GAEtB,EAAE,IAAM,EAAG,IACX,EAAE,IAAM,EAAG,GAAI,IAInB,GAAI,EACF,GAAO,QAAU,OACZ,CACL,IAAK,GAAI,EAAG,GAAI,GAAY,OAAQ,EAAE,GACpC,EAAK,GAAY,KAAM,GAAQ,GAAY,KAE7C,AAAI,GACF,OAAO,UAAY,CACjB,MAAO,aC3oBf,mBAUC,AAAC,UAAU,EAAM,EAAW,CACzB,aAGA,GAAI,GAAU,CACV,QAAW,QACX,IAAO,GACP,IAAO,GACP,gBAAmB,IAMvB,WAAqB,EAAO,CAExB,GAAI,CAAC,MAAM,QAAQ,IAAU,CAAC,YAAY,OAAO,GAC7C,MAAO,GAIX,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAC9B,GAAI,CAAC,OAAO,UAAU,EAAM,KAAO,EAAM,GAAK,GAAK,EAAM,GAAK,IAC1D,MAAO,GAGf,MAAO,GAGX,WAAsB,EAAG,EAAG,CAMxB,MAAS,GAAI,OAAU,EAAS,OAAM,IAAM,EAAK,QAAW,IAGhE,WAAkB,EAAG,EAAG,CAMpB,MAAQ,IAAK,EAAM,IAAO,GAAK,EAGnC,WAAkB,EAAG,CAKjB,UAAK,IAAM,GACX,EAAI,EAAa,EAAG,YACpB,GAAK,IAAM,GACX,EAAI,EAAa,EAAG,YACpB,GAAK,IAAM,GAEJ,EAGX,WAAiB,EAAG,EAAG,CAMnB,EAAI,CAAC,EAAE,KAAO,GAAI,EAAE,GAAK,MAAQ,EAAE,KAAO,GAAI,EAAE,GAAK,OACrD,EAAI,CAAC,EAAE,KAAO,GAAI,EAAE,GAAK,MAAQ,EAAE,KAAO,GAAI,EAAE,GAAK,OACrD,GAAI,GAAI,CAAC,EAAG,EAAG,EAAG,GAElB,SAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,MAED,CAAE,EAAE,IAAM,GAAM,EAAE,GAAK,EAAE,IAAM,GAAM,EAAE,IAGlD,WAAsB,EAAG,EAAG,CAMxB,EAAI,CAAC,EAAE,KAAO,GAAI,EAAE,GAAK,MAAQ,EAAE,KAAO,GAAI,EAAE,GAAK,OACrD,EAAI,CAAC,EAAE,KAAO,GAAI,EAAE,GAAK,MAAQ,EAAE,KAAO,GAAI,EAAE,GAAK,OACrD,GAAI,GAAI,CAAC,EAAG,EAAG,EAAG,GAElB,SAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAM,EAAE,GAAK,EAAE,GACjB,EAAE,IAAM,EAAE,KAAO,GACjB,EAAE,IAAM,MAER,EAAE,IAAO,EAAE,GAAK,EAAE,GAAO,EAAE,GAAK,EAAE,GAAO,EAAE,GAAK,EAAE,GAAO,EAAE,GAAK,EAAE,GAClE,EAAE,IAAM,MAED,CAAE,EAAE,IAAM,GAAM,EAAE,GAAK,EAAE,IAAM,GAAM,EAAE,IAGlD,WAAkB,EAAG,EAAG,CASpB,MAFA,IAAK,GAED,IAAM,GACC,CAAC,EAAE,GAAI,EAAE,IACT,EAAI,GACJ,CAAE,EAAE,IAAM,EAAM,EAAE,KAAQ,GAAK,EAAM,EAAE,IAAM,EAAM,EAAE,KAAQ,GAAK,GAEzE,IAAK,GACE,CAAE,EAAE,IAAM,EAAM,EAAE,KAAQ,GAAK,EAAM,EAAE,IAAM,EAAM,EAAE,KAAQ,GAAK,IAIjF,WAAuB,EAAG,EAAG,CASzB,MAFA,IAAK,GAED,IAAM,EACC,EACA,EAAI,GACJ,CAAE,EAAE,IAAM,EAAM,EAAE,KAAQ,GAAK,EAAK,EAAE,IAAM,GAE5C,CAAC,EAAE,IAAO,EAAI,GAAK,GAIlC,WAAiB,EAAG,EAAG,CAMnB,MAAO,CAAC,EAAE,GAAK,EAAE,GAAI,EAAE,GAAK,EAAE,IAGlC,WAAkB,EAAG,CAOjB,SAAI,EAAQ,EAAG,CAAC,EAAG,EAAE,KAAO,IAC5B,EAAI,EAAa,EAAG,CAAC,WAAY,aACjC,EAAI,EAAQ,EAAG,CAAC,EAAG,EAAE,KAAO,IAC5B,EAAI,EAAa,EAAG,CAAC,WAAY,YACjC,EAAI,EAAQ,EAAG,CAAC,EAAG,EAAE,KAAO,IAErB,EAMX,EAAQ,IAAI,OAAS,SAAU,EAAO,EAAM,CAKxC,GAAI,EAAQ,iBAAmB,CAAC,EAAY,GACxC,MAAO,GAEX,EAAO,GAAQ,EAYf,OAVI,GAAY,EAAM,OAAS,EAC3B,GAAS,EAAM,OAAS,EAExB,EAAK,EAEL,GAAK,EAEL,EAAK,WACL,GAAK,UAEA,GAAI,EAAG,GAAI,GAAQ,GAAI,GAAI,EAChC,GAAM,EAAM,IAAO,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,IAAM,GAAO,EAAM,GAAI,IAAM,GAEhF,GAAK,EAAa,GAAI,GACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IAEtB,GAAM,GACN,EAAK,EAAS,EAAI,IAClB,EAAK,EAAa,EAAI,GAAK,WAK/B,OAFA,GAAK,EAEG,OACC,GACD,IAAM,EAAM,GAAI,IAAM,OAErB,GACD,IAAM,EAAM,GAAI,IAAM,MAErB,GACD,IAAM,EAAM,IACZ,GAAK,EAAa,GAAI,GACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAM,GAGd,UAAM,EAAM,OACZ,EAAK,EAAS,GAEP,IAAO,GAGlB,EAAQ,IAAI,QAAU,SAAU,EAAO,EAAM,CAKzC,GAAI,EAAQ,iBAAmB,CAAC,EAAY,GACxC,MAAO,GAGX,EAAO,GAAQ,EAmBf,OAlBI,GAAY,EAAM,OAAS,GAC3B,GAAS,EAAM,OAAS,EAExB,EAAK,EACL,GAAK,EACL,EAAK,EACL,GAAK,EAEL,GAAK,EACL,EAAK,EACL,GAAK,EACL,GAAK,EAEL,GAAK,UACL,GAAK,WACL,GAAK,UACL,GAAK,WAEA,GAAI,EAAG,GAAI,GAAQ,GAAI,GAAI,GAChC,GAAM,EAAM,IAAO,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,IAAM,GAAO,EAAM,GAAI,IAAM,GAChF,EAAM,EAAM,GAAI,GAAO,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,IAAM,GAAO,EAAM,GAAI,IAAM,GACpF,GAAM,EAAM,GAAI,GAAO,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,KAAO,GAAO,EAAM,GAAI,KAAO,GACtF,GAAM,EAAM,GAAI,IAAQ,EAAM,GAAI,KAAO,EAAM,EAAM,GAAI,KAAO,GAAO,EAAM,GAAI,KAAO,GAExF,GAAK,EAAa,GAAI,IACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAM,GAEN,EAAK,EAAS,EAAI,IAClB,GAAM,GACN,EAAK,EAAa,EAAI,GAAK,WAE3B,EAAK,EAAa,EAAI,IACtB,EAAK,EAAS,EAAI,IAClB,EAAK,EAAa,EAAI,IACtB,IAAM,EAEN,GAAK,EAAS,GAAI,IAClB,IAAM,EACN,GAAK,EAAa,GAAI,GAAK,UAE3B,GAAK,EAAa,GAAI,IACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAM,GAEN,EAAK,EAAS,EAAI,IAClB,GAAM,GACN,EAAK,EAAa,EAAI,GAAK,WAE3B,GAAK,EAAa,GAAI,IACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,IAAM,GAEN,GAAK,EAAS,GAAI,IAClB,IAAM,EACN,GAAK,EAAa,GAAI,GAAK,UAQ/B,OALA,GAAK,EACL,EAAK,EACL,GAAK,EACL,GAAK,EAEG,OACC,IACD,IAAM,EAAM,GAAI,KAAO,OAEtB,IACD,IAAM,EAAM,GAAI,KAAO,MAEtB,IACD,IAAM,EAAM,GAAI,IAChB,GAAK,EAAa,GAAI,IACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,IAAM,OAEL,IACD,IAAM,EAAM,GAAI,KAAO,OAEtB,IACD,IAAM,EAAM,GAAI,KAAO,OAEtB,IACD,IAAM,EAAM,GAAI,IAAM,MAErB,GACD,IAAM,EAAM,GAAI,GAChB,GAAK,EAAa,GAAI,IACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAM,OAEL,GACD,GAAM,EAAM,GAAI,IAAM,OAErB,GACD,GAAM,EAAM,GAAI,IAAM,OAErB,GACD,GAAM,EAAM,GAAI,IAAM,MAErB,GACD,GAAM,EAAM,GAAI,GAChB,EAAK,EAAa,EAAI,IACtB,EAAK,EAAS,EAAI,IAClB,EAAK,EAAa,EAAI,IACtB,IAAM,MAEL,GACD,IAAM,EAAM,GAAI,IAAM,OAErB,GACD,IAAM,EAAM,GAAI,IAAM,OAErB,GACD,IAAM,EAAM,GAAI,IAAM,MAErB,GACD,IAAM,EAAM,IACZ,GAAK,EAAa,GAAI,IACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAM,GAGd,UAAM,EAAM,OACZ,IAAM,EAAM,OACZ,GAAM,EAAM,OACZ,IAAM,EAAM,OAEZ,GAAM,GACN,GAAM,EACN,GAAM,GACN,IAAM,EACN,GAAM,EACN,IAAM,EAEN,EAAK,EAAS,GACd,GAAK,EAAS,IACd,EAAK,EAAS,GACd,GAAK,EAAS,IAEd,GAAM,GACN,GAAM,EACN,GAAM,GACN,IAAM,EACN,GAAM,EACN,IAAM,EAEE,YAAc,KAAO,GAAG,SAAS,KAAK,MAAM,IAAO,YAAc,MAAO,GAAG,SAAS,KAAK,MAAM,IAAO,YAAc,KAAO,GAAG,SAAS,KAAK,MAAM,IAAO,YAAc,MAAO,GAAG,SAAS,KAAK,MAAM,KAGjN,EAAQ,IAAI,QAAU,SAAU,EAAO,EAAM,CAKzC,GAAI,EAAQ,iBAAmB,CAAC,EAAY,GACxC,MAAO,GAEX,EAAO,GAAQ,EAcf,OAZI,GAAY,EAAM,OAAS,GAC3B,GAAS,EAAM,OAAS,EAExB,EAAK,CAAC,EAAG,GACT,GAAK,CAAC,EAAG,GAET,EAAK,CAAC,EAAG,GACT,GAAK,CAAC,EAAG,GAET,GAAK,CAAC,WAAY,WAClB,EAAK,CAAC,WAAY,WAEb,GAAI,EAAG,GAAI,GAAQ,GAAI,GAAI,GAChC,EAAK,CAAE,EAAM,GAAI,GAAO,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,IAAM,GAAO,EAAM,GAAI,IAAM,GAAM,EAAM,IAC5F,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,IAAM,GAAO,EAAM,GAAI,IAAM,IAClE,GAAK,CAAE,EAAM,GAAI,IAAQ,EAAM,GAAI,KAAO,EAAM,EAAM,GAAI,KAAO,GAAO,EAAM,GAAI,KAAO,GAAM,EAAM,GAAI,GACpG,EAAM,GAAI,IAAM,EAAM,EAAM,GAAI,KAAO,GAAO,EAAM,GAAI,KAAO,IAEpE,EAAK,EAAa,EAAI,IACtB,EAAK,EAAS,EAAI,IAClB,EAAK,EAAa,EAAI,GACtB,EAAK,EAAQ,EAAI,GAEjB,EAAK,EAAS,EAAI,IAClB,EAAK,EAAQ,EAAI,IACjB,EAAK,EAAQ,EAAa,EAAI,CAAC,EAAG,IAAK,CAAC,EAAG,aAE3C,GAAK,EAAa,GAAI,GACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAK,EAAQ,GAAI,IAEjB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAQ,GAAI,GACjB,GAAK,EAAQ,EAAa,GAAI,CAAC,EAAG,IAAK,CAAC,EAAG,YAM/C,OAHA,EAAK,CAAC,EAAG,GACT,GAAK,CAAC,EAAG,GAED,OACC,IACD,GAAK,EAAQ,GAAI,EAAc,CAAC,EAAG,EAAM,GAAI,KAAM,SAElD,IACD,GAAK,EAAQ,GAAI,EAAc,CAAC,EAAG,EAAM,GAAI,KAAM,SAElD,IACD,GAAK,EAAQ,GAAI,EAAc,CAAC,EAAG,EAAM,GAAI,KAAM,SAElD,IACD,GAAK,EAAQ,GAAI,EAAc,CAAC,EAAG,EAAM,GAAI,KAAM,SAElD,IACD,GAAK,EAAQ,GAAI,EAAc,CAAC,EAAG,EAAM,GAAI,KAAM,SAElD,IACD,GAAK,EAAQ,GAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,QAEjD,GACD,GAAK,EAAQ,GAAI,CAAC,EAAG,EAAM,GAAI,KAC/B,GAAK,EAAa,GAAI,GACtB,GAAK,EAAS,GAAI,IAClB,GAAK,EAAa,GAAI,IACtB,GAAK,EAAQ,GAAI,QAEhB,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,SAEjD,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,SAEjD,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,SAEjD,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,SAEjD,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,SAEjD,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,SAEjD,GACD,EAAK,EAAQ,EAAI,EAAc,CAAC,EAAG,EAAM,GAAI,IAAK,QAEjD,GACD,EAAK,EAAQ,EAAI,CAAC,EAAG,EAAM,MAC3B,EAAK,EAAa,EAAI,IACtB,EAAK,EAAS,EAAI,IAClB,EAAK,EAAa,EAAI,GACtB,EAAK,EAAQ,EAAI,GAGzB,SAAK,EAAQ,EAAI,CAAC,EAAG,EAAM,SAC3B,GAAK,EAAQ,GAAI,CAAC,EAAG,EAAM,SAE3B,EAAK,EAAQ,EAAI,IACjB,GAAK,EAAQ,GAAI,GAEjB,EAAK,EAAS,GACd,GAAK,EAAS,IAEd,EAAK,EAAQ,EAAI,IACjB,GAAK,EAAQ,GAAI,GAET,YAAc,GAAG,KAAO,GAAG,SAAS,KAAK,MAAM,IAAO,YAAc,GAAG,KAAO,GAAG,SAAS,KAAK,MAAM,IAAO,YAAc,IAAG,KAAO,GAAG,SAAS,KAAK,MAAM,IAAO,YAAc,IAAG,KAAO,GAAG,SAAS,KAAK,MAAM,KAQ7N,AAAI,MAAO,KAAY,YAEf,OAAO,KAAW,aAAe,GAAO,SACxC,IAAU,GAAO,QAAU,GAG/B,GAAQ,YAAc,GAEnB,AAAI,MAAO,SAAW,YAAc,OAAO,IAE9C,OAAO,GAAI,UAAY,CACnB,MAAO,KAOX,GAAQ,aAAe,EAAK,YAE5B,EAAQ,WAAa,UAAY,CAC7B,SAAK,YAAc,EAAQ,aAC3B,EAAQ,aAAe,EACvB,EAAQ,WAAa,EAEd,GAGX,EAAK,YAAc,KAExB,MCpkBH,sBAAO,QAAU,OCAjB,mBACA,aAEA,GAAM,IAAY,KASZ,GACJ,KAAK,QAGJ,KAAK,SAQF,GAAS,MAAO,EAAM,IAAQ,CAClC,GAAI,MAAO,OAAS,aAAe,CAAC,GAClC,KAAM,IAAI,OACR,6IAGJ,OAAQ,OACD,OACH,MAAO,IAAI,YAAW,KAAM,IAAO,OAAO,OAAO,CAAE,KAAM,SAAW,QACjE,WACH,MAAO,IAAI,YAAW,KAAM,IAAO,OAAO,OAAO,CAAE,KAAM,WAAa,QACnE,WACH,MAAO,IAAI,YAAW,KAAM,IAAO,OAAO,OAAO,CAAE,KAAM,WAAa,QACnE,eAAgB,CACnB,GAAM,GAAI,KAAM,IAAO,OAAO,OAAO,CAAE,KAAM,WAAa,GAC1D,MAAO,IAAI,YAAW,KAAM,IAAO,OAAO,OAAO,CAAE,KAAM,WAAa,YAGtE,KAAM,IAAI,OAAM,GAAG,oCAIzB,GAAO,QAAU,CAKf,QAAS,AAAC,GAAQ,KAAO,IAChB,GAAO,EAAM,GAEtB,UAMA,aAAc,MAAO,EAAK,EAAK,IAAW,CACxC,GAAM,GAAI,KAAM,IAAO,EAAK,GAC5B,MAAO,IAAU,OAAO,EAAG,EAAK,OC9DpC,gCAMA,GAAM,IAAuB,AAAC,GAAW,CACvC,GAAM,GAAQ,GAAI,YAAW,GAE7B,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,EAAM,GAAK,EAAS,IACpB,EAAS,GAAU,EAGrB,MAAO,IAGT,GAAO,QAAU,CACf,2BClBF,sBAAI,IAAkB,gDAGtB,YAAyB,EAAO,CAC9B,GAAI,GACJ,GAAI,YAAiB,YACnB,EAAM,UACG,YAAiB,QAC1B,EAAM,GAAI,YAAW,WACZ,MAAQ,IAAW,SAC5B,EAAM,GAAI,YAAW,OAAO,KAAK,EAAO,aAExC,MAAM,IAAI,OAAM,IAElB,MAAO,GAKT,YAAgB,EAAO,CACrB,MAAO,OAAM,UAAU,IAAI,KAAK,EAAO,SAAU,EAAG,CAClD,MAAQ,GAAI,GAAK,IAAM,IAAM,EAAE,SAAS,MACvC,KAAK,IAIV,YAAsB,EAAK,CACzB,MAAQ,YAAc,GAAK,SAAS,IAAI,UAAU,GAKpD,YAAqB,EAAO,EAAK,EAAM,CAErC,OADI,GAAM;AAAA,EAAO,EAAQ,MAChB,EAAI,EAAG,EAAI,EAAI,OAAQ,GAAK,EAAG,CACtC,GAAI,IAAS,GACX,GAAO,GAAY,EAAI,IAAI,cAC3B,GAAO,IACP,GAAO,GAAY,EAAI,EAAI,IAAI,sBACtB,IAAS,GAClB,GAAO,GAAY,EAAI,EAAI,IAAI,cAC/B,GAAO,GAAY,EAAI,IAAI,kBACtB,MAAM,IAAI,OAAM,gBAAkB,GACzC,AAAI,EAAI,GAAM,EACZ,GAAO;AAAA,EAAO,GAAI,OAAM,EAAM,OAAS,GAAG,KAAK,KACtC,EAAI,EAAI,OAAS,GAC1B,IAAO,KAGX,QAAQ,IAAI,GAKd,YAAoB,EAAQ,EAAG,EAAG,CAIhC,OAHI,GAAU,GAAI,QAAO,UAErB,EAAQ,GAAI,YAAW,GAClB,EAAI,EAAG,EAAI,EAAG,IACrB,EAAM,GAAK,EAAI,IAEjB,GAAI,GAAQ,GAAI,QAAO,UAIvB,IAHA,QAAQ,IAAI,6BAAgC,GAAQ,GAAW,MAC/D,EAAU,EAEL,EAAI,EAAG,EAAI,EAAG,IAAK,CACtB,GAAI,GAAU,EAAO,GACjB,EAAS,GAAI,QAAO,UACpB,EAAK,EAAS,EAClB,EAAU,EACV,QAAQ,IAAI,aAAe,EAAK,OAAS,EAAQ,UAAU,EAAG,IAAM,OACpE,QAAQ,IAAI,KAAK,MAAM,EAAK,IAAK,IAAO,GAAK,KAAQ,KAAO,IAAM,mBAItE,GAAO,QAAU,CACf,eAAgB,GAChB,MAAO,GACP,WAAY,GACZ,UAAW,MC/Eb,mBAIA,GAAI,IAAO,KAKX,YAAkB,EAAG,EAAG,EAAG,CACzB,GAAI,GAAK,EAAE,GAAK,EAAE,GACd,EAAK,EAAE,EAAI,GAAK,EAAE,EAAI,GAC1B,AAAI,GAAM,YACR,IAEF,EAAE,GAAK,EACP,EAAE,EAAI,GAAK,EAMb,YAAkB,EAAG,EAAG,EAAI,EAAI,CAC9B,GAAI,GAAK,EAAE,GAAK,EAChB,AAAI,EAAK,GACP,IAAM,YAER,GAAI,GAAK,EAAE,EAAI,GAAK,EACpB,AAAI,GAAM,YACR,IAEF,EAAE,GAAK,EACP,EAAE,EAAI,GAAK,EAIb,YAAoB,EAAK,EAAG,CAC1B,MAAQ,GAAI,GACX,EAAI,EAAI,IAAM,EACd,EAAI,EAAI,IAAM,GACd,EAAI,EAAI,IAAM,GAKjB,YAAgB,EAAG,EAAG,EAAG,EAAG,EAAI,EAAI,CAClC,GAAI,GAAK,GAAE,GACP,EAAK,GAAE,EAAK,GACZ,EAAK,GAAE,GACP,EAAK,GAAE,EAAK,GAEhB,GAAQ,GAAG,EAAG,GACd,GAAQ,GAAG,EAAG,EAAI,GAGlB,GAAI,GAAO,GAAE,GAAK,GAAE,GAChB,EAAO,GAAE,EAAI,GAAK,GAAE,EAAI,GAC5B,GAAE,GAAK,EACP,GAAE,EAAI,GAAK,EAEX,GAAQ,GAAG,EAAG,GAGd,EAAO,GAAE,GAAK,GAAE,GAChB,EAAO,GAAE,EAAI,GAAK,GAAE,EAAI,GACxB,GAAE,GAAM,IAAS,GAAO,GAAQ,EAChC,GAAE,EAAI,GAAM,IAAS,GAAO,GAAQ,EAEpC,GAAQ,GAAG,EAAG,GACd,GAAQ,GAAG,EAAG,EAAI,GAGlB,EAAO,GAAE,GAAK,GAAE,GAChB,EAAO,GAAE,EAAI,GAAK,GAAE,EAAI,GACxB,GAAE,GAAM,IAAS,GAAO,GAAQ,GAChC,GAAE,EAAI,GAAM,IAAS,GAAO,GAAQ,GAEpC,GAAQ,GAAG,EAAG,GAGd,EAAO,GAAE,GAAK,GAAE,GAChB,EAAO,GAAE,EAAI,GAAK,GAAE,EAAI,GACxB,GAAE,GAAM,IAAS,GAAO,GAAQ,EAChC,GAAE,EAAI,GAAM,IAAS,GAAO,GAAQ,EAItC,GAAI,IAAe,GAAI,aAAY,CACjC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,UAAY,UAAY,aAGlC,GAAS,CACX,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EACnD,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EACnD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAClD,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAMjD,GAAU,GAAI,YAAW,GAAO,IAAI,SAAU,EAAG,CAAE,MAAO,GAAI,KAI9D,GAAI,GAAI,aAAY,IACpB,GAAI,GAAI,aAAY,IACxB,YAA0B,EAAK,EAAM,CACnC,GAAI,GAAI,EAGR,IAAK,EAAI,EAAG,EAAI,GAAI,IAClB,GAAE,GAAK,EAAI,EAAE,GACb,GAAE,EAAI,IAAM,GAAa,GAe3B,IAXA,GAAE,IAAM,GAAE,IAAM,EAAI,EACpB,GAAE,IAAM,GAAE,IAAO,EAAI,EAAI,WAIrB,GACF,IAAE,IAAM,CAAC,GAAE,IACX,GAAE,IAAM,CAAC,GAAE,KAIR,EAAI,EAAG,EAAI,GAAI,IAClB,GAAE,GAAK,GAAU,EAAI,EAAG,EAAI,GAO9B,IAAK,EAAI,EAAG,EAAI,GAAI,IAElB,GAAM,EAAG,EAAG,GAAI,GAAI,GAAQ,EAAI,GAAK,GAAI,GAAQ,EAAI,GAAK,IAC1D,GAAM,EAAG,GAAI,GAAI,GAAI,GAAQ,EAAI,GAAK,GAAI,GAAQ,EAAI,GAAK,IAC3D,GAAM,EAAG,GAAI,GAAI,GAAI,GAAQ,EAAI,GAAK,GAAI,GAAQ,EAAI,GAAK,IAC3D,GAAM,EAAG,GAAI,GAAI,GAAI,GAAQ,EAAI,GAAK,GAAI,GAAQ,EAAI,GAAK,IAC3D,GAAM,EAAG,GAAI,GAAI,GAAI,GAAQ,EAAI,GAAK,GAAI,GAAQ,EAAI,GAAK,IAC3D,GAAM,EAAG,GAAI,GAAI,GAAI,GAAQ,EAAI,GAAK,IAAK,GAAQ,EAAI,GAAK,KAC5D,GAAM,EAAG,GAAI,GAAI,GAAI,GAAQ,EAAI,GAAK,IAAK,GAAQ,EAAI,GAAK,KAC5D,GAAM,EAAG,EAAG,GAAI,GAAI,GAAQ,EAAI,GAAK,IAAK,GAAQ,EAAI,GAAK,KAI7D,IAAK,EAAI,EAAG,EAAI,GAAI,IAClB,EAAI,EAAE,GAAK,EAAI,EAAE,GAAK,GAAE,GAAK,GAAE,EAAI,IAQvC,YAAsB,EAAQ,EAAK,CACjC,GAAI,IAAW,GAAK,EAAS,GAC3B,KAAM,IAAI,OAAM,oDAElB,GAAI,GAAO,EAAI,OAAS,GACtB,KAAM,IAAI,OAAM,0DAalB,OATI,GAAM,CACR,EAAG,GAAI,YAAW,KAClB,EAAG,GAAI,aAAY,IACnB,EAAG,EACH,EAAG,EACH,OAAQ,GAID,EAAI,EAAG,EAAI,GAAI,IACtB,EAAI,EAAE,GAAK,GAAa,GAE1B,GAAI,GAAS,EAAM,EAAI,OAAS,EAChC,SAAI,EAAE,IAAM,SAAc,GAAU,EAAK,EAGrC,GACF,IAAc,EAAK,GAEnB,EAAI,EAAI,KAGH,EAKT,YAAwB,EAAK,EAAO,CAClC,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,AAAI,EAAI,IAAM,KACZ,GAAI,GAAK,EAAI,EACb,GAAgB,EAAK,IACrB,EAAI,EAAI,GAEV,EAAI,EAAE,EAAI,KAAO,EAAM,GAM3B,YAAuB,EAAK,CAG1B,IAFA,EAAI,GAAK,EAAI,EAEN,EAAI,EAAI,KACb,EAAI,EAAE,EAAI,KAAO,EAEnB,GAAgB,EAAK,IAIrB,OADI,GAAM,GAAI,YAAW,EAAI,QACpB,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,EAAI,GAAK,EAAI,EAAE,GAAK,IAAO,EAAK,GAAI,GAEtC,MAAO,GAWT,YAAkB,EAAO,EAAK,EAAQ,CAEpC,EAAS,GAAU,GACnB,EAAQ,GAAK,eAAe,GAG5B,GAAI,GAAM,GAAY,EAAQ,GAC9B,UAAc,EAAK,GACZ,GAAa,GAWtB,YAAqB,EAAO,EAAK,EAAQ,CACvC,GAAI,GAAS,GAAQ,EAAO,EAAK,GACjC,MAAO,IAAK,MAAM,GAGpB,GAAO,QAAU,CACf,QAAS,GACT,WAAY,GACZ,YAAa,GACb,cAAe,GACf,aAAc,MC/QhB,mBAIA,GAAI,IAAO,KAKX,YAAoB,EAAG,EAAG,CACxB,MAAO,GAAE,GAAM,EAAE,EAAI,IAAM,EAAM,EAAE,EAAI,IAAM,GAAO,EAAE,EAAI,IAAM,GAIlE,YAAgB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAChC,GAAE,GAAK,GAAE,GAAK,GAAE,GAAK,EACrB,GAAE,GAAK,GAAO,GAAE,GAAK,GAAE,GAAI,IAC3B,GAAE,GAAK,GAAE,GAAK,GAAE,GAChB,GAAE,GAAK,GAAO,GAAE,GAAK,GAAE,GAAI,IAC3B,GAAE,GAAK,GAAE,GAAK,GAAE,GAAK,EACrB,GAAE,GAAK,GAAO,GAAE,GAAK,GAAE,GAAI,GAC3B,GAAE,GAAK,GAAE,GAAK,GAAE,GAChB,GAAE,GAAK,GAAO,GAAE,GAAK,GAAE,GAAI,GAM7B,YAAiB,EAAG,EAAG,CACrB,MAAQ,KAAM,EAAM,GAAM,GAAK,EAIjC,GAAI,IAAa,GAAI,aAAY,CAC/B,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,aAElC,GAAQ,GAAI,YAAW,CACzB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EACnD,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EACnD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAClD,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,IAGjD,GAAI,GAAI,aAAY,IACpB,GAAI,GAAI,aAAY,IACxB,YAA0B,EAAK,EAAM,CACnC,GAAI,GAAI,EACR,IAAK,EAAI,EAAG,EAAI,EAAG,IACjB,GAAE,GAAK,EAAI,EAAE,GACb,GAAE,EAAI,GAAK,GAAW,GASxB,IANA,GAAE,KAAO,EAAI,EACb,GAAE,KAAQ,EAAI,EAAI,WACd,GACF,IAAE,IAAM,CAAC,GAAE,KAGR,EAAI,EAAG,EAAI,GAAI,IAClB,GAAE,GAAK,GAAU,EAAI,EAAG,EAAI,GAO9B,IAAK,EAAI,EAAG,EAAI,GAAI,IAElB,GAAM,EAAG,EAAG,EAAG,GAAI,GAAE,GAAM,EAAI,GAAK,IAAK,GAAE,GAAM,EAAI,GAAK,KAC1D,GAAM,EAAG,EAAG,EAAG,GAAI,GAAE,GAAM,EAAI,GAAK,IAAK,GAAE,GAAM,EAAI,GAAK,KAC1D,GAAM,EAAG,EAAG,GAAI,GAAI,GAAE,GAAM,EAAI,GAAK,IAAK,GAAE,GAAM,EAAI,GAAK,KAC3D,GAAM,EAAG,EAAG,GAAI,GAAI,GAAE,GAAM,EAAI,GAAK,IAAK,GAAE,GAAM,EAAI,GAAK,KAC3D,GAAM,EAAG,EAAG,GAAI,GAAI,GAAE,GAAM,EAAI,GAAK,IAAK,GAAE,GAAM,EAAI,GAAK,KAC3D,GAAM,EAAG,EAAG,GAAI,GAAI,GAAE,GAAM,EAAI,GAAK,KAAM,GAAE,GAAM,EAAI,GAAK,MAC5D,GAAM,EAAG,EAAG,EAAG,GAAI,GAAE,GAAM,EAAI,GAAK,KAAM,GAAE,GAAM,EAAI,GAAK,MAC3D,GAAM,EAAG,EAAG,EAAG,GAAI,GAAE,GAAM,EAAI,GAAK,KAAM,GAAE,GAAM,EAAI,GAAK,MAI7D,IAAK,EAAI,EAAG,EAAI,EAAG,IACjB,EAAI,EAAE,IAAM,GAAE,GAAK,GAAE,EAAI,GAQ7B,YAAsB,EAAQ,EAAK,CACjC,GAAI,CAAE,GAAS,GAAK,GAAU,IAC5B,KAAM,IAAI,OAAM,iDAElB,GAAI,GAAS,EAAM,EAAI,OAAS,EAChC,GAAI,GAAO,CAAE,GAAS,GAAK,GAAU,IACnC,KAAM,IAAI,OAAM,8CAGlB,GAAI,GAAM,CACR,EAAG,GAAI,aAAY,IACnB,EAAG,GAAI,aAAY,IACnB,EAAG,EACH,EAAG,EACH,OAAQ,GAEV,SAAI,EAAE,IAAM,SAAc,GAAU,EAAK,EAErC,EAAS,GACX,IAAc,EAAK,GACnB,EAAI,EAAI,IAGH,EAKT,YAAwB,EAAK,EAAO,CAClC,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,AAAI,EAAI,IAAM,IACZ,GAAI,GAAK,EAAI,EACb,GAAgB,EAAK,IACrB,EAAI,EAAI,GAEV,EAAI,EAAE,EAAI,KAAO,EAAM,GAM3B,YAAuB,EAAK,CAE1B,IADA,EAAI,GAAK,EAAI,EACN,EAAI,EAAI,IACb,EAAI,EAAE,EAAI,KAAO,EAEnB,GAAgB,EAAK,IAIrB,OADI,GAAM,GAAI,YAAW,EAAI,QACpB,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,EAAI,GAAM,EAAI,EAAE,GAAK,IAAO,EAAK,GAAI,GAAO,IAE9C,MAAO,GAWT,YAAkB,EAAO,EAAK,EAAQ,CAEpC,EAAS,GAAU,GACnB,EAAQ,GAAK,eAAe,GAG5B,GAAI,GAAM,GAAY,EAAQ,GAC9B,UAAc,EAAK,GACZ,GAAa,GAWtB,YAAqB,EAAO,EAAK,EAAQ,CACvC,GAAI,GAAS,GAAQ,EAAO,EAAK,GACjC,MAAO,IAAK,MAAM,GAGpB,GAAO,QAAU,CACf,QAAS,GACT,WAAY,GACZ,YAAa,GACb,cAAe,GACf,aAAc,MC5LhB,sBAAI,IAAM,KACN,GAAM,KAEV,GAAO,QAAU,CACf,QAAS,GAAI,QACb,WAAY,GAAI,WAChB,YAAa,GAAI,YACjB,cAAe,GAAI,cACnB,aAAc,GAAI,aAClB,QAAS,GAAI,QACb,WAAY,GAAI,WAChB,YAAa,GAAI,YACjB,cAAe,GAAI,cACnB,aAAc,GAAI,gBCbpB,gCAGA,GAAM,IAAQ,KAER,GAAO,MACP,GAAO,MAEP,GAAU,CACd,KAAM,GAAM,YACZ,OAAQ,GAAM,cACd,OAAQ,GAAM,cAGV,GAAU,CACd,KAAM,GAAM,YACZ,OAAQ,GAAM,cACd,OAAQ,GAAM,cAaV,GAAa,CAAC,EAAM,IAAO,KAAO,IAAS,CAC/C,GAAM,GAAM,EAAG,KAAK,EAAM,MAC1B,SAAG,OAAO,EAAK,GACR,EAAG,OAAO,IAMnB,GAAO,QAAU,AAAC,GAAU,CAC1B,OAAS,GAAI,EAAG,EAAI,GAAI,IACtB,EAAM,GAAO,GAAK,GAAW,EAAI,EAAG,IAEtC,OAAS,GAAI,EAAG,EAAI,GAAI,IACtB,EAAM,GAAO,GAAK,GAAW,EAAI,EAAG,OC5CxC,gCAEA,GAAM,IAAO,KAEP,GAAM,KACN,CAAE,QAAS,IAAQ,KACnB,CAAE,yBAAyB,KAC3B,GAAuB,KAUvB,GAAO,AAAC,GAAc,KAAO,IAAS,CAC1C,OAAQ,OACD,WACH,MAAO,IAAI,YAAW,GAAK,SAAS,YAAY,QAC7C,WACH,MAAO,IAAI,YAAW,GAAK,SAAS,YAAY,QAC7C,WACH,MAAO,IAAI,YAAW,GAAK,SAAS,YAAY,QAC7C,WACH,MAAO,IAAI,YAAW,GAAK,SAAS,YAAY,QAC7C,YACH,MAAO,IAAI,YAAW,GAAK,SAAS,OAAO,KAAK,OAAO,GAAM,mBAC1D,YACH,MAAO,IAAI,YAAW,GAAK,SAAS,OAAO,KAAK,OAAO,GAAM,mBAC1D,aACH,MAAO,IAAI,YAAW,GAAK,UAAU,YAAY,QAC9C,aACH,MAAO,IAAI,YAAW,GAAK,UAAU,YAAY,QAC9C,aACH,MAAO,IAAI,YAAW,GAAK,UAAU,YAAY,QAC9C,aACH,MAAO,IAAI,YAAW,GAAK,UAAU,YAAY,QAC9C,cACH,MAAO,IAAqB,GAAI,IAAI,QAAQ,GAAO,cAChD,aACH,MAAO,IAAqB,GAAI,IAAI,OAAO,YAG3C,KAAM,IAAI,WAAU,GAAG,oCAKvB,GAAW,GAAQ,EAEzB,GAAO,QAAU,CACf,YACA,KAAM,GAAI,QACV,QAAS,GAAI,YACb,QAAS,GAAI,YACb,WAAY,GAAI,gBAChB,QAAS,GAAK,YACd,QAAS,GAAK,YACd,QAAS,GAAK,YACd,QAAS,GAAK,YACd,SAAU,GAAK,aACf,SAAU,GAAK,aACf,UAAW,GAAK,cAChB,UAAW,GAAK,cAChB,UAAW,GAAK,cAChB,UAAW,GAAK,cAChB,WAAY,GAAK,eACjB,UAAW,GAAK,cAChB,SAAU,QCtEZ,gCAEA,GAAM,IAAU,KACV,GAAY,KACZ,GAAS,KACT,GAAS,KAef,kBAA6B,EAAO,EAAK,EAAQ,CAC/C,GAAM,GAAS,KAAM,IAAa,OAAO,EAAO,EAAK,GACrD,MAAO,IAAU,OAAO,EAAQ,EAAK,GAMvC,GAAa,UAAY,GAQzB,GAAa,OAAS,MAAO,EAAO,EAAK,IAAW,CAElD,GAAM,GAAS,KAAM,AADR,IAAa,WAAW,GACX,GAC1B,MAAO,GAAS,EAAO,MAAM,EAAG,GAAU,GAS5C,GAAa,WAAa,SAAU,EAAK,CACvC,GAAI,CAAC,EAEH,KADU,IAAQ,GAAI,OAAM,oCAAqC,oCAInE,GAAM,GAAO,GAAU,WAAW,GAClC,GAAI,CAAC,GAAa,UAAU,GAC1B,KAAM,IAAQ,GAAI,OAAM,uBAAuB,wBAA2B,oCAG5E,MAAO,IAAa,UAAU,IAShC,GAAa,UAAY,CAEvB,EAAM,GAAO,SAEb,GAAM,GAAO,KAEb,GAAM,GAAO,QAEb,GAAM,GAAO,QAEb,GAAM,GAAO,QAEb,GAAM,GAAO,QAEb,GAAM,GAAO,QAEb,GAAM,GAAO,QAEb,GAAM,GAAO,SAEb,GAAM,GAAO,SAEb,GAAM,GAAO,UAEb,GAAM,GAAO,UAEb,GAAM,GAAO,UAEb,GAAM,GAAO,UAEb,GAAM,GAAO,WAEb,GAAM,GAAO,UAEb,GAAM,GAAO,YAIf,GAAO,SAAS,GAAa,WAO7B,GAAa,SAAW,MAAO,EAAO,IAAS,CAC7C,GAAM,GAAU,KAAM,IAAa,EAAO,GAAU,OAAO,GAAM,MAEjE,MAAO,IAAO,EAAM,IAGtB,GAAO,QAAU,KCvHjB,gCAEA,GAAM,IAAM,KACN,GAAa,KACb,GAAe,KACf,CAAE,cAAc,GAEhB,GAAQ,GAAW,OACnB,GAAiB,GAAU,MAAM,YAcjC,GAAM,MAAO,EAAY,EAAc,KAAO,CAClD,GAAM,GAAU,CACd,WAAY,EAAY,YAAc,KAAO,EAAI,EAAY,WAC7D,QAAS,EAAY,SAAW,KAAO,GAAiB,EAAY,SAGhE,EAAW,GAAU,MAAM,EAAQ,SACnC,EAAO,KAAM,IAAa,EAAY,GACtC,EAAY,GAAW,gBAAgB,IAG7C,MAFY,IAAI,IAAI,EAAQ,WAAY,EAAW,IAKrD,GAAO,QAAU,CACf,SACA,kBACA,UCvCF,gCAEA,GAAM,IAAU,KACV,GAAS,KAeT,GAAY,MAAO,EAAM,EAAU,KAAO,CAC9C,GAAM,GAAM,EAAK,YACX,EAAU,KAAM,IAAO,IAAI,EAAK,GACtC,MAAO,IAAI,IAAQ,EAAQ,MAAQ,GAAI,EAAK,KAAM,IAGpD,GAAO,QAAU,KCxBjB,gCAEA,GAAM,IAAY,KACZ,GAAU,KAWV,GAAY,AAAC,GAAS,CAC1B,GAAI,YAAgB,IAGlB,MAAO,GAMT,GAAI,CAAE,QAAS,IACT,QAAU,IACV,QAAU,IACV,aAAe,IACnB,KAAM,IAAI,OAAM,sGAKlB,MAAO,IAAI,IAAQ,EAAK,MAAQ,EAAK,KAAM,EAAK,OAAS,EAAK,KAAM,EAAK,MAAQ,EAAK,WAAa,EAAK,MAAQ,EAAK,MAOjH,GAAU,CAAC,EAAM,IAAS,CAC9B,GAAM,GAAU,GAAU,GAC1B,EAAK,MAAM,KAAK,GAChB,GAAU,EAAK,QAGjB,GAAO,QAAU,KC9CjB,gCAEA,GAAM,IAAM,KACN,GAAmB,KAWnB,GAAS,CAAC,EAAS,IAAc,CACrC,GAAI,GAAY,KAWhB,GARA,AAAI,MAAO,IAAc,SACvB,EAAY,AAAwB,GAAS,EAAK,OAAS,EACtD,AAAI,YAAqB,YAC9B,EAAY,AAAwB,GAAS,GAAiB,EAAK,KAAK,MAAO,GACtE,GAAI,MAAM,IACnB,GAAY,AAAwB,GAAS,GAAiB,EAAK,KAAK,MAAO,EAAU,QAGvF,EAAW,CACb,GAAM,GAAQ,EAAQ,MAClB,EAAQ,EACZ,KAAO,EAAQ,EAAM,QAAQ,CAC3B,GAAM,GAAO,EAAM,GACnB,AAAI,EAAU,GACZ,EAAM,OAAO,EAAO,GAEpB,SAIJ,MAAM,IAAI,OAAM,yCAIpB,GAAO,QAAU,KC1CjB,gCAEA,GAAM,IAAY,KACZ,GAAU,KACV,CAAE,oCAAoC,KACtC,CAAE,qBAAqB,KACvB,GAAY,KACZ,GAAU,KACV,GAAS,KACT,GAAuB,KACvB,GAAqB,KAO3B,QAAc,CAMZ,YAAa,EAAM,EAAQ,GAAI,EAAiB,KAAM,CAQpD,GAPK,GACH,GAAO,GAAI,YAAW,IAEpB,MAAO,IAAS,UAClB,GAAO,GAAqB,IAG1B,CAAE,aAAgB,aACpB,KAAM,IAAI,OAAM,kDAGlB,GAAI,IAAmB,MAAQ,MAAO,IAAmB,SACvD,KAAM,IAAI,OAAM,6CAGlB,GAAM,GAAc,EAAM,IAAI,AAAC,GACtB,YAAgB,IACnB,EACA,GAAgC,IAEtC,GAAU,GAEV,KAAK,KAAO,EACZ,KAAK,MAAQ,EAEb,OAAO,iBAAiB,KAAM,CAC5B,gBAAiB,CAAE,MAAO,EAAgB,SAAU,GAAM,WAAY,IACtE,MAAO,CAAE,MAAO,KAAM,SAAU,GAAM,WAAY,MAItD,QAAU,CACR,MAAK,MAAK,OACR,MAAK,MAAQ,OAAO,OAAO,CACzB,KAAM,KAAK,KACX,MAAO,KAAK,MAAM,IAAI,AAAC,GAAM,EAAE,UAC/B,KAAM,KAAK,QAIR,OAAO,OAAO,GAAI,KAAK,OAGhC,UAAY,CACV,MAAO,mBAAmB,GAAmB,KAAK,KAAM,4BAA4B,KAAK,MAAM,iBAAiB,KAAK,QAGvH,mBAAqB,CACnB,KAAK,gBAAkB,KACvB,KAAK,MAAQ,KAMf,QAAS,EAAM,CACb,YAAK,oBACE,GAAQ,KAAM,GAMvB,OAAQ,EAAM,CACZ,YAAK,oBACE,GAAO,KAAM,GAMtB,UAAW,EAAS,CAClB,MAAO,IAAU,KAAM,GAGzB,WAAa,CACX,GAAM,GAAM,GAAiB,MAE7B,YAAK,gBAAkB,EAAI,OAEpB,KAGL,OAAQ,CACV,GAAI,KAAK,OAAS,KAAM,CACtB,GAAI,GAEJ,AAAI,GAAkB,MACpB,MAAK,gBAAkB,KAAK,YAAY,OACxC,EAAiB,KAAK,iBAGxB,KAAK,MAAQ,KAAK,MAAM,OAAO,CAAC,EAAK,IAAM,EAAM,EAAE,MAAO,GAG5D,MAAO,MAAK,SAGV,MAAM,EAAM,CACd,KAAM,IAAI,OAAM,6CAIpB,GAAO,QAAU,KC/HjB,gCAEA,GAAM,CACJ,WACE,KACE,GAAU,KACV,GAAU,KACV,CAAE,oBAAkB,yBAAyB,KAC7C,GAAS,KAYT,GAAM,CAAC,EAAY,IAChB,GAAO,IAAI,EAAY,GAQ1B,GAAY,AAAC,GACb,YAAgB,IACX,GAAiB,GAEjB,GAAqB,EAAK,KAAM,EAAK,OAS1C,GAAc,AAAC,GAAW,CAC9B,GAAM,GAAU,GAAO,OAAO,GACxB,EAAM,GAAO,SAAS,EAAS,CACnC,SAAU,GACV,OAAQ,GACR,MAAO,OACP,QAAS,KAIL,EAAQ,EAAI,MAAM,IAAI,AAA4B,GAE/C,GAAI,IAAQ,EAAK,KAAM,EAAK,MAAO,EAAK,OAG3C,EAAO,EAAI,MAAQ,KAAO,GAAI,YAAW,GAAK,EAAI,KAExD,MAAO,IAAI,IAAQ,EAAM,EAAO,EAAO,aAGzC,GAAO,QAAU,CACf,MAAO,GAAO,MACd,eAAgB,GAAO,eACvB,aACA,eACA,UCnEF,2BAEA,GAAM,IAAM,KAEN,GAAO,KAcb,GAAQ,QAAU,CAAC,EAAY,EAAO,MAAQ,CAC5C,GAAI,GAAO,GAAK,YAAY,GAEtB,EAAQ,EAAK,MAAM,KAAK,OAAO,SACrC,KAAO,EAAM,QAAQ,CACnB,GAAM,GAAM,EAAM,QAElB,GAAI,EAAK,KAAS,OAAW,CAE3B,OAAW,KAAQ,GAAK,MACtB,GAAI,EAAK,OAAS,EAChB,MAAO,CACL,MAAO,EAAK,KACZ,cAAe,EAAM,KAAK,MAMhC,KAAM,IAAI,OAAM,2BAA2B,MAK7C,GADA,EAAO,EAAK,GACR,GAAI,MAAM,GACZ,MAAO,CACL,MAAO,EACP,cAAe,EAAM,KAAK,MAKhC,MAAO,CACL,MAAO,EACP,cAAe,KAWnB,GAAQ,KAAO,UAAY,EAAY,CACrC,GAAM,GAAO,GAAK,YAAY,GAG9B,KAAM,OACN,KAAM,QACN,OAAS,GAAK,EAAG,EAAK,EAAK,MAAM,OAAQ,IACvC,KAAM,SAAS,IACf,KAAM,SAAS,SACf,KAAM,SAAS,UACf,KAAM,SAAS,YCzEnB,gCAEA,GAAM,IAAW,KACX,GAAO,KACP,GAAe,KACf,GAAe,KAYf,GAAS,CACb,QAAS,GACT,QAAS,GAMT,YACA,QACA,MAAO,GAAK,MACZ,eAAgB,GAAK,gBAGvB,GAAO,QAAU,KC/BjB,2BAEA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KAkCtD,GAAM,IAAa,6DAGb,GAAoB,GAW1B,YAAgB,EAAO,EAAS,EAAW,GAAY,CACrD,GAAG,CAAE,aAAiB,aACpB,KAAM,IAAI,WAAU,iCAEtB,GAAG,MAAO,IAAa,SACrB,KAAM,IAAI,WAAU,gCAEtB,GAAG,IAAY,QAAa,MAAO,IAAY,SAC7C,KAAM,IAAI,WAAU,+BAEtB,GAAG,EAAM,SAAW,EAClB,MAAO,GAGT,GAAI,GAAS,GAET,EAAI,EACF,EAAO,EAAS,OAChB,EAAQ,EAAS,OAAO,GACxB,EAAS,CAAC,GAChB,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAAG,CAChC,GAAI,GAAQ,EAAM,GAClB,OAAQ,GAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EAClC,GAAS,EAAO,IAAM,EACtB,EAAO,GAAK,EAAQ,EACpB,EAAS,EAAQ,EAAQ,EAG3B,KAAM,EAAQ,GACZ,EAAO,KAAK,EAAQ,GACpB,EAAS,EAAQ,EAAQ,EAK7B,IAAI,EAAI,EAAG,EAAM,KAAO,GAAK,EAAI,EAAM,OAAS,EAAG,EAAE,EACnD,GAAU,EAGZ,IAAI,EAAI,EAAO,OAAS,EAAG,GAAK,EAAG,EAAE,EACnC,GAAU,EAAS,EAAO,IAG5B,GAAG,EAAS,CACV,GAAM,GAAQ,GAAI,QAAO,OAAS,EAAU,IAAK,KACjD,EAAS,EAAO,MAAM,GAAO,KAAK;AAAA,GAGpC,MAAO,GAWT,YAAgB,EAAO,EAAW,GAAY,CAC5C,GAAG,MAAO,IAAU,SAClB,KAAM,IAAI,WAAU,6BAEtB,GAAG,MAAO,IAAa,SACrB,KAAM,IAAI,WAAU,gCAEtB,GAAG,EAAM,SAAW,EAClB,MAAO,IAAI,YAGb,GAAI,GAAQ,GAAkB,GAC9B,GAAG,CAAC,EAAO,CAET,EAAQ,GAAkB,GAAY,GACtC,OAAQ,GAAI,EAAG,EAAI,EAAS,OAAQ,EAAE,EACpC,EAAM,EAAS,WAAW,IAAM,EAKpC,EAAQ,EAAM,QAAQ,MAAO,IAE7B,GAAM,GAAO,EAAS,OAChB,EAAQ,EAAS,OAAO,GACxB,EAAQ,CAAC,GACf,OAAQ,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACpC,GAAM,GAAQ,EAAM,EAAM,WAAW,IACrC,GAAG,IAAU,OACX,OAGF,GAAI,GAAQ,EACZ,OAAQ,GAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EACjC,GAAS,EAAM,GAAK,EACpB,EAAM,GAAK,EAAQ,IACnB,IAAU,EAGZ,KAAM,EAAQ,GACZ,EAAM,KAAK,EAAQ,KACnB,IAAU,EAKd,OAAQ,GAAI,EAAG,EAAM,KAAO,GAAS,EAAI,EAAM,OAAS,EAAG,EAAE,EAC3D,EAAM,KAAK,GAGb,MAAO,IAAI,YAAW,EAAM,WAG9B,GAAQ,OAAS,GACjB,GAAQ,OAAS,KCnKjB,2BAEA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KAEtD,GAAI,IAAQ,KAIZ,GAAQ,OAAS,GAAM,OACvB,GAAQ,OAAS,GAAM,SCTvB,mBAKC,AAAC,UAAU,EAAM,CAGjB,GAAI,GAAkB,CACrB,GAAI,EAAQ,KAAK,IAAI,GAAI,IACxB,GAAI,EAAQ,KAAK,IAAI,GAAI,IACzB,GAAI,EAAQ,KAAK,IAAI,GAAI,IACzB,EAAI,EAAQ,KAAK,IAAI,EAAG,MAEtB,EAAa,CAChB,GAAI,EAAO,IACV,GAAI,EAAO,IACX,GAAI,EAAO,IACX,EAAI,EAAO,IAUb,WAAiB,EAAG,EAAG,CACtB,GAAK,CAAE,gBAAgB,IACtB,MAAO,IAAI,GAAO,EAAG,GAKtB,GAHA,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,UAAY,KACb,MAAO,IAAK,YACf,MAAO,GAAW,KAAK,KAAM,GAE9B,GAAI,MAAO,IAAK,SACf,MAAO,GAAW,KAAK,KAAM,EAAG,GAEjC,EAAS,KAAK,KAAM,EAAG,GAUxB,WAAmB,EAAG,EAAG,CACxB,YAAK,KAAO,EAAI,EAChB,KAAK,MAAQ,EAAI,EAEV,KAER,EAAO,UAAU,SAAW,EAQ5B,WAAqB,EAAO,CAC3B,YAAK,KAAO,EAAQ,MACpB,KAAK,MAAQ,IAAU,GAEhB,KAER,EAAO,UAAU,WAAa,EAS9B,WAAqB,EAAG,EAAO,CAC9B,GAAI,GAAQ,SAAS,EAAG,GAAS,IAEjC,YAAK,KAAO,EAAQ,MACpB,KAAK,MAAQ,IAAU,GAEhB,KAER,EAAO,UAAU,WAAa,EAO9B,EAAO,UAAU,SAAW,UAAY,CACvC,MAAQ,MAAK,MAAQ,MAAS,KAAK,MASpC,EAAO,UAAU,SAAW,SAAU,EAAO,CAC5C,MAAO,MAAK,WAAW,SAAS,GAAS,KAS1C,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,GAAI,GAAM,KAAK,KAAO,EAAM,KACxB,EAAM,IAAQ,GAElB,UAAO,KAAK,MAAQ,EAAM,MAE1B,KAAK,KAAO,EAAM,MAClB,KAAK,MAAQ,EAAM,MAEZ,MASR,EAAO,UAAU,SAAW,SAAU,EAAO,CAE5C,MAAO,MAAK,IAAK,EAAM,QAAQ,WAShC,EAAO,UAAU,SAAW,SAAU,EAAO,CAS5C,GAAI,GAAM,KAAK,MACX,EAAM,KAAK,KACX,EAAM,EAAM,MACZ,EAAM,EAAM,KAcZ,EAAK,EACT,SAAM,EAAM,EACZ,EAAM,IAAQ,GAEd,GAAO,EAAM,EACb,GAAO,MACP,GAAO,EAAM,EAEb,KAAK,KAAO,EAAM,MAClB,KAAK,MAAQ,EAAM,MAEZ,MAWR,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,GAAM,EAAM,MAAQ,GAAO,EAAM,OAAS,EAAK,KAAM,OAAM,oBAG3D,GAAI,EAAM,OAAS,GAAK,EAAM,MAAQ,EACrC,YAAK,UAAY,GAAI,GAAO,GACrB,KAIR,GAAK,EAAM,GAAG,MACb,YAAK,UAAY,KAAK,QACtB,KAAK,KAAO,EACZ,KAAK,MAAQ,EACN,KAGR,GAAK,KAAK,GAAG,GACZ,YAAK,UAAY,GAAI,GAAO,GAC5B,KAAK,KAAO,EACZ,KAAK,MAAQ,EACN,KAMR,OAFI,GAAS,EAAM,QACf,EAAI,GACA,CAAC,KAAK,GAAG,IAIhB,EAAO,UAAU,EAAG,IACpB,IAQD,IAJA,KAAK,UAAY,KAAK,QAEtB,KAAK,KAAO,EACZ,KAAK,MAAQ,EACN,GAAK,EAAG,IACd,EAAO,WAAW,GAGZ,KAAK,UAAU,GAAG,IACvB,MAAK,UAAU,SAAS,GAExB,AAAI,GAAK,GACR,KAAK,OAAS,GAAM,EAAI,GAExB,KAAK,MAAQ,GAAK,GAKrB,MAAO,OAQR,EAAO,UAAU,OAAS,UAAY,CACrC,GAAI,GAAM,EAAC,KAAK,KAAO,OAAW,EAClC,YAAK,KAAO,EAAI,MAChB,KAAK,MAAS,CAAC,KAAK,MAAS,KAAM,IAAO,MAEnC,MASR,EAAO,UAAU,OAAS,EAAO,UAAU,GAAK,SAAU,EAAO,CAChE,MAAQ,MAAK,MAAQ,EAAM,MAAU,KAAK,OAAS,EAAM,OAS1D,EAAO,UAAU,YAAc,EAAO,UAAU,GAAK,SAAU,EAAO,CACrE,MAAI,MAAK,MAAQ,EAAM,MAAc,GACjC,KAAK,MAAQ,EAAM,MAAc,GAC9B,KAAK,KAAO,EAAM,MAS1B,EAAO,UAAU,SAAW,EAAO,UAAU,GAAK,SAAU,EAAO,CAClE,MAAI,MAAK,MAAQ,EAAM,MAAc,GACjC,KAAK,MAAQ,EAAM,MAAc,GAC9B,KAAK,KAAO,EAAM,MAS1B,EAAO,UAAU,GAAK,SAAU,EAAO,CACtC,YAAK,MAAQ,EAAM,KACnB,KAAK,OAAS,EAAM,MAEb,MASR,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,YAAK,MAAQ,EAAM,KACnB,KAAK,OAAS,EAAM,MAEb,MAQR,EAAO,UAAU,IAAM,UAAW,CACjC,YAAK,KAAO,CAAC,KAAK,KAAO,MACzB,KAAK,MAAQ,CAAC,KAAK,MAAQ,MAEpB,MASR,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,YAAK,MAAQ,EAAM,KACnB,KAAK,OAAS,EAAM,MAEb,MASR,EAAO,UAAU,WAAa,EAAO,UAAU,OAAS,SAAU,EAAG,CACpE,MAAI,GAAI,GACP,MAAK,KAAO,KAAK,OAAU,EAAI,GAC/B,KAAK,MAAQ,GACP,AAAI,GAAK,GACf,MAAK,KAAO,KAAK,MACjB,KAAK,MAAQ,GAEb,MAAK,KAAQ,KAAK,MAAQ,EAAQ,KAAK,OAAU,GAAG,EAAM,MAC1D,KAAK,QAAU,GAGT,MAUR,EAAO,UAAU,UAAY,EAAO,UAAU,OAAS,SAAU,EAAG,EAAe,CAClF,MAAI,GAAI,GACP,MAAK,MAAQ,KAAK,MAAS,EAAI,GAC/B,KAAK,KAAO,EACP,GACJ,MAAK,OAAS,QAET,AAAI,GAAK,GACf,MAAK,MAAQ,KAAK,KAClB,KAAK,KAAO,GAEZ,MAAK,MAAS,KAAK,OAAS,EAAM,KAAK,MAAS,GAAG,EACnD,KAAK,KAAQ,KAAK,MAAQ,EAAK,MAC1B,GAEJ,MAAK,OAAS,QAIT,MASR,EAAO,UAAU,WAAa,EAAO,UAAU,KAAO,SAAU,EAAG,CAClE,GAAI,GAAK,KAAK,OAAS,GAAM,KAAK,KAClC,SAAK,GAAK,EAAM,IAAO,GAAK,EAC5B,KAAK,KAAO,EAAI,MAChB,KAAK,MAAQ,IAAM,GAEZ,MASR,EAAO,UAAU,YAAc,EAAO,UAAU,KAAO,SAAU,EAAG,CACnE,GAAI,GAAK,KAAK,OAAS,GAAM,KAAK,KAClC,SAAK,IAAM,EAAM,GAAM,GAAK,EAC5B,KAAK,KAAO,EAAI,MAChB,KAAK,MAAQ,IAAM,GAEZ,MAQR,EAAO,UAAU,MAAQ,UAAY,CACpC,MAAO,IAAI,GAAO,KAAK,KAAM,KAAK,QAGnC,AAAI,MAAO,SAAU,aAAe,OAAO,IAE1C,OAAO,GAAI,UAAY,CACtB,MAAO,KAEF,AAAI,MAAO,KAAU,aAAe,GAAO,QAEjD,GAAO,QAAU,EAGjB,EAAK,OAAY,IAGhB,MClcH,mBAKC,AAAC,UAAU,EAAM,CAGjB,GAAI,GAAkB,CACrB,GAAI,EAAQ,KAAK,IAAI,GAAI,IACxB,GAAI,EAAQ,KAAK,IAAI,GAAI,IACzB,EAAI,EAAQ,KAAK,IAAI,EAAG,KAEtB,EAAa,CAChB,GAAI,EAAO,IACV,GAAI,EAAO,IACX,EAAI,EAAO,IAkBb,WAAiB,EAAK,EAAK,EAAK,EAAK,CACpC,GAAK,CAAE,gBAAgB,IACtB,MAAO,IAAI,GAAO,EAAK,EAAK,EAAK,GAGlC,GADA,KAAK,UAAY,KACb,MAAO,IAAO,SACjB,MAAO,GAAW,KAAK,KAAM,EAAK,GAEnC,GAAI,MAAO,IAAO,YACjB,MAAO,GAAW,KAAK,KAAM,GAE9B,EAAS,MAAM,KAAM,WAetB,WAAmB,EAAK,EAAK,EAAK,EAAK,CACtC,MAAI,OAAO,IAAO,YACjB,MAAK,KAAO,EAAM,MAClB,KAAK,KAAO,IAAQ,GACpB,KAAK,KAAO,EAAM,MAClB,KAAK,KAAO,IAAQ,GACb,MAGR,MAAK,KAAO,EAAM,EAClB,KAAK,KAAO,EAAM,EAClB,KAAK,KAAO,EAAM,EAClB,KAAK,KAAO,EAAM,EAEX,MAER,EAAO,UAAU,SAAW,EAQ5B,WAAqB,EAAO,CAC3B,YAAK,KAAO,EAAQ,MACpB,KAAK,KAAO,IAAU,GACtB,KAAK,KAAO,EACZ,KAAK,KAAO,EAEL,KAER,EAAO,UAAU,WAAa,EAS9B,WAAqB,EAAG,EAAO,CAC9B,EAAQ,GAAS,GAEjB,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EAmBZ,OAFI,GAAY,EAAgB,IAAU,GAAI,GAAQ,KAAK,IAAI,EAAO,IAE7D,EAAI,EAAG,EAAM,EAAE,OAAQ,EAAI,EAAK,GAAK,EAAG,CAChD,GAAI,GAAO,KAAK,IAAI,EAAG,EAAM,GACzB,EAAQ,SAAU,EAAE,MAAM,EAAG,EAAI,GAAO,GAC5C,KAAK,SACH,EAAO,EACJ,GAAI,GAAQ,KAAK,IAAI,EAAO,IAC5B,GAEH,IAAK,GAAI,GAAO,IAGnB,MAAO,MAER,EAAO,UAAU,WAAa,EAO9B,EAAO,UAAU,SAAW,UAAY,CACvC,MAAQ,MAAK,KAAO,MAAS,KAAK,MASnC,EAAO,UAAU,SAAW,SAAU,EAAO,CAC5C,EAAQ,GAAS,GACjB,GAAI,GAAY,EAAW,IAAU,GAAI,GAAO,GAEhD,GAAK,CAAC,KAAK,GAAG,GAAa,MAAO,MAAK,WAAW,SAAS,GAI3D,OAFI,GAAO,KAAK,QACZ,EAAM,GAAI,OAAM,IACX,EAAI,GAAI,GAAK,GACrB,GAAK,IAAI,GACT,EAAI,GAAK,EAAK,UAAU,WAAW,SAAS,GACvC,EAAC,EAAK,GAAG,IAHU,IAGxB,CAED,SAAI,EAAE,GAAK,EAAK,WAAW,SAAS,GAE7B,EAAI,KAAK,KASjB,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,GAAI,GAAM,KAAK,KAAO,EAAM,KAExB,EAAM,IAAQ,GAClB,GAAO,KAAK,KAAO,EAAM,KAEzB,GAAI,GAAM,IAAQ,GAClB,GAAO,KAAK,KAAO,EAAM,KAEzB,GAAI,GAAM,IAAQ,GAClB,UAAO,KAAK,KAAO,EAAM,KAEzB,KAAK,KAAO,EAAM,MAClB,KAAK,KAAO,EAAM,MAClB,KAAK,KAAO,EAAM,MAClB,KAAK,KAAO,EAAM,MAEX,MASR,EAAO,UAAU,SAAW,SAAU,EAAO,CAC5C,MAAO,MAAK,IAAK,EAAM,QAAQ,WAShC,EAAO,UAAU,SAAW,SAAU,EAAO,CAqB5C,GAAI,GAAM,KAAK,KACX,EAAM,KAAK,KACX,EAAM,KAAK,KACX,EAAM,KAAK,KACX,EAAM,EAAM,KACZ,EAAM,EAAM,KACZ,EAAM,EAAM,KACZ,EAAM,EAAM,KAEZ,GAAM,EAAM,EAEZ,EAAM,KAAQ,GAClB,GAAO,EAAM,EACb,GAAI,IAAM,IAAQ,GAClB,GAAO,MACP,GAAO,EAAM,EAEb,IAAO,IAAQ,GACf,IAAO,EAAM,EACb,GAAI,GAAM,KAAQ,GAClB,WAAO,MACP,IAAO,EAAM,EACb,GAAO,KAAQ,GACf,IAAO,MACP,IAAO,EAAM,EAEb,GAAO,KAAQ,GACf,GAAO,EAAM,EACb,GAAO,MACP,GAAO,EAAM,EACb,GAAO,MACP,GAAO,EAAM,EACb,GAAO,MACP,GAAO,EAAM,EAEb,KAAK,KAAO,GAAM,MAClB,KAAK,KAAO,EAAM,MAClB,KAAK,KAAO,GAAM,MAClB,KAAK,KAAO,EAAM,MAEX,MAWR,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,GAAM,EAAM,MAAQ,GAAO,EAAM,MAAQ,GAAO,EAAM,MAAQ,EAAK,CAClE,GAAI,EAAM,MAAQ,EAAG,KAAM,OAAM,oBAGjC,GAAI,EAAM,MAAQ,EACjB,YAAK,UAAY,GAAI,GAAO,GACrB,KAKT,GAAK,EAAM,GAAG,MACb,YAAK,UAAY,KAAK,QACtB,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACL,KAGR,GAAK,KAAK,GAAG,GACZ,YAAK,UAAY,GAAI,GAAO,GAC5B,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACL,KAMR,OAFI,GAAS,EAAM,QACf,EAAI,GACA,CAAC,KAAK,GAAG,IAIhB,EAAO,UAAU,EAAG,IACpB,IAUD,IANA,KAAK,UAAY,KAAK,QAEtB,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,EACL,GAAK,EAAG,IACd,EAAO,WAAW,GAGZ,KAAK,UAAU,GAAG,IACvB,MAAK,UAAU,SAAS,GAExB,AAAI,GAAK,GACR,KAAK,MAAQ,GAAM,EAAI,GACjB,AAAI,GAAK,GACf,KAAK,MAAQ,GAAM,EAAI,GACjB,AAAI,GAAK,GACf,KAAK,MAAQ,GAAM,EAAI,GAEvB,KAAK,MAAQ,GAAK,GAKrB,MAAO,OAQR,EAAO,UAAU,OAAS,UAAY,CACrC,GAAI,GAAM,EAAC,KAAK,KAAO,OAAW,EAClC,YAAK,KAAO,EAAI,MAChB,EAAK,EAAC,KAAK,KAAO,OAAW,KAAM,IACnC,KAAK,KAAO,EAAI,MAChB,EAAK,EAAC,KAAK,KAAO,OAAW,KAAM,IACnC,KAAK,KAAO,EAAI,MAChB,KAAK,KAAQ,CAAC,KAAK,KAAQ,KAAM,IAAO,MAEjC,MASR,EAAO,UAAU,OAAS,EAAO,UAAU,GAAK,SAAU,EAAO,CAChE,MAAQ,MAAK,MAAQ,EAAM,MAAU,KAAK,MAAQ,EAAM,MAClD,KAAK,MAAQ,EAAM,MAAU,KAAK,MAAQ,EAAM,MASvD,EAAO,UAAU,YAAc,EAAO,UAAU,GAAK,SAAU,EAAO,CACrE,MAAI,MAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC5B,KAAK,KAAO,EAAM,MAS1B,EAAO,UAAU,SAAW,EAAO,UAAU,GAAK,SAAU,EAAO,CAClE,MAAI,MAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC/B,KAAK,KAAO,EAAM,KAAa,GAC5B,KAAK,KAAO,EAAM,MAS1B,EAAO,UAAU,GAAK,SAAU,EAAO,CACtC,YAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KAEZ,MASR,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,YAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KAEZ,MASR,EAAO,UAAU,IAAM,SAAU,EAAO,CACvC,YAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KACnB,KAAK,MAAQ,EAAM,KAEZ,MAQR,EAAO,UAAU,IAAM,UAAW,CACjC,YAAK,KAAO,CAAC,KAAK,KAAO,MACzB,KAAK,KAAO,CAAC,KAAK,KAAO,MACzB,KAAK,KAAO,CAAC,KAAK,KAAO,MACzB,KAAK,KAAO,CAAC,KAAK,KAAO,MAElB,MASR,EAAO,UAAU,WAAa,EAAO,UAAU,OAAS,SAAU,EAAG,CACpE,UAAK,GACL,AAAI,GAAK,GACR,MAAK,KAAO,KAAK,MAAS,EAAI,GAC9B,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,GACN,AAAI,GAAK,GACf,IAAK,GACL,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAQ,KAAK,MAAQ,EAAK,MAC/B,KAAK,KAAO,EACZ,KAAK,KAAO,GACN,AAAI,GAAK,GACf,IAAK,GACL,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAQ,KAAK,MAAQ,EAAK,MAC/B,KAAK,KAAO,GAEZ,MAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAQ,KAAK,MAAQ,EAAK,OAGzB,MAUR,EAAO,UAAU,UAAY,EAAO,UAAU,OAAS,SAAU,EAAG,EAAe,CAClF,UAAK,GACL,AAAI,GAAK,GACR,MAAK,KAAO,KAAK,MAAS,EAAI,GAC9B,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,KAAO,GACN,AAAI,GAAK,GACf,IAAK,GACL,KAAK,KAAQ,KAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,EACjD,KAAK,KAAQ,KAAK,MAAQ,EAAK,MAC/B,KAAK,KAAO,EACZ,KAAK,KAAO,GACN,AAAI,GAAK,GACf,IAAK,GACL,KAAK,KAAQ,KAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,EACjD,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAQ,KAAK,MAAQ,EAAK,MAC/B,KAAK,KAAO,GAEZ,MAAK,KAAQ,KAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,EACjD,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAU,MAAK,MAAQ,EAAM,KAAK,MAAS,GAAG,GAAQ,MAC3D,KAAK,KAAQ,KAAK,MAAQ,EAAK,OAE3B,GACJ,MAAK,MAAQ,OAGP,MASR,EAAO,UAAU,WAAa,EAAO,UAAU,KAAO,SAAU,EAAG,CAElE,GADA,GAAK,GACD,GAAK,EAAG,MAAO,MACnB,GAAI,GAAK,GAAI,CAIZ,GAAI,GAAI,KAAK,KAMb,GALA,KAAK,KAAO,KAAK,KACjB,KAAK,KAAO,EACZ,EAAI,KAAK,KACT,KAAK,KAAO,KAAK,KACjB,KAAK,KAAO,EACR,GAAK,GAAI,MAAO,MACpB,GAAK,GAGN,GAAI,GAAQ,KAAK,MAAQ,GAAM,KAAK,KAChC,EAAO,KAAK,MAAQ,GAAM,KAAK,KAE/B,EAAS,GAAQ,EAAM,IAAS,GAAK,EACrC,EAAQ,GAAO,EAAM,IAAU,GAAK,EAExC,YAAK,KAAO,EAAO,MACnB,KAAK,KAAO,IAAS,GACrB,KAAK,KAAO,EAAQ,MACpB,KAAK,KAAO,IAAU,GAEf,MASR,EAAO,UAAU,YAAc,EAAO,UAAU,KAAO,SAAU,EAAG,CAEnE,GADA,GAAK,GACD,GAAK,EAAG,MAAO,MACnB,GAAI,GAAK,GAAI,CAIZ,GAAI,GAAI,KAAK,KAMb,GALA,KAAK,KAAO,KAAK,KACjB,KAAK,KAAO,EACZ,EAAI,KAAK,KACT,KAAK,KAAO,KAAK,KACjB,KAAK,KAAO,EACR,GAAK,GAAI,MAAO,MACpB,GAAK,GAGN,GAAI,GAAQ,KAAK,MAAQ,GAAM,KAAK,KAChC,EAAO,KAAK,MAAQ,GAAM,KAAK,KAE/B,EAAS,IAAS,EAAM,GAAQ,GAAK,EACrC,EAAQ,IAAQ,EAAM,GAAS,GAAK,EAExC,YAAK,KAAO,EAAO,MACnB,KAAK,KAAO,IAAS,GACrB,KAAK,KAAO,EAAQ,MACpB,KAAK,KAAO,IAAU,GAEf,MAQR,EAAO,UAAU,MAAQ,UAAY,CACpC,MAAO,IAAI,GAAO,KAAK,KAAM,KAAK,KAAM,KAAK,KAAM,KAAK,OAGzD,AAAI,MAAO,SAAU,aAAe,OAAO,IAE1C,OAAO,GAAI,UAAY,CACtB,MAAO,KAEF,AAAI,MAAO,KAAU,aAAe,GAAO,QAEjD,GAAO,QAAU,EAGjB,EAAK,OAAY,IAGhB,MCvoBH,iBAAQ,OAAS,KACjB,GAAQ,OAAS,OCDjB,mBAMA,GAAI,IAAS,KAAiB,OAO9B,GAAO,UAAU,WAAa,SAAU,EAAK,EAAM,CAClD,GAAI,GAAM,GAAU,KAChB,EAAM,GAAU,MAEhB,EAAK,EACT,EAAM,EAAM,EACZ,EAAM,IAAQ,GAEd,GAAO,EAAO,EACd,GAAO,MACP,GAAO,EAAM,EAEb,GAAI,GAAM,KAAK,KAAQ,GAAM,OACzB,EAAM,IAAQ,GAElB,GAAO,KAAK,MAAS,GAAM,OAE3B,GAAI,GAAK,GAAO,GAAO,EAAM,MAC7B,EAAK,GAAK,GAAO,IAAM,GAEvB,EAAM,EAAI,MACV,EAAM,IAAM,GAEZ,EAAM,GAAU,KAChB,EAAM,GAAU,MAEhB,EAAM,EAAM,EACZ,EAAM,IAAQ,GAEd,GAAO,EAAM,EACb,GAAO,MACP,GAAO,EAAM,EAEb,KAAK,KAAO,EAAM,MAClB,KAAK,MAAQ,EAAM,OAMpB,GAAI,IAAY,GAAQ,cACpB,GAAY,GAAQ,cACpB,GAAY,GAAQ,cACpB,GAAY,GAAS,aACrB,GAAY,GAAS,aAOzB,YAAsB,EAAK,CAE1B,OADI,GAAO,GACF,EAAE,EAAG,EAAE,EAAI,OAAQ,EAAI,EAAG,IAAK,CACvC,GAAI,GAAW,EAAI,WAAW,GAC9B,AAAI,EAAW,IAAM,EAAK,KAAK,GAC1B,AAAI,EAAW,KACnB,EAAK,KAAK,IAAQ,GAAY,EAC9B,IAAQ,EAAW,IAEf,AAAI,EAAW,OAAU,GAAY,MACzC,EAAK,KAAK,IAAQ,GAAY,GAC9B,IAAS,GAAU,EAAK,GACxB,IAAQ,EAAW,IAInB,KAIA,EAAW,MAAa,IAAW,OAAQ,GACxC,EAAI,WAAW,GAAK,MACvB,EAAK,KAAK,IAAQ,GAAW,GAC7B,IAAS,GAAU,GAAM,GACzB,IAAS,GAAU,EAAK,GACxB,IAAQ,EAAW,KAIrB,MAAO,IAAI,YAAW,GAavB,aAAgB,CACf,GAAI,UAAU,QAAU,EACvB,MAAO,IAAI,IAAK,UAAU,IAAK,OAAQ,UAAU,IAAK,SAEvD,GAAI,CAAE,gBAAgB,KACrB,MAAO,IAAI,IAAK,UAAU,IAE3B,GAAK,KAAK,KAAM,UAAU,IAS1B,YAAe,EAAM,CACrB,YAAK,KAAO,YAAgB,IAAS,EAAK,QAAU,GAAO,GAC3D,KAAK,GAAK,KAAK,KAAK,QAAQ,IAAI,IAAW,IAAI,IAC/C,KAAK,GAAK,KAAK,KAAK,QAAQ,IAAI,IAChC,KAAK,GAAK,KAAK,KAAK,QACpB,KAAK,GAAK,KAAK,KAAK,QAAQ,SAAS,IACrC,KAAK,UAAY,EACjB,KAAK,QAAU,EACf,KAAK,OAAS,KAEP,KAER,GAAI,UAAU,KAAO,GAQrB,GAAI,UAAU,OAAS,SAAU,EAAO,CACvC,GAAI,GAAW,MAAO,IAAS,SAC3B,EAGJ,AAAI,GACH,GAAQ,GAAY,GACpB,EAAW,GACX,EAAgB,IAGb,MAAO,cAAgB,aAAe,YAAiB,cAE1D,GAAgB,GAChB,EAAQ,GAAI,YAAW,IAGxB,GAAI,GAAI,EACJ,EAAM,EAAM,OACZ,EAAO,EAAI,EAEf,GAAI,GAAO,EAAG,MAAO,MAerB,GAbA,KAAK,WAAa,EAEd,KAAK,SAAW,GAEnB,CAAI,EACH,KAAK,OAAS,GACR,AAAI,EACV,KAAK,OAAS,GAAI,YAAW,IAE7B,KAAK,OAAS,GAAI,QAAO,KAIvB,KAAK,QAAU,EAAM,GAGxB,MAAI,GACH,KAAK,QAAU,EACT,AAAI,EACV,KAAK,OAAO,IAAK,EAAM,SAAS,EAAG,GAAM,KAAK,SAE9C,EAAM,KAAM,KAAK,OAAQ,KAAK,QAAS,EAAG,GAG3C,KAAK,SAAW,EACT,KAGR,GAAI,KAAK,QAAU,EACnB,CAEC,AAAI,EACH,KAAK,QAAU,EAAM,MAAM,EAAG,GAAK,KAAK,SAClC,AAAI,EACV,KAAK,OAAO,IAAK,EAAM,SAAS,EAAG,GAAK,KAAK,SAAU,KAAK,SAE5D,EAAM,KAAM,KAAK,OAAQ,KAAK,QAAS,EAAG,GAAK,KAAK,SAGrD,GAAI,GAAM,EACV,AAAI,EACH,MAAK,GAAG,WACN,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAEpE,GAAO,EACP,KAAK,GAAG,WACN,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAEpE,GAAO,EACP,KAAK,GAAG,WACN,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAEpE,GAAO,EACP,KAAK,GAAG,WACN,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,KAGpE,MAAK,GAAG,WACN,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE9C,GAAO,EACP,KAAK,GAAG,WACN,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE9C,GAAO,EACP,KAAK,GAAG,WACN,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE9C,GAAO,EACP,KAAK,GAAG,WACN,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,KAI/C,GAAK,GAAK,KAAK,QACf,KAAK,QAAU,EACX,GAAU,MAAK,OAAS,IAG7B,GAAI,GAAK,EAAO,GAChB,CACC,GAAI,GAAQ,EAAO,GAEnB,EAEC,AAAI,GACH,MAAK,GAAG,WACN,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAEpD,GAAK,EACL,KAAK,GAAG,WACN,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAEpD,GAAK,EACL,KAAK,GAAG,WACN,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAEpD,GAAK,EACL,KAAK,GAAG,WACN,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,KAGpD,MAAK,GAAG,WACN,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE9B,GAAK,EACL,KAAK,GAAG,WACN,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE9B,GAAK,EACL,KAAK,GAAG,WACN,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE9B,GAAK,EACL,KAAK,GAAG,WACN,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,KAG/B,GAAK,QACG,GAAK,GAGf,MAAI,GAAI,GAGP,CAAI,EACH,KAAK,QAAU,EAAM,MAAM,GACrB,AAAI,EACV,KAAK,OAAO,IAAK,EAAM,SAAS,EAAG,GAAO,KAAK,SAE/C,EAAM,KAAM,KAAK,OAAQ,KAAK,QAAS,EAAG,GAG3C,KAAK,QAAU,EAAO,GAGhB,MAQR,GAAI,UAAU,OAAS,UAAY,CAClC,GAAI,GAAQ,KAAK,OACb,EAAW,MAAO,IAAS,SAC3B,EAAI,EACJ,EAAO,KAAK,QACZ,EAAK,EACL,EAAI,GAAI,IAaZ,IAXA,AAAI,KAAK,WAAa,GAErB,EAAM,KAAK,GAAG,KAAK,GAAG,IAAK,KAAK,GAAG,KAAK,GAAG,IAAK,KAAK,GAAG,KAAK,IAAI,IAAK,KAAK,GAAG,KAAK,OAInF,EAAO,KAAK,KAAK,QAAQ,IAAK,IAG/B,EAAI,IAAK,EAAE,WAAW,KAAK,YAEpB,GAAK,EAAO,GAElB,AAAI,EACH,EAAE,SACA,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAGpD,EAAE,SACA,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAG/B,EACE,IAAK,EAAE,SAAS,KAChB,KAAK,IACL,SAAU,IACZ,GAAK,EAGN,KAAO,EAAI,GAEV,EAAE,SAAU,EAAW,EAAM,WAAW,KAAO,EAAM,KAAM,GAC3D,EACE,IAAK,EAAE,SAAS,KAChB,KAAK,IACL,SAAS,IAGZ,SAAI,EAAI,QAAQ,WAAW,IAC3B,EAAI,IAAI,GAAG,SAAS,IAEpB,EAAI,EAAI,QAAQ,WAAW,IAC3B,EAAI,IAAI,GAAG,SAAS,IAEpB,EAAI,EAAI,QAAQ,WAAW,IAC3B,EAAI,IAAI,GAGR,KAAK,KAAM,KAAK,MAET,GAGR,GAAO,QAAU,KCpYjB,mBAMA,GAAI,IAAS,KAAiB,OAK1B,GAAY,GAAQ,wBACpB,GAAY,GAAQ,wBACpB,GAAY,GAAS,uBACrB,GAAY,GAAS,uBACrB,GAAY,GAAS,uBAOzB,YAAsB,EAAK,CAE1B,OADI,GAAO,GACF,EAAE,EAAG,EAAE,EAAI,OAAQ,EAAI,EAAG,IAAK,CACvC,GAAI,GAAW,EAAI,WAAW,GAC9B,AAAI,EAAW,IAAM,EAAK,KAAK,GAC1B,AAAI,EAAW,KACnB,EAAK,KAAK,IAAQ,GAAY,EAC9B,IAAQ,EAAW,IAEf,AAAI,EAAW,OAAU,GAAY,MACzC,EAAK,KAAK,IAAQ,GAAY,GAC9B,IAAS,GAAU,EAAK,GACxB,IAAQ,EAAW,IAInB,KAIA,EAAW,MAAa,IAAW,OAAQ,GACxC,EAAI,WAAW,GAAK,MACvB,EAAK,KAAK,IAAQ,GAAW,GAC7B,IAAS,GAAU,GAAM,GACzB,IAAS,GAAU,EAAK,GACxB,IAAQ,EAAW,KAIrB,MAAO,IAAI,YAAW,GAavB,aAAkB,CACjB,GAAI,UAAU,QAAU,EACvB,MAAO,IAAI,IAAO,UAAU,IAAK,OAAQ,UAAU,IAAK,SAEzD,GAAI,CAAE,gBAAgB,KACrB,MAAO,IAAI,IAAO,UAAU,IAE7B,GAAK,KAAK,KAAM,UAAU,IAS1B,YAAe,EAAM,CACrB,YAAK,KAAO,YAAgB,IAAS,EAAK,QAAU,GAAO,GAC3D,KAAK,GAAK,KAAK,KAAK,QAAQ,IAAI,IAAW,IAAI,IAC/C,KAAK,GAAK,KAAK,KAAK,QAAQ,IAAI,IAChC,KAAK,GAAK,KAAK,KAAK,QACpB,KAAK,GAAK,KAAK,KAAK,QAAQ,SAAS,IACrC,KAAK,UAAY,EACjB,KAAK,QAAU,EACf,KAAK,OAAS,KAEP,KAER,GAAM,UAAU,KAAO,GAQvB,GAAM,UAAU,OAAS,SAAU,EAAO,CACzC,GAAI,GAAW,MAAO,IAAS,SAC3B,EAGJ,AAAI,GACH,GAAQ,GAAY,GACpB,EAAW,GACX,EAAgB,IAGb,MAAO,cAAgB,aAAe,YAAiB,cAE1D,GAAgB,GAChB,EAAQ,GAAI,YAAW,IAGxB,GAAI,GAAI,EACJ,EAAM,EAAM,OACZ,EAAO,EAAI,EAEf,GAAI,GAAO,EAAG,MAAO,MAerB,GAbA,KAAK,WAAa,EAEd,KAAK,SAAW,GAEnB,CAAI,EACH,KAAK,OAAS,GACR,AAAI,EACV,KAAK,OAAS,GAAI,YAAW,IAE7B,KAAK,OAAS,GAAI,QAAO,KAIvB,KAAK,QAAU,EAAM,GAGxB,MAAI,GACH,KAAK,QAAU,EACT,AAAI,EACV,KAAK,OAAO,IAAK,EAAM,SAAS,EAAG,GAAM,KAAK,SAE9C,EAAM,KAAM,KAAK,OAAQ,KAAK,QAAS,EAAG,GAG3C,KAAK,SAAW,EACT,KAGR,GAAI,KAAK,QAAU,EACnB,CAEC,AAAI,EACH,KAAK,QAAU,EAAM,MAAM,EAAG,GAAK,KAAK,SAClC,AAAI,EACV,KAAK,OAAO,IAAK,EAAM,SAAS,EAAG,GAAK,KAAK,SAAU,KAAK,SAE5D,EAAM,KAAM,KAAK,OAAQ,KAAK,QAAS,EAAG,GAAK,KAAK,SAGrD,GAAI,GAAM,EACV,GAAI,EAAU,CACb,GAAI,GACJ,EAAQ,GACL,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAErE,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAO,EACP,EAAQ,GACL,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAErE,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAO,EACP,EAAQ,GACL,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAErE,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAO,EACP,EAAQ,GACL,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,GAC5D,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,GACjE,KAAK,OAAO,WAAW,EAAI,IAAM,EAAK,KAAK,OAAO,WAAW,EAAI,IAErE,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,QACrD,CACN,GAAI,GACJ,EAAQ,GACL,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE/C,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAO,EACP,EAAQ,GACL,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE/C,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAO,EACP,EAAQ,GACL,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE/C,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAO,EACP,EAAQ,GACL,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,GACtC,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,GAC3C,KAAK,OAAO,EAAI,IAAM,EAAK,KAAK,OAAO,EAAI,IAE/C,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAG5D,GAAK,GAAK,KAAK,QACf,KAAK,QAAU,EACX,GAAU,MAAK,OAAS,IAG7B,GAAI,GAAK,EAAO,GAChB,CACC,GAAI,GAAQ,EAAO,GAEnB,EACA,CACC,GAAI,EAAU,CACb,GAAI,GACJ,EAAQ,GACL,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAErD,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAK,EACL,EAAQ,GACL,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAErD,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAK,EACL,EAAQ,GACL,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAErD,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAK,EACL,EAAQ,GACL,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAErD,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,QACrD,CACN,GAAI,GACJ,EAAQ,GACL,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE/B,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAK,EACL,EAAQ,GACL,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE/B,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAK,EACL,EAAQ,GACL,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE/B,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAC3D,GAAK,EACL,EAAQ,GACL,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAE/B,KAAK,GAAG,IAAK,EAAM,SAAS,KAAa,KAAK,IAAI,SAAS,IAE5D,GAAK,QACG,GAAK,GAGf,MAAI,GAAI,GAGP,CAAI,EACH,KAAK,QAAU,EAAM,MAAM,GACrB,AAAI,EACV,KAAK,OAAO,IAAK,EAAM,SAAS,EAAG,GAAO,KAAK,SAE/C,EAAM,KAAM,KAAK,OAAQ,KAAK,QAAS,EAAG,GAG3C,KAAK,QAAU,EAAO,GAGhB,MAQR,GAAM,UAAU,OAAS,UAAY,CACpC,GAAI,GAAQ,KAAK,OACb,EAAW,MAAO,IAAS,SAC3B,EAAI,EACJ,EAAO,KAAK,QACZ,EAAK,EACL,EAAI,GAAI,IA4BZ,IA1BA,AAAI,KAAK,WAAa,GAErB,GAAM,KAAK,GAAG,QAAQ,KAAK,GAC3B,EAAI,IAAK,KAAK,GAAG,QAAQ,KAAK,IAC9B,EAAI,IAAK,KAAK,GAAG,QAAQ,KAAK,KAC9B,EAAI,IAAK,KAAK,GAAG,QAAQ,KAAK,KAE9B,EAAI,IAAK,KAAK,GAAG,SAAS,IAAW,KAAK,IAAI,SAAS,KACvD,EAAI,SAAS,IAAW,IAAI,IAE5B,EAAI,IAAK,KAAK,GAAG,SAAS,IAAW,KAAK,IAAI,SAAS,KACvD,EAAI,SAAS,IAAW,IAAI,IAE5B,EAAI,IAAK,KAAK,GAAG,SAAS,IAAW,KAAK,IAAI,SAAS,KACvD,EAAI,SAAS,IAAW,IAAI,IAE5B,EAAI,IAAK,KAAK,GAAG,SAAS,IAAW,KAAK,IAAI,SAAS,KACvD,EAAI,SAAS,IAAW,IAAI,KAI5B,EAAO,KAAK,KAAK,QAAQ,IAAK,IAG/B,EAAI,IAAK,EAAE,WAAW,KAAK,YAEpB,GAAK,EAAO,GAElB,AAAI,EACH,EAAE,SACA,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GACjD,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,IAGpD,EAAE,SACA,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC3B,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,IAG/B,EAAE,SAAS,IAAW,KAAK,IAAI,SAAS,IACxC,EACE,IAAI,GACJ,KAAK,IACL,SAAU,IACV,IAAK,IACP,GAAK,EA2BN,IAxBI,EAAI,GAAK,GACZ,CAAI,EACH,EAAE,SACA,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,GAC9C,EAAM,WAAW,EAAE,IAAM,EAAK,EAAM,WAAW,EAAE,GAClD,EACA,GAGF,EAAE,SACA,EAAM,EAAE,IAAM,EAAK,EAAM,GACxB,EAAM,EAAE,IAAM,EAAK,EAAM,EAAE,GAC5B,EACA,GAGH,EACE,IAAK,EAAE,SAAS,KAChB,KAAK,IACL,SAAU,IACV,IAAK,IACP,GAAK,GAGC,EAAI,GAEV,EAAE,SAAU,EAAW,EAAM,WAAW,KAAO,EAAM,KAAM,EAAG,EAAG,GACjE,EACE,IAAK,EAAE,SAAS,KAChB,KAAK,IACL,SAAS,IAGZ,SAAI,EAAI,QAAQ,WAAW,IAC3B,EAAI,IAAI,GAAG,SAAS,IAEpB,EAAI,EAAI,QAAQ,WAAW,IAC3B,EAAI,IAAI,GAAG,SAAS,IAEpB,EAAI,EAAI,QAAQ,WAAW,IAC3B,EAAI,IAAI,GAGR,KAAK,KAAM,KAAK,MAET,GAGR,GAAO,QAAU,KC3bjB,sBAAO,QAAU,CAChB,IAAK,KACJ,IAAK,QCFP,cAuBA,aACA,GAAI,IAAY,IAAQ,GAAK,UAAa,SAAS,EAAG,CAClD,GAAI,GAAI,MAAO,SAAW,YAAc,OAAO,SAAU,EAAI,GAAK,EAAE,GAAI,EAAI,EAC5E,GAAI,EAAG,MAAO,GAAE,KAAK,GACrB,GAAI,GAAK,MAAO,GAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAY,CACd,MAAI,IAAK,GAAK,EAAE,QAAQ,GAAI,QACrB,CAAE,MAAO,GAAK,EAAE,KAAM,KAAM,CAAC,KAG5C,KAAM,IAAI,WAAU,EAAI,0BAA4B,oCAEpD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAa,GAAgB,MAC7B,GAAW,KAQf,YAAuB,EAAM,EAAc,CAGvC,OAFI,GAAQ,GAAI,OAAM,GAClB,EAAc,MAAO,IAAiB,WAAc,EAAe,UAAY,CAAE,MAAO,IACnF,EAAM,EAAG,EAAM,EAAM,IAC1B,EAAM,GAAO,IAEjB,MAAO,GAEX,GAAQ,cAAgB,GAUxB,YAAmB,EAAO,EAAO,EAAM,CACnC,AAAI,IAAU,QACV,GAAQ,IAER,IAAS,QACT,GAAO,MAEX,GAAI,GAAI,GAAW,QAAQ,IAAI,EAAO,EAAO,GACzC,EAAI,GAAW,QAAQ,IAAI,EAAO,EAAO,GAC7C,GAAI,EACA,MAAO,CACH,MAAO,EAAE,WACT,OAAQ,EAAE,YAId,GAAI,GAAM,EAAE,SAAS,IACrB,AAAI,EAAI,OAAS,IACb,GAAM,IAAI,OAAO,GAAK,EAAI,QAAU,GAExC,GAAI,GAAM,EAAE,SAAS,IACrB,MAAI,GAAI,OAAS,IACb,GAAM,IAAI,OAAO,GAAK,EAAI,QAAU,GAEjC,CACH,MAAO,OAAO,GACd,OAAQ,OAAO,IAI3B,GAAQ,UAAY,GACpB,YAA2B,EAAO,EAAM,CACpC,AAAI,IAAS,QACT,GAAO,MAEX,GAAI,GAAI,GAAW,QAAQ,IAAI,EAAO,EAAO,GACzC,EAAI,GAAW,QAAQ,IAAI,EAAO,EAAO,GACzC,EAAM,EAAE,SAAS,IACrB,AAAI,EAAI,OAAS,IACb,GAAM,IAAI,OAAO,GAAK,EAAI,QAAU,GACxC,GAAI,GAAM,EAAE,SAAS,IACrB,MAAI,GAAI,OAAS,IACb,GAAM,IAAI,OAAO,GAAK,EAAI,QAAU,GACjC,CACH,MAAO,EACP,OAAQ,GAGhB,GAAQ,kBAAoB,GAQ5B,YAA2B,EAAK,EAAM,CAClC,AAAI,IAAS,QACT,GAAO,MAEX,GAAI,GAAM,GAAW,QAAQ,IAAI,EAAK,EAAO,GACzC,EAAM,GAAW,QAAQ,IAAI,EAAK,EAAO,GACzC,EAAY,EAAI,SAAS,IAC7B,AAAI,EAAU,OAAS,IACnB,GAAY,IAAI,OAAO,GAAK,EAAU,QAAU,GACpD,GAAI,GAAY,EAAI,SAAS,IAC7B,MAAI,GAAU,OAAS,IACnB,GAAY,IAAI,OAAO,GAAK,EAAU,QAAU,GAC7C,CACH,IAAK,CACD,MAAO,EAAI,WACX,OAAQ,EAAI,YAEhB,OAAQ,CACJ,MAAO,EACP,OAAQ,IAIpB,GAAQ,kBAAoB,GAc5B,YAAuB,EAAG,EAAO,EAAO,EAAM,CAC1C,MAAO,MAAK,IAAK,GAAQ,EAAI,GAAS,GAE1C,GAAQ,cAAgB,GAUxB,YAA4B,EAAS,EAAM,EAAQ,EAAM,CACrD,AAAI,IAAS,QACT,GAAO,MAEX,WAA+B,EAAG,EAAM,EAAM,EAAO,EAAS,CAE1D,GADI,IAAY,QAAU,GAAU,IAChC,EAAQ,SAAW,EACnB,MAAO,GAGP,GAAI,GAAS,GAAU,EAAM,GAAM,EAAO,EAAO,GAC7C,EAAM,GAAc,EAAG,EAAO,MAAO,EAAO,OAAQ,GACxD,MAAI,GAAQ,SAAS,IAMjB,EAAQ,KAAK,GACN,EAAsB,EAAI,EAAG,EAAM,EAAM,EAAO,GAInE,MAAO,GAAsB,EAAG,EAAS,EAAM,GAEnD,GAAQ,mBAAqB,GAS7B,YAAoB,EAAS,EAAM,EAAW,EAAM,CAChD,AAAI,IAAS,QACT,GAAO,MAGX,OADI,GAAM,GACD,EAAI,EAAG,GAAK,EAAW,IAAK,CACjC,GAAI,GAAS,GAAU,EAAS,GAAM,EAAO,EAAO,GACpD,EAAI,KAAK,GAAc,EAAG,EAAO,MAAO,EAAO,OAAQ,IAE3D,GAAI,EAAI,SAAW,EACf,KAAM,IAAI,OAAM,sDACpB,MAAO,GAEX,GAAQ,WAAa,GAUrB,YAAmB,EAAK,EAAK,EAAQ,CACjC,AAAI,IAAW,QACX,GAAS,KAAK,QAElB,EAAM,KAAK,KAAK,GAChB,EAAM,KAAK,MAAM,GACjB,GAAI,GAAK,IACT,MAAO,MAAK,MAAM,EAAM,GAAM,EAAM,IAAM,EAE9C,GAAQ,UAAY,GAQpB,YAAmB,EAAG,EAAG,CAGrB,OAFI,GAAS,KAAK,IAAI,EAAE,OAAQ,EAAE,QAC9B,EAAS,GAAS,OAAO,YAAY,GAAQ,KAAK,GAC7C,EAAI,EAAG,EAAI,EAAQ,EAAE,EAC1B,AAAI,EAAI,EAAE,QAAU,EAAI,EAAE,OACtB,EAAO,EAAS,EAAI,GAAK,EAAE,EAAE,OAAS,EAAI,GAAK,EAAE,EAAE,OAAS,EAAI,GAE/D,AAAI,EAAI,EAAE,QAAU,GAAK,EAAE,OAC5B,EAAO,EAAS,EAAI,IAAM,EAAE,EAAE,OAAS,EAAI,GAEtC,EAAI,EAAE,QAAU,GAAK,EAAE,QAC5B,GAAO,EAAS,EAAI,IAAM,EAAE,EAAE,OAAS,EAAI,IAOnD,OAHI,GAAQ,EACR,EAAK,EAAO,SACZ,EAAQ,EAAG,OACR,CAAC,EAAM,MAAQ,EAAM,QAAU,GAClC,IACA,EAAQ,EAAG,OAEf,GAAI,GAAO,EAAO,MAAM,GACxB,MAAO,GAEX,GAAQ,UAAY,GAOpB,YAAuB,EAAQ,CAC3B,GAAI,GAAK,EACT,GAAI,IAAW,MAAQ,CAAC,EACpB,MAAO,GACX,GAAI,CACA,OAAS,GAAW,GAAS,GAAS,EAAa,EAAS,OAAQ,CAAC,EAAW,KAAM,EAAa,EAAS,OAAQ,CAChH,GAAI,GAAQ,EAAW,MACvB,GAAI,IAAU,EACV,MAAO,UAIZ,EAAP,CAAgB,EAAM,CAAE,MAAO,UAC/B,CACI,GAAI,CACA,AAAI,GAAc,CAAC,EAAW,MAAS,GAAK,EAAS,SAAS,EAAG,KAAK,UAE1E,CAAU,GAAI,EAAK,KAAM,GAAI,OAEjC,MAAO,GAYX,GAAQ,cAAgB,GASxB,YAAmB,EAAM,EAAM,EAAQ,CAInC,OAHI,IAAS,QACT,GAAO,MAEH,OACC,IACD,MAAO,IAAW,QAAQ,IAAI,EAAM,GAAM,eACzC,IACD,MAAO,IAAW,QAAQ,IAAI,EAAM,GAAM,mBAE1C,MAAO,IAAW,QAAQ,IAAI,EAAM,GAAM,YAGtD,GAAQ,UAAY,GAUpB,YAAsB,EAAM,EAAM,EAAM,EAAQ,CAC5C,AAAI,IAAS,QACT,GAAO,MAEP,IAAS,QACT,GAAO,IAEP,IAAW,QACX,GAAS,IAEb,GAAI,GACJ,OAAQ,OACC,IACD,EAAO,GAAW,QAAQ,IAAI,EAAM,GACpC,UACC,IACD,EAAO,GAAW,QAAQ,IAAI,EAAM,GACpC,cAEA,EAAO,GAAW,QAAQ,IAAI,EAAM,GACpC,MAER,GAAI,GAAS,GACb,MAAI,KAAS,GACT,GAAS,EAAK,SAAS,GACnB,EAAO,OAAU,EAAS,GAC1B,GAAS,IAAI,OAAQ,EAAS,EAAK,EAAO,QAAU,IAGnD,IAAS,GACd,GAAS,GAAQ,EAAK,SAAS,KAC3B,EAAO,OAAS,GAChB,GAAS,IAAI,OAAO,EAAS,EAAO,QAAU,IAG/C,EAEX,GAAQ,aAAe,GAUvB,YAA0B,EAAM,EAAM,EAAM,EAAQ,CAChD,AAAI,IAAS,QACT,GAAO,MAEP,IAAS,QACT,GAAO,IAEP,IAAW,QACX,GAAS,IAEb,GAAI,GACJ,OAAQ,OACC,IACD,EAAO,GAAW,QAAQ,IAAI,EAAM,GACpC,UACC,IACD,EAAO,GAAW,QAAQ,IAAI,EAAM,GACpC,cAEA,EAAO,GAAW,QAAQ,IAAI,EAAM,GACpC,MAER,GAAI,GAAS,GACb,MAAI,KAAS,GACT,GAAS,EAAK,SAAS,GACnB,EAAO,OAAU,EAAS,GAC1B,GAAS,IAAI,OAAQ,EAAS,EAAK,EAAO,QAAU,IAGnD,IAAS,GACd,GAAS,GAAQ,EAAK,SAAS,KAC3B,EAAO,OAAS,GAChB,GAAS,IAAI,OAAO,EAAS,EAAO,QAAU,IAG/C,CAAE,IAAK,EAAK,WAAY,OAAQ,GAE3C,GAAQ,iBAAmB,GAM3B,aAA0B,CACtB,MAAO,aAEX,GAAQ,eAAiB,GAMzB,YAAgB,EAAG,CACf,MAAO,MAAK,KAAK,KAAK,IAAI,EAAG,KAAK,MAAM,KAAK,IAAI,GAAK,KAAK,IAAI,MAEnE,GAAQ,OAAS,GAMjB,YAAiB,EAAK,CAClB,MAAO,UAAS,EAAK,IAAI,SAAS,GAEtC,GAAQ,QAAU,GAMlB,YAAqB,EAAO,CACxB,MAAO,CAAC,IAAK,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAG,IAAI,SAAU,EAAG,CAAE,MAAQ,GAAI,GAAS,EAAI,EAAI,IAEzF,GAAQ,YAAc,GAMtB,YAAqB,EAAM,CACvB,MAAO,GAAK,OAAO,SAAU,EAAK,EAAK,EAAG,CACtC,GAAI,IAAQ,EACR,MAAO,GAEN,GAAI,IAAQ,EACb,MAAO,GAAM,KAAK,IAAI,EAAG,EAAI,GAG7B,KAAM,IAAI,OAAM,eAErB,GAEP,GAAQ,YAAc,KChetB,mBA2BA,AAAC,UAAS,EAAQ,EAAQ,EAAQ,CAElC,WAAc,EAAM,CAClB,GAAI,GAAK,KAAM,EAAO,IAEtB,EAAG,KAAO,UAAW,CACnB,GAAI,GAAI,QAAU,EAAG,GAAK,EAAG,EAAI,sBACjC,SAAG,GAAK,EAAG,GACX,EAAG,GAAK,EAAG,GACJ,EAAG,GAAK,EAAK,GAAG,EAAI,EAAI,IAIjC,EAAG,EAAI,EACP,EAAG,GAAK,EAAK,KACb,EAAG,GAAK,EAAK,KACb,EAAG,GAAK,EAAK,KACb,EAAG,IAAM,EAAK,GACV,EAAG,GAAK,GAAK,GAAG,IAAM,GAC1B,EAAG,IAAM,EAAK,GACV,EAAG,GAAK,GAAK,GAAG,IAAM,GAC1B,EAAG,IAAM,EAAK,GACV,EAAG,GAAK,GAAK,GAAG,IAAM,GAC1B,EAAO,KAGT,WAAc,EAAG,EAAG,CAClB,SAAE,EAAI,EAAE,EACR,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EAAE,GACF,EAGT,WAAc,EAAM,EAAM,CACxB,GAAI,GAAK,GAAI,GAAK,GACd,EAAQ,GAAQ,EAAK,MACrB,EAAO,EAAG,KACd,SAAK,MAAQ,UAAW,CAAE,MAAQ,GAAG,OAAS,WAAe,GAC7D,EAAK,OAAS,UAAW,CACvB,MAAO,KAAU,KAAS,QAAW,GAAK,uBAE5C,EAAK,MAAQ,EACT,GACE,OAAO,IAAU,UAAU,EAAK,EAAO,GAC3C,EAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,EAAI,MAErC,EAGT,YAAgB,CACd,GAAI,GAAI,WAEJ,EAAO,SAAS,EAAM,CACxB,EAAO,OAAO,GACd,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,GAAK,EAAK,WAAW,GACrB,GAAI,GAAI,mBAAsB,EAC9B,EAAI,IAAM,EACV,GAAK,EACL,GAAK,EACL,EAAI,IAAM,EACV,GAAK,EACL,GAAK,EAAI,WAEX,MAAQ,KAAM,GAAK,uBAGrB,MAAO,GAIT,AAAI,GAAU,EAAO,QACnB,EAAO,QAAU,EACZ,AAAI,GAAU,EAAO,IAC1B,EAAO,UAAW,CAAE,MAAO,KAE3B,KAAK,KAAO,IAIZ,GACC,MAAO,KAAW,UAAY,GAC9B,MAAO,SAAW,YAAc,UC9GnC,mBAGA,AAAC,UAAS,EAAQ,EAAQ,EAAQ,CAElC,WAAgB,EAAM,CACpB,GAAI,GAAK,KAAM,EAAU,GAEzB,EAAG,EAAI,EACP,EAAG,EAAI,EACP,EAAG,EAAI,EACP,EAAG,EAAI,EAGP,EAAG,KAAO,UAAW,CACnB,GAAI,GAAI,EAAG,EAAK,EAAG,GAAK,GACxB,SAAG,EAAI,EAAG,EACV,EAAG,EAAI,EAAG,EACV,EAAG,EAAI,EAAG,EACH,EAAG,GAAM,EAAG,IAAM,GAAM,EAAK,IAAM,GAG5C,AAAI,IAAU,GAAO,GAEnB,EAAG,EAAI,EAGP,GAAW,EAIb,OAAS,GAAI,EAAG,EAAI,EAAQ,OAAS,GAAI,IACvC,EAAG,GAAK,EAAQ,WAAW,GAAK,EAChC,EAAG,OAIP,WAAc,EAAG,EAAG,CAClB,SAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACD,EAGT,WAAc,EAAM,EAAM,CACxB,GAAI,GAAK,GAAI,GAAO,GAChB,EAAQ,GAAQ,EAAK,MACrB,EAAO,UAAW,CAAE,MAAQ,GAAG,SAAW,GAAK,YACnD,SAAK,OAAS,UAAW,CACvB,EACE,IAAI,GAAM,EAAG,SAAW,GACpB,EAAO,GAAG,SAAW,GAAK,WAC1B,EAAU,GAAM,GAAQ,IAAK,UAC1B,IAAW,GACpB,MAAO,IAET,EAAK,MAAQ,EAAG,KAChB,EAAK,MAAQ,EACT,GACE,OAAO,IAAU,UAAU,EAAK,EAAO,GAC3C,EAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,EAAI,MAErC,EAGT,AAAI,GAAU,EAAO,QACnB,EAAO,QAAU,EACZ,AAAI,GAAU,EAAO,IAC1B,EAAO,UAAW,CAAE,MAAO,KAE3B,KAAK,OAAS,IAId,GACC,MAAO,KAAW,UAAY,GAC9B,MAAO,SAAW,YAAc,UC7EnC,mBAGA,AAAC,UAAS,EAAQ,EAAQ,EAAQ,CAElC,WAAgB,EAAM,CACpB,GAAI,GAAK,KAAM,EAAU,GAGzB,EAAG,KAAO,UAAW,CACnB,GAAI,GAAK,EAAG,EAAK,EAAG,IAAM,EAC1B,SAAG,EAAI,EAAG,EAAG,EAAG,EAAI,EAAG,EAAG,EAAG,EAAI,EAAG,EAAG,EAAG,EAAI,EAAG,EACzC,GAAG,EAAK,EAAG,EAAI,OAAS,GAC5B,GAAG,EAAK,EAAG,EAAK,EAAG,GAAK,EAAO,GAAK,GAAK,IAAO,GAGtD,EAAG,EAAI,EACP,EAAG,EAAI,EACP,EAAG,EAAI,EACP,EAAG,EAAI,EACP,EAAG,EAAI,EAEP,AAAI,IAAU,GAAO,GAEnB,EAAG,EAAI,EAGP,GAAW,EAIb,OAAS,GAAI,EAAG,EAAI,EAAQ,OAAS,GAAI,IACvC,EAAG,GAAK,EAAQ,WAAW,GAAK,EAC5B,GAAK,EAAQ,QACf,GAAG,EAAI,EAAG,GAAK,GAAK,EAAG,IAAM,GAE/B,EAAG,OAIP,WAAc,EAAG,EAAG,CAClB,SAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACD,EAGT,WAAc,EAAM,EAAM,CACxB,GAAI,GAAK,GAAI,GAAO,GAChB,EAAQ,GAAQ,EAAK,MACrB,EAAO,UAAW,CAAE,MAAQ,GAAG,SAAW,GAAK,YACnD,SAAK,OAAS,UAAW,CACvB,EACE,IAAI,GAAM,EAAG,SAAW,GACpB,EAAO,GAAG,SAAW,GAAK,WAC1B,EAAU,GAAM,GAAQ,IAAK,UAC1B,IAAW,GACpB,MAAO,IAET,EAAK,MAAQ,EAAG,KAChB,EAAK,MAAQ,EACT,GACE,OAAO,IAAU,UAAU,EAAK,EAAO,GAC3C,EAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,EAAI,MAErC,EAGT,AAAI,GAAU,EAAO,QACnB,EAAO,QAAU,EACZ,AAAI,GAAU,EAAO,IAC1B,EAAO,UAAW,CAAE,MAAO,KAE3B,KAAK,OAAS,IAId,GACC,MAAO,KAAW,UAAY,GAC9B,MAAO,SAAW,YAAc,UClFnC,mBAKA,AAAC,UAAS,EAAQ,EAAQ,EAAQ,CAElC,WAAgB,EAAM,CACpB,GAAI,GAAK,KAGT,EAAG,KAAO,UAAW,CAEnB,GAAI,GAAI,EAAG,EAAG,EAAI,EAAG,EAAG,EAAG,EAAG,EAC9B,SAAI,EAAE,GAAI,GAAM,IAAM,EAAI,EAAI,EAAK,GAAK,GACxC,EAAI,EAAG,EAAI,EAAK,GAAI,GAAK,EAAK,IAAM,GACpC,EAAI,EAAG,EAAI,EAAK,GAAI,GAAK,EAAK,IAAM,EACpC,EAAI,EAAG,EAAI,EAAK,GAAI,GAAK,EAAK,GAAK,EACnC,EAAI,EAAG,EAAI,EAAK,GAAI,EAAI,EAAK,GAAK,GAAK,GAAK,EAAK,GAAK,EACtD,EAAE,GAAK,EACP,EAAG,EAAK,EAAI,EAAK,EACV,GAGT,WAAc,EAAI,EAAM,CACtB,GAAI,GAAG,EAAG,EAAI,GAEd,GAAI,IAAU,GAAO,GAEnB,EAAI,EAAE,GAAK,MAIX,KADA,EAAO,GAAK,EACP,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAC7B,EAAE,EAAI,GAAM,EAAE,EAAI,IAAM,GACnB,EAAK,WAAW,GAAK,EAAG,EAAI,EAAK,IAAM,GAIhD,KAAO,EAAE,OAAS,GAAG,EAAE,KAAK,GAC5B,IAAK,EAAI,EAAG,EAAI,GAAK,EAAE,KAAO,EAAG,EAAE,EAAE,CAOrC,IANA,AAAI,GAAK,EAAG,EAAI,EAAE,GAAK,GAAS,EAAI,EAAE,GAEtC,EAAG,EAAI,EACP,EAAG,EAAI,EAGF,EAAI,IAAK,EAAI,EAAG,EAAE,EACrB,EAAG,OAIP,EAAK,EAAI,GAGX,WAAc,EAAG,EAAG,CAClB,SAAE,EAAI,EAAE,EAAE,QACV,EAAE,EAAI,EAAE,EACD,EAGT,WAAc,EAAM,EAAM,CACxB,AAAI,GAAQ,MAAM,GAAO,CAAE,GAAI,OAC/B,GAAI,GAAK,GAAI,GAAO,GAChB,EAAQ,GAAQ,EAAK,MACrB,EAAO,UAAW,CAAE,MAAQ,GAAG,SAAW,GAAK,YACnD,SAAK,OAAS,UAAW,CACvB,EACE,IAAI,GAAM,EAAG,SAAW,GACpB,EAAO,GAAG,SAAW,GAAK,WAC1B,EAAU,GAAM,GAAQ,IAAK,UAC1B,IAAW,GACpB,MAAO,IAET,EAAK,MAAQ,EAAG,KAChB,EAAK,MAAQ,EACT,GACE,GAAM,GAAG,EAAK,EAAO,GACzB,EAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,EAAI,MAErC,EAGT,AAAI,GAAU,EAAO,QACnB,EAAO,QAAU,EACZ,AAAI,GAAU,EAAO,IAC1B,EAAO,UAAW,CAAE,MAAO,KAE3B,KAAK,UAAY,IAIjB,GACC,MAAO,KAAW,UAAY,GAC9B,MAAO,SAAW,YAAc,UC9FnC,mBAyBA,AAAC,UAAS,EAAQ,EAAQ,EAAQ,CAElC,WAAgB,EAAM,CACpB,GAAI,GAAK,KAGT,EAAG,KAAO,UAAW,CACnB,GAAI,GAAI,EAAG,EACP,EAAI,EAAG,EAAG,EAAI,EAAG,EAAG,EAAG,EAE3B,SAAG,EAAI,EAAK,EAAI,WAAc,EAE9B,EAAI,EAAG,EAAI,GAAM,KACjB,EAAI,EAAE,EAAM,EAAI,EAAK,KACrB,GAAK,GAAK,GACV,GAAK,GAAK,GACV,GAAK,IAAM,GACX,GAAK,IAAM,GAEX,EAAI,EAAE,GAAK,EAAI,EACf,EAAG,EAAI,EAEC,EAAK,GAAK,IAAM,IAAQ,GAGlC,WAAc,EAAI,EAAM,CACtB,GAAI,GAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAQ,IAYnC,IAXA,AAAI,IAAU,GAAO,GAEnB,GAAI,EACJ,EAAO,MAGP,GAAO,EAAO,KACd,EAAI,EACJ,EAAQ,KAAK,IAAI,EAAO,EAAK,SAG1B,EAAI,EAAG,EAAI,IAAK,EAAI,EAAO,EAAE,EAEhC,AAAI,GAAM,IAAK,EAAK,WAAY,GAAI,IAAM,EAAK,SAE3C,IAAM,GAAG,GAAI,GACjB,GAAK,GAAK,GACV,GAAK,IAAM,GACX,GAAK,GAAK,EACV,GAAK,IAAM,GACP,GAAK,GACP,GAAK,EAAI,WAAc,EACvB,EAAK,GAAE,EAAI,MAAS,EAAI,EACxB,EAAK,AAAK,GAAL,EAAU,EAAI,EAAI,GAW3B,IAPI,GAAK,KACP,IAAG,IAAQ,EAAK,QAAU,GAAK,KAAO,IAKxC,EAAI,IACC,EAAI,EAAI,IAAK,EAAI,EAAG,EAAE,EACzB,EAAI,GAAG,EAAI,GAAM,KACjB,EAAI,GAAE,EAAM,EAAI,EAAK,KACrB,GAAK,GAAK,GACV,GAAK,GAAK,GACV,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAE,GAAK,EAAI,EAGb,EAAG,EAAI,EACP,EAAG,EAAI,GACP,EAAG,EAAI,EAGT,EAAK,EAAI,GAGX,WAAc,EAAG,EAAG,CAClB,SAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EAAE,QACH,EAGT,WAAc,EAAM,EAAM,CACxB,AAAI,GAAQ,MAAM,GAAO,CAAE,GAAI,OAC/B,GAAI,GAAK,GAAI,GAAO,GAChB,EAAQ,GAAQ,EAAK,MACrB,EAAO,UAAW,CAAE,MAAQ,GAAG,SAAW,GAAK,YACnD,SAAK,OAAS,UAAW,CACvB,EACE,IAAI,GAAM,EAAG,SAAW,GACpB,EAAO,GAAG,SAAW,GAAK,WAC1B,EAAU,GAAM,GAAQ,IAAK,UAC1B,IAAW,GACpB,MAAO,IAET,EAAK,MAAQ,EAAG,KAChB,EAAK,MAAQ,EACT,GACE,GAAM,GAAG,EAAK,EAAO,GACzB,EAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,EAAI,MAErC,EAGT,AAAI,GAAU,EAAO,QACnB,EAAO,QAAU,EACZ,AAAI,GAAU,EAAO,IAC1B,EAAO,UAAW,CAAE,MAAO,KAE3B,KAAK,QAAU,IAIf,GACC,MAAO,KAAW,UAAY,GAC9B,MAAO,SAAW,YAAc,UChJnC,mBAIA,AAAC,UAAS,EAAQ,EAAQ,EAAQ,CAElC,WAAgB,EAAM,CACpB,GAAI,GAAK,KAAM,EAAU,GAGzB,EAAG,KAAO,UAAW,CACnB,GAAI,GAAI,EAAG,EAAG,EAAI,EAAG,EAAG,EAAI,EAAG,EAAG,EAAI,EAAG,EACzC,SAAK,GAAK,GAAO,IAAM,EAAK,EAC5B,EAAK,EAAI,EAAK,EACd,EAAK,GAAK,GAAO,IAAM,EAAK,EAC5B,EAAK,EAAI,EAAK,EACd,EAAG,EAAI,EAAK,GAAK,GAAO,IAAM,GAAM,EACpC,EAAG,EAAI,EAAK,EAAI,EAAK,EACrB,EAAG,EAAK,GAAK,GAAO,IAAM,GAAM,EACzB,EAAG,EAAK,EAAI,EAAK,GAmB1B,EAAG,EAAI,EACP,EAAG,EAAI,EACP,EAAG,EAAI,WAAa,EACpB,EAAG,EAAI,WAEP,AAAI,IAAS,KAAK,MAAM,GAEtB,GAAG,EAAK,EAAO,WAAe,EAC9B,EAAG,EAAI,EAAO,GAGd,GAAW,EAIb,OAAS,GAAI,EAAG,EAAI,EAAQ,OAAS,GAAI,IACvC,EAAG,GAAK,EAAQ,WAAW,GAAK,EAChC,EAAG,OAIP,WAAc,EAAG,EAAG,CAClB,SAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EACD,EAGT,WAAc,EAAM,EAAM,CACxB,GAAI,GAAK,GAAI,GAAO,GAChB,EAAQ,GAAQ,EAAK,MACrB,EAAO,UAAW,CAAE,MAAQ,GAAG,SAAW,GAAK,YACnD,SAAK,OAAS,UAAW,CACvB,EACE,IAAI,GAAM,EAAG,SAAW,GACpB,EAAO,GAAG,SAAW,GAAK,WAC1B,EAAU,GAAM,GAAQ,IAAK,UAC1B,IAAW,GACpB,MAAO,IAET,EAAK,MAAQ,EAAG,KAChB,EAAK,MAAQ,EACT,GACE,OAAO,IAAU,UAAU,EAAK,EAAO,GAC3C,EAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,EAAI,MAErC,EAGT,AAAI,GAAU,EAAO,QACnB,EAAO,QAAU,EACZ,AAAI,GAAU,EAAO,IAC1B,EAAO,UAAW,CAAE,MAAO,KAE3B,KAAK,OAAS,IAId,GACC,MAAO,KAAW,UAAY,GAC9B,MAAO,SAAW,YAAc,UCnGnC,mBAwBA,AAAC,UAAU,EAAQ,EAAM,EAAM,CAK/B,GAAI,GAAQ,IACR,EAAS,EACT,EAAS,GACT,EAAU,SACV,EAAa,EAAK,IAAI,EAAO,GAC7B,EAAe,EAAK,IAAI,EAAG,GAC3B,EAAW,EAAe,EAC1B,EAAO,EAAQ,EACf,EAMJ,WAAoB,EAAM,GAAS,GAAU,CAC3C,GAAI,GAAM,GACV,GAAW,IAAW,GAAQ,CAAE,QAAS,IAAU,IAAW,GAG9D,GAAI,IAAY,GAAO,EACrB,GAAQ,QAAU,CAAC,EAAM,GAAS,IACjC,GAAgB,IAAmB,GAAI,GAGtC,GAAO,GAAI,GAAK,GAIhB,GAAO,UAAW,CAIpB,OAHI,IAAI,GAAK,EAAE,GACX,GAAI,EACJ,GAAI,EACD,GAAI,GACT,GAAK,IAAI,IAAK,EACd,IAAK,EACL,GAAI,GAAK,EAAE,GAEb,KAAO,IAAK,GACV,IAAK,EACL,IAAK,EACL,MAAO,EAET,MAAQ,IAAI,IAAK,IAGnB,UAAK,MAAQ,UAAW,CAAE,MAAO,IAAK,EAAE,GAAK,GAC7C,GAAK,MAAQ,UAAW,CAAE,MAAO,IAAK,EAAE,GAAK,YAC7C,GAAK,OAAS,GAGd,GAAO,GAAS,GAAK,GAAI,GAGjB,IAAQ,MAAQ,IACpB,SAAS,GAAM,GAAM,GAAc,GAAO,CAUxC,MATI,KAEE,IAAM,GAAK,EAAK,GAAO,IAE3B,GAAK,MAAQ,UAAW,CAAE,MAAO,GAAK,GAAM,MAK1C,GAAgB,GAAK,GAAW,GAAa,IAIrC,KAElB,GACA,GACA,UAAY,IAAU,GAAQ,OAAU,MAAQ,EAChD,GAAQ,OAaV,WAAc,EAAK,CACjB,GAAI,IAAG,GAAS,EAAI,OAChB,EAAK,KAAM,GAAI,EAAG,GAAI,EAAG,EAAI,EAAG,EAAI,EAAG,GAAI,EAAG,EAAI,GAMtD,IAHK,IAAU,GAAM,CAAC,OAGf,GAAI,GACT,GAAE,IAAK,KAET,IAAK,GAAI,EAAG,GAAI,EAAO,KACrB,GAAE,IAAK,GAAE,GAAI,EAAQ,GAAI,EAAI,GAAI,IAAW,IAAI,GAAE,MAClD,GAAE,IAAK,GAIT,AAAC,GAAG,EAAI,SAAS,GAAO,CAItB,OAFI,IAAG,GAAI,EACP,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACxB,MACL,GAAI,GAAE,GAAI,EAAQ,GAAI,GACtB,GAAI,GAAI,EAAQ,GAAE,EAAS,IAAE,IAAK,GAAE,GAAI,EAAQ,GAAI,KAAQ,IAAE,IAAK,KAErE,SAAG,EAAI,GAAG,EAAG,EAAI,GACV,KAIN,GAOL,WAAc,EAAG,GAAG,CAClB,UAAE,EAAI,EAAE,EACR,GAAE,EAAI,EAAE,EACR,GAAE,EAAI,EAAE,EAAE,QACH,GAOT,WAAiB,EAAK,GAAO,CAC3B,GAAI,IAAS,GAAI,EAAO,MAAO,GAAM,GACrC,GAAI,IAAS,GAAO,SAClB,IAAK,KAAQ,GACX,GAAI,CAAE,GAAO,KAAK,EAAQ,EAAI,IAAO,GAAQ,UAAc,GAAP,EAGxD,MAAQ,IAAO,OAAS,GAAS,GAAO,SAAW,EAAM,EAAM,KAQjE,YAAgB,EAAM,GAAK,CAEzB,OADI,IAAa,EAAO,GAAI,EAAO,GAAI,EAChC,GAAI,GAAW,QACpB,GAAI,EAAO,IACT,EAAS,IAAS,GAAI,EAAO,IAAK,IAAM,GAAW,WAAW,MAElE,MAAO,IAAS,IAQlB,YAAoB,CAClB,GAAI,CACF,GAAI,GACJ,MAAI,IAAe,GAAM,EAAW,aAElC,EAAM,EAAI,GAEV,GAAM,GAAI,YAAW,GACpB,GAAO,QAAU,EAAO,UAAU,gBAAgB,IAE9C,GAAS,SACT,EAAP,CACA,GAAI,IAAU,EAAO,UACjB,GAAU,IAAW,GAAQ,QACjC,MAAO,CAAC,CAAC,GAAI,MAAM,EAAQ,GAAS,EAAO,OAAQ,GAAS,KAQhE,YAAkB,EAAG,CACnB,MAAO,QAAO,aAAa,MAAM,EAAG,GAgBtC,GANA,GAAO,EAAK,SAAU,GAMjB,MAAO,KAAW,UAAY,GAAO,QAAS,CACjD,GAAO,QAAU,EAEjB,GAAI,CACF,EAAa,WACN,EAAP,OACG,AAAK,OAAO,SAAW,YAAc,OAAO,IACjD,OAAO,UAAW,CAAE,MAAO,KAG3B,EAAK,OAAS,GAAW,IAQxB,MAAO,OAAS,YAAe,KAAO,GACvC,GACA,QC3PF,mBAYA,GAAI,IAAO,KAKP,GAAS,KAKT,GAAS,KAQT,GAAY,KASZ,GAAU,KAOV,GAAS,KAIT,GAAK,KAET,GAAG,KAAO,GACV,GAAG,OAAS,GACZ,GAAG,OAAS,GACZ,GAAG,UAAY,GACf,GAAG,QAAU,GACb,GAAG,OAAS,GAEZ,GAAO,QAAU,KC3DjB,cAuBA,aACA,GAAI,IAAgB,IAAQ,GAAK,cAAiB,SAAU,EAAK,CAC7D,GAAI,GAAO,EAAI,WAAY,MAAO,GAClC,GAAI,GAAS,GACb,GAAI,GAAO,KAAM,OAAS,KAAK,GAAK,AAAI,OAAO,eAAe,KAAK,EAAK,IAAI,GAAO,GAAK,EAAI,IAC5F,SAAO,QAAa,EACb,GAEP,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAQ,GAAa,MACrB,GAAe,GAAgB,MAM/B,GAA4B,UAAY,CACxC,YAAsB,CAClB,KAAK,MAAQ,GAAM,iBACnB,KAAK,KAAO,GAAa,QAAQ,GAAK,KAAK,OAE/C,cAAO,eAAe,EAAW,UAAW,OAAQ,CAIhD,IAAK,UAAY,CACb,MAAO,MAAK,OAMhB,IAAK,SAAU,EAAM,CACjB,KAAK,MAAQ,EACb,KAAK,KAAO,GAAa,QAAQ,GAAK,KAAK,QAE/C,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAW,UAAW,SAAU,CAKlD,IAAK,UAAY,CACb,MAAO,MAAK,MAEhB,WAAY,GACZ,aAAc,KAKlB,EAAW,UAAU,WAAa,UAAY,CAC1C,KAAM,IAAI,OAAM,oBAOpB,EAAW,SAAW,SAAU,EAAM,CAClC,KAAM,IAAI,OAAM,oBAEb,KAEX,GAAQ,QAAU,KC5FlB,cAcA,GAAI,IACJ,AAAC,UAAU,EAAS,CAGhB,AAAC,UAAU,EAAS,CAChB,GAAI,GAAO,MAAO,SAAW,SAAW,OACpC,MAAO,OAAS,SAAW,KACvB,MAAO,OAAS,SAAW,KACvB,SAAS,kBACjB,EAAW,EAAa,GAC5B,AAAI,MAAO,GAAK,SAAY,YACxB,EAAK,QAAU,EAGf,EAAW,EAAa,EAAK,QAAS,GAE1C,EAAQ,GACR,WAAsB,EAAQ,EAAU,CACpC,MAAO,UAAU,EAAK,EAAO,CACzB,AAAI,MAAO,GAAO,IAAS,YACvB,OAAO,eAAe,EAAQ,EAAK,CAAE,aAAc,GAAM,SAAU,GAAM,MAAO,IAEhF,GACA,EAAS,EAAK,OAG3B,SAAU,EAAU,CACnB,GAAI,GAAS,OAAO,UAAU,eAE1B,EAAiB,MAAO,SAAW,WACnC,EAAoB,GAAkB,MAAO,QAAO,aAAgB,YAAc,OAAO,YAAc,gBACvG,EAAiB,GAAkB,MAAO,QAAO,UAAa,YAAc,OAAO,SAAW,aAC9F,EAAiB,MAAO,QAAO,QAAW,WAC1C,EAAgB,CAAE,UAAW,aAAgB,OAC7C,EAAY,CAAC,GAAkB,CAAC,EAChC,EAAU,CAEV,OAAQ,EACF,UAAY,CAAE,MAAO,IAAe,OAAO,OAAO,QAClD,EACI,UAAY,CAAE,MAAO,IAAe,CAAE,UAAW,QACjD,UAAY,CAAE,MAAO,IAAe,KAC9C,IAAK,EACC,SAAU,EAAK,GAAK,CAAE,MAAO,GAAO,KAAK,EAAK,KAC9C,SAAU,EAAK,GAAK,CAAE,MAAO,MAAO,IAC1C,IAAK,EACC,SAAU,EAAK,GAAK,CAAE,MAAO,GAAO,KAAK,EAAK,IAAO,EAAI,IAAO,QAChE,SAAU,EAAK,GAAK,CAAE,MAAO,GAAI,MAGvC,EAAoB,OAAO,eAAe,UAC1C,EAAc,MAAO,UAAY,UAAY,QAAQ,KAAO,QAAQ,IAAI,oCAAyC,OACjH,EAAO,CAAC,GAAe,MAAO,MAAQ,YAAc,MAAO,KAAI,UAAU,SAAY,WAAa,IAAM,KACxG,EAAO,CAAC,GAAe,MAAO,MAAQ,YAAc,MAAO,KAAI,UAAU,SAAY,WAAa,IAAM,KACxG,EAAW,CAAC,GAAe,MAAO,UAAY,WAAa,QAAU,KAGrE,EAAW,GAAI,GAwCnB,YAAkB,EAAY,GAAQ,GAAa,GAAY,CAC3D,GAAK,GAAY,IAYZ,CACD,GAAI,CAAC,GAAQ,GACT,KAAM,IAAI,WACd,GAAI,CAAC,GAAc,IACf,KAAM,IAAI,WACd,MAAO,IAAoB,EAAY,QAjBZ,CAC3B,GAAI,CAAC,GAAQ,GACT,KAAM,IAAI,WACd,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,GAAI,CAAC,GAAS,KAAe,CAAC,GAAY,KAAe,CAAC,GAAO,IAC7D,KAAM,IAAI,WACd,MAAI,IAAO,KACP,IAAa,QACjB,GAAc,GAAc,IACrB,GAAiB,EAAY,GAAQ,GAAa,KAUjE,EAAS,WAAY,IA2CrB,WAAkB,EAAa,GAAe,CAC1C,YAAmB,GAAQ,GAAa,CACpC,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,GAAI,CAAC,GAAY,KAAgB,CAAC,GAAc,IAC5C,KAAM,IAAI,WACd,GAA0B,EAAa,GAAe,GAAQ,IAElE,MAAO,IAEX,EAAS,WAAY,GAwCrB,YAAwB,EAAa,GAAe,GAAQ,GAAa,CACrE,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAA0B,EAAa,GAAe,GAAQ,IAEzE,EAAS,iBAAkB,IAmC3B,WAAqB,EAAa,GAAQ,GAAa,CACnD,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAAoB,EAAa,GAAQ,IAEpD,EAAS,cAAe,GAmCxB,YAAwB,EAAa,GAAQ,GAAa,CACtD,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAAuB,EAAa,GAAQ,IAEvD,EAAS,iBAAkB,IAmC3B,YAAqB,EAAa,GAAQ,GAAa,CACnD,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAAoB,EAAa,GAAQ,IAEpD,EAAS,cAAe,IAmCxB,WAAwB,EAAa,GAAQ,GAAa,CACtD,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAAuB,EAAa,GAAQ,IAEvD,EAAS,iBAAkB,GAkC3B,YAAyB,EAAQ,GAAa,CAC1C,GAAI,CAAC,GAAS,GACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAAqB,EAAQ,IAExC,EAAS,kBAAmB,IAkC5B,YAA4B,EAAQ,GAAa,CAC7C,GAAI,CAAC,GAAS,GACV,KAAM,IAAI,WACd,MAAK,IAAY,KACb,IAAc,GAAc,KACzB,GAAwB,EAAQ,IAE3C,EAAS,qBAAsB,IAmC/B,YAAwB,EAAa,GAAQ,GAAa,CACtD,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,AAAK,GAAY,KACb,IAAc,GAAc,KAChC,GAAI,IAAc,GAAuB,GAAQ,GAAwB,IAGzE,GAFI,GAAY,KAEZ,CAAC,GAAY,OAAO,GACpB,MAAO,GACX,GAAI,GAAY,KAAO,EACnB,MAAO,GACX,GAAI,IAAiB,EAAS,IAAI,IAElC,MADA,IAAe,OAAO,IAClB,GAAe,KAAO,GAE1B,EAAS,OAAO,IACT,GAEX,EAAS,iBAAkB,IAC3B,YAA6B,EAAY,GAAQ,CAC7C,OAAS,IAAI,EAAW,OAAS,EAAG,IAAK,EAAG,EAAE,GAAG,CAC7C,GAAI,IAAY,EAAW,IACvB,GAAY,GAAU,IAC1B,GAAI,CAAC,GAAY,KAAc,CAAC,GAAO,IAAY,CAC/C,GAAI,CAAC,GAAc,IACf,KAAM,IAAI,WACd,GAAS,IAGjB,MAAO,IAEX,YAA0B,EAAY,GAAQ,GAAa,GAAY,CACnE,OAAS,IAAI,EAAW,OAAS,EAAG,IAAK,EAAG,EAAE,GAAG,CAC7C,GAAI,IAAY,EAAW,IACvB,GAAY,GAAU,GAAQ,GAAa,IAC/C,GAAI,CAAC,GAAY,KAAc,CAAC,GAAO,IAAY,CAC/C,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,GAAa,IAGrB,MAAO,IAEX,YAAgC,EAAG,GAAG,GAAQ,CAC1C,GAAI,IAAiB,EAAS,IAAI,GAClC,GAAI,GAAY,IAAiB,CAC7B,GAAI,CAAC,GACD,OACJ,GAAiB,GAAI,GACrB,EAAS,IAAI,EAAG,IAEpB,GAAI,IAAc,GAAe,IAAI,IACrC,GAAI,GAAY,IAAc,CAC1B,GAAI,CAAC,GACD,OACJ,GAAc,GAAI,GAClB,GAAe,IAAI,GAAG,IAE1B,MAAO,IAIX,YAA6B,EAAa,GAAG,GAAG,CAC5C,GAAI,IAAS,GAAuB,EAAa,GAAG,IACpD,GAAI,GACA,MAAO,GACX,GAAI,IAAS,GAAuB,IACpC,MAAK,IAAO,IAEL,GADI,GAAoB,EAAa,GAAQ,IAKxD,YAAgC,EAAa,GAAG,GAAG,CAC/C,GAAI,IAAc,GAAuB,GAAG,GAAc,IAC1D,MAAI,IAAY,IACL,GACJ,GAAU,GAAY,IAAI,IAIrC,YAA6B,EAAa,GAAG,GAAG,CAC5C,GAAI,IAAS,GAAuB,EAAa,GAAG,IACpD,GAAI,GACA,MAAO,IAAuB,EAAa,GAAG,IAClD,GAAI,IAAS,GAAuB,IACpC,GAAI,CAAC,GAAO,IACR,MAAO,IAAoB,EAAa,GAAQ,IAKxD,YAAgC,EAAa,GAAG,GAAG,CAC/C,GAAI,IAAc,GAAuB,GAAG,GAAc,IAC1D,GAAI,IAAY,IAEhB,MAAO,IAAY,IAAI,GAI3B,YAAmC,EAAa,GAAe,GAAG,GAAG,CACjE,GAAI,IAAc,GAAuB,GAAG,GAAc,IAC1D,GAAY,IAAI,EAAa,IAIjC,YAA8B,EAAG,GAAG,CAChC,GAAI,IAAU,GAAwB,EAAG,IACrC,GAAS,GAAuB,GACpC,GAAI,KAAW,KACX,MAAO,IACX,GAAI,IAAa,GAAqB,GAAQ,IAC9C,GAAI,GAAW,QAAU,EACrB,MAAO,IACX,GAAI,GAAQ,QAAU,EAClB,MAAO,IAGX,OAFI,IAAM,GAAI,GACV,GAAO,GACF,GAAK,EAAG,GAAY,GAAS,GAAK,GAAU,OAAQ,KAAM,CAC/D,GAAI,IAAM,GAAU,IAChB,GAAS,GAAI,IAAI,IACrB,AAAK,IACD,IAAI,IAAI,IACR,GAAK,KAAK,KAGlB,OAAS,IAAK,EAAG,GAAe,GAAY,GAAK,GAAa,OAAQ,KAAM,CACxE,GAAI,IAAM,GAAa,IACnB,GAAS,GAAI,IAAI,IACrB,AAAK,IACD,IAAI,IAAI,IACR,GAAK,KAAK,KAGlB,MAAO,IAIX,YAAiC,EAAG,GAAG,CACnC,GAAI,IAAO,GACP,GAAc,GAAuB,EAAG,GAAc,IAC1D,GAAI,GAAY,IACZ,MAAO,IAIX,OAHI,IAAU,GAAY,OACtB,GAAW,GAAY,IACvB,GAAI,IACK,CACT,GAAI,IAAO,GAAa,IACxB,GAAI,CAAC,GACD,UAAK,OAAS,GACP,GAEX,GAAI,IAAY,GAAc,IAC9B,GAAI,CACA,GAAK,IAAK,SAEP,GAAP,CACI,GAAI,CACA,GAAc,WAElB,CACI,KAAM,KAGd,MAKR,YAAc,EAAG,CACb,GAAI,IAAM,KACN,MAAO,GACX,OAAQ,MAAO,QACN,YAAa,MAAO,OACpB,UAAW,MAAO,OAClB,SAAU,MAAO,OACjB,SAAU,MAAO,OACjB,SAAU,MAAO,OACjB,SAAU,MAAO,KAAM,KAAO,EAAe,UACzC,MAAO,IAKxB,YAAqB,EAAG,CACpB,MAAO,KAAM,OAIjB,YAAgB,EAAG,CACf,MAAO,KAAM,KAIjB,YAAkB,EAAG,CACjB,MAAO,OAAO,IAAM,SAIxB,YAAkB,EAAG,CACjB,MAAO,OAAO,IAAM,SAAW,IAAM,KAAO,MAAO,IAAM,WAM7D,WAAqB,EAAO,GAAe,CACvC,OAAQ,GAAK,QACJ,GAAmB,MAAO,OAC1B,GAAc,MAAO,OACrB,GAAiB,MAAO,OACxB,GAAgB,MAAO,OACvB,GAAgB,MAAO,OACvB,GAAgB,MAAO,GAEhC,GAAI,IAAO,KAAkB,EAAiB,SAAW,KAAkB,EAAiB,SAAW,UACnG,GAAe,GAAU,EAAO,GACpC,GAAI,KAAiB,OAAW,CAC5B,GAAI,IAAS,GAAa,KAAK,EAAO,IACtC,GAAI,GAAS,IACT,KAAM,IAAI,WACd,MAAO,IAEX,MAAO,IAAoB,EAAO,KAAS,UAAY,SAAW,IAItE,YAA6B,EAAG,GAAM,CAClC,GAAI,KAAS,SAAU,CACnB,GAAI,IAAa,EAAE,SACnB,GAAI,GAAW,IAAa,CACxB,GAAI,IAAS,GAAW,KAAK,GAC7B,GAAI,CAAC,GAAS,IACV,MAAO,IAEf,GAAI,IAAU,EAAE,QAChB,GAAI,GAAW,IAAU,CACrB,GAAI,IAAS,GAAQ,KAAK,GAC1B,GAAI,CAAC,GAAS,IACV,MAAO,SAGd,CACD,GAAI,IAAU,EAAE,QAChB,GAAI,GAAW,IAAU,CACrB,GAAI,IAAS,GAAQ,KAAK,GAC1B,GAAI,CAAC,GAAS,IACV,MAAO,IAEf,GAAI,IAAa,EAAE,SACnB,GAAI,GAAW,IAAa,CACxB,GAAI,IAAS,GAAW,KAAK,GAC7B,GAAI,CAAC,GAAS,IACV,MAAO,KAGnB,KAAM,IAAI,WAId,YAAmB,EAAU,CACzB,MAAO,CAAC,CAAC,EAIb,YAAkB,EAAU,CACxB,MAAO,GAAK,EAIhB,YAAuB,EAAU,CAC7B,GAAI,IAAM,EAAY,EAAU,GAChC,MAAI,IAAS,IACF,GACJ,GAAS,IAMpB,YAAiB,EAAU,CACvB,MAAO,OAAM,QACP,MAAM,QAAQ,GACd,YAAoB,QAChB,YAAoB,OACpB,OAAO,UAAU,SAAS,KAAK,KAAc,iBAI3D,YAAoB,EAAU,CAE1B,MAAO,OAAO,IAAa,WAI/B,YAAuB,EAAU,CAE7B,MAAO,OAAO,IAAa,WAI/B,YAAuB,EAAU,CAC7B,OAAQ,GAAK,QACJ,GAAgB,MAAO,OACvB,GAAgB,MAAO,WACnB,MAAO,IAOxB,YAAmB,EAAG,GAAG,CACrB,GAAI,IAAO,EAAE,IACb,GAAI,AAAsB,IAAS,KAEnC,IAAI,CAAC,GAAW,IACZ,KAAM,IAAI,WACd,MAAO,KAIX,YAAqB,EAAK,CACtB,GAAI,IAAS,GAAU,EAAK,GAC5B,GAAI,CAAC,GAAW,IACZ,KAAM,IAAI,WACd,GAAI,IAAW,GAAO,KAAK,GAC3B,GAAI,CAAC,GAAS,IACV,KAAM,IAAI,WACd,MAAO,IAIX,YAAuB,EAAY,CAC/B,MAAO,GAAW,MAItB,YAAsB,EAAU,CAC5B,GAAI,IAAS,EAAS,OACtB,MAAO,IAAO,KAAO,GAAQ,GAIjC,YAAuB,EAAU,CAC7B,GAAI,IAAI,EAAS,OACjB,AAAI,IACA,GAAE,KAAK,GAMf,YAAgC,EAAG,CAC/B,GAAI,IAAQ,OAAO,eAAe,GAUlC,GATI,MAAO,IAAM,YAAc,IAAM,GASjC,KAAU,EACV,MAAO,IAEX,GAAI,IAAY,EAAE,UACd,GAAiB,IAAa,OAAO,eAAe,IACxD,GAAI,IAAkB,MAAQ,KAAmB,OAAO,UACpD,MAAO,IAEX,GAAI,IAAc,GAAe,YAIjC,MAHI,OAAO,KAAgB,YAGvB,KAAgB,EACT,GAEJ,GAGX,aAA6B,CACzB,GAAI,GAAgB,GAChB,GAAgB,GAChB,GAA6B,UAAY,CACzC,YAAqB,GAAM,GAAQ,GAAU,CACzC,KAAK,OAAS,EACd,KAAK,MAAQ,GACb,KAAK,QAAU,GACf,KAAK,UAAY,GAErB,UAAY,UAAU,cAAgB,UAAY,CAAE,MAAO,OAC3D,GAAY,UAAU,GAAkB,UAAY,CAAE,MAAO,OAC7D,GAAY,UAAU,KAAO,UAAY,CACrC,GAAI,IAAQ,KAAK,OACjB,GAAI,IAAS,GAAK,GAAQ,KAAK,MAAM,OAAQ,CACzC,GAAI,IAAS,KAAK,UAAU,KAAK,MAAM,IAAQ,KAAK,QAAQ,KAC5D,MAAI,IAAQ,GAAK,KAAK,MAAM,OACxB,MAAK,OAAS,GACd,KAAK,MAAQ,GACb,KAAK,QAAU,IAGf,KAAK,SAEF,CAAE,MAAO,GAAQ,KAAM,IAElC,MAAO,CAAE,MAAO,OAAW,KAAM,KAErC,GAAY,UAAU,MAAQ,SAAU,GAAO,CAC3C,KAAI,MAAK,QAAU,GACf,MAAK,OAAS,GACd,KAAK,MAAQ,GACb,KAAK,QAAU,IAEb,IAEV,GAAY,UAAU,OAAS,SAAU,GAAO,CAC5C,MAAI,MAAK,QAAU,GACf,MAAK,OAAS,GACd,KAAK,MAAQ,GACb,KAAK,QAAU,IAEZ,CAAE,MAAO,GAAO,KAAM,KAE1B,MAEX,MAAsB,WAAY,CAC9B,aAAe,CACX,KAAK,MAAQ,GACb,KAAK,QAAU,GACf,KAAK,UAAY,EACjB,KAAK,YAAc,GAEvB,cAAO,eAAe,GAAI,UAAW,OAAQ,CACzC,IAAK,UAAY,CAAE,MAAO,MAAK,MAAM,QACrC,WAAY,GACZ,aAAc,KAElB,GAAI,UAAU,IAAM,SAAU,GAAK,CAAE,MAAO,MAAK,MAAM,GAAgB,KAAU,GACjF,GAAI,UAAU,IAAM,SAAU,GAAK,CAC/B,GAAI,IAAQ,KAAK,MAAM,GAAgB,IACvC,MAAO,KAAS,EAAI,KAAK,QAAQ,IAAS,QAE9C,GAAI,UAAU,IAAM,SAAU,GAAK,GAAO,CACtC,GAAI,IAAQ,KAAK,MAAM,GAAgB,IACvC,YAAK,QAAQ,IAAS,GACf,MAEX,GAAI,UAAU,OAAS,SAAU,GAAK,CAClC,GAAI,IAAQ,KAAK,MAAM,GAAgB,IACvC,GAAI,IAAS,EAAG,CAEZ,OADI,IAAO,KAAK,MAAM,OACb,GAAI,GAAQ,EAAG,GAAI,GAAM,KAC9B,KAAK,MAAM,GAAI,GAAK,KAAK,MAAM,IAC/B,KAAK,QAAQ,GAAI,GAAK,KAAK,QAAQ,IAEvC,YAAK,MAAM,SACX,KAAK,QAAQ,SACT,KAAQ,KAAK,WACb,MAAK,UAAY,EACjB,KAAK,YAAc,IAEhB,GAEX,MAAO,IAEX,GAAI,UAAU,MAAQ,UAAY,CAC9B,KAAK,MAAM,OAAS,EACpB,KAAK,QAAQ,OAAS,EACtB,KAAK,UAAY,EACjB,KAAK,YAAc,IAEvB,GAAI,UAAU,KAAO,UAAY,CAAE,MAAO,IAAI,IAAY,KAAK,MAAO,KAAK,QAAS,KACpF,GAAI,UAAU,OAAS,UAAY,CAAE,MAAO,IAAI,IAAY,KAAK,MAAO,KAAK,QAAS,KACtF,GAAI,UAAU,QAAU,UAAY,CAAE,MAAO,IAAI,IAAY,KAAK,MAAO,KAAK,QAAS,KACvF,GAAI,UAAU,cAAgB,UAAY,CAAE,MAAO,MAAK,WACxD,GAAI,UAAU,GAAkB,UAAY,CAAE,MAAO,MAAK,WAC1D,GAAI,UAAU,MAAQ,SAAU,GAAK,GAAQ,CACzC,MAAI,MAAK,YAAc,IACnB,MAAK,YAAc,KAAK,MAAM,QAAQ,KAAK,UAAY,KAEvD,KAAK,YAAc,GAAK,IACxB,MAAK,YAAc,KAAK,MAAM,OAC9B,KAAK,MAAM,KAAK,IAChB,KAAK,QAAQ,KAAK,SAEf,KAAK,aAET,MAEX,YAAgB,GAAK,GAAG,CACpB,MAAO,IAEX,YAAkB,GAAG,GAAO,CACxB,MAAO,IAEX,YAAkB,GAAK,GAAO,CAC1B,MAAO,CAAC,GAAK,KAIrB,aAA6B,CACzB,MAAsB,WAAY,CAC9B,YAAe,CACX,KAAK,KAAO,GAAI,GAEpB,cAAO,eAAe,EAAI,UAAW,OAAQ,CACzC,IAAK,UAAY,CAAE,MAAO,MAAK,KAAK,MACpC,WAAY,GACZ,aAAc,KAElB,EAAI,UAAU,IAAM,SAAU,GAAO,CAAE,MAAO,MAAK,KAAK,IAAI,KAC5D,EAAI,UAAU,IAAM,SAAU,GAAO,CAAE,MAAO,MAAK,KAAK,IAAI,GAAO,IAAQ,MAC3E,EAAI,UAAU,OAAS,SAAU,GAAO,CAAE,MAAO,MAAK,KAAK,OAAO,KAClE,EAAI,UAAU,MAAQ,UAAY,CAAE,KAAK,KAAK,SAC9C,EAAI,UAAU,KAAO,UAAY,CAAE,MAAO,MAAK,KAAK,QACpD,EAAI,UAAU,OAAS,UAAY,CAAE,MAAO,MAAK,KAAK,UACtD,EAAI,UAAU,QAAU,UAAY,CAAE,MAAO,MAAK,KAAK,WACvD,EAAI,UAAU,cAAgB,UAAY,CAAE,MAAO,MAAK,QACxD,EAAI,UAAU,GAAkB,UAAY,CAAE,MAAO,MAAK,QACnD,KAIf,aAAiC,CAC7B,GAAI,GAAY,GACZ,GAAO,EAAQ,SACf,GAAU,KACd,MAAsB,WAAY,CAC9B,aAAmB,CACf,KAAK,KAAO,KAEhB,UAAQ,UAAU,IAAM,SAAU,GAAQ,CACtC,GAAI,IAAQ,GAAwB,GAAmB,IACvD,MAAO,MAAU,OAAY,EAAQ,IAAI,GAAO,KAAK,MAAQ,IAEjE,GAAQ,UAAU,IAAM,SAAU,GAAQ,CACtC,GAAI,IAAQ,GAAwB,GAAmB,IACvD,MAAO,MAAU,OAAY,EAAQ,IAAI,GAAO,KAAK,MAAQ,QAEjE,GAAQ,UAAU,IAAM,SAAU,GAAQ,GAAO,CAC7C,GAAI,IAAQ,GAAwB,GAAmB,IACvD,UAAM,KAAK,MAAQ,GACZ,MAEX,GAAQ,UAAU,OAAS,SAAU,GAAQ,CACzC,GAAI,IAAQ,GAAwB,GAAmB,IACvD,MAAO,MAAU,OAAY,MAAO,IAAM,KAAK,MAAQ,IAE3D,GAAQ,UAAU,MAAQ,UAAY,CAElC,KAAK,KAAO,MAET,MAEX,aAA2B,CACvB,GAAI,IACJ,EACI,IAAM,cAAgB,WACnB,EAAQ,IAAI,GAAM,KACzB,UAAK,IAAO,GACL,GAEX,YAAiC,GAAQ,GAAQ,CAC7C,GAAI,CAAC,EAAO,KAAK,GAAQ,IAAU,CAC/B,GAAI,CAAC,GACD,OACJ,OAAO,eAAe,GAAQ,GAAS,CAAE,MAAO,EAAQ,WAE5D,MAAO,IAAO,IAElB,YAAyB,GAAQ,GAAM,CACnC,OAAS,IAAI,EAAG,GAAI,GAAM,EAAE,GACxB,GAAO,IAAK,KAAK,SAAW,IAAO,EACvC,MAAO,IAEX,YAAwB,GAAM,CAC1B,MAAI,OAAO,aAAe,WAClB,MAAO,SAAW,YACX,OAAO,gBAAgB,GAAI,YAAW,KAC7C,MAAO,WAAa,YACb,SAAS,gBAAgB,GAAI,YAAW,KAC5C,GAAgB,GAAI,YAAW,IAAO,IAE1C,GAAgB,GAAI,OAAM,IAAO,IAE5C,aAAsB,CAClB,GAAI,IAAO,GAAe,GAE1B,GAAK,GAAK,GAAK,GAAK,GAAO,GAC3B,GAAK,GAAK,GAAK,GAAK,IAAO,IAE3B,OADI,IAAS,GACJ,GAAS,EAAG,GAAS,EAAW,EAAE,GAAQ,CAC/C,GAAI,IAAO,GAAK,IAChB,AAAI,MAAW,GAAK,KAAW,GAAK,KAAW,IAC3C,KAAU,KACV,GAAO,IACP,KAAU,KACd,IAAU,GAAK,SAAS,IAAI,cAEhC,MAAO,KAIf,YAAwB,EAAK,CACzB,SAAI,GAAK,OACT,MAAO,GAAI,GACJ,OAGhB,IAAY,IAAU,OC1mCzB,cAuBA,aACA,GAAI,IAAU,IAAQ,GAAK,QAAW,SAAU,EAAG,EAAG,CAClD,GAAI,GAAI,MAAO,SAAW,YAAc,EAAE,OAAO,UACjD,GAAI,CAAC,EAAG,MAAO,GACf,GAAI,GAAI,EAAE,KAAK,GAAI,EAAG,EAAK,GAAI,EAC/B,GAAI,CACA,KAAQ,KAAM,QAAU,KAAM,IAAM,CAAE,GAAI,EAAE,QAAQ,MAAM,EAAG,KAAK,EAAE,aAEjE,EAAP,CAAgB,EAAI,CAAE,MAAO,UAC7B,CACI,GAAI,CACA,AAAI,GAAK,CAAC,EAAE,MAAS,GAAI,EAAE,SAAY,EAAE,KAAK,UAElD,CAAU,GAAI,EAAG,KAAM,GAAE,OAE7B,MAAO,IAEP,GAAY,IAAQ,GAAK,UAAa,UAAY,CAClD,OAAS,GAAK,GAAI,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,EAAK,EAAG,OAAO,GAAO,UAAU,KACpF,MAAO,IAEX,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,KAMA,YAAoB,EAAG,CACnB,MAAI,IAAM,KACC,EAEP,MAAM,QAAQ,GACP,EAAE,IAAI,IAER,MAAO,IAAM,SACd,cAAgB,GACT,EAAE,aAEN,OAAO,OAAO,GAAI,GAEtB,EAEX,GAAQ,WAAa,GAOrB,YAAqB,EAAM,CAEvB,OADI,GAAS,GACJ,EAAK,EAAG,EAAK,UAAU,OAAQ,IACpC,EAAO,EAAK,GAAK,UAAU,GAE/B,MAAO,UAAU,EAAK,CAClB,GAAI,GAAO,CAAE,KAAM,GACnB,SAAO,QAAQ,SAAU,EAAO,CAC5B,EAAK,GAAS,GAAW,EAAI,MAE1B,GAGf,GAAQ,YAAc,GAMtB,YAAoB,EAAO,CACvB,MAAO,UAAU,EAAQ,CACrB,SAAO,UAAU,WAAa,UAAY,CACtC,MAAO,GAAM,OAAO,OAExB,EAAO,SAAW,SAAU,EAAM,CAC9B,MAAO,GAAM,OAAO,IAEjB,GAGf,GAAQ,WAAa,GACrB,GAAI,IAAqB,OAAO,uCAC5B,GAAkB,OAAO,mCACzB,GAAsB,OAAO,mDAKjC,YAAe,EAAU,EAAU,CAC/B,MAAI,KAAa,QACb,GAAW,IAEX,IAAa,QACb,GAAW,SAAU,EAAG,CAAE,MAAO,KAE9B,SAAU,EAAQ,EAAa,CAClC,GAAI,GAAS,GACb,AAAI,QAAQ,YAAY,GAAiB,IACrC,GAAS,QAAQ,YAAY,GAAiB,IAElD,EAAO,KAAK,CACR,KAAM,EACN,SAAU,EACV,SAAU,IAEd,QAAQ,eAAe,GAAiB,EAAQ,IAGxD,GAAQ,MAAQ,GAChB,YAAmB,EAAW,CAC1B,MAAO,UAAU,EAAQ,EAAa,EAAgB,CAClD,GAAI,GAAa,GAAI,KACrB,AAAI,QAAQ,YAAY,GAAqB,IACzC,GAAa,QAAQ,YAAY,GAAqB,IAE1D,EAAW,IAAI,EAAW,GAC1B,QAAQ,eAAe,GAAqB,EAAY,IAGhE,GAAQ,UAAY,GAKpB,YAAwB,EAAW,EAAa,CAC5C,MAAI,KAAgB,QAAU,GAAc,IACrC,SAAU,EAAQ,CAErB,GADA,QAAQ,eAAe,GAAoB,EAAW,EAAO,WACzD,CAAC,QAAQ,YAAY,GAAiB,EAAO,YAAc,EAAY,SAAW,EAClF,KAAM,IAAI,aAAY,8DAG1B,AAAK,QAAQ,YAAY,GAAqB,IAC1C,QAAQ,eAAe,GAAqB,GAAI,KAAO,GAE3D,EAAO,UAAU,WAAa,UAAY,CACtC,GAAI,GAAQ,KACR,EAAO,CAAE,KAAQ,QAAQ,YAAY,GAAoB,EAAO,YAEhE,EAAS,QAAQ,YAAY,GAAiB,EAAO,WACzD,SAAO,QAAQ,SAAU,EAAO,CAC5B,EAAK,EAAM,MAAQ,EAAM,SAAS,EAAM,EAAM,SAGlD,EAAY,QAAQ,SAAU,EAAO,CACjC,EAAK,GAAS,GAAW,EAAM,MAE5B,GAEX,EAAO,SAAW,SAAU,EAAM,CAC9B,GAAI,GAAY,QAAQ,YAAY,GAAoB,EAAO,WAC3D,EAAa,QAAQ,YAAY,GAAqB,GACtD,EAAS,QAAQ,YAAY,GAAiB,EAAO,WAEzD,GAAI,EAAK,OAAS,EACd,KAAM,IAAI,OAAM,2BAA6B,EAAY,kCAAqC,EAAK,KAAO,KAE9G,GAAI,GAAkB,GAClB,EAAa,GACjB,EAAY,IAAI,SAAU,EAAM,CAAE,MAAQ,CAAE,KAAM,EAAM,SAAU,SAAU,EAAG,CAAE,MAAO,OAAY,OAAO,GAAQ,QAAQ,SAAU,EAAO,CACxI,GAAI,CAAE,GAAM,OAAQ,IAChB,KAAM,IAAI,OAAM,mCAAsC,EAAQ,+BAAmC,EAAO,KAG5G,AAAI,EAAW,IAAI,EAAM,MACrB,EAAgB,EAAW,IAAI,EAAM,OAAS,EAAM,SAAS,EAAK,EAAM,OAGxE,EAAW,KAAK,CACZ,KAAM,EAAM,KACZ,MAAO,EAAM,SAAS,EAAK,EAAM,WAK7C,GAAI,GAAM,GAAK,GAAO,KAAK,MAAM,EAAQ,GAAS,CAAC,QAAS,KAE5D,SAAW,QAAQ,SAAU,EAAK,CAC9B,EAAI,EAAI,MAAQ,EAAI,QAEjB,IAInB,GAAQ,eAAiB,KC/MzB,cAuBA,aACA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KAatD,YAA2B,EAAQ,EAAW,CAC1C,MAAO,MAAK,KAAK,CAAG,GAAS,KAAK,IAAI,GAAc,KAAK,IAAI,KAAK,IAAI,GAAI,KAE9E,GAAQ,kBAAoB,GAQ5B,YAAuB,EAAM,EAAQ,CACjC,MAAO,MAAK,KAAM,EAAO,EAAU,KAAK,IAAI,IAEhD,GAAQ,cAAgB,KCnDxB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAe,KACf,GAAa,KACb,GAAU,KAUV,GAA6B,SAAU,EAAQ,CAC/C,GAAU,EAAa,GAMvB,WAAqB,EAAM,EAAU,CACjC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,GAAI,EAAW,EACX,KAAM,IAAI,OAAM,iFAAmF,EAAW,KAElH,SAAM,MAAQ,EACd,EAAM,UAAY,EAClB,EAAM,QAAU,GAAQ,cAAc,EAAM,MAAO,GACnD,EAAM,QAAU,EACT,EAEX,EAAgB,EAOhB,EAAY,OAAS,SAAU,EAAS,EAAW,CAC/C,GAAI,GAAO,GAAW,kBAAkB,EAAS,GAC7C,EAAS,GAAW,cAAc,EAAM,GAC5C,MAAO,IAAI,GAAc,EAAM,IAWnC,EAAY,KAAO,SAAU,EAAO,EAAW,CAC3C,GAAI,GAAQ,MAAM,KAAK,GACnB,EAAS,EAAc,OAAO,EAAM,OAAQ,GAChD,SAAM,QAAQ,SAAU,EAAS,CAAE,MAAO,GAAO,IAAI,KAC9C,GAQX,EAAY,UAAY,SAAU,EAAO,EAAU,CAE/C,OADI,GAAO,GACF,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACnC,GAAI,GAAQ,GAAQ,YAAY,EAAM,IACtC,EAAO,EAAK,OAAO,GAEvB,GAAI,GAAS,GAAI,GAAc,EAAK,OAAQ,GAC5C,SAAO,QAAU,EACV,GAEX,OAAO,eAAe,EAAY,UAAW,OAAQ,CAKjD,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAY,UAAW,SAAU,CAKnD,IAAK,UAAY,CACb,MAAO,MAAK,SAEhB,WAAY,GACZ,aAAc,KASlB,EAAY,UAAU,IAAM,SAAU,EAAS,CAE3C,OADI,GAAU,GAAQ,mBAAmB,EAAS,KAAK,MAAO,KAAK,UAAW,KAAK,MAC1E,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAChC,KAAK,QAAQ,EAAQ,IAAM,EAE/B,KAAK,WAYT,EAAY,UAAU,IAAM,SAAU,EAAS,CAE3C,OADI,GAAU,GAAQ,mBAAmB,EAAS,KAAK,MAAO,KAAK,UAAW,KAAK,MAC1E,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAChC,GAAI,CAAC,KAAK,QAAQ,EAAQ,IACtB,MAAO,GAGf,MAAO,IASX,EAAY,UAAU,KAAO,UAAY,CACrC,MAAO,MAAK,IAAI,EAAI,KAAK,IAAK,CAAC,KAAK,UAAY,KAAK,QAAW,KAAK,OAAQ,KAAK,YAOtF,EAAY,UAAU,OAAS,SAAU,EAAO,CAC5C,MAAI,MAAK,QAAU,EAAM,OAAS,KAAK,YAAc,EAAM,UAChD,GAEJ,KAAK,QAAQ,MAAM,SAAU,EAAO,EAAO,CAAE,MAAO,GAAM,QAAQ,KAAW,KAMxF,EAAY,UAAU,QAAU,UAAY,CAExC,OADI,GAAM,GAAI,YAAW,KAAK,KAAK,KAAK,MAAQ,IACvC,EAAI,EAAG,EAAI,EAAI,OAAQ,IAAK,CACjC,GAAI,GAAO,KAAK,QAAQ,MAAM,EAAI,EAAG,EAAI,EAAI,GAC7C,EAAI,GAAK,GAAQ,YAAY,GAEjC,MAAO,IAEX,GAAI,GACJ,UAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAY,UAAW,QAAS,QACnC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAY,UAAW,YAAa,QACvC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAY,UAAW,UAAW,QACrC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAY,UAAW,UAAW,QACrC,EAAc,EAAgB,GAAW,CACrC,GAAa,eAAe,cAAe,CAAC,UAC5C,GAAQ,EAAG,GAAa,UAAU,UAAW,GAAQ,EAAG,GAAa,UAAU,cAC/E,GAAW,oBAAqB,CAAC,OAAQ,UAC1C,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KC/OlB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAe,KACf,GAAa,KACb,GAAU,KAQV,GAAqC,SAAU,EAAQ,CACvD,GAAU,EAAqB,GAM/B,WAA6B,EAAM,EAAU,CACzC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,GAAI,EAAW,EACX,KAAM,IAAI,OAAM,oFAAsF,EAAW,uCAErH,SAAM,MAAQ,EACd,EAAM,UAAY,EAElB,EAAM,QAAU,GAAQ,cAAc,EAAM,MAAO,UAAY,CAAE,MAAO,CAAC,EAAG,KAC5E,EAAM,QAAU,EACT,EAEX,EAAwB,EAOxB,EAAoB,OAAS,SAAU,EAAU,EAAW,CACxD,GAAI,GAAI,GAAW,kBAAkB,EAAU,GAC/C,MAAO,IAAI,GAAsB,EAAG,GAAW,cAAc,EAAG,KAWpE,EAAoB,KAAO,SAAU,EAAO,EAAW,CACnD,GAAI,GAAQ,MAAM,KAAK,GACnB,EAAS,EAAsB,OAAO,EAAM,OAAQ,GACxD,SAAM,QAAQ,SAAU,EAAS,CAAE,MAAO,GAAO,IAAI,KAC9C,GAEX,OAAO,eAAe,EAAoB,UAAW,OAAQ,CAIzD,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAoB,UAAW,SAAU,CAI3D,IAAK,UAAY,CACb,MAAO,MAAK,SAEhB,WAAY,GACZ,aAAc,KASlB,EAAoB,UAAU,IAAM,SAAU,EAAS,CAEnD,OADI,GAAU,GAAQ,mBAAmB,EAAS,KAAK,MAAO,KAAK,UAAW,KAAK,MAC1E,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAEhC,KAAK,QAAQ,EAAQ,IAAI,IAAM,EAE3B,KAAK,QAAQ,EAAQ,IAAI,GAAK,GAC9B,MAAK,QAAQ,EAAQ,IAAI,GAAK,GAGtC,KAAK,WAST,EAAoB,UAAU,OAAS,SAAU,EAAS,CAGtD,OAFI,GAAU,GAAQ,mBAAmB,EAAS,KAAK,MAAO,KAAK,UAAW,KAAK,MAC/E,EAAU,GACL,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAEhC,KAAK,QAAQ,EAAQ,IAAI,IAAM,EAE3B,KAAK,QAAQ,EAAQ,IAAI,IAAM,GAC/B,MAAK,QAAQ,EAAQ,IAAI,GAAK,GAGtC,YAAK,UACE,GAYX,EAAoB,UAAU,IAAM,SAAU,EAAS,CAEnD,OADI,GAAU,GAAQ,mBAAmB,EAAS,KAAK,MAAO,KAAK,UAAW,KAAK,MAC1E,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAChC,GAAI,CAAC,KAAK,QAAQ,EAAQ,IAAI,GAC1B,MAAO,GAGf,MAAO,IASX,EAAoB,UAAU,KAAO,UAAY,CAC7C,MAAO,MAAK,IAAI,EAAI,KAAK,IAAK,CAAC,KAAK,UAAY,KAAK,QAAW,KAAK,OAAQ,KAAK,YAOtF,EAAoB,UAAU,OAAS,SAAU,EAAO,CACpD,MAAI,MAAK,QAAU,EAAM,OAAS,KAAK,YAAc,EAAM,WAAa,KAAK,UAAY,EAAM,QACpF,GAEJ,KAAK,QAAQ,MAAM,SAAU,EAAO,EAAO,CAAE,MAAO,GAAM,QAAQ,GAAO,KAAO,EAAM,IAAM,EAAM,QAAQ,GAAO,KAAO,EAAM,MAEzI,GAAI,GACJ,UAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAoB,UAAW,QAAS,QAC3C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAoB,UAAW,YAAa,QAC/C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAoB,UAAW,UAAW,QAC7C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAoB,UAAW,UAAW,QAC7C,EAAsB,EAAwB,GAAW,CACrD,GAAa,eAAe,sBAAuB,CAAC,UACpD,GAAQ,EAAG,GAAa,UAAU,UAAW,GAAQ,EAAG,GAAa,UAAU,cAC/E,GAAW,oBAAqB,CAAC,OAAQ,UAC1C,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KCzOlB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAe,KACf,GAAU,KAQd,YAAsC,EAAW,EAAY,CAEzD,MAAO,MAAK,KAAK,KAAK,IAAI,GAAa,KAAK,IAAI,IAUpD,YAAqC,EAAM,EAAM,EAAY,CAEzD,MAAO,MAAK,KAAM,EAAO,CAAC,KAAK,IAAI,GAAU,MAAK,IAAI,GAAc,KAAK,IAAI,EAAI,KASrF,YAA8B,EAAW,EAAY,EAAU,CAC3D,MAAO,MAAK,KAAK,EAAa,MAAK,IAAI,GAAc,KAAK,IAAI,EAAI,IAAgB,CAAE,GAAW,KAAK,IAAI,KAe5G,GAAI,IAAwC,SAAU,EAAQ,CAC1D,GAAU,EAAwB,GAQlC,WAAgC,EAAM,EAAU,EAAY,EAAU,CAClE,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,MAAQ,EACd,EAAM,UAAY,EAClB,EAAM,YAAc,EACpB,EAAM,GAAK,KAAK,KAAK,EAAM,MAAQ,EAAM,WACzC,EAAM,QAAU,GAAQ,cAAc,EAAM,UAAW,UAAY,CAAE,MAAO,IAAQ,cAAc,EAAM,GAAI,KAC5G,EAAM,UAAa,IAAa,OAAa,EAAW,GAAqB,EAAM,MAAO,EAAY,GACtG,EAAM,QAAU,EACT,EAEX,EAA2B,EAO3B,EAAuB,OAAS,SAAU,EAAM,EAAW,EAAY,CACnE,AAAI,IAAe,QAAU,GAAa,IAC1C,GAAI,GAAW,GAA4B,EAAM,EAAW,GACxD,EAAW,GAA6B,EAAW,GACvD,MAAO,IAAI,GAAyB,EAAU,EAAU,EAAY,IAYxE,EAAuB,KAAO,SAAU,EAAO,EAAW,EAAY,CAClE,AAAI,IAAe,QAAU,GAAa,IAC1C,GAAI,GAAQ,MAAM,KAAK,GACnB,EAAS,EAAyB,OAAO,EAAM,OAAQ,EAAW,GACtE,SAAM,QAAQ,SAAU,EAAS,CAAE,MAAO,GAAO,IAAI,KAC9C,GAEX,OAAO,eAAe,EAAuB,UAAW,WAAY,CAIhE,IAAK,UAAY,CACb,MAAO,MAAK,WAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAuB,UAAW,OAAQ,CAI5D,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAuB,UAAW,SAAU,CAI9D,IAAK,UAAY,CACb,MAAO,MAAK,SAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAuB,UAAW,aAAc,CAIlE,IAAK,UAAY,CACb,MAAO,MAAK,aAEhB,WAAY,GACZ,aAAc,KASlB,EAAuB,UAAU,IAAM,SAAU,EAAS,CAEtD,OADI,GAAU,GAAQ,WAAW,EAAS,KAAK,GAAI,KAAK,UAAW,KAAK,MAC/D,EAAI,EAAG,EAAI,KAAK,UAAW,IAChC,KAAK,QAAQ,GAAG,EAAQ,IAAM,EAElC,KAAK,WAYT,EAAuB,UAAU,IAAM,SAAU,EAAS,CAEtD,OADI,GAAU,GAAQ,WAAW,EAAS,KAAK,GAAI,KAAK,UAAW,KAAK,MAC/D,EAAI,EAAG,EAAI,KAAK,UAAW,IAChC,GAAI,CAAC,KAAK,QAAQ,GAAG,EAAQ,IACzB,MAAO,GAGf,MAAO,IASX,EAAuB,UAAU,KAAO,UAAY,CAEhD,GAAI,GAAI,KAAK,eAEb,MAAO,MAAK,IAAI,EAAG,KAAK,YAO5B,EAAuB,UAAU,OAAS,SAAU,EAAO,CACvD,MAAI,MAAK,QAAU,EAAM,OAAS,KAAK,YAAc,EAAM,WAAa,KAAK,UAAY,EAAM,SAAW,KAAK,cAAgB,EAAM,YAC1H,GAEJ,KAAK,QAAQ,MAAM,SAAU,EAAO,EAAY,CAAE,MAAO,GAAM,QAAQ,GAAY,MAAM,SAAU,EAAM,EAAY,CAAE,MAAO,GAAM,KAAgB,OAM/J,EAAuB,UAAU,aAAe,UAAY,CACxD,GAAI,GAAS,KAAK,QAAQ,IAAI,SAAU,EAAQ,CAC5C,MAAO,GAAO,OAAO,SAAU,EAAG,EAAG,CAAE,MAAO,GAAI,GAAM,KAExD,EAAO,EAAO,OAAO,SAAU,EAAG,EAAG,CAAE,MAAO,GAAI,GAAM,GAC5D,MAAO,GAAO,KAAK,OAEvB,GAAI,GACJ,UAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAuB,UAAW,QAAS,QAC9C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAuB,UAAW,YAAa,QAClD,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAuB,UAAW,cAAe,QACpD,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAuB,UAAW,KAAM,QAC3C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAuB,UAAW,UAAW,QAChD,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAuB,UAAW,YAAa,QAClD,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAuB,UAAW,UAAW,QAChD,EAAyB,EAA2B,GAAW,CAC3D,GAAa,eAAe,yBAA0B,CAAC,UACvD,GAAQ,EAAG,GAAa,UAAU,UAAW,GAAQ,EAAG,GAAa,UAAU,cAAe,GAAQ,EAAG,GAAa,UAAU,gBAAiB,GAAQ,EAAG,GAAa,UAAU,cACnL,GAAW,oBAAqB,CAAC,OAAQ,OAAQ,OAAQ,UAC1D,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KCxSlB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAY,IAAQ,GAAK,UAAa,SAAS,EAAG,CAClD,GAAI,GAAI,MAAO,SAAW,YAAc,OAAO,SAAU,EAAI,GAAK,EAAE,GAAI,EAAI,EAC5E,GAAI,EAAG,MAAO,GAAE,KAAK,GACrB,GAAI,GAAK,MAAO,GAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAY,CACd,MAAI,IAAK,GAAK,EAAE,QAAQ,GAAI,QACrB,CAAE,MAAO,GAAK,EAAE,KAAM,KAAM,CAAC,KAG5C,KAAM,IAAI,WAAU,EAAI,0BAA4B,oCAEpD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAe,KACf,GAAU,KAUV,GAAgC,SAAU,EAAQ,CAClD,GAAU,EAAgB,GAM1B,WAAwB,EAAS,EAAM,CACnC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,SAAW,EACjB,EAAM,MAAQ,EACd,EAAM,QAAU,GAAQ,cAAc,EAAM,MAAO,UAAY,CAAE,MAAO,IAAQ,cAAc,EAAM,SAAU,KAC9G,EAAM,SAAW,EACV,EAEX,EAAmB,EAOnB,EAAe,OAAS,SAAU,EAAW,EAAU,CACnD,AAAI,IAAa,QAAU,GAAW,MAEtC,GAAI,GAAU,KAAK,KAAK,KAAK,EAAI,GAC7B,EAAO,KAAK,KAAK,KAAK,IAAI,EAAI,IAClC,MAAO,IAAI,GAAiB,EAAS,IASzC,EAAe,KAAO,SAAU,EAAO,EAAW,EAAU,CACxD,GAAI,GAAK,EACT,AAAI,IAAa,QAAU,GAAW,MACtC,GAAI,GAAS,EAAiB,OAAO,EAAW,GAChD,GAAI,CACA,OAAS,GAAU,GAAS,GAAQ,EAAY,EAAQ,OAAQ,CAAC,EAAU,KAAM,EAAY,EAAQ,OAAQ,CACzG,GAAI,GAAO,EAAU,MACrB,EAAO,OAAO,UAGf,EAAP,CAAgB,EAAM,CAAE,MAAO,UAC/B,CACI,GAAI,CACA,AAAI,GAAa,CAAC,EAAU,MAAS,GAAK,EAAQ,SAAS,EAAG,KAAK,UAEvE,CAAU,GAAI,EAAK,KAAM,GAAI,OAEjC,MAAO,IAEX,OAAO,eAAe,EAAe,UAAW,UAAW,CAIvD,IAAK,UAAY,CACb,MAAO,MAAK,UAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAe,UAAW,OAAQ,CAIpD,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAe,UAAW,MAAO,CAInD,IAAK,UAAY,CACb,MAAO,MAAK,UAEhB,WAAY,GACZ,aAAc,KAOlB,EAAe,UAAU,OAAS,SAAU,EAAS,EAAO,CACxD,AAAI,IAAU,QAAU,GAAQ,GAChC,KAAK,UAAY,EAEjB,OADI,GAAU,GAAQ,mBAAmB,EAAS,KAAK,SAAU,KAAK,MAAO,KAAK,MACzE,EAAI,EAAG,EAAI,KAAK,MAAO,IAC5B,KAAK,QAAQ,GAAG,EAAQ,KAAO,GAQvC,EAAe,UAAU,MAAQ,SAAU,EAAS,CAGhD,OAFI,GAAM,SACN,EAAU,GAAQ,mBAAmB,EAAS,KAAK,SAAU,KAAK,MAAO,KAAK,MACzE,EAAI,EAAG,EAAI,KAAK,MAAO,IAAK,CACjC,GAAI,GAAI,KAAK,QAAQ,GAAG,EAAQ,IAChC,EAAM,KAAK,IAAI,EAAG,GAEtB,MAAO,IAOX,EAAe,UAAU,OAAS,SAAU,EAAO,CAC/C,GAAI,KAAK,WAAa,EAAM,UAAY,KAAK,QAAU,EAAM,MACzD,MAAO,GAEX,OAAS,GAAI,EAAG,EAAI,KAAK,MAAO,IAC5B,OAAS,GAAI,EAAG,EAAI,KAAK,SAAU,IAC/B,GAAI,KAAK,QAAQ,GAAG,KAAO,EAAM,QAAQ,GAAG,GACxC,MAAO,GAInB,MAAO,IAMX,EAAe,UAAU,MAAQ,SAAU,EAAQ,CAC/C,GAAI,KAAK,WAAa,EAAO,SACzB,KAAM,IAAI,OAAM,8DAEpB,GAAI,KAAK,QAAU,EAAO,MACtB,KAAM,IAAI,OAAM,2DAEpB,OAAS,GAAI,EAAG,EAAI,KAAK,MAAO,IAC5B,OAAS,GAAI,EAAG,EAAI,KAAK,SAAU,IAC/B,KAAK,QAAQ,GAAG,IAAM,EAAO,QAAQ,GAAG,IAQpD,EAAe,UAAU,MAAQ,UAAY,CACzC,GAAI,GAAS,GAAI,GAAiB,KAAK,SAAU,KAAK,OACtD,SAAO,MAAM,MACb,EAAO,KAAO,KAAK,KACZ,GAEX,GAAI,GACJ,UAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAe,UAAW,WAAY,QACzC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAe,UAAW,QAAS,QACtC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAe,UAAW,UAAW,QACxC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAe,UAAW,WAAY,QACzC,EAAiB,EAAmB,GAAW,CAC3C,GAAa,eAAe,iBAAkB,CAAC,UAC/C,GAAQ,EAAG,GAAa,UAAU,aAAc,GAAQ,EAAG,GAAa,UAAU,UAClF,GAAW,oBAAqB,CAAC,OAAQ,UAC1C,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KCjQlB,2BAwBA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAe,KACf,GAAU,KAEV,GAAa,KAAK,IAAI,EAAG,IAO7B,YAAsB,EAAG,CACrB,OAAQ,OACC,IACD,MAAO,UACN,IACD,MAAO,UACN,IACD,MAAO,cAEP,MAAO,OAAU,GAAM,MAAQ,IAQ3C,GAAI,IAA6B,SAAU,EAAQ,CAC/C,GAAU,EAAa,GAKvB,WAAqB,EAAa,CAC9B,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,aAAe,EACrB,EAAM,gBAAkB,KAAK,MAAM,KAAK,KAAK,IAC7C,EAAM,gBAAkB,GAAa,GACrC,EAAM,WAAa,GAAQ,cAAc,EAAM,aAAc,GACtD,EAEX,EAAgB,EAChB,OAAO,eAAe,EAAY,UAAW,cAAe,CAIxD,IAAK,UAAY,CACb,MAAO,MAAK,cAEhB,WAAY,GACZ,aAAc,KAMlB,EAAY,UAAU,OAAS,SAAU,EAAS,CAO9C,OALI,GAAc,GAAQ,UAAU,EAAS,KAAK,MAAM,SAAS,GAC7D,EAAgB,EAAI,SAAS,EAAY,MAAM,EAAG,KAAK,gBAAkB,GAAI,GAE7E,EAAa,EAAY,MAAM,KAAK,iBACpC,EAAc,EACX,EAAW,KAAiB,KAAO,EAAc,EAAW,OAAS,GACxE,IAGJ,KAAK,WAAW,GAAiB,KAAK,IAAI,KAAK,WAAW,GAAgB,IAM9E,EAAY,UAAU,MAAQ,SAAU,EAAO,CAC3C,AAAI,IAAU,QAAU,GAAQ,IAEhC,GAAI,GAAe,KAAK,WAAW,OAAO,SAAU,EAAK,EAAO,CAAE,MAAO,GAAM,KAAK,IAAI,EAAG,CAAC,IAAW,GACnG,EAAc,KAAK,gBAAkB,KAAK,IAAI,KAAK,aAAc,GAAM,EAO3E,MAAI,GAAc,GAAa,IAC3B,GAAa,CAAC,GAAa,KAAK,IAAI,EAAK,EAAa,KAGtD,GACA,GAAa,KAAK,MAAM,IAErB,GAMX,EAAY,UAAU,SAAW,UAAY,CACzC,MAAO,MAAO,KAAK,KAAK,KAAK,eAOjC,EAAY,UAAU,MAAQ,SAAU,EAAO,CAC3C,GAAI,KAAK,cAAgB,EAAM,YAC3B,KAAM,IAAI,OAAM,gHAAkH,KAAK,YAAc,YAAc,EAAM,aAG7K,OADI,GAAY,GAAI,GAAc,KAAK,aAC9B,EAAI,EAAG,EAAI,KAAK,YAAc,EAAG,IACtC,EAAU,WAAW,GAAK,KAAK,IAAI,KAAK,WAAW,GAAI,EAAM,WAAW,IAE5E,MAAO,IAOX,EAAY,UAAU,OAAS,SAAU,EAAO,CAC5C,GAAI,KAAK,cAAgB,EAAM,YAC3B,MAAO,GAEX,OAAS,GAAI,EAAG,EAAI,KAAK,YAAc,EAAG,IACtC,GAAI,KAAK,WAAW,KAAO,EAAM,WAAW,GACxC,MAAO,GAGf,MAAO,IAEX,GAAI,GACJ,UAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAY,UAAW,eAAgB,QAC1C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAY,UAAW,kBAAmB,QAC7C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAY,UAAW,kBAAmB,QAC7C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAY,UAAW,aAAc,QACxC,EAAc,EAAgB,GAAW,CACrC,GAAa,eAAe,cAAe,CAAC,UAC5C,GAAQ,EAAG,GAAa,UAAU,iBAClC,GAAW,oBAAqB,CAAC,UAClC,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KCjNlB,mBAQC,AAAC,WAAW,CAGX,GAAI,GAGA,EAAU,UAGV,EAAmB,IAGnB,EAAkB,kEAClB,EAAkB,sBAClB,EAA+B,qDAG/B,EAAiB,4BAGjB,EAAmB,IAGnB,EAAc,yBAGd,EAAkB,EAClB,EAAkB,EAClB,EAAqB,EAGrB,EAAuB,EACvB,EAAyB,EAGzB,EAAiB,EACjB,EAAqB,EACrB,GAAwB,EACxB,EAAkB,EAClB,GAAwB,GACxB,EAAoB,GACpB,GAA0B,GAC1B,GAAgB,IAChB,EAAkB,IAClB,GAAiB,IAGjB,GAAuB,GACvB,GAAyB,MAGzB,GAAY,IACZ,GAAW,GAGX,GAAmB,EACnB,GAAgB,EAChB,GAAkB,EAGlB,GAAW,EAAI,EACf,GAAmB,iBACnB,GAAc,sBACd,GAAM,EAAI,EAGV,GAAmB,WACnB,GAAkB,GAAmB,EACrC,GAAwB,KAAqB,EAG7C,GAAY,CACd,CAAC,MAAO,IACR,CAAC,OAAQ,GACT,CAAC,UAAW,GACZ,CAAC,QAAS,GACV,CAAC,aAAc,IACf,CAAC,OAAQ,IACT,CAAC,UAAW,GACZ,CAAC,eAAgB,IACjB,CAAC,QAAS,IAIR,GAAU,qBACV,GAAW,iBACX,EAAW,yBACX,GAAU,mBACV,GAAU,gBACV,GAAY,wBACZ,GAAW,iBACX,GAAU,oBACV,GAAS,6BACT,GAAS,eACT,GAAY,kBACZ,GAAU,gBACV,GAAY,kBACZ,GAAa,mBACb,GAAW,iBACX,GAAY,kBACZ,GAAS,eACT,GAAY,kBACZ,GAAY,kBACZ,GAAe,qBACf,GAAa,mBACb,EAAa,mBAEb,GAAiB,uBACjB,GAAc,oBACd,GAAa,wBACb,GAAa,wBACb,GAAU,qBACV,GAAW,sBACX,GAAW,sBACX,GAAW,sBACX,GAAkB,6BAClB,GAAY,uBACZ,GAAY,uBAGZ,GAAuB,iBACvB,GAAsB,qBACtB,GAAwB,gCAGxB,GAAgB,4BAChB,GAAkB,WAClB,GAAmB,OAAO,GAAc,QACxC,GAAqB,OAAO,GAAgB,QAG5C,GAAW,mBACX,GAAa,kBACb,GAAgB,mBAGhB,GAAe,mDACf,GAAgB,QAChB,GAAa,mGAMb,GAAe,sBACf,GAAkB,OAAO,GAAa,QAGtC,GAAc,OAGd,GAAe,KAGf,GAAgB,4CAChB,GAAgB,oCAChB,GAAiB,QAGjB,GAAc,4CAYd,GAA6B,mBAG7B,GAAe,WAMf,GAAe,kCAGf,GAAU,OAGV,GAAa,qBAGb,GAAa,aAGb,GAAe,8BAGf,GAAY,cAGZ,GAAW,mBAGX,GAAU,8CAGV,GAAY,OAGZ,GAAoB,yBAGpB,GAAgB,kBAChB,GAAoB,kBACpB,GAAwB,kBACxB,GAAsB,kBACtB,GAAe,GAAoB,GAAwB,GAC3D,GAAiB,kBACjB,GAAe,4BACf,GAAgB,uBAChB,GAAiB,+CACjB,GAAqB,kBACrB,GAAe,+JACf,GAAe,4BACf,GAAa,iBACb,GAAe,GAAgB,GAAiB,GAAqB,GAGrE,EAAS,YACT,EAAW,IAAM,GAAgB,IACjC,EAAU,IAAM,GAAe,IAC/B,EAAU,IAAM,GAAe,IAC/B,EAAW,OACX,EAAY,IAAM,GAAiB,IACnC,GAAU,IAAM,GAAe,IAC/B,GAAS,KAAO,GAAgB,GAAe,EAAW,GAAiB,GAAe,GAAe,IACzG,GAAS,2BACT,GAAa,MAAQ,EAAU,IAAM,GAAS,IAC9C,GAAc,KAAO,GAAgB,IACrC,GAAa,kCACb,GAAa,qCACb,GAAU,IAAM,GAAe,IAC/B,GAAQ,UAGR,GAAc,MAAQ,GAAU,IAAM,GAAS,IAC/C,GAAc,MAAQ,GAAU,IAAM,GAAS,IAC/C,GAAkB,MAAQ,EAAS,yBACnC,GAAkB,MAAQ,EAAS,yBACnC,GAAW,GAAa,IACxB,GAAW,IAAM,GAAa,KAC9B,GAAY,MAAQ,GAAQ,MAAQ,CAAC,GAAa,GAAY,IAAY,KAAK,KAAO,IAAM,GAAW,GAAW,KAClH,GAAa,mDACb,GAAa,mDACb,GAAQ,GAAW,GAAW,GAC9B,GAAU,MAAQ,CAAC,EAAW,GAAY,IAAY,KAAK,KAAO,IAAM,GACxE,GAAW,MAAQ,CAAC,GAAc,EAAU,IAAK,EAAS,GAAY,GAAY,GAAU,KAAK,KAAO,IAGxG,GAAS,OAAO,EAAQ,KAMxB,GAAc,OAAO,EAAS,KAG9B,GAAY,OAAO,GAAS,MAAQ,GAAS,KAAO,GAAW,GAAO,KAGtE,GAAgB,OAAO,CACzB,GAAU,IAAM,GAAU,IAAM,GAAkB,MAAQ,CAAC,EAAS,GAAS,KAAK,KAAK,KAAO,IAC9F,GAAc,IAAM,GAAkB,MAAQ,CAAC,EAAS,GAAU,GAAa,KAAK,KAAK,KAAO,IAChG,GAAU,IAAM,GAAc,IAAM,GACpC,GAAU,IAAM,GAChB,GACA,GACA,EACA,IACA,KAAK,KAAM,KAGT,GAAe,OAAO,IAAM,GAAQ,GAAiB,GAAe,GAAa,KAGjF,GAAmB,qEAGnB,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3C,GAAkB,GAGlB,GAAiB,GACrB,GAAe,IAAc,GAAe,IAC5C,GAAe,IAAW,GAAe,IACzC,GAAe,IAAY,GAAe,IAC1C,GAAe,IAAmB,GAAe,IACjD,GAAe,IAAa,GAC5B,GAAe,IAAW,GAAe,IACzC,GAAe,IAAkB,GAAe,IAChD,GAAe,IAAe,GAAe,IAC7C,GAAe,IAAY,GAAe,IAC1C,GAAe,IAAU,GAAe,IACxC,GAAe,IAAa,GAAe,IAC3C,GAAe,IAAU,GAAe,IACxC,GAAe,IAAc,GAG7B,GAAI,IAAgB,GACpB,GAAc,IAAW,GAAc,IACvC,GAAc,IAAkB,GAAc,IAC9C,GAAc,IAAW,GAAc,IACvC,GAAc,IAAc,GAAc,IAC1C,GAAc,IAAW,GAAc,IACvC,GAAc,IAAY,GAAc,IACxC,GAAc,IAAa,GAAc,IACzC,GAAc,IAAa,GAAc,IACzC,GAAc,IAAa,GAAc,IACzC,GAAc,IAAY,GAAc,IACxC,GAAc,IAAa,GAAc,IAAa,GACtD,GAAc,IAAY,GAAc,IACxC,GAAc,IAAc,GAG5B,GAAI,IAAkB,CAEpB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IACnC,OAAQ,KAAM,OAAQ,KACtB,OAAQ,KAAM,OAAQ,KACtB,OAAQ,KAER,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAC1B,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACvE,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IACxD,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACtF,OAAU,IAAM,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IAAK,OAAU,IACtF,OAAU,IAAM,OAAU,IAC1B,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,IAAM,OAAU,IAAK,OAAU,IACzC,OAAU,KAAM,OAAU,KAC1B,OAAU,KAAM,OAAU,KAC1B,OAAU,KAAM,OAAU,KAIxB,GAAc,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SAIH,GAAgB,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,KAIP,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIR,GAAiB,WACjB,GAAe,SAGf,GAAa,MAAO,SAAU,UAAY,QAAU,OAAO,SAAW,QAAU,OAGhF,GAAW,MAAO,OAAQ,UAAY,MAAQ,KAAK,SAAW,QAAU,KAGxE,GAAO,IAAc,IAAY,SAAS,iBAG1C,GAAc,MAAO,KAAW,UAAY,IAAW,CAAC,GAAQ,UAAY,GAG5E,GAAa,IAAe,MAAO,KAAU,UAAY,IAAU,CAAC,GAAO,UAAY,GAGvF,GAAgB,IAAc,GAAW,UAAY,GAGrD,GAAc,IAAiB,GAAW,QAG1C,GAAY,UAAW,CACzB,GAAI,CAEF,GAAI,GAAQ,IAAc,GAAW,SAAW,GAAW,QAAQ,QAAQ,MAE3E,MAAI,IAKG,IAAe,GAAY,SAAW,GAAY,QAAQ,cAC1D,GAAP,MAIA,GAAoB,IAAY,GAAS,cACzC,GAAa,IAAY,GAAS,OAClC,GAAY,IAAY,GAAS,MACjC,GAAe,IAAY,GAAS,SACpC,GAAY,IAAY,GAAS,MACjC,GAAmB,IAAY,GAAS,aAc5C,YAAe,EAAM,GAAS,EAAM,CAClC,OAAQ,EAAK,YACN,GAAG,MAAO,GAAK,KAAK,QACpB,GAAG,MAAO,GAAK,KAAK,GAAS,EAAK,QAClC,GAAG,MAAO,GAAK,KAAK,GAAS,EAAK,GAAI,EAAK,QAC3C,GAAG,MAAO,GAAK,KAAK,GAAS,EAAK,GAAI,EAAK,GAAI,EAAK,IAE3D,MAAO,GAAK,MAAM,GAAS,GAa7B,YAAyB,EAAO,GAAQ,EAAU,GAAa,CAI7D,OAHI,IAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OAEhC,EAAE,GAAQ,IAAQ,CACvB,GAAI,IAAQ,EAAM,IAClB,GAAO,GAAa,GAAO,EAAS,IAAQ,GAE9C,MAAO,IAYT,YAAmB,EAAO,GAAU,CAIlC,OAHI,GAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OAEhC,EAAE,EAAQ,IACX,GAAS,EAAM,GAAQ,EAAO,KAAW,IAA7C,CAIF,MAAO,GAYT,YAAwB,EAAO,GAAU,CAGvC,OAFI,GAAS,GAAS,KAAO,EAAI,EAAM,OAEhC,KACD,GAAS,EAAM,GAAS,EAAQ,KAAW,IAA/C,CAIF,MAAO,GAaT,YAAoB,EAAO,GAAW,CAIpC,OAHI,GAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OAEhC,EAAE,EAAQ,IACf,GAAI,CAAC,GAAU,EAAM,GAAQ,EAAO,GAClC,MAAO,GAGX,MAAO,GAYT,YAAqB,EAAO,GAAW,CAMrC,OALI,GAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OACnC,GAAW,EACX,GAAS,GAEN,EAAE,EAAQ,IAAQ,CACvB,GAAI,IAAQ,EAAM,GAClB,AAAI,GAAU,GAAO,EAAO,IAC1B,IAAO,MAAc,IAGzB,MAAO,IAYT,YAAuB,EAAO,GAAO,CACnC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,CAAC,CAAC,GAAU,EAAY,EAAO,GAAO,GAAK,GAYpD,YAA2B,EAAO,GAAO,EAAY,CAInD,OAHI,IAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OAEhC,EAAE,GAAQ,IACf,GAAI,EAAW,GAAO,EAAM,KAC1B,MAAO,GAGX,MAAO,GAYT,YAAkB,EAAO,GAAU,CAKjC,OAJI,GAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OACnC,GAAS,MAAM,IAEZ,EAAE,EAAQ,IACf,GAAO,GAAS,GAAS,EAAM,GAAQ,EAAO,GAEhD,MAAO,IAWT,YAAmB,EAAO,GAAQ,CAKhC,OAJI,GAAQ,GACR,GAAS,GAAO,OAChB,GAAS,EAAM,OAEZ,EAAE,EAAQ,IACf,EAAM,GAAS,GAAS,GAAO,GAEjC,MAAO,GAeT,YAAqB,EAAO,GAAU,EAAa,GAAW,CAC5D,GAAI,IAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OAKvC,IAHI,IAAa,IACf,GAAc,EAAM,EAAE,KAEjB,EAAE,GAAQ,IACf,EAAc,GAAS,EAAa,EAAM,IAAQ,GAAO,GAE3D,MAAO,GAeT,YAA0B,EAAO,GAAU,EAAa,GAAW,CACjE,GAAI,IAAS,GAAS,KAAO,EAAI,EAAM,OAIvC,IAHI,IAAa,IACf,GAAc,EAAM,EAAE,KAEjB,MACL,EAAc,GAAS,EAAa,EAAM,IAAS,GAAQ,GAE7D,MAAO,GAaT,WAAmB,EAAO,GAAW,CAInC,OAHI,GAAQ,GACR,GAAS,GAAS,KAAO,EAAI,EAAM,OAEhC,EAAE,EAAQ,IACf,GAAI,GAAU,EAAM,GAAQ,EAAO,GACjC,MAAO,GAGX,MAAO,GAUT,GAAI,GAAY,GAAa,UAS7B,WAAsB,EAAQ,CAC5B,MAAO,GAAO,MAAM,IAUtB,WAAoB,EAAQ,CAC1B,MAAO,GAAO,MAAM,KAAgB,GActC,WAAqB,EAAY,GAAW,EAAU,CACpD,GAAI,IACJ,SAAS,EAAY,SAAS,GAAO,GAAK,GAAY,CACpD,GAAI,GAAU,GAAO,GAAK,IACxB,UAAS,GACF,KAGJ,GAcT,WAAuB,EAAO,GAAW,EAAW,GAAW,CAI7D,OAHI,IAAS,EAAM,OACf,GAAQ,EAAa,IAAY,EAAI,IAEjC,GAAY,KAAU,EAAE,GAAQ,IACtC,GAAI,GAAU,EAAM,IAAQ,GAAO,GACjC,MAAO,IAGX,MAAO,GAYT,WAAqB,EAAO,GAAO,EAAW,CAC5C,MAAO,MAAU,GACb,GAAc,EAAO,GAAO,GAC5B,EAAc,EAAO,GAAW,GAatC,WAAyB,EAAO,GAAO,EAAW,GAAY,CAI5D,OAHI,IAAQ,EAAY,EACpB,GAAS,EAAM,OAEZ,EAAE,GAAQ,IACf,GAAI,GAAW,EAAM,IAAQ,IAC3B,MAAO,IAGX,MAAO,GAUT,YAAmB,EAAO,CACxB,MAAO,KAAU,EAYnB,YAAkB,EAAO,GAAU,CACjC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,GAAU,GAAQ,EAAO,IAAY,EAAU,GAUxD,YAAsB,EAAK,CACzB,MAAO,UAAS,GAAQ,CACtB,MAAO,KAAU,KAAO,EAAY,GAAO,IAW/C,YAAwB,EAAQ,CAC9B,MAAO,UAAS,GAAK,CACnB,MAAO,IAAU,KAAO,EAAY,EAAO,KAiB/C,YAAoB,EAAY,GAAU,EAAa,GAAW,GAAU,CAC1E,UAAS,EAAY,SAAS,GAAO,GAAO,GAAY,CACtD,EAAc,GACT,IAAY,GAAO,IACpB,GAAS,EAAa,GAAO,GAAO,MAEnC,EAaT,YAAoB,EAAO,GAAU,CACnC,GAAI,GAAS,EAAM,OAGnB,IADA,EAAM,KAAK,IACJ,KACL,EAAM,GAAU,EAAM,GAAQ,MAEhC,MAAO,GAYT,YAAiB,EAAO,GAAU,CAKhC,OAJI,GACA,GAAQ,GACR,GAAS,EAAM,OAEZ,EAAE,GAAQ,IAAQ,CACvB,GAAI,IAAU,GAAS,EAAM,KAC7B,AAAI,KAAY,GACd,GAAS,IAAW,EAAY,GAAW,EAAS,IAGxD,MAAO,GAYT,YAAmB,EAAG,GAAU,CAI9B,OAHI,GAAQ,GACR,GAAS,MAAM,GAEZ,EAAE,EAAQ,GACf,GAAO,GAAS,GAAS,GAE3B,MAAO,IAYT,YAAqB,EAAQ,GAAO,CAClC,MAAO,IAAS,GAAO,SAAS,EAAK,CACnC,MAAO,CAAC,EAAK,EAAO,MAWxB,YAAkB,EAAQ,CACxB,MAAO,IACH,EAAO,MAAM,EAAG,GAAgB,GAAU,GAAG,QAAQ,GAAa,IAWxE,YAAmB,EAAM,CACvB,MAAO,UAAS,GAAO,CACrB,MAAO,GAAK,KAchB,YAAoB,EAAQ,GAAO,CACjC,MAAO,IAAS,GAAO,SAAS,EAAK,CACnC,MAAO,GAAO,KAYlB,YAAkB,EAAO,GAAK,CAC5B,MAAO,GAAM,IAAI,IAYnB,YAAyB,EAAY,GAAY,CAI/C,OAHI,GAAQ,GACR,GAAS,EAAW,OAEjB,EAAE,EAAQ,IAAU,EAAY,GAAY,EAAW,GAAQ,GAAK,IAAI,CAC/E,MAAO,GAYT,YAAuB,EAAY,GAAY,CAG7C,OAFI,GAAQ,EAAW,OAEhB,KAAW,EAAY,GAAY,EAAW,GAAQ,GAAK,IAAI,CACtE,MAAO,GAWT,YAAsB,EAAO,GAAa,CAIxC,OAHI,GAAS,EAAM,OACf,GAAS,EAEN,KACL,AAAI,EAAM,KAAY,IACpB,EAAE,GAGN,MAAO,IAWT,GAAI,IAAe,GAAe,IAS9B,GAAiB,GAAe,IASpC,YAA0B,EAAK,CAC7B,MAAO,KAAO,GAAc,GAW9B,YAAkB,EAAQ,GAAK,CAC7B,MAAO,IAAU,KAAO,EAAY,EAAO,IAU7C,YAAoB,EAAQ,CAC1B,MAAO,IAAa,KAAK,GAU3B,YAAwB,EAAQ,CAC9B,MAAO,IAAiB,KAAK,GAU/B,YAAyB,EAAU,CAIjC,OAHI,IACA,EAAS,GAEN,CAAE,IAAO,EAAS,QAAQ,MAC/B,EAAO,KAAK,GAAK,OAEnB,MAAO,GAUT,YAAoB,EAAK,CACvB,GAAI,IAAQ,GACR,EAAS,MAAM,EAAI,MAEvB,SAAI,QAAQ,SAAS,GAAO,GAAK,CAC/B,EAAO,EAAE,IAAS,CAAC,GAAK,MAEnB,EAWT,YAAiB,EAAM,GAAW,CAChC,MAAO,UAAS,EAAK,CACnB,MAAO,GAAK,GAAU,KAa1B,YAAwB,EAAO,GAAa,CAM1C,OALI,GAAQ,GACR,GAAS,EAAM,OACf,GAAW,EACX,GAAS,GAEN,EAAE,EAAQ,IAAQ,CACvB,GAAI,IAAQ,EAAM,GAClB,AAAI,MAAU,IAAe,KAAU,IACrC,GAAM,GAAS,EACf,GAAO,MAAc,GAGzB,MAAO,IAUT,YAAoB,EAAK,CACvB,GAAI,IAAQ,GACR,EAAS,MAAM,EAAI,MAEvB,SAAI,QAAQ,SAAS,GAAO,CAC1B,EAAO,EAAE,IAAS,KAEb,EAUT,YAAoB,EAAK,CACvB,GAAI,IAAQ,GACR,EAAS,MAAM,EAAI,MAEvB,SAAI,QAAQ,SAAS,GAAO,CAC1B,EAAO,EAAE,IAAS,CAAC,GAAO,MAErB,EAaT,YAAuB,EAAO,GAAO,EAAW,CAI9C,OAHI,IAAQ,EAAY,EACpB,GAAS,EAAM,OAEZ,EAAE,GAAQ,IACf,GAAI,EAAM,MAAW,GACnB,MAAO,IAGX,MAAO,GAaT,YAA2B,EAAO,GAAO,EAAW,CAElD,OADI,IAAQ,EAAY,EACjB,MACL,GAAI,EAAM,MAAW,GACnB,MAAO,IAGX,MAAO,IAUT,YAAoB,EAAQ,CAC1B,MAAO,IAAW,GACd,GAAY,GACZ,EAAU,GAUhB,YAAuB,EAAQ,CAC7B,MAAO,IAAW,GACd,GAAe,GACf,EAAa,GAWnB,YAAyB,EAAQ,CAG/B,OAFI,IAAQ,EAAO,OAEZ,MAAW,GAAa,KAAK,EAAO,OAAO,MAAS,CAC3D,MAAO,IAUT,GAAI,IAAmB,GAAe,IAStC,YAAqB,EAAQ,CAE3B,OADI,IAAS,GAAU,UAAY,EAC5B,GAAU,KAAK,IACpB,EAAE,GAEJ,MAAO,IAUT,YAAwB,EAAQ,CAC9B,MAAO,GAAO,MAAM,KAAc,GAUpC,YAAsB,EAAQ,CAC5B,MAAO,GAAO,MAAM,KAAkB,GAkCxC,GAAI,IAAgB,WAAsB,GAAS,CACjD,GAAU,IAAW,KAAO,GAAO,GAAE,SAAS,GAAK,SAAU,GAAS,GAAE,KAAK,GAAM,KAGnF,GAAI,GAAQ,GAAQ,MAChB,GAAO,GAAQ,KACf,GAAQ,GAAQ,MAChB,GAAW,GAAQ,SACnB,GAAO,GAAQ,KACf,GAAS,GAAQ,OACjB,GAAS,GAAQ,OACjB,GAAS,GAAQ,OACjB,GAAY,GAAQ,UAGpB,GAAa,EAAM,UACnB,GAAY,GAAS,UACrB,GAAc,GAAO,UAGrB,GAAa,GAAQ,sBAGrB,GAAe,GAAU,SAGzB,GAAiB,GAAY,eAG7B,GAAY,EAGZ,GAAc,UAAW,CAC3B,GAAI,GAAM,SAAS,KAAK,IAAc,GAAW,MAAQ,GAAW,KAAK,UAAY,IACrF,MAAO,GAAO,iBAAmB,EAAO,MAQtC,GAAuB,GAAY,SAGnC,GAAmB,GAAa,KAAK,IAGrC,GAAU,GAAK,EAGf,GAAa,GAAO,IACtB,GAAa,KAAK,IAAgB,QAAQ,GAAc,QACvD,QAAQ,yDAA0D,SAAW,KAI5E,GAAS,GAAgB,GAAQ,OAAS,EAC1C,GAAS,GAAQ,OACjB,GAAa,GAAQ,WACrB,GAAc,GAAS,GAAO,YAAc,EAC5C,GAAe,GAAQ,GAAO,eAAgB,IAC9C,GAAe,GAAO,OACtB,GAAuB,GAAY,qBACnC,GAAS,GAAW,OACpB,GAAmB,GAAS,GAAO,mBAAqB,EACxD,GAAc,GAAS,GAAO,SAAW,EACzC,GAAiB,GAAS,GAAO,YAAc,EAE/C,GAAkB,UAAW,CAC/B,GAAI,CACF,GAAI,GAAO,GAAU,GAAQ,kBAC7B,SAAK,GAAI,GAAI,IACN,QACA,EAAP,MAIA,GAAkB,GAAQ,eAAiB,GAAK,cAAgB,GAAQ,aACxE,GAAS,IAAQ,GAAK,MAAQ,GAAK,KAAK,KAAO,GAAK,IACpD,GAAgB,GAAQ,aAAe,GAAK,YAAc,GAAQ,WAGlE,GAAa,GAAK,KAClB,GAAc,GAAK,MACnB,GAAmB,GAAO,sBAC1B,GAAiB,GAAS,GAAO,SAAW,EAC5C,GAAiB,GAAQ,SACzB,GAAa,GAAW,KACxB,GAAa,GAAQ,GAAO,KAAM,IAClC,GAAY,GAAK,IACjB,GAAY,GAAK,IACjB,GAAY,GAAK,IACjB,GAAiB,GAAQ,SACzB,GAAe,GAAK,OACpB,GAAgB,GAAW,QAG3B,GAAW,GAAU,GAAS,YAC9B,GAAM,GAAU,GAAS,OACzB,GAAU,GAAU,GAAS,WAC7B,GAAM,GAAU,GAAS,OACzB,GAAU,GAAU,GAAS,WAC7B,GAAe,GAAU,GAAQ,UAGjC,GAAU,IAAW,GAAI,IAGzB,GAAY,GAGZ,GAAqB,GAAS,IAC9B,GAAgB,GAAS,IACzB,GAAoB,GAAS,IAC7B,GAAgB,GAAS,IACzB,GAAoB,GAAS,IAG7B,GAAc,GAAS,GAAO,UAAY,EAC1C,GAAgB,GAAc,GAAY,QAAU,EACpD,GAAiB,GAAc,GAAY,SAAW,EAyH1D,WAAgB,EAAO,CACrB,GAAI,GAAa,IAAU,CAAC,GAAQ,IAAU,CAAE,aAAiB,IAAc,CAC7E,GAAI,YAAiB,IACnB,MAAO,GAET,GAAI,GAAe,KAAK,EAAO,eAC7B,MAAO,IAAa,GAGxB,MAAO,IAAI,IAAc,GAW3B,GAAI,IAAc,UAAW,CAC3B,YAAkB,EAClB,MAAO,UAAS,EAAO,CACrB,GAAI,CAAC,GAAS,GACZ,MAAO,GAET,GAAI,GACF,MAAO,IAAa,GAEtB,EAAO,UAAY,EACnB,GAAI,GAAS,GAAI,GACjB,SAAO,UAAY,EACZ,MASX,aAAsB,EAWtB,YAAuB,EAAO,EAAU,CACtC,KAAK,YAAc,EACnB,KAAK,YAAc,GACnB,KAAK,UAAY,CAAC,CAAC,EACnB,KAAK,UAAY,EACjB,KAAK,WAAa,EAYpB,EAAO,iBAAmB,CAQxB,OAAU,GAQV,SAAY,GAQZ,YAAe,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAK,IAKT,EAAO,UAAY,GAAW,UAC9B,EAAO,UAAU,YAAc,EAE/B,GAAc,UAAY,GAAW,GAAW,WAChD,GAAc,UAAU,YAAc,GAWtC,WAAqB,EAAO,CAC1B,KAAK,YAAc,EACnB,KAAK,YAAc,GACnB,KAAK,QAAU,EACf,KAAK,aAAe,GACpB,KAAK,cAAgB,GACrB,KAAK,cAAgB,GACrB,KAAK,UAAY,GAWnB,YAAqB,CACnB,GAAI,GAAS,GAAI,GAAY,KAAK,aAClC,SAAO,YAAc,GAAU,KAAK,aACpC,EAAO,QAAU,KAAK,QACtB,EAAO,aAAe,KAAK,aAC3B,EAAO,cAAgB,GAAU,KAAK,eACtC,EAAO,cAAgB,KAAK,cAC5B,EAAO,UAAY,GAAU,KAAK,WAC3B,EAWT,YAAuB,CACrB,GAAI,KAAK,aAAc,CACrB,GAAI,GAAS,GAAI,GAAY,MAC7B,EAAO,QAAU,GACjB,EAAO,aAAe,OAEtB,GAAS,KAAK,QACd,EAAO,SAAW,GAEpB,MAAO,GAWT,YAAqB,CACnB,GAAI,GAAQ,KAAK,YAAY,QACzB,EAAM,KAAK,QACX,EAAQ,GAAQ,GAChB,EAAU,EAAM,EAChB,EAAY,EAAQ,EAAM,OAAS,EACnC,EAAO,GAAQ,EAAG,EAAW,KAAK,WAClC,EAAQ,EAAK,MACb,EAAM,EAAK,IACX,EAAS,EAAM,EACf,GAAQ,EAAU,EAAO,EAAQ,EACjC,GAAY,KAAK,cACjB,GAAa,GAAU,OACvB,GAAW,EACX,GAAY,GAAU,EAAQ,KAAK,eAEvC,GAAI,CAAC,GAAU,CAAC,GAAW,GAAa,GAAU,IAAa,EAC7D,MAAO,IAAiB,EAAO,KAAK,aAEtC,GAAI,IAAS,GAEb,EACA,KAAO,KAAY,GAAW,IAAW,CACvC,IAAS,EAKT,OAHI,IAAY,GACZ,GAAQ,EAAM,IAEX,EAAE,GAAY,IAAY,CAC/B,GAAI,IAAO,GAAU,IACjB,GAAW,GAAK,SAChB,GAAO,GAAK,KACZ,GAAW,GAAS,IAExB,GAAI,IAAQ,GACV,GAAQ,WACC,CAAC,GAAU,CACpB,GAAI,IAAQ,GACV,WAEA,SAIN,GAAO,MAAc,GAEvB,MAAO,IAIT,EAAY,UAAY,GAAW,GAAW,WAC9C,EAAY,UAAU,YAAc,EAWpC,WAAc,EAAS,CACrB,GAAI,GAAQ,GACR,EAAS,GAAW,KAAO,EAAI,EAAQ,OAG3C,IADA,KAAK,QACE,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAQ,GACpB,KAAK,IAAI,EAAM,GAAI,EAAM,KAW7B,YAAqB,CACnB,KAAK,SAAW,GAAe,GAAa,MAAQ,GACpD,KAAK,KAAO,EAad,YAAoB,EAAK,CACvB,GAAI,GAAS,KAAK,IAAI,IAAQ,MAAO,MAAK,SAAS,GACnD,YAAK,MAAQ,EAAS,EAAI,EACnB,EAYT,YAAiB,EAAK,CACpB,GAAI,GAAO,KAAK,SAChB,GAAI,GAAc,CAChB,GAAI,GAAS,EAAK,GAClB,MAAO,KAAW,EAAiB,EAAY,EAEjD,MAAO,IAAe,KAAK,EAAM,GAAO,EAAK,GAAO,EAYtD,YAAiB,EAAK,CACpB,GAAI,GAAO,KAAK,SAChB,MAAO,IAAgB,EAAK,KAAS,EAAa,GAAe,KAAK,EAAM,GAa9E,YAAiB,EAAK,EAAO,CAC3B,GAAI,GAAO,KAAK,SAChB,YAAK,MAAQ,KAAK,IAAI,GAAO,EAAI,EACjC,EAAK,GAAQ,IAAgB,IAAU,EAAa,EAAiB,EAC9D,KAIT,EAAK,UAAU,MAAQ,EACvB,EAAK,UAAU,OAAY,GAC3B,EAAK,UAAU,IAAM,GACrB,EAAK,UAAU,IAAM,GACrB,EAAK,UAAU,IAAM,GAWrB,YAAmB,EAAS,CAC1B,GAAI,GAAQ,GACR,EAAS,GAAW,KAAO,EAAI,EAAQ,OAG3C,IADA,KAAK,QACE,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAQ,GACpB,KAAK,IAAI,EAAM,GAAI,EAAM,KAW7B,aAA0B,CACxB,KAAK,SAAW,GAChB,KAAK,KAAO,EAYd,YAAyB,EAAK,CAC5B,GAAI,GAAO,KAAK,SACZ,EAAQ,GAAa,EAAM,GAE/B,GAAI,EAAQ,EACV,MAAO,GAET,GAAI,GAAY,EAAK,OAAS,EAC9B,MAAI,IAAS,EACX,EAAK,MAEL,GAAO,KAAK,EAAM,EAAO,GAE3B,EAAE,KAAK,KACA,GAYT,YAAsB,EAAK,CACzB,GAAI,GAAO,KAAK,SACZ,EAAQ,GAAa,EAAM,GAE/B,MAAO,GAAQ,EAAI,EAAY,EAAK,GAAO,GAY7C,YAAsB,EAAK,CACzB,MAAO,IAAa,KAAK,SAAU,GAAO,GAa5C,YAAsB,EAAK,EAAO,CAChC,GAAI,GAAO,KAAK,SACZ,EAAQ,GAAa,EAAM,GAE/B,MAAI,GAAQ,EACV,GAAE,KAAK,KACP,EAAK,KAAK,CAAC,EAAK,KAEhB,EAAK,GAAO,GAAK,EAEZ,KAIT,GAAU,UAAU,MAAQ,GAC5B,GAAU,UAAU,OAAY,GAChC,GAAU,UAAU,IAAM,GAC1B,GAAU,UAAU,IAAM,GAC1B,GAAU,UAAU,IAAM,GAW1B,YAAkB,EAAS,CACzB,GAAI,GAAQ,GACR,EAAS,GAAW,KAAO,EAAI,EAAQ,OAG3C,IADA,KAAK,QACE,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAQ,GACpB,KAAK,IAAI,EAAM,GAAI,EAAM,KAW7B,aAAyB,CACvB,KAAK,KAAO,EACZ,KAAK,SAAW,CACd,KAAQ,GAAI,GACZ,IAAO,GAAK,KAAO,IACnB,OAAU,GAAI,IAalB,YAAwB,EAAK,CAC3B,GAAI,GAAS,GAAW,KAAM,GAAK,OAAU,GAC7C,YAAK,MAAQ,EAAS,EAAI,EACnB,EAYT,YAAqB,EAAK,CACxB,MAAO,IAAW,KAAM,GAAK,IAAI,GAYnC,YAAqB,EAAK,CACxB,MAAO,IAAW,KAAM,GAAK,IAAI,GAanC,YAAqB,EAAK,EAAO,CAC/B,GAAI,GAAO,GAAW,KAAM,GACxB,EAAO,EAAK,KAEhB,SAAK,IAAI,EAAK,GACd,KAAK,MAAQ,EAAK,MAAQ,EAAO,EAAI,EAC9B,KAIT,GAAS,UAAU,MAAQ,GAC3B,GAAS,UAAU,OAAY,GAC/B,GAAS,UAAU,IAAM,GACzB,GAAS,UAAU,IAAM,GACzB,GAAS,UAAU,IAAM,GAYzB,YAAkB,EAAQ,CACxB,GAAI,GAAQ,GACR,EAAS,GAAU,KAAO,EAAI,EAAO,OAGzC,IADA,KAAK,SAAW,GAAI,IACb,EAAE,EAAQ,GACf,KAAK,IAAI,EAAO,IAcpB,YAAqB,EAAO,CAC1B,YAAK,SAAS,IAAI,EAAO,GAClB,KAYT,YAAqB,EAAO,CAC1B,MAAO,MAAK,SAAS,IAAI,GAI3B,GAAS,UAAU,IAAM,GAAS,UAAU,KAAO,GACnD,GAAS,UAAU,IAAM,GAWzB,YAAe,EAAS,CACtB,GAAI,GAAO,KAAK,SAAW,GAAI,IAAU,GACzC,KAAK,KAAO,EAAK,KAUnB,aAAsB,CACpB,KAAK,SAAW,GAAI,IACpB,KAAK,KAAO,EAYd,YAAqB,EAAK,CACxB,GAAI,GAAO,KAAK,SACZ,EAAS,EAAK,OAAU,GAE5B,YAAK,KAAO,EAAK,KACV,EAYT,YAAkB,EAAK,CACrB,MAAO,MAAK,SAAS,IAAI,GAY3B,YAAkB,EAAK,CACrB,MAAO,MAAK,SAAS,IAAI,GAa3B,YAAkB,EAAK,EAAO,CAC5B,GAAI,GAAO,KAAK,SAChB,GAAI,YAAgB,IAAW,CAC7B,GAAI,GAAQ,EAAK,SACjB,GAAI,CAAC,IAAQ,EAAM,OAAS,EAAmB,EAC7C,SAAM,KAAK,CAAC,EAAK,IACjB,KAAK,KAAO,EAAE,EAAK,KACZ,KAET,EAAO,KAAK,SAAW,GAAI,IAAS,GAEtC,SAAK,IAAI,EAAK,GACd,KAAK,KAAO,EAAK,KACV,KAIT,GAAM,UAAU,MAAQ,GACxB,GAAM,UAAU,OAAY,GAC5B,GAAM,UAAU,IAAM,GACtB,GAAM,UAAU,IAAM,GACtB,GAAM,UAAU,IAAM,GAYtB,YAAuB,EAAO,EAAW,CACvC,GAAI,GAAQ,GAAQ,GAChB,EAAQ,CAAC,GAAS,GAAY,GAC9B,EAAS,CAAC,GAAS,CAAC,GAAS,GAAS,GACtC,EAAS,CAAC,GAAS,CAAC,GAAS,CAAC,GAAU,GAAa,GACrD,EAAc,GAAS,GAAS,GAAU,EAC1C,EAAS,EAAc,GAAU,EAAM,OAAQ,IAAU,GACzD,EAAS,EAAO,OAEpB,OAAS,MAAO,GACd,AAAK,IAAa,GAAe,KAAK,EAAO,MACzC,CAAE,IAEC,KAAO,UAEN,GAAW,KAAO,UAAY,IAAO,WAErC,GAAW,KAAO,UAAY,IAAO,cAAgB,IAAO,eAE7D,GAAQ,GAAK,MAElB,EAAO,KAAK,IAGhB,MAAO,GAUT,YAAqB,EAAO,CAC1B,GAAI,GAAS,EAAM,OACnB,MAAO,GAAS,EAAM,GAAW,EAAG,EAAS,IAAM,EAWrD,YAAyB,EAAO,EAAG,CACjC,MAAO,IAAY,GAAU,GAAQ,GAAU,EAAG,EAAG,EAAM,SAU7D,YAAsB,EAAO,CAC3B,MAAO,IAAY,GAAU,IAY/B,YAA0B,EAAQ,EAAK,EAAO,CAC5C,AAAK,KAAU,GAAa,CAAC,GAAG,EAAO,GAAM,IACxC,IAAU,GAAa,CAAE,KAAO,MACnC,GAAgB,EAAQ,EAAK,GAcjC,YAAqB,EAAQ,EAAK,EAAO,CACvC,GAAI,GAAW,EAAO,GACtB,AAAI,EAAE,IAAe,KAAK,EAAQ,IAAQ,GAAG,EAAU,KAClD,IAAU,GAAa,CAAE,KAAO,MACnC,GAAgB,EAAQ,EAAK,GAYjC,YAAsB,EAAO,EAAK,CAEhC,OADI,GAAS,EAAM,OACZ,KACL,GAAI,GAAG,EAAM,GAAQ,GAAI,GACvB,MAAO,GAGX,MAAO,GAcT,YAAwB,EAAY,EAAQ,EAAU,EAAa,CACjE,UAAS,EAAY,SAAS,EAAO,EAAK,EAAY,CACpD,EAAO,EAAa,EAAO,EAAS,GAAQ,KAEvC,EAYT,YAAoB,EAAQ,EAAQ,CAClC,MAAO,IAAU,GAAW,EAAQ,GAAK,GAAS,GAYpD,YAAsB,EAAQ,EAAQ,CACpC,MAAO,IAAU,GAAW,EAAQ,GAAO,GAAS,GAYtD,YAAyB,EAAQ,EAAK,EAAO,CAC3C,AAAI,GAAO,aAAe,GACxB,GAAe,EAAQ,EAAK,CAC1B,aAAgB,GAChB,WAAc,GACd,MAAS,EACT,SAAY,KAGd,EAAO,GAAO,EAYlB,YAAgB,EAAQ,EAAO,CAM7B,OALI,GAAQ,GACR,EAAS,EAAM,OACf,EAAS,EAAM,GACf,EAAO,GAAU,KAEd,EAAE,EAAQ,GACf,EAAO,GAAS,EAAO,EAAY,GAAI,EAAQ,EAAM,IAEvD,MAAO,GAYT,YAAmB,EAAQ,EAAO,EAAO,CACvC,MAAI,KAAW,GACT,KAAU,GACZ,GAAS,GAAU,EAAQ,EAAS,GAElC,IAAU,GACZ,GAAS,GAAU,EAAQ,EAAS,IAGjC,EAmBT,YAAmB,EAAO,EAAS,EAAY,EAAK,EAAQ,EAAO,CACjE,GAAI,GACA,EAAS,EAAU,EACnB,EAAS,EAAU,EACnB,GAAS,EAAU,EAKvB,GAHI,GACF,GAAS,EAAS,EAAW,EAAO,EAAK,EAAQ,GAAS,EAAW,IAEnE,IAAW,EACb,MAAO,GAET,GAAI,CAAC,GAAS,GACZ,MAAO,GAET,GAAI,IAAQ,GAAQ,GACpB,GAAI,IAEF,GADA,EAAS,GAAe,GACpB,CAAC,EACH,MAAO,IAAU,EAAO,OAErB,CACL,GAAI,IAAM,GAAO,GACb,GAAS,IAAO,IAAW,IAAO,GAEtC,GAAI,GAAS,GACX,MAAO,IAAY,EAAO,GAE5B,GAAI,IAAO,IAAa,IAAO,IAAY,IAAU,CAAC,GAEpD,GADA,EAAU,GAAU,GAAU,GAAK,GAAgB,GAC/C,CAAC,EACH,MAAO,GACH,GAAc,EAAO,GAAa,EAAQ,IAC1C,GAAY,EAAO,GAAW,EAAQ,QAEvC,CACL,GAAI,CAAC,GAAc,IACjB,MAAO,GAAS,EAAQ,GAE1B,EAAS,GAAe,EAAO,GAAK,IAIxC,GAAU,GAAQ,GAAI,KACtB,GAAI,IAAU,EAAM,IAAI,GACxB,GAAI,GACF,MAAO,IAET,EAAM,IAAI,EAAO,GAEjB,AAAI,GAAM,GACR,EAAM,QAAQ,SAAS,GAAU,CAC/B,EAAO,IAAI,GAAU,GAAU,EAAS,EAAY,GAAU,EAAO,MAE9D,GAAM,IACf,EAAM,QAAQ,SAAS,GAAU,GAAK,CACpC,EAAO,IAAI,GAAK,GAAU,GAAU,EAAS,EAAY,GAAK,EAAO,MAIzE,GAAI,IAAW,GACV,EAAS,GAAe,GACxB,EAAS,GAAS,GAEnB,GAAQ,GAAQ,EAAY,GAAS,GACzC,UAAU,IAAS,EAAO,SAAS,GAAU,GAAK,CAChD,AAAI,IACF,IAAM,GACN,GAAW,EAAM,KAGnB,GAAY,EAAQ,GAAK,GAAU,GAAU,EAAS,EAAY,GAAK,EAAO,MAEzE,EAUT,YAAsB,EAAQ,CAC5B,GAAI,GAAQ,GAAK,GACjB,MAAO,UAAS,EAAQ,CACtB,MAAO,IAAe,EAAQ,EAAQ,IAY1C,YAAwB,EAAQ,EAAQ,EAAO,CAC7C,GAAI,GAAS,EAAM,OACnB,GAAI,GAAU,KACZ,MAAO,CAAC,EAGV,IADA,EAAS,GAAO,GACT,KAAU,CACf,GAAI,GAAM,EAAM,GACZ,EAAY,EAAO,GACnB,EAAQ,EAAO,GAEnB,GAAK,IAAU,GAAa,CAAE,KAAO,KAAY,CAAC,EAAU,GAC1D,MAAO,GAGX,MAAO,GAaT,YAAmB,EAAM,EAAM,EAAM,CACnC,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,MAAO,IAAW,UAAW,CAAE,EAAK,MAAM,EAAW,IAAU,GAcjE,YAAwB,EAAO,EAAQ,EAAU,EAAY,CAC3D,GAAI,GAAQ,GACR,EAAW,GACX,EAAW,GACX,EAAS,EAAM,OACf,EAAS,GACT,GAAe,EAAO,OAE1B,GAAI,CAAC,EACH,MAAO,GAET,AAAI,GACF,GAAS,GAAS,EAAQ,GAAU,KAEtC,AAAI,EACF,GAAW,GACX,EAAW,IAEJ,EAAO,QAAU,GACxB,GAAW,GACX,EAAW,GACX,EAAS,GAAI,IAAS,IAExB,EACA,KAAO,EAAE,EAAQ,GAAQ,CACvB,GAAI,IAAQ,EAAM,GACd,GAAW,GAAY,KAAO,GAAQ,EAAS,IAGnD,GADA,GAAS,GAAc,KAAU,EAAK,GAAQ,EAC1C,GAAY,KAAa,GAAU,CAErC,OADI,IAAc,GACX,MACL,GAAI,EAAO,MAAiB,GAC1B,WAGJ,EAAO,KAAK,QAET,AAAK,GAAS,EAAQ,GAAU,IACnC,EAAO,KAAK,IAGhB,MAAO,GAWT,GAAI,IAAW,GAAe,IAU1B,GAAgB,GAAe,GAAiB,IAWpD,YAAmB,EAAY,EAAW,CACxC,GAAI,GAAS,GACb,UAAS,EAAY,SAAS,EAAO,EAAO,EAAY,CACtD,SAAS,CAAC,CAAC,EAAU,EAAO,EAAO,GAC5B,IAEF,EAaT,YAAsB,EAAO,EAAU,EAAY,CAIjD,OAHI,GAAQ,GACR,EAAS,EAAM,OAEZ,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAM,GACd,EAAU,EAAS,GAEvB,GAAI,GAAW,MAAS,KAAa,EAC5B,IAAY,GAAW,CAAC,GAAS,GAClC,EAAW,EAAS,IAE1B,GAAI,GAAW,EACX,EAAS,EAGjB,MAAO,GAaT,YAAkB,EAAO,EAAO,EAAO,EAAK,CAC1C,GAAI,GAAS,EAAM,OAWnB,IATA,EAAQ,GAAU,GACd,EAAQ,GACV,GAAQ,CAAC,EAAQ,EAAS,EAAK,EAAS,GAE1C,EAAO,IAAQ,GAAa,EAAM,EAAU,EAAS,GAAU,GAC3D,EAAM,GACR,IAAO,GAET,EAAM,EAAQ,EAAM,EAAI,GAAS,GAC1B,EAAQ,GACb,EAAM,KAAW,EAEnB,MAAO,GAWT,YAAoB,EAAY,EAAW,CACzC,GAAI,GAAS,GACb,UAAS,EAAY,SAAS,EAAO,EAAO,EAAY,CACtD,AAAI,EAAU,EAAO,EAAO,IAC1B,EAAO,KAAK,KAGT,EAcT,YAAqB,EAAO,EAAO,EAAW,EAAU,EAAQ,CAC9D,GAAI,GAAQ,GACR,EAAS,EAAM,OAKnB,IAHA,GAAc,GAAY,IAC1B,GAAW,GAAS,IAEb,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAM,GAClB,AAAI,EAAQ,GAAK,EAAU,GACzB,AAAI,EAAQ,EAEV,GAAY,EAAO,EAAQ,EAAG,EAAW,EAAU,GAEnD,GAAU,EAAQ,GAEV,GACV,GAAO,EAAO,QAAU,GAG5B,MAAO,GAcT,GAAI,IAAU,KAYV,GAAe,GAAc,IAUjC,YAAoB,EAAQ,EAAU,CACpC,MAAO,IAAU,GAAQ,EAAQ,EAAU,IAW7C,YAAyB,EAAQ,EAAU,CACzC,MAAO,IAAU,GAAa,EAAQ,EAAU,IAYlD,YAAuB,EAAQ,EAAO,CACpC,MAAO,IAAY,EAAO,SAAS,EAAK,CACtC,MAAO,IAAW,EAAO,MAY7B,YAAiB,EAAQ,EAAM,CAC7B,EAAO,GAAS,EAAM,GAKtB,OAHI,GAAQ,EACR,EAAS,EAAK,OAEX,GAAU,MAAQ,EAAQ,GAC/B,EAAS,EAAO,GAAM,EAAK,OAE7B,MAAQ,IAAS,GAAS,EAAU,EAAS,EAc/C,YAAwB,EAAQ,EAAU,EAAa,CACrD,GAAI,GAAS,EAAS,GACtB,MAAO,IAAQ,GAAU,EAAS,GAAU,EAAQ,EAAY,IAUlE,YAAoB,EAAO,CACzB,MAAI,IAAS,KACJ,IAAU,EAAY,GAAe,GAEtC,IAAkB,KAAkB,IAAO,GAC/C,GAAU,GACV,GAAe,GAYrB,YAAgB,EAAO,EAAO,CAC5B,MAAO,GAAQ,EAWjB,YAAiB,EAAQ,EAAK,CAC5B,MAAO,IAAU,MAAQ,GAAe,KAAK,EAAQ,GAWvD,YAAmB,EAAQ,EAAK,CAC9B,MAAO,IAAU,MAAQ,IAAO,IAAO,GAYzC,YAAqB,EAAQ,EAAO,EAAK,CACvC,MAAO,IAAU,GAAU,EAAO,IAAQ,EAAS,GAAU,EAAO,GAatE,YAA0B,EAAQ,EAAU,EAAY,CAStD,OARI,GAAW,EAAa,GAAoB,GAC5C,EAAS,EAAO,GAAG,OACnB,EAAY,EAAO,OACnB,EAAW,EACX,EAAS,EAAM,GACf,EAAY,SACZ,GAAS,GAEN,KAAY,CACjB,GAAI,IAAQ,EAAO,GACnB,AAAI,GAAY,GACd,IAAQ,GAAS,GAAO,GAAU,KAEpC,EAAY,GAAU,GAAM,OAAQ,GACpC,EAAO,GAAY,CAAC,GAAe,IAAa,GAAU,KAAO,GAAM,QAAU,KAC7E,GAAI,IAAS,GAAY,IACzB,EAEN,GAAQ,EAAO,GAEf,GAAI,IAAQ,GACR,GAAO,EAAO,GAElB,EACA,KAAO,EAAE,GAAQ,GAAU,GAAO,OAAS,GAAW,CACpD,GAAI,IAAQ,GAAM,IACd,GAAW,EAAW,EAAS,IAAS,GAG5C,GADA,GAAS,GAAc,KAAU,EAAK,GAAQ,EAC1C,CAAE,IACE,GAAS,GAAM,IACf,EAAS,GAAQ,GAAU,IAC5B,CAEL,IADA,EAAW,EACJ,EAAE,GAAU,CACjB,GAAI,IAAQ,EAAO,GACnB,GAAI,CAAE,IACE,GAAS,GAAO,IAChB,EAAS,EAAO,GAAW,GAAU,IAE3C,WAGJ,AAAI,IACF,GAAK,KAAK,IAEZ,GAAO,KAAK,KAGhB,MAAO,IAcT,YAAsB,EAAQ,EAAQ,EAAU,EAAa,CAC3D,UAAW,EAAQ,SAAS,EAAO,EAAK,EAAQ,CAC9C,EAAO,EAAa,EAAS,GAAQ,EAAK,KAErC,EAaT,YAAoB,EAAQ,EAAM,EAAM,CACtC,EAAO,GAAS,EAAM,GACtB,EAAS,GAAO,EAAQ,GACxB,GAAI,GAAO,GAAU,KAAO,EAAS,EAAO,GAAM,GAAK,KACvD,MAAO,IAAQ,KAAO,EAAY,GAAM,EAAM,EAAQ,GAUxD,YAAyB,EAAO,CAC9B,MAAO,IAAa,IAAU,GAAW,IAAU,GAUrD,YAA2B,EAAO,CAChC,MAAO,IAAa,IAAU,GAAW,IAAU,GAUrD,YAAoB,EAAO,CACzB,MAAO,IAAa,IAAU,GAAW,IAAU,GAiBrD,YAAqB,EAAO,EAAO,EAAS,EAAY,EAAO,CAC7D,MAAI,KAAU,EACL,GAEL,GAAS,MAAQ,GAAS,MAAS,CAAC,GAAa,IAAU,CAAC,GAAa,GACpE,IAAU,GAAS,IAAU,EAE/B,GAAgB,EAAO,EAAO,EAAS,EAAY,GAAa,GAiBzE,YAAyB,EAAQ,EAAO,EAAS,EAAY,EAAW,EAAO,CAC7E,GAAI,GAAW,GAAQ,GACnB,EAAW,GAAQ,GACnB,EAAS,EAAW,GAAW,GAAO,GACtC,GAAS,EAAW,GAAW,GAAO,GAE1C,EAAS,GAAU,GAAU,GAAY,EACzC,GAAS,IAAU,GAAU,GAAY,GAEzC,GAAI,IAAW,GAAU,GACrB,GAAW,IAAU,GACrB,GAAY,GAAU,GAE1B,GAAI,IAAa,GAAS,GAAS,CACjC,GAAI,CAAC,GAAS,GACZ,MAAO,GAET,EAAW,GACX,GAAW,GAEb,GAAI,IAAa,CAAC,GAChB,UAAU,GAAQ,GAAI,KACd,GAAY,GAAa,GAC7B,GAAY,EAAQ,EAAO,EAAS,EAAY,EAAW,GAC3D,GAAW,EAAQ,EAAO,EAAQ,EAAS,EAAY,EAAW,GAExE,GAAI,CAAE,GAAU,GAAuB,CACrC,GAAI,IAAe,IAAY,GAAe,KAAK,EAAQ,eACvD,GAAe,IAAY,GAAe,KAAK,EAAO,eAE1D,GAAI,IAAgB,GAAc,CAChC,GAAI,IAAe,GAAe,EAAO,QAAU,EAC/C,GAAe,GAAe,EAAM,QAAU,EAElD,UAAU,GAAQ,GAAI,KACf,EAAU,GAAc,GAAc,EAAS,EAAY,IAGtE,MAAK,IAGL,IAAU,GAAQ,GAAI,KACf,GAAa,EAAQ,EAAO,EAAS,EAAY,EAAW,IAH1D,GAaX,YAAmB,EAAO,CACxB,MAAO,IAAa,IAAU,GAAO,IAAU,GAajD,YAAqB,EAAQ,EAAQ,EAAW,EAAY,CAC1D,GAAI,GAAQ,EAAU,OAClB,EAAS,EACT,EAAe,CAAC,EAEpB,GAAI,GAAU,KACZ,MAAO,CAAC,EAGV,IADA,EAAS,GAAO,GACT,KAAS,CACd,GAAI,GAAO,EAAU,GACrB,GAAK,GAAgB,EAAK,GAClB,EAAK,KAAO,EAAO,EAAK,IACxB,CAAE,GAAK,IAAM,IAEnB,MAAO,GAGX,KAAO,EAAE,EAAQ,GAAQ,CACvB,EAAO,EAAU,GACjB,GAAI,GAAM,EAAK,GACX,GAAW,EAAO,GAClB,GAAW,EAAK,GAEpB,GAAI,GAAgB,EAAK,IACvB,GAAI,KAAa,GAAa,CAAE,KAAO,IACrC,MAAO,OAEJ,CACL,GAAI,IAAQ,GAAI,IAChB,GAAI,EACF,GAAI,IAAS,EAAW,GAAU,GAAU,EAAK,EAAQ,EAAQ,IAEnE,GAAI,CAAE,MAAW,EACT,GAAY,GAAU,GAAU,EAAuB,EAAwB,EAAY,IAC3F,IAEN,MAAO,IAIb,MAAO,GAWT,YAAsB,EAAO,CAC3B,GAAI,CAAC,GAAS,IAAU,GAAS,GAC/B,MAAO,GAET,GAAI,GAAU,GAAW,GAAS,GAAa,GAC/C,MAAO,GAAQ,KAAK,GAAS,IAU/B,YAAsB,EAAO,CAC3B,MAAO,IAAa,IAAU,GAAW,IAAU,GAUrD,YAAmB,EAAO,CACxB,MAAO,IAAa,IAAU,GAAO,IAAU,GAUjD,YAA0B,EAAO,CAC/B,MAAO,IAAa,IAClB,GAAS,EAAM,SAAW,CAAC,CAAC,GAAe,GAAW,IAU1D,YAAsB,EAAO,CAG3B,MAAI,OAAO,IAAS,WACX,EAEL,GAAS,KACJ,GAEL,MAAO,IAAS,SACX,GAAQ,GACX,GAAoB,EAAM,GAAI,EAAM,IACpC,GAAY,GAEX,GAAS,GAUlB,YAAkB,EAAQ,CACxB,GAAI,CAAC,GAAY,GACf,MAAO,IAAW,GAEpB,GAAI,GAAS,GACb,OAAS,KAAO,IAAO,GACrB,AAAI,GAAe,KAAK,EAAQ,IAAQ,GAAO,eAC7C,EAAO,KAAK,GAGhB,MAAO,GAUT,YAAoB,EAAQ,CAC1B,GAAI,CAAC,GAAS,GACZ,MAAO,IAAa,GAEtB,GAAI,GAAU,GAAY,GACtB,EAAS,GAEb,OAAS,KAAO,GACd,AAAM,GAAO,eAAkB,IAAW,CAAC,GAAe,KAAK,EAAQ,KACrE,EAAO,KAAK,GAGhB,MAAO,GAYT,YAAgB,EAAO,EAAO,CAC5B,MAAO,GAAQ,EAWjB,YAAiB,EAAY,EAAU,CACrC,GAAI,GAAQ,GACR,EAAS,GAAY,GAAc,EAAM,EAAW,QAAU,GAElE,UAAS,EAAY,SAAS,EAAO,EAAK,EAAY,CACpD,EAAO,EAAE,GAAS,EAAS,EAAO,EAAK,KAElC,EAUT,YAAqB,EAAQ,CAC3B,GAAI,GAAY,GAAa,GAC7B,MAAI,GAAU,QAAU,GAAK,EAAU,GAAG,GACjC,GAAwB,EAAU,GAAG,GAAI,EAAU,GAAG,IAExD,SAAS,EAAQ,CACtB,MAAO,KAAW,GAAU,GAAY,EAAQ,EAAQ,IAY5D,YAA6B,EAAM,EAAU,CAC3C,MAAI,IAAM,IAAS,GAAmB,GAC7B,GAAwB,GAAM,GAAO,GAEvC,SAAS,EAAQ,CACtB,GAAI,GAAW,GAAI,EAAQ,GAC3B,MAAQ,KAAa,GAAa,IAAa,EAC3C,GAAM,EAAQ,GACd,GAAY,EAAU,EAAU,EAAuB,IAe/D,YAAmB,EAAQ,EAAQ,EAAU,EAAY,EAAO,CAC9D,AAAI,IAAW,GAGf,GAAQ,EAAQ,SAAS,EAAU,EAAK,CAEtC,GADA,GAAU,GAAQ,GAAI,KAClB,GAAS,GACX,GAAc,EAAQ,EAAQ,EAAK,EAAU,GAAW,EAAY,OAEjE,CACH,GAAI,GAAW,EACX,EAAW,GAAQ,EAAQ,GAAM,EAAW,EAAM,GAAK,EAAQ,EAAQ,GACvE,EAEJ,AAAI,IAAa,GACf,GAAW,GAEb,GAAiB,EAAQ,EAAK,KAE/B,IAkBL,YAAuB,EAAQ,EAAQ,EAAK,EAAU,EAAW,EAAY,EAAO,CAClF,GAAI,GAAW,GAAQ,EAAQ,GAC3B,EAAW,GAAQ,EAAQ,GAC3B,GAAU,EAAM,IAAI,GAExB,GAAI,GAAS,CACX,GAAiB,EAAQ,EAAK,IAC9B,OAEF,GAAI,IAAW,EACX,EAAW,EAAU,EAAW,EAAM,GAAK,EAAQ,EAAQ,GAC3D,EAEA,GAAW,KAAa,EAE5B,GAAI,GAAU,CACZ,GAAI,IAAQ,GAAQ,GAChB,GAAS,CAAC,IAAS,GAAS,GAC5B,GAAU,CAAC,IAAS,CAAC,IAAU,GAAa,GAEhD,GAAW,EACX,AAAI,IAAS,IAAU,GACrB,AAAI,GAAQ,GACV,GAAW,EAER,AAAI,GAAkB,GACzB,GAAW,GAAU,GAElB,AAAI,GACP,IAAW,GACX,GAAW,GAAY,EAAU,KAE9B,AAAI,GACP,IAAW,GACX,GAAW,GAAgB,EAAU,KAGrC,GAAW,GAGV,AAAI,GAAc,IAAa,GAAY,GAC9C,IAAW,EACX,AAAI,GAAY,GACd,GAAW,GAAc,GAElB,EAAC,GAAS,IAAa,GAAW,KACzC,IAAW,GAAgB,KAI7B,GAAW,GAGf,AAAI,IAEF,GAAM,IAAI,EAAU,IACpB,EAAU,GAAU,EAAU,EAAU,EAAY,GACpD,EAAM,OAAU,IAElB,GAAiB,EAAQ,EAAK,IAWhC,YAAiB,EAAO,EAAG,CACzB,GAAI,GAAS,EAAM,OACnB,GAAI,EAAC,EAGL,UAAK,EAAI,EAAI,EAAS,EACf,GAAQ,EAAG,GAAU,EAAM,GAAK,EAYzC,YAAqB,EAAY,EAAW,EAAQ,CAClD,AAAI,EAAU,OACZ,EAAY,GAAS,EAAW,SAAS,EAAU,CACjD,MAAI,IAAQ,GACH,SAAS,EAAO,CACrB,MAAO,IAAQ,EAAO,EAAS,SAAW,EAAI,EAAS,GAAK,IAGzD,IAGT,EAAY,CAAC,IAGf,GAAI,GAAQ,GACZ,EAAY,GAAS,EAAW,GAAU,OAE1C,GAAI,GAAS,GAAQ,EAAY,SAAS,EAAO,EAAK,EAAY,CAChE,GAAI,GAAW,GAAS,EAAW,SAAS,GAAU,CACpD,MAAO,IAAS,KAElB,MAAO,CAAE,SAAY,EAAU,MAAS,EAAE,EAAO,MAAS,KAG5D,MAAO,IAAW,EAAQ,SAAS,EAAQ,EAAO,CAChD,MAAO,IAAgB,EAAQ,EAAO,KAa1C,YAAkB,EAAQ,EAAO,CAC/B,MAAO,IAAW,EAAQ,EAAO,SAAS,EAAO,EAAM,CACrD,MAAO,IAAM,EAAQ,KAazB,YAAoB,EAAQ,EAAO,EAAW,CAK5C,OAJI,GAAQ,GACR,EAAS,EAAM,OACf,EAAS,GAEN,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAO,EAAM,GACb,EAAQ,GAAQ,EAAQ,GAE5B,AAAI,EAAU,EAAO,IACnB,GAAQ,EAAQ,GAAS,EAAM,GAAS,GAG5C,MAAO,GAUT,YAA0B,EAAM,CAC9B,MAAO,UAAS,EAAQ,CACtB,MAAO,IAAQ,EAAQ,IAe3B,YAAqB,EAAO,EAAQ,EAAU,EAAY,CACxD,GAAI,GAAU,EAAa,EAAkB,EACzC,EAAQ,GACR,EAAS,EAAO,OAChB,EAAO,EAQX,IANI,IAAU,GACZ,GAAS,GAAU,IAEjB,GACF,GAAO,GAAS,EAAO,GAAU,KAE5B,EAAE,EAAQ,GAKf,OAJI,GAAY,EACZ,GAAQ,EAAO,GACf,GAAW,EAAW,EAAS,IAAS,GAEpC,GAAY,EAAQ,EAAM,GAAU,EAAW,IAAe,IACpE,AAAI,IAAS,GACX,GAAO,KAAK,EAAM,EAAW,GAE/B,GAAO,KAAK,EAAO,EAAW,GAGlC,MAAO,GAYT,YAAoB,EAAO,EAAS,CAIlC,OAHI,GAAS,EAAQ,EAAQ,OAAS,EAClC,EAAY,EAAS,EAElB,KAAU,CACf,GAAI,GAAQ,EAAQ,GACpB,GAAI,GAAU,GAAa,IAAU,EAAU,CAC7C,GAAI,GAAW,EACf,AAAI,GAAQ,GACV,GAAO,KAAK,EAAO,EAAO,GAE1B,GAAU,EAAO,IAIvB,MAAO,GAYT,YAAoB,EAAO,EAAO,CAChC,MAAO,GAAQ,GAAY,KAAkB,GAAQ,EAAQ,IAc/D,YAAmB,EAAO,EAAK,EAAM,EAAW,CAK9C,OAJI,GAAQ,GACR,EAAS,GAAU,GAAY,GAAM,GAAU,IAAQ,IAAK,GAC5D,EAAS,EAAM,GAEZ,KACL,EAAO,EAAY,EAAS,EAAE,GAAS,EACvC,GAAS,EAEX,MAAO,GAWT,YAAoB,EAAQ,EAAG,CAC7B,GAAI,GAAS,GACb,GAAI,CAAC,GAAU,EAAI,GAAK,EAAI,GAC1B,MAAO,GAIT,EACE,AAAI,GAAI,GACN,IAAU,GAEZ,EAAI,GAAY,EAAI,GAChB,GACF,IAAU,SAEL,GAET,MAAO,GAWT,YAAkB,EAAM,EAAO,CAC7B,MAAO,IAAY,GAAS,EAAM,EAAO,IAAW,EAAO,IAU7D,YAAoB,EAAY,CAC9B,MAAO,IAAY,GAAO,IAW5B,YAAwB,EAAY,EAAG,CACrC,GAAI,GAAQ,GAAO,GACnB,MAAO,IAAY,EAAO,GAAU,EAAG,EAAG,EAAM,SAalD,YAAiB,EAAQ,EAAM,EAAO,EAAY,CAChD,GAAI,CAAC,GAAS,GACZ,MAAO,GAET,EAAO,GAAS,EAAM,GAOtB,OALI,GAAQ,GACR,EAAS,EAAK,OACd,EAAY,EAAS,EACrB,EAAS,EAEN,GAAU,MAAQ,EAAE,EAAQ,GAAQ,CACzC,GAAI,GAAM,GAAM,EAAK,IACjB,GAAW,EAEf,GAAI,IAAQ,aAAe,IAAQ,eAAiB,IAAQ,YAC1D,MAAO,GAGT,GAAI,GAAS,EAAW,CACtB,GAAI,IAAW,EAAO,GACtB,GAAW,EAAa,EAAW,GAAU,EAAK,GAAU,EACxD,KAAa,GACf,IAAW,GAAS,IAChB,GACC,GAAQ,EAAK,EAAQ,IAAM,GAAK,IAGzC,GAAY,EAAQ,EAAK,IACzB,EAAS,EAAO,GAElB,MAAO,GAWT,GAAI,IAAc,AAAC,GAAqB,SAAS,EAAM,EAAM,CAC3D,UAAQ,IAAI,EAAM,GACX,GAFoB,GAazB,GAAkB,AAAC,GAA4B,SAAS,EAAM,EAAQ,CACxE,MAAO,IAAe,EAAM,WAAY,CACtC,aAAgB,GAChB,WAAc,GACd,MAAS,GAAS,GAClB,SAAY,MALwB,GAgBxC,YAAqB,EAAY,CAC/B,MAAO,IAAY,GAAO,IAY5B,YAAmB,EAAO,EAAO,EAAK,CACpC,GAAI,GAAQ,GACR,EAAS,EAAM,OAEnB,AAAI,EAAQ,GACV,GAAQ,CAAC,EAAQ,EAAS,EAAK,EAAS,GAE1C,EAAM,EAAM,EAAS,EAAS,EAC1B,EAAM,GACR,IAAO,GAET,EAAS,EAAQ,EAAM,EAAM,EAAM,IAAW,EAC9C,KAAW,EAGX,OADI,GAAS,EAAM,GACZ,EAAE,EAAQ,GACf,EAAO,GAAS,EAAM,EAAQ,GAEhC,MAAO,GAYT,YAAkB,EAAY,EAAW,CACvC,GAAI,GAEJ,UAAS,EAAY,SAAS,EAAO,EAAO,EAAY,CACtD,SAAS,EAAU,EAAO,EAAO,GAC1B,CAAC,IAEH,CAAC,CAAC,EAeX,YAAyB,EAAO,EAAO,EAAY,CACjD,GAAI,GAAM,EACN,EAAO,GAAS,KAAO,EAAM,EAAM,OAEvC,GAAI,MAAO,IAAS,UAAY,IAAU,GAAS,GAAQ,GAAuB,CAChF,KAAO,EAAM,GAAM,CACjB,GAAI,GAAO,EAAM,IAAU,EACvB,EAAW,EAAM,GAErB,AAAI,IAAa,MAAQ,CAAC,GAAS,IAC9B,GAAc,GAAY,EAAU,EAAW,GAClD,EAAM,EAAM,EAEZ,EAAO,EAGX,MAAO,GAET,MAAO,IAAkB,EAAO,EAAO,GAAU,GAgBnD,YAA2B,EAAO,EAAO,EAAU,EAAY,CAC7D,GAAI,GAAM,EACN,EAAO,GAAS,KAAO,EAAI,EAAM,OACrC,GAAI,IAAS,EACX,MAAO,GAGT,EAAQ,EAAS,GAMjB,OALI,GAAW,IAAU,EACrB,EAAY,IAAU,KACtB,EAAc,GAAS,GACvB,GAAiB,IAAU,EAExB,EAAM,GAAM,CACjB,GAAI,IAAM,GAAa,GAAM,GAAQ,GACjC,GAAW,EAAS,EAAM,KAC1B,GAAe,KAAa,EAC5B,GAAY,KAAa,KACzB,GAAiB,KAAa,GAC9B,GAAc,GAAS,IAE3B,GAAI,EACF,GAAI,IAAS,GAAc,OACtB,AAAI,IACT,GAAS,IAAmB,IAAc,IACrC,AAAI,EACT,GAAS,IAAkB,IAAiB,IAAc,CAAC,IACtD,AAAI,EACT,GAAS,IAAkB,IAAgB,CAAC,IAAc,IAAc,CAAC,IACpE,AAAI,IAAa,GACtB,GAAS,GAET,GAAS,EAAc,IAAY,EAAU,GAAW,EAE1D,AAAI,GACF,EAAM,GAAM,EAEZ,EAAO,GAGX,MAAO,IAAU,EAAM,IAYzB,YAAwB,EAAO,EAAU,CAMvC,OALI,GAAQ,GACR,EAAS,EAAM,OACf,EAAW,EACX,EAAS,GAEN,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAM,GACd,EAAW,EAAW,EAAS,GAAS,EAE5C,GAAI,CAAC,GAAS,CAAC,GAAG,EAAU,GAAO,CACjC,GAAI,GAAO,EACX,EAAO,KAAc,IAAU,EAAI,EAAI,GAG3C,MAAO,GAWT,YAAsB,EAAO,CAC3B,MAAI,OAAO,IAAS,SACX,EAEL,GAAS,GACJ,GAEF,CAAC,EAWV,YAAsB,EAAO,CAE3B,GAAI,MAAO,IAAS,SAClB,MAAO,GAET,GAAI,GAAQ,GAEV,MAAO,IAAS,EAAO,IAAgB,GAEzC,GAAI,GAAS,GACX,MAAO,IAAiB,GAAe,KAAK,GAAS,GAEvD,GAAI,GAAU,EAAQ,GACtB,MAAQ,IAAU,KAAQ,EAAI,GAAU,CAAC,GAAY,KAAO,EAY9D,YAAkB,EAAO,EAAU,EAAY,CAC7C,GAAI,GAAQ,GACR,EAAW,GACX,EAAS,EAAM,OACf,EAAW,GACX,EAAS,GACT,EAAO,EAEX,GAAI,EACF,EAAW,GACX,EAAW,WAEJ,GAAU,EAAkB,CACnC,GAAI,IAAM,EAAW,KAAO,GAAU,GACtC,GAAI,GACF,MAAO,IAAW,IAEpB,EAAW,GACX,EAAW,GACX,EAAO,GAAI,QAGX,GAAO,EAAW,GAAK,EAEzB,EACA,KAAO,EAAE,EAAQ,GAAQ,CACvB,GAAI,IAAQ,EAAM,GACd,GAAW,EAAW,EAAS,IAAS,GAG5C,GADA,GAAS,GAAc,KAAU,EAAK,GAAQ,EAC1C,GAAY,KAAa,GAAU,CAErC,OADI,IAAY,EAAK,OACd,MACL,GAAI,EAAK,MAAe,GACtB,WAGJ,AAAI,GACF,EAAK,KAAK,IAEZ,EAAO,KAAK,QAET,AAAK,GAAS,EAAM,GAAU,IAC7B,KAAS,GACX,EAAK,KAAK,IAEZ,EAAO,KAAK,KAGhB,MAAO,GAWT,YAAmB,EAAQ,EAAM,CAC/B,SAAO,GAAS,EAAM,GACtB,EAAS,GAAO,EAAQ,GACjB,GAAU,MAAQ,MAAO,GAAO,GAAM,GAAK,KAapD,YAAoB,EAAQ,EAAM,EAAS,EAAY,CACrD,MAAO,IAAQ,EAAQ,EAAM,EAAQ,GAAQ,EAAQ,IAAQ,GAc/D,YAAmB,EAAO,EAAW,EAAQ,EAAW,CAItD,OAHI,GAAS,EAAM,OACf,EAAQ,EAAY,EAAS,GAEzB,GAAY,IAAU,EAAE,EAAQ,IACtC,EAAU,EAAM,GAAQ,EAAO,IAAQ,CAEzC,MAAO,GACH,GAAU,EAAQ,EAAY,EAAI,EAAS,EAAY,EAAQ,EAAI,GACnE,GAAU,EAAQ,EAAY,EAAQ,EAAI,EAAK,EAAY,EAAS,GAa1E,YAA0B,EAAO,EAAS,CACxC,GAAI,GAAS,EACb,MAAI,aAAkB,IACpB,GAAS,EAAO,SAEX,GAAY,EAAS,SAAS,EAAQ,EAAQ,CACnD,MAAO,GAAO,KAAK,MAAM,EAAO,QAAS,GAAU,CAAC,GAAS,EAAO,QACnE,GAaL,YAAiB,EAAQ,EAAU,EAAY,CAC7C,GAAI,GAAS,EAAO,OACpB,GAAI,EAAS,EACX,MAAO,GAAS,GAAS,EAAO,IAAM,GAKxC,OAHI,GAAQ,GACR,EAAS,EAAM,GAEZ,EAAE,EAAQ,GAIf,OAHI,GAAQ,EAAO,GACf,EAAW,GAER,EAAE,EAAW,GAClB,AAAI,GAAY,GACd,GAAO,GAAS,GAAe,EAAO,IAAU,EAAO,EAAO,GAAW,EAAU,IAIzF,MAAO,IAAS,GAAY,EAAQ,GAAI,EAAU,GAYpD,YAAuB,EAAO,EAAQ,EAAY,CAMhD,OALI,GAAQ,GACR,EAAS,EAAM,OACf,EAAa,EAAO,OACpB,EAAS,GAEN,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAQ,EAAa,EAAO,GAAS,EACjD,EAAW,EAAQ,EAAM,GAAQ,GAEnC,MAAO,GAUT,YAA6B,EAAO,CAClC,MAAO,IAAkB,GAAS,EAAQ,GAU5C,YAAsB,EAAO,CAC3B,MAAO,OAAO,IAAS,WAAa,EAAQ,GAW9C,YAAkB,EAAO,EAAQ,CAC/B,MAAI,IAAQ,GACH,EAEF,GAAM,EAAO,GAAU,CAAC,GAAS,GAAa,GAAS,IAYhE,GAAI,IAAW,GAWf,YAAmB,EAAO,EAAO,EAAK,CACpC,GAAI,GAAS,EAAM,OACnB,SAAM,IAAQ,EAAY,EAAS,EAC3B,CAAC,GAAS,GAAO,EAAU,EAAQ,GAAU,EAAO,EAAO,GASrE,GAAI,IAAe,IAAmB,SAAS,EAAI,CACjD,MAAO,IAAK,aAAa,IAW3B,YAAqB,EAAQ,EAAQ,CACnC,GAAI,EACF,MAAO,GAAO,QAEhB,GAAI,GAAS,EAAO,OAChB,EAAS,GAAc,GAAY,GAAU,GAAI,GAAO,YAAY,GAExE,SAAO,KAAK,GACL,EAUT,YAA0B,EAAa,CACrC,GAAI,GAAS,GAAI,GAAY,YAAY,EAAY,YACrD,UAAI,IAAW,GAAQ,IAAI,GAAI,IAAW,IACnC,EAWT,YAAuB,EAAU,EAAQ,CACvC,GAAI,GAAS,EAAS,GAAiB,EAAS,QAAU,EAAS,OACnE,MAAO,IAAI,GAAS,YAAY,EAAQ,EAAS,WAAY,EAAS,YAUxE,YAAqB,EAAQ,CAC3B,GAAI,GAAS,GAAI,GAAO,YAAY,EAAO,OAAQ,GAAQ,KAAK,IAChE,SAAO,UAAY,EAAO,UACnB,EAUT,YAAqB,EAAQ,CAC3B,MAAO,IAAgB,GAAO,GAAc,KAAK,IAAW,GAW9D,YAAyB,EAAY,EAAQ,CAC3C,GAAI,GAAS,EAAS,GAAiB,EAAW,QAAU,EAAW,OACvE,MAAO,IAAI,GAAW,YAAY,EAAQ,EAAW,WAAY,EAAW,QAW9E,YAA0B,EAAO,EAAO,CACtC,GAAI,IAAU,EAAO,CACnB,GAAI,GAAe,IAAU,EACzB,EAAY,IAAU,KACtB,EAAiB,IAAU,EAC3B,EAAc,GAAS,GAEvB,EAAe,IAAU,EACzB,EAAY,IAAU,KACtB,EAAiB,IAAU,EAC3B,GAAc,GAAS,GAE3B,GAAK,CAAC,GAAa,CAAC,IAAe,CAAC,GAAe,EAAQ,GACtD,GAAe,GAAgB,GAAkB,CAAC,GAAa,CAAC,IAChE,GAAa,GAAgB,GAC7B,CAAC,GAAgB,GAClB,CAAC,EACH,MAAO,GAET,GAAK,CAAC,GAAa,CAAC,GAAe,CAAC,IAAe,EAAQ,GACtD,IAAe,GAAgB,GAAkB,CAAC,GAAa,CAAC,GAChE,GAAa,GAAgB,GAC7B,CAAC,GAAgB,GAClB,CAAC,EACH,MAAO,GAGX,MAAO,GAiBT,YAAyB,EAAQ,EAAO,EAAQ,CAO9C,OANI,GAAQ,GACR,EAAc,EAAO,SACrB,EAAc,EAAM,SACpB,EAAS,EAAY,OACrB,EAAe,EAAO,OAEnB,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAS,GAAiB,EAAY,GAAQ,EAAY,IAC9D,GAAI,EAAQ,CACV,GAAI,GAAS,EACX,MAAO,GAET,GAAI,IAAQ,EAAO,GACnB,MAAO,GAAU,KAAS,OAAS,GAAK,IAU5C,MAAO,GAAO,MAAQ,EAAM,MAc9B,YAAqB,EAAM,EAAU,EAAS,EAAW,CAUvD,OATI,GAAY,GACZ,EAAa,EAAK,OAClB,EAAgB,EAAQ,OACxB,EAAY,GACZ,EAAa,EAAS,OACtB,GAAc,GAAU,EAAa,EAAe,GACpD,GAAS,EAAM,EAAa,IAC5B,GAAc,CAAC,EAEZ,EAAE,EAAY,GACnB,GAAO,GAAa,EAAS,GAE/B,KAAO,EAAE,EAAY,GACnB,AAAI,KAAe,EAAY,IAC7B,IAAO,EAAQ,IAAc,EAAK,IAGtC,KAAO,MACL,GAAO,KAAe,EAAK,KAE7B,MAAO,IAcT,YAA0B,EAAM,EAAU,EAAS,EAAW,CAW5D,OAVI,GAAY,GACZ,EAAa,EAAK,OAClB,EAAe,GACf,EAAgB,EAAQ,OACxB,EAAa,GACb,GAAc,EAAS,OACvB,GAAc,GAAU,EAAa,EAAe,GACpD,GAAS,EAAM,GAAc,IAC7B,GAAc,CAAC,EAEZ,EAAE,EAAY,IACnB,GAAO,GAAa,EAAK,GAG3B,OADI,IAAS,EACN,EAAE,EAAa,IACpB,GAAO,GAAS,GAAc,EAAS,GAEzC,KAAO,EAAE,EAAe,GACtB,AAAI,KAAe,EAAY,IAC7B,IAAO,GAAS,EAAQ,IAAiB,EAAK,MAGlD,MAAO,IAWT,YAAmB,EAAQ,EAAO,CAChC,GAAI,GAAQ,GACR,EAAS,EAAO,OAGpB,IADA,GAAU,GAAQ,EAAM,IACjB,EAAE,EAAQ,GACf,EAAM,GAAS,EAAO,GAExB,MAAO,GAaT,YAAoB,EAAQ,EAAO,EAAQ,EAAY,CACrD,GAAI,GAAQ,CAAC,EACb,GAAW,GAAS,IAKpB,OAHI,GAAQ,GACR,EAAS,EAAM,OAEZ,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAM,EAAM,GAEZ,EAAW,EACX,EAAW,EAAO,GAAM,EAAO,GAAM,EAAK,EAAQ,GAClD,EAEJ,AAAI,IAAa,GACf,GAAW,EAAO,IAEpB,AAAI,EACF,GAAgB,EAAQ,EAAK,GAE7B,GAAY,EAAQ,EAAK,GAG7B,MAAO,GAWT,YAAqB,EAAQ,EAAQ,CACnC,MAAO,IAAW,EAAQ,GAAW,GAAS,GAWhD,YAAuB,EAAQ,EAAQ,CACrC,MAAO,IAAW,EAAQ,GAAa,GAAS,GAWlD,YAA0B,EAAQ,EAAa,CAC7C,MAAO,UAAS,EAAY,EAAU,CACpC,GAAI,GAAO,GAAQ,GAAc,GAAkB,GAC/C,EAAc,EAAc,IAAgB,GAEhD,MAAO,GAAK,EAAY,EAAQ,GAAY,EAAU,GAAI,IAW9D,YAAwB,EAAU,CAChC,MAAO,IAAS,SAAS,EAAQ,EAAS,CACxC,GAAI,GAAQ,GACR,EAAS,EAAQ,OACjB,EAAa,EAAS,EAAI,EAAQ,EAAS,GAAK,EAChD,EAAQ,EAAS,EAAI,EAAQ,GAAK,EAWtC,IATA,EAAc,EAAS,OAAS,GAAK,MAAO,IAAc,WACrD,KAAU,GACX,EAEA,GAAS,GAAe,EAAQ,GAAI,EAAQ,GAAI,IAClD,GAAa,EAAS,EAAI,EAAY,EACtC,EAAS,GAEX,EAAS,GAAO,GACT,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAS,EAAQ,GACrB,AAAI,GACF,EAAS,EAAQ,EAAQ,EAAO,GAGpC,MAAO,KAYX,YAAwB,EAAU,EAAW,CAC3C,MAAO,UAAS,EAAY,EAAU,CACpC,GAAI,GAAc,KAChB,MAAO,GAET,GAAI,CAAC,GAAY,GACf,MAAO,GAAS,EAAY,GAM9B,OAJI,GAAS,EAAW,OACpB,EAAQ,EAAY,EAAS,GAC7B,EAAW,GAAO,GAEd,GAAY,IAAU,EAAE,EAAQ,IAClC,EAAS,EAAS,GAAQ,EAAO,KAAc,IAAnD,CAIF,MAAO,IAWX,YAAuB,EAAW,CAChC,MAAO,UAAS,EAAQ,EAAU,EAAU,CAM1C,OALI,GAAQ,GACR,EAAW,GAAO,GAClB,EAAQ,EAAS,GACjB,EAAS,EAAM,OAEZ,KAAU,CACf,GAAI,GAAM,EAAM,EAAY,EAAS,EAAE,GACvC,GAAI,EAAS,EAAS,GAAM,EAAK,KAAc,GAC7C,MAGJ,MAAO,IAcX,YAAoB,EAAM,EAAS,EAAS,CAC1C,GAAI,GAAS,EAAU,EACnB,EAAO,GAAW,GAEtB,YAAmB,CACjB,GAAI,GAAM,MAAQ,OAAS,IAAQ,eAAgB,GAAW,EAAO,EACrE,MAAO,GAAG,MAAM,EAAS,EAAU,KAAM,WAE3C,MAAO,GAUT,YAAyB,EAAY,CACnC,MAAO,UAAS,EAAQ,CACtB,EAAS,GAAS,GAElB,GAAI,GAAa,GAAW,GACxB,GAAc,GACd,EAEA,EAAM,EACN,EAAW,GACX,EAAO,OAAO,GAEd,EAAW,EACX,GAAU,EAAY,GAAG,KAAK,IAC9B,EAAO,MAAM,GAEjB,MAAO,GAAI,KAAgB,GAW/B,YAA0B,EAAU,CAClC,MAAO,UAAS,EAAQ,CACtB,MAAO,IAAY,GAAM,GAAO,GAAQ,QAAQ,GAAQ,KAAM,EAAU,KAY5E,YAAoB,EAAM,CACxB,MAAO,WAAW,CAIhB,GAAI,GAAO,UACX,OAAQ,EAAK,YACN,GAAG,MAAO,IAAI,OACd,GAAG,MAAO,IAAI,GAAK,EAAK,QACxB,GAAG,MAAO,IAAI,GAAK,EAAK,GAAI,EAAK,QACjC,GAAG,MAAO,IAAI,GAAK,EAAK,GAAI,EAAK,GAAI,EAAK,QAC1C,GAAG,MAAO,IAAI,GAAK,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,QACnD,GAAG,MAAO,IAAI,GAAK,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,QAC5D,GAAG,MAAO,IAAI,GAAK,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,QACrE,GAAG,MAAO,IAAI,GAAK,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,GAAI,EAAK,IAErF,GAAI,GAAc,GAAW,EAAK,WAC9B,EAAS,EAAK,MAAM,EAAa,GAIrC,MAAO,IAAS,GAAU,EAAS,GAavC,YAAqB,EAAM,EAAS,EAAO,CACzC,GAAI,GAAO,GAAW,GAEtB,YAAmB,CAMjB,OALI,GAAS,UAAU,OACnB,EAAO,EAAM,GACb,EAAQ,EACR,EAAc,GAAU,GAErB,KACL,EAAK,GAAS,UAAU,GAE1B,GAAI,IAAW,EAAS,GAAK,EAAK,KAAO,GAAe,EAAK,EAAS,KAAO,EACzE,GACA,GAAe,EAAM,GAGzB,GADA,GAAU,GAAQ,OACd,EAAS,EACX,MAAO,IACL,EAAM,EAAS,GAAc,EAAQ,YAAa,EAClD,EAAM,GAAS,EAAW,EAAW,EAAQ,GAEjD,GAAI,IAAM,MAAQ,OAAS,IAAQ,eAAgB,GAAW,EAAO,EACrE,MAAO,IAAM,GAAI,KAAM,GAEzB,MAAO,GAUT,YAAoB,EAAe,CACjC,MAAO,UAAS,EAAY,EAAW,EAAW,CAChD,GAAI,GAAW,GAAO,GACtB,GAAI,CAAC,GAAY,GAAa,CAC5B,GAAI,GAAW,GAAY,EAAW,GACtC,EAAa,GAAK,GAClB,EAAY,SAAS,EAAK,CAAE,MAAO,GAAS,EAAS,GAAM,EAAK,IAElE,GAAI,GAAQ,EAAc,EAAY,EAAW,GACjD,MAAO,GAAQ,GAAK,EAAS,EAAW,EAAW,GAAS,GAAS,GAWzE,YAAoB,EAAW,CAC7B,MAAO,IAAS,SAAS,EAAO,CAC9B,GAAI,GAAS,EAAM,OACf,EAAQ,EACR,EAAS,GAAc,UAAU,KAKrC,IAHI,GACF,EAAM,UAED,KAAS,CACd,GAAI,GAAO,EAAM,GACjB,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,GAAI,GAAU,CAAC,GAAW,GAAY,IAAS,UAC7C,GAAI,GAAU,GAAI,IAAc,GAAI,IAIxC,IADA,EAAQ,EAAU,EAAQ,EACnB,EAAE,EAAQ,GAAQ,CACvB,EAAO,EAAM,GAEb,GAAI,GAAW,GAAY,GACvB,EAAO,GAAY,UAAY,GAAQ,GAAQ,EAEnD,AAAI,GAAQ,GAAW,EAAK,KACtB,EAAK,IAAO,IAAgB,EAAkB,EAAoB,IAClE,CAAC,EAAK,GAAG,QAAU,EAAK,IAAM,EAElC,EAAU,EAAQ,GAAY,EAAK,KAAK,MAAM,EAAS,EAAK,IAE5D,EAAW,EAAK,QAAU,GAAK,GAAW,GACtC,EAAQ,KACR,EAAQ,KAAK,GAGrB,MAAO,WAAW,CAChB,GAAI,IAAO,UACP,GAAQ,GAAK,GAEjB,GAAI,GAAW,GAAK,QAAU,GAAK,GAAQ,IACzC,MAAO,GAAQ,MAAM,IAAO,QAK9B,OAHI,IAAQ,EACR,GAAS,EAAS,EAAM,IAAO,MAAM,KAAM,IAAQ,GAEhD,EAAE,GAAQ,GACf,GAAS,EAAM,IAAO,KAAK,KAAM,IAEnC,MAAO,OAwBb,YAAsB,EAAM,EAAS,EAAS,EAAU,EAAS,EAAe,EAAc,EAAQ,EAAK,GAAO,CAChH,GAAI,IAAQ,EAAU,GAClB,GAAS,EAAU,EACnB,GAAY,EAAU,EACtB,GAAY,EAAW,GAAkB,IACzC,GAAS,EAAU,GACnB,GAAO,GAAY,EAAY,GAAW,GAE9C,aAAmB,CAKjB,OAJI,IAAS,UAAU,OACnB,GAAO,EAAM,IACb,GAAQ,GAEL,MACL,GAAK,IAAS,UAAU,IAE1B,GAAI,GACF,GAAI,IAAc,GAAU,IACxB,GAAe,GAAa,GAAM,IASxC,GAPI,GACF,IAAO,GAAY,GAAM,EAAU,EAAS,KAE1C,GACF,IAAO,GAAiB,GAAM,EAAe,EAAc,KAE7D,IAAU,GACN,IAAa,GAAS,GAAO,CAC/B,GAAI,IAAa,GAAe,GAAM,IACtC,MAAO,IACL,EAAM,EAAS,GAAc,GAAQ,YAAa,EAClD,GAAM,GAAY,EAAQ,EAAK,GAAQ,IAG3C,GAAI,IAAc,GAAS,EAAU,KACjC,GAAK,GAAY,GAAY,GAAQ,EAEzC,UAAS,GAAK,OACd,AAAI,EACF,GAAO,GAAQ,GAAM,GACZ,IAAU,GAAS,GAC5B,GAAK,UAEH,IAAS,EAAM,IACjB,IAAK,OAAS,GAEZ,MAAQ,OAAS,IAAQ,eAAgB,KAC3C,IAAK,IAAQ,GAAW,KAEnB,GAAG,MAAM,GAAa,IAE/B,MAAO,IAWT,YAAwB,EAAQ,EAAY,CAC1C,MAAO,UAAS,EAAQ,EAAU,CAChC,MAAO,IAAa,EAAQ,EAAQ,EAAW,GAAW,KAY9D,YAA6B,EAAU,EAAc,CACnD,MAAO,UAAS,EAAO,EAAO,CAC5B,GAAI,GACJ,GAAI,IAAU,GAAa,IAAU,EACnC,MAAO,GAKT,GAHI,IAAU,GACZ,GAAS,GAEP,IAAU,EAAW,CACvB,GAAI,IAAW,EACb,MAAO,GAET,AAAI,MAAO,IAAS,UAAY,MAAO,IAAS,SAC9C,GAAQ,GAAa,GACrB,EAAQ,GAAa,IAErB,GAAQ,GAAa,GACrB,EAAQ,GAAa,IAEvB,EAAS,EAAS,EAAO,GAE3B,MAAO,IAWX,YAAoB,EAAW,CAC7B,MAAO,IAAS,SAAS,EAAW,CAClC,SAAY,GAAS,EAAW,GAAU,OACnC,GAAS,SAAS,EAAM,CAC7B,GAAI,GAAU,KACd,MAAO,GAAU,EAAW,SAAS,EAAU,CAC7C,MAAO,IAAM,EAAU,EAAS,SAexC,YAAuB,EAAQ,EAAO,CACpC,EAAQ,IAAU,EAAY,IAAM,GAAa,GAEjD,GAAI,GAAc,EAAM,OACxB,GAAI,EAAc,EAChB,MAAO,GAAc,GAAW,EAAO,GAAU,EAEnD,GAAI,GAAS,GAAW,EAAO,GAAW,EAAS,GAAW,KAC9D,MAAO,IAAW,GACd,GAAU,GAAc,GAAS,EAAG,GAAQ,KAAK,IACjD,EAAO,MAAM,EAAG,GAetB,YAAuB,EAAM,EAAS,EAAS,EAAU,CACvD,GAAI,GAAS,EAAU,EACnB,EAAO,GAAW,GAEtB,YAAmB,CAQjB,OAPI,GAAY,GACZ,EAAa,UAAU,OACvB,GAAY,GACZ,GAAa,EAAS,OACtB,GAAO,EAAM,GAAa,GAC1B,GAAM,MAAQ,OAAS,IAAQ,eAAgB,GAAW,EAAO,EAE9D,EAAE,GAAY,IACnB,GAAK,IAAa,EAAS,IAE7B,KAAO,KACL,GAAK,MAAe,UAAU,EAAE,GAElC,MAAO,IAAM,GAAI,EAAS,EAAU,KAAM,IAE5C,MAAO,GAUT,YAAqB,EAAW,CAC9B,MAAO,UAAS,EAAO,EAAK,EAAM,CAChC,MAAI,IAAQ,MAAO,IAAQ,UAAY,GAAe,EAAO,EAAK,IAChE,GAAM,EAAO,GAGf,EAAQ,GAAS,GACjB,AAAI,IAAQ,EACV,GAAM,EACN,EAAQ,GAER,EAAM,GAAS,GAEjB,EAAO,IAAS,EAAa,EAAQ,EAAM,EAAI,GAAM,GAAS,GACvD,GAAU,EAAO,EAAK,EAAM,IAWvC,YAAmC,EAAU,CAC3C,MAAO,UAAS,EAAO,EAAO,CAC5B,MAAM,OAAO,IAAS,UAAY,MAAO,IAAS,UAChD,GAAQ,GAAS,GACjB,EAAQ,GAAS,IAEZ,EAAS,EAAO,IAqB3B,YAAuB,EAAM,EAAS,EAAU,EAAa,EAAS,EAAU,EAAS,EAAQ,EAAK,GAAO,CAC3G,GAAI,IAAU,EAAU,EACpB,GAAa,GAAU,EAAU,EACjC,GAAkB,GAAU,EAAY,EACxC,GAAc,GAAU,EAAW,EACnC,GAAmB,GAAU,EAAY,EAE7C,GAAY,GAAU,EAAoB,GAC1C,GAAW,CAAE,IAAU,GAA0B,GAE3C,EAAU,IACd,IAAW,CAAE,GAAiB,IAEhC,GAAI,IAAU,CACZ,EAAM,EAAS,EAAS,GAAa,GAAY,GACjD,GAAiB,EAAQ,EAAK,IAG5B,GAAS,EAAS,MAAM,EAAW,IACvC,MAAI,IAAW,IACb,GAAQ,GAAQ,IAElB,GAAO,YAAc,EACd,GAAgB,GAAQ,EAAM,GAUvC,YAAqB,EAAY,CAC/B,GAAI,GAAO,GAAK,GAChB,MAAO,UAAS,EAAQ,EAAW,CAGjC,GAFA,EAAS,GAAS,GAClB,EAAY,GAAa,KAAO,EAAI,GAAU,GAAU,GAAY,KAChE,GAAa,GAAe,GAAS,CAGvC,GAAI,GAAQ,IAAS,GAAU,KAAK,MAAM,KACtC,EAAQ,EAAK,EAAK,GAAK,IAAO,EAAC,EAAK,GAAK,IAE7C,SAAQ,IAAS,GAAS,KAAK,MAAM,KAC9B,CAAE,GAAK,GAAK,IAAO,EAAC,EAAK,GAAK,IAEvC,MAAO,GAAK,IAWhB,GAAI,IAAY,AAAE,IAAQ,EAAI,GAAW,GAAI,IAAI,CAAC,CAAC,MAAM,IAAO,GAAmB,SAAS,EAAQ,CAClG,MAAO,IAAI,IAAI,IAD2D,GAW5E,YAAuB,EAAU,CAC/B,MAAO,UAAS,EAAQ,CACtB,GAAI,GAAM,GAAO,GACjB,MAAI,IAAO,GACF,GAAW,GAEhB,GAAO,GACF,GAAW,GAEb,GAAY,EAAQ,EAAS,KA6BxC,YAAoB,EAAM,EAAS,EAAS,EAAU,EAAS,EAAQ,EAAK,EAAO,CACjF,GAAI,GAAY,EAAU,EAC1B,GAAI,CAAC,GAAa,MAAO,IAAQ,WAC/B,KAAM,IAAI,IAAU,GAEtB,GAAI,IAAS,EAAW,EAAS,OAAS,EAS1C,GARK,IACH,IAAW,CAAE,GAAoB,IACjC,EAAW,EAAU,GAEvB,EAAM,IAAQ,EAAY,EAAM,GAAU,GAAU,GAAM,GAC1D,EAAQ,IAAU,EAAY,EAAQ,GAAU,GAChD,IAAU,EAAU,EAAQ,OAAS,EAEjC,EAAU,GAAyB,CACrC,GAAI,IAAgB,EAChB,GAAe,EAEnB,EAAW,EAAU,EAEvB,GAAI,IAAO,EAAY,EAAY,GAAQ,GAEvC,GAAU,CACZ,EAAM,EAAS,EAAS,EAAU,EAAS,GAAe,GAC1D,EAAQ,EAAK,GAkBf,GAfI,IACF,GAAU,GAAS,IAErB,EAAO,GAAQ,GACf,EAAU,GAAQ,GAClB,EAAU,GAAQ,GAClB,EAAW,GAAQ,GACnB,EAAU,GAAQ,GAClB,EAAQ,GAAQ,GAAK,GAAQ,KAAO,EAC/B,EAAY,EAAI,EAAK,OACtB,GAAU,GAAQ,GAAK,GAAQ,GAE/B,CAAC,GAAS,EAAW,GAAkB,KACzC,IAAW,CAAE,GAAkB,KAE7B,CAAC,GAAW,GAAW,EACzB,GAAI,IAAS,GAAW,EAAM,EAAS,OAClC,AAAI,IAAW,GAAmB,GAAW,GAClD,GAAS,GAAY,EAAM,EAAS,GAC/B,AAAK,IAAW,GAAqB,GAAY,GAAiB,KAAuB,CAAC,EAAQ,OACvG,GAAS,GAAc,EAAM,EAAS,EAAS,GAE/C,GAAS,GAAa,MAAM,EAAW,IAEzC,GAAI,IAAS,GAAO,GAAc,GAClC,MAAO,IAAgB,GAAO,GAAQ,IAAU,EAAM,GAexD,YAAgC,EAAU,EAAU,EAAK,EAAQ,CAC/D,MAAI,KAAa,GACZ,GAAG,EAAU,GAAY,KAAS,CAAC,GAAe,KAAK,EAAQ,GAC3D,EAEF,EAiBT,YAA6B,EAAU,EAAU,EAAK,EAAQ,EAAQ,EAAO,CAC3E,MAAI,IAAS,IAAa,GAAS,IAEjC,GAAM,IAAI,EAAU,GACpB,GAAU,EAAU,EAAU,EAAW,GAAqB,GAC9D,EAAM,OAAU,IAEX,EAYT,YAAyB,EAAO,CAC9B,MAAO,IAAc,GAAS,EAAY,EAgB5C,YAAqB,EAAO,EAAO,EAAS,EAAY,EAAW,EAAO,CACxE,GAAI,GAAY,EAAU,EACtB,EAAY,EAAM,OAClB,EAAY,EAAM,OAEtB,GAAI,GAAa,GAAa,CAAE,IAAa,EAAY,GACvD,MAAO,GAGT,GAAI,IAAa,EAAM,IAAI,GACvB,GAAa,EAAM,IAAI,GAC3B,GAAI,IAAc,GAChB,MAAO,KAAc,GAAS,IAAc,EAE9C,GAAI,IAAQ,GACR,GAAS,GACT,GAAQ,EAAU,EAA0B,GAAI,IAAW,EAM/D,IAJA,EAAM,IAAI,EAAO,GACjB,EAAM,IAAI,EAAO,GAGV,EAAE,GAAQ,GAAW,CAC1B,GAAI,IAAW,EAAM,IACjB,GAAW,EAAM,IAErB,GAAI,EACF,GAAI,IAAW,EACX,EAAW,GAAU,GAAU,GAAO,EAAO,EAAO,GACpD,EAAW,GAAU,GAAU,GAAO,EAAO,EAAO,GAE1D,GAAI,KAAa,EAAW,CAC1B,GAAI,GACF,SAEF,GAAS,GACT,MAGF,GAAI,IACF,GAAI,CAAC,EAAU,EAAO,SAAS,GAAU,GAAU,CAC7C,GAAI,CAAC,GAAS,GAAM,KACf,MAAa,IAAY,EAAU,GAAU,GAAU,EAAS,EAAY,IAC/E,MAAO,IAAK,KAAK,MAEjB,CACN,GAAS,GACT,eAEO,CACL,MAAa,IACX,EAAU,GAAU,GAAU,EAAS,EAAY,IACpD,CACL,GAAS,GACT,OAGJ,SAAM,OAAU,GAChB,EAAM,OAAU,GACT,GAoBT,YAAoB,EAAQ,EAAO,EAAK,EAAS,EAAY,EAAW,EAAO,CAC7E,OAAQ,OACD,IACH,GAAK,EAAO,YAAc,EAAM,YAC3B,EAAO,YAAc,EAAM,WAC9B,MAAO,GAET,EAAS,EAAO,OAChB,EAAQ,EAAM,WAEX,IACH,MAAK,IAAO,YAAc,EAAM,YAC5B,CAAC,EAAU,GAAI,IAAW,GAAS,GAAI,IAAW,SAKnD,QACA,QACA,IAGH,MAAO,IAAG,CAAC,EAAQ,CAAC,OAEjB,IACH,MAAO,GAAO,MAAQ,EAAM,MAAQ,EAAO,SAAW,EAAM,YAEzD,QACA,IAIH,MAAO,IAAW,EAAQ,OAEvB,IACH,GAAI,GAAU,OAEX,IACH,GAAI,GAAY,EAAU,EAG1B,GAFA,GAAY,GAAU,IAElB,EAAO,MAAQ,EAAM,MAAQ,CAAC,EAChC,MAAO,GAGT,GAAI,IAAU,EAAM,IAAI,GACxB,GAAI,GACF,MAAO,KAAW,EAEpB,GAAW,EAGX,EAAM,IAAI,EAAQ,GAClB,GAAI,IAAS,GAAY,EAAQ,GAAS,EAAQ,GAAQ,EAAS,EAAY,EAAW,GAC1F,SAAM,OAAU,GACT,OAEJ,IACH,GAAI,GACF,MAAO,IAAc,KAAK,IAAW,GAAc,KAAK,GAG9D,MAAO,GAgBT,YAAsB,EAAQ,EAAO,EAAS,EAAY,EAAW,EAAO,CAC1E,GAAI,GAAY,EAAU,EACtB,EAAW,GAAW,GACtB,EAAY,EAAS,OACrB,GAAW,GAAW,GACtB,GAAY,GAAS,OAEzB,GAAI,GAAa,IAAa,CAAC,EAC7B,MAAO,GAGT,OADI,IAAQ,EACL,MAAS,CACd,GAAI,IAAM,EAAS,IACnB,GAAI,CAAE,GAAY,KAAO,GAAQ,GAAe,KAAK,EAAO,KAC1D,MAAO,GAIX,GAAI,IAAa,EAAM,IAAI,GACvB,GAAa,EAAM,IAAI,GAC3B,GAAI,IAAc,GAChB,MAAO,KAAc,GAAS,IAAc,EAE9C,GAAI,IAAS,GACb,EAAM,IAAI,EAAQ,GAClB,EAAM,IAAI,EAAO,GAGjB,OADI,IAAW,EACR,EAAE,GAAQ,GAAW,CAC1B,GAAM,EAAS,IACf,GAAI,IAAW,EAAO,IAClB,GAAW,EAAM,IAErB,GAAI,EACF,GAAI,IAAW,EACX,EAAW,GAAU,GAAU,GAAK,EAAO,EAAQ,GACnD,EAAW,GAAU,GAAU,GAAK,EAAQ,EAAO,GAGzD,GAAI,CAAE,MAAa,EACV,KAAa,IAAY,EAAU,GAAU,GAAU,EAAS,EAAY,GAC7E,IACD,CACL,GAAS,GACT,MAEF,IAAa,IAAW,IAAO,eAEjC,GAAI,IAAU,CAAC,GAAU,CACvB,GAAI,IAAU,EAAO,YACjB,GAAU,EAAM,YAGpB,AAAI,IAAW,IACV,eAAiB,IAAU,eAAiB,IAC7C,CAAE,OAAO,KAAW,YAAc,aAAmB,KACnD,MAAO,KAAW,YAAc,aAAmB,MACvD,IAAS,IAGb,SAAM,OAAU,GAChB,EAAM,OAAU,GACT,GAUT,YAAkB,EAAM,CACtB,MAAO,IAAY,GAAS,EAAM,EAAW,IAAU,EAAO,IAUhE,YAAoB,EAAQ,CAC1B,MAAO,IAAe,EAAQ,GAAM,IAWtC,YAAsB,EAAQ,CAC5B,MAAO,IAAe,EAAQ,GAAQ,IAUxC,GAAI,IAAU,AAAC,GAAiB,SAAS,EAAM,CAC7C,MAAO,IAAQ,IAAI,IADI,GAWzB,YAAqB,EAAM,CAKzB,OAJI,GAAU,EAAK,KAAO,GACtB,EAAQ,GAAU,GAClB,EAAS,GAAe,KAAK,GAAW,GAAU,EAAM,OAAS,EAE9D,KAAU,CACf,GAAI,GAAO,EAAM,GACb,EAAY,EAAK,KACrB,GAAI,GAAa,MAAQ,GAAa,EACpC,MAAO,GAAK,KAGhB,MAAO,GAUT,YAAmB,EAAM,CACvB,GAAI,GAAS,GAAe,KAAK,EAAQ,eAAiB,EAAS,EACnE,MAAO,GAAO,YAchB,aAAuB,CACrB,GAAI,GAAS,EAAO,UAAY,GAChC,SAAS,IAAW,GAAW,GAAe,EACvC,UAAU,OAAS,EAAO,UAAU,GAAI,UAAU,IAAM,EAWjE,YAAoB,EAAK,EAAK,CAC5B,GAAI,GAAO,EAAI,SACf,MAAO,IAAU,GACb,EAAK,MAAO,IAAO,SAAW,SAAW,QACzC,EAAK,IAUX,YAAsB,EAAQ,CAI5B,OAHI,GAAS,GAAK,GACd,EAAS,EAAO,OAEb,KAAU,CACf,GAAI,GAAM,EAAO,GACb,EAAQ,EAAO,GAEnB,EAAO,GAAU,CAAC,EAAK,EAAO,GAAmB,IAEnD,MAAO,GAWT,YAAmB,EAAQ,EAAK,CAC9B,GAAI,GAAQ,GAAS,EAAQ,GAC7B,MAAO,IAAa,GAAS,EAAQ,EAUvC,YAAmB,EAAO,CACxB,GAAI,GAAQ,GAAe,KAAK,EAAO,IACnC,EAAM,EAAM,IAEhB,GAAI,CACF,EAAM,IAAkB,EACxB,GAAI,GAAW,SACR,EAAP,EAEF,GAAI,GAAS,GAAqB,KAAK,GACvC,MAAI,IACF,CAAI,EACF,EAAM,IAAkB,EAExB,MAAO,GAAM,KAGV,EAUT,GAAI,IAAa,AAAC,GAA+B,SAAS,EAAQ,CAChE,MAAI,IAAU,KACL,GAET,GAAS,GAAO,GACT,GAAY,GAAiB,GAAS,SAAS,EAAQ,CAC5D,MAAO,IAAqB,KAAK,EAAQ,OANR,GAiBjC,GAAe,AAAC,GAA+B,SAAS,EAAQ,CAElE,OADI,GAAS,GACN,GACL,GAAU,EAAQ,GAAW,IAC7B,EAAS,GAAa,GAExB,MAAO,IAN8B,GAgBnC,GAAS,GAGb,AAAK,KAAY,GAAO,GAAI,IAAS,GAAI,aAAY,MAAQ,IACxD,IAAO,GAAO,GAAI,MAAQ,IAC1B,IAAW,GAAO,GAAQ,YAAc,IACxC,IAAO,GAAO,GAAI,MAAQ,IAC1B,IAAW,GAAO,GAAI,MAAY,KACrC,IAAS,SAAS,EAAO,CACvB,GAAI,GAAS,GAAW,GACpB,EAAO,GAAU,GAAY,EAAM,YAAc,EACjD,EAAa,EAAO,GAAS,GAAQ,GAEzC,GAAI,EACF,OAAQ,OACD,IAAoB,MAAO,QAC3B,IAAe,MAAO,QACtB,IAAmB,MAAO,QAC1B,IAAe,MAAO,QACtB,IAAmB,MAAO,IAGnC,MAAO,KAcX,YAAiB,EAAO,EAAK,EAAY,CAIvC,OAHI,GAAQ,GACR,EAAS,EAAW,OAEjB,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAO,EAAW,GAClB,EAAO,EAAK,KAEhB,OAAQ,EAAK,UACN,OAAa,GAAS,EAAM,UAC5B,YAAa,GAAO,EAAM,UAC1B,OAAa,EAAM,GAAU,EAAK,EAAQ,GAAO,UACjD,YAAa,EAAQ,GAAU,EAAO,EAAM,GAAO,OAG5D,MAAO,CAAE,MAAS,EAAO,IAAO,GAUlC,YAAwB,EAAQ,CAC9B,GAAI,GAAQ,EAAO,MAAM,IACzB,MAAO,GAAQ,EAAM,GAAG,MAAM,IAAkB,GAYlD,YAAiB,EAAQ,EAAM,EAAS,CACtC,EAAO,GAAS,EAAM,GAMtB,OAJI,GAAQ,GACR,EAAS,EAAK,OACd,EAAS,GAEN,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAM,GAAM,EAAK,IACrB,GAAI,CAAE,GAAS,GAAU,MAAQ,EAAQ,EAAQ,IAC/C,MAEF,EAAS,EAAO,GAElB,MAAI,IAAU,EAAE,GAAS,EAChB,EAET,GAAS,GAAU,KAAO,EAAI,EAAO,OAC9B,CAAC,CAAC,GAAU,GAAS,IAAW,GAAQ,EAAK,IACjD,IAAQ,IAAW,GAAY,KAUpC,YAAwB,EAAO,CAC7B,GAAI,GAAS,EAAM,OACf,EAAS,GAAI,GAAM,YAAY,GAGnC,MAAI,IAAU,MAAO,GAAM,IAAM,UAAY,GAAe,KAAK,EAAO,UACtE,GAAO,MAAQ,EAAM,MACrB,EAAO,MAAQ,EAAM,OAEhB,EAUT,YAAyB,EAAQ,CAC/B,MAAQ,OAAO,GAAO,aAAe,YAAc,CAAC,GAAY,GAC5D,GAAW,GAAa,IACxB,GAeN,YAAwB,EAAQ,EAAK,EAAQ,CAC3C,GAAI,GAAO,EAAO,YAClB,OAAQ,OACD,IACH,MAAO,IAAiB,OAErB,QACA,IACH,MAAO,IAAI,GAAK,CAAC,OAEd,IACH,MAAO,IAAc,EAAQ,OAE1B,QAAiB,QACjB,QAAc,QAAe,QAC7B,QAAe,QAAsB,QAAgB,IACxD,MAAO,IAAgB,EAAQ,OAE5B,IACH,MAAO,IAAI,OAER,QACA,IACH,MAAO,IAAI,GAAK,OAEb,IACH,MAAO,IAAY,OAEhB,IACH,MAAO,IAAI,OAER,IACH,MAAO,IAAY,IAYzB,YAA2B,EAAQ,EAAS,CAC1C,GAAI,GAAS,EAAQ,OACrB,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAY,EAAS,EACzB,SAAQ,GAAc,GAAS,EAAI,KAAO,IAAM,EAAQ,GACxD,EAAU,EAAQ,KAAK,EAAS,EAAI,KAAO,KACpC,EAAO,QAAQ,GAAe;AAAA,mBAAyB,EAAU;AAAA,GAU1E,YAAuB,EAAO,CAC5B,MAAO,IAAQ,IAAU,GAAY,IACnC,CAAC,CAAE,KAAoB,GAAS,EAAM,KAW1C,YAAiB,EAAO,EAAQ,CAC9B,GAAI,GAAO,MAAO,GAClB,SAAS,GAAiB,GAEnB,CAAC,CAAC,GACN,IAAQ,UACN,GAAQ,UAAY,GAAS,KAAK,KAChC,EAAQ,IAAM,EAAQ,GAAK,GAAK,EAAQ,EAajD,YAAwB,EAAO,EAAO,EAAQ,CAC5C,GAAI,CAAC,GAAS,GACZ,MAAO,GAET,GAAI,GAAO,MAAO,GAClB,MAAI,IAAQ,SACH,GAAY,IAAW,GAAQ,EAAO,EAAO,QAC7C,GAAQ,UAAY,IAAS,IAE7B,GAAG,EAAO,GAAQ,GAEpB,GAWT,YAAe,EAAO,EAAQ,CAC5B,GAAI,GAAQ,GACV,MAAO,GAET,GAAI,GAAO,MAAO,GAClB,MAAI,IAAQ,UAAY,GAAQ,UAAY,GAAQ,WAChD,GAAS,MAAQ,GAAS,GACrB,GAEF,GAAc,KAAK,IAAU,CAAC,GAAa,KAAK,IACpD,GAAU,MAAQ,IAAS,IAAO,GAUvC,YAAmB,EAAO,CACxB,GAAI,GAAO,MAAO,GAClB,MAAQ,IAAQ,UAAY,GAAQ,UAAY,GAAQ,UAAY,GAAQ,UACvE,IAAU,YACV,IAAU,KAWjB,YAAoB,EAAM,CACxB,GAAI,GAAW,GAAY,GACvB,EAAQ,EAAO,GAEnB,GAAI,MAAO,IAAS,YAAc,CAAE,KAAY,GAAY,WAC1D,MAAO,GAET,GAAI,IAAS,EACX,MAAO,GAET,GAAI,GAAO,GAAQ,GACnB,MAAO,CAAC,CAAC,GAAQ,IAAS,EAAK,GAUjC,YAAkB,EAAM,CACtB,MAAO,CAAC,CAAC,IAAe,KAAc,GAUxC,GAAI,IAAa,GAAa,GAAa,GAS3C,YAAqB,EAAO,CAC1B,GAAI,GAAO,GAAS,EAAM,YACtB,EAAS,MAAO,IAAQ,YAAc,EAAK,WAAc,GAE7D,MAAO,KAAU,EAWnB,YAA4B,EAAO,CACjC,MAAO,KAAU,GAAS,CAAC,GAAS,GAYtC,YAAiC,EAAK,EAAU,CAC9C,MAAO,UAAS,EAAQ,CACtB,MAAI,IAAU,KACL,GAEF,EAAO,KAAS,GACpB,KAAa,GAAc,IAAO,IAAO,KAYhD,YAAuB,EAAM,CAC3B,GAAI,GAAS,GAAQ,EAAM,SAAS,EAAK,CACvC,MAAI,GAAM,OAAS,GACjB,EAAM,QAED,IAGL,EAAQ,EAAO,MACnB,MAAO,GAmBT,YAAmB,EAAM,EAAQ,CAC/B,GAAI,GAAU,EAAK,GACf,EAAa,EAAO,GACpB,EAAa,EAAU,EACvB,EAAW,EAAc,GAAiB,EAAqB,IAE/D,EACA,GAAc,IAAmB,GAAW,GAC5C,GAAc,IAAmB,GAAW,GAAqB,EAAK,GAAG,QAAU,EAAO,IAC1F,GAAe,IAAgB,IAAsB,EAAO,GAAG,QAAU,EAAO,IAAQ,GAAW,EAGvG,GAAI,CAAE,IAAY,GAChB,MAAO,GAGT,AAAI,EAAa,GACf,GAAK,GAAK,EAAO,GAEjB,GAAc,EAAU,EAAiB,EAAI,IAG/C,GAAI,GAAQ,EAAO,GACnB,GAAI,EAAO,CACT,GAAI,GAAW,EAAK,GACpB,EAAK,GAAK,EAAW,GAAY,EAAU,EAAO,EAAO,IAAM,EAC/D,EAAK,GAAK,EAAW,GAAe,EAAK,GAAI,GAAe,EAAO,GAGrE,SAAQ,EAAO,GACX,GACF,GAAW,EAAK,GAChB,EAAK,GAAK,EAAW,GAAiB,EAAU,EAAO,EAAO,IAAM,EACpE,EAAK,GAAK,EAAW,GAAe,EAAK,GAAI,GAAe,EAAO,IAGrE,EAAQ,EAAO,GACX,GACF,GAAK,GAAK,GAGR,EAAa,IACf,GAAK,GAAK,EAAK,IAAM,KAAO,EAAO,GAAK,GAAU,EAAK,GAAI,EAAO,KAGhE,EAAK,IAAM,MACb,GAAK,GAAK,EAAO,IAGnB,EAAK,GAAK,EAAO,GACjB,EAAK,GAAK,EAEH,EAYT,YAAsB,EAAQ,CAC5B,GAAI,GAAS,GACb,GAAI,GAAU,KACZ,OAAS,KAAO,IAAO,GACrB,EAAO,KAAK,GAGhB,MAAO,GAUT,YAAwB,EAAO,CAC7B,MAAO,IAAqB,KAAK,GAYnC,YAAkB,EAAM,EAAO,EAAW,CACxC,SAAQ,GAAU,IAAU,EAAa,EAAK,OAAS,EAAK,EAAO,GAC5D,UAAW,CAMhB,OALI,GAAO,UACP,EAAQ,GACR,EAAS,GAAU,EAAK,OAAS,EAAO,GACxC,EAAQ,EAAM,GAEX,EAAE,EAAQ,GACf,EAAM,GAAS,EAAK,EAAQ,GAE9B,EAAQ,GAER,OADI,GAAY,EAAM,EAAQ,GACvB,EAAE,EAAQ,GACf,EAAU,GAAS,EAAK,GAE1B,SAAU,GAAS,EAAU,GACtB,GAAM,EAAM,KAAM,IAY7B,YAAgB,EAAQ,EAAM,CAC5B,MAAO,GAAK,OAAS,EAAI,EAAS,GAAQ,EAAQ,GAAU,EAAM,EAAG,KAavE,YAAiB,EAAO,EAAS,CAK/B,OAJI,GAAY,EAAM,OAClB,EAAS,GAAU,EAAQ,OAAQ,GACnC,EAAW,GAAU,GAElB,KAAU,CACf,GAAI,GAAQ,EAAQ,GACpB,EAAM,GAAU,GAAQ,EAAO,GAAa,EAAS,GAAS,EAEhE,MAAO,GAWT,YAAiB,EAAQ,EAAK,CAC5B,GAAI,MAAQ,eAAiB,MAAO,GAAO,IAAS,aAIhD,GAAO,YAIX,MAAO,GAAO,GAiBhB,GAAI,IAAU,GAAS,IAUnB,GAAa,IAAiB,SAAS,EAAM,EAAM,CACrD,MAAO,IAAK,WAAW,EAAM,IAW3B,GAAc,GAAS,IAY3B,YAAyB,EAAS,EAAW,EAAS,CACpD,GAAI,GAAU,EAAY,GAC1B,MAAO,IAAY,EAAS,GAAkB,EAAQ,GAAkB,GAAe,GAAS,KAYlG,YAAkB,EAAM,CACtB,GAAI,GAAQ,EACR,EAAa,EAEjB,MAAO,WAAW,CAChB,GAAI,GAAQ,KACR,EAAY,GAAY,GAAQ,GAGpC,GADA,EAAa,EACT,EAAY,GACd,GAAI,EAAE,GAAS,GACb,MAAO,WAAU,OAGnB,GAAQ,EAEV,MAAO,GAAK,MAAM,EAAW,YAYjC,YAAqB,EAAO,EAAM,CAChC,GAAI,GAAQ,GACR,EAAS,EAAM,OACf,EAAY,EAAS,EAGzB,IADA,EAAO,IAAS,EAAY,EAAS,EAC9B,EAAE,EAAQ,GAAM,CACrB,GAAI,GAAO,GAAW,EAAO,GACzB,EAAQ,EAAM,GAElB,EAAM,GAAQ,EAAM,GACpB,EAAM,GAAS,EAEjB,SAAM,OAAS,EACR,EAUT,GAAI,IAAe,GAAc,SAAS,EAAQ,CAChD,GAAI,GAAS,GACb,MAAI,GAAO,WAAW,KAAO,IAC3B,EAAO,KAAK,IAEd,EAAO,QAAQ,GAAY,SAAS,EAAO,EAAQ,EAAO,EAAW,CACnE,EAAO,KAAK,EAAQ,EAAU,QAAQ,GAAc,MAAS,GAAU,KAElE,IAUT,YAAe,EAAO,CACpB,GAAI,MAAO,IAAS,UAAY,GAAS,GACvC,MAAO,GAET,GAAI,GAAU,EAAQ,GACtB,MAAQ,IAAU,KAAQ,EAAI,GAAU,CAAC,GAAY,KAAO,EAU9D,YAAkB,EAAM,CACtB,GAAI,GAAQ,KAAM,CAChB,GAAI,CACF,MAAO,IAAa,KAAK,SAClB,EAAP,EACF,GAAI,CACF,MAAQ,GAAO,SACR,EAAP,GAEJ,MAAO,GAWT,YAA2B,EAAS,EAAS,CAC3C,UAAU,GAAW,SAAS,EAAM,CAClC,GAAI,GAAQ,KAAO,EAAK,GACxB,AAAK,EAAU,EAAK,IAAO,CAAC,GAAc,EAAS,IACjD,EAAQ,KAAK,KAGV,EAAQ,OAUjB,YAAsB,EAAS,CAC7B,GAAI,YAAmB,GACrB,MAAO,GAAQ,QAEjB,GAAI,GAAS,GAAI,IAAc,EAAQ,YAAa,EAAQ,WAC5D,SAAO,YAAc,GAAU,EAAQ,aACvC,EAAO,UAAa,EAAQ,UAC5B,EAAO,WAAa,EAAQ,WACrB,EA0BT,YAAe,EAAO,EAAM,EAAO,CACjC,AAAK,GAAQ,GAAe,EAAO,EAAM,GAAS,IAAS,GACzD,EAAO,EAEP,EAAO,GAAU,GAAU,GAAO,GAEpC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,CAAC,GAAU,EAAO,EACpB,MAAO,GAMT,OAJI,GAAQ,EACR,EAAW,EACX,EAAS,EAAM,GAAW,EAAS,IAEhC,EAAQ,GACb,EAAO,KAAc,GAAU,EAAO,EAAQ,GAAS,GAEzD,MAAO,GAkBT,YAAiB,EAAO,CAMtB,OALI,GAAQ,GACR,EAAS,GAAS,KAAO,EAAI,EAAM,OACnC,EAAW,EACX,EAAS,GAEN,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAM,GAClB,AAAI,GACF,GAAO,KAAc,GAGzB,MAAO,GAyBT,aAAkB,CAChB,GAAI,GAAS,UAAU,OACvB,GAAI,CAAC,EACH,MAAO,GAMT,OAJI,GAAO,EAAM,EAAS,GACtB,EAAQ,UAAU,GAClB,EAAQ,EAEL,KACL,EAAK,EAAQ,GAAK,UAAU,GAE9B,MAAO,IAAU,GAAQ,GAAS,GAAU,GAAS,CAAC,GAAQ,GAAY,EAAM,IAwBlF,GAAI,IAAa,GAAS,SAAS,EAAO,EAAQ,CAChD,MAAO,IAAkB,GACrB,GAAe,EAAO,GAAY,EAAQ,EAAG,GAAmB,KAChE,KA6BF,GAAe,GAAS,SAAS,EAAO,EAAQ,CAClD,GAAI,GAAW,GAAK,GACpB,MAAI,IAAkB,IACpB,GAAW,GAEN,GAAkB,GACrB,GAAe,EAAO,GAAY,EAAQ,EAAG,GAAmB,IAAO,GAAY,EAAU,IAC7F,KA0BF,GAAiB,GAAS,SAAS,EAAO,EAAQ,CACpD,GAAI,GAAa,GAAK,GACtB,MAAI,IAAkB,IACpB,GAAa,GAER,GAAkB,GACrB,GAAe,EAAO,GAAY,EAAQ,EAAG,GAAmB,IAAO,EAAW,GAClF,KA4BN,YAAc,EAAO,EAAG,EAAO,CAC7B,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAK,GAGL,GAAK,GAAS,IAAM,EAAa,EAAI,GAAU,GACxC,GAAU,EAAO,EAAI,EAAI,EAAI,EAAG,IAH9B,GA+BX,YAAmB,EAAO,EAAG,EAAO,CAClC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAK,GAGL,GAAK,GAAS,IAAM,EAAa,EAAI,GAAU,GAC/C,EAAI,EAAS,EACN,GAAU,EAAO,EAAG,EAAI,EAAI,EAAI,IAJ9B,GA0CX,YAAwB,EAAO,EAAW,CACxC,MAAQ,IAAS,EAAM,OACnB,GAAU,EAAO,GAAY,EAAW,GAAI,GAAM,IAClD,GAsCN,YAAmB,EAAO,EAAW,CACnC,MAAQ,IAAS,EAAM,OACnB,GAAU,EAAO,GAAY,EAAW,GAAI,IAC5C,GAgCN,YAAc,EAAO,EAAO,EAAO,EAAK,CACtC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAK,GAGD,IAAS,MAAO,IAAS,UAAY,GAAe,EAAO,EAAO,IACpE,GAAQ,EACR,EAAM,GAED,GAAS,EAAO,EAAO,EAAO,IAN5B,GA4CX,YAAmB,EAAO,EAAW,EAAW,CAC9C,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAQ,GAAa,KAAO,EAAI,GAAU,GAC9C,MAAI,GAAQ,GACV,GAAQ,GAAU,EAAS,EAAO,IAE7B,EAAc,EAAO,GAAY,EAAW,GAAI,GAsCzD,YAAuB,EAAO,EAAW,EAAW,CAClD,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAQ,EAAS,EACrB,MAAI,KAAc,GAChB,GAAQ,GAAU,GAClB,EAAQ,EAAY,EAChB,GAAU,EAAS,EAAO,GAC1B,GAAU,EAAO,EAAS,IAEzB,EAAc,EAAO,GAAY,EAAW,GAAI,EAAO,IAiBhE,YAAiB,EAAO,CACtB,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,GAAS,GAAY,EAAO,GAAK,GAiB1C,YAAqB,EAAO,CAC1B,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,GAAS,GAAY,EAAO,IAAY,GAuBjD,YAAsB,EAAO,EAAO,CAClC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAK,GAGL,GAAQ,IAAU,EAAY,EAAI,GAAU,GACrC,GAAY,EAAO,IAHjB,GAqBX,YAAmB,EAAO,CAKxB,OAJI,GAAQ,GACR,EAAS,GAAS,KAAO,EAAI,EAAM,OACnC,EAAS,GAEN,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAO,EAAM,GACjB,EAAO,EAAK,IAAM,EAAK,GAEzB,MAAO,GAqBT,YAAc,EAAO,CACnB,MAAQ,IAAS,EAAM,OAAU,EAAM,GAAK,EA0B9C,YAAiB,EAAO,EAAO,EAAW,CACxC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAQ,GAAa,KAAO,EAAI,GAAU,GAC9C,MAAI,GAAQ,GACV,GAAQ,GAAU,EAAS,EAAO,IAE7B,EAAY,EAAO,EAAO,GAiBnC,YAAiB,EAAO,CACtB,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,GAAS,GAAU,EAAO,EAAG,IAAM,GAoB5C,GAAI,IAAe,GAAS,SAAS,EAAQ,CAC3C,GAAI,GAAS,GAAS,EAAQ,IAC9B,MAAQ,GAAO,QAAU,EAAO,KAAO,EAAO,GAC1C,GAAiB,GACjB,KA0BF,GAAiB,GAAS,SAAS,EAAQ,CAC7C,GAAI,GAAW,GAAK,GAChB,EAAS,GAAS,EAAQ,IAE9B,MAAI,KAAa,GAAK,GACpB,EAAW,EAEX,EAAO,MAED,EAAO,QAAU,EAAO,KAAO,EAAO,GAC1C,GAAiB,EAAQ,GAAY,EAAU,IAC/C,KAwBF,GAAmB,GAAS,SAAS,EAAQ,CAC/C,GAAI,GAAa,GAAK,GAClB,EAAS,GAAS,EAAQ,IAE9B,SAAa,MAAO,IAAc,WAAa,EAAa,EACxD,GACF,EAAO,MAED,EAAO,QAAU,EAAO,KAAO,EAAO,GAC1C,GAAiB,EAAQ,EAAW,GACpC,KAkBN,YAAc,EAAO,EAAW,CAC9B,MAAO,IAAS,KAAO,GAAK,GAAW,KAAK,EAAO,GAiBrD,YAAc,EAAO,CACnB,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,GAAS,EAAM,EAAS,GAAK,EAwBtC,YAAqB,EAAO,EAAO,EAAW,CAC5C,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAQ,EACZ,MAAI,KAAc,GAChB,GAAQ,GAAU,GAClB,EAAQ,EAAQ,EAAI,GAAU,EAAS,EAAO,GAAK,GAAU,EAAO,EAAS,IAExE,IAAU,EACb,GAAkB,EAAO,EAAO,GAChC,EAAc,EAAO,GAAW,EAAO,IAwB7C,YAAa,EAAO,EAAG,CACrB,MAAQ,IAAS,EAAM,OAAU,GAAQ,EAAO,GAAU,IAAM,EA0BlE,GAAI,IAAO,GAAS,IAsBpB,YAAiB,EAAO,EAAQ,CAC9B,MAAQ,IAAS,EAAM,QAAU,GAAU,EAAO,OAC9C,GAAY,EAAO,GACnB,EA0BN,YAAmB,EAAO,EAAQ,EAAU,CAC1C,MAAQ,IAAS,EAAM,QAAU,GAAU,EAAO,OAC9C,GAAY,EAAO,EAAQ,GAAY,EAAU,IACjD,EA0BN,YAAqB,EAAO,EAAQ,EAAY,CAC9C,MAAQ,IAAS,EAAM,QAAU,GAAU,EAAO,OAC9C,GAAY,EAAO,EAAQ,EAAW,GACtC,EA2BN,GAAI,IAAS,GAAS,SAAS,EAAO,EAAS,CAC7C,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACnC,EAAS,GAAO,EAAO,GAE3B,UAAW,EAAO,GAAS,EAAS,SAAS,EAAO,CAClD,MAAO,IAAQ,EAAO,GAAU,CAAC,EAAQ,IACxC,KAAK,KAED,IA+BT,YAAgB,EAAO,EAAW,CAChC,GAAI,GAAS,GACb,GAAI,CAAE,IAAS,EAAM,QACnB,MAAO,GAET,GAAI,GAAQ,GACR,EAAU,GACV,EAAS,EAAM,OAGnB,IADA,EAAY,GAAY,EAAW,GAC5B,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,EAAM,GAClB,AAAI,EAAU,EAAO,EAAO,IAC1B,GAAO,KAAK,GACZ,EAAQ,KAAK,IAGjB,UAAW,EAAO,GACX,EA0BT,YAAiB,EAAO,CACtB,MAAO,IAAS,KAAO,EAAQ,GAAc,KAAK,GAmBpD,YAAe,EAAO,EAAO,EAAK,CAChC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAK,GAGL,CAAI,GAAO,MAAO,IAAO,UAAY,GAAe,EAAO,EAAO,GAChE,GAAQ,EACR,EAAM,GAGN,GAAQ,GAAS,KAAO,EAAI,GAAU,GACtC,EAAM,IAAQ,EAAY,EAAS,GAAU,IAExC,GAAU,EAAO,EAAO,IAVtB,GA8BX,YAAqB,EAAO,EAAO,CACjC,MAAO,IAAgB,EAAO,GA4BhC,YAAuB,EAAO,EAAO,EAAU,CAC7C,MAAO,IAAkB,EAAO,EAAO,GAAY,EAAU,IAmB/D,YAAuB,EAAO,EAAO,CACnC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,EAAQ,CACV,GAAI,GAAQ,GAAgB,EAAO,GACnC,GAAI,EAAQ,GAAU,GAAG,EAAM,GAAQ,GACrC,MAAO,GAGX,MAAO,GAqBT,YAAyB,EAAO,EAAO,CACrC,MAAO,IAAgB,EAAO,EAAO,IA4BvC,YAA2B,EAAO,EAAO,EAAU,CACjD,MAAO,IAAkB,EAAO,EAAO,GAAY,EAAU,GAAI,IAmBnE,YAA2B,EAAO,EAAO,CACvC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,GAAI,EAAQ,CACV,GAAI,GAAQ,GAAgB,EAAO,EAAO,IAAQ,EAClD,GAAI,GAAG,EAAM,GAAQ,GACnB,MAAO,GAGX,MAAO,GAkBT,YAAoB,EAAO,CACzB,MAAQ,IAAS,EAAM,OACnB,GAAe,GACf,GAmBN,YAAsB,EAAO,EAAU,CACrC,MAAQ,IAAS,EAAM,OACnB,GAAe,EAAO,GAAY,EAAU,IAC5C,GAiBN,YAAc,EAAO,CACnB,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAO,GAAS,GAAU,EAAO,EAAG,GAAU,GA4BhD,YAAc,EAAO,EAAG,EAAO,CAC7B,MAAM,IAAS,EAAM,OAGrB,GAAK,GAAS,IAAM,EAAa,EAAI,GAAU,GACxC,GAAU,EAAO,EAAG,EAAI,EAAI,EAAI,IAH9B,GA+BX,YAAmB,EAAO,EAAG,EAAO,CAClC,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACvC,MAAK,GAGL,GAAK,GAAS,IAAM,EAAa,EAAI,GAAU,GAC/C,EAAI,EAAS,EACN,GAAU,EAAO,EAAI,EAAI,EAAI,EAAG,IAJ9B,GA0CX,YAAwB,EAAO,EAAW,CACxC,MAAQ,IAAS,EAAM,OACnB,GAAU,EAAO,GAAY,EAAW,GAAI,GAAO,IACnD,GAsCN,YAAmB,EAAO,EAAW,CACnC,MAAQ,IAAS,EAAM,OACnB,GAAU,EAAO,GAAY,EAAW,IACxC,GAmBN,GAAI,IAAQ,GAAS,SAAS,EAAQ,CACpC,MAAO,IAAS,GAAY,EAAQ,EAAG,GAAmB,OA0BxD,GAAU,GAAS,SAAS,EAAQ,CACtC,GAAI,GAAW,GAAK,GACpB,MAAI,IAAkB,IACpB,GAAW,GAEN,GAAS,GAAY,EAAQ,EAAG,GAAmB,IAAO,GAAY,EAAU,MAwBrF,GAAY,GAAS,SAAS,EAAQ,CACxC,GAAI,GAAa,GAAK,GACtB,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAS,GAAY,EAAQ,EAAG,GAAmB,IAAO,EAAW,KAqB9E,YAAc,EAAO,CACnB,MAAQ,IAAS,EAAM,OAAU,GAAS,GAAS,GA0BrD,YAAgB,EAAO,EAAU,CAC/B,MAAQ,IAAS,EAAM,OAAU,GAAS,EAAO,GAAY,EAAU,IAAM,GAuB/E,YAAkB,EAAO,EAAY,CACnC,SAAa,MAAO,IAAc,WAAa,EAAa,EACpD,GAAS,EAAM,OAAU,GAAS,EAAO,EAAW,GAAc,GAsB5E,YAAe,EAAO,CACpB,GAAI,CAAE,IAAS,EAAM,QACnB,MAAO,GAET,GAAI,GAAS,EACb,SAAQ,GAAY,EAAO,SAAS,EAAO,CACzC,GAAI,GAAkB,GACpB,SAAS,GAAU,EAAM,OAAQ,GAC1B,KAGJ,GAAU,EAAQ,SAAS,EAAO,CACvC,MAAO,IAAS,EAAO,GAAa,MAyBxC,YAAmB,EAAO,EAAU,CAClC,GAAI,CAAE,IAAS,EAAM,QACnB,MAAO,GAET,GAAI,GAAS,GAAM,GACnB,MAAI,IAAY,KACP,EAEF,GAAS,EAAQ,SAAS,EAAO,CACtC,MAAO,IAAM,EAAU,EAAW,KAwBtC,GAAI,IAAU,GAAS,SAAS,EAAO,EAAQ,CAC7C,MAAO,IAAkB,GACrB,GAAe,EAAO,GACtB,KAqBF,GAAM,GAAS,SAAS,EAAQ,CAClC,MAAO,IAAQ,GAAY,EAAQ,OA0BjC,GAAQ,GAAS,SAAS,EAAQ,CACpC,GAAI,GAAW,GAAK,GACpB,MAAI,IAAkB,IACpB,GAAW,GAEN,GAAQ,GAAY,EAAQ,IAAoB,GAAY,EAAU,MAwB3E,GAAU,GAAS,SAAS,EAAQ,CACtC,GAAI,GAAa,GAAK,GACtB,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAQ,GAAY,EAAQ,IAAoB,EAAW,KAmBhE,GAAM,GAAS,IAkBnB,YAAmB,EAAO,EAAQ,CAChC,MAAO,IAAc,GAAS,GAAI,GAAU,GAAI,IAkBlD,YAAuB,EAAO,EAAQ,CACpC,MAAO,IAAc,GAAS,GAAI,GAAU,GAAI,IAuBlD,GAAI,IAAU,GAAS,SAAS,EAAQ,CACtC,GAAI,GAAS,EAAO,OAChB,EAAW,EAAS,EAAI,EAAO,EAAS,GAAK,EAEjD,SAAW,MAAO,IAAY,WAAc,GAAO,MAAO,GAAY,EAC/D,GAAU,EAAQ,KAkC3B,YAAe,EAAO,CACpB,GAAI,GAAS,EAAO,GACpB,SAAO,UAAY,GACZ,EA0BT,YAAa,EAAO,EAAa,CAC/B,SAAY,GACL,EA0BT,YAAc,EAAO,EAAa,CAChC,MAAO,GAAY,GAmBrB,GAAI,IAAY,GAAS,SAAS,EAAO,CACvC,GAAI,GAAS,EAAM,OACf,EAAQ,EAAS,EAAM,GAAK,EAC5B,EAAQ,KAAK,YACb,EAAc,SAAS,EAAQ,CAAE,MAAO,IAAO,EAAQ,IAE3D,MAAI,GAAS,GAAK,KAAK,YAAY,QAC/B,CAAE,aAAiB,KAAgB,CAAC,GAAQ,GACvC,KAAK,KAAK,GAEnB,GAAQ,EAAM,MAAM,EAAO,CAAC,EAAS,GAAS,EAAI,IAClD,EAAM,YAAY,KAAK,CACrB,KAAQ,GACR,KAAQ,CAAC,GACT,QAAW,IAEN,GAAI,IAAc,EAAO,KAAK,WAAW,KAAK,SAAS,EAAO,CACnE,MAAI,IAAU,CAAC,EAAM,QACnB,EAAM,KAAK,GAEN,OA+BX,aAAwB,CACtB,MAAO,IAAM,MA6Bf,aAAyB,CACvB,MAAO,IAAI,IAAc,KAAK,QAAS,KAAK,WAyB9C,aAAuB,CACrB,AAAI,KAAK,aAAe,GACtB,MAAK,WAAa,GAAQ,KAAK,UAEjC,GAAI,GAAO,KAAK,WAAa,KAAK,WAAW,OACzC,EAAQ,EAAO,EAAY,KAAK,WAAW,KAAK,aAEpD,MAAO,CAAE,KAAQ,EAAM,MAAS,GAqBlC,aAA6B,CAC3B,MAAO,MA2BT,YAAsB,EAAO,CAI3B,OAHI,GACA,EAAS,KAEN,YAAkB,KAAY,CACnC,GAAI,GAAQ,GAAa,GACzB,EAAM,UAAY,EAClB,EAAM,WAAa,EACnB,AAAI,EACF,EAAS,YAAc,EAEvB,EAAS,EAEX,GAAI,GAAW,EACf,EAAS,EAAO,YAElB,SAAS,YAAc,EAChB,EAuBT,aAA0B,CACxB,GAAI,GAAQ,KAAK,YACjB,GAAI,YAAiB,GAAa,CAChC,GAAI,GAAU,EACd,MAAI,MAAK,YAAY,QACnB,GAAU,GAAI,GAAY,OAE5B,EAAU,EAAQ,UAClB,EAAQ,YAAY,KAAK,CACvB,KAAQ,GACR,KAAQ,CAAC,IACT,QAAW,IAEN,GAAI,IAAc,EAAS,KAAK,WAEzC,MAAO,MAAK,KAAK,IAiBnB,aAAwB,CACtB,MAAO,IAAiB,KAAK,YAAa,KAAK,aA2BjD,GAAI,IAAU,GAAiB,SAAS,EAAQ,EAAO,EAAK,CAC1D,AAAI,GAAe,KAAK,EAAQ,GAC9B,EAAE,EAAO,GAET,GAAgB,EAAQ,EAAK,KA6CjC,YAAe,EAAY,EAAW,EAAO,CAC3C,GAAI,GAAO,GAAQ,GAAc,GAAa,GAC9C,MAAI,IAAS,GAAe,EAAY,EAAW,IACjD,GAAY,GAEP,EAAK,EAAY,GAAY,EAAW,IA4CjD,YAAgB,EAAY,EAAW,CACrC,GAAI,GAAO,GAAQ,GAAc,GAAc,GAC/C,MAAO,GAAK,EAAY,GAAY,EAAW,IAuCjD,GAAI,IAAO,GAAW,IAqBlB,GAAW,GAAW,IAuB1B,YAAiB,EAAY,EAAU,CACrC,MAAO,IAAY,GAAI,EAAY,GAAW,GAuBhD,YAAqB,EAAY,EAAU,CACzC,MAAO,IAAY,GAAI,EAAY,GAAW,IAwBhD,YAAsB,EAAY,EAAU,EAAO,CACjD,SAAQ,IAAU,EAAY,EAAI,GAAU,GACrC,GAAY,GAAI,EAAY,GAAW,GAiChD,YAAiB,EAAY,EAAU,CACrC,GAAI,GAAO,GAAQ,GAAc,GAAY,GAC7C,MAAO,GAAK,EAAY,GAAY,EAAU,IAuBhD,YAAsB,EAAY,EAAU,CAC1C,GAAI,GAAO,GAAQ,GAAc,GAAiB,GAClD,MAAO,GAAK,EAAY,GAAY,EAAU,IA0BhD,GAAI,IAAU,GAAiB,SAAS,EAAQ,EAAO,EAAK,CAC1D,AAAI,GAAe,KAAK,EAAQ,GAC9B,EAAO,GAAK,KAAK,GAEjB,GAAgB,EAAQ,EAAK,CAAC,MAkClC,YAAkB,EAAY,EAAO,EAAW,EAAO,CACrD,EAAa,GAAY,GAAc,EAAa,GAAO,GAC3D,EAAa,GAAa,CAAC,EAAS,GAAU,GAAa,EAE3D,GAAI,GAAS,EAAW,OACxB,MAAI,GAAY,GACd,GAAY,GAAU,EAAS,EAAW,IAErC,GAAS,GACX,GAAa,GAAU,EAAW,QAAQ,EAAO,GAAa,GAC9D,CAAC,CAAC,GAAU,EAAY,EAAY,EAAO,GAAa,GA0B/D,GAAI,IAAY,GAAS,SAAS,EAAY,EAAM,EAAM,CACxD,GAAI,GAAQ,GACR,EAAS,MAAO,IAAQ,WACxB,EAAS,GAAY,GAAc,EAAM,EAAW,QAAU,GAElE,UAAS,EAAY,SAAS,EAAO,CACnC,EAAO,EAAE,GAAS,EAAS,GAAM,EAAM,EAAO,GAAQ,GAAW,EAAO,EAAM,KAEzE,IA+BL,GAAQ,GAAiB,SAAS,EAAQ,EAAO,EAAK,CACxD,GAAgB,EAAQ,EAAK,KA6C/B,YAAa,EAAY,EAAU,CACjC,GAAI,GAAO,GAAQ,GAAc,GAAW,GAC5C,MAAO,GAAK,EAAY,GAAY,EAAU,IAgChD,YAAiB,EAAY,EAAW,EAAQ,EAAO,CACrD,MAAI,IAAc,KACT,GAEJ,IAAQ,IACX,GAAY,GAAa,KAAO,GAAK,CAAC,IAExC,EAAS,EAAQ,EAAY,EACxB,GAAQ,IACX,GAAS,GAAU,KAAO,GAAK,CAAC,IAE3B,GAAY,EAAY,EAAW,IAuC5C,GAAI,IAAY,GAAiB,SAAS,EAAQ,EAAO,EAAK,CAC5D,EAAO,EAAM,EAAI,GAAG,KAAK,IACxB,UAAW,CAAE,MAAO,CAAC,GAAI,MAuC5B,YAAgB,EAAY,EAAU,EAAa,CACjD,GAAI,GAAO,GAAQ,GAAc,GAAc,GAC3C,EAAY,UAAU,OAAS,EAEnC,MAAO,GAAK,EAAY,GAAY,EAAU,GAAI,EAAa,EAAW,IAyB5E,YAAqB,EAAY,EAAU,EAAa,CACtD,GAAI,GAAO,GAAQ,GAAc,GAAmB,GAChD,EAAY,UAAU,OAAS,EAEnC,MAAO,GAAK,EAAY,GAAY,EAAU,GAAI,EAAa,EAAW,IAqC5E,YAAgB,EAAY,EAAW,CACrC,GAAI,GAAO,GAAQ,GAAc,GAAc,GAC/C,MAAO,GAAK,EAAY,GAAO,GAAY,EAAW,KAiBxD,YAAgB,EAAY,CAC1B,GAAI,GAAO,GAAQ,GAAc,GAAc,GAC/C,MAAO,GAAK,GAuBd,YAAoB,EAAY,EAAG,EAAO,CACxC,AAAK,GAAQ,GAAe,EAAY,EAAG,GAAS,IAAM,GACxD,EAAI,EAEJ,EAAI,GAAU,GAEhB,GAAI,GAAO,GAAQ,GAAc,GAAkB,GACnD,MAAO,GAAK,EAAY,GAkB1B,YAAiB,EAAY,CAC3B,GAAI,GAAO,GAAQ,GAAc,GAAe,GAChD,MAAO,GAAK,GAwBd,YAAc,EAAY,CACxB,GAAI,GAAc,KAChB,MAAO,GAET,GAAI,GAAY,GACd,MAAO,IAAS,GAAc,GAAW,GAAc,EAAW,OAEpE,GAAI,GAAM,GAAO,GACjB,MAAI,IAAO,IAAU,GAAO,GACnB,EAAW,KAEb,GAAS,GAAY,OAuC9B,YAAc,EAAY,EAAW,EAAO,CAC1C,GAAI,GAAO,GAAQ,GAAc,EAAY,GAC7C,MAAI,IAAS,GAAe,EAAY,EAAW,IACjD,GAAY,GAEP,EAAK,EAAY,GAAY,EAAW,IAgCjD,GAAI,IAAS,GAAS,SAAS,EAAY,EAAW,CACpD,GAAI,GAAc,KAChB,MAAO,GAET,GAAI,GAAS,EAAU,OACvB,MAAI,GAAS,GAAK,GAAe,EAAY,EAAU,GAAI,EAAU,IACnE,EAAY,GACH,EAAS,GAAK,GAAe,EAAU,GAAI,EAAU,GAAI,EAAU,KAC5E,GAAY,CAAC,EAAU,KAElB,GAAY,EAAY,GAAY,EAAW,GAAI,MAqBxD,GAAM,IAAU,UAAW,CAC7B,MAAO,IAAK,KAAK,OA6BnB,YAAe,EAAG,EAAM,CACtB,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,SAAI,GAAU,GACP,UAAW,CAChB,GAAI,EAAE,EAAI,EACR,MAAO,GAAK,MAAM,KAAM,YAsB9B,YAAa,EAAM,EAAG,EAAO,CAC3B,SAAI,EAAQ,EAAY,EACxB,EAAK,GAAQ,GAAK,KAAQ,EAAK,OAAS,EACjC,GAAW,EAAM,GAAe,EAAW,EAAW,EAAW,EAAW,GAoBrF,YAAgB,EAAG,EAAM,CACvB,GAAI,GACJ,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,SAAI,GAAU,GACP,UAAW,CAChB,MAAI,EAAE,EAAI,GACR,GAAS,EAAK,MAAM,KAAM,YAExB,GAAK,GACP,GAAO,GAEF,GAuCX,GAAI,IAAO,GAAS,SAAS,EAAM,EAAS,EAAU,CACpD,GAAI,GAAU,EACd,GAAI,EAAS,OAAQ,CACnB,GAAI,GAAU,GAAe,EAAU,GAAU,KACjD,GAAW,EAEb,MAAO,IAAW,EAAM,EAAS,EAAS,EAAU,KAgDlD,GAAU,GAAS,SAAS,EAAQ,EAAK,EAAU,CACrD,GAAI,GAAU,EAAiB,EAC/B,GAAI,EAAS,OAAQ,CACnB,GAAI,GAAU,GAAe,EAAU,GAAU,KACjD,GAAW,EAEb,MAAO,IAAW,EAAK,EAAS,EAAQ,EAAU,KA4CpD,YAAe,EAAM,EAAO,EAAO,CACjC,EAAQ,EAAQ,EAAY,EAC5B,GAAI,GAAS,GAAW,EAAM,EAAiB,EAAW,EAAW,EAAW,EAAW,EAAW,GACtG,SAAO,YAAc,GAAM,YACpB,EAyCT,YAAoB,EAAM,EAAO,EAAO,CACtC,EAAQ,EAAQ,EAAY,EAC5B,GAAI,GAAS,GAAW,EAAM,GAAuB,EAAW,EAAW,EAAW,EAAW,EAAW,GAC5G,SAAO,YAAc,GAAW,YACzB,EAyDT,YAAkB,EAAM,EAAM,EAAS,CACrC,GAAI,GACA,EACA,EACA,EACA,EACA,EACA,GAAiB,EACjB,GAAU,GACV,GAAS,GACT,GAAW,GAEf,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,EAAO,GAAS,IAAS,EACrB,GAAS,IACX,IAAU,CAAC,CAAC,EAAQ,QACpB,GAAS,WAAa,GACtB,EAAU,GAAS,GAAU,GAAS,EAAQ,UAAY,EAAG,GAAQ,EACrE,GAAW,YAAc,GAAU,CAAC,CAAC,EAAQ,SAAW,IAG1D,YAAoB,GAAM,CACxB,GAAI,IAAO,EACP,GAAU,EAEd,SAAW,EAAW,EACtB,GAAiB,GACjB,EAAS,EAAK,MAAM,GAAS,IACtB,EAGT,YAAqB,GAAM,CAEzB,UAAiB,GAEjB,EAAU,GAAW,GAAc,GAE5B,GAAU,GAAW,IAAQ,EAGtC,YAAuB,GAAM,CAC3B,GAAI,IAAoB,GAAO,EAC3B,GAAsB,GAAO,GAC7B,GAAc,EAAO,GAEzB,MAAO,IACH,GAAU,GAAa,EAAU,IACjC,GAGN,YAAsB,GAAM,CAC1B,GAAI,IAAoB,GAAO,EAC3B,GAAsB,GAAO,GAKjC,MAAQ,KAAiB,GAAc,IAAqB,GACzD,GAAoB,GAAO,IAAU,IAAuB,EAGjE,aAAwB,CACtB,GAAI,IAAO,KACX,GAAI,GAAa,IACf,MAAO,IAAa,IAGtB,EAAU,GAAW,GAAc,GAAc,KAGnD,YAAsB,GAAM,CAK1B,MAJA,GAAU,EAIN,IAAY,EACP,GAAW,IAEpB,GAAW,EAAW,EACf,GAGT,aAAkB,CAChB,AAAI,IAAY,GACd,GAAa,GAEf,GAAiB,EACjB,EAAW,EAAe,EAAW,EAAU,EAGjD,aAAiB,CACf,MAAO,KAAY,EAAY,EAAS,GAAa,MAGvD,aAAqB,CACnB,GAAI,IAAO,KACP,GAAa,GAAa,IAM9B,GAJA,EAAW,UACX,EAAW,KACX,EAAe,GAEX,GAAY,CACd,GAAI,IAAY,EACd,MAAO,IAAY,GAErB,GAAI,GAEF,UAAa,GACb,EAAU,GAAW,GAAc,GAC5B,GAAW,GAGtB,MAAI,KAAY,GACd,GAAU,GAAW,GAAc,IAE9B,EAET,UAAU,OAAS,GACnB,GAAU,MAAQ,GACX,GAqBT,GAAI,IAAQ,GAAS,SAAS,EAAM,EAAM,CACxC,MAAO,IAAU,EAAM,EAAG,KAsBxB,GAAQ,GAAS,SAAS,EAAM,EAAM,EAAM,CAC9C,MAAO,IAAU,EAAM,GAAS,IAAS,EAAG,KAqB9C,YAAc,EAAM,CAClB,MAAO,IAAW,EAAM,IA+C1B,YAAiB,EAAM,EAAU,CAC/B,GAAI,MAAO,IAAQ,YAAe,GAAY,MAAQ,MAAO,IAAY,WACvE,KAAM,IAAI,IAAU,GAEtB,GAAI,GAAW,UAAW,CACxB,GAAI,GAAO,UACP,EAAM,EAAW,EAAS,MAAM,KAAM,GAAQ,EAAK,GACnD,EAAQ,EAAS,MAErB,GAAI,EAAM,IAAI,GACZ,MAAO,GAAM,IAAI,GAEnB,GAAI,GAAS,EAAK,MAAM,KAAM,GAC9B,SAAS,MAAQ,EAAM,IAAI,EAAK,IAAW,EACpC,GAET,SAAS,MAAQ,GAAK,IAAQ,OAAS,IAChC,EAIT,GAAQ,MAAQ,GAsBhB,YAAgB,EAAW,CACzB,GAAI,MAAO,IAAa,WACtB,KAAM,IAAI,IAAU,GAEtB,MAAO,WAAW,CAChB,GAAI,GAAO,UACX,OAAQ,EAAK,YACN,GAAG,MAAO,CAAC,EAAU,KAAK,UAC1B,GAAG,MAAO,CAAC,EAAU,KAAK,KAAM,EAAK,QACrC,GAAG,MAAO,CAAC,EAAU,KAAK,KAAM,EAAK,GAAI,EAAK,QAC9C,GAAG,MAAO,CAAC,EAAU,KAAK,KAAM,EAAK,GAAI,EAAK,GAAI,EAAK,IAE9D,MAAO,CAAC,EAAU,MAAM,KAAM,IAsBlC,YAAc,EAAM,CAClB,MAAO,IAAO,EAAG,GAkCnB,GAAI,IAAW,GAAS,SAAS,EAAM,EAAY,CACjD,EAAc,EAAW,QAAU,GAAK,GAAQ,EAAW,IACvD,GAAS,EAAW,GAAI,GAAU,OAClC,GAAS,GAAY,EAAY,GAAI,GAAU,OAEnD,GAAI,GAAc,EAAW,OAC7B,MAAO,IAAS,SAAS,EAAM,CAI7B,OAHI,GAAQ,GACR,EAAS,GAAU,EAAK,OAAQ,GAE7B,EAAE,EAAQ,GACf,EAAK,GAAS,EAAW,GAAO,KAAK,KAAM,EAAK,IAElD,MAAO,IAAM,EAAM,KAAM,OAqCzB,GAAU,GAAS,SAAS,EAAM,EAAU,CAC9C,GAAI,GAAU,GAAe,EAAU,GAAU,KACjD,MAAO,IAAW,EAAM,EAAmB,EAAW,EAAU,KAmC9D,GAAe,GAAS,SAAS,EAAM,EAAU,CACnD,GAAI,GAAU,GAAe,EAAU,GAAU,KACjD,MAAO,IAAW,EAAM,GAAyB,EAAW,EAAU,KAyBpE,GAAQ,GAAS,SAAS,EAAM,EAAS,CAC3C,MAAO,IAAW,EAAM,EAAiB,EAAW,EAAW,EAAW,KA4B5E,YAAc,EAAM,EAAO,CACzB,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,SAAQ,IAAU,EAAY,EAAQ,GAAU,GACzC,GAAS,EAAM,GAqCxB,YAAgB,EAAM,EAAO,CAC3B,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,SAAQ,GAAS,KAAO,EAAI,GAAU,GAAU,GAAQ,GACjD,GAAS,SAAS,EAAM,CAC7B,GAAI,GAAQ,EAAK,GACb,EAAY,GAAU,EAAM,EAAG,GAEnC,MAAI,IACF,GAAU,EAAW,GAEhB,GAAM,EAAM,KAAM,KAgD7B,YAAkB,EAAM,EAAM,EAAS,CACrC,GAAI,GAAU,GACV,EAAW,GAEf,GAAI,MAAO,IAAQ,WACjB,KAAM,IAAI,IAAU,GAEtB,MAAI,IAAS,IACX,GAAU,WAAa,GAAU,CAAC,CAAC,EAAQ,QAAU,EACrD,EAAW,YAAc,GAAU,CAAC,CAAC,EAAQ,SAAW,GAEnD,GAAS,EAAM,EAAM,CAC1B,QAAW,EACX,QAAW,EACX,SAAY,IAmBhB,YAAe,EAAM,CACnB,MAAO,IAAI,EAAM,GAyBnB,YAAc,EAAO,EAAS,CAC5B,MAAO,IAAQ,GAAa,GAAU,GAsCxC,aAAqB,CACnB,GAAI,CAAC,UAAU,OACb,MAAO,GAET,GAAI,GAAQ,UAAU,GACtB,MAAO,IAAQ,GAAS,EAAQ,CAAC,GA6BnC,YAAe,EAAO,CACpB,MAAO,IAAU,EAAO,GAkC1B,YAAmB,EAAO,EAAY,CACpC,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAU,EAAO,EAAoB,GAqB9C,YAAmB,EAAO,CACxB,MAAO,IAAU,EAAO,EAAkB,GA+B5C,YAAuB,EAAO,EAAY,CACxC,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAU,EAAO,EAAkB,EAAoB,GA2BhE,YAAoB,EAAQ,EAAQ,CAClC,MAAO,IAAU,MAAQ,GAAe,EAAQ,EAAQ,GAAK,IAmC/D,YAAY,EAAO,EAAO,CACxB,MAAO,KAAU,GAAU,IAAU,GAAS,IAAU,EA0B1D,GAAI,IAAK,GAA0B,IAyB/B,GAAM,GAA0B,SAAS,EAAO,EAAO,CACzD,MAAO,IAAS,IAqBd,GAAc,GAAgB,UAAW,CAAE,MAAO,eAAkB,GAAkB,SAAS,EAAO,CACxG,MAAO,IAAa,IAAU,GAAe,KAAK,EAAO,WACvD,CAAC,GAAqB,KAAK,EAAO,WA0BlC,GAAU,EAAM,QAmBhB,GAAgB,GAAoB,GAAU,IAAqB,GA2BvE,YAAqB,EAAO,CAC1B,MAAO,IAAS,MAAQ,GAAS,EAAM,SAAW,CAAC,GAAW,GA4BhE,YAA2B,EAAO,CAChC,MAAO,IAAa,IAAU,GAAY,GAoB5C,YAAmB,EAAO,CACxB,MAAO,KAAU,IAAQ,IAAU,IAChC,GAAa,IAAU,GAAW,IAAU,GAoBjD,GAAI,IAAW,IAAkB,GAmB7B,GAAS,GAAa,GAAU,IAAc,GAmBlD,YAAmB,EAAO,CACxB,MAAO,IAAa,IAAU,EAAM,WAAa,GAAK,CAAC,GAAc,GAoCvE,YAAiB,EAAO,CACtB,GAAI,GAAS,KACX,MAAO,GAET,GAAI,GAAY,IACX,IAAQ,IAAU,MAAO,IAAS,UAAY,MAAO,GAAM,QAAU,YACpE,GAAS,IAAU,GAAa,IAAU,GAAY,IAC1D,MAAO,CAAC,EAAM,OAEhB,GAAI,GAAM,GAAO,GACjB,GAAI,GAAO,IAAU,GAAO,GAC1B,MAAO,CAAC,EAAM,KAEhB,GAAI,GAAY,GACd,MAAO,CAAC,GAAS,GAAO,OAE1B,OAAS,KAAO,GACd,GAAI,GAAe,KAAK,EAAO,GAC7B,MAAO,GAGX,MAAO,GA+BT,YAAiB,EAAO,EAAO,CAC7B,MAAO,IAAY,EAAO,GAmC5B,YAAqB,EAAO,EAAO,EAAY,CAC7C,EAAa,MAAO,IAAc,WAAa,EAAa,EAC5D,GAAI,GAAS,EAAa,EAAW,EAAO,GAAS,EACrD,MAAO,KAAW,EAAY,GAAY,EAAO,EAAO,EAAW,GAAc,CAAC,CAAC,EAqBrF,YAAiB,EAAO,CACtB,GAAI,CAAC,GAAa,GAChB,MAAO,GAET,GAAI,GAAM,GAAW,GACrB,MAAO,IAAO,IAAY,GAAO,IAC9B,MAAO,GAAM,SAAW,UAAY,MAAO,GAAM,MAAQ,UAAY,CAAC,GAAc,GA6BzF,YAAkB,EAAO,CACvB,MAAO,OAAO,IAAS,UAAY,GAAe,GAoBpD,YAAoB,EAAO,CACzB,GAAI,CAAC,GAAS,GACZ,MAAO,GAIT,GAAI,GAAM,GAAW,GACrB,MAAO,IAAO,IAAW,GAAO,IAAU,GAAO,GAAY,GAAO,GA6BtE,YAAmB,EAAO,CACxB,MAAO,OAAO,IAAS,UAAY,GAAS,GAAU,GA6BxD,YAAkB,EAAO,CACvB,MAAO,OAAO,IAAS,UACrB,EAAQ,IAAM,EAAQ,GAAK,GAAK,GAAS,GA4B7C,YAAkB,EAAO,CACvB,GAAI,GAAO,MAAO,GAClB,MAAO,IAAS,MAAS,IAAQ,UAAY,GAAQ,YA2BvD,YAAsB,EAAO,CAC3B,MAAO,IAAS,MAAQ,MAAO,IAAS,SAoB1C,GAAI,IAAQ,GAAY,GAAU,IAAa,GA8B/C,YAAiB,EAAQ,EAAQ,CAC/B,MAAO,KAAW,GAAU,GAAY,EAAQ,EAAQ,GAAa,IAmCvE,YAAqB,EAAQ,EAAQ,EAAY,CAC/C,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAY,EAAQ,EAAQ,GAAa,GAAS,GA+B3D,YAAe,EAAO,CAIpB,MAAO,IAAS,IAAU,GAAS,CAAC,EA6BtC,YAAkB,EAAO,CACvB,GAAI,GAAW,GACb,KAAM,IAAI,IAAM,GAElB,MAAO,IAAa,GAoBtB,YAAgB,EAAO,CACrB,MAAO,KAAU,KAuBnB,YAAe,EAAO,CACpB,MAAO,IAAS,KA6BlB,YAAkB,EAAO,CACvB,MAAO,OAAO,IAAS,UACpB,GAAa,IAAU,GAAW,IAAU,GA+BjD,YAAuB,EAAO,CAC5B,GAAI,CAAC,GAAa,IAAU,GAAW,IAAU,GAC/C,MAAO,GAET,GAAI,GAAQ,GAAa,GACzB,GAAI,IAAU,KACZ,MAAO,GAET,GAAI,GAAO,GAAe,KAAK,EAAO,gBAAkB,EAAM,YAC9D,MAAO,OAAO,IAAQ,YAAc,YAAgB,IAClD,GAAa,KAAK,IAAS,GAoB/B,GAAI,IAAW,GAAe,GAAU,IAAgB,GA6BxD,YAAuB,EAAO,CAC5B,MAAO,IAAU,IAAU,GAAS,CAAC,IAAoB,GAAS,GAoBpE,GAAI,IAAQ,GAAY,GAAU,IAAa,GAmB/C,YAAkB,EAAO,CACvB,MAAO,OAAO,IAAS,UACpB,CAAC,GAAQ,IAAU,GAAa,IAAU,GAAW,IAAU,GAoBpE,YAAkB,EAAO,CACvB,MAAO,OAAO,IAAS,UACpB,GAAa,IAAU,GAAW,IAAU,GAoBjD,GAAI,IAAe,GAAmB,GAAU,IAAoB,GAmBpE,YAAqB,EAAO,CAC1B,MAAO,KAAU,EAoBnB,YAAmB,EAAO,CACxB,MAAO,IAAa,IAAU,GAAO,IAAU,GAoBjD,YAAmB,EAAO,CACxB,MAAO,IAAa,IAAU,GAAW,IAAU,EA0BrD,GAAI,IAAK,GAA0B,IAyB/B,GAAM,GAA0B,SAAS,EAAO,EAAO,CACzD,MAAO,IAAS,IA0BlB,YAAiB,EAAO,CACtB,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAY,GACd,MAAO,IAAS,GAAS,GAAc,GAAS,GAAU,GAE5D,GAAI,IAAe,EAAM,IACvB,MAAO,IAAgB,EAAM,OAE/B,GAAI,GAAM,GAAO,GACb,EAAO,GAAO,GAAS,GAAc,GAAO,GAAS,GAAa,GAEtE,MAAO,GAAK,GA0Bd,YAAkB,EAAO,CACvB,GAAI,CAAC,EACH,MAAO,KAAU,EAAI,EAAQ,EAG/B,GADA,EAAQ,GAAS,GACb,IAAU,IAAY,IAAU,CAAC,GAAU,CAC7C,GAAI,GAAQ,EAAQ,EAAI,GAAK,EAC7B,MAAO,GAAO,GAEhB,MAAO,KAAU,EAAQ,EAAQ,EA6BnC,YAAmB,EAAO,CACxB,GAAI,GAAS,GAAS,GAClB,EAAY,EAAS,EAEzB,MAAO,KAAW,EAAU,EAAY,EAAS,EAAY,EAAU,EA8BzE,YAAkB,EAAO,CACvB,MAAO,GAAQ,GAAU,GAAU,GAAQ,EAAG,IAAoB,EA0BpE,YAAkB,EAAO,CACvB,GAAI,MAAO,IAAS,SAClB,MAAO,GAET,GAAI,GAAS,GACX,MAAO,IAET,GAAI,GAAS,GAAQ,CACnB,GAAI,GAAQ,MAAO,GAAM,SAAW,WAAa,EAAM,UAAY,EACnE,EAAQ,GAAS,GAAU,EAAQ,GAAM,EAE3C,GAAI,MAAO,IAAS,SAClB,MAAO,KAAU,EAAI,EAAQ,CAAC,EAEhC,EAAQ,GAAS,GACjB,GAAI,GAAW,GAAW,KAAK,GAC/B,MAAQ,IAAY,GAAU,KAAK,GAC/B,GAAa,EAAM,MAAM,GAAI,EAAW,EAAI,GAC3C,GAAW,KAAK,GAAS,GAAM,CAAC,EA2BvC,YAAuB,EAAO,CAC5B,MAAO,IAAW,EAAO,GAAO,IA2BlC,YAAuB,EAAO,CAC5B,MAAO,GACH,GAAU,GAAU,GAAQ,CAAC,GAAkB,IAC9C,IAAU,EAAI,EAAQ,EAwB7B,YAAkB,EAAO,CACvB,MAAO,IAAS,KAAO,GAAK,GAAa,GAqC3C,GAAI,IAAS,GAAe,SAAS,EAAQ,EAAQ,CACnD,GAAI,GAAY,IAAW,GAAY,GAAS,CAC9C,GAAW,EAAQ,GAAK,GAAS,GACjC,OAEF,OAAS,KAAO,GACd,AAAI,GAAe,KAAK,EAAQ,IAC9B,GAAY,EAAQ,EAAK,EAAO,MAoClC,GAAW,GAAe,SAAS,EAAQ,EAAQ,CACrD,GAAW,EAAQ,GAAO,GAAS,KAgCjC,GAAe,GAAe,SAAS,EAAQ,EAAQ,EAAU,EAAY,CAC/E,GAAW,EAAQ,GAAO,GAAS,EAAQ,KA+BzC,GAAa,GAAe,SAAS,EAAQ,EAAQ,EAAU,EAAY,CAC7E,GAAW,EAAQ,GAAK,GAAS,EAAQ,KAoBvC,GAAK,GAAS,IAoClB,YAAgB,EAAW,EAAY,CACrC,GAAI,GAAS,GAAW,GACxB,MAAO,IAAc,KAAO,EAAS,GAAW,EAAQ,GAwB1D,GAAI,IAAW,GAAS,SAAS,EAAQ,EAAS,CAChD,EAAS,GAAO,GAEhB,GAAI,GAAQ,GACR,EAAS,EAAQ,OACjB,EAAQ,EAAS,EAAI,EAAQ,GAAK,EAMtC,IAJI,GAAS,GAAe,EAAQ,GAAI,EAAQ,GAAI,IAClD,GAAS,GAGJ,EAAE,EAAQ,GAMf,OALI,GAAS,EAAQ,GACjB,EAAQ,GAAO,GACf,EAAa,GACb,EAAc,EAAM,OAEjB,EAAE,EAAa,GAAa,CACjC,GAAI,IAAM,EAAM,GACZ,GAAQ,EAAO,IAEnB,AAAI,MAAU,GACT,GAAG,GAAO,GAAY,MAAS,CAAC,GAAe,KAAK,EAAQ,MAC/D,GAAO,IAAO,EAAO,KAK3B,MAAO,KAsBL,GAAe,GAAS,SAAS,EAAM,CACzC,SAAK,KAAK,EAAW,IACd,GAAM,GAAW,EAAW,KAsCrC,YAAiB,EAAQ,EAAW,CAClC,MAAO,GAAY,EAAQ,GAAY,EAAW,GAAI,IAsCxD,YAAqB,EAAQ,EAAW,CACtC,MAAO,GAAY,EAAQ,GAAY,EAAW,GAAI,IA+BxD,YAAe,EAAQ,EAAU,CAC/B,MAAO,IAAU,KACb,EACA,GAAQ,EAAQ,GAAY,EAAU,GAAI,IA6BhD,YAAoB,EAAQ,EAAU,CACpC,MAAO,IAAU,KACb,EACA,GAAa,EAAQ,GAAY,EAAU,GAAI,IA+BrD,YAAgB,EAAQ,EAAU,CAChC,MAAO,IAAU,GAAW,EAAQ,GAAY,EAAU,IA6B5D,YAAqB,EAAQ,EAAU,CACrC,MAAO,IAAU,GAAgB,EAAQ,GAAY,EAAU,IA0BjE,YAAmB,EAAQ,CACzB,MAAO,IAAU,KAAO,GAAK,GAAc,EAAQ,GAAK,IA0B1D,YAAqB,EAAQ,CAC3B,MAAO,IAAU,KAAO,GAAK,GAAc,EAAQ,GAAO,IA4B5D,YAAa,EAAQ,EAAM,EAAc,CACvC,GAAI,GAAS,GAAU,KAAO,EAAY,GAAQ,EAAQ,GAC1D,MAAO,KAAW,EAAY,EAAe,EA8B/C,YAAa,EAAQ,EAAM,CACzB,MAAO,IAAU,MAAQ,GAAQ,EAAQ,EAAM,IA6BjD,YAAe,EAAQ,EAAM,CAC3B,MAAO,IAAU,MAAQ,GAAQ,EAAQ,EAAM,IAqBjD,GAAI,IAAS,GAAe,SAAS,EAAQ,EAAO,EAAK,CACvD,AAAI,GAAS,MACT,MAAO,GAAM,UAAY,YAC3B,GAAQ,GAAqB,KAAK,IAGpC,EAAO,GAAS,GACf,GAAS,KA4BR,GAAW,GAAe,SAAS,EAAQ,EAAO,EAAK,CACzD,AAAI,GAAS,MACT,MAAO,GAAM,UAAY,YAC3B,GAAQ,GAAqB,KAAK,IAGpC,AAAI,GAAe,KAAK,EAAQ,GAC9B,EAAO,GAAO,KAAK,GAEnB,EAAO,GAAS,CAAC,IAElB,IAoBC,GAAS,GAAS,IA8BtB,YAAc,EAAQ,CACpB,MAAO,IAAY,GAAU,GAAc,GAAU,GAAS,GA0BhE,YAAgB,EAAQ,CACtB,MAAO,IAAY,GAAU,GAAc,EAAQ,IAAQ,GAAW,GAwBxE,YAAiB,EAAQ,EAAU,CACjC,GAAI,GAAS,GACb,SAAW,GAAY,EAAU,GAEjC,GAAW,EAAQ,SAAS,EAAO,EAAK,EAAQ,CAC9C,GAAgB,EAAQ,EAAS,EAAO,EAAK,GAAS,KAEjD,EA+BT,YAAmB,EAAQ,EAAU,CACnC,GAAI,GAAS,GACb,SAAW,GAAY,EAAU,GAEjC,GAAW,EAAQ,SAAS,EAAO,EAAK,EAAQ,CAC9C,GAAgB,EAAQ,EAAK,EAAS,EAAO,EAAK,MAE7C,EAkCT,GAAI,IAAQ,GAAe,SAAS,EAAQ,EAAQ,EAAU,CAC5D,GAAU,EAAQ,EAAQ,KAkCxB,GAAY,GAAe,SAAS,EAAQ,EAAQ,EAAU,EAAY,CAC5E,GAAU,EAAQ,EAAQ,EAAU,KAuBlC,GAAO,GAAS,SAAS,EAAQ,EAAO,CAC1C,GAAI,GAAS,GACb,GAAI,GAAU,KACZ,MAAO,GAET,GAAI,GAAS,GACb,EAAQ,GAAS,EAAO,SAAS,EAAM,CACrC,SAAO,GAAS,EAAM,GACtB,GAAW,GAAS,EAAK,OAAS,GAC3B,IAET,GAAW,EAAQ,GAAa,GAAS,GACrC,GACF,GAAS,GAAU,EAAQ,EAAkB,EAAkB,EAAoB,KAGrF,OADI,GAAS,EAAM,OACZ,KACL,GAAU,EAAQ,EAAM,IAE1B,MAAO,KAuBT,YAAgB,EAAQ,EAAW,CACjC,MAAO,IAAO,EAAQ,GAAO,GAAY,KAoB3C,GAAI,IAAO,GAAS,SAAS,EAAQ,EAAO,CAC1C,MAAO,IAAU,KAAO,GAAK,GAAS,EAAQ,KAqBhD,YAAgB,EAAQ,EAAW,CACjC,GAAI,GAAU,KACZ,MAAO,GAET,GAAI,GAAQ,GAAS,GAAa,GAAS,SAAS,EAAM,CACxD,MAAO,CAAC,KAEV,SAAY,GAAY,GACjB,GAAW,EAAQ,EAAO,SAAS,EAAO,EAAM,CACrD,MAAO,GAAU,EAAO,EAAK,MAiCjC,YAAgB,EAAQ,EAAM,EAAc,CAC1C,EAAO,GAAS,EAAM,GAEtB,GAAI,GAAQ,GACR,EAAS,EAAK,OAOlB,IAJK,GACH,GAAS,EACT,EAAS,GAEJ,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAQ,GAAU,KAAO,EAAY,EAAO,GAAM,EAAK,KAC3D,AAAI,IAAU,GACZ,GAAQ,EACR,EAAQ,GAEV,EAAS,GAAW,GAAS,EAAM,KAAK,GAAU,EAEpD,MAAO,GA+BT,YAAa,EAAQ,EAAM,EAAO,CAChC,MAAO,IAAU,KAAO,EAAS,GAAQ,EAAQ,EAAM,GA2BzD,YAAiB,EAAQ,EAAM,EAAO,EAAY,CAChD,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAU,KAAO,EAAS,GAAQ,EAAQ,EAAM,EAAO,GA2BhE,GAAI,IAAU,GAAc,IA0BxB,GAAY,GAAc,IAgC9B,YAAmB,EAAQ,EAAU,EAAa,CAChD,GAAI,GAAQ,GAAQ,GAChB,EAAY,GAAS,GAAS,IAAW,GAAa,GAG1D,GADA,EAAW,GAAY,EAAU,GAC7B,GAAe,KAAM,CACvB,GAAI,GAAO,GAAU,EAAO,YAC5B,AAAI,EACF,EAAc,EAAQ,GAAI,GAAO,GAE9B,AAAI,GAAS,GAChB,EAAc,GAAW,GAAQ,GAAW,GAAa,IAAW,GAGpE,EAAc,GAGlB,MAAC,GAAY,GAAY,IAAY,EAAQ,SAAS,EAAO,EAAO,EAAQ,CAC1E,MAAO,GAAS,EAAa,EAAO,EAAO,KAEtC,EA8BT,YAAe,EAAQ,EAAM,CAC3B,MAAO,IAAU,KAAO,GAAO,GAAU,EAAQ,GA8BnD,YAAgB,EAAQ,EAAM,EAAS,CACrC,MAAO,IAAU,KAAO,EAAS,GAAW,EAAQ,EAAM,GAAa,IA2BzE,YAAoB,EAAQ,EAAM,EAAS,EAAY,CACrD,SAAa,MAAO,IAAc,WAAa,EAAa,EACrD,GAAU,KAAO,EAAS,GAAW,EAAQ,EAAM,GAAa,GAAU,GA6BnF,YAAgB,EAAQ,CACtB,MAAO,IAAU,KAAO,GAAK,GAAW,EAAQ,GAAK,IA2BvD,YAAkB,EAAQ,CACxB,MAAO,IAAU,KAAO,GAAK,GAAW,EAAQ,GAAO,IAwBzD,YAAe,EAAQ,EAAO,EAAO,CACnC,MAAI,KAAU,GACZ,GAAQ,EACR,EAAQ,GAEN,IAAU,GACZ,GAAQ,GAAS,GACjB,EAAQ,IAAU,EAAQ,EAAQ,GAEhC,IAAU,GACZ,GAAQ,GAAS,GACjB,EAAQ,IAAU,EAAQ,EAAQ,GAE7B,GAAU,GAAS,GAAS,EAAO,GAyC5C,YAAiB,EAAQ,EAAO,EAAK,CACnC,SAAQ,GAAS,GACjB,AAAI,IAAQ,EACV,GAAM,EACN,EAAQ,GAER,EAAM,GAAS,GAEjB,EAAS,GAAS,GACX,GAAY,EAAQ,EAAO,GAkCpC,YAAgB,EAAO,EAAO,EAAU,CA2BtC,GA1BI,GAAY,MAAO,IAAY,WAAa,GAAe,EAAO,EAAO,IAC3E,GAAQ,EAAW,GAEjB,IAAa,GACf,CAAI,MAAO,IAAS,UAClB,GAAW,EACX,EAAQ,GAED,MAAO,IAAS,WACvB,GAAW,EACX,EAAQ,IAGZ,AAAI,IAAU,GAAa,IAAU,EACnC,GAAQ,EACR,EAAQ,GAGR,GAAQ,GAAS,GACjB,AAAI,IAAU,EACZ,GAAQ,EACR,EAAQ,GAER,EAAQ,GAAS,IAGjB,EAAQ,EAAO,CACjB,GAAI,GAAO,EACX,EAAQ,EACR,EAAQ,EAEV,GAAI,GAAY,EAAQ,GAAK,EAAQ,EAAG,CACtC,GAAI,GAAO,KACX,MAAO,IAAU,EAAS,EAAQ,GAAQ,EAAQ,GAAe,MAAU,IAAO,IAAI,OAAS,KAAO,GAExG,MAAO,IAAW,EAAO,GAyB3B,GAAI,IAAY,GAAiB,SAAS,EAAQ,EAAM,EAAO,CAC7D,SAAO,EAAK,cACL,EAAU,GAAQ,GAAW,GAAQ,KAkB9C,YAAoB,EAAQ,CAC1B,MAAO,IAAW,GAAS,GAAQ,eAqBrC,YAAgB,EAAQ,CACtB,SAAS,GAAS,GACX,GAAU,EAAO,QAAQ,GAAS,IAAc,QAAQ,GAAa,IA0B9E,YAAkB,EAAQ,EAAQ,EAAU,CAC1C,EAAS,GAAS,GAClB,EAAS,GAAa,GAEtB,GAAI,GAAS,EAAO,OACpB,EAAW,IAAa,EACpB,EACA,GAAU,GAAU,GAAW,EAAG,GAEtC,GAAI,GAAM,EACV,UAAY,EAAO,OACZ,GAAY,GAAK,EAAO,MAAM,EAAU,IAAQ,EA+BzD,YAAgB,EAAQ,CACtB,SAAS,GAAS,GACV,GAAU,GAAmB,KAAK,GACtC,EAAO,QAAQ,GAAiB,IAChC,EAkBN,YAAsB,EAAQ,CAC5B,SAAS,GAAS,GACV,GAAU,GAAgB,KAAK,GACnC,EAAO,QAAQ,GAAc,QAC7B,EAwBN,GAAI,IAAY,GAAiB,SAAS,EAAQ,EAAM,EAAO,CAC7D,MAAO,GAAU,GAAQ,IAAM,IAAM,EAAK,gBAuBxC,GAAY,GAAiB,SAAS,EAAQ,EAAM,EAAO,CAC7D,MAAO,GAAU,GAAQ,IAAM,IAAM,EAAK,gBAoBxC,GAAa,GAAgB,eAyBjC,YAAa,EAAQ,EAAQ,EAAO,CAClC,EAAS,GAAS,GAClB,EAAS,GAAU,GAEnB,GAAI,GAAY,EAAS,GAAW,GAAU,EAC9C,GAAI,CAAC,GAAU,GAAa,EAC1B,MAAO,GAET,GAAI,GAAO,GAAS,GAAa,EACjC,MACE,IAAc,GAAY,GAAM,GAChC,EACA,GAAc,GAAW,GAAM,GA2BnC,YAAgB,EAAQ,EAAQ,EAAO,CACrC,EAAS,GAAS,GAClB,EAAS,GAAU,GAEnB,GAAI,GAAY,EAAS,GAAW,GAAU,EAC9C,MAAQ,IAAU,EAAY,EACzB,EAAS,GAAc,EAAS,EAAW,GAC5C,EA0BN,YAAkB,EAAQ,EAAQ,EAAO,CACvC,EAAS,GAAS,GAClB,EAAS,GAAU,GAEnB,GAAI,GAAY,EAAS,GAAW,GAAU,EAC9C,MAAQ,IAAU,EAAY,EACzB,GAAc,EAAS,EAAW,GAAS,EAC5C,EA2BN,YAAkB,EAAQ,EAAO,EAAO,CACtC,MAAI,IAAS,GAAS,KACpB,EAAQ,EACC,GACT,GAAQ,CAAC,GAEJ,GAAe,GAAS,GAAQ,QAAQ,GAAa,IAAK,GAAS,GAyB5E,YAAgB,EAAQ,EAAG,EAAO,CAChC,MAAK,GAAQ,GAAe,EAAQ,EAAG,GAAS,IAAM,GACpD,EAAI,EAEJ,EAAI,GAAU,GAET,GAAW,GAAS,GAAS,GAsBtC,aAAmB,CACjB,GAAI,GAAO,UACP,EAAS,GAAS,EAAK,IAE3B,MAAO,GAAK,OAAS,EAAI,EAAS,EAAO,QAAQ,EAAK,GAAI,EAAK,IAwBjE,GAAI,IAAY,GAAiB,SAAS,EAAQ,EAAM,EAAO,CAC7D,MAAO,GAAU,GAAQ,IAAM,IAAM,EAAK,gBAsB5C,YAAe,EAAQ,EAAW,EAAO,CAKvC,MAJI,IAAS,MAAO,IAAS,UAAY,GAAe,EAAQ,EAAW,IACzE,GAAY,EAAQ,GAEtB,EAAQ,IAAU,EAAY,GAAmB,IAAU,EACvD,AAAC,EAGL,GAAS,GAAS,GACd,GACE,OAAO,IAAa,UACnB,GAAa,MAAQ,CAAC,GAAS,KAEpC,GAAY,GAAa,GACrB,CAAC,GAAa,GAAW,IACpB,GAAU,GAAc,GAAS,EAAG,GAGxC,EAAO,MAAM,EAAW,IAZtB,GAoCX,GAAI,IAAY,GAAiB,SAAS,EAAQ,EAAM,EAAO,CAC7D,MAAO,GAAU,GAAQ,IAAM,IAAM,GAAW,KA0BlD,YAAoB,EAAQ,EAAQ,EAAU,CAC5C,SAAS,GAAS,GAClB,EAAW,GAAY,KACnB,EACA,GAAU,GAAU,GAAW,EAAG,EAAO,QAE7C,EAAS,GAAa,GACf,EAAO,MAAM,EAAU,EAAW,EAAO,SAAW,EA2G7D,YAAkB,EAAQ,EAAS,EAAO,CAIxC,GAAI,GAAW,EAAO,iBAEtB,AAAI,GAAS,GAAe,EAAQ,EAAS,IAC3C,GAAU,GAEZ,EAAS,GAAS,GAClB,EAAU,GAAa,GAAI,EAAS,EAAU,IAE9C,GAAI,GAAU,GAAa,GAAI,EAAQ,QAAS,EAAS,QAAS,IAC9D,EAAc,GAAK,GACnB,EAAgB,GAAW,EAAS,GAEpC,EACA,EACA,GAAQ,EACR,GAAc,EAAQ,aAAe,GACrC,GAAS,WAGT,GAAe,GAChB,GAAQ,QAAU,IAAW,OAAS,IACvC,GAAY,OAAS,IACpB,MAAgB,GAAgB,GAAe,IAAW,OAAS,IACnE,GAAQ,UAAY,IAAW,OAAS,KACzC,KAME,GAAY,iBACb,IAAe,KAAK,EAAS,aACzB,GAAQ,UAAY,IAAI,QAAQ,MAAO,KACvC,0BAA6B,GAAE,GAAmB,KACnD;AAAA,EAEN,EAAO,QAAQ,GAAc,SAAS,GAAO,GAAa,GAAkB,GAAiB,GAAe,GAAQ,CAClH,WAAqB,IAAmB,IAGxC,IAAU,EAAO,MAAM,GAAO,IAAQ,QAAQ,GAAmB,IAG7D,IACF,GAAa,GACb,IAAU;AAAA,MAAc,GAAc;AAAA,IAEpC,IACF,GAAe,GACf,IAAU;AAAA,EAAS,GAAgB;AAAA,WAEjC,IACF,KAAU;AAAA,WAAmB,GAAmB;AAAA,IAElD,GAAQ,GAAS,GAAM,OAIhB,KAGT,IAAU;AAAA,EAIV,GAAI,IAAW,GAAe,KAAK,EAAS,aAAe,EAAQ,SACnE,GAAI,CAAC,GACH,GAAS;AAAA,EAAmB,GAAS;AAAA;AAAA,UAI9B,GAA2B,KAAK,IACvC,KAAM,IAAI,IAAM,GAIlB,GAAU,GAAe,GAAO,QAAQ,GAAsB,IAAM,IACjE,QAAQ,GAAqB,MAC7B,QAAQ,GAAuB,OAGlC,GAAS,YAAe,KAAY,OAAS;AAAA,EAC1C,IACG,GACA;AAAA,GAEJ,oBACC,GACI,mBACA,IAEJ,GACG;AAAA;AAAA,EAEA;AAAA,GAEJ,GACA;AAAA,GAEF,GAAI,IAAS,GAAQ,UAAW,CAC9B,MAAO,IAAS,EAAa,GAAY,UAAY,IAClD,MAAM,EAAW,KAMtB,GADA,GAAO,OAAS,GACZ,GAAQ,IACV,KAAM,IAER,MAAO,IAwBT,YAAiB,EAAO,CACtB,MAAO,IAAS,GAAO,cAwBzB,YAAiB,EAAO,CACtB,MAAO,IAAS,GAAO,cAyBzB,YAAc,EAAQ,EAAO,EAAO,CAElC,GADA,EAAS,GAAS,GACd,GAAW,IAAS,IAAU,GAChC,MAAO,IAAS,GAElB,GAAI,CAAC,GAAU,CAAE,GAAQ,GAAa,IACpC,MAAO,GAET,GAAI,GAAa,GAAc,GAC3B,EAAa,GAAc,GAC3B,EAAQ,GAAgB,EAAY,GACpC,EAAM,GAAc,EAAY,GAAc,EAElD,MAAO,IAAU,EAAY,EAAO,GAAK,KAAK,IAsBhD,YAAiB,EAAQ,EAAO,EAAO,CAErC,GADA,EAAS,GAAS,GACd,GAAW,IAAS,IAAU,GAChC,MAAO,GAAO,MAAM,EAAG,GAAgB,GAAU,GAEnD,GAAI,CAAC,GAAU,CAAE,GAAQ,GAAa,IACpC,MAAO,GAET,GAAI,GAAa,GAAc,GAC3B,EAAM,GAAc,EAAY,GAAc,IAAU,EAE5D,MAAO,IAAU,EAAY,EAAG,GAAK,KAAK,IAsB5C,YAAmB,EAAQ,EAAO,EAAO,CAEvC,GADA,EAAS,GAAS,GACd,GAAW,IAAS,IAAU,GAChC,MAAO,GAAO,QAAQ,GAAa,IAErC,GAAI,CAAC,GAAU,CAAE,GAAQ,GAAa,IACpC,MAAO,GAET,GAAI,GAAa,GAAc,GAC3B,EAAQ,GAAgB,EAAY,GAAc,IAEtD,MAAO,IAAU,EAAY,GAAO,KAAK,IAwC3C,YAAkB,EAAQ,EAAS,CACjC,GAAI,GAAS,GACT,EAAW,GAEf,GAAI,GAAS,GAAU,CACrB,GAAI,GAAY,aAAe,GAAU,EAAQ,UAAY,EAC7D,EAAS,UAAY,GAAU,GAAU,EAAQ,QAAU,EAC3D,EAAW,YAAc,GAAU,GAAa,EAAQ,UAAY,EAEtE,EAAS,GAAS,GAElB,GAAI,GAAY,EAAO,OACvB,GAAI,GAAW,GAAS,CACtB,GAAI,GAAa,GAAc,GAC/B,EAAY,EAAW,OAEzB,GAAI,GAAU,EACZ,MAAO,GAET,GAAI,GAAM,EAAS,GAAW,GAC9B,GAAI,EAAM,EACR,MAAO,GAET,GAAI,GAAS,EACT,GAAU,EAAY,EAAG,GAAK,KAAK,IACnC,EAAO,MAAM,EAAG,GAEpB,GAAI,IAAc,EAChB,MAAO,GAAS,EAKlB,GAHI,GACF,IAAQ,EAAO,OAAS,GAEtB,GAAS,IACX,GAAI,EAAO,MAAM,GAAK,OAAO,GAAY,CACvC,GAAI,IACA,GAAY,EAMhB,IAJK,EAAU,QACb,GAAY,GAAO,EAAU,OAAQ,GAAS,GAAQ,KAAK,IAAc,MAE3E,EAAU,UAAY,EACd,GAAQ,EAAU,KAAK,KAC7B,GAAI,IAAS,GAAM,MAErB,EAAS,EAAO,MAAM,EAAG,KAAW,EAAY,EAAM,aAE/C,EAAO,QAAQ,GAAa,GAAY,IAAQ,EAAK,CAC9D,GAAI,IAAQ,EAAO,YAAY,GAC/B,AAAI,GAAQ,IACV,GAAS,EAAO,MAAM,EAAG,KAG7B,MAAO,GAAS,EAsBlB,YAAkB,EAAQ,CACxB,SAAS,GAAS,GACV,GAAU,GAAiB,KAAK,GACpC,EAAO,QAAQ,GAAe,IAC9B,EAuBN,GAAI,IAAY,GAAiB,SAAS,EAAQ,EAAM,EAAO,CAC7D,MAAO,GAAU,GAAQ,IAAM,IAAM,EAAK,gBAoBxC,GAAa,GAAgB,eAqBjC,YAAe,EAAQ,EAAS,EAAO,CAIrC,MAHA,GAAS,GAAS,GAClB,EAAU,EAAQ,EAAY,EAE1B,IAAY,EACP,GAAe,GAAU,GAAa,GAAU,EAAW,GAE7D,EAAO,MAAM,IAAY,GA2BlC,GAAI,IAAU,GAAS,SAAS,EAAM,EAAM,CAC1C,GAAI,CACF,MAAO,IAAM,EAAM,EAAW,SACvB,EAAP,CACA,MAAO,IAAQ,GAAK,EAAI,GAAI,IAAM,MA8BlC,GAAU,GAAS,SAAS,EAAQ,EAAa,CACnD,UAAU,EAAa,SAAS,EAAK,CACnC,EAAM,GAAM,GACZ,GAAgB,EAAQ,EAAK,GAAK,EAAO,GAAM,MAE1C,IAgCT,YAAc,EAAO,CACnB,GAAI,GAAS,GAAS,KAAO,EAAI,EAAM,OACnC,EAAa,KAEjB,SAAQ,AAAC,EAAc,GAAS,EAAO,SAAS,EAAM,CACpD,GAAI,MAAO,GAAK,IAAM,WACpB,KAAM,IAAI,IAAU,GAEtB,MAAO,CAAC,EAAW,EAAK,IAAK,EAAK,MAJlB,GAOX,GAAS,SAAS,EAAM,CAE7B,OADI,GAAQ,GACL,EAAE,EAAQ,GAAQ,CACvB,GAAI,GAAO,EAAM,GACjB,GAAI,GAAM,EAAK,GAAI,KAAM,GACvB,MAAO,IAAM,EAAK,GAAI,KAAM,MA8BpC,YAAkB,EAAQ,CACxB,MAAO,IAAa,GAAU,EAAQ,IAsBxC,YAAkB,EAAO,CACvB,MAAO,WAAW,CAChB,MAAO,IAwBX,YAAmB,EAAO,EAAc,CACtC,MAAQ,IAAS,MAAQ,IAAU,EAAS,EAAe,EAyB7D,GAAI,IAAO,KAuBP,GAAY,GAAW,IAkB3B,YAAkB,EAAO,CACvB,MAAO,GA6CT,YAAkB,EAAM,CACtB,MAAO,IAAa,MAAO,IAAQ,WAAa,EAAO,GAAU,EAAM,IAsCzE,YAAiB,EAAQ,CACvB,MAAO,IAAY,GAAU,EAAQ,IAoCvC,YAAyB,EAAM,EAAU,CACvC,MAAO,IAAoB,EAAM,GAAU,EAAU,IA2BvD,GAAI,IAAS,GAAS,SAAS,EAAM,EAAM,CACzC,MAAO,UAAS,EAAQ,CACtB,MAAO,IAAW,EAAQ,EAAM,MA2BhC,GAAW,GAAS,SAAS,EAAQ,EAAM,CAC7C,MAAO,UAAS,EAAM,CACpB,MAAO,IAAW,EAAQ,EAAM,MAwCpC,YAAe,EAAQ,EAAQ,EAAS,CACtC,GAAI,GAAQ,GAAK,GACb,EAAc,GAAc,EAAQ,GAExC,AAAI,GAAW,MACX,CAAE,IAAS,IAAY,GAAY,QAAU,CAAC,EAAM,UACtD,GAAU,EACV,EAAS,EACT,EAAS,KACT,EAAc,GAAc,EAAQ,GAAK,KAE3C,GAAI,GAAQ,CAAE,IAAS,IAAY,SAAW,KAAY,CAAC,CAAC,EAAQ,MAChE,EAAS,GAAW,GAExB,UAAU,EAAa,SAAS,EAAY,CAC1C,GAAI,GAAO,EAAO,GAClB,EAAO,GAAc,EACjB,GACF,GAAO,UAAU,GAAc,UAAW,CACxC,GAAI,IAAW,KAAK,UACpB,GAAI,GAAS,GAAU,CACrB,GAAI,IAAS,EAAO,KAAK,aACrB,GAAU,GAAO,YAAc,GAAU,KAAK,aAElD,UAAQ,KAAK,CAAE,KAAQ,EAAM,KAAQ,UAAW,QAAW,IAC3D,GAAO,UAAY,GACZ,GAET,MAAO,GAAK,MAAM,EAAQ,GAAU,CAAC,KAAK,SAAU,gBAKnD,EAgBT,aAAsB,CACpB,MAAI,IAAK,IAAM,MACb,IAAK,EAAI,IAEJ,KAeT,aAAgB,EAwBhB,YAAgB,EAAG,CACjB,SAAI,GAAU,GACP,GAAS,SAAS,EAAM,CAC7B,MAAO,IAAQ,EAAM,KAsBzB,GAAI,IAAO,GAAW,IA8BlB,GAAY,GAAW,IAiCvB,GAAW,GAAW,GAwB1B,YAAkB,EAAM,CACtB,MAAO,IAAM,GAAQ,GAAa,GAAM,IAAS,GAAiB,GAwBpE,YAAoB,EAAQ,CAC1B,MAAO,UAAS,EAAM,CACpB,MAAO,IAAU,KAAO,EAAY,GAAQ,EAAQ,IA6CxD,GAAI,IAAQ,KAsCR,GAAa,GAAY,IAoB7B,aAAqB,CACnB,MAAO,GAgBT,aAAqB,CACnB,MAAO,GAqBT,aAAsB,CACpB,MAAO,GAgBT,aAAsB,CACpB,MAAO,GAgBT,aAAoB,CAClB,MAAO,GAsBT,YAAe,EAAG,EAAU,CAE1B,GADA,EAAI,GAAU,GACV,EAAI,GAAK,EAAI,GACf,MAAO,GAET,GAAI,GAAQ,GACR,EAAS,GAAU,EAAG,IAE1B,EAAW,GAAY,GACvB,GAAK,GAGL,OADI,GAAS,GAAU,EAAQ,GACxB,EAAE,EAAQ,GACf,EAAS,GAEX,MAAO,GAoBT,YAAgB,EAAO,CACrB,MAAI,IAAQ,GACH,GAAS,EAAO,IAElB,GAAS,GAAS,CAAC,GAAS,GAAU,GAAa,GAAS,KAoBrE,YAAkB,EAAQ,CACxB,GAAI,GAAK,EAAE,GACX,MAAO,IAAS,GAAU,EAoB5B,GAAI,IAAM,GAAoB,SAAS,EAAQ,EAAQ,CACrD,MAAO,GAAS,GACf,GAuBC,GAAO,GAAY,QAiBnB,GAAS,GAAoB,SAAS,EAAU,EAAS,CAC3D,MAAO,GAAW,GACjB,GAuBC,GAAQ,GAAY,SAoBxB,YAAa,EAAO,CAClB,MAAQ,IAAS,EAAM,OACnB,GAAa,EAAO,GAAU,IAC9B,EA0BN,YAAe,EAAO,EAAU,CAC9B,MAAQ,IAAS,EAAM,OACnB,GAAa,EAAO,GAAY,EAAU,GAAI,IAC9C,EAiBN,YAAc,EAAO,CACnB,MAAO,IAAS,EAAO,IA0BzB,YAAgB,EAAO,EAAU,CAC/B,MAAO,IAAS,EAAO,GAAY,EAAU,IAqB/C,YAAa,EAAO,CAClB,MAAQ,IAAS,EAAM,OACnB,GAAa,EAAO,GAAU,IAC9B,EA0BN,YAAe,EAAO,EAAU,CAC9B,MAAQ,IAAS,EAAM,OACnB,GAAa,EAAO,GAAY,EAAU,GAAI,IAC9C,EAkBN,GAAI,IAAW,GAAoB,SAAS,EAAY,EAAc,CACpE,MAAO,GAAa,GACnB,GAuBC,GAAQ,GAAY,SAiBpB,GAAW,GAAoB,SAAS,EAAS,EAAY,CAC/D,MAAO,GAAU,GAChB,GAgBH,YAAa,EAAO,CAClB,MAAQ,IAAS,EAAM,OACnB,GAAQ,EAAO,IACf,EA0BN,YAAe,EAAO,EAAU,CAC9B,MAAQ,IAAS,EAAM,OACnB,GAAQ,EAAO,GAAY,EAAU,IACrC,EAMN,SAAO,MAAQ,GACf,EAAO,IAAM,GACb,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,aAAe,GACtB,EAAO,WAAa,GACpB,EAAO,GAAK,GACZ,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,QAAU,GACjB,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,MAAQ,GACf,EAAO,MAAQ,GACf,EAAO,QAAU,GACjB,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,QAAU,GACjB,EAAO,OAAS,GAChB,EAAO,MAAQ,GACf,EAAO,WAAa,GACpB,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,aAAe,GACtB,EAAO,MAAQ,GACf,EAAO,MAAQ,GACf,EAAO,WAAa,GACpB,EAAO,aAAe,GACtB,EAAO,eAAiB,GACxB,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,eAAiB,GACxB,EAAO,UAAY,GACnB,EAAO,KAAO,GACd,EAAO,OAAS,GAChB,EAAO,QAAU,GACjB,EAAO,YAAc,GACrB,EAAO,aAAe,GACtB,EAAO,QAAU,GACjB,EAAO,YAAc,GACrB,EAAO,aAAe,GACtB,EAAO,KAAO,GACd,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,UAAY,GACnB,EAAO,UAAY,GACnB,EAAO,YAAc,GACrB,EAAO,QAAU,GACjB,EAAO,QAAU,GACjB,EAAO,aAAe,GACtB,EAAO,eAAiB,GACxB,EAAO,iBAAmB,GAC1B,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,UAAY,GACnB,EAAO,SAAW,GAClB,EAAO,MAAQ,GACf,EAAO,KAAO,GACd,EAAO,OAAS,GAChB,EAAO,IAAM,GACb,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,QAAU,GACjB,EAAO,gBAAkB,GACzB,EAAO,QAAU,GACjB,EAAO,MAAQ,GACf,EAAO,UAAY,GACnB,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,MAAQ,GACf,EAAO,OAAS,GAChB,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,QAAU,GACjB,EAAO,KAAO,GACd,EAAO,SAAW,GAClB,EAAO,UAAY,GACnB,EAAO,SAAW,GAClB,EAAO,QAAU,GACjB,EAAO,aAAe,GACtB,EAAO,UAAY,GACnB,EAAO,KAAO,GACd,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,WAAa,GACpB,EAAO,KAAO,GACd,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,YAAc,GACrB,EAAO,OAAS,GAChB,EAAO,MAAQ,GACf,EAAO,WAAa,GACpB,EAAO,MAAQ,GACf,EAAO,OAAS,GAChB,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,QAAU,GACjB,EAAO,WAAa,GACpB,EAAO,IAAM,GACb,EAAO,QAAU,GACjB,EAAO,QAAU,GACjB,EAAO,MAAQ,GACf,EAAO,OAAS,GAChB,EAAO,WAAa,GACpB,EAAO,aAAe,GACtB,EAAO,MAAQ,GACf,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,eAAiB,GACxB,EAAO,UAAY,GACnB,EAAO,IAAM,GACb,EAAO,SAAW,GAClB,EAAO,KAAO,GACd,EAAO,QAAU,GACjB,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,OAAS,GAChB,EAAO,cAAgB,GACvB,EAAO,UAAY,GACnB,EAAO,MAAQ,GACf,EAAO,MAAQ,GACf,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,KAAO,GACd,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,MAAQ,GACf,EAAO,MAAQ,GACf,EAAO,UAAY,GACnB,EAAO,OAAS,GAChB,EAAO,WAAa,GACpB,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,QAAU,GACjB,EAAO,MAAQ,GACf,EAAO,KAAO,GACd,EAAO,IAAM,GACb,EAAO,MAAQ,GACf,EAAO,QAAU,GACjB,EAAO,IAAM,GACb,EAAO,UAAY,GACnB,EAAO,cAAgB,GACvB,EAAO,QAAU,GAGjB,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,OAAS,GAChB,EAAO,WAAa,GAGpB,GAAM,EAAQ,GAKd,EAAO,IAAM,GACb,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,WAAa,GACpB,EAAO,KAAO,GACd,EAAO,MAAQ,GACf,EAAO,MAAQ,GACf,EAAO,UAAY,GACnB,EAAO,cAAgB,GACvB,EAAO,UAAY,GACnB,EAAO,WAAa,GACpB,EAAO,OAAS,GAChB,EAAO,UAAY,GACnB,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,GAAK,GACZ,EAAO,OAAS,GAChB,EAAO,aAAe,GACtB,EAAO,MAAQ,GACf,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,QAAU,GACjB,EAAO,SAAW,GAClB,EAAO,cAAgB,GACvB,EAAO,YAAc,GACrB,EAAO,MAAQ,GACf,EAAO,QAAU,GACjB,EAAO,aAAe,GACtB,EAAO,MAAQ,GACf,EAAO,WAAa,GACpB,EAAO,OAAS,GAChB,EAAO,YAAc,GACrB,EAAO,IAAM,GACb,EAAO,GAAK,GACZ,EAAO,IAAM,GACb,EAAO,IAAM,GACb,EAAO,MAAQ,GACf,EAAO,KAAO,GACd,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,QAAU,GACjB,EAAO,QAAU,GACjB,EAAO,OAAS,GAChB,EAAO,YAAc,GACrB,EAAO,QAAU,GACjB,EAAO,cAAgB,GACvB,EAAO,YAAc,GACrB,EAAO,kBAAoB,GAC3B,EAAO,UAAY,GACnB,EAAO,SAAW,GAClB,EAAO,OAAS,GAChB,EAAO,UAAY,GACnB,EAAO,QAAU,GACjB,EAAO,QAAU,GACjB,EAAO,YAAc,GACrB,EAAO,QAAU,GACjB,EAAO,SAAW,GAClB,EAAO,WAAa,GACpB,EAAO,UAAY,GACnB,EAAO,SAAW,GAClB,EAAO,MAAQ,GACf,EAAO,QAAU,GACjB,EAAO,YAAc,GACrB,EAAO,MAAQ,GACf,EAAO,SAAW,GAClB,EAAO,MAAQ,GACf,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,aAAe,GACtB,EAAO,cAAgB,GACvB,EAAO,SAAW,GAClB,EAAO,cAAgB,GACvB,EAAO,MAAQ,GACf,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,aAAe,GACtB,EAAO,YAAc,GACrB,EAAO,UAAY,GACnB,EAAO,UAAY,GACnB,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,KAAO,GACd,EAAO,YAAc,GACrB,EAAO,UAAY,GACnB,EAAO,WAAa,GACpB,EAAO,GAAK,GACZ,EAAO,IAAM,GACb,EAAO,IAAM,GACb,EAAO,MAAQ,GACf,EAAO,KAAO,GACd,EAAO,OAAS,GAChB,EAAO,IAAM,GACb,EAAO,MAAQ,GACf,EAAO,UAAY,GACnB,EAAO,UAAY,GACnB,EAAO,WAAa,GACpB,EAAO,WAAa,GACpB,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,IAAM,GACb,EAAO,WAAa,GACpB,EAAO,KAAO,GACd,EAAO,IAAM,GACb,EAAO,IAAM,GACb,EAAO,OAAS,GAChB,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,OAAS,GAChB,EAAO,OAAS,GAChB,EAAO,YAAc,GACrB,EAAO,OAAS,GAChB,EAAO,QAAU,GACjB,EAAO,OAAS,GAChB,EAAO,MAAQ,GACf,EAAO,aAAe,EACtB,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,KAAO,GACd,EAAO,YAAc,GACrB,EAAO,cAAgB,GACvB,EAAO,cAAgB,GACvB,EAAO,gBAAkB,GACzB,EAAO,kBAAoB,GAC3B,EAAO,kBAAoB,GAC3B,EAAO,UAAY,GACnB,EAAO,WAAa,GACpB,EAAO,SAAW,GAClB,EAAO,IAAM,GACb,EAAO,MAAQ,GACf,EAAO,SAAW,GAClB,EAAO,MAAQ,GACf,EAAO,SAAW,GAClB,EAAO,UAAY,GACnB,EAAO,SAAW,GAClB,EAAO,QAAU,GACjB,EAAO,SAAW,GAClB,EAAO,cAAgB,GACvB,EAAO,SAAW,GAClB,EAAO,QAAU,GACjB,EAAO,KAAO,GACd,EAAO,QAAU,GACjB,EAAO,UAAY,GACnB,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,SAAW,GAClB,EAAO,UAAY,GACnB,EAAO,WAAa,GAGpB,EAAO,KAAO,GACd,EAAO,UAAY,GACnB,EAAO,MAAQ,GAEf,GAAM,EAAS,UAAW,CACxB,GAAI,GAAS,GACb,UAAW,EAAQ,SAAS,EAAM,EAAY,CAC5C,AAAK,GAAe,KAAK,EAAO,UAAW,IACzC,GAAO,GAAc,KAGlB,KACH,CAAE,MAAS,KAWjB,EAAO,QAAU,EAGjB,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,gBAAiB,SAAS,EAAY,CACpG,EAAO,GAAY,YAAc,IAInC,GAAU,CAAC,OAAQ,QAAS,SAAS,EAAY,EAAO,CACtD,EAAY,UAAU,GAAc,SAAS,EAAG,CAC9C,EAAI,IAAM,EAAY,EAAI,GAAU,GAAU,GAAI,GAElD,GAAI,GAAU,KAAK,cAAgB,CAAC,EAChC,GAAI,GAAY,MAChB,KAAK,QAET,MAAI,GAAO,aACT,EAAO,cAAgB,GAAU,EAAG,EAAO,eAE3C,EAAO,UAAU,KAAK,CACpB,KAAQ,GAAU,EAAG,IACrB,KAAQ,EAAc,GAAO,QAAU,EAAI,QAAU,MAGlD,GAGT,EAAY,UAAU,EAAa,SAAW,SAAS,EAAG,CACxD,MAAO,MAAK,UAAU,GAAY,GAAG,aAKzC,GAAU,CAAC,SAAU,MAAO,aAAc,SAAS,EAAY,EAAO,CACpE,GAAI,GAAO,EAAQ,EACf,EAAW,GAAQ,IAAoB,GAAQ,GAEnD,EAAY,UAAU,GAAc,SAAS,EAAU,CACrD,GAAI,GAAS,KAAK,QAClB,SAAO,cAAc,KAAK,CACxB,SAAY,GAAY,EAAU,GAClC,KAAQ,IAEV,EAAO,aAAe,EAAO,cAAgB,EACtC,KAKX,GAAU,CAAC,OAAQ,QAAS,SAAS,EAAY,EAAO,CACtD,GAAI,GAAW,OAAU,GAAQ,QAAU,IAE3C,EAAY,UAAU,GAAc,UAAW,CAC7C,MAAO,MAAK,GAAU,GAAG,QAAQ,MAKrC,GAAU,CAAC,UAAW,QAAS,SAAS,EAAY,EAAO,CACzD,GAAI,GAAW,OAAU,GAAQ,GAAK,SAEtC,EAAY,UAAU,GAAc,UAAW,CAC7C,MAAO,MAAK,aAAe,GAAI,GAAY,MAAQ,KAAK,GAAU,MAItE,EAAY,UAAU,QAAU,UAAW,CACzC,MAAO,MAAK,OAAO,KAGrB,EAAY,UAAU,KAAO,SAAS,EAAW,CAC/C,MAAO,MAAK,OAAO,GAAW,QAGhC,EAAY,UAAU,SAAW,SAAS,EAAW,CACnD,MAAO,MAAK,UAAU,KAAK,IAG7B,EAAY,UAAU,UAAY,GAAS,SAAS,EAAM,EAAM,CAC9D,MAAI,OAAO,IAAQ,WACV,GAAI,GAAY,MAElB,KAAK,IAAI,SAAS,EAAO,CAC9B,MAAO,IAAW,EAAO,EAAM,OAInC,EAAY,UAAU,OAAS,SAAS,EAAW,CACjD,MAAO,MAAK,OAAO,GAAO,GAAY,MAGxC,EAAY,UAAU,MAAQ,SAAS,EAAO,EAAK,CACjD,EAAQ,GAAU,GAElB,GAAI,GAAS,KACb,MAAI,GAAO,cAAiB,GAAQ,GAAK,EAAM,GACtC,GAAI,GAAY,GAEzB,CAAI,EAAQ,EACV,EAAS,EAAO,UAAU,CAAC,GAClB,GACT,GAAS,EAAO,KAAK,IAEnB,IAAQ,GACV,GAAM,GAAU,GAChB,EAAS,EAAM,EAAI,EAAO,UAAU,CAAC,GAAO,EAAO,KAAK,EAAM,IAEzD,IAGT,EAAY,UAAU,eAAiB,SAAS,EAAW,CACzD,MAAO,MAAK,UAAU,UAAU,GAAW,WAG7C,EAAY,UAAU,QAAU,UAAW,CACzC,MAAO,MAAK,KAAK,KAInB,GAAW,EAAY,UAAW,SAAS,EAAM,EAAY,CAC3D,GAAI,GAAgB,qCAAqC,KAAK,GAC1D,EAAU,kBAAkB,KAAK,GACjC,EAAa,EAAO,EAAW,OAAU,IAAc,OAAS,QAAU,IAAO,GACjF,EAAe,GAAW,QAAQ,KAAK,GAE3C,AAAI,CAAC,GAGL,GAAO,UAAU,GAAc,UAAW,CACxC,GAAI,GAAQ,KAAK,YACb,EAAO,EAAU,CAAC,GAAK,UACvB,EAAS,YAAiB,GAC1B,GAAW,EAAK,GAChB,GAAU,GAAU,GAAQ,GAE5B,GAAc,SAAS,GAAO,CAChC,GAAI,IAAS,EAAW,MAAM,EAAQ,GAAU,CAAC,IAAQ,IACzD,MAAQ,IAAW,GAAY,GAAO,GAAK,IAG7C,AAAI,IAAW,GAAiB,MAAO,KAAY,YAAc,GAAS,QAAU,GAElF,GAAS,GAAU,IAErB,GAAI,IAAW,KAAK,UAChB,GAAW,CAAC,CAAC,KAAK,YAAY,OAC9B,GAAc,GAAgB,CAAC,GAC/B,GAAW,GAAU,CAAC,GAE1B,GAAI,CAAC,GAAgB,GAAS,CAC5B,EAAQ,GAAW,EAAQ,GAAI,GAAY,MAC3C,GAAI,IAAS,EAAK,MAAM,EAAO,GAC/B,UAAO,YAAY,KAAK,CAAE,KAAQ,GAAM,KAAQ,CAAC,IAAc,QAAW,IACnE,GAAI,IAAc,GAAQ,IAEnC,MAAI,KAAe,GACV,EAAK,MAAM,KAAM,GAE1B,IAAS,KAAK,KAAK,IACZ,GAAe,EAAU,GAAO,QAAQ,GAAK,GAAO,QAAW,QAK1E,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,WAAY,SAAS,EAAY,CACpF,GAAI,GAAO,GAAW,GAClB,EAAY,0BAA0B,KAAK,GAAc,MAAQ,OACjE,EAAe,kBAAkB,KAAK,GAE1C,EAAO,UAAU,GAAc,UAAW,CACxC,GAAI,GAAO,UACX,GAAI,GAAgB,CAAC,KAAK,UAAW,CACnC,GAAI,GAAQ,KAAK,QACjB,MAAO,GAAK,MAAM,GAAQ,GAAS,EAAQ,GAAI,GAEjD,MAAO,MAAK,GAAW,SAAS,EAAO,CACrC,MAAO,GAAK,MAAM,GAAQ,GAAS,EAAQ,GAAI,QAMrD,GAAW,EAAY,UAAW,SAAS,EAAM,EAAY,CAC3D,GAAI,GAAa,EAAO,GACxB,GAAI,EAAY,CACd,GAAI,GAAM,EAAW,KAAO,GAC5B,AAAK,GAAe,KAAK,GAAW,IAClC,IAAU,GAAO,IAEnB,GAAU,GAAK,KAAK,CAAE,KAAQ,EAAY,KAAQ,OAItD,GAAU,GAAa,EAAW,GAAoB,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQ,IAIV,EAAY,UAAU,MAAQ,EAC9B,EAAY,UAAU,QAAU,EAChC,EAAY,UAAU,MAAQ,EAG9B,EAAO,UAAU,GAAK,GACtB,EAAO,UAAU,MAAQ,GACzB,EAAO,UAAU,OAAS,GAC1B,EAAO,UAAU,KAAO,GACxB,EAAO,UAAU,MAAQ,GACzB,EAAO,UAAU,QAAU,GAC3B,EAAO,UAAU,OAAS,EAAO,UAAU,QAAU,EAAO,UAAU,MAAQ,GAG9E,EAAO,UAAU,MAAQ,EAAO,UAAU,KAEtC,IACF,GAAO,UAAU,IAAe,IAE3B,GAML,GAAI,KAGR,AAAI,MAAO,SAAU,YAAc,MAAO,QAAO,KAAO,UAAY,OAAO,IAKzE,IAAK,EAAI,GAIT,OAAO,UAAW,CAChB,MAAO,OAIN,AAAI,GAEN,KAAW,QAAU,IAAG,EAAI,GAE7B,GAAY,EAAI,IAIhB,GAAK,EAAI,KAEX,KAAK,MCxzhBP,2BAwBA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAe,IAAQ,GAAK,aAAgB,SAAU,EAAS,EAAM,CACrE,GAAI,GAAI,CAAE,MAAO,EAAG,KAAM,UAAW,CAAE,GAAI,EAAE,GAAK,EAAG,KAAM,GAAE,GAAI,MAAO,GAAE,IAAO,KAAM,GAAI,IAAK,IAAM,EAAG,EAAG,EAAG,EAC/G,MAAO,GAAI,CAAE,KAAM,EAAK,GAAI,MAAS,EAAK,GAAI,OAAU,EAAK,IAAM,MAAO,SAAW,YAAe,GAAE,OAAO,UAAY,UAAW,CAAE,MAAO,QAAU,EACvJ,WAAc,EAAG,CAAE,MAAO,UAAU,EAAG,CAAE,MAAO,GAAK,CAAC,EAAG,KACzD,WAAc,EAAI,CACd,GAAI,EAAG,KAAM,IAAI,WAAU,mCAC3B,KAAO,GAAG,GAAI,CACV,GAAI,EAAI,EAAG,GAAM,GAAI,EAAG,GAAK,EAAI,EAAE,OAAY,EAAG,GAAK,EAAE,OAAc,IAAI,EAAE,SAAc,EAAE,KAAK,GAAI,GAAK,EAAE,OAAS,CAAE,GAAI,EAAE,KAAK,EAAG,EAAG,KAAK,KAAM,MAAO,GAE3J,OADI,EAAI,EAAG,GAAG,GAAK,CAAC,EAAG,GAAK,EAAG,EAAE,QACzB,EAAG,QACF,OAAQ,GAAG,EAAI,EAAI,UACnB,GAAG,SAAE,QAAgB,CAAE,MAAO,EAAG,GAAI,KAAM,QAC3C,GAAG,EAAE,QAAS,EAAI,EAAG,GAAI,EAAK,CAAC,GAAI,aACnC,GAAG,EAAK,EAAE,IAAI,MAAO,EAAE,KAAK,MAAO,iBAEpC,GAAM,EAAI,EAAE,KAAM,IAAI,EAAE,OAAS,GAAK,EAAE,EAAE,OAAS,KAAQ,GAAG,KAAO,GAAK,EAAG,KAAO,GAAI,CAAE,EAAI,EAAG,SACjG,GAAI,EAAG,KAAO,GAAM,EAAC,GAAM,EAAG,GAAK,EAAE,IAAM,EAAG,GAAK,EAAE,IAAM,CAAE,EAAE,MAAQ,EAAG,GAAI,MAC9E,GAAI,EAAG,KAAO,GAAK,EAAE,MAAQ,EAAE,GAAI,CAAE,EAAE,MAAQ,EAAE,GAAI,EAAI,EAAI,MAC7D,GAAI,GAAK,EAAE,MAAQ,EAAE,GAAI,CAAE,EAAE,MAAQ,EAAE,GAAI,EAAE,IAAI,KAAK,GAAK,MAC3D,AAAI,EAAE,IAAI,EAAE,IAAI,MAChB,EAAE,KAAK,MAAO,SAEtB,EAAK,EAAK,KAAK,EAAS,SACnB,EAAP,CAAY,EAAK,CAAC,EAAG,GAAI,EAAI,SAAK,CAAU,EAAI,EAAI,EACtD,GAAI,EAAG,GAAK,EAAG,KAAM,GAAG,GAAI,MAAO,CAAE,MAAO,EAAG,GAAK,EAAG,GAAK,OAAQ,KAAM,MAG9E,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAqB,GAAgB,MACrC,GAAe,KACf,GAAW,KAKX,GAAyB,UAAY,CACrC,YAAmB,CACf,KAAK,SAAW,GAEpB,cAAO,eAAe,EAAQ,UAAW,SAAU,CAI/C,IAAK,UAAY,CACb,MAAO,MAAK,SAAS,QAEzB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAQ,UAAW,UAAW,CAChD,IAAK,UAAY,CACb,MAAO,MAAK,UAEhB,IAAK,SAAU,EAAO,CAClB,KAAK,SAAW,GAEpB,WAAY,GACZ,aAAc,KAOlB,EAAQ,UAAU,IAAM,SAAU,EAAO,CACrC,MAAO,MAAK,SAAS,IAMzB,EAAQ,UAAU,IAAM,SAAU,EAAS,CAEvC,GAAI,GAAQ,GAAS,cAAc,KAAK,SAAU,EAAS,SAAU,EAAa,CAAE,MAAO,GAAY,YACvG,KAAK,SAAS,OAAO,EAAO,EAAG,IAMnC,EAAQ,UAAU,OAAS,SAAU,EAAO,CACxC,KAAK,SAAS,OAAO,EAAO,IAMhC,EAAQ,UAAU,OAAS,UAAY,CACnC,MAAO,MAAK,SAAS,SAOzB,EAAQ,UAAU,QAAU,SAAU,EAAO,CAEzC,MAAO,MAAK,SAAS,UAAU,SAAU,EAAa,CAAE,MAAO,GAAY,QAAU,KAUzF,EAAQ,UAAU,MAAQ,UAAY,CAClC,KAAK,SAAW,IAEb,KASP,GAAsB,SAAU,EAAQ,CACxC,GAAU,EAAM,GAOhB,WAAc,EAAG,EAAW,EAAU,CAClC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,GAAK,EACX,EAAM,WAAa,EACnB,EAAM,UAAY,EAClB,EAAM,QAAU,GAAmB,QAAQ,OAAO,EAAW,GAC7D,EAAM,MAAQ,GAAI,IACX,EAMX,SAAK,UAAU,IAAM,SAAU,EAAS,CACpC,KAAK,QAAQ,OAAO,GACpB,GAAI,GAAY,KAAK,QAAQ,MAAM,GACnC,GAAI,KAAK,MAAM,OAAS,KAAK,IAAM,GAAa,KAAK,MAAM,IAAI,GAAG,UAAW,CACzE,GAAI,GAAQ,KAAK,MAAM,QAAQ,GAE/B,AAAI,EAAQ,IACR,KAAK,MAAM,OAAO,GAGtB,KAAK,MAAM,IAAI,CACX,MAAO,EACP,UAAW,IAGX,KAAK,MAAM,OAAS,KAAK,IACzB,KAAK,MAAM,WAOvB,EAAK,UAAU,MAAQ,UAAY,CAC/B,KAAK,QAAU,GAAmB,QAAQ,OAAO,KAAK,WAAY,KAAK,WACvE,KAAK,MAAM,SAMf,EAAK,UAAU,OAAS,UAAY,CAEhC,OADI,GAAM,GACD,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IAAK,CAC7C,GAAI,GAAM,KAAK,MAAM,IAAI,GACzB,EAAI,KAAK,CACL,MAAO,EAAI,MACX,UAAW,EAAI,UACf,KAAM,KAAK,MAAM,OAAS,IAGlC,MAAO,IAQX,EAAK,UAAU,SAAW,UAAY,CAClC,GAAI,GAAO,KAAK,MAChB,MAAO,WAAY,CACf,GAAI,GAAG,EACP,MAAO,IAAY,KAAM,SAAU,EAAI,CACnC,OAAQ,EAAG,WACF,GACD,EAAI,EAAK,OAAS,EAClB,EAAG,MAAQ,MACV,GACD,MAAM,IAAK,EACX,GAAM,EAAK,IAAI,GACR,CAAC,EAAa,CACb,MAAO,EAAI,MACX,UAAW,EAAI,UACf,KAAM,EAAK,OAAS,KALN,CAAC,EAAa,OAOnC,GACD,EAAG,OACH,EAAG,MAAQ,MACV,GACD,WACO,CAAC,EAAa,OACpB,GAAG,MAAO,CAAC,UAKhC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAK,UAAW,KAAM,QACzB,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAK,UAAW,aAAc,QACjC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAK,UAAW,YAAa,QAChC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,GAAmB,UAC9C,EAAK,UAAW,UAAW,QAC9B,GAAW,CACP,GAAa,MAAM,SAAU,EAAM,CAAE,MAAO,GAAK,SAAY,SAAU,EAAM,CACzE,GAAI,GAAO,GAAI,IACf,SAAK,QAAU,EACR,IAEX,GAAW,cAAe,KAQ3B,EAAK,UAAW,QAAS,QAC5B,EAAO,GAAW,CACd,GAAa,eAAe,OAAQ,CAAC,UACrC,GAAQ,EAAG,GAAa,UAAU,OAAQ,GAAQ,EAAG,GAAa,UAAU,eAAgB,GAAQ,EAAG,GAAa,UAAU,cAC9H,GAAW,oBAAqB,CAAC,OAAQ,OAAQ,UAClD,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KCpTlB,2BAwBA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAU,IAAQ,GAAK,QAAW,SAAU,EAAG,EAAG,CAClD,GAAI,GAAI,MAAO,SAAW,YAAc,EAAE,OAAO,UACjD,GAAI,CAAC,EAAG,MAAO,GACf,GAAI,GAAI,EAAE,KAAK,GAAI,EAAG,EAAK,GAAI,EAC/B,GAAI,CACA,KAAQ,KAAM,QAAU,KAAM,IAAM,CAAE,GAAI,EAAE,QAAQ,MAAM,EAAG,KAAK,EAAE,aAEjE,EAAP,CAAgB,EAAI,CAAE,MAAO,UAC7B,CACI,GAAI,CACA,AAAI,GAAK,CAAC,EAAE,MAAS,GAAI,EAAE,SAAY,EAAE,KAAK,UAElD,CAAU,GAAI,EAAG,KAAM,GAAE,OAE7B,MAAO,IAEP,GAAY,IAAQ,GAAK,UAAa,UAAY,CAClD,OAAS,GAAK,GAAI,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,EAAK,EAAG,OAAO,GAAO,UAAU,KACpF,MAAO,IAEP,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAe,KACf,GAAU,KACV,GAAW,KAKX,GAAmC,SAAU,EAAQ,CACrD,GAAU,EAAmB,GAC7B,YAA6B,CACzB,MAAO,KAAW,MAAQ,EAAO,MAAM,KAAM,YAAc,KAE/D,MAAO,IACT,OAOF,YAA2B,EAAG,EAAI,CAC9B,MAAQ,GAAG,EAAI,EAAI,EAAG,GAAK,EAAG,EAWlC,GAAI,IAAyB,SAAU,EAAQ,CAC3C,GAAU,EAAS,GAMnB,WAAiB,EAAU,EAAe,CACtC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,UAAY,EAClB,EAAM,eAAiB,EACvB,EAAM,WAAa,GAAQ,cAAc,EAAM,UAAW,UACnD,EAEX,cAAO,eAAe,EAAQ,UAAW,WAAY,CAIjD,IAAK,UAAY,CACb,MAAO,MAAK,WAEhB,WAAY,GACZ,aAAc,KAMlB,EAAQ,UAAU,QAAU,UAAY,CACpC,MAAO,MAAK,WAAW,KAAO,UAMlC,EAAQ,UAAU,IAAM,SAAU,EAAO,CACrC,OAAS,GAAI,EAAG,EAAI,KAAK,UAAW,IAChC,KAAK,WAAW,GAAK,KAAK,IAAI,KAAK,WAAW,GAAI,GAAkB,EAAO,KAAK,eAAe,MAOvG,EAAQ,UAAU,SAAW,SAAU,EAAQ,CAO3C,OANI,GAAQ,KACR,EAAU,SAAU,EAAG,CACvB,GAAI,GAAsB,EAAO,IAAI,SAAU,EAAO,CAAE,MAAO,IAAkB,EAAO,EAAM,eAAe,MAC7G,EAAO,WAAW,GAAK,KAAK,IAAI,MAAM,KAAM,GAAS,CAAC,EAAO,WAAW,IAAK,KAE7E,EAAS,KACJ,EAAI,EAAG,EAAI,KAAK,UAAW,IAChC,EAAQ,IAQhB,EAAQ,UAAU,YAAc,SAAU,EAAO,CAC7C,GAAI,KAAK,WAAa,EAAM,UACxB,KAAM,IAAI,IAAkB,8EAEhC,MAAO,IAAS,aAAa,KAAK,WAAY,EAAM,YAAY,OAAS,KAAK,WAElF,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAQ,UAAW,YAAa,QACnC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAQ,UAAW,iBAAkB,QACxC,GAAW,CACP,GAAa,QACb,GAAW,cAAe,QAC3B,EAAQ,UAAW,aAAc,QACpC,EAAU,GAAW,CACjB,GAAa,eAAe,UAAW,CAAC,UACxC,GAAQ,EAAG,GAAa,UAAU,cAAe,GAAQ,EAAG,GAAa,UAAU,mBACnF,GAAW,oBAAqB,CAAC,OAAQ,SAC1C,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KC/LlB,2BAwBA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAa,KACb,GAAW,KAMf,YAAiB,EAAG,CAChB,GAAI,IAAM,GAAK,EAAI,GAAM,EACrB,MAAO,GAEX,OAAS,GAAI,EAAG,EAAI,KAAK,KAAK,GAAI,IAC9B,GAAI,EAAI,GAAM,EACV,MAAO,GAGf,MAAO,GAOX,YAAsB,EAAG,CAErB,OADI,GAAI,IACK,CACT,GAAI,GAAQ,EAAI,GACZ,MAAO,GAAI,EAEf,KASR,GAAI,IAAgC,UAAY,CAM5C,WAAwB,EAAU,EAAU,CACxC,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,eAAiB,GAGtB,OADI,GAAI,GAAa,KAAK,WACjB,EAAI,EAAG,EAAI,KAAK,UAAW,IAAK,CACrC,GAAI,GAAI,GAAS,OAAO,EAAG,KAAK,UAAW,IACvC,EAAI,GAAS,OAAO,EAAG,KAAK,UAAW,IAC3C,KAAK,eAAe,KAAK,CAAE,EAAM,EAAG,EAAG,EAAG,KAOlD,SAAe,UAAU,OAAS,UAAY,CAC1C,MAAO,IAAI,IAAW,QAAQ,KAAK,UAAW,KAAK,iBAEhD,KAEX,GAAQ,QAAU,KC1FlB,mBAuCA,YAAY,EAAO,EAAO,CACxB,MAAO,KAAU,GAAU,IAAU,GAAS,IAAU,EAG1D,GAAO,QAAU,KC3CjB,mBAUA,GAAI,IAAW,EAAI,EACf,GAAc,sBACd,GAAM,EAAI,EAGV,GAAY,kBAGZ,GAAS,aAGT,GAAa,qBAGb,GAAa,aAGb,GAAY,cAGZ,GAAe,SAanB,YAAuB,EAAO,EAAW,EAAW,EAAW,CAI7D,OAHI,GAAS,EAAM,OACf,EAAQ,EAAa,GAAY,EAAI,IAEjC,EAAY,IAAU,EAAE,EAAQ,GACtC,GAAI,EAAU,EAAM,GAAQ,EAAO,GACjC,MAAO,GAGX,MAAO,GAYT,YAAqB,EAAO,EAAO,EAAW,CAC5C,GAAI,IAAU,EACZ,MAAO,IAAc,EAAO,GAAW,GAKzC,OAHI,GAAQ,EAAY,EACpB,EAAS,EAAM,OAEZ,EAAE,EAAQ,GACf,GAAI,EAAM,KAAW,EACnB,MAAO,GAGX,MAAO,GAUT,YAAmB,EAAO,CACxB,MAAO,KAAU,EAInB,GAAI,IAAc,OAAO,UAOrB,GAAiB,GAAY,SAG7B,GAAY,KAAK,IAyBrB,YAAiB,EAAO,EAAO,EAAW,CACxC,GAAI,GAAS,EAAQ,EAAM,OAAS,EACpC,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAQ,GAAa,KAAO,EAAI,GAAU,GAC9C,MAAI,GAAQ,GACV,GAAQ,GAAU,EAAS,EAAO,IAE7B,GAAY,EAAO,EAAO,GA4BnC,YAAkB,EAAO,CACvB,GAAI,GAAO,MAAO,GAClB,MAAO,CAAC,CAAC,GAAU,IAAQ,UAAY,GAAQ,YA2BjD,YAAsB,EAAO,CAC3B,MAAO,CAAC,CAAC,GAAS,MAAO,IAAS,SAoBpC,YAAkB,EAAO,CACvB,MAAO,OAAO,IAAS,UACpB,GAAa,IAAU,GAAe,KAAK,IAAU,GA0B1D,YAAkB,EAAO,CACvB,GAAI,CAAC,EACH,MAAO,KAAU,EAAI,EAAQ,EAG/B,GADA,EAAQ,GAAS,GACb,IAAU,IAAY,IAAU,CAAC,GAAU,CAC7C,GAAI,GAAQ,EAAQ,EAAI,GAAK,EAC7B,MAAO,GAAO,GAEhB,MAAO,KAAU,EAAQ,EAAQ,EA6BnC,YAAmB,EAAO,CACxB,GAAI,GAAS,GAAS,GAClB,EAAY,EAAS,EAEzB,MAAO,KAAW,EAAU,EAAY,EAAS,EAAY,EAAU,EA0BzE,YAAkB,EAAO,CACvB,GAAI,MAAO,IAAS,SAClB,MAAO,GAET,GAAI,GAAS,GACX,MAAO,IAET,GAAI,GAAS,GAAQ,CACnB,GAAI,GAAQ,MAAO,GAAM,SAAW,WAAa,EAAM,UAAY,EACnE,EAAQ,GAAS,GAAU,EAAQ,GAAM,EAE3C,GAAI,MAAO,IAAS,SAClB,MAAO,KAAU,EAAI,EAAQ,CAAC,EAEhC,EAAQ,EAAM,QAAQ,GAAQ,IAC9B,GAAI,GAAW,GAAW,KAAK,GAC/B,MAAQ,IAAY,GAAU,KAAK,GAC/B,GAAa,EAAM,MAAM,GAAI,EAAW,EAAI,GAC3C,GAAW,KAAK,GAAS,GAAM,CAAC,EAGvC,GAAO,QAAU,KC1UjB,cAuBA,aACA,GAAI,IAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAEpD,GAAgB,IAAQ,GAAK,cAAiB,SAAU,EAAK,CAC7D,GAAI,GAAO,EAAI,WAAY,MAAO,GAClC,GAAI,GAAS,GACb,GAAI,GAAO,KAAM,OAAS,KAAK,GAAK,AAAI,OAAO,eAAe,KAAK,EAAK,IAAI,GAAO,GAAK,EAAI,IAC5F,SAAO,QAAa,EACb,GAEX,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAc,GAAgB,MAC9B,GAAmB,GAAgB,MACnC,GAAQ,GAAa,MACrB,GAAe,KACf,GAAe,KAOf,GAAwB,UAAY,CAKpC,WAAgB,EAAM,CAClB,KAAK,UAAY,GAAM,cAAc,EAAM,MAC3C,KAAK,MAAQ,EACb,KAAK,QAAU,EAEnB,EAAW,EACX,OAAO,eAAe,EAAO,UAAW,OAAQ,CAI5C,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAO,UAAW,SAAU,CAI9C,IAAK,UAAY,CACb,MAAO,MAAK,SAEhB,WAAY,GACZ,aAAc,KAMlB,EAAO,UAAU,OAAS,UAAY,CAClC,MAAO,MAAK,QAAU,KAAK,OAM/B,EAAO,UAAU,cAAgB,UAAY,CACzC,MAAO,IAAiB,QAAQ,KAAK,UAAW,OAOpD,EAAO,UAAU,GAAK,SAAU,EAAO,CACnC,MAAO,MAAK,UAAU,IAO1B,EAAO,UAAU,IAAM,SAAU,EAAS,CACtC,MAAI,KAAY,MAAQ,CAAC,KAAK,SACnB,GAEX,MAAK,IAAI,KAAK,gBAAiB,GAC/B,KAAK,UACE,KAOX,EAAO,UAAU,OAAS,SAAU,EAAS,CACzC,GAAI,GAAQ,GAAiB,QAAQ,KAAK,UAAW,GACrD,MAAI,IAAS,GACF,GAEX,MAAK,MAAM,GACJ,KAOX,EAAO,UAAU,IAAM,SAAU,EAAS,CACtC,MAAO,IAAiB,QAAQ,KAAK,UAAW,GAAW,IAO/D,EAAO,UAAU,IAAM,SAAU,EAAO,EAAS,CAC7C,KAAK,UAAU,GAAS,GAM5B,EAAO,UAAU,MAAQ,SAAU,EAAO,CACtC,KAAK,UAAU,GAAS,KACxB,KAAK,WAQT,EAAO,UAAU,WAAa,SAAU,EAAS,EAAQ,CACrD,AAAI,IAAW,QAAU,GAAS,KAAK,QACvC,GAAI,GAAQ,GAAM,UAAU,EAAG,KAAK,QAAU,EAAG,GAC7C,EAAM,KAAK,UAAU,GACzB,YAAK,UAAU,GAAS,EACjB,GAQX,EAAO,UAAU,KAAO,SAAU,EAAO,EAAS,CAC9C,GAAI,GAAM,KAAK,UAAU,GACzB,YAAK,UAAU,GAAS,EACjB,GAOX,EAAO,UAAU,OAAS,SAAU,EAAQ,CACxC,MAAK,MAAK,QAAU,EAAO,MAAU,KAAK,UAAY,EAAO,OAClD,GACJ,KAAK,UAAU,MAAM,SAAU,EAAK,EAAO,CAAE,MAAO,IAAY,QAAQ,EAAO,GAAG,GAAQ,MAErG,GAAI,GACJ,SAAS,EAAW,GAAW,CAC3B,GAAa,WAAW,CACpB,OAAQ,GAAa,YAAY,SAAU,QAAS,aACpD,OAAQ,SAAU,EAAM,CACpB,GAAK,EAAK,OAAS,UAAe,SAAW,GAAO,CAAE,cAAe,IACjE,KAAM,IAAI,OAAM,+EAEpB,GAAI,GAAS,GAAI,GAAS,EAAK,OAC/B,SAAK,UAAU,QAAQ,SAAU,EAAK,EAAG,CACrC,AAAI,IAAQ,MACR,GAAO,UAAU,GAAK,EACtB,EAAO,aAGR,KAGf,GAAW,oBAAqB,CAAC,UAClC,GACI,KAEX,GAAQ,QAAU,KCtNlB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAgB,GAAgB,MAChC,GAAW,GAAgB,MAC3B,GAAe,KACf,GAAU,KASd,YAAiC,EAAM,EAAM,CACzC,GAAI,GAAI,KAAK,KAAK,KAAK,KAAK,EAAI,GAAQ,KAAK,KAAK,EAAI,IACtD,MAAO,MAAK,KAAK,EAAI,GAWzB,GAAI,IAA8B,SAAU,EAAQ,CAChD,GAAU,EAAc,GAQxB,WAAsB,EAAM,EAAS,EAAY,EAAU,CACvD,AAAI,IAAa,QAAU,GAAW,KACtC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,QAAU,GAAQ,cAAc,EAAM,UAAY,CAAE,MAAO,IAAI,IAAS,QAAQ,KACtF,EAAM,MAAQ,EACd,EAAM,YAAc,EACpB,EAAM,mBAAqB,EAC3B,EAAM,QAAU,EAChB,EAAM,UAAY,EACX,EAEX,EAAiB,EASjB,EAAa,OAAS,SAAU,EAAM,EAAW,EAAY,EAAU,CACnE,AAAI,IAAe,QAAU,GAAa,GACtC,IAAa,QAAU,GAAW,KACtC,GAAI,GAAK,GAAwB,EAAY,GACzC,EAAW,KAAK,KAAK,EAAO,EAAa,MAE7C,MAAO,IAAI,GAAe,EAAU,EAAI,EAAY,IAUxD,EAAa,KAAO,SAAU,EAAO,EAAW,EAAY,EAAU,CAClE,AAAI,IAAe,QAAU,GAAa,GACtC,IAAa,QAAU,GAAW,KACtC,GAAI,GAAQ,MAAM,KAAK,GACnB,EAAS,EAAe,OAAO,EAAM,OAAQ,EAAW,EAAY,GACxE,SAAM,QAAQ,SAAU,EAAM,CAAE,MAAO,GAAO,IAAI,KAC3C,GAEX,OAAO,eAAe,EAAa,UAAW,OAAQ,CAIlD,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAa,UAAW,WAAY,CAItD,IAAK,UAAY,CACb,MAAO,MAAK,KAAO,KAAK,YAE5B,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAa,UAAW,SAAU,CAIpD,IAAK,UAAY,CACb,MAAO,MAAK,SAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAa,UAAW,oBAAqB,CAI/D,IAAK,UAAY,CACb,MAAO,MAAK,oBAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAa,UAAW,aAAc,CAIxD,IAAK,UAAY,CACb,MAAO,MAAK,aAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAa,UAAW,WAAY,CAItD,IAAK,UAAY,CACb,MAAO,MAAK,WAEhB,WAAY,GACZ,aAAc,KAWlB,EAAa,UAAU,IAAM,SAAU,EAAS,EAAY,EAAa,CACrE,AAAI,IAAe,QAAU,GAAa,IACtC,IAAgB,QAAU,GAAc,IAE5C,GAAI,GAAY,KAAK,WAAW,GAEhC,GAAI,KAAK,QAAQ,EAAU,YAAY,SACnC,KAAK,QAAQ,EAAU,YAAY,IAAI,EAAU,qBAE5C,KAAK,QAAQ,EAAU,aAAa,SACzC,KAAK,QAAQ,EAAU,aAAa,IAAI,EAAU,iBAEjD,CAKD,OAHI,GAAQ,KAAK,SAAW,GAAM,EAAU,WAAa,EAAU,YAC/D,EAAe,EAAU,YACzB,EAAO,GACF,EAAQ,EAAG,EAAQ,KAAK,UAAW,IAAS,CACjD,GAAI,GAAW,GAAQ,UAAU,EAAG,KAAK,QAAQ,GAAO,OAAS,EAAG,KAAK,QACrE,EAAM,KAAK,QAAQ,GAAO,GAAG,GACjC,EAAK,KAAK,CAAC,EAAO,EAAU,IAC5B,KAAK,QAAQ,GAAO,IAAI,EAAU,GAClC,EAAe,EAEf,GAAI,GAAU,GAAQ,UAAU,EAAc,KAAK,KAAM,IAGzD,GAFA,EAAQ,KAAK,IAAK,EAAQ,KAAK,IAAI,IAAa,KAAK,QAAQ,OAEzD,KAAK,QAAQ,GAAO,SACpB,YAAK,QAAQ,GAAO,IAAI,GACxB,KAAK,UACE,GAGf,GAAI,CAAC,EAED,OAAS,GAAI,EAAK,OAAS,EAAG,GAAK,EAAG,IAAK,CACvC,GAAI,GAAM,EAAK,GACf,KAAK,QAAQ,EAAI,IAAI,IAAI,EAAI,GAAI,EAAI,IAI7C,GAAI,EAEA,KAAM,IAAI,OAAM,qDAAwD,EAAU,KAGlF,MAAO,GAGf,YAAK,UACE,IAcX,EAAa,UAAU,OAAS,SAAU,EAAS,CAC/C,GAAI,GAAY,KAAK,WAAW,GAChC,MAAI,MAAK,QAAQ,EAAU,YAAY,IAAI,EAAU,aACjD,MAAK,QAAQ,EAAU,YAAY,OAAO,EAAU,aACpD,KAAK,UACE,IAEF,KAAK,QAAQ,EAAU,aAAa,IAAI,EAAU,aACvD,MAAK,QAAQ,EAAU,aAAa,OAAO,EAAU,aACrD,KAAK,UACE,IAEJ,IAaX,EAAa,UAAU,IAAM,SAAU,EAAS,CAC5C,GAAI,GAAY,KAAK,WAAW,GAChC,MAAO,MAAK,QAAQ,EAAU,YAAY,IAAI,EAAU,cAAgB,KAAK,QAAQ,EAAU,aAAa,IAAI,EAAU,cAM9H,EAAa,UAAU,KAAO,UAAY,CACtC,GAAI,GAAO,KAAK,wBACZ,EAAI,KAAK,mBAAqB,EAAK,KACvC,MAAO,MAAK,IAAI,EAAG,KAAK,KAAK,EAAI,KAAK,aAAgB,EAAK,KAAO,IAMtE,EAAa,UAAU,sBAAwB,UAAY,CACvD,GAAI,GAAM,KAAK,QAAQ,OAAS,KAAK,YACjC,EAAO,KAAK,QAAQ,OAAO,SAAU,EAAK,EAAK,CAAE,MAAO,GAAM,EAAI,QAAW,GACjF,MAAO,CACH,KAAM,EACN,KAAM,EAAM,EACZ,KAAM,EACN,KAAM,EAAO,IASrB,EAAa,UAAU,WAAa,SAAU,EAAS,CACnD,GAAI,GAAS,GAAQ,iBAAiB,EAAS,KAAK,KAAM,GAAI,IAC1D,EAAO,EAAO,IAClB,GAAI,KAAK,mBAAqB,EAAO,OAAO,OACxC,KAAM,IAAI,OAAM,2BAA6B,KAAK,mBAAqB,qCAAuC,EAAO,OAAO,OAAS,sFAEzI,GAAI,GAAc,EAAO,OAAO,UAAU,EAAG,KAAK,oBAC9C,EAAa,KAAK,IAAI,GACtB,EAAa,KAAK,IAAI,GAAQ,UAAU,EAAa,KAAK,KAAM,KAChE,EAAc,KAAK,IAAI,EAAa,GACpC,EAAM,CACN,YAAa,EACb,WAAY,EAAa,KAAK,MAC9B,YAAa,EAAc,KAAK,OAEpC,MAAO,IAOX,EAAa,UAAU,OAAS,SAAU,EAAQ,CAG9C,OAFI,GAAI,EACJ,EAAM,GACH,GAAO,EAAI,KAAK,QAAQ,QAAQ,CACnC,GAAI,GAAS,KAAK,QAAQ,GAC1B,AAAK,EAAO,QAAQ,GAAG,OAAO,IAC1B,GAAM,IAEV,IAEJ,MAAO,IAEX,GAAI,GACJ,SAAe,EAAiB,GAAW,CACvC,GAAa,WAAW,CACpB,OAAQ,GAAa,YAAY,eAAgB,QAAS,qBAAsB,UAAW,YAAa,UAAW,SACnH,OAAQ,SAAU,EAAM,CACpB,GAAK,EAAK,OAAS,gBAAmB,CAAE,UAAW,KAAS,CAAE,uBAAwB,KAAS,CAAE,YAAa,KAAS,CAAE,cAAe,KAAS,CAAE,YAAa,KAAS,CAAE,UAAW,IAClL,KAAM,IAAI,OAAM,4FAEpB,GAAI,GAAS,GAAI,GAAe,EAAK,MAAO,EAAK,mBAAoB,EAAK,YAAa,EAAK,WAC5F,SAAO,QAAU,EAAK,QACtB,EAAO,QAAU,EAAK,QAAQ,IAAI,SAAU,EAAG,CAC3C,GAAI,GAAS,GAAI,IAAS,QAAQ,EAAE,OACpC,SAAE,UAAU,QAAQ,SAAU,EAAK,EAAG,CAClC,AAAI,IAAQ,MACR,GAAO,UAAU,GAAK,EACtB,EAAO,aAGR,IAEX,EAAO,KAAO,EAAK,KACZ,KAGf,GAAW,oBAAqB,CAAC,OAAQ,OAAQ,OAAQ,UAC1D,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KC7XlB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAW,KACX,GAAU,KACV,GAAe,KACf,GAAgB,GAAgB,MAChC,GAAU,OAAO,IAAI,8BAOrB,GAAsB,SAAU,EAAQ,CACxC,GAAU,EAAM,GAQhB,WAAc,EAAO,EAAS,EAAO,CACjC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,SAAM,OAAS,EACf,EAAM,SAAW,EACjB,EAAM,OAAS,EACR,EAEX,EAAS,EAKT,EAAK,MAAQ,UAAY,CACrB,MAAO,IAAI,GAAO,GAAS,OAAO,YAAY,GAAG,KAAK,GAAI,GAAS,OAAO,YAAY,GAAG,KAAK,GAAI,IAEtG,EAAK,UAAU,IAAW,UAAY,CAClC,MAAO,SAAW,KAAK,UAAU,KAAK,OAAO,SAAS,MAAQ,KAAO,KAAK,UAAU,KAAK,SAAS,SAAS,MAAQ,KAAO,KAAK,OAAS,KAE5I,OAAO,eAAe,EAAK,UAAW,QAAS,CAI3C,IAAK,UAAY,CACb,MAAO,MAAK,QAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAK,UAAW,UAAW,CAI7C,IAAK,UAAY,CACb,MAAO,MAAK,UAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAK,UAAW,QAAS,CAI3C,IAAK,UAAY,CACb,MAAO,MAAK,QAEhB,WAAY,GACZ,aAAc,KAOlB,EAAK,UAAU,IAAM,SAAU,EAAO,EAAS,CAC3C,KAAK,OAAS,GAAQ,UAAU,KAAK,OAAQ,GAC7C,KAAK,SAAW,GAAQ,UAAU,KAAK,SAAU,GACjD,KAAK,UAST,EAAK,UAAU,KAAO,SAAU,EAAM,CAClC,MAAO,IAAI,GAAO,GAAQ,UAAU,KAAK,OAAQ,EAAK,OAAQ,GAAQ,UAAU,KAAK,SAAU,EAAK,SAAU,KAAK,OAAS,EAAK,QAMrI,EAAK,UAAU,QAAU,UAAY,CACjC,MAAO,MAAK,OAAO,OAAO,GAAS,OAAO,KAAK,MAAQ,KAAK,SAAS,OAAO,GAAS,OAAO,KAAK,MAAQ,KAAK,SAAW,GAO7H,EAAK,UAAU,OAAS,SAAU,EAAM,CACpC,MAAO,MAAK,SAAW,EAAK,OAAS,KAAK,OAAO,OAAO,EAAK,QAAU,KAAK,SAAS,OAAO,EAAK,UAOrG,EAAK,UAAU,OAAS,UAAY,CAEhC,GAAI,KAAK,WAAc,KAAK,SAAW,GAAK,KAAK,SAAW,GACxD,MAAO,GAGX,GAAI,GAAS,GAAQ,kBAAkB,KAAK,UAAU,KAAK,OAAO,UAAW,KAAK,MAClF,MAAO,MAAK,SAAS,OAAO,GAAS,OAAO,KAAK,EAAO,SAE5D,GAAI,GACJ,UAAW,CACP,GAAa,MAAM,SAAU,EAAK,CAAE,MAAO,GAAI,YAAe,GAAS,OAAO,MAC9E,GAAW,cAAe,SAC3B,EAAK,UAAW,SAAU,QAC7B,GAAW,CACP,GAAa,MAAM,SAAU,EAAK,CAAE,MAAO,GAAI,YAAe,GAAS,OAAO,MAC9E,GAAW,cAAe,SAC3B,EAAK,UAAW,WAAY,QAC/B,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAK,UAAW,SAAU,QAC7B,EAAO,EAAS,GAAW,CACvB,GAAa,eAAe,OAAQ,CAAC,UACrC,GAAQ,EAAG,GAAa,UAAU,WAAY,GAAQ,EAAG,GAAa,UAAU,aAAc,GAAQ,EAAG,GAAa,UAAU,WAChI,GAAW,oBAAqB,CAAC,OAAQ,OAAQ,UAClD,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KC9LlB,cAuBA,aACA,GAAI,IAAa,IAAQ,GAAK,WAAe,UAAY,CACrD,GAAI,GAAgB,SAAU,EAAG,EAAG,CAChC,SAAgB,OAAO,gBAClB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,EAAE,eAAe,IAAI,GAAE,GAAK,EAAE,KAClE,EAAc,EAAG,IAE5B,MAAO,UAAU,EAAG,EAAG,CACnB,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,QAGnF,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAY,EAAQ,EAAK,EAAM,CACnF,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAE5D,GAAc,IAAQ,GAAK,YAAe,SAAU,EAAG,EAAG,CAC1D,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAG,IAEtG,GAAW,IAAQ,GAAK,SAAY,SAAU,EAAY,EAAW,CACrE,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAEvD,GAAe,IAAQ,GAAK,aAAgB,SAAU,EAAS,EAAM,CACrE,GAAI,GAAI,CAAE,MAAO,EAAG,KAAM,UAAW,CAAE,GAAI,EAAE,GAAK,EAAG,KAAM,GAAE,GAAI,MAAO,GAAE,IAAO,KAAM,GAAI,IAAK,IAAM,EAAG,EAAG,EAAG,EAC/G,MAAO,GAAI,CAAE,KAAM,EAAK,GAAI,MAAS,EAAK,GAAI,OAAU,EAAK,IAAM,MAAO,SAAW,YAAe,GAAE,OAAO,UAAY,UAAW,CAAE,MAAO,QAAU,EACvJ,WAAc,EAAG,CAAE,MAAO,UAAU,EAAG,CAAE,MAAO,GAAK,CAAC,EAAG,KACzD,WAAc,EAAI,CACd,GAAI,EAAG,KAAM,IAAI,WAAU,mCAC3B,KAAO,GAAG,GAAI,CACV,GAAI,EAAI,EAAG,GAAM,GAAI,EAAG,GAAK,EAAI,EAAE,OAAY,EAAG,GAAK,EAAE,OAAc,IAAI,EAAE,SAAc,EAAE,KAAK,GAAI,GAAK,EAAE,OAAS,CAAE,GAAI,EAAE,KAAK,EAAG,EAAG,KAAK,KAAM,MAAO,GAE3J,OADI,EAAI,EAAG,GAAG,GAAK,CAAC,EAAG,GAAK,EAAG,EAAE,QACzB,EAAG,QACF,OAAQ,GAAG,EAAI,EAAI,UACnB,GAAG,SAAE,QAAgB,CAAE,MAAO,EAAG,GAAI,KAAM,QAC3C,GAAG,EAAE,QAAS,EAAI,EAAG,GAAI,EAAK,CAAC,GAAI,aACnC,GAAG,EAAK,EAAE,IAAI,MAAO,EAAE,KAAK,MAAO,iBAEpC,GAAM,EAAI,EAAE,KAAM,IAAI,EAAE,OAAS,GAAK,EAAE,EAAE,OAAS,KAAQ,GAAG,KAAO,GAAK,EAAG,KAAO,GAAI,CAAE,EAAI,EAAG,SACjG,GAAI,EAAG,KAAO,GAAM,EAAC,GAAM,EAAG,GAAK,EAAE,IAAM,EAAG,GAAK,EAAE,IAAM,CAAE,EAAE,MAAQ,EAAG,GAAI,MAC9E,GAAI,EAAG,KAAO,GAAK,EAAE,MAAQ,EAAE,GAAI,CAAE,EAAE,MAAQ,EAAE,GAAI,EAAI,EAAI,MAC7D,GAAI,GAAK,EAAE,MAAQ,EAAE,GAAI,CAAE,EAAE,MAAQ,EAAE,GAAI,EAAE,IAAI,KAAK,GAAK,MAC3D,AAAI,EAAE,IAAI,EAAE,IAAI,MAChB,EAAE,KAAK,MAAO,SAEtB,EAAK,EAAK,KAAK,EAAS,SACnB,EAAP,CAAY,EAAK,CAAC,EAAG,GAAI,EAAI,SAAK,CAAU,EAAI,EAAI,EACtD,GAAI,EAAG,GAAK,EAAG,KAAM,GAAG,GAAI,MAAO,CAAE,MAAO,EAAG,GAAK,EAAG,GAAK,OAAQ,KAAM,MAG9E,GAAmB,IAAQ,GAAK,iBAAoB,SAAU,EAAK,CACnE,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAExD,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAW,KACX,GAAgB,GAAgB,MAChC,GAAS,GAAgB,MACzB,GAAe,KACf,GAAU,KACV,GAAa,KASb,GAAuC,SAAU,EAAQ,CACzD,GAAU,EAAuB,GAMjC,WAA+B,EAAM,EAAW,CAC5C,AAAI,IAAc,QAAU,GAAY,GACxC,GAAI,GAAQ,EAAO,KAAK,OAAS,KACjC,GAAI,GAAS,SAAW,OACpB,KAAM,IAAI,OAAM,kLAEpB,GAAI,GAAa,EACb,KAAM,IAAI,OAAM,sDAEpB,SAAM,MAAQ,EACd,EAAM,WAAa,EAEnB,EAAM,UAAY,GAAQ,cAAc,EAAM,MAAO,UAAY,CAAE,MAAO,IAAO,QAAQ,UAClF,EAEX,EAA0B,EAO1B,EAAsB,OAAS,SAAU,EAAS,EAAW,CACzD,GAAI,GAAO,GAAW,kBAAkB,EAAS,GAC7C,EAAW,GAAW,cAAc,EAAM,GAC9C,MAAO,IAAI,GAAwB,EAAM,IAQ7C,EAAsB,KAAO,SAAU,EAAO,EAAW,CACrD,GAAI,GAAQ,MAAM,KAAK,GACnB,EAAS,EAAwB,OAAO,EAAM,OAAQ,GAC1D,SAAM,QAAQ,SAAU,EAAM,CAAE,MAAO,GAAO,IAAI,KAC3C,GAEX,OAAO,eAAe,EAAsB,UAAW,YAAa,CAKhE,IAAK,UAAY,CACb,MAAO,MAAK,YAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAsB,UAAW,OAAQ,CAI3D,IAAK,UAAY,CACb,MAAO,MAAK,OAEhB,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAsB,UAAW,SAAU,CAK7D,IAAK,UAAY,CACb,MAAO,MAAK,UAAU,OAAO,SAAU,EAAG,EAAG,CAAE,MAAO,GAAI,EAAE,OAAU,GAAK,KAAK,YAEpF,WAAY,GACZ,aAAc,KAElB,OAAO,eAAe,EAAsB,UAAW,WAAY,CAI/D,IAAK,UAAY,CACb,MAAO,MAAK,WAEhB,WAAY,GACZ,aAAc,KAMlB,EAAsB,UAAU,IAAM,SAAU,EAAS,CAGrD,OAFI,GAAS,GAAQ,kBAAkB,KAAK,UAAU,EAAQ,UAAW,KAAK,MAC1E,EAAU,GAAQ,mBAAmB,EAAO,OAAO,MAAO,KAAK,MAAO,KAAK,WAAY,KAAK,MACvF,EAAI,EAAG,EAAI,KAAK,WAAY,EAAE,EACnC,KAAK,UAAU,EAAQ,IAAI,IAAI,EAAS,GAAS,OAAO,KAAK,EAAO,OAAO,SAQnF,EAAsB,UAAU,OAAS,SAAU,EAAS,CAGxD,OAFI,GAAS,GAAQ,kBAAkB,KAAK,UAAU,EAAQ,UAAW,KAAK,MAC1E,EAAU,GAAQ,mBAAmB,EAAO,OAAO,MAAO,KAAK,KAAM,KAAK,WAAY,KAAK,MACtF,EAAI,EAAG,EAAI,KAAK,WAAY,EAAE,EACnC,KAAK,UAAU,EAAQ,IAAM,KAAK,UAAU,EAAQ,IAAI,KAAK,GAAI,IAAO,QAAQ,GAAS,OAAO,KAAK,GAAU,GAAS,OAAO,KAAK,EAAO,OAAO,OAAQ,IAE9J,MAAO,IAOX,EAAsB,UAAU,IAAM,SAAU,EAAS,CAGrD,OAFI,GAAS,GAAQ,kBAAkB,KAAK,UAAU,EAAQ,UAAW,KAAK,MAC1E,EAAU,GAAQ,mBAAmB,EAAO,OAAO,MAAO,KAAK,KAAM,KAAK,WAAY,KAAK,MACtF,EAAI,EAAG,EAAI,KAAK,WAAY,EAAE,EAAG,CACtC,GAAI,KAAK,UAAU,EAAQ,IAAI,QAAU,EACrC,MAAO,GAEN,GAAI,KAAK,UAAU,EAAQ,IAAI,QAAU,EAC1C,MAAI,OAAK,UAAU,EAAQ,IAAI,MAAM,OAAO,GAQpD,MAAO,IAQX,EAAsB,UAAU,YAAc,UAAY,CACtD,GAAI,GAAO,KACP,EAAa,GACjB,MAAO,WAAY,CACf,GAAI,GAAS,EAAO,EACpB,MAAO,IAAY,KAAM,SAAU,EAAI,CACnC,OAAQ,EAAG,WACF,GACD,EAAU,SAAU,EAAO,CACvB,GAAI,GACJ,MAAO,IAAY,KAAM,SAAU,EAAI,CACnC,OAAQ,EAAG,WACF,GAED,MADA,GAAY,EAAK,UAAU,GACvB,AAAE,EAAU,MAAQ,GAAK,EAAW,UAAU,SAAU,EAAG,CAAE,MAAO,GAAE,OAAO,EAAU,WAAe,GACrG,EAAK,IAAI,EAAU,OACxB,GAAW,KAAK,EAAU,OACnB,CAAC,EAAa,EAAU,QAFQ,CAAC,EAAa,GADiE,CAAC,EAAa,OAInI,GACD,SAAG,OACI,CAAC,EAAa,OACpB,GAAG,MAAO,CAAC,EAAc,CAAE,MAAO,SAClC,GAAG,MAAO,CAAC,OAI5B,EAAQ,EACR,EAAG,MAAQ,MACV,GACD,MAAM,GAAQ,EAAK,UAAU,OAAS,EAC/B,CAAC,EAAc,EAAQ,IADmB,CAAC,EAAa,OAE9D,GAED,GADA,EAAU,EAAG,OACT,MAAO,IAAY,SACnB,MAAO,CAAC,EAAc,EAAQ,OAClC,EAAG,MAAQ,MACV,GACD,WACO,CAAC,EAAa,OACpB,GAAG,MAAO,CAAC,EAAc,WAU9C,EAAsB,UAAU,UAAY,SAAU,EAAM,CACxD,GAAI,KAAK,OAAS,EAAK,KACnB,KAAM,IAAI,OAAM,6DAEpB,GAAI,GAAM,GAAI,GAAwB,EAAK,MAAO,EAAK,YACvD,EAAI,KAAO,KAAK,KAChB,OAAS,GAAI,EAAG,EAAI,KAAK,KAAM,EAAE,EAC7B,EAAI,UAAU,GAAK,KAAK,UAAU,GAAG,KAAK,EAAK,UAAU,IAE7D,MAAO,IAOX,EAAsB,UAAU,OAAS,SAAU,EAAM,CACrD,GAAI,EAAK,QAAU,KAAK,OAAS,EAAK,aAAe,KAAK,YAAc,EAAK,OAAS,KAAK,KACvF,MAAO,GAGP,OAAS,GAAI,EAAG,EAAI,EAAK,UAAU,OAAQ,EAAE,EACzC,GAAI,CAAC,EAAK,UAAU,GAAG,OAAO,KAAK,UAAU,IACzC,MAAO,GAGf,MAAO,IAOf,EAAsB,UAAU,OAAS,SAAU,EAAY,EAAS,CACpE,AAAI,IAAe,QAAU,GAAa,IACtC,IAAY,QAAU,GAAU,IAIpC,OAHI,GAAW,GACX,EAAO,KAEF,EAAI,EAAG,EAAI,KAAK,UAAU,OAAQ,EAAE,EACzC,EAAO,KAAK,UAAU,GAClB,EAAK,UACL,EAAS,KAAK,GAGtB,KAAO,EAAS,SAAW,GAAG,CAC1B,EAAO,KAAK,UAAU,EAAS,OAC/B,GAAI,GAAK,EAAK,MACV,EAAI,EAAK,MACb,GAAI,EAAK,SAAU,CACf,GAAI,IAAM,EACN,EAAW,KAAK,WAEX,IAAM,GACX,EAAQ,KAAK,OAGb,MAAM,IAAI,OAAM,+BAIpB,OAFI,GAAS,GAAQ,kBAAkB,KAAK,UAAU,EAAG,UAAW,KAAK,MACrE,EAAU,GAAQ,mBAAmB,EAAO,OAAO,MAAO,KAAK,MAAO,KAAK,WAAY,KAAK,MACvF,EAAI,EAAG,EAAI,EAAQ,OAAQ,EAAE,EAClC,KAAK,UAAU,EAAQ,IAAM,KAAK,UAAU,EAAQ,IAAI,KAAK,GAAI,IAAO,QAAQ,EAAI,GAAS,OAAO,KAAK,EAAO,OAAO,OAAQ,IAC3H,KAAK,UAAU,EAAQ,IAAI,UAC3B,EAAS,KAAK,EAAQ,KAKtC,MAAI,MAAK,UAAU,UAAU,SAAU,EAAG,CAAE,MAAO,CAAC,EAAE,YAAgB,GAC3D,CACH,QAAS,GACT,OAAQ,CACJ,KAAM,EACN,KAAM,MAEV,WAAY,EACZ,QAAS,GAIN,CACH,QAAS,GACT,WAAY,EACZ,QAAS,IAIrB,GAAI,GACJ,UAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAsB,UAAW,QAAS,QAC7C,GAAW,CACP,GAAa,QACb,GAAW,cAAe,SAC3B,EAAsB,UAAW,aAAc,QAClD,GAAW,CACP,GAAa,MAAM,OAAW,SAAU,EAAM,CAC1C,MAAO,GAAK,IAAI,SAAU,EAAK,CAC3B,GAAI,GAAI,GAAI,IAAO,QAAQ,GAAS,OAAO,KAAK,EAAI,QAAS,GAAS,OAAO,KAAK,EAAI,UAAW,EAAI,QACrG,SAAE,KAAO,EAAI,MACN,MAGf,GAAW,cAAe,QAC3B,EAAsB,UAAW,YAAa,QACjD,EAAwB,EAA0B,GAAW,CACzD,GAAa,eAAe,wBAAyB,CAAC,UACtD,GAAQ,EAAG,GAAa,UAAU,UAAW,GAAQ,EAAG,GAAa,UAAU,eAC/E,GAAW,oBAAqB,CAAC,OAAQ,UAC1C,GACI,GACT,GAAc,SAChB,GAAQ,QAAU,KC9YlB,cAuBA,aACA,OAAO,eAAe,GAAS,aAAc,CAAE,MAAO,KACtD,GAAI,IAAiB,KACrB,GAAQ,YAAc,GAAe,QACrC,GAAI,IAA0B,KAC9B,GAAQ,oBAAsB,GAAwB,QACtD,GAAI,IAA6B,KACjC,GAAQ,uBAAyB,GAA2B,QAC5D,GAAI,IAAqB,KACzB,GAAQ,eAAiB,GAAmB,QAC5C,GAAI,IAAgB,KACpB,GAAQ,YAAc,GAAc,QACpC,GAAI,IAAS,KACb,GAAQ,KAAO,GAAO,QACtB,GAAI,IAAa,KACjB,GAAQ,QAAU,GAAW,QAC7B,GAAI,IAAqB,KACzB,GAAQ,eAAiB,GAAmB,QAC5C,GAAI,IAAkB,KACtB,GAAQ,aAAe,GAAgB,QACvC,GAAI,IAAmC,KACvC,GAAQ,sBAAwB,GAAiC,QACjE,GAAI,IAAS,KACb,GAAQ,KAAO,GAAO,UC9CtB,qaAAwB,SCAxB,sdCAA,8BCAA,+HCGO,YAAkB,EAAoC,CAC3D,MAAO,IAAI,SAAQ,CAAC,EAAS,IAAW,CACrC,OAAU,KAAW,GAClB,EAAQ,KAAK,EAAS,KDI9B,kBAAsC,EAAwC,CAC5E,MAAO,IAAK,CACV,GAAa,GACb,GAAiB,KAUrB,kBAAmC,EAAwC,CACzE,MAAO,IAAa,mCAAmC,cASlD,YAA0B,EAAuC,CACtE,MAAO,IAAa,6CAA6C,cAa5D,YAAsB,EAAqC,CAChE,MAAO,OAAM,EAAK,CAChB,QAAS,CACP,OAAU,0BAGb,KAAK,GAAK,EAAE,QACZ,KAAK,GAAK,CACT,GAAI,EAAE,OAAQ,CAEZ,GAAM,GAAyB,EAAE,OAAO,IAAI,AAAC,GACnC,GAAE,MAAQ,IAAI,QAAQ,WAAY,KAK5C,MAAI,GAAQ,GAAG,KAAO,IACb,EACJ,KAAK,CAAC,EAAG,IAAM,EAAE,MAAM,EAAG,GAAG,cAAc,EAAE,MAAM,EAAG,KACtD,IAAI,GAAK,EAAE,MAAM,IACjB,KAAK,IAGD,EAAQ,KAAK,QAKtB,OAAO,QAYb,kBAAoC,EAAwC,CAC1E,GAAM,GAAM,KAAM,IAChB,EAAO,WAAW,aACd,EACA,YAAY,KAGlB,MAAO,IAAO,CAAC,EAAI,SAAS,UACxB,EAAI,QAAQ,YAAa,IAAI,QAAQ,YAAa,IAClD,KEtFC,GAAM,IAAQ,CACnB,MAAO,GAEP,UAAW,CACT,IAAK,yBACL,MAAO,6BACP,KAAM,iBHZV,GAAM,IAIF,CACF,IAAK,KACL,KAAM,KACN,YAAa,GAQf,mBAA6C,CAC3C,GAAM,GAAO,GAAM,UAAU,IAAI,QAAQ,eAAgB,IAAI,QAAQ,MAAO,IACtE,EAAM,KAAK,MAWjB,GARE,IAAS,OAAS,GAClB,GAAS,YAAc,IAAO,GAAK,GAAK,GAAK,IAE7C,IAAS,IAAM,KAAM,AAAI,IAAgB,QAAU,GACnD,GAAS,KAAO,EAChB,GAAS,YAAc,GAGrB,CAAC,GAAS,IAAK,KAAM,IAAI,OAAM,oCACnC,MAAO,IAAS,IIjClB,gCAAO,GAAM,IAAQ,CAAC,EAAmB,IAA+B,CACtE,GAAM,GAAI,GAAI,YAAW,GACnB,EAAI,GAAI,YAAW,GACzB,GAAI,EAAE,SAAW,EAAE,OAAQ,MAAO,GAClC,OAAS,GAAI,EAAG,EAAI,EAAE,OAAQ,IAC5B,GAAI,EAAE,KAAO,EAAE,GAAI,MAAO,GAE5B,MAAO,ICPT,gIAAuB,SAEhB,YAAgB,EAAwB,CAC7C,MAAO,WAAO,KAAK,EAAQ,UAAU,SAAS,UAGzC,YAAgB,EAAqB,CAC1C,MAAO,WAAO,KAAK,EAAK,UAAU,SAAS,UAGtC,YAAmB,EAAwB,CAChD,MAAO,IAAO,GAAc,IAGvB,YAAmB,EAAqB,CAC7C,MAAO,IAAY,GAAO,IAGrB,YAAqB,EAAmB,CAC7C,MAAO,GAAE,QAAQ,MAAO,KAAK,QAAQ,MAAO,KAAK,QAAQ,MAAO,IAG3D,YAAuB,EAAmB,CAC/C,MAAO,GAAE,QAAQ,KAAM,KAAK,QAAQ,KAAM,KCvB5C,0CAAuB,SAEV,GAAW,KAAO,IACtB,GAAI,SAAQ,CAAC,EAAS,IAAW,CACtC,GAAM,GAAqB,IAAM,EAAO,GAAI,OAAM,wBAC5C,EAAS,GAAI,YACnB,EAAO,iBAAiB,OAAQ,AAAC,GAAM,CACrC,GAAM,GAAS,GAAG,QAAQ,QAAU,KACpC,AAAI,IAAW,MACb,IAEF,EAAQ,UAAO,KAAK,MAEtB,EAAO,iBAAiB,QAAS,IAAM,EAAO,SAC9C,EAAO,iBAAiB,QAAS,GACjC,EAAO,kBAAkB,KCf7B,OAAyB,SACzB,GAA0B,SAC1B,GAAkB,SAClB,GAAgB,SAChB,GAAwC,SCJjC,GAAM,IAAY,MAAO,OAAS,aAAe,MAAO,MAAK,UAAa,SAEpE,GAAgB,AAAC,GAAyB,CACrD,GAAI,CAAC,GACH,KAAM,IAAI,OAAM,kFAAkF,MCJtG,2EAAqB,SAErB,GAA6B,SAEvB,GAAe,CAAE,KAAM,gBAAa,KAGtC,GAAyB,KAGhB,GAAQ,SAA2B,CAC9C,GAAK,KAAM,MACX,KAAM,IAAG,UACT,GAAK,MAGM,GAAS,SACZ,KAAM,YAAS,KAAK,IAGjB,GAAM,KAAO,IAA6C,CACrE,GAAK,GAGM,GAAM,SACb,IACJ,IAAM,KAAM,YAAS,KAAK,IACnB,IFjBF,GAAM,IAAU,MAAO,EAAkB,IAAwC,CACtF,GAAc,eACd,GAAM,GAAM,KAAM,YAAI,UAAU,EAAQ,CAAE,OAAQ,iBAAc,OAC1D,EAAY,KAAM,YAAI,aAAa,EAAK,OAAQ,GACtD,MAAO,IAAI,YAAW,IAGX,GAAU,MAAO,EAAuB,IAAwC,CAC3F,GAAc,eACd,GAAM,GAAM,KAAM,YAAI,UAAU,EAAQ,CAAE,OAAQ,iBAAc,OAC1D,EAAe,KAAM,YAAI,aAAa,EAAU,OAAQ,GAC9D,MAAO,IAAI,YAAW,IAGX,GAAY,SAA6B,CACpD,GAAc,iBACd,GAAM,GAAM,KAAM,YAAI,QAAQ,CAAE,OAAQ,iBAAc,OACtD,MAAO,YAAI,UAAU,IAGV,GAAa,MAAO,EAAmB,EAAgB,IAAmC,CACrG,GAAc,kBACd,GAAM,GAAK,WAAM,eAAe,GAC1B,EAAa,KAAM,QAAO,OAAO,UACrC,MACA,WAAM,eAAe,GACrB,UACA,GACA,CAAE,UAAW,YAIT,EAAY,KAAM,QAAO,OAAO,QACpC,CACE,KAAM,UACN,GAAI,GAEN,EACA,WAAM,eAAe,IAEvB,MAAO,YAAM,YAAY,EAAW,YAAS,KAGlC,GAAS,KAAO,IAA2C,CACtE,GAAc,eACd,GAAM,GAAM,EAAM,OACZ,EAAO,KAAM,QAAO,OAAO,OAAO,UAAW,GACnD,MAAO,IAAI,YAAW,IAGX,GAAY,CAAC,EAAqB,EAAuB,IAA4C,CAChH,GAAc,cACd,GAAM,GAAS,WAAM,eAAe,EAAU,QAC9C,MAAO,YAAc,OAAO,EAAS,EAAW,IAGrC,GAAgB,CAAC,EAAqB,EAAuB,IACjE,AAAQ,UAAO,EAAW,EAAS,GAG/B,GAAkB,SAC7B,IAAc,0BAEP,AADI,MAAM,AAAS,OAChB,iBAGC,GAAmB,SAC9B,IAAc,2BAEP,AADI,MAAM,AAAS,OAChB,kBAGC,GAAY,KAAO,IAC9B,IAAc,oBAEP,AADI,MAAM,AAAS,OAChB,QAAQ,IAGP,GAAS,MAAO,EAAiB,IAC5C,IAAc,iBAEP,AADI,MAAM,AAAS,OAChB,KAAK,EAAS,CAAE,cAGf,GAAkB,MAAO,EAAa,IACjD,IAAc,0BAEP,AADI,MAAM,AAAS,OAChB,cAAc,EAAK,IAGlB,GAAkB,KAAO,IACpC,IAAc,0BAEP,AADI,MAAM,AAAS,OAChB,cAAc,IAGb,GAAc,KAAO,IAChC,IAAc,sBAEP,AADI,MAAM,AAAS,OAChB,UAAU,IAGT,GAAW,SACtB,IAAc,mBAEP,AADI,MAAM,AAAS,OAChB,IAAI,MAGH,GAAU,SACrB,IAAc,kBACP,AAAS,MGxHlB,OAAwB,SAGjB,GAAM,IAAU,AAAI,GACzB,IAAc,mBACP,WAAY,QAAQ,IAGhB,GAAU,CAAI,EAAa,IACtC,IAAc,mBACP,WAAY,QAAQ,EAAK,IAGrB,GAAa,AAAC,GACzB,IAAc,sBACP,WAAY,WAAW,IAGnB,GAAQ,IACnB,IAAc,iBACP,WAAY,SCjBd,GAAM,IAAuC,CAClD,KAAM,CACJ,OAAsB,IAExB,IAAK,CACH,QAAuB,GACvB,QAAuB,GACvB,UAAyB,GACzB,WAA0B,IAE5B,IAAK,CACH,OAAsB,IAExB,QAAS,CACP,OAAsB,IAExB,SAAU,CACR,cAA6B,GAC7B,eAA8B,GAC9B,QAAuB,GACvB,KAAoB,GACpB,cAA6B,GAC7B,cAA6B,GAC7B,UAAyB,GACzB,OAAsB,GACtB,MAAqB,IAEvB,QAAS,CACP,QAAwB,GACxB,QAAwB,GACxB,WAA2B,GAC3B,MAAsB,KAIf,GAAqB,GAEnB,GAAkB,AAAC,GAC9B,IAAO,CACL,KAAM,GAAM,GAAK,KAAM,EAAI,MAC3B,IAAK,GAAM,GAAK,IAAK,EAAI,KACzB,IAAK,GAAM,GAAK,IAAK,EAAI,KACzB,QAAS,GAAM,GAAK,QAAS,EAAI,SACjC,SAAU,GAAM,GAAK,SAAU,EAAI,UACnC,QAAS,GAAM,GAAK,QAAS,EAAI,UAE5B,IAGH,GAAQ,CAAI,EAAU,IACnB,KACF,KACC,GAAU,KCpDX,GAAM,IAAU,AAAI,GACzB,GAAK,QAAQ,QAAQ,GAEV,GAAU,CAAI,EAAa,IACtC,GAAK,QAAQ,QAAQ,EAAK,GAEf,GAAa,AAAC,GACzB,GAAK,QAAQ,WAAW,GCVnB,GAAM,IAAY,AAAI,GACpB,IAAQ,OAGJ,GAAU,AAAI,GAClB,IAAQ,KAGJ,GAAS,GAET,GAAU,AAAI,GAClB,GAAU,IAAQ,GAAQ,GAGtB,GAAS,AAAC,GACd,MAAO,IAAQ,UAGX,GAAQ,AAAC,GACb,MAAO,IAAQ,SAGX,GAAW,AAAC,GAChB,MAAO,IAAQ,SAGX,GAAW,AAAI,GACnB,IAAQ,MAAQ,MAAO,IAAQ,SAG3B,GAAS,AAAC,GACjB,MAAO,OAAS,YAAoB,GACjC,YAAe,OAAS,GAAS,IAAQ,GAAK,aAAa,OAAS,OC9BtE,GAAM,IAAmB,CAC5B,EACA,IACuB,CACzB,GAAM,EAAG,GAAM,KAAS,GAAS,EACjC,MAAO,IAGI,GAA2B,CACpC,EACA,EACA,IAEF,IAAQ,KACJ,GAAiB,EAAK,GACtB,IACG,GACF,GAAM,GAIA,GAAS,CAClB,EACA,IACwB,CAC1B,GAAM,GAAS,GACf,cAAO,QAAQ,GAAK,QAAQ,CAAC,CAAC,EAAK,KAAW,CAC5C,EAAO,GAAO,EAAG,EAAO,KAEnB,GAGI,GAAc,MACvB,EACA,IACgC,CAClC,GAAM,GAAS,GACf,YAAM,SAAQ,IACZ,OAAO,QAAQ,GAAK,IAAI,MAAO,CAAC,EAAK,KAAW,CAC9C,EAAO,GAAO,KAAM,GAAG,EAAO,MAG3B,GAGI,GAAc,CAAI,EAAU,IAChC,EAAI,QAAQ,GAAO,GAGf,GAAiB,MAAU,EAAQ,IAAuD,CACrG,GAAI,GAAM,EACV,OAAQ,GAAE,EAAG,EAAE,EAAW,OAAQ,IAChC,EAAM,KAAM,GAAW,GAAG,GAE5B,MAAO,ICxDF,GAAM,IAAU,ShBahB,GAAM,IAAoB,uBACpB,GAAuB,0BAMpC,mBAAsE,CACpE,MAAO,AAAQ,IAAQ,IAAsB,KAAK,AAAC,GAAe,GAAkB,MiBrBtF,4GAA4B,SCArB,GAAM,IAAY,AAAC,GACjB,MAAM,UAAU,IAAI,KACzB,EACA,GAAM,MAAO,EAAE,SAAS,KAAK,MAAM,KACnC,KAAK,IAGI,GAAU,AAAC,GAA4B,CAClD,GAAM,GAAM,GAAI,YAAW,EAAI,OAAO,GACtC,OAAQ,GAAE,EAAG,EAAI,EAAI,OAAQ,IAC3B,EAAI,GAAK,SAAS,EAAI,MAAM,EAAE,EAAG,EAAE,EAAI,GAAI,IAE7C,MAAO,IDRF,GAAM,IAAY,KAAM,IAAiC,CAC9D,GAAM,GAAM,mBAAY,EAAK,GACvB,EAAM,GAAI,YAAW,GACrB,EAAO,KAAM,IAAK,KAAK,OAAO,GACpC,MAAO,AAAI,IAAU,IAGV,GAAO,CAClB,OAAQ,AAAC,GACP,GAAK,KAAK,OAAO,GACnB,UAAW,IAEA,GAAM,CACjB,QAAS,CAAC,EAAmB,IAC3B,GAAK,IAAI,QAAQ,EAAO,GAC1B,QAAS,CAAC,EAAmB,IAC3B,GAAK,IAAI,QAAQ,EAAO,GAC1B,UAAW,IACT,GAAK,IAAI,YACX,WAAY,CAAC,EAAmB,EAAgB,IAC9C,GAAK,IAAI,WAAW,EAAW,EAAQ,IAG9B,GAAM,CACjB,OAAQ,CAAC,EAAqB,EAAuB,IACnD,GAAK,IAAI,OAAO,EAAS,EAAW,IAE3B,GAAU,CACrB,OAAQ,CAAC,EAAqB,EAAuB,IACnD,GAAK,QAAQ,OAAO,EAAS,EAAW,IAG/B,GAAW,CACtB,cAAe,IACb,GAAK,SAAS,gBAChB,eAAgB,IACd,GAAK,SAAS,iBAChB,QAAS,AAAC,GACR,GAAK,SAAS,QAAQ,GACxB,KAAM,CAAC,EAAiB,IACtB,GAAK,SAAS,KAAK,EAAS,GAC9B,cAAe,CAAC,EAAa,IAC3B,GAAK,SAAS,cAAc,EAAK,GACnC,cAAe,AAAC,GACd,GAAK,SAAS,cAAc,GAC9B,UAAW,AAAC,GACV,GAAK,SAAS,UAAU,GAC1B,OAAQ,IACN,GAAK,SAAS,SAChB,MAAO,IACL,GAAK,SAAS,SEtDlB,qUAGO,GAAK,IAAL,UAAK,EAAL,CACL,SAAS,SACT,SAAS,IACT,UAAU,UACV,aAAa,aACb,UAAU,YALA,aAQL,GAAK,IAAL,UAAK,EAAL,CACL,YAAY,YACZ,OAAO,SAFG,aAuBL,eAAsB,EAA2B,CACtD,GAAI,EAAK,KAAK,GAAK,EAAE,SAAS,MAC5B,KAAM,IAAI,OAAM,uCAElB,MAAO,CAAE,UAAW,GAMf,eAAiB,EAAsB,CAC5C,GAAI,EAAK,KAAK,GAAK,EAAE,SAAS,MAC5B,KAAM,IAAI,OAAM,uCAElB,MAAO,CAAE,KAAM,GAMV,aAA+B,CACpC,MAAO,CAAE,UAAW,IAgBf,YAAmB,EAA+B,CACvD,GAAM,GAAQ,EAAK,QAAQ,OAAQ,IAAI,MAAM,KAC7C,MAAI,GAAK,SAAS,KAAa,CAAE,UAAW,EAAM,MAAM,EAAG,KAClD,IAAS,GAAW,KACtB,CAAE,KAAM,GASV,YACL,EACA,CAAE,YAAoC,CAAE,SAAU,IAC1C,CACR,GAAM,GAAS,EAAW,IAAM,GAC1B,EAAa,GAAO,GAAM,KAAK,KACrC,MAAI,IAAY,GAAc,EAAS,EAAc,GAAW,OAAS,IAAM,IACxE,EAAS,EAWX,YAAiB,EAAkB,EAAqC,CAC7E,MAAO,IAAI,GAAK,GAAO,GAAG,OAAO,GAAI,GAMhC,YAAkB,EAAgB,EAAgC,CACvE,MAAO,IAAO,GAAM,KAAO,EAMtB,YAAqB,EAA8C,CACxE,MAAO,CAAC,CAAE,EAAuB,UAM5B,YAAgB,EAAyC,CAC9D,MAAO,CAAC,CAAE,EAAkB,KAMvB,YAAyB,EAA8B,CAC5D,MAAO,GAAK,UAAU,SAAW,EAM5B,YAAsB,EAAoB,EAA6B,CAC5E,MAAO,IAAO,GAAG,KAAO,GAAO,GAAG,GAM7B,YAAoB,EAAoB,EAA6B,CAC1E,MAAI,IAAY,IAAM,GAAY,GAAW,GACpC,MAAO,IAAM,GAAO,IAOxB,YAAc,EAA6B,CAChD,MAAI,IAAY,GAAc,GAAK,UAC5B,GAAK,KAMP,YAAa,EAAuB,EAAwC,CACjF,MAAI,IAAY,GAAc,CAAE,UAAW,EAAG,EAAK,YAC1C,GAAO,GAAc,CAAE,KAAM,EAAG,EAAK,OACvC,EAMF,YAAgB,EAA6C,CAClE,MAAO,IAAY,IAAS,GAAgB,GACxC,KACA,GAAU,GAAG,GAAO,GAAM,MAAM,EAAG,KAMlC,YAAsB,EAAwC,CACnE,MAAO,IACL,GAAK,GAAY,IAAS,EAAE,OAAS,EAAI,EAAE,MAAM,GAAK,EACtD,GAOG,YAAgB,EAA6B,CAClD,MAAI,IAAY,GACP,EAAK,UACH,GAAO,GACT,EAAK,KAGP,GAWF,YAAa,EAAoB,CACtC,MAAO,KAAK,EAAK,KAAK,UC1MxB,kBAAqC,CAAE,QAAoD,CAEzF,MAAO,yBADM,KAAM,AAAO,IAAK,UAAU,GAAa,MAIxD,kBAA8B,CAAE,QAAoD,CAElF,MAAO,kBADM,KAAM,AAAO,IAAK,UAAU,GAAa,MAWxD,YAAsB,EAAuB,CAC3C,MAAO,IAAM,AAAQ,GAAO,GAAM,KAAK,KCxBzC,oOCAA,OAAkC,SAKlC,GAAI,IAAoB,KAGX,GAAM,AAAC,GAA4B,CAC9C,GAAO,GAGI,GAAM,SAA2B,CAC5C,GAAI,CAAC,GAAM,CACT,GAAM,GAAO,KAAM,MACnB,GAAO,WAAsB,KAAK,GAEpC,MAAO,KAGF,aAAwC,CAC7C,MAAO,IAAI,SAAQ,CAAC,EAAS,IAAW,CACtC,GAAM,GAAS,SAAS,cAAc,UACtC,EAAO,GAAK,iBACZ,EAAO,MAAM,MAAQ,IACrB,EAAO,MAAM,OAAS,IACtB,EAAO,MAAM,OAAS,OACtB,EAAO,MAAM,QAAU,OACvB,SAAS,KAAK,YAAY,GAE1B,EAAO,OAAS,IAAM,CACpB,GAAM,GAAU,GAAI,gBACpB,EAAQ,MAAM,UAAY,CAAC,CAAE,WAAY,EAAQ,EAAM,IACvD,EAAO,cACH,EAAO,cAAc,YAAY,UAAW,IAAK,CAAE,EAAQ,QAC3D,EAAO,GAAI,OAAM,+CAGvB,EAAO,IAAM,GAAG,GAAM,UAAU,oBCtCpC,OAAuB,SACvB,GAAmB,SACnB,GAAwC,SCFxC,OAAwC,SAUlC,GAAe,AAAC,GACb,GAAI,YAAM,QAAQ,EAAI,KAAM,EAAI,MAAO,EAAI,MAGvC,GAAe,AAAC,GAA4B,CACvD,GAAM,GAAO,GAAK,OAAO,KACnB,EAAQ,GAAK,OAAO,OAAO,IAAI,IACrC,MAAO,IAAI,YAAM,QAAQ,EAAM,ICjBjC,OAAuB,SAGV,GAAgB,UAAO,KAAK,CAAC,EAAG,IFStC,GAAM,IAAM,KAAO,IAAiD,CAEzE,GAAM,GAAS,KAAM,AADR,MAAM,OACO,IAAI,EAAS,CAAE,WAAY,EAAG,IAAK,KAE7D,MAAO,CACL,IAAK,EAAO,IAAI,WAChB,KAAM,EAAO,KACb,OAAQ,KAIC,GAAS,KAAO,IAAoC,CAC/D,GAAM,GAAO,KAAM,MACb,EAAS,GACf,KAAM,IAAW,GACjB,aAAiB,KAAS,GAAK,IAAI,GACjC,EAAO,KAAK,GAEd,MAAO,IAGI,GAAS,KAAO,IAAkC,CAC7D,GAAM,GAAM,KAAM,IAAO,GACzB,MAAO,WAAO,OAAO,IAGV,GAAM,KAAO,IAEjB,AADK,MAAM,IAAO,IACd,WAGA,GAAK,KAAO,IAAmC,CAC1D,GAAM,GAAO,KAAM,MACb,EAAQ,GACd,aAAiB,KAAQ,GAAK,GAAG,GAC/B,EAAM,KAAK,GAEb,MAAO,IAGI,GAAS,KAAO,IAA+B,CAC1D,GAAM,GAAO,KAAM,MACnB,KAAM,IAAW,GACjB,GAAM,GAAM,KAAM,GAAK,IAAI,IAAI,GAAI,YAAO,IAE1C,MADa,AAAK,IAAa,IAIpB,GAAS,KAAO,IAAsC,CAKjE,GAAM,GAAM,AADG,MAAM,AAHR,MAAM,OAGO,IAAI,IAAI,EAAM,CAAE,OAAQ,SAAU,QAAS,cAClD,OAAO,WAC1B,KAAM,IAAW,GACjB,GAAM,GAAW,KAAM,IAAK,GAC5B,MAAO,CACL,MACA,KAAM,EACN,OAAQ,KAIC,GAAc,KAAO,IAAyC,CACzE,GAAM,GAAO,GAAI,YAAM,QAAQ,GAAe,GAC9C,MAAO,IAAO,IAGH,GAAO,KAAO,IAGlB,AADM,MAAM,AADN,MAAM,OACK,MAAM,KAAK,SAAS,MAChC,eAGD,GAAa,KAAO,IAA4B,CAC3D,GAAM,GAAO,KAAM,MACnB,GAAI,CACF,KAAM,GAAK,IAAI,IAAI,EAAK,CAAE,UAAW,WAC9B,EAAP,CACA,GAAI,CAAC,EAAI,SAAW,CAAC,EAAI,QAAQ,SAAS,8BACxC,KAAM,IAAI,OAAM,KG5FtB,kDCAA,wECAA,GAAM,IAAU,CACd,SACA,SACA,SACA,UAEI,GAAkB,CACtB,WACA,YACA,iBACA,oBACA,yBACA,gBACA,aACA,QACA,SACA,SACA,SACA,OACA,QACA,MACA,MACA,UACA,UACA,cACA,oBACA,WACA,UACA,MACA,cACA,YACA,aACA,oBACA,aACA,cACA,aACA,cACA,eACA,eACA,gBACA,kBAEK,YAAY,EAAO,CACxB,GAAI,IAAU,KACZ,MAAO,OAET,GAAI,IAAU,OACZ,MAAO,YAET,GAAI,IAAU,IAAQ,IAAU,GAC9B,MAAO,UAET,GAAM,GAAS,MAAO,GACtB,GAAI,GAAQ,SAAS,GACnB,MAAO,GAET,GAAI,IAAW,WACb,MAAO,WAET,GAAI,MAAM,QAAQ,GAChB,MAAO,QAET,GAAI,GAAS,GACX,MAAO,SAET,GAAM,GAAa,GAAc,GACjC,MAAI,IAGG,SAET,YAAkB,EAAO,CACvB,MAAO,IAAS,EAAM,aAAe,EAAM,YAAY,UAAY,EAAM,YAAY,SAAS,KAAK,KAAM,GAE3G,YAAuB,EAAO,CAC5B,GAAM,GAAiB,OAAO,UAAU,SAAS,KAAK,GAAO,MAAM,EAAG,IACtE,GAAI,GAAgB,SAAS,GAC3B,MAAO,GC7EX,YAAW,CACT,YAAY,EAAO,EAAM,EAAU,CACjC,KAAK,MAAQ,EACb,KAAK,aAAe,GAAS,EAC7B,KAAK,KAAO,EACZ,KAAK,SAAW,EAElB,UAAW,CACT,MAAO,QAAS,KAAK,UAAY,KAAK,OAExC,QAAQ,EAAK,CACX,MAAO,MAAK,MAAQ,EAAI,MAAQ,GAAK,KAAK,MAAQ,EAAI,MAAQ,EAAI,IAGtE,GAAK,KAAO,GAAI,IAAK,EAAG,OAAQ,IAChC,GAAK,OAAS,GAAI,IAAK,EAAG,SAAU,IACpC,GAAK,MAAQ,GAAI,IAAK,EAAG,QAAS,IAClC,GAAK,OAAS,GAAI,IAAK,EAAG,SAAU,IACpC,GAAK,MAAQ,GAAI,IAAK,EAAG,QAAS,IAClC,GAAK,IAAM,GAAI,IAAK,EAAG,MAAO,IAC9B,GAAK,IAAM,GAAI,IAAK,EAAG,MAAO,IAC9B,GAAK,MAAQ,GAAI,IAAK,EAAG,QAAS,IAClC,GAAK,MAAQ,GAAI,IAAK,EAAG,QAAS,IAClC,GAAK,KAAO,GAAI,IAAK,EAAG,OAAQ,IAChC,GAAK,KAAO,GAAI,IAAK,EAAG,OAAQ,IAChC,GAAK,UAAY,GAAI,IAAK,EAAG,YAAa,IAC1C,GAAK,MAAQ,GAAI,IAAK,EAAG,QAAS,IAClC,YAAY,CACV,YAAY,EAAM,EAAO,EAAe,CACtC,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,cAAgB,EACrB,KAAK,aAAe,OAEtB,UAAW,CACT,MAAO,SAAU,KAAK,SAAW,KAAK,UCnCnC,GAAM,IAAY,WAAW,SAAW,CAAC,WAAW,QAAQ,SAAW,WAAW,QAAU,MAAO,YAAW,OAAO,UAAa,WACnI,GAAc,GAAI,aAClB,GAAc,GAAI,aACxB,YAAkB,EAAK,CACrB,MAAO,KAAa,WAAW,OAAO,SAAS,GAE1C,YAAe,EAAK,CACzB,MAAM,aAAe,YAGd,GAAS,GAAO,GAAI,YAAW,EAAI,OAAQ,EAAI,WAAY,EAAI,YAAc,EAF3E,WAAW,KAAK,GAIpB,GAAM,IAAW,GAAY,CAAC,EAAO,EAAO,IAC1C,EAAM,EAAQ,GAAK,WAAW,OAAO,KAAK,EAAM,SAAS,EAAO,IAAM,SAAS,QAAU,GAAU,EAAO,EAAO,GACtH,CAAC,EAAO,EAAO,IACV,EAAM,EAAQ,GAAK,GAAY,OAAO,EAAM,SAAS,EAAO,IAAQ,GAAU,EAAO,EAAO,GAExF,GAAa,GAAY,GAC7B,EAAO,OAAS,GAAK,WAAW,OAAO,KAAK,GAAU,GAAY,GACvE,GACK,EAAO,OAAS,GAAK,GAAY,OAAO,GAAU,GAAY,GAE1D,GAAY,GAChB,WAAW,KAAK,GAEZ,GAAQ,GAAY,CAAC,EAAO,EAAO,IAC1C,GAAS,GACJ,GAAI,YAAW,EAAM,SAAS,EAAO,IAEvC,EAAM,MAAM,EAAO,GACxB,CAAC,EAAO,EAAO,IACV,EAAM,MAAM,EAAO,GAEf,GAAS,GAAY,CAAC,EAAQ,IACzC,GAAS,EAAO,IAAI,GAAK,YAAa,YAAa,EAAI,WAAW,OAAO,KAAK,IACvE,GAAM,WAAW,OAAO,OAAO,EAAQ,KAC5C,CAAC,EAAQ,IAAW,CACtB,GAAM,GAAM,GAAI,YAAW,GACvB,EAAM,EACV,OAAS,KAAK,GACZ,AAAI,EAAM,EAAE,OAAS,EAAI,QACvB,GAAI,EAAE,SAAS,EAAG,EAAI,OAAS,IAEjC,EAAI,IAAI,EAAG,GACX,GAAO,EAAE,OAEX,MAAO,IAEI,GAAQ,GAAY,GACxB,WAAW,OAAO,YAAY,GACnC,GACK,GAAI,YAAW,GAuCjB,YAAiB,EAAI,EAAI,CAC9B,GAAI,GAAS,IAAO,GAAS,GAC3B,MAAO,GAAG,QAAQ,GAEpB,OAAS,GAAI,EAAG,EAAI,EAAG,OAAQ,IAC7B,GAAI,EAAG,KAAO,EAAG,GAGjB,MAAO,GAAG,GAAK,EAAG,GAAK,GAAK,EAE9B,MAAO,GAET,YAAqB,EAAQ,EAAQ,SAAU,CAC7C,GAAI,GACE,EAAS,EAAO,OAClB,EAAgB,KACd,EAAQ,GACd,OAAS,GAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAE/B,GADA,EAAY,EAAO,WAAW,GAC1B,EAAY,OAAS,EAAY,MAAO,CAC1C,GAAI,CAAC,EAAe,CAClB,GAAI,EAAY,MAAO,CACrB,AAAK,IAAS,GAAK,IACjB,EAAM,KAAK,IAAK,IAAK,KACvB,iBACS,EAAI,IAAM,EAAQ,CAC3B,AAAK,IAAS,GAAK,IACjB,EAAM,KAAK,IAAK,IAAK,KACvB,SAEF,EAAgB,EAChB,SAEF,GAAI,EAAY,MAAO,CACrB,AAAK,IAAS,GAAK,IACjB,EAAM,KAAK,IAAK,IAAK,KACvB,EAAgB,EAChB,SAEF,EAAa,GAAgB,OAAS,GAAK,EAAY,OAAS,UAC3D,AAAI,IACJ,IAAS,GAAK,IACjB,EAAM,KAAK,IAAK,IAAK,KAGzB,GADA,EAAgB,KACZ,EAAY,IAAK,CACnB,GAAK,IAAS,GAAK,EACjB,MACF,EAAM,KAAK,WACF,EAAY,KAAM,CAC3B,GAAK,IAAS,GAAK,EACjB,MACF,EAAM,KAAK,GAAa,EAAI,IAAK,EAAY,GAAK,aACzC,EAAY,MAAO,CAC5B,GAAK,IAAS,GAAK,EACjB,MACF,EAAM,KAAK,GAAa,GAAK,IAAK,GAAa,EAAI,GAAK,IAAK,EAAY,GAAK,aACrE,EAAY,QAAS,CAC9B,GAAK,IAAS,GAAK,EACjB,MACF,EAAM,KAAK,GAAa,GAAK,IAAK,GAAa,GAAK,GAAK,IAAK,GAAa,EAAI,GAAK,IAAK,EAAY,GAAK,SAE1G,MAAM,IAAI,OAAM,sBAGpB,MAAO,GAET,YAAmB,EAAK,EAAQ,EAAK,CACnC,GAAM,GAAM,GACZ,KAAO,EAAS,GAAK,CACnB,GAAM,GAAY,EAAI,GAClB,EAAY,KACZ,EAAmB,EAAY,IAAM,EAAI,EAAY,IAAM,EAAI,EAAY,IAAM,EAAI,EACzF,GAAI,EAAS,GAAoB,EAAK,CACpC,GAAI,GAAY,EAAW,EAAY,EACvC,OAAQ,OACH,GACH,AAAI,EAAY,KACd,GAAY,GAEd,UACG,GACH,EAAa,EAAI,EAAS,GACrB,GAAa,MAAS,KACzB,GAAiB,GAAY,KAAO,EAAI,EAAa,GACjD,EAAgB,KAClB,GAAY,IAGhB,UACG,GACH,EAAa,EAAI,EAAS,GAC1B,EAAY,EAAI,EAAS,GACpB,GAAa,MAAS,KAAQ,GAAY,MAAS,KACtD,GAAiB,GAAY,KAAO,GAAM,GAAa,KAAO,EAAI,EAAY,GAC1E,EAAgB,MAAS,GAAgB,OAAS,EAAgB,QACpE,GAAY,IAGhB,UACG,GACH,EAAa,EAAI,EAAS,GAC1B,EAAY,EAAI,EAAS,GACzB,EAAa,EAAI,EAAS,GACrB,GAAa,MAAS,KAAQ,GAAY,MAAS,KAAQ,GAAa,MAAS,KACpF,GAAiB,GAAY,KAAO,GAAM,GAAa,KAAO,GAAM,GAAY,KAAO,EAAI,EAAa,GACpG,EAAgB,OAAS,EAAgB,SAC3C,GAAY,KAKpB,AAAI,IAAc,KAChB,GAAY,MACZ,EAAmB,GACV,EAAY,OACrB,IAAa,MACb,EAAI,KAAK,IAAc,GAAK,KAAO,OACnC,EAAY,MAAQ,EAAY,MAElC,EAAI,KAAK,GACT,GAAU,EAEZ,MAAO,IAAsB,GAE/B,GAAM,IAAuB,KACtB,YAA+B,EAAY,CAChD,GAAM,GAAM,EAAW,OACvB,GAAI,GAAO,GACT,MAAO,QAAO,aAAa,MAAM,OAAQ,GAE3C,GAAI,GAAM,GACN,EAAI,EACR,KAAO,EAAI,GACT,GAAO,OAAO,aAAa,MAAM,OAAQ,EAAW,MAAM,EAAG,GAAK,KAEpE,MAAO,GC7NT,GAAM,IAAmB,IAClB,QAAS,CACd,YAAY,EAAY,GAAkB,CACxC,KAAK,UAAY,EACjB,KAAK,OAAS,EACd,KAAK,UAAY,GACjB,KAAK,OAAS,GACd,KAAK,gBAAkB,KAEzB,OAAQ,CACN,KAAK,OAAS,GACd,KAAK,OAAS,EACd,KAAK,UAAY,GACb,KAAK,kBAAoB,MAC3B,MAAK,OAAO,KAAK,KAAK,iBACtB,KAAK,UAAY,KAAK,gBAAgB,OAAS,GAGnD,KAAK,EAAO,CACV,GAAI,GAAW,KAAK,OAAO,KAAK,OAAO,OAAS,GAEhD,GAAI,AADW,KAAK,OAAS,EAAM,QACrB,KAAK,UAAY,EAAG,CAChC,GAAM,GAAW,EAAS,OAAU,MAAK,UAAY,KAAK,QAAU,EACpE,EAAS,IAAI,EAAO,OACf,CACL,GAAI,EAAU,CACZ,GAAM,GAAW,EAAS,OAAU,MAAK,UAAY,KAAK,QAAU,EACpE,AAAI,EAAW,EAAS,QACtB,MAAK,OAAO,KAAK,OAAO,OAAS,GAAK,EAAS,SAAS,EAAG,GAC3D,KAAK,UAAY,KAAK,OAAS,GAGnC,AAAI,EAAM,OAAS,IAAM,EAAM,OAAS,KAAK,UAC3C,GAAW,GAAM,KAAK,WACtB,KAAK,OAAO,KAAK,GACjB,KAAK,WAAa,EAAS,OACvB,KAAK,kBAAoB,MAC3B,MAAK,gBAAkB,GAEzB,EAAS,IAAI,EAAO,IAEpB,MAAK,OAAO,KAAK,GACjB,KAAK,WAAa,EAAM,QAG5B,KAAK,QAAU,EAAM,OAEvB,QAAQ,EAAQ,GAAO,CACrB,GAAI,GACJ,GAAI,KAAK,OAAO,SAAW,EAAG,CAC5B,GAAM,GAAQ,KAAK,OAAO,GAC1B,AAAI,GAAS,KAAK,OAAS,EAAM,OAAS,EACxC,GAAO,KAAK,SAAW,EAAM,OAAS,EAAQ,EAAM,SAAS,EAAG,KAAK,QACrE,KAAK,gBAAkB,KACvB,KAAK,OAAS,IAEd,EAAO,GAAM,EAAO,EAAG,KAAK,YAG9B,GAAO,GAAO,KAAK,OAAQ,KAAK,QAElC,MAAI,IACF,KAAK,QAEA,ICrEX,GAAM,IAAkB,qBAClB,GAAkB,qBAClB,GAAuB,GAC7B,GAAqB,IAAM,EAC3B,GAAqB,IAAM,EAC3B,GAAqB,IAAM,EAC3B,GAAqB,IAAM,EAC3B,GAAqB,IAAM,EAC3B,YAA0B,EAAM,EAAK,EAAM,CACzC,GAAI,EAAK,OAAS,EAAM,EACtB,KAAM,IAAI,OAAM,GAAI,+BCFjB,GAAM,IAAiB,CAC5B,GACA,IACA,MACA,WACA,OAAO,yBAEF,YAAmB,EAAM,EAAQ,EAAS,CAC/C,GAAiB,EAAM,EAAQ,GAC/B,GAAM,GAAQ,EAAK,GACnB,GAAI,EAAQ,SAAW,IAAQ,EAAQ,GAAe,GACpD,KAAM,IAAI,OAAM,GAAI,mEAEtB,MAAO,GAEF,YAAoB,EAAM,EAAQ,EAAS,CAChD,GAAiB,EAAM,EAAQ,GAC/B,GAAM,GAAQ,EAAK,IAAW,EAAI,EAAK,EAAS,GAChD,GAAI,EAAQ,SAAW,IAAQ,EAAQ,GAAe,GACpD,KAAM,IAAI,OAAM,GAAI,mEAEtB,MAAO,GAEF,YAAoB,EAAM,EAAQ,EAAS,CAChD,GAAiB,EAAM,EAAQ,GAC/B,GAAM,GAAQ,EAAK,GAAU,SAAY,GAAK,EAAS,IAAM,IAAO,GAAK,EAAS,IAAM,GAAK,EAAK,EAAS,GAC3G,GAAI,EAAQ,SAAW,IAAQ,EAAQ,GAAe,GACpD,KAAM,IAAI,OAAM,GAAI,mEAEtB,MAAO,GAEF,YAAoB,EAAM,EAAQ,EAAS,CAChD,GAAiB,EAAM,EAAQ,GAC/B,GAAM,GAAK,EAAK,GAAU,SAAY,GAAK,EAAS,IAAM,IAAO,GAAK,EAAS,IAAM,GAAK,EAAK,EAAS,GAClG,EAAK,EAAK,EAAS,GAAK,SAAY,GAAK,EAAS,IAAM,IAAO,GAAK,EAAS,IAAM,GAAK,EAAK,EAAS,GACtG,EAAS,QAAO,IAAO,OAAO,KAAO,OAAO,GAClD,GAAI,EAAQ,SAAW,IAAQ,EAAQ,GAAe,GACpD,KAAM,IAAI,OAAM,GAAI,mEAEtB,GAAI,GAAS,OAAO,iBAClB,MAAO,QAAO,GAEhB,GAAI,EAAQ,cAAgB,GAC1B,MAAO,GAET,KAAM,IAAI,OAAM,GAAI,mEAEf,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,MAAO,IAAI,IAAM,GAAK,KAAM,GAAU,EAAM,EAAM,EAAG,GAAU,GAE1D,YAAsB,EAAM,EAAK,EAAQ,EAAS,CACvD,MAAO,IAAI,IAAM,GAAK,KAAM,GAAW,EAAM,EAAM,EAAG,GAAU,GAE3D,YAAsB,EAAM,EAAK,EAAQ,EAAS,CACvD,MAAO,IAAI,IAAM,GAAK,KAAM,GAAW,EAAM,EAAM,EAAG,GAAU,GAE3D,YAAsB,EAAM,EAAK,EAAQ,EAAS,CACvD,MAAO,IAAI,IAAM,GAAK,KAAM,GAAW,EAAM,EAAM,EAAG,GAAU,GAE3D,YAAoB,EAAK,EAAO,CACrC,MAAO,IAAgB,EAAK,EAAG,EAAM,OAEhC,YAAyB,EAAK,EAAO,EAAM,CAChD,GAAI,EAAO,GAAe,GAAI,CAC5B,GAAM,GAAQ,OAAO,GACrB,EAAI,KAAK,CAAC,EAAQ,YACT,EAAO,GAAe,GAAI,CACnC,GAAM,GAAQ,OAAO,GACrB,EAAI,KAAK,CACP,EAAQ,GACR,YAEO,EAAO,GAAe,GAAI,CACnC,GAAM,GAAQ,OAAO,GACrB,EAAI,KAAK,CACP,EAAQ,GACR,IAAU,EACV,EAAQ,cAED,EAAO,GAAe,GAAI,CACnC,GAAM,GAAQ,OAAO,GACrB,EAAI,KAAK,CACP,EAAQ,GACR,IAAU,GAAK,IACf,IAAU,GAAK,IACf,IAAU,EAAI,IACd,EAAQ,UAEL,CACL,GAAM,GAAQ,OAAO,GACrB,GAAI,EAAQ,GAAe,GAAI,CAC7B,GAAM,GAAM,CACV,EAAQ,GACR,EACA,EACA,EACA,EACA,EACA,EACA,GAEE,EAAK,OAAO,EAAQ,OAAO,aAC3B,EAAK,OAAO,GAAS,OAAO,IAAM,OAAO,aAC7C,EAAI,GAAK,EAAK,IACd,EAAK,GAAM,EACX,EAAI,GAAK,EAAK,IACd,EAAK,GAAM,EACX,EAAI,GAAK,EAAK,IACd,EAAK,GAAM,EACX,EAAI,GAAK,EAAK,IACd,EAAI,GAAK,EAAK,IACd,EAAK,GAAM,EACX,EAAI,GAAK,EAAK,IACd,EAAK,GAAM,EACX,EAAI,GAAK,EAAK,IACd,EAAK,GAAM,EACX,EAAI,GAAK,EAAK,IACd,EAAI,KAAK,OAET,MAAM,IAAI,OAAM,GAAI,sDAI1B,GAAW,YAAc,SAAqB,EAAO,CACnD,MAAO,IAAgB,YAAY,EAAM,QAE3C,GAAgB,YAAc,SAAqB,EAAM,CACvD,MAAI,GAAO,GAAe,GACjB,EAEL,EAAO,GAAe,GACjB,EAEL,EAAO,GAAe,GACjB,EAEL,EAAO,GAAe,GACjB,EAEF,GAET,GAAW,cAAgB,SAAuB,EAAM,EAAM,CAC5D,MAAO,GAAK,MAAQ,EAAK,MAAQ,GAAK,EAAK,MAAQ,EAAK,MAAQ,EAAI,GChJ/D,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAI,IAAM,GAAK,OAAQ,GAAK,AAAK,GAAU,EAAM,EAAM,EAAG,GAAU,GAEtE,YAAwB,EAAM,EAAK,EAAQ,EAAS,CACzD,MAAO,IAAI,IAAM,GAAK,OAAQ,GAAK,AAAK,GAAW,EAAM,EAAM,EAAG,GAAU,GAEvE,YAAwB,EAAM,EAAK,EAAQ,EAAS,CACzD,MAAO,IAAI,IAAM,GAAK,OAAQ,GAAK,AAAK,GAAW,EAAM,EAAM,EAAG,GAAU,GAE9E,GAAM,IAAQ,OAAO,IACf,GAAQ,OAAO,GACd,YAAwB,EAAM,EAAK,EAAQ,EAAS,CACzD,GAAM,GAAM,AAAK,GAAW,EAAM,EAAM,EAAG,GAC3C,GAAI,MAAO,IAAQ,SAAU,CAC3B,GAAM,GAAQ,GAAK,EACnB,GAAI,GAAS,OAAO,iBAClB,MAAO,IAAI,IAAM,GAAK,OAAQ,EAAO,GAGzC,GAAI,EAAQ,cAAgB,GAC1B,KAAM,IAAI,OAAM,GAAI,mEAEtB,MAAO,IAAI,IAAM,GAAK,OAAQ,GAAQ,OAAO,GAAM,GAE9C,YAAsB,EAAK,EAAO,CACvC,GAAM,GAAS,EAAM,MACf,EAAW,MAAO,IAAW,SAAW,EAAS,GAAQ,GAAQ,EAAS,GAAK,EACrF,AAAK,GAAgB,EAAK,EAAM,KAAK,aAAc,GAErD,GAAa,YAAc,SAAqB,EAAO,CACrD,GAAM,GAAS,EAAM,MACf,EAAW,MAAO,IAAW,SAAW,EAAS,GAAQ,GAAQ,EAAS,GAAK,EACrF,MAAI,GAAW,AAAK,GAAe,GAC1B,EAEL,EAAW,AAAK,GAAe,GAC1B,EAEL,EAAW,AAAK,GAAe,GAC1B,EAEL,EAAW,AAAK,GAAe,GAC1B,EAEF,GAET,GAAa,cAAgB,SAAuB,EAAM,EAAM,CAC9D,MAAO,GAAK,MAAQ,EAAK,MAAQ,EAAI,EAAK,MAAQ,EAAK,MAAQ,GAAK,GCvCtE,YAAiB,EAAM,EAAK,EAAQ,EAAQ,CAC1C,GAAiB,EAAM,EAAK,EAAS,GACrC,GAAM,GAAM,GAAM,EAAM,EAAM,EAAQ,EAAM,EAAS,GACrD,MAAO,IAAI,IAAM,GAAK,MAAO,EAAK,EAAS,GAEtC,YAA4B,EAAM,EAAK,EAAO,EAAU,CAC7D,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,YAAsB,EAAM,EAAK,EAAQ,EAAS,CACvD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAU,EAAM,EAAM,EAAG,IAEtD,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,GAAM,GAAI,AAAK,GAAW,EAAM,EAAM,EAAG,GACzC,GAAI,MAAO,IAAM,SACf,KAAM,IAAI,OAAM,GAAI,iDAEtB,MAAO,IAAQ,EAAM,EAAK,EAAG,GAE/B,YAAoB,EAAO,CACzB,MAAI,GAAM,eAAiB,QACzB,GAAM,aAAe,EAAM,OAAS,GAAK,OAAS,GAAW,EAAM,OAAS,EAAM,OAE7E,EAAM,aAER,YAAqB,EAAK,EAAO,CACtC,GAAM,GAAQ,GAAW,GACzB,AAAK,GAAgB,EAAK,EAAM,KAAK,aAAc,EAAM,QACzD,EAAI,KAAK,GAEX,GAAY,YAAc,SAAqB,EAAO,CACpD,GAAM,GAAQ,GAAW,GACzB,MAAO,AAAK,IAAgB,YAAY,EAAM,QAAU,EAAM,QAEhE,GAAY,cAAgB,SAAuB,EAAM,EAAM,CAC7D,MAAO,IAAa,GAAW,GAAO,GAAW,KAE5C,YAAsB,EAAI,EAAI,CACnC,MAAO,GAAG,OAAS,EAAG,OAAS,GAAK,EAAG,OAAS,EAAG,OAAS,EAAI,GAAQ,EAAI,GC9C9E,YAAiB,EAAM,EAAK,EAAQ,EAAQ,CAC1C,GAAM,GAAY,EAAS,EAC3B,UAAiB,EAAM,EAAK,GACrB,GAAI,IAAM,GAAK,OAAQ,GAAS,EAAM,EAAM,EAAQ,EAAM,GAAY,GAExE,YAA6B,EAAM,EAAK,EAAO,EAAU,CAC9D,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAU,EAAM,EAAM,EAAG,IAEtD,YAAwB,EAAM,EAAK,EAAQ,EAAS,CACzD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAwB,EAAM,EAAK,EAAQ,EAAS,CACzD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAwB,EAAM,EAAK,EAAQ,EAAS,CACzD,GAAM,GAAI,AAAK,GAAW,EAAM,EAAM,EAAG,GACzC,GAAI,MAAO,IAAM,SACf,KAAM,IAAI,OAAM,GAAI,kDAEtB,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,GAAM,IAAe,GC7B5B,YAAiB,EAAO,EAAM,EAAQ,EAAQ,CAC5C,MAAO,IAAI,IAAM,GAAK,MAAO,EAAQ,GAEhC,YAA4B,EAAM,EAAK,EAAO,EAAU,CAC7D,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,YAAsB,EAAM,EAAK,EAAQ,EAAS,CACvD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAU,EAAM,EAAM,EAAG,IAEtD,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,GAAM,GAAI,AAAK,GAAW,EAAM,EAAM,EAAG,GACzC,GAAI,MAAO,IAAM,SACf,KAAM,IAAI,OAAM,GAAI,iDAEtB,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,YAA+B,EAAM,EAAK,EAAQ,EAAS,CAChE,GAAI,EAAQ,kBAAoB,GAC9B,KAAM,IAAI,OAAM,GAAI,0CAEtB,MAAO,IAAQ,EAAM,EAAK,EAAG,UAExB,YAAqB,EAAK,EAAO,CACtC,AAAK,GAAgB,EAAK,GAAK,MAAM,aAAc,EAAM,OAE3D,GAAY,cAAgB,AAAK,GAAW,cC/B5C,YAAiB,EAAO,EAAM,EAAQ,EAAQ,CAC5C,MAAO,IAAI,IAAM,GAAK,IAAK,EAAQ,GAE9B,YAA0B,EAAM,EAAK,EAAO,EAAU,CAC3D,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,YAAoB,EAAM,EAAK,EAAQ,EAAS,CACrD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAU,EAAM,EAAM,EAAG,IAEtD,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,MAAO,IAAQ,EAAM,EAAK,EAAG,AAAK,GAAW,EAAM,EAAM,EAAG,IAEvD,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,GAAM,GAAI,AAAK,GAAW,EAAM,EAAM,EAAG,GACzC,GAAI,MAAO,IAAM,SACf,KAAM,IAAI,OAAM,GAAI,+CAEtB,MAAO,IAAQ,EAAM,EAAK,EAAG,GAExB,YAA6B,EAAM,EAAK,EAAQ,EAAS,CAC9D,GAAI,EAAQ,kBAAoB,GAC9B,KAAM,IAAI,OAAM,GAAI,0CAEtB,MAAO,IAAQ,EAAM,EAAK,EAAG,UAExB,YAAmB,EAAK,EAAO,CACpC,AAAK,GAAgB,EAAK,GAAK,IAAI,aAAc,EAAM,OAEzD,GAAU,cAAgB,AAAK,GAAW,cChCnC,YAA0B,EAAO,EAAM,EAAO,EAAU,CAC7D,MAAO,IAAI,IAAM,GAAK,IAAK,EAAO,GAE7B,YAAoB,EAAM,EAAK,EAAQ,EAAS,CACrD,MAAO,IAAI,IAAM,GAAK,IAAK,AAAK,GAAU,EAAM,EAAM,EAAG,GAAU,GAE9D,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,MAAO,IAAI,IAAM,GAAK,IAAK,AAAK,GAAW,EAAM,EAAM,EAAG,GAAU,GAE/D,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,MAAO,IAAI,IAAM,GAAK,IAAK,AAAK,GAAW,EAAM,EAAM,EAAG,GAAU,GAE/D,YAAqB,EAAM,EAAK,EAAQ,EAAS,CACtD,MAAO,IAAI,IAAM,GAAK,IAAK,AAAK,GAAW,EAAM,EAAM,EAAG,GAAU,GAE/D,YAAmB,EAAK,EAAO,CACpC,AAAK,GAAgB,EAAK,GAAK,IAAI,aAAc,EAAM,OAEzD,GAAU,cAAgB,AAAK,GAAW,cCjB1C,GAAM,IAAc,GACd,GAAa,GACb,GAAa,GACb,GAAkB,GACjB,YAAyB,EAAO,EAAM,EAAQ,EAAS,CAC5D,GAAI,EAAQ,iBAAmB,GAC7B,KAAM,IAAI,OAAM,GAAI,yCAEtB,MAAO,IAAI,IAAM,GAAK,UAAW,OAAW,GAEvC,YAAqB,EAAO,EAAM,EAAQ,EAAS,CACxD,GAAI,EAAQ,kBAAoB,GAC9B,KAAM,IAAI,OAAM,GAAI,0CAEtB,MAAO,IAAI,IAAM,GAAK,MAAO,OAAW,GAE1C,YAAqB,EAAO,EAAO,EAAS,CAC1C,GAAI,EAAS,CACX,GAAI,EAAQ,WAAa,IAAS,OAAO,MAAM,GAC7C,KAAM,IAAI,OAAM,GAAI,mCAEtB,GAAI,EAAQ,gBAAkB,IAAU,KAAU,UAAY,IAAU,WACtE,KAAM,IAAI,OAAM,GAAI,wCAGxB,MAAO,IAAI,IAAM,GAAK,MAAO,EAAO,GAE/B,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAY,GAAY,EAAM,EAAM,GAAI,EAAG,GAE7C,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAY,GAAY,EAAM,EAAM,GAAI,EAAG,GAE7C,YAAuB,EAAM,EAAK,EAAQ,EAAS,CACxD,MAAO,IAAY,GAAY,EAAM,EAAM,GAAI,EAAG,GAE7C,YAAqB,EAAK,EAAO,EAAS,CAC/C,GAAM,GAAQ,EAAM,MACpB,GAAI,IAAU,GACZ,EAAI,KAAK,CAAC,GAAK,MAAM,aAAe,aAC3B,IAAU,GACnB,EAAI,KAAK,CAAC,GAAK,MAAM,aAAe,aAC3B,IAAU,KACnB,EAAI,KAAK,CAAC,GAAK,MAAM,aAAe,aAC3B,IAAU,OACnB,EAAI,KAAK,CAAC,GAAK,MAAM,aAAe,SAC/B,CACL,GAAI,GACA,EAAU,GACd,AAAI,EAAC,GAAW,EAAQ,UAAY,KAClC,IAAc,GACd,EAAU,GAAY,GAAM,GAC5B,AAAI,IAAU,GAAW,OAAO,MAAM,GACpC,IAAK,GAAK,IACV,EAAI,KAAK,GAAK,MAAM,EAAG,IACvB,EAAU,IAEV,IAAc,GACd,EAAU,GAAY,GAAM,GACxB,IAAU,GACZ,IAAK,GAAK,IACV,EAAI,KAAK,GAAK,MAAM,EAAG,IACvB,EAAU,MAIX,GACH,IAAc,GACd,EAAU,GAAY,GAAM,GAC5B,GAAK,GAAK,IACV,EAAI,KAAK,GAAK,MAAM,EAAG,MAI7B,GAAY,YAAc,SAAqB,EAAO,EAAS,CAC7D,GAAM,GAAQ,EAAM,MACpB,GAAI,IAAU,IAAS,IAAU,IAAQ,IAAU,MAAQ,IAAU,OACnE,MAAO,GAET,GAAI,GACJ,GAAI,CAAC,GAAW,EAAQ,UAAY,GAAM,CAGxC,GAFA,GAAc,GACd,EAAU,GAAY,GAAM,GACxB,IAAU,GAAW,OAAO,MAAM,GACpC,MAAO,GAIT,GAFA,GAAc,GACd,EAAU,GAAY,GAAM,GACxB,IAAU,EACZ,MAAO,GAGX,MAAO,IAET,GAAM,IAAS,GAAI,aAAY,GACzB,GAAW,GAAI,UAAS,GAAQ,GAChC,GAAO,GAAI,YAAW,GAAQ,GACpC,YAAuB,EAAK,CAC1B,GAAI,IAAQ,SACV,GAAS,UAAU,EAAG,MAAO,YACpB,IAAQ,UACjB,GAAS,UAAU,EAAG,MAAO,YACpB,OAAO,MAAM,GACtB,GAAS,UAAU,EAAG,MAAO,QACxB,CACL,GAAS,WAAW,EAAG,GACvB,GAAM,GAAS,GAAS,UAAU,GAC5B,EAAY,GAAS,aAAe,GACpC,EAAW,EAAS,QAC1B,GAAI,IAAa,IACf,GAAS,UAAU,EAAG,MAAO,YACpB,IAAa,EACtB,GAAS,UAAU,EAAI,GAAM,aAAe,GAAK,GAAY,GAAI,QAC5D,CACL,GAAM,GAAkB,EAAW,IACnC,AAAI,EAAkB,IACpB,GAAS,UAAU,EAAG,GACjB,AAAI,EAAkB,IAC3B,GAAS,UAAU,EAAI,GAAS,aAAe,GAAK,GAAK,GAAK,EAAiB,IAE/E,GAAS,UAAU,EAAI,GAAS,aAAe,GAAK,EAAkB,IAAM,GAAK,GAAY,GAAI,MAKzG,YAAqB,EAAM,EAAK,CAC9B,GAAI,EAAK,OAAS,EAAM,EACtB,KAAM,IAAI,OAAM,GAAI,kCAEtB,GAAM,GAAQ,GAAK,IAAQ,GAAK,EAAK,EAAM,GAC3C,GAAI,IAAS,MACX,MAAO,UAET,GAAI,IAAS,MACX,MAAO,UAET,GAAI,IAAS,MACX,MAAO,KAET,GAAM,GAAM,GAAQ,GAAK,GACnB,EAAO,EAAO,KAChB,EACJ,MAAI,KAAQ,EACV,EAAM,EAAO,GAAK,IACb,AAAI,IAAQ,GACjB,EAAO,GAAO,MAAQ,GAAM,GAAM,IAElC,EAAM,IAAS,EAAI,SAAW,IAEzB,EAAO,MAAQ,CAAC,EAAM,EAE/B,YAAuB,EAAK,CAC1B,GAAS,WAAW,EAAG,EAAK,IAE9B,YAAqB,EAAM,EAAK,CAC9B,GAAI,EAAK,OAAS,EAAM,EACtB,KAAM,IAAI,OAAM,GAAI,kCAEtB,GAAM,GAAU,GAAK,YAAc,GAAK,EACxC,MAAO,IAAI,UAAS,EAAK,OAAQ,EAAQ,GAAG,WAAW,EAAG,IAE5D,YAAuB,EAAK,CAC1B,GAAS,WAAW,EAAG,EAAK,IAE9B,YAAqB,EAAM,EAAK,CAC9B,GAAI,EAAK,OAAS,EAAM,EACtB,KAAM,IAAI,OAAM,GAAI,kCAEtB,GAAM,GAAU,GAAK,YAAc,GAAK,EACxC,MAAO,IAAI,UAAS,EAAK,OAAQ,EAAQ,GAAG,WAAW,EAAG,IAE5D,GAAY,cAAgB,GAAW,cCnKvC,YAAsB,EAAM,EAAK,EAAO,CACtC,KAAM,IAAI,OAAM,GAAI,iCAAgD,gBAAsB,EAAK,KAAS,KAE1G,YAAiB,EAAK,CACpB,MAAO,IAAM,CACX,KAAM,IAAI,OAAM,GAAI,MAAqB,MAGtC,GAAM,IAAO,GACpB,OAAS,GAAI,EAAG,GAAK,GAAI,IACvB,GAAK,GAAK,GAEZ,GAAK,IAAW,GAChB,GAAK,IAAW,GAChB,GAAK,IAAW,GAChB,GAAK,IAAW,GAChB,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAK,IAAM,GACX,OAAS,GAAI,GAAI,GAAK,GAAI,IACxB,GAAK,GAAK,GAEZ,GAAK,IAAa,GAClB,GAAK,IAAa,GAClB,GAAK,IAAa,GAClB,GAAK,IAAa,GAClB,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAK,IAAM,GACX,OAAS,GAAI,GAAI,GAAK,GAAI,IACxB,GAAK,GAAW,GAElB,GAAK,IAAY,GACjB,GAAK,IAAY,GACjB,GAAK,IAAY,GACjB,GAAK,IAAY,GACjB,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAK,IAAM,GACX,GAAK,IAAM,GAAQ,qDACnB,OAAS,GAAI,GAAI,GAAK,IAAK,IACzB,GAAK,GAAY,GAEnB,GAAK,KAAc,GACnB,GAAK,KAAc,GACnB,GAAK,KAAc,GACnB,GAAK,KAAc,GACnB,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GAAQ,qDACpB,OAAS,GAAI,IAAK,GAAK,IAAK,IAC1B,GAAK,GAAW,GAElB,GAAK,KAAa,GAClB,GAAK,KAAa,GAClB,GAAK,KAAa,GAClB,GAAK,KAAa,GAClB,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAa,GAClB,OAAS,GAAI,IAAK,GAAK,IAAK,IAC1B,GAAK,GAAS,GAEhB,GAAK,KAAW,GAChB,GAAK,KAAW,GAChB,GAAK,KAAW,GAChB,GAAK,KAAW,GAChB,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAW,GAChB,OAAS,GAAI,IAAK,GAAK,IAAK,IAC1B,GAAK,GAAS,GAEhB,GAAK,KAAW,GAChB,GAAK,KAAW,GAChB,GAAK,KAAW,GAChB,GAAK,KAAW,GAChB,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,OAAS,GAAI,IAAK,GAAK,IAAK,IAC1B,GAAK,GAAK,GAAQ,mCAEpB,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAa,GAClB,GAAK,KAAO,GAAQ,mCACpB,GAAK,KAAa,GAClB,GAAK,KAAa,GAClB,GAAK,KAAa,GAClB,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAO,GACZ,GAAK,KAAa,GACX,GAAM,IAAQ,GACrB,OAAS,GAAI,EAAG,EAAI,GAAI,IACtB,GAAM,GAAK,GAAI,IAAM,GAAK,KAAM,EAAG,GAErC,OAAS,GAAI,GAAI,GAAK,IAAK,IACzB,GAAM,GAAK,GAAK,GAAI,IAAM,GAAK,OAAQ,EAAG,GAE5C,GAAM,IAAM,GAAI,IAAM,GAAK,MAAO,GAAI,YAAW,GAAI,GACrD,GAAM,IAAM,GAAI,IAAM,GAAK,OAAQ,GAAI,GACvC,GAAM,KAAO,GAAI,IAAM,GAAK,MAAO,EAAG,GACtC,GAAM,KAAO,GAAI,IAAM,GAAK,IAAK,EAAG,GACpC,GAAM,KAAO,GAAI,IAAM,GAAK,MAAO,GAAO,GAC1C,GAAM,KAAO,GAAI,IAAM,GAAK,KAAM,GAAM,GACxC,GAAM,KAAO,GAAI,IAAM,GAAK,KAAM,KAAM,GACjC,YAA0B,EAAO,CACtC,OAAQ,EAAM,UACT,IAAK,MACR,MAAO,IAAU,CAAC,UACf,IAAK,KACR,MAAO,IAAU,CAAC,UACf,IAAK,KACR,MAAO,IAAU,CAAC,UACf,IAAK,MACR,MAAK,GAAM,MAAM,OAGjB,OAFS,GAAU,CAAC,SAGjB,IAAK,OACR,MAAI,GAAM,QAAU,GACX,GAAU,CAAC,KAEpB,WACG,IAAK,MACR,MAAI,GAAM,QAAU,EACX,GAAU,CAAC,MAEpB,WACG,IAAK,IACR,MAAI,GAAM,QAAU,EACX,GAAU,CAAC,MAEpB,WACG,IAAK,KACR,MAAI,GAAM,MAAQ,GACT,GAAU,CAAC,OAAO,EAAM,SAEjC,WACG,IAAK,OACR,GAAI,EAAM,OAAS,IACjB,MAAO,IAAU,CAAC,GAAK,OAAO,EAAM,UCnJ1C,GAAM,IAAuB,CAC3B,QAAS,GACT,aACA,qBAEI,GAAe,GACrB,GAAa,GAAK,KAAK,OAAS,GAChC,GAAa,GAAK,OAAO,OAAS,GAClC,GAAa,GAAK,MAAM,OAAS,GACjC,GAAa,GAAK,OAAO,OAAS,GAClC,GAAa,GAAK,MAAM,OAAS,GACjC,GAAa,GAAK,IAAI,OAAS,GAC/B,GAAa,GAAK,IAAI,OAAS,GAC/B,GAAa,GAAK,MAAM,OAAS,GACjC,GAAM,IAAM,GAAI,IAChB,QAAU,CACR,YAAY,EAAK,EAAQ,CACvB,KAAK,IAAM,EACX,KAAK,OAAS,EAEhB,SAAS,EAAK,CACZ,GAAI,GAAI,KACR,EACE,IAAI,EAAE,MAAQ,EACZ,MAAO,SAEF,EAAI,EAAE,QACf,MAAO,SAEF,aAAY,EAAO,EAAK,CAC7B,GAAI,GAAS,EAAM,SAAS,GAC1B,KAAM,IAAI,OAAM,GAAI,0CAEtB,MAAO,IAAI,IAAI,EAAK,KAGlB,GAAe,CACnB,KAAM,GAAI,IAAM,GAAK,KAAM,MAC3B,UAAW,GAAI,IAAM,GAAK,UAAW,QACrC,KAAM,GAAI,IAAM,GAAK,KAAM,IAC3B,MAAO,GAAI,IAAM,GAAK,MAAO,IAC7B,WAAY,GAAI,IAAM,GAAK,MAAO,GAClC,SAAU,GAAI,IAAM,GAAK,IAAK,IAE1B,GAAe,CACnB,OAAO,EAAK,EAAM,EAAU,EAAW,CACrC,MAAI,CAAC,OAAO,UAAU,IAAQ,CAAC,OAAO,cAAc,GAC3C,GAAI,IAAM,GAAK,MAAO,GACpB,GAAO,EACT,GAAI,IAAM,GAAK,KAAM,GAErB,GAAI,IAAM,GAAK,OAAQ,IAGlC,OAAO,EAAK,EAAM,EAAU,EAAW,CACrC,MAAI,IAAO,OAAO,GACT,GAAI,IAAM,GAAK,KAAM,GAErB,GAAI,IAAM,GAAK,OAAQ,IAGlC,WAAW,EAAK,EAAM,EAAU,EAAW,CACzC,MAAO,IAAI,IAAM,GAAK,MAAO,IAE/B,OAAO,EAAK,EAAM,EAAU,EAAW,CACrC,MAAO,IAAI,IAAM,GAAK,OAAQ,IAEhC,QAAQ,EAAK,EAAM,EAAU,EAAW,CACtC,MAAO,GAAM,GAAa,KAAO,GAAa,OAEhD,KAAK,EAAM,EAAM,EAAU,EAAW,CACpC,MAAO,IAAa,MAEtB,UAAU,EAAM,EAAM,EAAU,EAAW,CACzC,MAAO,IAAa,WAEtB,YAAY,EAAK,EAAM,EAAU,EAAW,CAC1C,MAAO,IAAI,IAAM,GAAK,MAAO,GAAI,YAAW,KAE9C,SAAS,EAAK,EAAM,EAAU,EAAW,CACvC,MAAO,IAAI,IAAM,GAAK,MAAO,GAAI,YAAW,EAAI,OAAQ,EAAI,WAAY,EAAI,cAE9E,MAAM,EAAK,EAAM,EAAS,EAAU,CAClC,GAAI,CAAC,EAAI,OACP,MAAI,GAAQ,iBAAmB,GACtB,CACL,GAAa,WACb,GAAI,IAAM,GAAK,QAGZ,GAAa,WAEtB,EAAW,GAAI,YAAY,EAAU,GACrC,GAAM,GAAU,GACZ,EAAI,EACR,OAAW,KAAK,GACd,EAAQ,KAAO,GAAe,EAAG,EAAS,GAE5C,MAAI,GAAQ,eACH,CACL,GAAI,IAAM,GAAK,MAAO,EAAI,QAC1B,EACA,GAAI,IAAM,GAAK,QAGZ,CACL,GAAI,IAAM,GAAK,MAAO,EAAI,QAC1B,IAGJ,OAAO,EAAK,EAAK,EAAS,EAAU,CAClC,GAAM,GAAQ,IAAQ,SAChB,EAAO,EAAQ,EAAI,OAAS,OAAO,KAAK,GACxC,EAAS,EAAQ,EAAI,KAAO,EAAK,OACvC,GAAI,CAAC,EACH,MAAI,GAAQ,iBAAmB,GACtB,CACL,GAAa,SACb,GAAI,IAAM,GAAK,QAGZ,GAAa,SAEtB,EAAW,GAAI,YAAY,EAAU,GACrC,GAAM,GAAU,GACZ,EAAI,EACR,OAAW,KAAO,GAChB,EAAQ,KAAO,CACb,GAAe,EAAK,EAAS,GAC7B,GAAe,EAAQ,EAAI,IAAI,GAAO,EAAI,GAAM,EAAS,IAI7D,MADA,IAAe,EAAS,GACpB,EAAQ,eACH,CACL,GAAI,IAAM,GAAK,IAAK,GACpB,EACA,GAAI,IAAM,GAAK,QAGZ,CACL,GAAI,IAAM,GAAK,IAAK,GACpB,KAIN,GAAa,IAAM,GAAa,OAChC,GAAa,OAAS,GAAa,WACnC,OAAW,KAAO,iFAAiF,MAAM,KACvG,GAAa,GAAI,UAAe,GAAa,SAE/C,YAAwB,EAAK,EAAU,GAAI,EAAU,CACnD,GAAM,GAAM,GAAG,GACT,EAAoB,GAAW,EAAQ,cAAgB,EAAQ,aAAa,IAAQ,GAAa,GACvG,GAAI,MAAO,IAAsB,WAAY,CAC3C,GAAM,GAAS,EAAkB,EAAK,EAAK,EAAS,GACpD,GAAI,GAAU,KACZ,MAAO,GAGX,GAAM,GAAc,GAAa,GACjC,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,GAAI,wBAAuC,KAE7D,MAAO,GAAY,EAAK,EAAK,EAAS,GAExC,YAAwB,EAAS,EAAS,CACxC,AAAI,EAAQ,WACV,EAAQ,KAAK,EAAQ,WAGzB,YAAmB,EAAI,EAAI,CACzB,GAAM,GAAY,MAAM,QAAQ,EAAG,IAAM,EAAG,GAAG,GAAK,EAAG,GACjD,EAAY,MAAM,QAAQ,EAAG,IAAM,EAAG,GAAG,GAAK,EAAG,GACvD,GAAI,EAAU,OAAS,EAAU,KAC/B,MAAO,GAAU,KAAK,QAAQ,EAAU,MAE1C,GAAM,GAAQ,EAAU,KAAK,MACvB,EAAO,GAAa,GAAO,cAAc,EAAW,GAC1D,MAAI,KAAS,GACX,QAAQ,KAAK,yEAER,EAET,YAAyB,EAAK,EAAQ,EAAU,EAAS,CACvD,GAAI,MAAM,QAAQ,GAChB,OAAW,KAAS,GAClB,GAAgB,EAAK,EAAO,EAAU,OAGxC,GAAS,EAAO,KAAK,OAAO,EAAK,EAAQ,GAG7C,YAAsB,EAAM,EAAU,EAAS,CAC7C,GAAM,GAAS,GAAe,EAAM,GACpC,GAAI,CAAC,MAAM,QAAQ,IAAW,EAAQ,iBAAkB,CACtD,GAAM,GAAa,EAAQ,iBAAiB,GAC5C,GAAI,EACF,MAAO,GAET,GAAM,GAAU,EAAS,EAAO,KAAK,OACrC,GAAI,EAAQ,YAAa,CACvB,GAAM,GAAO,EAAQ,YAAY,EAAQ,GACnC,EAAM,GAAI,IAAG,GAEnB,GADA,EAAQ,EAAK,EAAQ,GACjB,EAAI,OAAO,SAAW,EACxB,KAAM,IAAI,OAAM,+CAAgD,eAElE,MAAO,IAAM,EAAI,OAAO,KAG5B,UAAgB,GAAK,EAAQ,EAAU,GAChC,GAAI,QAAQ,IAErB,YAAgB,EAAM,EAAS,CAC7B,SAAU,OAAO,OAAO,GAAI,GAAsB,GAC3C,GAAa,EAAM,GAAc,GCnO1C,GAAM,IAAuB,CAC3B,OAAQ,GACR,gBAAiB,GACjB,eAAgB,GAChB,YAAa,IAEf,QAAgB,CACd,YAAY,EAAM,EAAU,GAAI,CAC9B,KAAK,IAAM,EACX,KAAK,KAAO,EACZ,KAAK,QAAU,EAEjB,MAAO,CACL,MAAO,MAAK,KAAO,KAAK,KAAK,OAE/B,MAAO,CACL,GAAM,GAAM,KAAK,KAAK,KAAK,KACvB,EAAQ,GAAM,GAClB,GAAI,IAAU,OAAW,CACvB,GAAM,GAAU,GAAK,GACrB,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,GAAI,gCAA+C,IAAQ,aAAe,EAAI,SAAS,IAAI,SAAS,EAAG,SAEzH,GAAM,GAAQ,EAAM,GACpB,EAAQ,EAAQ,KAAK,KAAM,KAAK,IAAK,EAAO,KAAK,SAEnD,YAAK,KAAO,EAAM,cACX,IAGL,GAAO,OAAO,IAAI,QAClB,GAAQ,OAAO,IAAI,SACzB,YAAsB,EAAO,EAAW,EAAS,CAC/C,GAAM,GAAM,GACZ,OAAS,GAAI,EAAG,EAAI,EAAM,MAAO,IAAK,CACpC,GAAM,GAAQ,GAAe,EAAW,GACxC,GAAI,IAAU,GAAO,CACnB,GAAI,EAAM,QAAU,SAClB,MAEF,KAAM,IAAI,OAAM,GAAI,6CAEtB,GAAI,IAAU,GACZ,KAAM,IAAI,OAAM,GAAI,8CAA6D,eAAiB,EAAM,UAE1G,EAAI,GAAK,EAEX,MAAO,GAET,YAAoB,EAAO,EAAW,EAAS,CAC7C,GAAM,GAAU,EAAQ,UAAY,GAC9B,EAAM,EAAU,OAAY,GAC5B,EAAI,EAAU,GAAI,KAAQ,OAChC,OAAS,GAAI,EAAG,EAAI,EAAM,MAAO,IAAK,CACpC,GAAM,GAAM,GAAe,EAAW,GACtC,GAAI,IAAQ,GAAO,CACjB,GAAI,EAAM,QAAU,SAClB,MAEF,KAAM,IAAI,OAAM,GAAI,2CAEtB,GAAI,IAAQ,GACV,KAAM,IAAI,OAAM,GAAI,4CAA2D,wBAA0B,EAAM,UAEjH,GAAI,IAAY,IAAQ,MAAO,IAAQ,SACrC,KAAM,IAAI,OAAM,GAAI,yCAAwD,MAAO,OAErF,GAAM,GAAQ,GAAe,EAAW,GACxC,GAAI,IAAU,GACZ,KAAM,IAAI,OAAM,GAAI,4CAA2D,0BAA4B,EAAM,UAEnH,AAAI,EACF,EAAE,IAAI,EAAK,GAEX,EAAI,GAAO,EAGf,MAAO,GAAU,EAAI,EAEvB,YAAwB,EAAW,EAAS,CAC1C,GAAI,EAAU,OACZ,MAAO,IAET,GAAM,GAAQ,EAAU,OACxB,GAAI,EAAM,OAAS,GAAK,MACtB,MAAO,IAET,GAAI,EAAM,KAAK,SACb,MAAO,GAAM,MAEf,GAAI,EAAM,OAAS,GAAK,MACtB,MAAO,IAAa,EAAO,EAAW,GAExC,GAAI,EAAM,OAAS,GAAK,IACtB,MAAO,IAAW,EAAO,EAAW,GAEtC,GAAI,EAAM,OAAS,GAAK,IAAK,CAC3B,GAAI,EAAQ,MAAQ,MAAO,GAAQ,KAAK,EAAM,QAAW,WAAY,CACnE,GAAM,GAAS,GAAe,EAAW,GACzC,MAAO,GAAQ,KAAK,EAAM,OAAO,GAEnC,KAAM,IAAI,OAAM,GAAI,yBAAwC,EAAM,UAEpE,KAAM,IAAI,OAAM,eAElB,YAAgB,EAAM,EAAS,CAC7B,GAAI,CAAE,aAAgB,aACpB,KAAM,IAAI,OAAM,GAAI,0CAEtB,EAAU,OAAO,OAAO,GAAI,GAAsB,GAClD,GAAM,GAAY,EAAQ,WAAa,GAAI,IAAU,EAAM,GACrD,EAAU,GAAe,EAAW,GAC1C,GAAI,IAAY,GACd,KAAM,IAAI,OAAM,GAAI,yCAEtB,GAAI,IAAY,GACd,KAAM,IAAI,OAAM,GAAI,2BAEtB,GAAI,CAAC,EAAU,OACb,KAAM,IAAI,OAAM,GAAI,8CAEtB,MAAO,GjBlHF,GAAM,IAAM,MAAO,EAAsB,IAA2C,CAEzF,GAAM,GAAa,GAAO,GAAW,KAAM,AAAK,IAAS,GAAW,EAC9D,EAAU,AAAK,GAAO,GACtB,EAAQ,GAAO,GAAO,KAAM,AAAO,IAAI,QAAQ,EAAS,GAAO,EACrE,MAAO,AAAM,IAAI,IAGN,GAAe,MAAO,EAAU,IAAyC,CACpF,GAAM,GAAM,KAAM,AAAM,IAAO,GACzB,EAAW,GAAO,GAAO,KAAM,AAAO,IAAI,QAAQ,EAAK,GAAO,EACpE,MAAO,AAAK,IAAO,IkBad,YAAqB,EAA6B,CACvD,MAAO,AAAQ,IAAU,AAAQ,GAAO,QAAS,OAAQ,EAAI,QAAS,EAAI,MAQrE,YAAe,EAA6C,CACjE,GAAI,GAAO,GAEX,MAAI,GAAY,KAAK,EAAK,KAAK,GAAY,EAAY,MACnD,EAAY,IAAI,SAAS,GAAO,EAAK,OACvC,EAAY,IAAI,QAAQ,IAAI,GAAK,AAAQ,GACvC,AAAQ,GAAU,AAAQ,GAAO,SACjC,MAGA,EAAY,IAAI,QAAQ,GAAO,EAAK,OACtC,EAAY,IAAI,OAAO,IAAI,GAAK,AAAQ,GACtC,AAAQ,GAAU,AAAQ,GAAO,QACjC,MAIG,EC/DT,iKCAA,OAAsB,SACT,GAAS,WAAU,OACnB,GAAS,WAAU,OCDhC,OAAuB,SCDhB,GAAK,IAAL,UAAK,EAAL,CACL,MAAM,MACN,UAAU,UACV,MAAM,cAHI,aCIL,GAAM,IAAqB,GAAI,YAAW,CAAE,IAAM,IAC5C,GAAiB,GAAI,YAAW,CAAE,IAAM,IACxC,GAAiB,GAAI,YAAW,CAAE,EAAM,IAAM,IAC9C,GAAoB,YAK1B,YAAoB,EAAqC,CAC9D,OAAQ,OACD,IAAQ,QAAS,MAAO,QACxB,IAAQ,IAAK,MAAO,QACpB,IAAQ,IAAK,MAAO,YAChB,MAAO,OAQb,GAAM,IAAkB,AAAC,GAG3B,CAEH,GAAI,GAAU,EAAa,IACzB,MAAO,CACL,UAAW,EAAY,MAAM,GAAe,YAC5C,KAAM,GAAQ,KAIX,GAAI,GAAU,EAAa,IAChC,MAAO,CACL,UAAW,EAAY,MAAM,GAAmB,YAChD,KAAM,GAAQ,SAIX,GAAI,GAAU,EAAa,IAChC,MAAO,CACL,UAAW,EAAY,MAAM,GAAe,YAC5C,KAAM,GAAQ,KAKlB,KAAM,IAAI,OAAM,8CAML,GAAY,CAAC,EAA0B,IAC3C,GAAQ,MAAM,EAAQ,EAAY,MAAM,EAAG,EAAO,aAG9C,GAAY,AAAC,GAAyB,CACjD,OAAO,OACA,MAAO,MAAO,IAAQ,QACtB,UAAW,MAAO,IAAQ,YAC1B,YAAa,MAAO,IAAQ,IAEnC,KAAM,IAAI,OAAM,YAAY,oBF1DvB,YACL,EACA,EACQ,CACR,GAAM,GAAY,AAAM,kBAAe,GAGjC,EAAS,GAAW,GAC1B,GAAI,IAAW,KACb,KAAM,IAAI,OAAM,aAAa,oBAG/B,GAAM,GAAc,AAAM,YAAS,EAAQ,GAG3C,MAAO,IAAoB,AAAO,GAAO,GAAI,YAAW,IAMnD,YAAwB,EAG7B,CACA,GAAI,CAAC,EAAI,WAAW,IAClB,KAAM,IAAI,OAAM,4DAGlB,GAAM,GAAmB,EAAI,OAAO,GAAkB,QAChD,EAAa,AAAO,GAAO,GAC3B,CAAE,YAAW,QAAS,GAAgB,GAE5C,MAAO,CACL,UAAW,AAAM,kBAAe,GAChC,QGrCJ,mBAAkD,CAChD,GAAM,GAAY,KAAM,AAAO,IAAS,gBAClC,EAAQ,KAAM,AAAO,IAAS,SAEpC,MAAO,IACL,EACA,GAAU,IAYd,mBAA+C,CAC7C,GAAM,GAAY,KAAM,AAAO,IAAS,iBAClC,EAAQ,KAAM,AAAO,IAAS,SAEpC,MAAO,IACL,EACA,GAAU,IC9Bd,OAAuB,SAQvB,kBAAuC,CAAE,WAAW,GAAI,OAAM,MAAK,aAK9C,CACnB,GAAI,CACF,GAAM,CAAE,OAAM,aAAc,GAAe,GAErC,EAAW,GAAI,YAAW,AAAM,kBAAe,IAC/C,EAAY,GAAI,YAAW,AAAM,yBAAsB,EAAM,IAC7D,EAAW,GAAI,YAAW,AAAM,kBAAe,IAErD,OAAQ,OAED,IAAQ,QACX,MAAO,MAAM,AAAO,IAAQ,OAAO,EAAW,EAAU,OAErD,IAAQ,IACX,MAAO,MAAM,AAAO,IAAI,OAAO,EAAW,EAAU,WAE7C,MAAO,UAGX,EAAP,CACA,MAAO,ICPX,kBAA4B,CAC1B,eAAe,GACf,WACA,QAAQ,GACR,SACA,oBAAoB,GACpB,aACA,UAAU,SACV,QACA,YAWgB,CAChB,GAAM,GAAuB,KAAK,MAAM,KAAK,MAAQ,KAC/C,EAAe,GAAS,GAAO,GAC/B,EAAQ,KAAM,AAAO,IAAS,SAG9B,EAAS,CACb,IAAK,GAAa,IAAU,mBAC5B,IAAK,MACL,IAAK,SAIH,EAAM,GAAe,EAAuB,EAC5C,EAAM,EAAuB,GAEjC,GAAI,EAAc,CAChB,GAAM,GAAM,EAAa,QAEzB,EAAM,KAAK,IAAI,EAAI,IAAK,GACxB,EAAM,KAAK,IAAI,EAAI,IAAK,GAI1B,GAAM,GAAU,CACd,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,GAAU,KAAM,AAAI,MACzB,IAAK,EACL,IAAK,GAAS,KACd,IAAK,EACL,IAAK,GAAuB,GAAe,EAAa,QAAQ,IAAM,MAGlE,GAAY,EAAe,KAAM,IAAK,EAAQ,GAAW,KAE/D,MAAO,CACL,SACA,UACA,cAUG,YAAgB,EAAqB,CAC1C,GAAM,GAAQ,EAAK,MAAM,KACnB,EAAS,KAAK,MAAM,GAAO,UAAU,EAAM,KAC3C,EAAU,KAAK,MAAM,GAAO,UAAU,EAAM,KAElD,MAAO,CACL,SACA,UACA,UAAW,EAAM,IAAM,MASpB,YAAgB,EAAoB,CACzC,GAAM,GAAgB,GAAa,EAAK,QAClC,EAAiB,GAAc,EAAK,SAE1C,MAAO,GAAgB,IAChB,EAAiB,IACjB,EAAK,UAQN,YAAsB,EAA4B,CACxD,MAAO,IAAO,UAAU,KAAK,UAAU,IAQlC,YAAuB,EAA8B,CAC1D,MAAO,IAAO,UAAU,KAAK,UAAU,IAClC,KASA,YAAmB,EAAqB,CAC7C,MAAO,GAAK,QAAQ,KAAO,KAAK,MAAM,KAAK,MAAQ,KASpD,kBAA8B,EAA8B,CAC3D,GAAM,GAAgB,GAAa,EAAK,QAClC,EAAiB,GAAc,EAAK,SAEpC,EAAI,KAAM,IAAiB,CAC/B,SAAU,EACV,KAAM,GAAG,KAAiB,IAC1B,IAAK,EAAK,QAAQ,IAClB,UAAW,GAAO,cAAc,EAAK,WAAa,MAGpD,GAAI,CAAC,EAAG,MAAO,GACf,GAAI,CAAC,EAAK,QAAQ,IAAK,MAAO,GAG9B,GAAM,GAAM,GAAO,EAAK,QAAQ,KAC1B,EAAI,EAAI,QAAQ,MAAQ,EAAK,QAAQ,IAC3C,MAAK,IAEE,KAAM,IAAQ,GAYhB,YAAoB,EAAc,EAAQ,EAAW,CAC1D,GAAM,GAAI,GAAe,EAAM,GAC/B,MAAI,GAAE,IAAY,GAAW,EAAE,IAAK,EAAQ,GACrC,EAAE,IAMX,kBAA2B,EAAoB,EAAuC,CACpF,GAAM,GAAgB,GAAa,GAC7B,EAAiB,GAAc,GAErC,MAAO,IAAO,YACZ,KAAM,AAAO,IAAS,KAAK,GAAG,KAAiB,IAAkB,IAWrE,YAAsB,EAAqC,CACzD,OAAQ,OACD,UAAW,MAAO,YAClB,MAAO,MAAO,gBACV,MAAO,OAUpB,YAAwB,EAAc,EAAoD,CACxF,GAAI,CACF,MAAO,MAAK,MAAM,GAAO,UAAU,EAAK,MAAM,KAAK,WAC5C,EAAP,CACA,KAAM,IAAI,OAAM,iBAAiB,UAAc,IAAU,EAAI,GAAK,gBAAgB,QCtOtF,GAAI,IAAqC,GAKlC,aAAiD,CACtD,MAAO,IAMF,YAAuB,EAAuC,CACnE,GAAa,EAMf,mBAAoD,CAClD,GAAa,GACb,KAAM,AAAQ,IAAW,IRTpB,GAAM,IAAc,OAWpB,YAAiB,EAA8C,CACpE,MAAO,GAAM,OAAO,CAAC,EAAK,IAAe,CACvC,GAAM,GAAO,AAAM,GAAO,GAE1B,GAAI,AAAM,GAAU,GAAO,MAAO,GAElC,GAAM,GAAQ,GAAc,EAAK,QAAQ,KACzC,MAAO,IAAK,GAAM,GAAQ,IACzB,IAME,YAAuB,EAAuB,CACnD,GAAI,MAAO,IAAQ,SACjB,MAAO,GAGT,GAAM,GAAW,MAAM,KAAK,OAAO,QAAQ,IAAM,GACjD,MAAO,GAAS,GAAK,IACnB,GAAS,KAAO,GACZ,EAAS,GAAG,QAAQ,OAAQ,IAC5B,EAAS,IAOV,YAA0B,EAA0B,CAIzD,MAAO,IAAc,IAMhB,YAAgB,EAA8B,CACnD,MAAO,MAAgB,GAMzB,kBAAoC,EAAwC,CAC1E,GAAM,GAAa,KACnB,MAAO,GAAW,MAAQ,EAAW,UAAY,EAAW,OAAO,KAMrE,kBAA2C,EAAqD,CAC9F,GAAI,GAAO,KACT,MAAO,IAAO,KAGhB,GAAM,GAAM,IAAS,IACf,EAAc,EAAM,GAAQ,AAAQ,GAAY,GAChD,EAAY,EAAM,CAAE,KAAQ,AAAQ,GAAO,GAC3C,EAAW,KAAM,AAAO,MACxB,EAAS,EAAW,GAAiB,GAAY,GAEvD,MAAO,GAAU,OACf,CAAC,EAAoB,EAAc,IAAgB,CACjD,GAAI,EAAK,MAAO,GAEhB,GAAM,GAAa,IAAQ,EACrB,EAAa,EAAU,MAAM,EAAG,EAAU,OAAS,GAEnD,EAAc,AAAQ,GAC1B,GAAc,CAAC,EACX,AAAQ,GAAK,GAAG,GAChB,AAAQ,GAAU,GAAG,IAG3B,MAAO,IAAO,GAAG,IAAS,MAAkB,MAE9C,MS3FJ,kBAA4B,EAAqC,CAE/D,GAAM,GAAW,CADA,KAAM,AAAQ,IAAQ,KACV,IAAI,OAAO,GAExC,GAAc,AAAW,GAAQ,IAEjC,GAAM,GAAe,KACrB,KAAM,AAAQ,IAAQ,GAAmB,GAOpC,YACL,CAAE,MAAK,KAAI,OACX,EACS,CACT,GAAM,GAAS,AAAW,GAAiB,GAGrC,EAAW,AAAW,GAAO,KACnC,GAAI,GAAY,CAAC,AAAM,GAAU,AAAM,GAAO,IAAY,MAAO,GAGjE,GAAI,EAAK,CACP,GAAM,GAAI,EAAS,AAAQ,GAAQ,AAAY,GAAY,IACrD,EAAI,AAAW,GAAO,GAC5B,GAAI,CAAC,GAAK,AAAM,GAAU,AAAM,GAAO,IAAK,MAAO,GAqBrD,MAlBI,KAAI,SAMF,CALS,EAAG,QAAQ,MAAM,GAAQ,CACpC,GAAM,GAAiB,GAAG,YAAmB,AAAQ,GAAQ,GACvD,EAAI,AAAW,GAAO,GAC5B,MAAO,IAAK,CAAC,AAAM,GAAU,AAAM,GAAO,OAK1C,GAAI,QAMF,CALS,EAAG,OAAO,MAAM,GAAQ,CACnC,GAAM,GAAiB,GAAG,WAAkB,AAAQ,GAAQ,GACtD,EAAI,AAAW,GAAO,GAC5B,MAAO,IAAK,CAAC,AAAM,GAAU,AAAM,GAAO,OAK1C,GAMC,CALY,EAAI,MAAM,GAAK,CAC5B,GAAM,GAAQ,AAAW,GAAc,EAAE,KACnC,EAAI,AAAW,GAAO,GAC5B,MAAO,IAAK,CAAC,AAAM,GAAU,AAAM,GAAO,OAahD,aAA6C,CAC3C,MAAO,QAAO,OAAO,MCnFvB,0KCeA,kBACE,EACiB,CACjB,GAAM,GAAS,GAAM,UAAU,KAE/B,GAAI,CACF,GAAM,GAAW,KAAM,AAAI,IAAgB,QAAQ,KAAY,KAC/D,GAAI,IAAa,KAAM,MAAO,SACvB,EAAP,EAIF,KAAM,IAAI,OAAM,qCAMlB,mBAAiD,CAE/C,GAAM,GAAO,KACP,EAAQ,OAAO,OAAO,GAAM,GAClC,GAAI,IAAU,OACZ,MAAO,IAAW,EAAM,IAI1B,GAAM,GAAW,KAAM,AAAO,MAC9B,GAAG,CAAC,GAAS,GACX,KAAM,IAAI,OAAM,qBAElB,MAAO,IAAK,GC5BC,YAAU,EAAO,EAAY,EAAU,EAAc,CAMnE,GAAI,GACA,EAAY,GAGZ,EAAW,EAGf,YAAgC,CAC/B,AAAI,GACH,aAAa,GAKf,YAAkB,CACjB,IACA,EAAY,GAIb,AAAI,MAAO,IAAe,WACzB,GAAe,EACf,EAAW,EACX,EAAa,QAQd,YAAgC,CAAA,OAAA,GAAA,UAAA,OAAZ,EAAY,GAAA,OAAA,GAAA,EAAA,EAAA,EAAA,EAAA,IAAZ,EAAY,GAAA,UAAA,GAC/B,GAAI,GAAO,KACP,EAAU,KAAK,MAAQ,EAE3B,GAAI,EACH,OAID,YAAgB,CACf,EAAW,KAAK,MAChB,EAAS,MAAM,EAAM,GAOtB,aAAiB,CAChB,EAAY,OAGb,AAAI,GAAgB,CAAC,GAKpB,IAGD,IAEA,AAAI,IAAiB,QAAa,EAAU,EAK3C,IACU,IAAe,IAYzB,GAAY,WACX,EAAe,GAAQ,EACvB,IAAiB,OAAY,EAAQ,EAAU,IAKlD,SAAQ,OAAS,EAGV,EEnHR,OAA+B,SCYxB,GAAM,IAAS,CAAC,EAAe,EAAe,IAC5C,EACL,QACA,QACA,UAgBG,GAAM,IAAW,AAAC,GAA4B,CACnD,GAAM,CAAE,QAAO,QAAO,SAAU,EAChC,MAAO,GAAG,KAAS,KAAS,KAKjB,GAAK,GAAO,EAAG,EAAG,GAClB,GAAK,GAAO,EAAG,EAAG,GAClB,GAAS,GAAO,EAAG,EAAG,GCnC5B,GAAK,IAAL,UAAK,EAAL,CACL,MAAM,MACN,YAAY,MACZ,OAAO,OACP,WAAW,WACX,UAAU,UACV,YAAY,cANF,aAsBL,GAAM,IAAY,AAAC,GAA+B,EACvD,MAAO,KAAK,MACZ,MAAO,KAAK,MACZ,KAAM,EAAS,IAAM,IACrB,MAAO,EAAS,GAAa,KAAO,GAAa,YAGtC,GAAQ,AAAC,GAA+B,EACnD,SACA,QAAgB,GAChB,SAAU,GAAU,KAGT,GAAc,AAAC,GAAkC,KACzD,EACH,SAAU,IACL,EAAS,SACZ,MAAO,KAAK,SAIT,YAAqB,EAAmB,CAC7C,GAAM,GAAO,KAAK,MAAM,EAAK,KAC7B,MAAO,CACL,KAAM,EACN,MAAQ,GAAM,EAAO,KAAS,KF9C3B,GAAM,IAAY,AAAC,GAA8B,CACtD,GAAM,CAAE,OAAM,MAAK,QAAS,EAC5B,MAAO,IAAI,YAAM,QAAQ,EAAM,EAAM,IAG1B,GAAa,AAAC,GAA2B,CACpD,GAAM,CAAE,OAAO,GAAI,MAAK,OAAM,QAAO,QAAS,EAC9C,MAAO,CACL,OACA,IAAK,EAAI,WACT,OACA,QACA,OAAQ,IAAS,QAIR,GAAc,AAAC,GAA8B,CACxD,GAAM,GAAO,EAAK,KACZ,EAAM,EAAK,KAAK,WAChB,EAAO,EAAK,MAClB,MAAO,CAAE,OAAM,MAAK,SAGT,GAAO,CAAC,EAAc,EAAa,EAAiB,IACxD,EACL,OACA,MACA,OACA,SACA,MAAO,GAAY,KAAK,SAMf,GAAW,AAAoB,GACnC,EAAI,OAAO,CAAC,EAAK,IACtB,GAAI,EAAI,MAAQ,EACT,GACN,IG9CL,uJAUO,GAAM,IAAU,KAAO,IACrB,AAAK,GAAO,GAGR,GAAmB,MAAO,EAAU,IACxC,AAAK,GAAQ,aAAa,EAAK,GAG3B,GAAU,KAAO,IACrB,AAAK,GAAI,GAGL,GAAmB,MAAO,EAAsB,IACpD,AAAK,GAAQ,IAAI,EAAS,GAGtB,GAAiB,KAAO,IAAmC,CACtE,GAAM,GAAU,KAAM,AAAK,IAAO,GAClC,MAAO,AAAK,IACV,EAAQ,MAAM,IAAS,MAId,GAAW,KAAO,IAA6B,CAC1D,GAAM,GAAM,KAAM,AAAK,IAAG,GACpB,EAAQ,AAAK,GACjB,EAAI,IAAS,KAKf,MADgB,MAAM,AAAK,IAAO,IAC1B,MAAM,QAAQ,AAAC,GAAM,CAC3B,AAAG,EAAM,EAAE,OAAS,EAAM,EAAE,MAAM,OAAS,GACzC,GAAM,EAAE,MAAM,KAAO,EAAE,SAGpB,GAGI,GAAW,KAAO,IAAmD,CAChF,GAAM,GAAW,OAAO,OAAO,GAC5B,OAAO,GAAK,IAAM,QAClB,IAAS,IACZ,MAAO,AAAK,IAAY,ICrD1B,iMCWO,GAAM,IAAS,AAAC,GACd,GAAS,IAAQ,EAAI,UAAY,OAOnC,GAAM,IAAa,AAAC,GAClB,GAAS,IACX,GAAS,EAAI,OACb,GAAM,EAAI,OACV,GAAO,EAAI,QAGL,GAAS,AAAC,GACd,GAAW,IACb,GAAO,EAAY,KAGb,GAAU,AAAC,GACf,GAAS,IACT,OAAO,OAAO,GAAK,MAAM,IAGrB,GAAa,AAAC,GAClB,GAAS,IACT,GAAM,EAAI,QACV,GAAM,EAAI,QACV,GAAM,EAAI,OACV,GAAS,EAAI,OAGT,GAAa,AAAC,GAClB,GAAS,IACT,GAAW,EAAI,WACf,GAAO,EAAI,SACX,GAAS,EAAI,SAGT,GAAa,AAAC,GAClB,GAAS,IACT,OAAO,OAAO,GAAK,MAAM,GAC1B,GAAS,IACN,GAAM,EAAI,MACV,GAAM,EAAI,WACV,GAAM,EAAI,WACV,GAAW,EAAI,cAIb,GAAe,AAAC,GACpB,GAAS,IACX,GAAW,EAAI,WACf,GAAW,EAAI,WACf,EAAI,SAAS,SAAW,GAGlB,GAAa,AAAC,GAClB,GAAa,IACf,GAAO,EAAY,UAGb,GAAe,AAAC,GACpB,GAAS,IACX,GAAW,EAAI,WACf,EAAI,SAAS,SAAW,GAGlB,GAAa,AAAC,GAClB,GAAa,IACf,GAAO,EAAY,UAGb,GAAQ,AAAC,GACb,GAAS,GAQX,GAAM,IAAW,AAAC,GAA4B,CACnD,GAAI,CAAC,GAAS,GAAM,MAAO,GAC3B,GAAM,CAAE,QAAO,QAAO,SAAU,EAChC,MAAO,IAAM,IAAU,GAAM,IAAU,GAAM,IDjFxC,GAAM,IAAU,MACnB,EACA,EACA,EACA,IACwB,CAC1B,GAAM,GAAe,KAAM,AAAM,IAAS,GACpC,EAAW,AAAK,GAAK,WAAY,EAAa,IAAK,GAAM,EAAa,MACtE,CAAC,EAAU,GAAY,KAAM,SAAQ,IAAI,CAC7C,GAAe,WAAY,GAC3B,GAAe,WAAY,KAEvB,EAAW,GAAe,KAC5B,AAAK,GAAK,WAAY,EAAa,GAAO,KAAM,AAAK,IAAK,IAC1D,OAEE,EAAgB,CAAE,WAAU,WAAU,WAAU,YAChD,CAAE,MAAK,QAAS,KAAM,AAAM,IAAS,GAC3C,MAAO,CACL,MACA,SAAU,EAAS,IACnB,SAAU,EAAS,IACnB,OACA,OAAQ,GACR,SAAU,IAID,GAAU,MACnB,EACA,EACA,IACwB,CAC1B,GAAM,GAAe,KAAM,AAAM,IAAQ,KAAM,IAAqB,IAC9D,EAAW,AAAK,GAAK,WAAY,EAAa,IAAK,GAAM,EAAa,MACtE,EAAW,KAAM,IAAe,WAAY,GAC5C,EAAW,GAAe,KAC5B,AAAK,GAAK,WAAY,EAAa,GAAO,KAAM,AAAK,IAAK,IAC1D,OAEE,EAAgB,CAAE,WAAU,WAAU,YACtC,CAAE,MAAK,QAAS,KAAM,AAAM,IAAS,GAC3C,MAAO,CACL,MACA,SAAU,EAAS,IACnB,SAAU,EAAS,IACnB,OACA,OAAQ,GACR,SAAU,KAID,GAAiB,MAAO,EAAc,IAAoC,CACrF,GAAM,CAAE,MAAK,QAAS,KAAM,AAAK,IAAQ,IAAI,EAAK,MAClD,MAAO,AAAK,IAAK,EAAM,EAAK,GAAM,IAGvB,GAAM,KAAO,IAA2C,CACnE,GAAM,GAAQ,KAAM,AAAM,IAAS,GAC7B,EAAW,KAAM,IAAiB,EAAO,WAAkB,IAC3D,EAAW,EAAS,OACtB,OACA,KAAM,IAAiB,EAAO,WAAkB,IAE9C,EAAW,EAAM,UAAa,KAAO,KAC3C,GAAI,CAAC,AAAM,GAAM,GAAW,KAAM,IAAI,OAAM,2BAE5C,GAAM,GAAW,EAAM,UAAa,KAAO,OAC3C,MAAO,CAAE,WAAU,WAAU,WAAU,aAG5B,GAAW,MACtB,EACA,IACqB,CACrB,GAAI,GAAS,GAAa,CACxB,GAAM,GAAQ,KAAM,AAAM,IAAS,GACnC,MAAO,IAAkB,EAAO,GAGlC,MAAO,IAAkB,EAAY,IAG1B,GAAoB,MAC/B,EACA,IACqB,CACrB,GAAM,GAAU,EAAM,IAAO,IAC7B,MAAK,GAEE,AAAK,GAAQ,aAAa,EAAS,MAFrB,MAIV,GAAmB,MAC9B,EACA,EACA,EACA,EAAY,KACG,CACf,GAAM,GAAM,KAAM,IAAS,EAAY,GACvC,MAAO,IAAW,EAAK,EAAM,EAAS,IAG3B,GAAa,CAAI,EAAU,EAAc,EAAiC,EAAY,KAAa,CAC9G,GAAG,CAAC,GAAQ,GAAK,CACf,GAAG,EAAW,MAAO,GACrB,KAAM,IAAI,OAAM,gCAAgC,KAElD,GAAG,EAAQ,GACT,MAAO,GAET,KAAM,IAAI,OAAM,sCAAsC,MAGxD,kBAA2C,EAA2C,CACpF,GAAI,YAAmB,YACrB,MAAO,GAET,GAAI,MAAO,OAAS,aAAe,YAAmB,MACpD,MAAO,MAAM,IAAK,SAAS,GAG7B,GAAM,GAAU,GAAI,aAEpB,GAAI,MAAO,IAAY,SACrB,MAAO,GAAQ,OAAO,GAGxB,GAAM,GAAO,KAAK,UAAU,GAC5B,MAAO,GAAQ,OAAO,GEhJxB,8MCIO,GAAM,IAAkB,AAAC,GACvB,GAAkB,IAAQ,GAAkB,GAGxC,GAAoB,AAAC,GACzB,GAAS,IACX,AAAM,GAAW,EAAI,WACrB,EAAI,SAAS,QACb,GAAS,EAAI,MACb,AAAM,GAAM,EAAI,SAGV,GAAoB,AAAC,GACzB,GAAS,IACX,AAAM,GAAW,EAAI,WACrB,EAAI,SAAS,SAAW,IACxB,GAAM,EAAI,WACV,GAAe,EAAI,QACnB,GAAkB,EAAI,UAGhB,GAAgB,AAAC,GACrB,AAAM,GAAW,IACnB,GAAU,EAAY,MACtB,GAAU,EAAY,SAGhB,GAAiB,AAAC,GACtB,GAAS,IACX,OAAO,OAAO,GAAK,MAAM,IAGnB,GAAoB,AAAC,GACzB,GAAS,IACX,OAAO,OAAO,GAAK,MAAM,IAGnB,GAAwB,AAAC,GAC7B,GAAS,IACX,AAAM,GAAM,EAAI,MAChB,GAAS,EAAI,MACb,GAAkB,EAAI,aC7C7B,OAA4B,SAO5B,GAAM,IAAc,KACd,GAAa,GACb,GAAuB,IAsBhB,GAAa,KAAO,IAAyC,CACxE,GAAM,GAAQ,IAAI,OAAO,GAAY,GACrC,MAAO,IAAU,EAAO,IAIb,GAAY,MAAO,EAA4B,IAA4C,CACtG,GAAM,GAAS,GAAQ,GACjB,EAAO,KAAM,AAAO,IAAK,UAAU,GACzC,SAAO,IAAI,GACH,KAAM,IAAM,IAIT,GAAc,MAAO,EAA4B,EAAa,IACjE,KAAM,IAAU,EAAY,GAAG,IAAW,KAIvC,GAAgB,KAAO,IAA6D,CAC/F,GAAM,GAAY,KAAM,IAAe,GAAQ,IAC/C,MAAO,IAAO,IAIH,GAAS,KAAO,IAA8C,CACzE,GAAM,GAAc,GAAI,YAAW,EAAO,WACpC,EAAO,KAAM,AAAO,IAAK,OAAO,GACtC,MAAQ,AAAI,IAAU,IAUxB,GAAM,IAAiB,MAAO,EAAqB,EAAY,KAA+C,CAC5G,GAAG,EAAY,EAAO,UAAU,WAAa,EAC3C,KAAM,IAAI,OAAM,wCAGlB,GAAG,AADU,GAAU,IACZ,EACT,MAAO,GAMT,GAAM,GAAS,EAAO,UAClB,EAAS,EACb,EAAG,CACD,GAAM,GAAO,KAAM,AAAO,IAAK,OAAO,GACtC,EAAO,IAAI,AAAI,GAAU,IACzB,EAAS,QACF,GAAU,EAAQ,EAAO,YAElC,MAAO,IAAe,EAAQ,IAI1B,GAAY,AAAC,GAAgC,CACjD,GAAM,GAAM,GAAI,aAAY,EAAO,WAC/B,EAAQ,EACZ,OAAQ,GAAE,EAAG,EAAG,EAAI,OAAQ,IAC1B,GAAS,GAAW,EAAI,IAE1B,MAAO,IAII,GAAQ,AAAC,GACb,AAAI,GAAU,EAAO,WAIjB,GAAU,AAAC,GAAgC,CACtD,GAAM,GAAM,AAAI,GAAQ,GACxB,MAAO,gBAAY,UAAU,EAAK,KAG9B,GAAY,CAAC,EAAmB,IAA+B,CACnE,GAAG,EAAK,aAAe,EAAK,WAAY,MAAO,GAC/C,GAAM,GAAO,GAAI,YAAW,GACtB,EAAO,GAAI,YAAW,GAC5B,OAAQ,GAAE,EAAG,EAAE,EAAK,OAAQ,IAC1B,GAAG,EAAK,KAAO,EAAK,GAClB,MAAO,GAGX,MAAO,IAKH,GAAa,AAAC,GAAwB,CAC1C,GAAM,GAAI,EAAQ,IAAO,EAAK,YACxB,EAAK,GAAI,WAAgB,IAAK,EAAK,WACzC,MAAS,GAAK,IAAK,GAAK,WAAa,UAAc,IFvH9C,GAAM,IAAU,MAAO,EAAY,EAAqB,IAA2C,CACxG,GAAM,CAAE,MAAK,QAAS,KAAM,AAAM,IAAiB,EAAM,GACnD,EAAS,KAAM,AAAW,IAAY,EAAK,eAAgB,EAAK,EAAK,UACrE,EAAO,KAAM,AAAW,IAAc,GAI5C,GAHA,KAAM,GAAK,IAAI,EAAM,GAGjB,AAAM,GAAkB,GAAO,CACjC,GAAM,GAAoB,KAAM,AAAW,IAAU,EAAK,eAAgB,EAAK,KACzE,EAAgB,KAAM,AAAW,IAAY,EAAmB,EAAK,IAAK,EAAK,UAC/E,EAAc,KAAM,AAAW,IAAc,GACnD,KAAM,GAAK,IAAI,EAAa,EAAK,SAGnC,GAAM,CAAC,EAAU,GAAU,AAAM,GAAkB,GAAQ,CAAC,GAAI,IAAQ,CAAC,EAAK,SAAU,IACxF,MAAO,CAAE,MAAK,OAAM,MAAK,OAAM,SAAQ,aAG5B,GAAW,MAAO,EAAU,IAAwC,CAC/E,GAAM,GAAU,KAAM,AAAK,IAAQ,aAAa,EAAK,GACrD,GAAI,CAAC,AAAM,GAAgB,GACzB,KAAM,IAAI,OAAM,8CAA8C,KAEhE,MAAO,IAGI,GAAY,MAAO,EAAY,EAAmB,IAA+C,CAC5G,GAAM,GAAM,KAAM,GAAK,IAAI,GAC3B,MAAI,KAAQ,KAAa,KAClB,GAAS,EAAK,IAGV,GAAW,MAAO,EAAU,IAChC,KAAM,IAAS,EAAK,GAGhB,GAAkB,MAAO,EAAY,EAAmB,IAA+C,CAClH,GAAM,GAAM,KAAM,GAAK,IAAI,GAC3B,MAAI,KAAQ,KAAa,KAClB,GAAe,EAAM,EAAK,IAGtB,GAAiB,MAAO,EAAY,EAAU,IAAwC,CACjG,GAAM,GAAO,KAAM,IAAS,EAAK,GAC3B,EAAS,KAAM,IAAmB,EAAM,EAAK,eAAgB,EAAK,EAAK,UAC7E,MAAO,IAAQ,IACX,KAAM,IAAS,GAAQ,IAAK,GAC5B,GAGO,GAA4B,MAAM,EAAY,EAA0B,IAA8C,CACjI,GAAM,GAAiB,KAAM,AAAW,IAAY,EAAU,EAAK,GAC7D,EAAO,KAAM,AAAW,IAAc,GAC5C,MAAO,IAAgB,EAAM,EAAM,IAGxB,GAAqB,MAAO,EAAY,EAA0B,EAAa,IAAwD,CAElJ,GAAI,GAAa,EAAmB,EAAa,KAC7C,EAAI,EACJ,EAAgC,KAEpC,KAAO,IAAe,MAAM,CAC1B,GAAM,GAAU,EAAoB,KAAK,IAAI,EAAG,GAC1C,EAAe,KAAM,IAAY,EAAM,EAAU,EAAK,GAE5D,AAAI,IAAiB,KACnB,GAAe,EACf,EAAa,GAEb,EAAa,EAGf,IAIF,KAAO,EAAc,EAAa,GAAI,CACpC,GAAM,GAAW,KAAK,MAAO,GAAa,GAAc,GAClD,EAAe,KAAM,IAAY,EAAM,EAAU,EAAK,GAE5D,AAAI,IAAiB,KACnB,GAAe,EACf,EAAa,GAEb,EAAa,EAIjB,MAAO,IAGI,GAAc,MAAO,EAAY,EAA0B,EAAa,IAA+C,CAClI,GAAM,GAAS,KAAM,AAAW,IAAY,EAAU,EAAK,GACrD,EAAO,KAAM,AAAW,IAAc,GACtC,EAAM,KAAM,GAAK,IAAI,GAC3B,MAAO,GAAM,CAAE,MAAK,OAAM,OAAQ,GAAa,MGpG1C,YAAwC,CAI7C,YAAY,EAAsB,CAChC,KAAK,QAAU,OAGX,MAAoB,CACxB,GAAM,CAAE,OAAQ,KAAM,MAAK,cAC3B,MAAO,QAGH,eAAc,EAAqC,CACvD,YAAK,QAAU,EACR,OAOJ,GAAQ,GCvBR,oBAAuB,GAAS,OAE9B,QAAO,EAAgC,CAC5C,MAAO,IAAI,IAAS,eAGT,SAAQ,EAA6B,CAChD,GAAM,GAAU,KAAM,AAAS,IAAM,QAAQ,GAC7C,MAAO,IAAI,IAAS,SAGf,YAAY,EAA2B,CAC5C,MAAO,IAAS,IAAQ,EAAI,UAAY,YAGpC,MAAoB,CACxB,GAAM,CAAE,OAAQ,KAAM,MAAK,cAC3B,MAAO,QAGH,cAAkC,CACtC,MAAO,AAAS,IAAM,QAAQ,KAAM,AAAS,IAAI,qBAAqB,KAAK,YAKxE,GAAQ,GCtBf,YAAkD,CAIhD,YAAY,EAAiB,CAC3B,KAAK,QAAU,OAGX,MAAoB,CACxB,GAAM,CAAE,OAAQ,KAAM,MAAK,cAC3B,MAAO,QAGH,IAAG,EAAgC,CACvC,GAAM,GAAM,KAAM,MAAK,IAAI,GAC3B,GAAI,IAAQ,KACV,KAAM,IAAI,OAAM,uBACX,GAAI,AAAM,GAAO,GACtB,KAAM,IAAI,OAAM,uBAElB,MAAO,GAAI,gBAGP,KAAI,EAAkC,CAC1C,GAAM,GAAO,KAAM,MAAK,IAAI,GAC5B,GAAI,IAAS,KACX,KAAM,IAAI,OAAM,uBACX,GAAI,CAAC,AAAM,GAAO,GACvB,KAAM,IAAI,OAAM,6BAElB,MAAO,GAAK,aAGR,OAAM,EAA2B,CACrC,MAAO,MAAK,aAAa,EAAM,IAAM,KAAK,YAGtC,cAAa,EAAY,EAAgD,CAC7E,GAAM,CAAE,KAAS,GAAa,EAE9B,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,uBAGlB,GAAM,GAAQ,KAAM,MAAK,uBAAuB,EAAM,GAEtD,GAAI,AAAM,GAAO,GACf,KAAM,IAAI,OAAM,yCAAyC,AAAQ,GAAI,MAGvE,MAAI,GAAS,QACX,KAAM,GAAM,aAAa,EAAU,IAAM,KAAK,kBAAkB,EAAO,EAAM,IAGxE,UAGH,KAAI,EAAY,EAAqC,CACzD,YAAM,MAAK,WAAW,EAAM,EAAS,IAAM,KAAK,OACzC,UAGH,YAAW,EAAY,EAAsB,EAAgD,CACjG,GAAM,CAAE,KAAS,GAAa,EAE9B,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,uBAGlB,GAAI,EAAS,SAAW,EACtB,KAAM,MAAK,wBAAwB,EAAS,EAAM,OAE7C,CACL,GAAM,GAAQ,KAAM,MAAK,uBAAuB,EAAM,GACtD,GAAI,AAAM,GAAO,GACf,KAAM,IAAI,OAAM,yCAAyC,AAAQ,GAAI,MAEvE,KAAM,GAAM,WAAW,EAAU,EAAS,SAAY,CACpD,KAAM,MAAK,kBAAkB,EAAO,EAAM,KAK9C,MAAO,WAGH,IAAG,EAA2B,CAClC,YAAM,MAAK,UAAU,EAAM,IAAM,KAAK,OAC/B,UAGH,WAAU,EAAY,EAAgD,CAC1E,GAAM,CAAE,KAAS,GAAa,EAE9B,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,uBAGlB,GAAI,EAAS,SAAW,EACtB,KAAK,kBAAkB,GACvB,GAAY,KAAM,SAEb,CACL,GAAM,GAAQ,KAAM,MAAK,eAAe,GACxC,GAAI,IAAU,KACZ,KAAM,IAAI,OAAM,gCACX,GAAG,AAAM,GAAO,GACrB,KAAM,IAAI,OAAM,yCAAyC,AAAQ,GAAI,MAEvE,KAAM,GAAM,UAAU,EAAU,SAAY,CAC1C,KAAM,MAAK,kBAAkB,EAAO,EAAM,KAK9C,MAAO,WAGH,IAAG,EAAY,EAAyB,CAC5C,GAAM,GAAO,KAAM,MAAK,IAAI,GAC5B,GAAI,IAAS,KACX,KAAM,IAAI,OAAM,wBAAwB,AAAQ,GAAI,MAGtD,GAAI,EAAG,OAAS,EACd,KAAM,IAAI,OAAM,wBAAwB,AAAQ,GAAI,MAGtD,GAAM,GAAa,EAAG,MAAM,EAAG,IAC3B,EAAS,KAAM,MAAK,IAAI,GAE5B,GAAI,CAAC,EACH,KAAM,MAAK,MAAM,GACjB,EAAS,KAAM,MAAK,IAAI,WACf,AAAM,GAAO,GACtB,KAAM,IAAI,OAAM,6BAA6B,AAAQ,GAAI,MAG3D,YAAM,MAAK,GAAG,GACd,KAAM,CAAC,GAAG,GAAI,UAAU,OAAO,CAAC,EAAK,EAAM,IAClC,EAAI,KAAK,KAAM,IAAS,CAC7B,GAAM,GAAmB,EAAG,MAAM,EAAG,CAAE,GAAM,IACvC,EAAO,EAAiB,OAC1B,KAAM,MAAK,IAAI,GACf,KAEJ,GAAI,GAAQ,CAAC,AAAM,GAAO,GACxB,YAAM,GAAK,kBAAkB,EAAO,EAAM,MACnC,EAEP,KAAM,IAAI,OAAM,6CAGnB,QAAQ,QAAQ,IAEZ,UAGH,QAAO,EAA8B,CAEzC,MAAO,AADM,MAAM,MAAK,IAAI,KACZ,KAGlB,KAAK,EAAyC,CAC5C,MAAO,MAAK,IAAI,GAGlB,MAAM,EAAY,EAAqC,CACrD,MAAO,MAAK,IAAI,EAAM,QAGlB,wBAAuB,EAAc,EAAuD,CAChG,GAAM,GAAO,KAAM,MAAK,eAAe,GACvC,MAAO,KAAS,KACZ,EACA,KAAK,gBAAgB,EAAM,KAmB5B,GAAQ,GC9Lf,oBAAuB,GAAS,CAK9B,YAAY,EAAc,CACxB,MAAa,IACb,KAAK,MAAQ,EACb,KAAK,SAAW,eAGL,QAA2B,CACtC,MAAO,IAAI,IAAS,gBAGT,SAAQ,EAA6B,CAChD,GAAM,GAAQ,KAAM,AAAS,IAAM,SAAS,GAC5C,MAAO,IAAI,IAAS,SAGf,WAAU,EAAwB,CACvC,MAAO,IAAI,IAAS,QAGhB,iBAAgB,EAAc,EAAgD,CAClF,GAAM,GAAQ,KAAM,IAAS,QAEvB,EAAW,KAAK,SAAS,GAC/B,GAAG,EAAU,CACX,GAAG,GAAS,WAAW,GACrB,KAAM,IAAI,OAAM,sCAAsC,KAExD,MAAO,GAGT,YAAM,MAAK,kBAAkB,EAAO,EAAM,GACnC,OAGH,yBAAwB,EAAsB,EAAc,EAAoD,CACpH,GAAM,GAAW,KAAM,MAAK,eAAe,GACvC,EACJ,GAAG,IAAa,KACd,EAAO,KAAM,IAAS,OAAO,WACpB,GAAS,WAAW,GAC7B,EAAO,KAAM,GAAS,cAAc,OAEpC,MAAM,IAAI,OAAM,gDAAgD,KAElE,YAAM,MAAK,kBAAkB,EAAM,EAAM,GAClC,OAGH,cAAkC,CACtC,MAAO,AAAS,IAAM,SAAS,KAAK,YAGhC,kBAAiB,EAAiB,EAAc,EAAgD,CACpG,GAAM,GAAU,KAAM,GAAM,cAC5B,YAAK,WAAW,EAAM,GACtB,GAAY,KAAM,KACX,UAGH,mBAAkB,EAAoB,EAAc,EAAgD,CACxG,YAAK,SAAS,GAAQ,EACf,KAAK,iBAAiB,EAAO,EAAM,GAG5C,kBAAkB,EAAoB,CACpC,aAAO,MAAK,MAAM,GACf,KAAK,SAAS,IACf,MAAO,MAAK,SAAS,GAEhB,UAGH,gBAAe,EAA2C,CAC9D,GAAG,KAAK,SAAS,GACf,MAAO,MAAK,SAAS,GAGvB,GAAM,GAAO,KAAK,MAAM,IAAS,KACjC,GAAG,IAAS,KAAM,MAAO,MACzB,GAAM,GAAQ,EAAK,OACf,KAAM,IAAS,QAAQ,EAAK,KAC5B,KAAM,IAAS,QAAQ,EAAK,KAGhC,MAAG,MAAK,SAAS,GACR,KAAK,SAAS,GAGvB,MAAK,SAAS,GAAQ,EACf,QAIH,KAAI,EAAyC,CACjD,GAAM,CAAE,KAAS,GAAa,EAE9B,GAAI,CAAC,EAAM,MAAO,MAClB,GAAM,GAAW,KAAM,MAAK,eAAe,GAE3C,GAAK,EAAS,QAEP,GAAI,IAAa,MAAQ,AAAM,GAAO,GAC3C,MAAO,UAFP,OAAO,GAKT,MAAO,GAAS,IAAI,GAGtB,WAAW,EAAc,EAAyB,CAChD,GAAM,CAAE,MAAK,OAAM,UAAW,EAC9B,YAAK,MAAM,GAAQ,AAAK,GAAK,EAAM,EAAK,EAAQ,GACzC,KAGT,UAAsB,CACpB,MAAO,MAAK,QAKT,GAAQ,GCtIf,GAAM,IAAU,CACd,IAAK,GAAM,IAAK,GAAM,IAAK,GAAM,IAAK,GAAM,IAAK,GAAM,IAAK,GAAM,IAAK,GAAM,IAAK,GAClF,IAAK,GAAM,IAAK,GAAM,EAAK,GAAM,EAAK,GAAM,EAAK,GAAM,EAAK,GAAM,EAAK,GAAM,EAAK,IAE9E,GAAW,AAAC,GAAyB,GAAQ,KAAS,GAY5D,QAA8C,CAK5C,YAAY,EAAoB,CAC9B,KAAK,MAAQ,EACb,KAAK,SAAW,SAGX,SAAe,CACpB,MAAO,IAAI,IAAK,gBAGL,SAAQ,EAAyB,CAC5C,GAAM,GAAQ,KAAM,AAAM,IAAe,GACzC,MAAO,IAAI,IAAK,QAGZ,cAAkC,CACtC,MAAO,AAAM,IAAS,KAAK,YAGvB,MAAoB,CACxB,GAAM,CAAE,OAAQ,KAAM,MAAK,cAC3B,MAAO,QAGH,KAAI,EAAc,EAA2B,CACjD,GAAI,CAAC,GAAS,EAAK,IACjB,KAAM,IAAI,OAAM,yCAElB,GAAM,GAAgB,KAAK,sBAAsB,GAGjD,GAAI,IAAS,EAKR,GAAI,IAAkB,KACzB,KAAK,MAAM,GAAQ,AAAK,GAAK,EAAM,EAAO,GAAM,WAIzC,EAAc,SAAW,EAEhC,KAAM,AADW,MAAM,MAAK,eAAe,IAC5B,IAAI,EAAK,MAAM,GAAI,GAClC,KAAM,MAAK,sBAAsB,OAI9B,CACH,GAAM,GAAU,KAAK,cAAc,EAAK,IAClC,EAAU,KAAK,MAAM,GAAe,IAC1C,KAAK,YAAY,GACjB,KAAM,SAAQ,IAAI,CAChB,EAAQ,IAAI,EAAK,MAAM,GAAI,GAC3B,EAAQ,IAAI,EAAc,MAAM,GAAI,KAEtC,KAAM,MAAK,sBAAsB,EAAK,UAIpC,uBAAsB,EAA6B,CACvD,GAAM,GAAY,KAAK,MAAM,IAAO,IAC9B,CAAE,MAAK,QAAS,KAAM,MAAK,SAAS,GAAM,cAC1C,EAAS,KAAK,MAAM,IAAO,IAEjC,GAAI,GAAa,EAIf,MAAO,MAAM,MAAK,sBAAsB,GAG1C,KAAK,MAAM,GAAQ,AAAK,GAAK,EAAM,EAAK,GAAO,GAGjD,cAAc,EAAoB,CAChC,GAAM,GAAO,GAAK,SAClB,YAAK,SAAS,GAAQ,EACf,OAGH,KAAI,EAAmC,CAC3C,GAAM,GAAW,KAAK,aAAa,GACnC,MAAI,KAAa,KAAa,KAE1B,EAAS,OAAS,EACb,KAAK,MAAM,GAAU,IAGvB,AADU,MAAM,MAAK,eAAe,IAC3B,IAAI,EAAK,MAAM,SAG3B,QAAO,EAAgC,CAC3C,MAAQ,MAAM,MAAK,IAAI,KAAW,UAG9B,UAAkC,CActC,MAAO,AAbU,MAAM,SAAQ,IAC7B,OAAO,OAAO,KAAK,OAAO,IAAI,MAAO,CAAE,OAAM,SACvC,EAAK,OAAS,EACT,CAAC,CAAE,OAAM,QAIX,AADc,MAAM,AADb,MAAM,IAAK,QAAQ,IACA,WACb,IAAI,GAAQ,KAC3B,EACH,KAAM,EAAO,EAAI,WAIP,OAAO,CAAC,EAAK,IAAQ,EAAI,OAAO,SAGpC,gBAAe,EAA6B,CACxD,GAAI,KAAK,SAAS,GAChB,MAAO,MAAK,SAAS,GAGvB,GAAM,GAAQ,KAAM,IAAK,QAAQ,KAAK,MAAM,GAAM,KAElD,MAAI,MAAK,SAAS,GACT,KAAK,SAAS,GAGvB,MAAK,SAAS,GAAQ,EACf,GAGD,YAAY,EAAoB,CACtC,MAAO,MAAK,MAAM,GACd,KAAK,SAAS,IAChB,MAAO,MAAK,SAAS,GAIjB,kBAAkB,EAAuB,CAC/C,MAAO,MAAK,MAAM,KAAU,QAAa,KAAK,SAAS,KAAU,OAG3D,aAAa,EAA6B,CAChD,MAAI,MAAK,kBAAkB,EAAK,IACvB,EAAK,GACH,KAAK,kBAAkB,GACzB,EAEF,KAGD,sBAAsB,EAA6B,CACzD,GAAM,GAAS,EAAK,GACpB,MAAI,MAAK,kBAAkB,GAClB,EAEF,OAAO,KAAK,KAAK,OAAO,KAAK,GAAS,IAAW,EAAM,KAAO,OClKzE,YAAmC,CAEjC,YAAqB,EAAY,CAAZ,YAOrB,KAAK,EAAgB,GAA0B,CAC7C,GAAM,GAAS,KAAK,IAAI,KAAK,IAAI,EAAO,KAExC,MAAO,OAAM,KAAK,CAAE,UAAU,CAAC,EAAG,IAAM,GAAG,OACzC,AAAC,GAAkC,EAAQ,KACzC,AAAC,GAAmB,EAAI,GAAc,oBAAoB,GAAK,MAEjE,QAAQ,QAAQ,KAAK,YAWnB,OAAM,EAAyC,CACnD,MAAO,IAAc,OAAO,KAAK,KAAM,QAMnC,MAAK,EAAiB,EAAyD,CACnF,GAAM,CAAE,OAAQ,KAAM,OAAM,KAAK,CAAE,OAAQ,GAAU,CAAC,EAAG,IAAM,GAAG,OAChE,CAAC,EAAS,IAAM,EAAQ,KAAK,CAAC,CAAE,OAAM,SAC/B,EAEE,GACJ,oBAAoB,GACpB,KAAK,GAAM,EACV,KAAM,EACN,IAAK,CACH,GAAG,EACH,CAAE,MAAO,CAAE,GAAI,GAAI,UAAW,EAAK,OAAO,SAAS,SAAS,WARhD,QAAQ,QAAQ,CAAE,KAAM,KAAM,SAYlD,GACG,oBAAoB,KAAK,MACzB,KAAK,GACJ,EAAE,KAAM,EAAG,IAAK,OAOtB,MAAO,eAMI,qBAAoB,EAAkC,CACjE,MAAK,GAAK,OAAO,SACV,EAAK,YAAY,QAAQ,EAAK,OAAO,UADV,QAAQ,QAAQ,kBAOvC,QAAO,EAAY,EAAyC,CACvE,GAAI,EAAK,OAAO,SAAS,SAAS,MAAQ,EAAW,MAAO,GAC5D,GAAM,GAAW,KAAM,IAAc,oBAAoB,GACzD,MAAO,GAAW,GAAc,OAAO,EAAU,GAAa,OC3E3D,oBAAyB,GAAS,CAMvC,YAAY,CAAE,UAAS,SAAQ,OAA0B,CACvD,MAAM,GAEN,KAAK,IAAM,EACX,KAAK,OAAS,EACd,KAAK,QAAU,GAAI,IAAc,YAG5B,YAAW,EAAiC,CACjD,MAAO,IAAS,IACX,EAAI,UAAY,QAChB,AAAM,GAAa,EAAI,oBAGjB,QAAO,EAA2C,CAC7D,MAAO,IAAI,IAAW,CACpB,UACA,OAAQ,CAAE,SAAU,AAAS,GAAM,KACnC,IAAK,mBAII,SAAQ,EAA+B,CAClD,GAAM,GAAO,KAAM,AAAS,IAAI,IAAI,GACpC,MAAO,IAAW,SAAS,EAAM,eAGtB,UAAS,EAAgB,EAA+B,CACnE,GAAM,CAAE,WAAU,WAAU,YAAa,EACnC,EAAU,KAAM,AAAS,IAAM,QAAQ,GAC7C,MAAO,IAAI,IAAW,CACpB,UACA,OAAQ,CAAE,WAAU,YACpB,aAIE,cAAmC,CACvC,GAAM,GAAU,KAAM,AAAS,IAAI,QACjC,KAAK,QACL,AAAS,GAAY,KAAK,OAAO,UACjC,KAAK,KAEP,YAAK,IAAM,EAAQ,IACZ,IAKJ,GAAQ,GCpER,GAAM,IAAU,CAAC,EAAoB,IAA4C,CACtF,GAAM,GAAO,EAAK,GACZ,EAAQ,EAAS,IAAS,KAC1B,EAAW,GAAa,GAC9B,MAAG,KAAU,MAAQ,IAAa,KACzB,EAEA,GAAQ,EAAM,YAAa,IAKtC,YAAsB,EAA0C,CAC9D,GAAM,GAAO,EAAM,MAAM,GACzB,MAAI,GAAK,OAAS,EACT,KAEF,ECQF,oBAAyB,GAAS,CAQvC,YAAY,CAAE,QAAO,SAAQ,OAA0B,CACrD,MAAM,EAAO,SAAS,SAEtB,KAAK,SAAW,GAChB,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,OAAS,EACd,KAAK,QAAU,GAAI,IAAc,kBAGtB,QAA8B,CACzC,MAAO,IAAI,IAAW,CACpB,MAAO,GACP,OAAQ,CACN,SAAU,AAAS,GAAM,IACzB,SAAU,IAEZ,IAAK,mBAII,SAAS,EAA+B,CACnD,GAAM,GAAO,KAAM,AAAS,IAAI,IAAI,GACpC,GAAG,CAAC,AAAM,GAAW,GACnB,KAAM,IAAI,OAAM,2CAA2C,KAE7D,MAAO,IAAW,SAAS,EAAM,eAGtB,UAAS,EAAgB,EAA+B,CACnE,GAAM,CAAE,WAAU,WAAU,WAAU,YAAa,EAC7C,EAAQ,KAAM,AAAS,IAAM,SAAS,GAC5C,MAAO,IAAI,IAAW,CACpB,QACA,OAAQ,CAAE,WAAU,WAAU,YAC9B,cAIG,YAAW,EAA6B,CAC7C,MAAO,AAAM,IAAQ,EAAI,QAAU,AAAM,GAAa,EAAI,aAGtD,iBAAgB,EAAc,EAAsD,CACxF,GAAM,GAAQ,KAAM,IAAW,QAEzB,EAAW,KAAK,SAAS,GAC/B,GAAI,EAAU,CACZ,GAAI,GAAW,WAAW,GACxB,KAAM,IAAI,OAAM,sCAAsC,KACjD,GAAK,GAAW,WAAW,GAGhC,MAAO,GAFP,KAAM,IAAI,OAAM,wCAAwC,KAM5D,YAAM,MAAK,kBAAkB,EAAO,EAAM,GACnC,OAGH,yBAAwB,EAAsB,EAAc,EAAsD,CACtH,GAAM,GAAW,KAAM,MAAK,eAAe,GACvC,EACJ,GAAG,IAAa,KACd,EAAO,KAAM,IAAW,OAAO,WACtB,GAAW,WAAW,GAC/B,EAAO,KAAM,GAAS,cAAc,OAEpC,MAAM,IAAI,OAAM,gDAAgD,KAElE,YAAM,MAAK,kBAAkB,EAAM,EAAM,GAClC,OAGH,cAAmC,CACvC,GAAM,GAAU,KAAM,AAAS,IAAI,QACjC,KAAK,MACL,KAAK,OAAO,SACZ,KAAK,OAAO,SACZ,KAAK,KAEP,YAAK,OAAO,SAAW,KAAK,KAAO,OACnC,KAAK,IAAM,EAAQ,IACZ,OAGH,mBAAkB,EAAgC,EAAc,EAAgD,CACpH,KAAK,SAAS,GAAQ,EACtB,GAAM,GAAU,KAAM,GAAM,cAC5B,YAAK,WAAW,EAAM,GACtB,GAAY,KAAM,KACX,KAGT,kBAAkB,EAAoB,CACpC,aAAO,MAAK,MAAM,GAClB,MAAO,MAAK,OAAO,SAAS,GACzB,KAAK,SAAS,IACf,MAAO,MAAK,SAAS,GAEhB,UAGH,gBAAe,EAAqC,CACxD,GAAG,KAAK,SAAS,GACf,MAAO,MAAK,SAAS,GAGvB,GAAM,GAAY,KAAK,OAAO,SAAS,IAAS,KAChD,GAAG,IAAc,KAAM,MAAO,MAC9B,GAAM,GAAQ,EAAU,OACpB,KAAM,IAAW,QAAQ,EAAU,KACnC,KAAM,IAAW,QAAQ,EAAU,KAGvC,MAAG,MAAK,SAAS,GACR,KAAK,SAAS,GAGvB,MAAK,SAAS,GAAQ,EACf,QAGH,KAAI,EAAmC,CAC3C,GAAI,EAAK,OAAS,EAAG,MAAO,MAE5B,GAAM,GAAe,AAAS,GAAQ,KAAK,OAAO,SAAU,GAC5D,GAAI,IAAiB,KAAM,MAAO,MAElC,GAAM,GAAO,KAAM,AAAS,IAAI,IAAI,EAAa,KACjD,MAAO,AAAM,IAAW,GACpB,GAAW,SAAS,EAAM,EAAa,KACvC,GAAW,SAAS,EAAM,EAAa,KAG7C,UAAkB,CAEhB,MAAO,QAAO,OAAO,KAAK,OAAO,OAAO,CAAC,EAAK,IACrC,KACF,GACF,EAAI,MAAO,IACP,EACH,OAAQ,KAAK,OAAO,SAAS,EAAI,OAAO,UAG3C,IAGL,WAAW,EAAc,EAA0B,CACjD,GAAM,CAAE,MAAK,WAAU,WAAU,OAAM,SAAQ,YAAa,EAC5D,YAAK,MAAM,GAAQ,AAAK,GAAK,EAAM,EAAK,GAAO,GAC/C,KAAK,OAAO,SAAS,GAAQ,CAC3B,MACA,WACA,WACA,YAAa,EACb,UAEF,KAAK,OAAO,SAAS,SAAS,MAAQ,KAAK,MACpC,OAKJ,GAAQ,GCpLf,YAAoC,CAElC,YAAqB,EAAY,CAAZ,iBAOf,MAAK,EAAgB,GAA0B,CACnD,GAAM,GAAI,KAAK,IAAI,EAAO,IACpB,EAAW,KAAK,KAAK,QAAQ,SACnC,MAAQ,IAAY,KAAM,MAAK,aAAa,EAAW,IAAO,UAc1D,OAAM,EAAyC,CACnD,MAAI,MAAK,KAAK,OAAO,SAAS,SAAS,MAAQ,EACtC,KAAK,KAEL,KAAK,OAAO,KAAK,KAAK,OAAO,SAAW,EAAG,QAOhD,MAAK,EAAiB,EAAyD,CACnF,GAAM,GAAM,KAAK,KAAK,OAAO,SAE7B,MAAO,SAAQ,IACb,MAAM,KAAK,CAAE,OAAQ,GAAU,CAAC,EAAG,IAAM,CACvC,GAAM,GAAI,EAAI,EACd,MAAO,MAAK,2BAA2B,EAAM,GAAG,KAAK,GAAS,EAC5D,aAAc,EACd,MAAO,CAAC,QAGZ,KACA,GAAQ,EAAK,OAAO,GAAK,CAAC,CAAC,EAAE,eAC7B,KACA,GAAQ,EAAK,IAAI,GAAK,CACpB,GAAM,GAAQ,EAAE,aAAa,SAAS,SAAS,MAC/C,MAAO,CAAE,MAAO,EAAE,MAAO,UAAW,WAQpC,cAAa,EAAwC,CACzD,GAAM,GAAO,KAAM,MAAK,2BAA2B,GACnD,MAAO,IAAQ,KAAM,MAAK,KAAK,YAAY,SACzC,KAAK,KAAK,KACV,KAAK,KAAK,IACV,GAOJ,iBAAiB,EAA4C,CAC3D,MAAO,AAAS,IAAK,SAAS,EAAS,IAAK,KAAK,KAAK,UAMlD,4BAA2B,EAAiD,CAChF,GAAM,CAAE,MAAK,QAAS,KAAK,KACrB,CAAE,kBAAmB,KAAK,KAAK,OAE/B,EAAI,KAAM,AAAS,IAAK,YAAY,EAAM,EAAgB,EAAK,GACrE,MAAO,IAAK,KAAK,iBAAiB,QAM9B,QAAO,EAAkB,EAAyC,CACtE,GAAM,GAAO,KAAM,MAAK,2BAA2B,GACnD,MAAK,IAAM,SAEP,EAAK,SAAS,SAAS,MAAQ,EAC1B,KAAK,aAAa,EAAK,UAEvB,KAAK,OAAO,EAAK,SAAW,EAAG,GALZ,OC3FzB,oBAA0B,GAAS,CAOxC,YAAY,CAAE,UAAS,OAAM,MAAK,UAA6B,CAC7D,MAAM,GAEN,KAAK,OAAS,EACd,KAAK,QAAU,GAAI,IAAe,MAClC,KAAK,IAAM,EACX,KAAK,KAAO,QAGP,YAAW,EAA8B,CAC9C,MAAO,IAAS,IACX,EAAI,UAAY,QAChB,EAAI,OAAS,QACb,AAAM,GAAkB,EAAI,oBAGtB,QAAO,EAAY,EAAsB,EAAmC,EAAmC,CAC1H,GAAM,GAAiB,KAAM,AAAW,IAAU,EAAkB,GAC9D,EAAa,KAAM,AAAO,IAAI,YAC9B,EAAc,KAAM,AAAS,IAAM,iBAAiB,EAAS,GACnE,MAAO,IAAI,IAAY,CACrB,UACA,OACA,MACA,OAAQ,CACN,iBACA,IAAK,EACL,SAAU,EACV,SAAU,AAAS,GAAM,IACzB,QAAS,EAAY,mBAKd,oBAAmB,EAAY,EAAgC,EAAmC,CAC7G,GAAM,GAAO,KAAM,AAAS,IAAK,0BAA0B,EAAM,EAAgB,GACjF,MAAO,MAAK,SAAS,EAAM,EAAK,eAGrB,gBAAe,EAAY,EAAmB,EAAmC,CAC5F,GAAM,GAAO,KAAM,AAAS,IAAK,gBAAgB,EAAM,EAAM,GAC7D,MAAO,IAAY,SAAS,EAAM,EAAK,eAG5B,UAAS,EAAY,EAAmB,EAAmC,CACtF,GAAM,GAAO,KAAM,AAAS,IAAK,UAAU,EAAM,EAAM,GACvD,MAAO,IAAY,SAAS,EAAM,EAAK,eAG5B,UAAS,EAAY,EAAa,EAAkD,CAC/F,GAAI,CAAC,AAAM,GAAkB,GAC3B,KAAM,IAAI,OAAM,4DAGlB,GAAM,GAAU,KAAM,AAAS,IAAM,iBAAiB,EAAK,QAAS,EAAK,KACzE,MAAO,IAAI,IAAY,CACrB,UACA,MACA,OACA,OAAQ,SAIN,UAAgC,CACpC,GAAM,CAAE,iBAAgB,YAAa,KAAK,OACpC,EAAiB,KAAM,AAAW,IAAY,EAAgB,KAAK,IAAK,GAC9E,MAAO,AAAW,IAAc,QAG5B,wBAAuB,EAAiD,CAC5E,YAAK,OAAO,eAAiB,KAAM,AAAW,IAAU,EAAkB,KAAK,OAAO,KAC/E,UAGH,eAAc,EAAqC,CACvD,GAAM,GAAc,KAAM,AAAS,IAAM,iBAAiB,EAAS,KAAK,OAAO,KAC/E,YAAK,QAAU,EACf,KAAK,OAAS,IACT,KAAK,OACR,SAAU,KAAK,OAAO,SAAW,EACjC,QAAS,EAAY,KAEhB,UAGH,cAAyC,CAC7C,MAAO,AAAS,IAAK,QAAQ,KAAK,KAAM,IACnC,KAAK,OACR,SAAU,AAAS,GAAY,KAAK,OAAO,WAC1C,KAAK,OAKL,GAAQ,GClGf,oBAAyC,GAAS,CAQhD,YAAY,CAAE,OAAM,MAAK,UAA6B,CACpD,MAAa,IAEb,KAAK,SAAW,GAChB,KAAK,OAAS,EACd,KAAK,QAAU,GAAI,IAAe,MAClC,KAAK,IAAM,EACX,KAAK,KAAO,QAGP,YAAW,EAA8B,CAC9C,MAAO,IAAS,IACX,EAAI,OAAS,QACb,AAAM,GAAkB,EAAI,oBAGtB,QAAO,EAAY,EAAa,EAA+D,CAC1G,GAAM,GAAiB,EACnB,KAAM,AAAW,IAAU,EAAkB,GAC7C,KAAM,AAAW,IAAW,GAChC,MAAO,IAAI,IAAY,CACrB,OACA,MACA,OAAQ,CACN,SAAU,AAAS,GAAM,IACzB,iBACA,SAAU,EACV,MAAO,GACP,SAAU,kBAKH,aAAY,EAAY,EAAmC,CACtE,GAAM,GAAiB,KAAM,AAAW,IAAW,GACnD,MAAO,MAAK,mBAAmB,EAAM,EAAgB,eAG1C,oBAAmB,EAAY,EAAgC,EAAmC,CAC7G,GAAM,GAAO,KAAM,AAAS,IAAK,0BAA0B,EAAM,EAAgB,GACjF,MAAO,MAAK,SAAS,EAAM,EAAK,eAGrB,gBAAe,EAAY,EAAmB,EAAmC,CAC5F,GAAM,GAAO,KAAM,AAAS,IAAK,gBAAgB,EAAM,EAAM,GAC7D,MAAO,MAAK,SAAS,EAAM,EAAK,eAGrB,UAAS,EAAY,EAAmB,EAAmC,CACtF,GAAM,GAAO,KAAM,AAAS,IAAK,UAAU,EAAM,EAAM,GACvD,MAAO,MAAK,SAAS,EAAM,EAAK,eAGrB,UAAS,EAAY,EAAa,EAAkD,CAC/F,GAAI,CAAC,AAAM,GAAkB,GAC3B,KAAM,IAAI,OAAM,4DAGlB,MAAO,IAAI,IAAY,CAAE,OAAM,MAAK,OAAQ,SAGxC,iBAAgB,EAAc,EAAuD,CACzF,GAAM,GAAM,KAAM,AAAO,IAAI,YACvB,EAAQ,KAAM,IAAY,OAAO,KAAK,KAAM,EAAK,KAAK,OAAO,gBAE7D,EAAW,KAAK,SAAS,GAC/B,GAAI,EAAU,CACZ,GAAI,GAAY,WAAW,GACzB,KAAM,IAAI,OAAM,sCAAsC,KAExD,MAAO,GAGT,YAAM,MAAK,kBAAkB,EAAO,EAAM,GACnC,OAGH,yBAAwB,EAAsB,EAAc,EAAsD,CACtH,GAAM,GAAW,KAAM,MAAK,eAAe,GAEvC,EACJ,GAAI,IAAa,KAAM,CACrB,GAAM,GAAM,KAAM,AAAO,IAAI,YAC7B,EAAO,KAAM,IAAY,OAAO,KAAK,KAAM,EAAS,KAAK,OAAO,eAAgB,WACvE,GAAY,WAAW,GAChC,EAAO,KAAM,GAAS,cAAc,OAEpC,MAAM,IAAI,OAAM,gDAAgD,KAElE,YAAM,MAAK,kBAAkB,EAAM,EAAM,GAClC,OAGH,cAAyC,CAE7C,GAAM,GAAW,OAAO,OAAO,GAAI,KAAK,QACxC,MAAO,AAAS,IAAK,QAAQ,KAAK,KAAM,EAAU,KAAK,UAGnD,mBAAkB,EAAkC,EAAc,EAAgD,CACtH,KAAM,GAAM,uBAAuB,KAAK,OAAO,gBAC/C,KAAK,SAAS,GAAQ,EACtB,GAAM,GAAU,KAAM,GAAM,cAC5B,YAAK,WAAW,EAAM,GACtB,GAAY,KAAM,KACX,KAGT,kBAAkB,EAAoB,CACpC,YAAK,OAAS,IACT,KAAK,OACR,SAAU,KAAK,OAAO,SAAW,EACjC,MAAO,GAAiB,KAAK,OAAO,MAAO,GAC3C,SAAU,GAAiB,KAAK,OAAO,SAAU,IAEhD,KAAK,SAAS,IACf,MAAO,MAAK,SAAS,GAEhB,UAGH,gBAAe,EAAwD,CAC3E,GAAG,KAAK,SAAS,GACf,MAAO,MAAK,SAAS,GAGvB,GAAM,GAAY,KAAK,OAAO,MAAM,GACpC,GAAG,IAAc,OAAW,MAAO,MACnC,GAAM,GAAQ,EAAU,OACpB,KAAM,IAAY,eAAe,KAAK,KAAM,EAAU,QAAS,EAAU,KACzE,KAAM,IAAY,eAAe,KAAK,KAAM,EAAU,QAAS,EAAU,KAG7E,MAAG,MAAK,SAAS,GACR,KAAK,SAAS,GAGvB,MAAK,SAAS,GAAQ,EACf,QAGH,UAAgC,CACpC,GAAM,CAAE,iBAAgB,YAAa,KAAK,OACpC,EAAiB,KAAM,AAAW,IAAY,EAAgB,KAAK,IAAK,GAC9E,MAAO,AAAW,IAAc,QAG5B,wBAAuB,EAAiD,CAC5E,YAAK,OAAO,eAAiB,KAAM,AAAW,IAAU,EAAkB,KAAK,KACxE,UAGH,KAAI,EAAuD,CAC/D,GAAI,EAAK,SAAW,EAAG,MAAO,MAE9B,GAAM,CAAC,KAAS,GAAQ,EAElB,EAAO,KAAK,OAAO,SAAS,GAClC,GAAI,IAAS,OAAW,MAAO,MAE/B,GAAM,GAAS,KAAM,MAAK,WAAW,EAAM,GAC3C,MAAI,KAAW,KAAa,KAErB,AAAM,GAAkB,EAAO,MAClC,GAAY,SAAS,KAAK,KAAM,EAAO,IAAK,EAAO,MACnD,GAAY,SAAS,KAAK,KAAM,EAAO,IAAK,EAAO,WAGnD,YAAW,EAA+B,EAAuE,CACrH,GAAM,CAAC,KAAS,GAAQ,EACxB,GAAI,IAAS,OAAW,MAAO,CAC7B,IAAK,EAAS,IACd,KAAM,KAAM,AAAS,IAAK,eAAe,KAAK,KAAM,EAAS,IAAK,EAAS,MAG7E,GAAM,GAAY,EAAS,YAAY,GACvC,GAAI,IAAc,OAChB,MAAO,MAAK,WAAW,EAAW,GAGpC,GAAM,GAAe,KAAM,AAAS,IAAK,eAAe,KAAK,KAAM,EAAS,IAAK,EAAS,KAC1F,GAAI,CAAC,AAAM,GAAkB,GAC3B,MAAO,MAGT,GAAM,GAAe,EAAa,SAAS,GAC3C,MAAO,KAAiB,OAAY,KAAO,KAAK,WAAW,EAAc,GAG3E,UAAsB,CACpB,MAAO,IAAO,KAAK,OAAO,MAAO,AAAC,GAAS,CACzC,GAAM,CAAE,SAAQ,GAAS,EACzB,MAAO,IAAK,KAIhB,WAAW,EAAc,EAAgC,CACvD,GAAM,GAAM,KAAK,MACX,CAAE,MAAK,OAAM,MAAK,SAAQ,YAAa,EACvC,EAAU,EAAO,KACvB,YAAK,OAAO,MAAM,GAAQ,CAAE,OAAM,MAAK,UAAS,OAAM,OAAQ,EAAQ,MAAO,AAAS,GAAY,IAClG,KAAK,OAAO,SAAS,GAAQ,CAAE,MAAK,MAAK,YAAa,GACtD,KAAK,OAAO,SAAW,KAAK,OAAO,SAAW,EAC9C,KAAK,OAAO,SAAS,SAAS,MAAQ,EAC/B,OClNX,YAAkD,CAUhD,YAAY,CAAE,QAAO,OAAM,aAAY,aAAY,aAAY,gBAQ5D,CACD,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,WAAa,EAElB,KAAK,WAAa,EAClB,KAAK,WAAa,EAClB,KAAK,aAAe,cAOT,OAAM,CAAE,WAAmD,CACtE,GAAM,GAAa,KAAM,IAAW,QAC9B,EAAa,KAAM,IAAS,QAC5B,EAAO,GAAK,SAGZ,EAAW,AAAQ,GAAQ,AAAQ,GAAU,AAAQ,GAAO,UAC5D,EAAW,KAAM,IAAY,OAAO,EAAM,EAAS,MACzD,KAAM,GAAS,MAGf,GAAM,GAAO,GAAI,IAAS,CACxB,MAAO,GACP,OACA,WAAY,GAEZ,aACA,aACA,aAAc,EACX,GAAW,KAKhB,YAAM,IAAS,aAAa,GAG5B,EAAK,WAAkB,IAEvB,KAAM,SAAQ,IAAI,CAChB,EAAK,eAAe,GAAO,OAAQ,GACnC,EAAK,eAAe,GAAO,OAAQ,GACnC,EAAK,eAAe,GAAO,QAAS,KAI/B,cAGI,SACX,CAAE,MAAK,eACY,CACnB,GAAM,GAAQ,KAAM,AAAS,IAAM,SAAS,GACtC,EAAO,EAAc,KAAM,IAAe,GAAe,GAGzD,EAAY,EAAM,GAAO,SAAS,KAAO,KACzC,EAAa,IAAc,KAC7B,KAAM,IAAW,QACjB,KAAM,IAAW,QAAQ,GAEvB,EAAa,EAAM,GAAO,QACT,KAAM,IAAS,QAAQ,EAAM,GAAO,QAAQ,KAC5C,KAAM,IAAS,QAGhC,EAAa,EAAM,GAAO,UAAU,KAAO,KAE7C,EAAM,EACV,AAAI,IAAe,KACjB,GAAO,KAAM,IAAK,SAClB,EAAe,IAEf,GAAO,KAAM,IAAK,QAAQ,GAC1B,EAAe,KAAM,IAAiB,EAAM,IAG9C,GAAM,GAAgB,EAAM,GAAO,aAAa,IAC1C,EAAa,EACf,KAAM,AAAK,IAAO,GACf,KAAK,GAAW,EAAQ,MAAM,IAAS,KACvC,KAAK,GAAS,EAAM,KAAK,CAAC,EAAG,KACrB,SAAS,EAAE,KAAM,IAAM,SAAS,GAAE,KAAM,MAEnD,GAcJ,MAXa,IAAI,IAAS,CACxB,QACA,OACA,aAEA,aACA,aACA,sBAWE,MAAoB,CACxB,GAAM,CAAE,OAAQ,KAAM,MAAK,cAC3B,MAAO,QAGH,cAAkC,CACtC,MAAO,AAAS,IAAM,SAAS,KAAK,OAGtC,WAAW,EAAc,EAAyB,CAChD,GAAM,CAAE,MAAK,OAAM,UAAW,EAC9B,YAAK,MAAM,GAAQ,AAAK,GAAK,EAAM,EAAK,EAAQ,GACzC,UAGH,gBAAe,EAAc,EAAmC,CACpE,MAAO,MAAK,WAAW,EAAM,KAAM,GAAS,2BAOjC,cAAa,EAAgC,CACxD,GAAM,GAAO,AAAQ,GAAU,AAAQ,GAAO,SACxC,EAAY,KAAM,AAAY,IAAQ,CAAE,SAC9C,KAAM,AAAO,IAAS,cAAc,EAAS,GAG/C,gBAAgB,EAA8D,CAC5E,MAAO,IAAgB,KAAK,aAAc,QActC,oBAAmB,EAA4B,CACnD,GAAM,GAAM,CAAC,GAAG,KAAK,YACjB,EAAM,KAAK,IAAI,EAAG,EAAI,OAAS,GAG/B,EAAY,EAAI,IAAM,IACrB,MAAM,AAAK,IAAI,EAAI,GAAK,MAAM,MAAM,KACrC,GAIJ,AAAI,AADkB,EAAU,OAAS,EAAI,GAAS,gBAEpD,GAAM,EAAM,EACZ,EAAY,IAId,GAAM,GAAY,KAAM,AAAO,IAAK,UAAU,GACxC,EAAe,CAAC,GAAG,EAAW,GAC9B,EAAsB,KAAM,AAAS,IAAM,QAC/C,EAAa,KAAK,MAGpB,EAAI,GAAO,CACT,KAAM,EAAI,WACV,IAAK,EAAoB,IACzB,KAAM,EAAoB,MAI5B,GAAM,GAAa,KAAM,AAAK,IAC5B,EAAI,IAAS,KAGf,KAAK,WAAW,GAAO,WAAY,CACjC,IAAK,EAAW,IAChB,OAAQ,GACR,KAAM,KAAM,AAAK,IAAK,EAAW,OAGnC,KAAK,WAAa,OAOd,YAAW,EAAgC,CAC/C,GAAM,GAAS,KAAM,AAAS,IAAM,QAAQ,AAAO,GAAS,IAC5D,MAAO,MAAK,WAAW,GAAO,QAAS,KA5N3C,MAwKS,AAxKT,GAwKS,eAAiB,KAiE1B,kBACE,EACA,EACgC,CAChC,GAAM,GAAmB,KAAM,AAAY,IAAe,CAAE,SACtD,EAAwC,KAAM,AAAQ,IAAQ,GACpE,GAAI,EAAgB,MAAO,GAE3B,GAAM,CAAC,EAAU,GAAQ,GAAgB,EAAK,GAC9C,GAAI,CAAC,EAAM,MAAO,MAGlB,GAAM,GAAe,AADC,AAAQ,GAAO,GACF,MAAM,AAAQ,GAAO,GAAU,QAElE,MAAI,IAAY,WAAW,GAClB,EAAa,SAAW,EAAI,EAAK,OAAO,eAAiB,KAG7D,GAAK,OAAO,IACf,CAAI,AAAQ,GAAY,GAAO,KAAM,GAAK,MAAM,GAC3C,KAAM,GAAK,IAAI,EAAc,KAG7B,EAAK,IAAI,GAAc,KAAK,GAAK,EAAI,EAAE,OAAO,eAAiB,OAGxE,YACE,EACA,EACuC,CACvC,GAAM,GAAI,EAAI,AAAQ,GAAQ,IAC9B,GAAI,EAAG,MAAO,CAAE,EAAM,GAEtB,GAAM,GAAS,AAAQ,GAAO,GAE9B,MAAO,GACH,GAAgB,EAAK,GACrB,CAAE,EAAM,MAGd,YACE,EACA,EACsC,CACtC,MAAO,IAAe,GAAU,OAAO,CAAC,EAAK,CAAE,OAAM,SAC5C,EAAI,KAAK,KAAM,IAAO,CAC3B,GAAI,GAEE,EAAgB,AAAQ,GAAO,GAGrC,GAAI,EAAc,SAAW,GAAK,EAAc,KAAO,AAAQ,GAAO,QACpE,EAAc,KAAM,IAAY,YAAY,EAAM,OAE7C,CACL,GAAM,GAAiB,KAAM,IAAmB,EAAK,GACrD,GAAI,CAAC,EAAgB,KAAM,IAAI,OAAM,qDAAqD,uDAC1F,AAAI,AAAQ,GAAY,GACtB,EAAc,KAAM,IAAY,mBAAmB,EAAM,EAAgB,GAEzE,EAAc,KAAM,IAAY,mBAAmB,EAAM,EAAgB,GAI7E,GAAM,GAAY,AAAQ,GAAQ,GAClC,MAAO,IAAK,GAAM,GAAY,KAE/B,QAAQ,QAAQ,KAGrB,kBACE,EACoB,CACpB,MAAO,AAAgB,IAAM,GAAa,OAAO,MAC/C,EACA,IACuB,CACvB,GAAI,AAAQ,GAAS,AAAQ,GAAO,OAAQ,GAAO,MAAO,GAE1D,GAAM,GAAO,KAAM,AAAY,IAAQ,CAAE,SACnC,EAAM,KAAM,AAAO,IAAS,cAAc,GAC1C,EAAc,CAAE,KAAM,EAAM,IAAK,GAEvC,MAAO,GAAI,KACT,GAAQ,CAAE,GAAG,EAAM,KAEpB,QAAQ,QACT,KAQJ,YAAwB,EAA4B,CAClD,MAAO,GAAK,KACV,CAAC,EAAG,IAAM,AAAQ,GAAQ,EAAE,MAAM,cAAc,AAAQ,GAAQ,EAAE,QCnWtE,GAAM,IAAoB,yBAG1B,aAAe,CACb,MAAO,IAAoB,IAAM,GAAM,UAAU,MAOnD,mBAAoD,CAClD,MAAQ,MAAM,AAAQ,IAAQ,OAAW,GAG3C,kBAA4B,EAAwC,CAClE,GAAM,GAAM,KAAM,MAClB,MAAO,CAAE,EAAI,QAAQ,GAAM,EAAI,QAGjC,mBAAgD,CAC9C,MAAQ,MAAM,OAAO,GAQvB,kBAA0B,EAA4B,CACpD,GAAM,GAAM,KAAM,MACZ,EAAS,CAAE,EAAK,GAAG,GAAM,MAAM,EAAG,KACxC,KAAM,AAAQ,IAAQ,KAAO,GAI/B,mBAA6C,CAC3C,KAAM,AAAQ,IAAW,MCzC3B,qECGO,eAAgB,EAAuB,CAC5C,AAAI,GAAM,OAAO,QAAQ,IAAI,GAAG,GCJlC,qLFcA,GAAM,IAAY,iDAQlB,kBACE,EACqB,CACrB,GAAM,GAAY,KAAM,IAAe,GACvC,GAAG,IAAc,GAAW,MAAO,MACnC,GAAG,IAAc,KAAM,MAAO,GAE9B,GAAI,CACF,GAAM,GAAM,KAAM,AAAI,IAAc,EAAW,UAAY,GAAM,UAAU,MAC3E,MAAO,KAAQ,GAAY,KAAO,QAC5B,EAAN,CACA,cAAQ,MAAM,GACR,GAAI,OAAM,sCASpB,kBACE,EACqB,CACrB,GAAI,CAKF,GAAM,GAAM,KAAM,AAJL,MAAM,OACjB,GAAG,GAAM,UAAU,iBAAiB,IACpC,CAAE,MAAO,YAEY,OACvB,GAAI,CAAC,AAAM,GAAM,GACf,KAAM,IAAI,OAAM,yBAElB,MAAO,SAED,EAAN,CACA,MAAM,IAAI,iDAAkD,EAAI,YACzD,MAWX,kBACE,EACA,EAC+B,CAC/B,GAAM,GAAc,GAAM,UAAU,IAGpC,MAAM,IAAI,mCAA6B,GAGhC,KAAM,IAAe,GAAG,eAAyB,IAAO,CAC7D,QAAS,SAYA,EAAE,cAAiB,UAXd,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,MAClB,QAAS,SACT,QAIA,SAAU,AAAK,GAAO,GAAO,QAAQ,WAKzC,QAAS,IACT,WAAY,IACZ,QAAS,CAAE,IAAK,IAAK,MAEpB,CACD,OAAQ,UAEP,KAAK,AAAC,GACP,CAAI,EAAS,OAAS,IAAK,AAAM,GAAI,6BAAuB,GACvD,AAAM,GAAI,0CAAoC,GAC5C,CAAE,QAAS,EAAS,OAAS,OAEnC,MAAM,GACP,CAAM,GAAI,0CAAoC,GAC9C,QAAQ,MAAM,GACP,CAAE,QAAS,MAkBtB,kBACE,EACA,EACA,EACA,EAAgB,EACG,CACnB,GAAM,GAAU,KAAM,GAAa,UAC7B,EAAW,KAAM,OAAM,EAAK,IAC7B,EACH,QAAS,IAAK,EAAa,WAAY,KAGzC,GAAI,EAAa,QAAQ,SAAS,EAAS,QAAS,CAClD,GAAI,EAAQ,EAAa,QACvB,MAAO,MAAM,IAAI,SAAQ,CAAC,EAAS,IAAW,WAC5C,IAAM,GAAe,EAAK,EAAc,EAAc,EAAQ,GAAG,KAAK,EAAS,GAC/E,EAAa,aAGf,KAAM,IAAI,OAAM,8BAIpB,MAAO,GGvJT,4CAAO,oBAAgC,MAAM,CAC3C,YAAY,EAAiB,CAC3B,MAAM,GACN,KAAK,KAAO,sBCoDT,YAAiB,CAatB,YAAY,CAAE,OAAM,cAAa,aAAgC,CAC/D,KAAK,UAAY,GAAa,GAC9B,KAAK,OAAS,GACd,KAAK,aAAe,GACpB,KAAK,KAAO,EAEZ,KAAK,mBAAqB,GAC1B,KAAK,YAAc,GAEnB,KAAK,YAAc,KAAK,YAAY,KAAK,MACzC,KAAK,eAAiB,KAAK,eAAe,KAAK,MAE/C,GAAM,GAAS,WACf,EAAM,YAAc,EAAM,aAAe,GACzC,EAAM,YAAY,KAAK,MAGrB,GACA,EAAY,KACZ,EAAY,IAAI,SAChB,EAAY,IAAI,MAEhB,MAAK,QAAU,GAAQ,IAKzB,GAAM,GAAS,AAAC,GAAa,CAC3B,AAAO,GAAI,GACX,AAAM,GAAI,sCAAgC,IAItC,EAA2B,GAAS,IAAM,GAAO,CAAC,EAAK,IAAU,CACrE,GAAI,WAAW,UAAU,OACvB,YAAK,YAAc,CAAC,EAAK,IAClB,AAAS,GAAO,EAAK,GAAO,KAAK,IAAM,CAC5C,AAAI,KAAK,aAAe,KAAK,YAAY,KAAO,GAC9C,MAAK,YAAc,MAKzB,KAAK,mBAAmB,KAAK,CAAE,EAAK,KACnC,IAEH,KAAK,aAAa,KAAK,GACvB,KAAK,aAAa,KAAK,GAElB,KAAK,WAER,YAAW,iBAAiB,SAAU,KAAK,aAG3C,WAAW,iBAAiB,eAAgB,KAAK,6BAWxC,OAAM,EAA6B,GAAyB,CACvE,GAAM,CAAE,cAAa,aAAc,EAC7B,EAAU,EAAK,SAAW,KAAM,AAAO,IAAI,YAC3C,EAAO,KAAM,IAAS,MAAM,CAAE,YAQpC,MANW,IAAI,IAAW,CACxB,OACA,cACA,0BASS,SAAQ,EAAU,EAA0B,GAAgC,CACvF,GAAM,CAAE,cAAa,aAAc,EAC7B,EAAO,KAAM,IAAS,QAAQ,CAAE,MAAK,gBAQ3C,MANW,IAAI,IAAW,CACxB,OACA,cACA,cAgBJ,YAAmB,CACjB,GAAI,KAAK,UAAW,OACpB,GAAM,GAAS,WACf,EAAM,YAAc,EAAM,YAAY,OAAO,AAAC,GAAkB,IAAM,MACtE,EAAM,oBAAoB,SAAU,KAAK,aACzC,EAAM,oBAAoB,eAAgB,KAAK,qBAO3C,IAAG,EAAyC,CAChD,GAAI,AAAQ,GAAO,GAAO,KAAM,IAAI,OAAM,qCAC1C,MAAO,MAAK,UAAU,EAAM,GAAO,CAAC,EAAM,IAAY,CACpD,GAAI,AAAU,GAAO,GACnB,KAAM,IAAI,OAAM,wBAEhB,MAAO,GAAK,GAAG,UAKf,OAAM,EAAqB,EAA2B,GAAmB,CAC7E,GAAI,AAAQ,GAAO,GAAO,KAAM,IAAI,OAAM,wCAC1C,YAAM,MAAK,UAAU,EAAM,GAAM,CAAC,EAAM,IAAY,CAClD,GAAI,AAAU,GAAO,GACnB,KAAM,IAAI,OAAM,2BAEhB,MAAO,GAAK,MAAM,KAGlB,EAAQ,SACV,KAAM,MAAK,UAEN,UAMH,KAAI,EAAgB,EAAsB,EAA2B,GAAmB,CAC5F,GAAI,AAAQ,GAAY,GAAO,KAAM,IAAI,OAAM,iCAC/C,YAAM,MAAK,UAAU,EAAM,GAAM,MAAO,EAAM,IACrC,AAAU,GAAO,GACpB,EAAK,cAAc,GACnB,EAAK,IAAI,EAAS,IAEpB,EAAQ,SACV,KAAM,MAAK,UAEN,UAGH,KAAI,EAAsC,CAC9C,GAAI,AAAQ,GAAY,GAAO,KAAM,IAAI,OAAM,iCAC/C,MAAO,MAAK,UAAU,EAAM,GAAO,MAAO,EAAM,IACvC,AAAU,GAAO,GACpB,EAAK,QACL,EAAK,IAAI,SAIX,MAAK,EAA6C,CACtD,GAAI,AAAQ,GAAY,GAAO,KAAM,IAAI,OAAM,kCAC/C,MAAO,MAAK,IAAI,QAGZ,OAAM,EAAgB,EAAsB,EAA2B,GAAmB,CAC9F,GAAI,AAAQ,GAAY,GAAO,KAAM,IAAI,OAAM,mCAC/C,MAAO,MAAK,IAAI,EAAM,EAAS,QAM3B,QAAO,EAAyC,CACpD,MAAO,MAAK,UAAU,EAAM,GAAO,MAAO,EAAM,IACvC,AAAU,GAAO,GACpB,GACA,EAAK,OAAO,SAId,KAAI,EAAoD,CAC5D,MAAO,MAAK,UAAU,EAAM,GAAO,MAAO,EAAM,IACvC,AAAU,GAAO,GACpB,EACA,EAAK,IAAI,SAKX,IAAG,EAAuB,EAAoC,CAClE,GAAM,GAAW,AAAQ,GAAa,EAAM,GAE5C,GAAI,CAAC,AAAQ,GAAW,EAAM,GAAK,CACjC,GAAM,GAAW,AAAQ,GAAK,GACxB,EAAS,AAAQ,GAAK,GAC5B,KAAM,IAAI,OAAM,qDAAqD,iBAAwB,KAG/F,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,mDAGlB,GAAI,KAAM,MAAK,OAAO,GACpB,KAAM,IAAI,OAAM,8BAGlB,YAAM,MAAK,UAAU,EAAM,GAAM,CAAC,EAAM,IAAY,CAClD,GAAI,AAAU,GAAO,GACnB,KAAM,IAAI,OAAM,+BAGlB,GAAM,CAAE,KAAS,GAAa,AAAQ,GAAO,GAC7C,MAAO,GAAK,GAAG,EAAS,KAGnB,UAGH,IAAG,EAAsC,CAC7C,YAAM,MAAK,UAAU,EAAM,GAAM,CAAC,EAAM,IAAY,CAClD,GAAI,AAAU,GAAO,GACnB,KAAM,IAAI,OAAM,kDAEhB,MAAO,GAAK,GAAG,KAIZ,UAWH,UAAwB,CAC5B,GAAM,GAAS,MAAM,KAAK,OAAO,QAAQ,KAAK,SAC9C,KAAK,OAAS,GAEd,GAAM,GAAM,KAAM,MAAK,KAAK,MAE5B,SAAO,QAAQ,CAAC,CAAC,EAAG,KAAW,CAC7B,KAAK,aAAa,QAAQ,GAAQ,EAAK,EAAK,MAGvC,OASH,WACJ,EACA,EACA,EACY,CACZ,GAAM,GAAQ,AAAQ,GAAO,GACvB,EAAO,EAAM,GACb,EAAU,EAAM,MAAM,GAEtB,EAAY,EACd,kBACA,QAEJ,GAAI,CAAC,KAAK,UAAW,CACnB,GAAM,GAAQ,KAAM,AAAK,IAAW,qBAAqB,GACnD,EAAe,GAAS,AAAK,GAAO,GAE1C,GAAI,CAAC,GAAS,CAAC,GAAgB,AAAK,GAAU,IAAiB,CAAC,EAAa,UAC3E,KAAM,IAAI,IAAkB,6CAA6C,yBAAiC,AAAQ,GAAQ,OAG5H,KAAK,OAAO,EAAa,WAAa,EAGxC,GAAI,GACA,EAEJ,GAAI,IAAS,GAAO,OAClB,EAAS,KAAM,GAAG,KAAK,KAAK,WAAY,GAEpC,GAAc,GAAW,WAAW,IACtC,GAAe,KAAM,GAAG,KAAK,KAAK,WAAY,GAE9C,KAAK,KAAK,WAAa,EACvB,KAAK,KAAK,WAAa,EAEvB,KAAM,SAAQ,IAAI,CAChB,KAAK,KAAK,eAAe,GAAO,OAAQ,KAAK,KAAK,YAClD,KAAK,KAAK,eAAe,GAAO,OAAQ,KAAK,KAAK,uBAI7C,IAAS,GAAO,QAAS,CAClC,GAAM,CAAC,EAAU,GAAQ,KAAK,KAAK,gBACjC,GAGF,GAAI,CAAC,EACH,KAAM,IAAI,IAAkB,6CAA6C,yBAAiC,AAAQ,GAAQ,OAQ5H,GALA,EAAS,KAAM,GACb,EACA,EAAM,MAAM,AAAQ,GAAO,GAAU,SAIrC,GACC,IAAY,WAAW,IAAW,GAAY,WAAW,IAC1D,CACA,KAAK,KAAK,aAAa,AAAQ,GAAQ,IAAa,EACpD,KAAM,GAAO,MACb,KAAM,MAAK,KAAK,eAAe,GAAO,QAAS,KAAK,KAAK,MAEzD,GAAM,GAAM,KAAM,MAAK,KAAK,KAAK,MACjC,KAAM,MAAK,KAAK,mBAAmB,QAGhC,IAAI,IAAS,GAAO,QAAU,EACnC,KAAM,IAAI,OAAM,gCAEX,GAAI,IAAS,GAAO,OACzB,EAAS,KAAM,GAAG,KAAK,KAAK,WAAY,OAGxC,MAAM,IAAI,OAAM,+BAIlB,MAAO,GAIT,aAAoB,CAClB,GAAM,GAAY,CAAC,GAAG,KAAK,oBAC3B,KAAK,mBAAqB,GAE1B,EAAU,QAAQ,CAAC,CAAC,EAAK,KAAW,CAClC,KAAK,aAAa,QAAQ,GAAQ,EAAK,EAAK,MAKhD,eAAe,EAAyB,CACtC,GAAM,GAAM,0FAEZ,GAAI,KAAK,aAAe,KAAK,mBAAmB,OAC9C,MAAC,IAAK,WAAW,OAAO,YAAc,EAC/B,IAMN,GAAQ,GAOf,YAAiB,EAAmC,CAClD,GAAI,CAAC,EAAY,IAAK,KAAM,OAAM,mCAClC,GAAM,GAAO,GAAY,EAAY,KAErC,MAAO,IACD,EAAa,AAAQ,GAAQ,EAAM,GAChC,EC7bX,GAAO,IAAQ,GCiBf,kBACE,EACA,EACA,EACqB,CACrB,GAAI,GAAK,EAIT,GADA,EAAW,GAAa,KAAM,OAA2B,OACrD,CAAC,EAAU,KAAM,IAAI,OAAM,iCAG/B,KAAM,AAAK,IAAM,IAGjB,GAAM,GAAU,UAAU,OAAS,KAAM,AAAS,IAAO,GAAY,KAC/D,CAAE,EAAQ,GAAc,EAAU,KAAM,AAAO,IAAM,GAAW,CAAE,GAAI,GAE5E,GAAI,CAAC,UAAU,OAEb,EAAM,KAAM,AAAO,cAEV,CAAC,EAEV,EAAM,KAAM,AAAO,MACnB,AAAI,EAAK,AAAM,GAAI,yCAAmC,GACjD,AAAM,GAAI,gDAEN,IAAW,EAEpB,EAAM,EACN,AAAM,GAAI,mCAA6B,WAE9B,EAAS,EAAG,CAErB,EAAM,KAAM,AAAO,MACnB,GAAM,GAAS,IAAW,EAAI,sBAAwB,EAAS,uBAC/D,AAAM,GAAI,kCAA6B,EAAS,sBAAuB,OAIvE,GAAM,EACN,KAAM,AAAO,IAAI,GACjB,AAAM,GAAI,8BAAwB,GAKpC,GAAM,GAAI,GAAe,OAGzB,GADA,EAAK,EAAM,KAAM,IAAW,QAAQ,EAAK,CAAE,YAAa,IAAO,KAC3D,EAAI,MAAO,GAGf,GAAI,CAAC,EAAS,KAAM,IAAI,OAAM,oDAC9B,SAAK,KAAM,IAAW,MAAM,CAAE,YAAa,EAAG,YAC9C,KAAM,IAAc,GAGb,EAQT,kBAA6B,EAA+B,CAC1D,KAAM,GAAG,MAAM,CAAE,UAAW,CAAE,GAAO,QAAS,UAC9C,KAAM,GAAG,MAAM,CAAE,UAAW,CAAE,GAAO,QAAS,WAC9C,KAAM,GAAG,MAAM,CAAE,UAAW,CAAE,GAAO,QAAS,eAC9C,KAAM,GAAG,MAAM,CAAE,UAAW,CAAE,GAAO,QAAS,YAC9C,KAAM,GAAG,MAAM,CAAE,UAAW,CAAE,GAAO,QAAS,WAC9C,KAAM,GAAG,UC3EX,mBAAsE,CACpE,MAAO,AAAO,MAQhB,kBAA4B,CAAE,mBAAmD,GAAmB,CAClG,KAAM,AAAQ,IAAW,IACzB,KAAM,AAAK,MACX,KAAM,AAAO,MACb,KAAM,AAAO,IAAS,QAEnB,YAAmB,aAAe,IAAI,QAAQ,AAAC,GAAkB,EAAE,cAElE,CAAC,GAAmB,WAAW,UACjC,YAAW,SAAS,KAAO,GAAM,UAAU,OAc/C,kBACE,EACA,EACe,CACf,GAAM,GAAM,GAAa,IACnB,EAAK,GAAa,GAClB,EAAW,GAAa,SACxB,EAAM,GAAa,IAEnB,EAAc,KAAM,AAAI,MACxB,EAAW,KAAM,AAAI,MACrB,EAAa,CAAC,CAAC,SAAS,KAAK,cAAc,0BAA4B,MAAO,eAAiB,WAErG,EAAa,GAAc,OAAO,SAAS,KAG3C,GAAM,GAAS,CACb,CAAE,cAAe,GACjB,CAAE,WAAY,GACd,CAAE,aAAc,GAChB,CAAE,MAAO,GAAQ,YACjB,CAAE,aAAc,EAAa,IAAM,MAEnC,OACA,EAAgB,CAAC,CAAE,YAAa,GAAG,EAAI,WAAW,EAAI,SAAY,GAClE,GAAI,QAAY,EAAG,QAAQ,IAAI,GAAK,CAAE,cAAe,AAAK,GAAQ,EAAG,CAAE,SAAU,OAAa,GAC9F,GAAI,OAAY,EAAG,OAAO,IAAI,GAAK,CAAE,aAAc,AAAK,GAAQ,EAAG,CAAE,SAAU,OAAa,GAC5F,EAAgB,CAAC,CAAC,MAAO,AAAO,GAAU,KAAK,UAAU,MAAW,IAEpE,OAAQ,KAAM,CACd,GAAM,GAAO,GAAU,KAEvB,OAAQ,MAAO,QACR,SAAU,MAAO,CAAC,CAAE,MAAO,QAC3B,SAAU,MAAO,GAAK,IAAI,GAAK,CAAE,MAAO,YACpC,MAAO,SAMpB,OAAO,SAAS,KAAO,GAAM,UAAU,MAAQ,IAC7C,EACG,IAAI,CAAC,CAAC,EAAG,KAAO,mBAAmB,GAAK,IAAM,mBAAmB,IACjE,KAAK,KCjGZ,mFAgBA,mBAAmD,CACjD,GAAM,GAAc,GAAM,UAAU,IAE9B,EAAY,KAAM,AAAK,IAAW,cAAc,KACtD,GAAI,IAAc,KAChB,KAAM,iCAGR,GAAM,GAAM,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,MAClB,MAAO,EACP,QAAS,QAUL,EAAO,KAAM,AAPF,MAAM,OAAM,GAAG,QAAmB,CACjD,OAAQ,MACR,QAAS,CACP,cAAiB,UAAU,QAIH,OAC5B,MAAO,QACJ,OAAO,GACP,OAAO,GAAM,EAAoB,OAAS,GAC1C,IAAI,GAAM,EAAE,OAAS,EAAoB,MAQ9C,kBACE,EACc,CACd,GAAM,GAAc,GAAM,UAAU,IAE9B,EAAY,KAAM,AAAK,IAAW,cAAc,KACtD,GAAI,IAAc,KAChB,KAAM,iCAGR,GAAM,GAAM,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,MAClB,MAAO,EACP,QAAS,QAGL,EAAM,GAAS,GACjB,GAAG,mBAA6B,mBAAmB,KACnD,GAAG,QASP,MAAO,CAAE,OADI,KAAM,AANF,MAAM,OAAM,EAAK,CAChC,OAAQ,OACR,QAAS,CACP,cAAiB,UAAU,QAGH,QAS9B,kBACE,EACe,CACf,GAAM,GAAc,GAAM,UAAU,IAE9B,EAAY,KAAM,AAAK,IAAW,cAAc,GACtD,GAAI,IAAc,KAChB,KAAM,IAAI,OAAM,kCAGlB,GAAM,GAAM,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,MAClB,MAAO,EACP,QAAS,QAUL,EAAQ,KAAM,AAPK,MAAM,OAAM,GAAG,QAAmB,CACzD,OAAQ,MACR,QAAS,CACP,cAAiB,UAAU,QAIM,OAC/B,EAAc,OAAO,QAAQ,GAAO,KAAK,CAAC,CAAC,EAAG,KAAa,EAAQ,SAAS,IAClF,GAAI,GAAe,KACjB,KAAM,IAAI,OAAM,oCAAoC,KAGtD,KAAM,OAAM,GAAG,SAAmB,mBAAmB,EAAY,MAAO,CACtE,OAAQ,SACR,QAAS,CACP,cAAiB,UAAU,OAUjC,kBACE,EACA,EACe,CACf,GAAM,GAAc,GAAM,UAAU,IAE9B,EAAY,KAAM,AAAK,IAAW,cAAc,GACtD,GAAI,IAAc,KAChB,KAAM,iCAGR,GAAM,GAAM,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,MAClB,MAAO,EACP,QAAS,QAGL,EAAM,GAAG,SAAmB,KAAU,IAE5C,KAAM,OAAM,EAAK,CACf,OAAQ,QACR,QAAS,CACP,cAAiB,UAAU,OCxJjC,uJCMO,GAAM,IACX,CAAE,UACA,OACA,OACA,MACA,KACA,WACA,YACA,WACA,YACA,WACA,cACA,aACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,aACA,QACA,WACA,QACA,SACA,UACA,WACA,KACA,MACA,QACA,iBACA,gBACA,MACA,UACA,YACA,cACA,aACA,aACA,aACA,aACA,aACA,YACA,aACA,OACA,QACA,SACA,QACA,MACA,YACA,MACA,MACA,cACA,OACA,MACA,SACA,OACA,OACA,iBACA,YACA,aACA,eACA,SACA,SACA,SACA,UACA,MACA,OACA,UACA,WACA,OACA,QACA,QACA,WACA,YACA,gBACA,WACA,MACA,QACA,WACA,WACA,UACA,UACA,OACA,MACA,aACA,WACA,MACA,MACA,UACA,oBACA,SACA,UACA,WACA,QACA,OACA,WACA,QACA,SACA,QACA,QACA,MACA,MACA,UACA,WACA,YACA,UACA,UACA,SACA,UACA,UACA,UACA,UACA,OACA,YACA,QACA,KACA,SACA,SACA,kBACA,MACA,oBACA,WACA,YACA,YACA,YACA,KACA,QACA,QACA,SACA,OACA,UACA,MACA,YACA,aACA,uCACA,8BACA,aACA,UACA,MACA,OACA,OACA,OACA,OACA,OACA,OACA,gBACA,SACA,WACA,YACA,WACA,QACA,OACA,qBACA,qBACA,qBACA,OACA,SACA,QACA,aACA,QACA,SACA,QACA,SACA,UACA,YACA,OACA,UACA,SACA,aACA,QACA,SACA,MACA,OACA,cACA,WACA,OACA,WACA,QACA,OACA,QACA,SACA,SACA,WACA,YACA,YACA,QACA,SACA,kBACA,iBACA,OACA,QACA,QACA,SACA,SACA,UACA,MACA,MACA,MACA,KACA,UACA,QACA,SACA,QACA,aACA,SACA,OACA,SACA,OACA,OACA,WACA,YACA,gBACA,gBACA,oBACA,gBACA,oBACA,OACA,OACA,UACA,aACA,WACA,OACA,QACA,QACA,aACA,QACA,SACA,OACA,MACA,SACA,QACA,OACA,SACA,YACA,cACA,SACA,UACA,UACA,KACA,SACA,SACA,KACA,OACA,OACA,KACA,OACA,cACA,QACA,QACA,UACA,YACA,OACA,QACA,OACA,OACA,QACA,cACA,YACA,OACA,QACA,SACA,gBACA,IACA,OACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,QACA,gBACA,eACA,MACA,YACA,cACA,SACA,KACA,QACA,SACA,UACA,UACA,WACA,UACA,MACA,SACA,YACA,SACA,OACA,KACA,MACA,KACA,MACA,UACA,MACA,OACA,aACA,cACA,OACA,MACA,WACA,SACA,MACA,OACA,UACA,eACA,gBACA,KACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,MACA,OACA,QACA,SACA,QACA,SACA,SACA,SACA,QACA,SACA,WACA,MACA,QACA,OACA,QACA,WACA,SACA,WACA,MACA,UACA,WACA,QACA,SACA,QACA,QACA,UACA,WACA,SACA,MACA,OACA,UACA,SACA,YACA,OACA,UACA,aACA,YACA,cACA,UACA,QACA,WACA,UACA,QACA,UACA,iBACA,UACA,OACA,UACA,aACA,UACA,WACA,UACA,WACA,SACA,WACA,MACA,QACA,UACA,WACA,WACA,SACA,SACA,UACA,WACA,eACA,SACA,UACA,QACA,SACA,UACA,mBACA,QACA,iBACA,WACA,SACA,UACA,SACA,UACA,aACA,OACA,WACA,aACA,eACA,MACA,QACA,QACA,OACA,SACA,MACA,SACA,SACA,WACA,SACA,WACA,UACA,WACA,WACA,QACA,QACA,QACA,OACA,SACA,SACA,OACA,UACA,QACA,OACA,OACA,SACA,MACA,MACA,UACA,MACA,WACA,mBACA,eACA,QACA,UACA,OACA,SACA,aACA,QACA,SACA,QACA,QACA,SACA,aACA,cACA,YACA,YACA,OACA,QACA,YACA,UACA,SACA,OACA,WACA,SACA,SACA,MACA,OACA,OACA,SACA,QACA,eACA,OACA,eACA,QACA,SACA,QACA,QACA,QACA,SACA,OACA,WACA,YACA,eACA,WACA,QACA,OACA,WACA,eACA,UACA,cACA,YACA,WACA,SACA,cACA,SACA,UACA,SACA,OACA,WACA,QACA,OACA,MACA,SACA,QACA,OACA,OACA,OACA,MACA,UACA,YACA,UACA,SACA,UACA,OACA,OACA,QACA,MACA,WACA,OACA,OACA,OACA,OACA,MACA,WACA,eACA,QCpiBJ,kBACE,EACkB,CAElB,MAAO,CAAC,AADK,MAAM,OAAM,GAAG,GAAM,UAAU,iBAAiB,MAChD,GAMR,YAAyB,EAA2B,CACzD,MAAO,CAAC,EAAS,WAAW,MACrB,CAAC,EAAS,SAAS,MACnB,CAAC,EAAS,WAAW,MACrB,mBAAmB,KAAK,IACxB,CAAC,GAAmB,SAAS,EAAS,eFT/C,kBACE,EAI+B,CAC/B,GAAM,GAAc,GAAM,UAAU,IAE9B,EAAM,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,SAYpB,MAAO,CACL,QAAS,AAVM,MAAM,OAAM,GAAG,SAAoB,CAClD,OAAQ,MACR,QAAS,CACP,cAAiB,UAAU,IAC3B,eAAgB,oBAElB,KAAM,KAAK,UAAU,MAIH,OAAS,KAW/B,mBAA+E,CAC7E,GAAM,GAAc,GAAM,UAAU,IAI9B,EAAY,OAAO,OAAO,AAAU,MAAiB,GAC3D,GAAI,IAAc,KAChB,KAAM,iCAGR,GAAM,GAAM,AAAK,GAAO,KAAM,AAAK,IAAM,CACvC,SAAU,KAAM,IAAI,MACpB,OAAQ,KAAM,AAAI,MAClB,MAAO,EACP,QAAS,QASX,MAAO,CACL,QAAS,AAPM,MAAM,OAAM,GAAG,sBAAiC,CAC/D,OAAQ,OACR,QAAS,CACP,cAAiB,UAAU,QAIX,OAAS,KAQxB,YAAgC,EAA4B,CACjE,MAAO,IAAS,aAAa,GGhF/B,wEAYO,YAAe,CAAE,WAA0C,CAChE,UAAc,MAAQ,EACf,GAAc,MAiBhB,YAAmB,EAAkC,CAC1D,UAAc,UAAY,IAAK,GAAc,aAAc,GACpD,IAAK,GAAc,W/FVrB,GAAK,IAAL,UAAK,EAAL,CACL,gBAAgB,iBAChB,gBAAgB,iBAChB,gBAAgB,iBAChB,eAAe,iBAJL,aAkEL,GAAK,IAAL,UAAK,EAAL,CACL,kBAAkB,mBAClB,qBAAqB,wBAFX,aAiBZ,kBACE,EAQgB,CAChB,EAAU,GAAW,GAErB,GAAM,GAAc,EAAQ,aAAe,KACrC,CAAE,sBAAsB,GAAM,WAAY,EAE1C,EAAc,KAAO,IAClB,EAAQ,iBAAmB,GAC9B,OACA,KAAM,IAAe,EAAa,EAAU,GAIlD,GAAI,WAAW,kBAAoB,GAAO,KAAM,IAAoB,gBACpE,GAAI,KAAM,QAAkB,GAAO,KAAM,IAAoB,mBAG7D,GAAM,GAAM,GAAI,KAAI,OAAO,SAAS,MAC9B,EAAa,EAAI,aAAa,IAAI,cAClC,EAAe,EAAI,aAAa,IAAI,aAG1C,GAAI,EAAY,CACd,GAAM,GAAU,EAAI,aAAa,IAAI,aAAe,IAC9C,EAAW,EAAI,aAAa,IAAI,aAAe,GAiBrD,MAfA,MAAM,IACJ,IAAe,kBACX,KAAM,MACN,KAAM,AAAK,IAAI,IAGrB,KAAM,AAAQ,IAAQ,GAAsB,GAExC,GACF,GAAI,aAAa,OAAO,cACxB,EAAI,aAAa,OAAO,WACxB,EAAI,aAAa,OAAO,YACxB,QAAQ,aAAa,KAAM,SAAS,MAAO,EAAI,aAG7C,GAAe,KAAM,IAAgB,KAAiB,GACxD,SAAQ,KAAK,yCACN,GAAsB,IAG3B,GAAe,AAAK,GAAoB,EAAa,KAAc,GACrE,SAAQ,KAAK,uCACN,GAAsB,IAGxB,GACL,EACA,EACA,EACA,KAAM,GAAY,YAGX,EAAc,CACvB,GAAM,GAAK,KAAM,CACf,OAAQ,OACD,SAAU,MAAO,oCACb,MAAO,sBAIpB,MAAO,IAAsB,EAAa,OAI1C,MAAM,AAAK,IAAM,IAInB,GAAM,GAAiB,KAAM,AAAO,MAEpC,GAAI,GAAkB,EAAa,CACjC,GAAM,GAAe,KAAM,IAAgB,GACrC,EAAa,AAAK,GAAoB,EAAa,GAEzD,MAAI,IAAgB,EACX,GAAqB,EAAa,EAAgB,KAAM,GAAY,IAEpE,GAAsB,OAG1B,OAAI,GACF,GAAqB,EAAa,EAAgB,KAAM,GAAY,IAGpE,GAAsB,GAgBjC,mBAAsD,CACpD,MAAO,YAAY,SAAS,WAAY,YAInC,KAAO,KAAM,GAAI,SAAQ,GAAW,CACrC,GAAM,GAAK,UAAU,KAAK,gBAC1B,EAAG,UAAY,IAAM,EAAQ,IAC7B,EAAG,QAAU,IAAM,EAAQ,SAa1B,GAAM,IAAK,GAuBlB,YACE,EACA,EACA,EACA,EACe,CACf,MAAO,CACL,SAAU,GAAS,cACnB,cAEA,cAAe,GACf,aAAc,GACd,KACA,UACA,YAIJ,YACE,EACA,EACe,CACf,MAAO,CACL,SAAU,GAAS,cACnB,cAEA,cAAe,GACf,aAAc,GACd,sBAIJ,YACE,EACA,EACA,EACc,CACd,MAAO,CACL,SAAU,GAAS,aACnB,cAEA,cAAe,GACf,QAAS,GACT,aAAc,GACd,KACA,YAIJ,YACE,EACe,CACf,MAAO,CACL,SAAU,GAAS,cACnB,cAEA,cAAe,IAenB,kBACE,EACe,CACf,GAAM,GAAgC,KAAK,MAAM,GAG3C,EAAgB,KAAM,AAAO,IAAS,QAAQ,EAAK,YAGnD,EAAa,KAAM,AAAO,IAAI,WAAW,EAAK,QAAS,EAAe,EAAK,IAC3E,EAAU,KAAK,MAAM,GAErB,EAAqE,EAAQ,GAC7E,EAAQ,EAAQ,MAGtB,KAAM,SAAQ,IACZ,OAAO,QAAQ,GAAW,IAAI,MAAO,CAAC,EAAW,CAAE,iBAAgB,UAAW,CAC5E,GAAM,GAAO,AAAQ,GAAU,GACzB,EAAY,KAAM,AAAY,IAAQ,CAAE,SACxC,EAAmB,KAAM,AAAY,IAAe,CAAE,SAE5D,KAAM,AAAO,IAAS,cAAc,EAAK,GACzC,KAAM,AAAQ,IAAQ,EAAkB,MAK5C,KAAM,AAAK,IAAM,GAGnB,mBAA8D,CAC5D,GAAM,GAA4B,KAAM,IAAI,SAAQ,GAAW,CAC7D,GAAM,GAAS,SAAS,cAAc,UACtC,EAAO,GAAK,4BACZ,EAAO,MAAM,MAAQ,IACrB,EAAO,MAAM,OAAS,IACtB,EAAO,MAAM,OAAS,OACtB,EAAO,MAAM,QAAU,OACvB,SAAS,KAAK,YAAY,GAE1B,EAAO,OAAS,IAAM,CACpB,EAAQ,IAGV,EAAO,IAAM,GAAG,GAAM,UAAU,wBAGlC,GAAI,CAEF,GAAM,GAA0B,GAAI,SAAQ,CAAC,EAAS,IAAW,CAC/D,OAAO,iBAAiB,UAAW,GAEnC,WAAgB,EAA6B,CAC3C,OAAO,oBAAoB,UAAW,GACtC,AAAI,EAAM,KACR,EAAQ,EAAM,MAEd,EAAO,GAAI,OAAM,qDAKvB,GAAI,EAAO,eAAiB,KAAM,KAAM,IAAI,OAAM,mEAClD,GAAM,GAAU,CACd,UAAW,mBACX,YAAa,KAAM,AAAI,OAEzB,SAAO,cAAc,YAAY,EAAS,EAAO,KAE1C,KAAM,UAEb,CACA,SAAS,KAAK,YAAY,IAI9B,kBAA+B,EAA4C,CACzE,MAAO,AAAgB,IAAM,GAAa,OACxC,CAAC,EAAK,IAAS,EAAI,KAAK,KAAM,IAAQ,CAEpC,GADI,IAAS,IACT,AAAQ,GAAS,AAAQ,GAAO,OAAQ,GAAO,MAAO,GAE1D,GAAM,GAAU,KAAM,AAAY,IAAQ,CAAE,SAC5C,MAAO,MAAM,AAAO,IAAS,UAAU,KAEzC,QAAQ,QAAQ",
6 "names": []
7}