npm - @wovin/base-agent - Versions diffs - 0.0.10 - Mend

@wovin/base-agent 0.0.10

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (5) hide show

package/dist/index.min.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"sources":["../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/errors.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/utils/global.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/utils/utils.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/decorators.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/atom.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/utils/comparer.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/modifiers.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/overrideannotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/actionannotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/flowannotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/computedannotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/observableannotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/autoannotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/observable.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/computed.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/action.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/observablevalue.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/computedvalue.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/derivation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/globalstate.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/observable.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/reaction.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/core/spy.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/action.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/autorun.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/become-observed.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/configure.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/extendobservable.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/extras.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/flow.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/intercept-read.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/intercept.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/iscomputed.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/isobservable.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/object-api.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/observe.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/tojs.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/trace.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/transaction.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/when.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/dynamicobject.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/intercept-utils.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/listen-utils.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/makeObservable.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/observablearray.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/observablemap.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/observableset.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/observableobject.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/legacyobservablearray.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/types/type-utils.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/utils/eq.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/utils/iterable.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/api/annotation.ts","../../../../node_modules/.pnpm/mobx@6.12.0/node_modules/mobx/src/mobx.ts","../../core/dist/chunk-KRQZ6V4Y.min.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/typebox.js","../../core/src/types/typescript-utils.ts","../../../../node_modules/.pnpm/browser-or-node@2.1.1/node_modules/browser-or-node/lib/index.js","../../../../node_modules/.pnpm/fast-json-stable-stringify@2.1.0/node_modules/fast-json-stable-stringify/index.js","../../../../node_modules/.pnpm/safe-stable-stringify@2.4.3/node_modules/safe-stable-stringify/index.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/value/guard.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/system/system.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/value/deref.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/value/hash.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/errors/errors.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/errors/index.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/system/index.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/value/check.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/value/transform.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/compiler/compiler.js","../../../../node_modules/.pnpm/@sinclair+typebox@0.31.28/node_modules/@sinclair/typebox/compiler/index.js","../../../../node_modules/.pnpm/besonders-logger@1.0.1/node_modules/besonders-logger/src/lib/logger.ts","../../../../node_modules/.pnpm/safe-stable-stringify@2.4.3/node_modules/safe-stable-stringify/esm/wrapper.js","../../core/src/mobx/mobx-utils.ts","../../core/src/thread/basic.ts","../../../../node_modules/.pnpm/@ipld+dag-json@10.1.7/node_modules/@ipld/dag-json/src/index.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/is.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/token.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/byte-utils.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/bl.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/common.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/0uint.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/1negint.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/2bytes.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/3string.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/4array.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/5map.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/6tag.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/7float.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/jump.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/encode.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/decode.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/json/encode.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/json/decode.js","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/bytes.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/vendor/base-x.js","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/bases/base.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/bases/base32.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/bases/base58.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/hashes/digest.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/vendor/varint.js","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/varint.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/cid.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/hashes/hasher.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/bases/base64.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/_assert.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/utils.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/_sha2.ts","../../../../node_modules/.pnpm/@noble+hashes@1.3.3/node_modules/@noble/hashes/src/sha256.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/block.ts","../../core/src/applog/datom-types.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/bases/base36.ts","../../../../node_modules/.pnpm/multiformats@13.0.1/node_modules/multiformats/src/hashes/sha2-browser.ts","../../core/src/ipfs/ipfs-utils.ts","../../../../node_modules/.pnpm/date-fns@3.3.1/node_modules/date-fns/toDate.mjs","../../../../node_modules/.pnpm/date-fns@3.3.1/node_modules/date-fns/isBefore.mjs","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_freeGlobal.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_root.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Symbol.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getRawTag.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_objectToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseGetTag.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isObjectLike.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isSymbol.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayMap.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_trimmedEndIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseTrim.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isObject.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toNumber.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toFinite.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toInteger.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/identity.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isFunction.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_coreJsData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isMasked.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_toSource.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsNative.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getValue.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getNative.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_WeakMap.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_metaMap.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSetData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseCreate.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createCtor.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createBind.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_apply.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_composeArgs.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_composeArgsRight.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_countHolders.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseLodash.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_LazyWrapper.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/noop.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_realNames.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getFuncName.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_LodashWrapper.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_copyArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_wrapperClone.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/wrapperLodash.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isLaziable.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_shortOut.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getWrapDetails.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_insertWrapDetails.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/constant.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_defineProperty.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSetToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayEach.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseFindIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsNaN.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_strictIndexOf.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIndexOf.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayIncludes.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_updateWrapDetails.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setWrapToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createRecurry.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getHolder.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isIndex.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_reorder.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_replaceHolders.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createHybrid.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createCurry.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createPartial.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mergeData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createWrap.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseAssignValue.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/eq.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_assignValue.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_overRest.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseRest.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isLength.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isArrayLike.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isPrototype.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseTimes.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsArguments.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isArguments.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/stubFalse.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isBuffer.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsTypedArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseUnary.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_nodeUtil.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isTypedArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayLikeKeys.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_overArg.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_nativeKeys.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseKeys.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/keys.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isKey.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_nativeCreate.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hashSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Hash.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_assocIndexOf.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_listCacheSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_ListCache.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Map.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isKeyable.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getMapData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapCacheSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_MapCache.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/memoize.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_memoizeCapped.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stringToPath.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/toString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_castPath.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_toKey.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/get.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayPush.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isFlattenable.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseFlatten.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/flatten.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_flatRest.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stackClear.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stackDelete.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stackGet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stackHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_stackSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Stack.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayFilter.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/stubArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getSymbols.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseGetAllKeys.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getAllKeys.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_DataView.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Promise.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Set.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getTag.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_Uint8Array.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setCacheAdd.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setCacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_SetCache.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arraySome.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_cacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_equalArrays.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapToArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setToArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_equalByTag.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_equalObjects.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsEqualDeep.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsEqual.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsMatch.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_isStrictComparable.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_getMatchData.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_matchesStrictComparable.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseMatches.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseHasIn.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_hasPath.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/hasIn.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseMatchesProperty.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseProperty.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_basePropertyDeep.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/property.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIteratee.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/now.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/debounce.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arrayIncludesWith.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_basePickBy.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/partial.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_basePick.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/pick.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSortedIndexBy.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/sortedIndexBy.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseUniq.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/uniqWith.js","../../core/src/applog/applog-utils.ts","../../core/src/applog/applog-helpers.ts","../../core/src/thread/mapped.ts","../../core/src/thread/filters.ts","../../core/src/thread/writeable.ts","../../core/src/thread/utils.ts","../../core/src/pubsub/pub-pull.ts","../../core/src/pubsub/pubsub-types.ts","../../core/src/query/types.ts","../../core/src/query/basic.ts","../../../../node_modules/.pnpm/varint@6.0.0/node_modules/varint/encode.js","../../../../node_modules/.pnpm/varint@6.0.0/node_modules/varint/decode.js","../../../../node_modules/.pnpm/varint@6.0.0/node_modules/varint/length.js","../../../../node_modules/.pnpm/varint@6.0.0/node_modules/varint/index.js","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/bytes.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/vendor/base-x.js","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/bases/base.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/bases/base32.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/bases/base36.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/bases/base58.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/vendor/varint.js","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/varint.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/hashes/digest.ts","../../../../node_modules/.pnpm/multiformats@13.3.1/node_modules/multiformats/src/cid.ts","../../../../node_modules/.pnpm/@ipld+dag-cbor@9.1.0/node_modules/@ipld/dag-cbor/src/index.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/decoder-common.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/header-validator.js","../../../../node_modules/.pnpm/cborg@4.0.9/node_modules/cborg/lib/length.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/buffer-writer.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/decoder.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/reader-browser.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/encoder.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/iterator-channel.js","../../../../node_modules/.pnpm/@ipld+car@5.2.6/node_modules/@ipld/car/src/writer-browser.js","../../core/src/ipfs/car.ts","../../core/src/pubsub/pub-push.ts","../src/index.ts"],"sourcesContent":["const niceErrors = {\n 0: `Invalid value for configuration 'enforceActions', expected 'never', 'always' or 'observed'`,\n 1(annotationType, key: PropertyKey) {\n return `Cannot apply '${annotationType}' to '${key.toString()}': Field not found.`\n },\n /*\n 2(prop) {\n return `invalid decorator for '${prop.toString()}'`\n },\n 3(prop) {\n return `Cannot decorate '${prop.toString()}': action can only be used on properties with a function value.`\n },\n 4(prop) {\n return `Cannot decorate '${prop.toString()}': computed can only be used on getter properties.`\n },\n */\n 5: \"'keys()' can only be used on observable objects, arrays, sets and maps\",\n 6: \"'values()' can only be used on observable objects, arrays, sets and maps\",\n 7: \"'entries()' can only be used on observable objects, arrays and maps\",\n 8: \"'set()' can only be used on observable objects, arrays and maps\",\n 9: \"'remove()' can only be used on observable objects, arrays and maps\",\n 10: \"'has()' can only be used on observable objects, arrays and maps\",\n 11: \"'get()' can only be used on observable objects, arrays and maps\",\n 12: `Invalid annotation`,\n 13: `Dynamic observable objects cannot be frozen. If you're passing observables to 3rd party component/function that calls Object.freeze, pass copy instead: toJS(observable)`,\n 14: \"Intercept handlers should return nothing or a change object\",\n 15: `Observable arrays cannot be frozen. If you're passing observables to 3rd party component/function that calls Object.freeze, pass copy instead: toJS(observable)`,\n 16: `Modification exception: the internal structure of an observable array was changed.`,\n 17(index, length) {\n return `[mobx.array] Index out of bounds, ${index} is larger than ${length}`\n },\n 18: \"mobx.map requires Map polyfill for the current browser. Check babel-polyfill or core-js/es6/map.js\",\n 19(other) {\n return \"Cannot initialize from classes that inherit from Map: \" + other.constructor.name\n },\n 20(other) {\n return \"Cannot initialize map from \" + other\n },\n 21(dataStructure) {\n return `Cannot convert to map from '${dataStructure}'`\n },\n 22: \"mobx.set requires Set polyfill for the current browser. Check babel-polyfill or core-js/es6/set.js\",\n 23: \"It is not possible to get index atoms from arrays\",\n 24(thing) {\n return \"Cannot obtain administration from \" + thing\n },\n 25(property, name) {\n return `the entry '${property}' does not exist in the observable map '${name}'`\n },\n 26: \"please specify a property\",\n 27(property, name) {\n return `no observable property '${property.toString()}' found on the observable object '${name}'`\n },\n 28(thing) {\n return \"Cannot obtain atom from \" + thing\n },\n 29: \"Expecting some object\",\n 30: \"invalid action stack. did you forget to finish an action?\",\n 31: \"missing option for computed: get\",\n 32(name, derivation) {\n return `Cycle detected in computation ${name}: ${derivation}`\n },\n 33(name) {\n return `The setter of computed value '${name}' is trying to update itself. Did you intend to update an _observable_ value, instead of the computed property?`\n },\n 34(name) {\n return `[ComputedValue '${name}'] It is not possible to assign a new value to a computed value.`\n },\n 35: \"There are multiple, different versions of MobX active. Make sure MobX is loaded only once or use `configure({ isolateGlobalState: true })`\",\n 36: \"isolateGlobalState should be called before MobX is running any reactions\",\n 37(method) {\n return `[mobx] \\`observableArray.${method}()\\` mutates the array in-place, which is not allowed inside a derivation. Use \\`array.slice().${method}()\\` instead`\n },\n 38: \"'ownKeys()' can only be used on observable objects\",\n 39: \"'defineProperty()' can only be used on observable objects\"\n} as const\n\nconst errors: typeof niceErrors = __DEV__ ? niceErrors : ({} as any)\n\nexport function die(error: string | keyof typeof errors, ...args: any[]): never {\n if (__DEV__) {\n let e: any = typeof error === \"string\" ? error : errors[error]\n if (typeof e === \"function\") e = e.apply(null, args as any)\n throw new Error(`[MobX] ${e}`)\n }\n throw new Error(\n typeof error === \"number\"\n ? `[MobX] minified error nr: ${error}${\n args.length ? \" \" + args.map(String).join(\",\") : \"\"\n }. Find the full error at: https://github.com/mobxjs/mobx/blob/main/packages/mobx/src/errors.ts`\n : `[MobX] ${error}`\n )\n}\n","declare const window: any\ndeclare const self: any\n\nconst mockGlobal = {}\n\nexport function getGlobal() {\n if (typeof globalThis !== \"undefined\") {\n return globalThis\n }\n if (typeof window !== \"undefined\") {\n return window\n }\n if (typeof global !== \"undefined\") {\n return global\n }\n if (typeof self !== \"undefined\") {\n return self\n }\n return mockGlobal\n}\n","import { globalState, die } from \"../internal\"\n\n// We shorten anything used > 5 times\nexport const assign = Object.assign\nexport const getDescriptor = Object.getOwnPropertyDescriptor\nexport const defineProperty = Object.defineProperty\nexport const objectPrototype = Object.prototype\n\nexport const EMPTY_ARRAY = []\nObject.freeze(EMPTY_ARRAY)\n\nexport const EMPTY_OBJECT = {}\nObject.freeze(EMPTY_OBJECT)\n\nexport interface Lambda {\n (): void\n name?: string\n}\n\nconst hasProxy = typeof Proxy !== \"undefined\"\nconst plainObjectString = Object.toString()\n\nexport function assertProxies() {\n if (!hasProxy) {\n die(\n __DEV__\n ? \"`Proxy` objects are not available in the current environment. Please configure MobX to enable a fallback implementation.`\"\n : \"Proxy not available\"\n )\n }\n}\n\nexport function warnAboutProxyRequirement(msg: string) {\n if (__DEV__ && globalState.verifyProxies) {\n die(\n \"MobX is currently configured to be able to run in ES5 mode, but in ES5 MobX won't be able to \" +\n msg\n )\n }\n}\n\nexport function getNextId() {\n return ++globalState.mobxGuid\n}\n\n/**\n * Makes sure that the provided function is invoked at most once.\n */\nexport function once(func: Lambda): Lambda {\n let invoked = false\n return function () {\n if (invoked) {\n return\n }\n invoked = true\n return (func as any).apply(this, arguments)\n }\n}\n\nexport const noop = () => {}\n\nexport function isFunction(fn: any): fn is Function {\n return typeof fn === \"function\"\n}\n\nexport function isString(value: any): value is string {\n return typeof value === \"string\"\n}\n\nexport function isStringish(value: any): value is string | number | symbol {\n const t = typeof value\n switch (t) {\n case \"string\":\n case \"symbol\":\n case \"number\":\n return true\n }\n return false\n}\n\nexport function isObject(value: any): value is Object {\n return value !== null && typeof value === \"object\"\n}\n\nexport function isPlainObject(value: any) {\n if (!isObject(value)) {\n return false\n }\n const proto = Object.getPrototypeOf(value)\n if (proto == null) {\n return true\n }\n const protoConstructor = Object.hasOwnProperty.call(proto, \"constructor\") && proto.constructor\n return (\n typeof protoConstructor === \"function\" && protoConstructor.toString() === plainObjectString\n )\n}\n\n// https://stackoverflow.com/a/37865170\nexport function isGenerator(obj: any): boolean {\n const constructor = obj?.constructor\n if (!constructor) {\n return false\n }\n if (\n \"GeneratorFunction\" === constructor.name ||\n \"GeneratorFunction\" === constructor.displayName\n ) {\n return true\n }\n return false\n}\n\nexport function addHiddenProp(object: any, propName: PropertyKey, value: any) {\n defineProperty(object, propName, {\n enumerable: false,\n writable: true,\n configurable: true,\n value\n })\n}\n\nexport function addHiddenFinalProp(object: any, propName: PropertyKey, value: any) {\n defineProperty(object, propName, {\n enumerable: false,\n writable: false,\n configurable: true,\n value\n })\n}\n\nexport function createInstanceofPredicate<T>(\n name: string,\n theClass: new (...args: any[]) => T\n): (x: any) => x is T {\n const propName = \"isMobX\" + name\n theClass.prototype[propName] = true\n return function (x) {\n return isObject(x) && x[propName] === true\n } as any\n}\n\nexport function isES6Map(thing: any): thing is Map<any, any> {\n return thing instanceof Map\n}\n\nexport function isES6Set(thing: any): thing is Set<any> {\n return thing instanceof Set\n}\n\nconst hasGetOwnPropertySymbols = typeof Object.getOwnPropertySymbols !== \"undefined\"\n\n/**\n * Returns the following: own enumerable keys and symbols.\n */\nexport function getPlainObjectKeys(object: any) {\n const keys = Object.keys(object)\n // Not supported in IE, so there are not going to be symbol props anyway...\n if (!hasGetOwnPropertySymbols) {\n return keys\n }\n const symbols = Object.getOwnPropertySymbols(object)\n if (!symbols.length) {\n return keys\n }\n return [...keys, ...symbols.filter(s => objectPrototype.propertyIsEnumerable.call(object, s))]\n}\n\n// From Immer utils\n// Returns all own keys, including non-enumerable and symbolic\nexport const ownKeys: (target: any) => Array<string | symbol> =\n typeof Reflect !== \"undefined\" && Reflect.ownKeys\n ? Reflect.ownKeys\n : hasGetOwnPropertySymbols\n ? obj => Object.getOwnPropertyNames(obj).concat(Object.getOwnPropertySymbols(obj) as any)\n : /* istanbul ignore next */ Object.getOwnPropertyNames\n\nexport function stringifyKey(key: any): string {\n if (typeof key === \"string\") {\n return key\n }\n if (typeof key === \"symbol\") {\n return key.toString()\n }\n return new String(key).toString()\n}\n\nexport function toPrimitive(value: any) {\n return value === null ? null : typeof value === \"object\" ? \"\" + value : value\n}\n\nexport function hasProp(target: Object, prop: PropertyKey): boolean {\n return objectPrototype.hasOwnProperty.call(target, prop)\n}\n\n// From Immer utils\nexport const getOwnPropertyDescriptors =\n Object.getOwnPropertyDescriptors ||\n function getOwnPropertyDescriptors(target: any) {\n // Polyfill needed for Hermes and IE, see https://github.com/facebook/hermes/issues/274\n const res: any = {}\n // Note: without polyfill for ownKeys, symbols won't be picked up\n ownKeys(target).forEach(key => {\n res[key] = getDescriptor(target, key)\n })\n return res\n }\n","import { Annotation, addHiddenProp, AnnotationsMap, hasProp, die, isOverride } from \"../internal\"\n\nimport type { Decorator } from \"../types/decorator_fills\"\n\nexport const storedAnnotationsSymbol = Symbol(\"mobx-stored-annotations\")\n\n/**\n * Creates a function that acts as\n * - decorator\n * - annotation object\n */\nexport function createDecoratorAnnotation<D extends Decorator = Decorator>(\n annotation: Annotation\n): PropertyDecorator & Annotation & D {\n function decorator(target, property) {\n if (is20223Decorator(property)) {\n return annotation.decorate_20223_(target, property)\n } else {\n storeAnnotation(target, property, annotation)\n }\n }\n return Object.assign(decorator, annotation) as any\n}\n\n/**\n * Stores annotation to prototype,\n * so it can be inspected later by `makeObservable` called from constructor\n */\nexport function storeAnnotation(prototype: any, key: PropertyKey, annotation: Annotation) {\n if (!hasProp(prototype, storedAnnotationsSymbol)) {\n addHiddenProp(prototype, storedAnnotationsSymbol, {\n // Inherit annotations\n ...prototype[storedAnnotationsSymbol]\n })\n }\n // @override must override something\n if (__DEV__ && isOverride(annotation) && !hasProp(prototype[storedAnnotationsSymbol], key)) {\n const fieldName = `${prototype.constructor.name}.prototype.${key.toString()}`\n die(\n `'${fieldName}' is decorated with 'override', ` +\n `but no such decorated member was found on prototype.`\n )\n }\n // Cannot re-decorate\n assertNotDecorated(prototype, annotation, key)\n\n // Ignore override\n if (!isOverride(annotation)) {\n prototype[storedAnnotationsSymbol][key] = annotation\n }\n}\n\nfunction assertNotDecorated(prototype: object, annotation: Annotation, key: PropertyKey) {\n if (__DEV__ && !isOverride(annotation) && hasProp(prototype[storedAnnotationsSymbol], key)) {\n const fieldName = `${prototype.constructor.name}.prototype.${key.toString()}`\n const currentAnnotationType = prototype[storedAnnotationsSymbol][key].annotationType_\n const requestedAnnotationType = annotation.annotationType_\n die(\n `Cannot apply '@${requestedAnnotationType}' to '${fieldName}':` +\n `\\nThe field is already decorated with '@${currentAnnotationType}'.` +\n `\\nRe-decorating fields is not allowed.` +\n `\\nUse '@override' decorator for methods overridden by subclass.`\n )\n }\n}\n\n/**\n * Collects annotations from prototypes and stores them on target (instance)\n */\nexport function collectStoredAnnotations(target): AnnotationsMap<any, any> {\n if (!hasProp(target, storedAnnotationsSymbol)) {\n // if (__DEV__ && !target[storedAnnotationsSymbol]) {\n // die(\n // `No annotations were passed to makeObservable, but no decorated members have been found either`\n // )\n // }\n // We need a copy as we will remove annotation from the list once it's applied.\n addHiddenProp(target, storedAnnotationsSymbol, { ...target[storedAnnotationsSymbol] })\n }\n return target[storedAnnotationsSymbol]\n}\n\nexport function is20223Decorator(context): context is DecoratorContext {\n return typeof context == \"object\" && typeof context[\"kind\"] == \"string\"\n}\n\nexport function assert20223DecoratorType(\n context: DecoratorContext,\n types: DecoratorContext[\"kind\"][]\n) {\n if (__DEV__ && !types.includes(context.kind)) {\n die(\n `The decorator applied to '${String(context.name)}' cannot be used on a ${\n context.kind\n } element`\n )\n }\n}\n","import {\n IDerivationState_,\n IObservable,\n IDerivation,\n createInstanceofPredicate,\n endBatch,\n getNextId,\n noop,\n onBecomeObserved,\n onBecomeUnobserved,\n propagateChanged,\n reportObserved,\n startBatch,\n Lambda\n} from \"../internal\"\n\nexport const $mobx = Symbol(\"mobx administration\")\n\nexport interface IAtom extends IObservable {\n reportObserved(): boolean\n reportChanged(): void\n}\n\nexport class Atom implements IAtom {\n isPendingUnobservation_ = false // for effective unobserving. BaseAtom has true, for extra optimization, so its onBecomeUnobserved never gets called, because it's not needed\n isBeingObserved_ = false\n observers_ = new Set<IDerivation>()\n\n diffValue_ = 0\n lastAccessedBy_ = 0\n lowestObserverState_ = IDerivationState_.NOT_TRACKING_\n /**\n * Create a new atom. For debugging purposes it is recommended to give it a name.\n * The onBecomeObserved and onBecomeUnobserved callbacks can be used for resource management.\n */\n constructor(public name_ = __DEV__ ? \"Atom@\" + getNextId() : \"Atom\") {}\n\n // onBecomeObservedListeners\n public onBOL: Set<Lambda> | undefined\n // onBecomeUnobservedListeners\n public onBUOL: Set<Lambda> | undefined\n\n public onBO() {\n if (this.onBOL) {\n this.onBOL.forEach(listener => listener())\n }\n }\n\n public onBUO() {\n if (this.onBUOL) {\n this.onBUOL.forEach(listener => listener())\n }\n }\n\n /**\n * Invoke this method to notify mobx that your atom has been used somehow.\n * Returns true if there is currently a reactive context.\n */\n public reportObserved(): boolean {\n return reportObserved(this)\n }\n\n /**\n * Invoke this method _after_ this method has changed to signal mobx that all its observers should invalidate.\n */\n public reportChanged() {\n startBatch()\n propagateChanged(this)\n endBatch()\n }\n\n toString() {\n return this.name_\n }\n}\n\nexport const isAtom = createInstanceofPredicate(\"Atom\", Atom)\n\nexport function createAtom(\n name: string,\n onBecomeObservedHandler: () => void = noop,\n onBecomeUnobservedHandler: () => void = noop\n): IAtom {\n const atom = new Atom(name)\n // default `noop` listener will not initialize the hook Set\n if (onBecomeObservedHandler !== noop) {\n onBecomeObserved(atom, onBecomeObservedHandler)\n }\n\n if (onBecomeUnobservedHandler !== noop) {\n onBecomeUnobserved(atom, onBecomeUnobservedHandler)\n }\n return atom\n}\n","import { deepEqual } from \"../internal\"\n\nexport interface IEqualsComparer<T> {\n (a: T, b: T): boolean\n}\n\nfunction identityComparer(a: any, b: any): boolean {\n return a === b\n}\n\nfunction structuralComparer(a: any, b: any): boolean {\n return deepEqual(a, b)\n}\n\nfunction shallowComparer(a: any, b: any): boolean {\n return deepEqual(a, b, 1)\n}\n\nfunction defaultComparer(a: any, b: any): boolean {\n if (Object.is) {\n return Object.is(a, b)\n }\n\n return a === b ? a !== 0 || 1 / a === 1 / b : a !== a && b !== b\n}\n\nexport const comparer = {\n identity: identityComparer,\n structural: structuralComparer,\n default: defaultComparer,\n shallow: shallowComparer\n}\n","import {\n deepEqual,\n isES6Map,\n isES6Set,\n isObservable,\n isObservableArray,\n isObservableMap,\n isObservableSet,\n isObservableObject,\n isPlainObject,\n observable,\n die,\n isAction,\n autoAction,\n flow,\n isFlow,\n isGenerator\n} from \"../internal\"\n\nexport interface IEnhancer<T> {\n (newValue: T, oldValue: T | undefined, name: string): T\n}\n\nexport function deepEnhancer(v, _, name) {\n // it is an observable already, done\n if (isObservable(v)) {\n return v\n }\n\n // something that can be converted and mutated?\n if (Array.isArray(v)) {\n return observable.array(v, { name })\n }\n if (isPlainObject(v)) {\n return observable.object(v, undefined, { name })\n }\n if (isES6Map(v)) {\n return observable.map(v, { name })\n }\n if (isES6Set(v)) {\n return observable.set(v, { name })\n }\n if (typeof v === \"function\" && !isAction(v) && !isFlow(v)) {\n if (isGenerator(v)) {\n return flow(v)\n } else {\n return autoAction(name, v)\n }\n }\n return v\n}\n\nexport function shallowEnhancer(v, _, name): any {\n if (v === undefined || v === null) {\n return v\n }\n if (isObservableObject(v) || isObservableArray(v) || isObservableMap(v) || isObservableSet(v)) {\n return v\n }\n if (Array.isArray(v)) {\n return observable.array(v, { name, deep: false })\n }\n if (isPlainObject(v)) {\n return observable.object(v, undefined, { name, deep: false })\n }\n if (isES6Map(v)) {\n return observable.map(v, { name, deep: false })\n }\n if (isES6Set(v)) {\n return observable.set(v, { name, deep: false })\n }\n\n if (__DEV__) {\n die(\n \"The shallow modifier / decorator can only used in combination with arrays, objects, maps and sets\"\n )\n }\n}\n\nexport function referenceEnhancer(newValue?) {\n // never turn into an observable\n return newValue\n}\n\nexport function refStructEnhancer(v, oldValue): any {\n if (__DEV__ && isObservable(v)) {\n die(`observable.struct should not be used with observable values`)\n }\n if (deepEqual(v, oldValue)) {\n return oldValue\n }\n return v\n}\n","import {\n die,\n Annotation,\n hasProp,\n createDecoratorAnnotation,\n ObservableObjectAdministration,\n MakeResult\n} from \"../internal\"\n\nimport type { ClassMethodDecorator } from \"./decorator_fills\"\n\nconst OVERRIDE = \"override\"\n\nexport const override: Annotation & PropertyDecorator & ClassMethodDecorator =\n createDecoratorAnnotation({\n annotationType_: OVERRIDE,\n make_,\n extend_,\n decorate_20223_\n })\n\nexport function isOverride(annotation: Annotation): boolean {\n return annotation.annotationType_ === OVERRIDE\n}\n\nfunction make_(this: Annotation, adm: ObservableObjectAdministration, key): MakeResult {\n // Must not be plain object\n if (__DEV__ && adm.isPlainObject_) {\n die(\n `Cannot apply '${this.annotationType_}' to '${adm.name_}.${key.toString()}':` +\n `\\n'${this.annotationType_}' cannot be used on plain objects.`\n )\n }\n // Must override something\n if (__DEV__ && !hasProp(adm.appliedAnnotations_!, key)) {\n die(\n `'${adm.name_}.${key.toString()}' is annotated with '${this.annotationType_}', ` +\n `but no such annotated member was found on prototype.`\n )\n }\n return MakeResult.Cancel\n}\n\nfunction extend_(this: Annotation, adm, key, descriptor, proxyTrap): boolean {\n die(`'${this.annotationType_}' can only be used with 'makeObservable'`)\n}\n\nfunction decorate_20223_(this: Annotation, desc, context: DecoratorContext) {\n console.warn(`'${this.annotationType_}' cannot be used with decorators - this is a no-op`)\n}\n","import {\n ObservableObjectAdministration,\n createAction,\n isAction,\n defineProperty,\n die,\n isFunction,\n Annotation,\n globalState,\n MakeResult,\n assert20223DecoratorType,\n storeAnnotation\n} from \"../internal\"\n\nexport function createActionAnnotation(name: string, options?: object): Annotation {\n return {\n annotationType_: name,\n options_: options,\n make_,\n extend_,\n decorate_20223_\n }\n}\n\nfunction make_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n source: object\n): MakeResult {\n // bound\n if (this.options_?.bound) {\n return this.extend_(adm, key, descriptor, false) === null\n ? MakeResult.Cancel\n : MakeResult.Break\n }\n // own\n if (source === adm.target_) {\n return this.extend_(adm, key, descriptor, false) === null\n ? MakeResult.Cancel\n : MakeResult.Continue\n }\n // prototype\n if (isAction(descriptor.value)) {\n // A prototype could have been annotated already by other constructor,\n // rest of the proto chain must be annotated already\n return MakeResult.Break\n }\n const actionDescriptor = createActionDescriptor(adm, this, key, descriptor, false)\n defineProperty(source, key, actionDescriptor)\n return MakeResult.Continue\n}\n\nfunction extend_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean\n): boolean | null {\n const actionDescriptor = createActionDescriptor(adm, this, key, descriptor)\n return adm.defineProperty_(key, actionDescriptor, proxyTrap)\n}\n\nfunction decorate_20223_(this: Annotation, mthd, context: DecoratorContext) {\n if (__DEV__) {\n assert20223DecoratorType(context, [\"method\", \"field\"])\n }\n const { kind, name, addInitializer } = context\n const ann = this\n\n const _createAction = m =>\n createAction(ann.options_?.name ?? name!.toString(), m, ann.options_?.autoAction ?? false)\n\n // Backwards/Legacy behavior, expects makeObservable(this)\n if (kind == \"field\") {\n addInitializer(function () {\n storeAnnotation(this, name, ann)\n })\n return\n }\n\n if (kind == \"method\") {\n if (!isAction(mthd)) {\n mthd = _createAction(mthd)\n }\n\n if (this.options_?.bound) {\n addInitializer(function () {\n const self = this as any\n const bound = self[name].bind(self)\n bound.isMobxAction = true\n self[name] = bound\n })\n }\n\n return mthd\n }\n\n die(\n `Cannot apply '${ann.annotationType_}' to '${String(name)}' (kind: ${kind}):` +\n `\\n'${ann.annotationType_}' can only be used on properties with a function value.`\n )\n}\n\nfunction assertActionDescriptor(\n adm: ObservableObjectAdministration,\n { annotationType_ }: Annotation,\n key: PropertyKey,\n { value }: PropertyDescriptor\n) {\n if (__DEV__ && !isFunction(value)) {\n die(\n `Cannot apply '${annotationType_}' to '${adm.name_}.${key.toString()}':` +\n `\\n'${annotationType_}' can only be used on properties with a function value.`\n )\n }\n}\n\nexport function createActionDescriptor(\n adm: ObservableObjectAdministration,\n annotation: Annotation,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n // provides ability to disable safeDescriptors for prototypes\n safeDescriptors: boolean = globalState.safeDescriptors\n) {\n assertActionDescriptor(adm, annotation, key, descriptor)\n let { value } = descriptor\n if (annotation.options_?.bound) {\n value = value.bind(adm.proxy_ ?? adm.target_)\n }\n return {\n value: createAction(\n annotation.options_?.name ?? key.toString(),\n value,\n annotation.options_?.autoAction ?? false,\n // https://github.com/mobxjs/mobx/discussions/3140\n annotation.options_?.bound ? adm.proxy_ ?? adm.target_ : undefined\n ),\n // Non-configurable for classes\n // prevents accidental field redefinition in subclass\n configurable: safeDescriptors ? adm.isPlainObject_ : true,\n // https://github.com/mobxjs/mobx/pull/2641#issuecomment-737292058\n enumerable: false,\n // Non-obsevable, therefore non-writable\n // Also prevents rewriting in subclass constructor\n writable: safeDescriptors ? false : true\n }\n}\n","import {\n ObservableObjectAdministration,\n Annotation,\n defineProperty,\n die,\n flow,\n isFlow,\n isFunction,\n globalState,\n MakeResult,\n hasProp,\n assert20223DecoratorType\n} from \"../internal\"\n\nexport function createFlowAnnotation(name: string, options?: object): Annotation {\n return {\n annotationType_: name,\n options_: options,\n make_,\n extend_,\n decorate_20223_\n }\n}\n\nfunction make_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n source: object\n): MakeResult {\n // own\n if (source === adm.target_) {\n return this.extend_(adm, key, descriptor, false) === null\n ? MakeResult.Cancel\n : MakeResult.Continue\n }\n // prototype\n // bound - must annotate protos to support super.flow()\n if (this.options_?.bound && (!hasProp(adm.target_, key) || !isFlow(adm.target_[key]))) {\n if (this.extend_(adm, key, descriptor, false) === null) {\n return MakeResult.Cancel\n }\n }\n if (isFlow(descriptor.value)) {\n // A prototype could have been annotated already by other constructor,\n // rest of the proto chain must be annotated already\n return MakeResult.Break\n }\n const flowDescriptor = createFlowDescriptor(adm, this, key, descriptor, false, false)\n defineProperty(source, key, flowDescriptor)\n return MakeResult.Continue\n}\n\nfunction extend_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean\n): boolean | null {\n const flowDescriptor = createFlowDescriptor(adm, this, key, descriptor, this.options_?.bound)\n return adm.defineProperty_(key, flowDescriptor, proxyTrap)\n}\n\nfunction decorate_20223_(this: Annotation, mthd, context: ClassMethodDecoratorContext) {\n if (__DEV__) {\n assert20223DecoratorType(context, [\"method\"])\n }\n const { name, addInitializer } = context\n\n if (!isFlow(mthd)) {\n mthd = flow(mthd)\n }\n\n if (this.options_?.bound) {\n addInitializer(function () {\n const self = this as any\n const bound = self[name].bind(self)\n bound.isMobXFlow = true\n self[name] = bound\n })\n }\n\n return mthd\n}\n\nfunction assertFlowDescriptor(\n adm: ObservableObjectAdministration,\n { annotationType_ }: Annotation,\n key: PropertyKey,\n { value }: PropertyDescriptor\n) {\n if (__DEV__ && !isFunction(value)) {\n die(\n `Cannot apply '${annotationType_}' to '${adm.name_}.${key.toString()}':` +\n `\\n'${annotationType_}' can only be used on properties with a generator function value.`\n )\n }\n}\n\nfunction createFlowDescriptor(\n adm: ObservableObjectAdministration,\n annotation: Annotation,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n bound: boolean,\n // provides ability to disable safeDescriptors for prototypes\n safeDescriptors: boolean = globalState.safeDescriptors\n): PropertyDescriptor {\n assertFlowDescriptor(adm, annotation, key, descriptor)\n let { value } = descriptor\n // In case of flow.bound, the descriptor can be from already annotated prototype\n if (!isFlow(value)) {\n value = flow(value)\n }\n if (bound) {\n // We do not keep original function around, so we bind the existing flow\n value = value.bind(adm.proxy_ ?? adm.target_)\n // This is normally set by `flow`, but `bind` returns new function...\n value.isMobXFlow = true\n }\n return {\n value,\n // Non-configurable for classes\n // prevents accidental field redefinition in subclass\n configurable: safeDescriptors ? adm.isPlainObject_ : true,\n // https://github.com/mobxjs/mobx/pull/2641#issuecomment-737292058\n enumerable: false,\n // Non-obsevable, therefore non-writable\n // Also prevents rewriting in subclass constructor\n writable: safeDescriptors ? false : true\n }\n}\n","import {\n ObservableObjectAdministration,\n die,\n Annotation,\n MakeResult,\n assert20223DecoratorType,\n $mobx,\n asObservableObject,\n ComputedValue\n} from \"../internal\"\n\nexport function createComputedAnnotation(name: string, options?: object): Annotation {\n return {\n annotationType_: name,\n options_: options,\n make_,\n extend_,\n decorate_20223_\n }\n}\n\nfunction make_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor\n): MakeResult {\n return this.extend_(adm, key, descriptor, false) === null ? MakeResult.Cancel : MakeResult.Break\n}\n\nfunction extend_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean\n): boolean | null {\n assertComputedDescriptor(adm, this, key, descriptor)\n return adm.defineComputedProperty_(\n key,\n {\n ...this.options_,\n get: descriptor.get,\n set: descriptor.set\n },\n proxyTrap\n )\n}\n\nfunction decorate_20223_(this: Annotation, get, context: ClassGetterDecoratorContext) {\n if (__DEV__) {\n assert20223DecoratorType(context, [\"getter\"])\n }\n const ann = this\n const { name: key, addInitializer } = context\n\n addInitializer(function () {\n const adm: ObservableObjectAdministration = asObservableObject(this)[$mobx]\n const options = {\n ...ann.options_,\n get,\n context: this\n }\n options.name ||= __DEV__\n ? `${adm.name_}.${key.toString()}`\n : `ObservableObject.${key.toString()}`\n adm.values_.set(key, new ComputedValue(options))\n })\n\n return function () {\n return this[$mobx].getObservablePropValue_(key)\n }\n}\n\nfunction assertComputedDescriptor(\n adm: ObservableObjectAdministration,\n { annotationType_ }: Annotation,\n key: PropertyKey,\n { get }: PropertyDescriptor\n) {\n if (__DEV__ && !get) {\n die(\n `Cannot apply '${annotationType_}' to '${adm.name_}.${key.toString()}':` +\n `\\n'${annotationType_}' can only be used on getter(+setter) properties.`\n )\n }\n}\n","import {\n ObservableObjectAdministration,\n deepEnhancer,\n die,\n Annotation,\n MakeResult,\n assert20223DecoratorType,\n ObservableValue,\n asObservableObject,\n $mobx\n} from \"../internal\"\n\nexport function createObservableAnnotation(name: string, options?: object): Annotation {\n return {\n annotationType_: name,\n options_: options,\n make_,\n extend_,\n decorate_20223_\n }\n}\n\nfunction make_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor\n): MakeResult {\n return this.extend_(adm, key, descriptor, false) === null ? MakeResult.Cancel : MakeResult.Break\n}\n\nfunction extend_(\n this: Annotation,\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean\n): boolean | null {\n assertObservableDescriptor(adm, this, key, descriptor)\n return adm.defineObservableProperty_(\n key,\n descriptor.value,\n this.options_?.enhancer ?? deepEnhancer,\n proxyTrap\n )\n}\n\nfunction decorate_20223_(\n this: Annotation,\n desc,\n context: ClassAccessorDecoratorContext | ClassFieldDecoratorContext\n) {\n if (__DEV__) {\n if (context.kind === \"field\") {\n throw die(\n `Please use \\`@observable accessor ${String(\n context.name\n )}\\` instead of \\`@observable ${String(context.name)}\\``\n )\n }\n assert20223DecoratorType(context, [\"accessor\"])\n }\n\n const ann = this\n const { kind, name } = context\n\n // The laziness here is not ideal... It's a workaround to how 2022.3 Decorators are implemented:\n // `addInitializer` callbacks are executed _before_ any accessors are defined (instead of the ideal-for-us right after each).\n // This means that, if we were to do our stuff in an `addInitializer`, we'd attempt to read a private slot\n // before it has been initialized. The runtime doesn't like that and throws a `Cannot read private member\n // from an object whose class did not declare it` error.\n // TODO: it seems that this will not be required anymore in the final version of the spec\n // See TODO: link\n const initializedObjects = new WeakSet()\n\n function initializeObservable(target, value) {\n const adm: ObservableObjectAdministration = asObservableObject(target)[$mobx]\n const observable = new ObservableValue(\n value,\n ann.options_?.enhancer ?? deepEnhancer,\n __DEV__ ? `${adm.name_}.${name.toString()}` : `ObservableObject.${name.toString()}`,\n false\n )\n adm.values_.set(name, observable)\n initializedObjects.add(target)\n }\n\n if (kind == \"accessor\") {\n return {\n get() {\n if (!initializedObjects.has(this)) {\n initializeObservable(this, desc.get.call(this))\n }\n return this[$mobx].getObservablePropValue_(name)\n },\n set(value) {\n if (!initializedObjects.has(this)) {\n initializeObservable(this, value)\n }\n return this[$mobx].setObservablePropValue_(name, value)\n },\n init(value) {\n if (!initializedObjects.has(this)) {\n initializeObservable(this, value)\n }\n return value\n }\n }\n }\n\n return\n}\n\nfunction assertObservableDescriptor(\n adm: ObservableObjectAdministration,\n { annotationType_ }: Annotation,\n key: PropertyKey,\n descriptor: PropertyDescriptor\n) {\n if (__DEV__ && !(\"value\" in descriptor)) {\n die(\n `Cannot apply '${annotationType_}' to '${adm.name_}.${key.toString()}':` +\n `\\n'${annotationType_}' cannot be used on getter/setter properties`\n )\n }\n}\n","import {\n ObservableObjectAdministration,\n observable,\n Annotation,\n defineProperty,\n createAction,\n globalState,\n flow,\n computed,\n autoAction,\n isGenerator,\n MakeResult,\n die\n} from \"../internal\"\n\nconst AUTO = \"true\"\n\nexport const autoAnnotation: Annotation = createAutoAnnotation()\n\nexport function createAutoAnnotation(options?: object): Annotation {\n return {\n annotationType_: AUTO,\n options_: options,\n make_,\n extend_,\n decorate_20223_\n }\n}\n\nfunction make_(\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n source: object\n): MakeResult {\n // getter -> computed\n if (descriptor.get) {\n return computed.make_(adm, key, descriptor, source)\n }\n // lone setter -> action setter\n if (descriptor.set) {\n // TODO make action applicable to setter and delegate to action.make_\n const set = createAction(key.toString(), descriptor.set) as (v: any) => void\n // own\n if (source === adm.target_) {\n return adm.defineProperty_(key, {\n configurable: globalState.safeDescriptors ? adm.isPlainObject_ : true,\n set\n }) === null\n ? MakeResult.Cancel\n : MakeResult.Continue\n }\n // proto\n defineProperty(source, key, {\n configurable: true,\n set\n })\n return MakeResult.Continue\n }\n // function on proto -> autoAction/flow\n if (source !== adm.target_ && typeof descriptor.value === \"function\") {\n if (isGenerator(descriptor.value)) {\n const flowAnnotation = this.options_?.autoBind ? flow.bound : flow\n return flowAnnotation.make_(adm, key, descriptor, source)\n }\n const actionAnnotation = this.options_?.autoBind ? autoAction.bound : autoAction\n return actionAnnotation.make_(adm, key, descriptor, source)\n }\n // other -> observable\n // Copy props from proto as well, see test:\n // \"decorate should work with Object.create\"\n let observableAnnotation = this.options_?.deep === false ? observable.ref : observable\n // if function respect autoBind option\n if (typeof descriptor.value === \"function\" && this.options_?.autoBind) {\n descriptor.value = descriptor.value.bind(adm.proxy_ ?? adm.target_)\n }\n return observableAnnotation.make_(adm, key, descriptor, source)\n}\n\nfunction extend_(\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean\n): boolean | null {\n // getter -> computed\n if (descriptor.get) {\n return computed.extend_(adm, key, descriptor, proxyTrap)\n }\n // lone setter -> action setter\n if (descriptor.set) {\n // TODO make action applicable to setter and delegate to action.extend_\n return adm.defineProperty_(\n key,\n {\n configurable: globalState.safeDescriptors ? adm.isPlainObject_ : true,\n set: createAction(key.toString(), descriptor.set) as (v: any) => void\n },\n proxyTrap\n )\n }\n // other -> observable\n // if function respect autoBind option\n if (typeof descriptor.value === \"function\" && this.options_?.autoBind) {\n descriptor.value = descriptor.value.bind(adm.proxy_ ?? adm.target_)\n }\n let observableAnnotation = this.options_?.deep === false ? observable.ref : observable\n return observableAnnotation.extend_(adm, key, descriptor, proxyTrap)\n}\n\nfunction decorate_20223_(this: Annotation, desc, context: ClassGetterDecoratorContext) {\n die(`'${this.annotationType_}' cannot be used as a decorator`)\n}\n","import {\n IEnhancer,\n IEqualsComparer,\n IObservableArray,\n IObservableMapInitialValues,\n IObservableSetInitialValues,\n IObservableValue,\n ObservableMap,\n ObservableSet,\n ObservableValue,\n asDynamicObservableObject,\n createObservableArray,\n deepEnhancer,\n extendObservable,\n isES6Map,\n isES6Set,\n isObservable,\n isPlainObject,\n referenceEnhancer,\n Annotation,\n shallowEnhancer,\n refStructEnhancer,\n AnnotationsMap,\n asObservableObject,\n storeAnnotation,\n createDecoratorAnnotation,\n createLegacyArray,\n globalState,\n assign,\n isStringish,\n createObservableAnnotation,\n createAutoAnnotation,\n is20223Decorator,\n initObservable\n} from \"../internal\"\n\nimport type { ClassAccessorDecorator, ClassFieldDecorator } from \"../types/decorator_fills\"\n\nexport const OBSERVABLE = \"observable\"\nexport const OBSERVABLE_REF = \"observable.ref\"\nexport const OBSERVABLE_SHALLOW = \"observable.shallow\"\nexport const OBSERVABLE_STRUCT = \"observable.struct\"\n\nexport type CreateObservableOptions = {\n name?: string\n equals?: IEqualsComparer<any>\n deep?: boolean\n defaultDecorator?: Annotation\n proxy?: boolean\n autoBind?: boolean\n}\n\n// Predefined bags of create observable options, to avoid allocating temporarily option objects\n// in the majority of cases\nexport const defaultCreateObservableOptions: CreateObservableOptions = {\n deep: true,\n name: undefined,\n defaultDecorator: undefined,\n proxy: true\n}\nObject.freeze(defaultCreateObservableOptions)\n\nexport function asCreateObservableOptions(thing: any): CreateObservableOptions {\n return thing || defaultCreateObservableOptions\n}\n\nconst observableAnnotation = createObservableAnnotation(OBSERVABLE)\nconst observableRefAnnotation = createObservableAnnotation(OBSERVABLE_REF, {\n enhancer: referenceEnhancer\n})\nconst observableShallowAnnotation = createObservableAnnotation(OBSERVABLE_SHALLOW, {\n enhancer: shallowEnhancer\n})\nconst observableStructAnnotation = createObservableAnnotation(OBSERVABLE_STRUCT, {\n enhancer: refStructEnhancer\n})\nconst observableDecoratorAnnotation =\n createDecoratorAnnotation<ClassAccessorDecorator>(observableAnnotation)\n\nexport function getEnhancerFromOptions(options: CreateObservableOptions): IEnhancer<any> {\n return options.deep === true\n ? deepEnhancer\n : options.deep === false\n ? referenceEnhancer\n : getEnhancerFromAnnotation(options.defaultDecorator)\n}\n\nexport function getAnnotationFromOptions(\n options?: CreateObservableOptions\n): Annotation | undefined {\n return options ? options.defaultDecorator ?? createAutoAnnotation(options) : undefined\n}\n\nexport function getEnhancerFromAnnotation(annotation?: Annotation): IEnhancer<any> {\n return !annotation ? deepEnhancer : annotation.options_?.enhancer ?? deepEnhancer\n}\n\n/**\n * Turns an object, array or function into a reactive structure.\n * @param v the value which should become observable.\n */\nfunction createObservable(v: any, arg2?: any, arg3?: any) {\n // @observable someProp; (2022.3 Decorators)\n if (is20223Decorator(arg2)) {\n return observableAnnotation.decorate_20223_(v, arg2)\n }\n\n // @observable someProp;\n if (isStringish(arg2)) {\n storeAnnotation(v, arg2, observableAnnotation)\n return\n }\n\n // already observable - ignore\n if (isObservable(v)) {\n return v\n }\n\n // plain object\n if (isPlainObject(v)) {\n return observable.object(v, arg2, arg3)\n }\n\n // Array\n if (Array.isArray(v)) {\n return observable.array(v, arg2)\n }\n\n // Map\n if (isES6Map(v)) {\n return observable.map(v, arg2)\n }\n\n // Set\n if (isES6Set(v)) {\n return observable.set(v, arg2)\n }\n\n // other object - ignore\n if (typeof v === \"object\" && v !== null) {\n return v\n }\n\n // anything else\n return observable.box(v, arg2)\n}\nassign(createObservable, observableDecoratorAnnotation)\n\nexport interface IObservableValueFactory {\n <T>(value: T, options?: CreateObservableOptions): IObservableValue<T>\n <T>(value?: T, options?: CreateObservableOptions): IObservableValue<T | undefined>\n}\n\nexport interface IObservableFactory\n extends Annotation,\n PropertyDecorator,\n ClassAccessorDecorator,\n ClassFieldDecorator {\n // TODO: remove ClassFieldDecorator, this is only temporarily support for legacy decorators\n <T = any>(value: T[], options?: CreateObservableOptions): IObservableArray<T>\n <T = any>(value: Set<T>, options?: CreateObservableOptions): ObservableSet<T>\n <K = any, V = any>(value: Map<K, V>, options?: CreateObservableOptions): ObservableMap<K, V>\n <T extends object>(\n value: T,\n decorators?: AnnotationsMap<T, never>,\n options?: CreateObservableOptions\n ): T\n\n box: IObservableValueFactory\n array: <T = any>(initialValues?: T[], options?: CreateObservableOptions) => IObservableArray<T>\n set: <T = any>(\n initialValues?: IObservableSetInitialValues<T>,\n options?: CreateObservableOptions\n ) => ObservableSet<T>\n map: <K = any, V = any>(\n initialValues?: IObservableMapInitialValues<K, V>,\n options?: CreateObservableOptions\n ) => ObservableMap<K, V>\n object: <T = any>(\n props: T,\n decorators?: AnnotationsMap<T, never>,\n options?: CreateObservableOptions\n ) => T\n\n /**\n * Decorator that creates an observable that only observes the references, but doesn't try to turn the assigned value into an observable.ts.\n */\n ref: Annotation & PropertyDecorator & ClassAccessorDecorator & ClassFieldDecorator\n /**\n * Decorator that creates an observable converts its value (objects, maps or arrays) into a shallow observable structure\n */\n shallow: Annotation & PropertyDecorator & ClassAccessorDecorator & ClassFieldDecorator\n deep: Annotation & PropertyDecorator & ClassAccessorDecorator & ClassFieldDecorator\n struct: Annotation & PropertyDecorator & ClassAccessorDecorator & ClassFieldDecorator\n}\n\nconst observableFactories: IObservableFactory = {\n box<T = any>(value: T, options?: CreateObservableOptions): IObservableValue<T> {\n const o = asCreateObservableOptions(options)\n return new ObservableValue(value, getEnhancerFromOptions(o), o.name, true, o.equals)\n },\n array<T = any>(initialValues?: T[], options?: CreateObservableOptions): IObservableArray<T> {\n const o = asCreateObservableOptions(options)\n return (\n globalState.useProxies === false || o.proxy === false\n ? createLegacyArray\n : createObservableArray\n )(initialValues, getEnhancerFromOptions(o), o.name)\n },\n map<K = any, V = any>(\n initialValues?: IObservableMapInitialValues<K, V>,\n options?: CreateObservableOptions\n ): ObservableMap<K, V> {\n const o = asCreateObservableOptions(options)\n return new ObservableMap<K, V>(initialValues, getEnhancerFromOptions(o), o.name)\n },\n set<T = any>(\n initialValues?: IObservableSetInitialValues<T>,\n options?: CreateObservableOptions\n ): ObservableSet<T> {\n const o = asCreateObservableOptions(options)\n return new ObservableSet<T>(initialValues, getEnhancerFromOptions(o), o.name)\n },\n object<T extends object = any>(\n props: T,\n decorators?: AnnotationsMap<T, never>,\n options?: CreateObservableOptions\n ): T {\n return initObservable(() =>\n extendObservable(\n globalState.useProxies === false || options?.proxy === false\n ? asObservableObject({}, options)\n : asDynamicObservableObject({}, options),\n props,\n decorators\n )\n )\n },\n ref: createDecoratorAnnotation(observableRefAnnotation),\n shallow: createDecoratorAnnotation(observableShallowAnnotation),\n deep: observableDecoratorAnnotation,\n struct: createDecoratorAnnotation(observableStructAnnotation)\n} as any\n\n// eslint-disable-next-line\nexport var observable: IObservableFactory = assign(createObservable, observableFactories)\n","import {\n ComputedValue,\n IComputedValueOptions,\n Annotation,\n storeAnnotation,\n createDecoratorAnnotation,\n isStringish,\n isPlainObject,\n isFunction,\n die,\n IComputedValue,\n createComputedAnnotation,\n comparer,\n is20223Decorator\n} from \"../internal\"\n\nimport type { ClassGetterDecorator } from \"../types/decorator_fills\"\n\nexport const COMPUTED = \"computed\"\nexport const COMPUTED_STRUCT = \"computed.struct\"\n\nexport interface IComputedFactory extends Annotation, PropertyDecorator, ClassGetterDecorator {\n // @computed(opts)\n <T>(options: IComputedValueOptions<T>): Annotation & PropertyDecorator & ClassGetterDecorator\n // computed(fn, opts)\n <T>(func: () => T, options?: IComputedValueOptions<T>): IComputedValue<T>\n\n struct: Annotation & PropertyDecorator & ClassGetterDecorator\n}\n\nconst computedAnnotation = createComputedAnnotation(COMPUTED)\nconst computedStructAnnotation = createComputedAnnotation(COMPUTED_STRUCT, {\n equals: comparer.structural\n})\n\n/**\n * Decorator for class properties: @computed get value() { return expr; }.\n * For legacy purposes also invokable as ES5 observable created: `computed(() => expr)`;\n */\nexport const computed: IComputedFactory = function computed(arg1, arg2) {\n if (is20223Decorator(arg2)) {\n // @computed (2022.3 Decorators)\n return computedAnnotation.decorate_20223_(arg1, arg2)\n }\n if (isStringish(arg2)) {\n // @computed\n return storeAnnotation(arg1, arg2, computedAnnotation)\n }\n if (isPlainObject(arg1)) {\n // @computed({ options })\n return createDecoratorAnnotation(createComputedAnnotation(COMPUTED, arg1))\n }\n\n // computed(expr, options?)\n if (__DEV__) {\n if (!isFunction(arg1)) {\n die(\"First argument to `computed` should be an expression.\")\n }\n if (isFunction(arg2)) {\n die(\n \"A setter as second argument is no longer supported, use `{ set: fn }` option instead\"\n )\n }\n }\n const opts: IComputedValueOptions<any> = isPlainObject(arg2) ? arg2 : {}\n opts.get = arg1\n opts.name ||= arg1.name || \"\" /* for generated name */\n\n return new ComputedValue(opts)\n} as any\n\nObject.assign(computed, computedAnnotation)\n\ncomputed.struct = createDecoratorAnnotation(computedStructAnnotation)\n","import {\n IDerivation,\n endBatch,\n globalState,\n isSpyEnabled,\n spyReportEnd,\n spyReportStart,\n startBatch,\n untrackedEnd,\n untrackedStart,\n isFunction,\n allowStateReadsStart,\n allowStateReadsEnd,\n ACTION,\n EMPTY_ARRAY,\n die,\n getDescriptor,\n defineProperty\n} from \"../internal\"\n\n// we don't use globalState for these in order to avoid possible issues with multiple\n// mobx versions\nlet currentActionId = 0\nlet nextActionId = 1\nconst isFunctionNameConfigurable = getDescriptor(() => {}, \"name\")?.configurable ?? false\n\n// we can safely recycle this object\nconst tmpNameDescriptor: PropertyDescriptor = {\n value: \"action\",\n configurable: true,\n writable: false,\n enumerable: false\n}\n\nexport function createAction(\n actionName: string,\n fn: Function,\n autoAction: boolean = false,\n ref?: Object\n): Function {\n if (__DEV__) {\n if (!isFunction(fn)) {\n die(\"`action` can only be invoked on functions\")\n }\n if (typeof actionName !== \"string\" || !actionName) {\n die(`actions should have valid names, got: '${actionName}'`)\n }\n }\n function res() {\n return executeAction(actionName, autoAction, fn, ref || this, arguments)\n }\n res.isMobxAction = true\n res.toString = () => fn.toString()\n if (isFunctionNameConfigurable) {\n tmpNameDescriptor.value = actionName\n defineProperty(res, \"name\", tmpNameDescriptor)\n }\n return res\n}\n\nexport function executeAction(\n actionName: string,\n canRunAsDerivation: boolean,\n fn: Function,\n scope?: any,\n args?: IArguments\n) {\n const runInfo = _startAction(actionName, canRunAsDerivation, scope, args)\n try {\n return fn.apply(scope, args)\n } catch (err) {\n runInfo.error_ = err\n throw err\n } finally {\n _endAction(runInfo)\n }\n}\n\nexport interface IActionRunInfo {\n prevDerivation_: IDerivation | null\n prevAllowStateChanges_: boolean\n prevAllowStateReads_: boolean\n notifySpy_: boolean\n startTime_: number\n error_?: any\n parentActionId_: number\n actionId_: number\n runAsAction_?: boolean\n}\n\nexport function _startAction(\n actionName: string,\n canRunAsDerivation: boolean, // true for autoAction\n scope: any,\n args?: IArguments\n): IActionRunInfo {\n const notifySpy_ = __DEV__ && isSpyEnabled() && !!actionName\n let startTime_: number = 0\n if (__DEV__ && notifySpy_) {\n startTime_ = Date.now()\n const flattenedArgs = args ? Array.from(args) : EMPTY_ARRAY\n spyReportStart({\n type: ACTION,\n name: actionName,\n object: scope,\n arguments: flattenedArgs\n })\n }\n const prevDerivation_ = globalState.trackingDerivation\n const runAsAction = !canRunAsDerivation || !prevDerivation_\n startBatch()\n let prevAllowStateChanges_ = globalState.allowStateChanges // by default preserve previous allow\n if (runAsAction) {\n untrackedStart()\n prevAllowStateChanges_ = allowStateChangesStart(true)\n }\n const prevAllowStateReads_ = allowStateReadsStart(true)\n const runInfo = {\n runAsAction_: runAsAction,\n prevDerivation_,\n prevAllowStateChanges_,\n prevAllowStateReads_,\n notifySpy_,\n startTime_,\n actionId_: nextActionId++,\n parentActionId_: currentActionId\n }\n currentActionId = runInfo.actionId_\n return runInfo\n}\n\nexport function _endAction(runInfo: IActionRunInfo) {\n if (currentActionId !== runInfo.actionId_) {\n die(30)\n }\n currentActionId = runInfo.parentActionId_\n\n if (runInfo.error_ !== undefined) {\n globalState.suppressReactionErrors = true\n }\n allowStateChangesEnd(runInfo.prevAllowStateChanges_)\n allowStateReadsEnd(runInfo.prevAllowStateReads_)\n endBatch()\n if (runInfo.runAsAction_) {\n untrackedEnd(runInfo.prevDerivation_)\n }\n if (__DEV__ && runInfo.notifySpy_) {\n spyReportEnd({ time: Date.now() - runInfo.startTime_ })\n }\n globalState.suppressReactionErrors = false\n}\n\nexport function allowStateChanges<T>(allowStateChanges: boolean, func: () => T): T {\n const prev = allowStateChangesStart(allowStateChanges)\n try {\n return func()\n } finally {\n allowStateChangesEnd(prev)\n }\n}\n\nexport function allowStateChangesStart(allowStateChanges: boolean) {\n const prev = globalState.allowStateChanges\n globalState.allowStateChanges = allowStateChanges\n return prev\n}\n\nexport function allowStateChangesEnd(prev: boolean) {\n globalState.allowStateChanges = prev\n}\n","import {\n Atom,\n IEnhancer,\n IInterceptable,\n IEqualsComparer,\n IInterceptor,\n IListenable,\n Lambda,\n checkIfStateModificationsAreAllowed,\n comparer,\n createInstanceofPredicate,\n getNextId,\n hasInterceptors,\n hasListeners,\n interceptChange,\n isSpyEnabled,\n notifyListeners,\n registerInterceptor,\n registerListener,\n spyReport,\n spyReportEnd,\n spyReportStart,\n toPrimitive,\n globalState,\n IUNCHANGED,\n UPDATE\n} from \"../internal\"\n\nexport interface IValueWillChange<T> {\n object: IObservableValue<T>\n type: \"update\"\n newValue: T\n}\n\nexport type IValueDidChange<T = any> = {\n type: \"update\"\n observableKind: \"value\"\n object: IObservableValue<T>\n debugObjectName: string\n newValue: T\n oldValue: T | undefined\n}\nexport type IBoxDidChange<T = any> =\n | {\n type: \"create\"\n observableKind: \"value\"\n object: IObservableValue<T>\n debugObjectName: string\n newValue: T\n }\n | IValueDidChange<T>\n\nexport interface IObservableValue<T> {\n get(): T\n set(value: T): void\n}\n\nconst CREATE = \"create\"\n\nexport class ObservableValue<T>\n extends Atom\n implements IObservableValue<T>, IInterceptable<IValueWillChange<T>>, IListenable\n{\n hasUnreportedChange_ = false\n interceptors_\n changeListeners_\n value_\n dehancer: any\n\n constructor(\n value: T,\n public enhancer: IEnhancer<T>,\n public name_ = __DEV__ ? \"ObservableValue@\" + getNextId() : \"ObservableValue\",\n notifySpy = true,\n private equals: IEqualsComparer<any> = comparer.default\n ) {\n super(name_)\n this.value_ = enhancer(value, undefined, name_)\n if (__DEV__ && notifySpy && isSpyEnabled()) {\n // only notify spy if this is a stand-alone observable\n spyReport({\n type: CREATE,\n object: this,\n observableKind: \"value\",\n debugObjectName: this.name_,\n newValue: \"\" + this.value_\n })\n }\n }\n\n private dehanceValue(value: T): T {\n if (this.dehancer !== undefined) {\n return this.dehancer(value)\n }\n return value\n }\n\n public set(newValue: T) {\n const oldValue = this.value_\n newValue = this.prepareNewValue_(newValue) as any\n if (newValue !== globalState.UNCHANGED) {\n const notifySpy = isSpyEnabled()\n if (__DEV__ && notifySpy) {\n spyReportStart({\n type: UPDATE,\n object: this,\n observableKind: \"value\",\n debugObjectName: this.name_,\n newValue,\n oldValue\n })\n }\n this.setNewValue_(newValue)\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n }\n\n private prepareNewValue_(newValue): T | IUNCHANGED {\n checkIfStateModificationsAreAllowed(this)\n if (hasInterceptors(this)) {\n const change = interceptChange<IValueWillChange<T>>(this, {\n object: this,\n type: UPDATE,\n newValue\n })\n if (!change) {\n return globalState.UNCHANGED\n }\n newValue = change.newValue\n }\n // apply modifier\n newValue = this.enhancer(newValue, this.value_, this.name_)\n return this.equals(this.value_, newValue) ? globalState.UNCHANGED : newValue\n }\n\n setNewValue_(newValue: T) {\n const oldValue = this.value_\n this.value_ = newValue\n this.reportChanged()\n if (hasListeners(this)) {\n notifyListeners(this, {\n type: UPDATE,\n object: this,\n newValue,\n oldValue\n })\n }\n }\n\n public get(): T {\n this.reportObserved()\n return this.dehanceValue(this.value_)\n }\n\n intercept_(handler: IInterceptor<IValueWillChange<T>>): Lambda {\n return registerInterceptor(this, handler)\n }\n\n observe_(listener: (change: IValueDidChange<T>) => void, fireImmediately?: boolean): Lambda {\n if (fireImmediately) {\n listener({\n observableKind: \"value\",\n debugObjectName: this.name_,\n object: this,\n type: UPDATE,\n newValue: this.value_,\n oldValue: undefined\n })\n }\n return registerListener(this, listener)\n }\n\n raw() {\n // used by MST ot get undehanced value\n return this.value_\n }\n\n toJSON() {\n return this.get()\n }\n\n toString() {\n return `${this.name_}[${this.value_}]`\n }\n\n valueOf(): T {\n return toPrimitive(this.get())\n }\n\n [Symbol.toPrimitive]() {\n return this.valueOf()\n }\n}\n\nexport const isObservableValue = createInstanceofPredicate(\"ObservableValue\", ObservableValue) as (\n x: any\n) => x is IObservableValue<any>\n","import {\n CaughtException,\n IDerivation,\n IDerivationState_,\n IEqualsComparer,\n IObservable,\n Lambda,\n TraceMode,\n autorun,\n clearObserving,\n comparer,\n createAction,\n createInstanceofPredicate,\n endBatch,\n getNextId,\n globalState,\n isCaughtException,\n isSpyEnabled,\n propagateChangeConfirmed,\n propagateMaybeChanged,\n reportObserved,\n shouldCompute,\n spyReport,\n startBatch,\n toPrimitive,\n trackDerivedFunction,\n untrackedEnd,\n untrackedStart,\n UPDATE,\n die,\n allowStateChangesStart,\n allowStateChangesEnd\n} from \"../internal\"\n\nexport interface IComputedValue<T> {\n get(): T\n set(value: T): void\n}\n\nexport interface IComputedValueOptions<T> {\n get?: () => T\n set?: (value: T) => void\n name?: string\n equals?: IEqualsComparer<T>\n context?: any\n requiresReaction?: boolean\n keepAlive?: boolean\n}\n\nexport type IComputedDidChange<T = any> = {\n type: \"update\"\n observableKind: \"computed\"\n object: unknown\n debugObjectName: string\n newValue: T\n oldValue: T | undefined\n}\n\n/**\n * A node in the state dependency root that observes other nodes, and can be observed itself.\n *\n * ComputedValue will remember the result of the computation for the duration of the batch, or\n * while being observed.\n *\n * During this time it will recompute only when one of its direct dependencies changed,\n * but only when it is being accessed with `ComputedValue.get()`.\n *\n * Implementation description:\n * 1. First time it's being accessed it will compute and remember result\n * give back remembered result until 2. happens\n * 2. First time any deep dependency change, propagate POSSIBLY_STALE to all observers, wait for 3.\n * 3. When it's being accessed, recompute if any shallow dependency changed.\n * if result changed: propagate STALE to all observers, that were POSSIBLY_STALE from the last step.\n * go to step 2. either way\n *\n * If at any point it's outside batch and it isn't observed: reset everything and go to 1.\n */\nexport class ComputedValue<T> implements IObservable, IComputedValue<T>, IDerivation {\n dependenciesState_ = IDerivationState_.NOT_TRACKING_\n observing_: IObservable[] = [] // nodes we are looking at. Our value depends on these nodes\n newObserving_ = null // during tracking it's an array with new observed observers\n isBeingObserved_ = false\n isPendingUnobservation_: boolean = false\n observers_ = new Set<IDerivation>()\n diffValue_ = 0\n runId_ = 0\n lastAccessedBy_ = 0\n lowestObserverState_ = IDerivationState_.UP_TO_DATE_\n unboundDepsCount_ = 0\n protected value_: T | undefined | CaughtException = new CaughtException(null)\n name_: string\n triggeredBy_?: string\n isComputing_: boolean = false // to check for cycles\n isRunningSetter_: boolean = false\n derivation: () => T // N.B: unminified as it is used by MST\n setter_?: (value: T) => void\n isTracing_: TraceMode = TraceMode.NONE\n scope_: Object | undefined\n private equals_: IEqualsComparer<any>\n private requiresReaction_: boolean | undefined\n keepAlive_: boolean\n\n /**\n * Create a new computed value based on a function expression.\n *\n * The `name` property is for debug purposes only.\n *\n * The `equals` property specifies the comparer function to use to determine if a newly produced\n * value differs from the previous value. Two comparers are provided in the library; `defaultComparer`\n * compares based on identity comparison (===), and `structuralComparer` deeply compares the structure.\n * Structural comparison can be convenient if you always produce a new aggregated object and\n * don't want to notify observers if it is structurally the same.\n * This is useful for working with vectors, mouse coordinates etc.\n */\n constructor(options: IComputedValueOptions<T>) {\n if (!options.get) {\n die(31)\n }\n this.derivation = options.get!\n this.name_ = options.name || (__DEV__ ? \"ComputedValue@\" + getNextId() : \"ComputedValue\")\n if (options.set) {\n this.setter_ = createAction(\n __DEV__ ? this.name_ + \"-setter\" : \"ComputedValue-setter\",\n options.set\n ) as any\n }\n this.equals_ =\n options.equals ||\n ((options as any).compareStructural || (options as any).struct\n ? comparer.structural\n : comparer.default)\n this.scope_ = options.context\n this.requiresReaction_ = options.requiresReaction\n this.keepAlive_ = !!options.keepAlive\n }\n\n onBecomeStale_() {\n propagateMaybeChanged(this)\n }\n\n public onBOL: Set<Lambda> | undefined\n public onBUOL: Set<Lambda> | undefined\n\n public onBO() {\n if (this.onBOL) {\n this.onBOL.forEach(listener => listener())\n }\n }\n\n public onBUO() {\n if (this.onBUOL) {\n this.onBUOL.forEach(listener => listener())\n }\n }\n\n /**\n * Returns the current value of this computed value.\n * Will evaluate its computation first if needed.\n */\n public get(): T {\n if (this.isComputing_) {\n die(32, this.name_, this.derivation)\n }\n if (\n globalState.inBatch === 0 &&\n // !globalState.trackingDerivatpion &&\n this.observers_.size === 0 &&\n !this.keepAlive_\n ) {\n if (shouldCompute(this)) {\n this.warnAboutUntrackedRead_()\n startBatch() // See perf test 'computed memoization'\n this.value_ = this.computeValue_(false)\n endBatch()\n }\n } else {\n reportObserved(this)\n if (shouldCompute(this)) {\n let prevTrackingContext = globalState.trackingContext\n if (this.keepAlive_ && !prevTrackingContext) {\n globalState.trackingContext = this\n }\n if (this.trackAndCompute()) {\n propagateChangeConfirmed(this)\n }\n globalState.trackingContext = prevTrackingContext\n }\n }\n const result = this.value_!\n\n if (isCaughtException(result)) {\n throw result.cause\n }\n return result\n }\n\n public set(value: T) {\n if (this.setter_) {\n if (this.isRunningSetter_) {\n die(33, this.name_)\n }\n this.isRunningSetter_ = true\n try {\n this.setter_.call(this.scope_, value)\n } finally {\n this.isRunningSetter_ = false\n }\n } else {\n die(34, this.name_)\n }\n }\n\n trackAndCompute(): boolean {\n // N.B: unminified as it is used by MST\n const oldValue = this.value_\n const wasSuspended =\n /* see #1208 */ this.dependenciesState_ === IDerivationState_.NOT_TRACKING_\n const newValue = this.computeValue_(true)\n\n const changed =\n wasSuspended ||\n isCaughtException(oldValue) ||\n isCaughtException(newValue) ||\n !this.equals_(oldValue, newValue)\n\n if (changed) {\n this.value_ = newValue\n\n if (__DEV__ && isSpyEnabled()) {\n spyReport({\n observableKind: \"computed\",\n debugObjectName: this.name_,\n object: this.scope_,\n type: \"update\",\n oldValue,\n newValue\n } as IComputedDidChange)\n }\n }\n\n return changed\n }\n\n computeValue_(track: boolean) {\n this.isComputing_ = true\n // don't allow state changes during computation\n const prev = allowStateChangesStart(false)\n let res: T | CaughtException\n if (track) {\n res = trackDerivedFunction(this, this.derivation, this.scope_)\n } else {\n if (globalState.disableErrorBoundaries === true) {\n res = this.derivation.call(this.scope_)\n } else {\n try {\n res = this.derivation.call(this.scope_)\n } catch (e) {\n res = new CaughtException(e)\n }\n }\n }\n allowStateChangesEnd(prev)\n this.isComputing_ = false\n return res\n }\n\n suspend_() {\n if (!this.keepAlive_) {\n clearObserving(this)\n this.value_ = undefined // don't hold on to computed value!\n if (__DEV__ && this.isTracing_ !== TraceMode.NONE) {\n console.log(\n `[mobx.trace] Computed value '${this.name_}' was suspended and it will recompute on the next access.`\n )\n }\n }\n }\n\n observe_(listener: (change: IComputedDidChange<T>) => void, fireImmediately?: boolean): Lambda {\n let firstTime = true\n let prevValue: T | undefined = undefined\n return autorun(() => {\n // TODO: why is this in a different place than the spyReport() function? in all other observables it's called in the same place\n let newValue = this.get()\n if (!firstTime || fireImmediately) {\n const prevU = untrackedStart()\n listener({\n observableKind: \"computed\",\n debugObjectName: this.name_,\n type: UPDATE,\n object: this,\n newValue,\n oldValue: prevValue\n })\n untrackedEnd(prevU)\n }\n firstTime = false\n prevValue = newValue\n })\n }\n\n warnAboutUntrackedRead_() {\n if (!__DEV__) {\n return\n }\n if (this.isTracing_ !== TraceMode.NONE) {\n console.log(\n `[mobx.trace] Computed value '${this.name_}' is being read outside a reactive context. Doing a full recompute.`\n )\n }\n if (\n typeof this.requiresReaction_ === \"boolean\"\n ? this.requiresReaction_\n : globalState.computedRequiresReaction\n ) {\n console.warn(\n `[mobx] Computed value '${this.name_}' is being read outside a reactive context. Doing a full recompute.`\n )\n }\n }\n\n toString() {\n return `${this.name_}[${this.derivation.toString()}]`\n }\n\n valueOf(): T {\n return toPrimitive(this.get())\n }\n\n [Symbol.toPrimitive]() {\n return this.valueOf()\n }\n}\n\nexport const isComputedValue = createInstanceofPredicate(\"ComputedValue\", ComputedValue)\n","import {\n IAtom,\n IDepTreeNode,\n IObservable,\n addObserver,\n globalState,\n isComputedValue,\n removeObserver\n} from \"../internal\"\n\nexport enum IDerivationState_ {\n // before being run or (outside batch and not being observed)\n // at this point derivation is not holding any data about dependency tree\n NOT_TRACKING_ = -1,\n // no shallow dependency changed since last computation\n // won't recalculate derivation\n // this is what makes mobx fast\n UP_TO_DATE_ = 0,\n // some deep dependency changed, but don't know if shallow dependency changed\n // will require to check first if UP_TO_DATE or POSSIBLY_STALE\n // currently only ComputedValue will propagate POSSIBLY_STALE\n //\n // having this state is second big optimization:\n // don't have to recompute on every dependency change, but only when it's needed\n POSSIBLY_STALE_ = 1,\n // A shallow dependency has changed since last computation and the derivation\n // will need to recompute when it's needed next.\n STALE_ = 2\n}\n\nexport enum TraceMode {\n NONE,\n LOG,\n BREAK\n}\n\n/**\n * A derivation is everything that can be derived from the state (all the atoms) in a pure manner.\n * See https://medium.com/@mweststrate/becoming-fully-reactive-an-in-depth-explanation-of-mobservable-55995262a254#.xvbh6qd74\n */\nexport interface IDerivation extends IDepTreeNode {\n observing_: IObservable[]\n newObserving_: null | IObservable[]\n dependenciesState_: IDerivationState_\n /**\n * Id of the current run of a derivation. Each time the derivation is tracked\n * this number is increased by one. This number is globally unique\n */\n runId_: number\n /**\n * amount of dependencies used by the derivation in this run, which has not been bound yet.\n */\n unboundDepsCount_: number\n onBecomeStale_(): void\n isTracing_: TraceMode\n\n /**\n * warn if the derivation has no dependencies after creation/update\n */\n requiresObservable_?: boolean\n}\n\nexport class CaughtException {\n constructor(public cause: any) {\n // Empty\n }\n}\n\nexport function isCaughtException(e: any): e is CaughtException {\n return e instanceof CaughtException\n}\n\n/**\n * Finds out whether any dependency of the derivation has actually changed.\n * If dependenciesState is 1 then it will recalculate dependencies,\n * if any dependency changed it will propagate it by changing dependenciesState to 2.\n *\n * By iterating over the dependencies in the same order that they were reported and\n * stopping on the first change, all the recalculations are only called for ComputedValues\n * that will be tracked by derivation. That is because we assume that if the first x\n * dependencies of the derivation doesn't change then the derivation should run the same way\n * up until accessing x-th dependency.\n */\nexport function shouldCompute(derivation: IDerivation): boolean {\n switch (derivation.dependenciesState_) {\n case IDerivationState_.UP_TO_DATE_:\n return false\n case IDerivationState_.NOT_TRACKING_:\n case IDerivationState_.STALE_:\n return true\n case IDerivationState_.POSSIBLY_STALE_: {\n // state propagation can occur outside of action/reactive context #2195\n const prevAllowStateReads = allowStateReadsStart(true)\n const prevUntracked = untrackedStart() // no need for those computeds to be reported, they will be picked up in trackDerivedFunction.\n const obs = derivation.observing_,\n l = obs.length\n for (let i = 0; i < l; i++) {\n const obj = obs[i]\n if (isComputedValue(obj)) {\n if (globalState.disableErrorBoundaries) {\n obj.get()\n } else {\n try {\n obj.get()\n } catch (e) {\n // we are not interested in the value *or* exception at this moment, but if there is one, notify all\n untrackedEnd(prevUntracked)\n allowStateReadsEnd(prevAllowStateReads)\n return true\n }\n }\n // if ComputedValue `obj` actually changed it will be computed and propagated to its observers.\n // and `derivation` is an observer of `obj`\n // invariantShouldCompute(derivation)\n if ((derivation.dependenciesState_ as any) === IDerivationState_.STALE_) {\n untrackedEnd(prevUntracked)\n allowStateReadsEnd(prevAllowStateReads)\n return true\n }\n }\n }\n changeDependenciesStateTo0(derivation)\n untrackedEnd(prevUntracked)\n allowStateReadsEnd(prevAllowStateReads)\n return false\n }\n }\n}\n\nexport function isComputingDerivation() {\n return globalState.trackingDerivation !== null // filter out actions inside computations\n}\n\nexport function checkIfStateModificationsAreAllowed(atom: IAtom) {\n if (!__DEV__) {\n return\n }\n const hasObservers = atom.observers_.size > 0\n // Should not be possible to change observed state outside strict mode, except during initialization, see #563\n if (\n !globalState.allowStateChanges &&\n (hasObservers || globalState.enforceActions === \"always\")\n ) {\n console.warn(\n \"[MobX] \" +\n (globalState.enforceActions\n ? \"Since strict-mode is enabled, changing (observed) observable values without using an action is not allowed. Tried to modify: \"\n : \"Side effects like changing state are not allowed at this point. Are you trying to modify state from, for example, a computed value or the render function of a React component? You can wrap side effects in 'runInAction' (or decorate functions with 'action') if needed. Tried to modify: \") +\n atom.name_\n )\n }\n}\n\nexport function checkIfStateReadsAreAllowed(observable: IObservable) {\n if (__DEV__ && !globalState.allowStateReads && globalState.observableRequiresReaction) {\n console.warn(\n `[mobx] Observable '${observable.name_}' being read outside a reactive context.`\n )\n }\n}\n\n/**\n * Executes the provided function `f` and tracks which observables are being accessed.\n * The tracking information is stored on the `derivation` object and the derivation is registered\n * as observer of any of the accessed observables.\n */\nexport function trackDerivedFunction<T>(derivation: IDerivation, f: () => T, context: any) {\n const prevAllowStateReads = allowStateReadsStart(true)\n // pre allocate array allocation + room for variation in deps\n // array will be trimmed by bindDependencies\n changeDependenciesStateTo0(derivation)\n derivation.newObserving_ = new Array(derivation.observing_.length + 100)\n derivation.unboundDepsCount_ = 0\n derivation.runId_ = ++globalState.runId\n const prevTracking = globalState.trackingDerivation\n globalState.trackingDerivation = derivation\n globalState.inBatch++\n let result\n if (globalState.disableErrorBoundaries === true) {\n result = f.call(context)\n } else {\n try {\n result = f.call(context)\n } catch (e) {\n result = new CaughtException(e)\n }\n }\n globalState.inBatch--\n globalState.trackingDerivation = prevTracking\n bindDependencies(derivation)\n\n warnAboutDerivationWithoutDependencies(derivation)\n allowStateReadsEnd(prevAllowStateReads)\n return result\n}\n\nfunction warnAboutDerivationWithoutDependencies(derivation: IDerivation) {\n if (!__DEV__) {\n return\n }\n\n if (derivation.observing_.length !== 0) {\n return\n }\n\n if (\n typeof derivation.requiresObservable_ === \"boolean\"\n ? derivation.requiresObservable_\n : globalState.reactionRequiresObservable\n ) {\n console.warn(\n `[mobx] Derivation '${derivation.name_}' is created/updated without reading any observable value.`\n )\n }\n}\n\n/**\n * diffs newObserving with observing.\n * update observing to be newObserving with unique observables\n * notify observers that become observed/unobserved\n */\nfunction bindDependencies(derivation: IDerivation) {\n // invariant(derivation.dependenciesState !== IDerivationState.NOT_TRACKING, \"INTERNAL ERROR bindDependencies expects derivation.dependenciesState !== -1\");\n const prevObserving = derivation.observing_\n const observing = (derivation.observing_ = derivation.newObserving_!)\n let lowestNewObservingDerivationState = IDerivationState_.UP_TO_DATE_\n\n // Go through all new observables and check diffValue: (this list can contain duplicates):\n // 0: first occurrence, change to 1 and keep it\n // 1: extra occurrence, drop it\n let i0 = 0,\n l = derivation.unboundDepsCount_\n for (let i = 0; i < l; i++) {\n const dep = observing[i]\n if (dep.diffValue_ === 0) {\n dep.diffValue_ = 1\n if (i0 !== i) {\n observing[i0] = dep\n }\n i0++\n }\n\n // Upcast is 'safe' here, because if dep is IObservable, `dependenciesState` will be undefined,\n // not hitting the condition\n if ((dep as any as IDerivation).dependenciesState_ > lowestNewObservingDerivationState) {\n lowestNewObservingDerivationState = (dep as any as IDerivation).dependenciesState_\n }\n }\n observing.length = i0\n\n derivation.newObserving_ = null // newObserving shouldn't be needed outside tracking (statement moved down to work around FF bug, see #614)\n\n // Go through all old observables and check diffValue: (it is unique after last bindDependencies)\n // 0: it's not in new observables, unobserve it\n // 1: it keeps being observed, don't want to notify it. change to 0\n l = prevObserving.length\n while (l--) {\n const dep = prevObserving[l]\n if (dep.diffValue_ === 0) {\n removeObserver(dep, derivation)\n }\n dep.diffValue_ = 0\n }\n\n // Go through all new observables and check diffValue: (now it should be unique)\n // 0: it was set to 0 in last loop. don't need to do anything.\n // 1: it wasn't observed, let's observe it. set back to 0\n while (i0--) {\n const dep = observing[i0]\n if (dep.diffValue_ === 1) {\n dep.diffValue_ = 0\n addObserver(dep, derivation)\n }\n }\n\n // Some new observed derivations may become stale during this derivation computation\n // so they have had no chance to propagate staleness (#916)\n if (lowestNewObservingDerivationState !== IDerivationState_.UP_TO_DATE_) {\n derivation.dependenciesState_ = lowestNewObservingDerivationState\n derivation.onBecomeStale_()\n }\n}\n\nexport function clearObserving(derivation: IDerivation) {\n // invariant(globalState.inBatch > 0, \"INTERNAL ERROR clearObserving should be called only inside batch\");\n const obs = derivation.observing_\n derivation.observing_ = []\n let i = obs.length\n while (i--) {\n removeObserver(obs[i], derivation)\n }\n\n derivation.dependenciesState_ = IDerivationState_.NOT_TRACKING_\n}\n\nexport function untracked<T>(action: () => T): T {\n const prev = untrackedStart()\n try {\n return action()\n } finally {\n untrackedEnd(prev)\n }\n}\n\nexport function untrackedStart(): IDerivation | null {\n const prev = globalState.trackingDerivation\n globalState.trackingDerivation = null\n return prev\n}\n\nexport function untrackedEnd(prev: IDerivation | null) {\n globalState.trackingDerivation = prev\n}\n\nexport function allowStateReadsStart(allowStateReads: boolean) {\n const prev = globalState.allowStateReads\n globalState.allowStateReads = allowStateReads\n return prev\n}\n\nexport function allowStateReadsEnd(prev: boolean) {\n globalState.allowStateReads = prev\n}\n\n/**\n * needed to keep `lowestObserverState` correct. when changing from (2 or 1) to 0\n *\n */\nexport function changeDependenciesStateTo0(derivation: IDerivation) {\n if (derivation.dependenciesState_ === IDerivationState_.UP_TO_DATE_) {\n return\n }\n derivation.dependenciesState_ = IDerivationState_.UP_TO_DATE_\n\n const obs = derivation.observing_\n let i = obs.length\n while (i--) {\n obs[i].lowestObserverState_ = IDerivationState_.UP_TO_DATE_\n }\n}\n","import { IDerivation, IObservable, Reaction, die, getGlobal } from \"../internal\"\nimport { ComputedValue } from \"./computedvalue\"\n\n/**\n * These values will persist if global state is reset\n */\nconst persistentKeys: (keyof MobXGlobals)[] = [\n \"mobxGuid\",\n \"spyListeners\",\n \"enforceActions\",\n \"computedRequiresReaction\",\n \"reactionRequiresObservable\",\n \"observableRequiresReaction\",\n \"allowStateReads\",\n \"disableErrorBoundaries\",\n \"runId\",\n \"UNCHANGED\",\n \"useProxies\"\n]\n\nexport type IUNCHANGED = {}\n\nexport class MobXGlobals {\n /**\n * MobXGlobals version.\n * MobX compatiblity with other versions loaded in memory as long as this version matches.\n * It indicates that the global state still stores similar information\n *\n * N.B: this version is unrelated to the package version of MobX, and is only the version of the\n * internal state storage of MobX, and can be the same across many different package versions\n */\n version = 6\n\n /**\n * globally unique token to signal unchanged\n */\n UNCHANGED: IUNCHANGED = {}\n\n /**\n * Currently running derivation\n */\n trackingDerivation: IDerivation | null = null\n\n /**\n * Currently running reaction. This determines if we currently have a reactive context.\n * (Tracking derivation is also set for temporal tracking of computed values inside actions,\n * but trackingReaction can only be set by a form of Reaction)\n */\n trackingContext: Reaction | ComputedValue<any> | null = null\n\n /**\n * Each time a derivation is tracked, it is assigned a unique run-id\n */\n runId = 0\n\n /**\n * 'guid' for general purpose. Will be persisted amongst resets.\n */\n mobxGuid = 0\n\n /**\n * Are we in a batch block? (and how many of them)\n */\n inBatch: number = 0\n\n /**\n * Observables that don't have observers anymore, and are about to be\n * suspended, unless somebody else accesses it in the same batch\n *\n * @type {IObservable[]}\n */\n pendingUnobservations: IObservable[] = []\n\n /**\n * List of scheduled, not yet executed, reactions.\n */\n pendingReactions: Reaction[] = []\n\n /**\n * Are we currently processing reactions?\n */\n isRunningReactions = false\n\n /**\n * Is it allowed to change observables at this point?\n * In general, MobX doesn't allow that when running computations and React.render.\n * To ensure that those functions stay pure.\n */\n allowStateChanges = false\n\n /**\n * Is it allowed to read observables at this point?\n * Used to hold the state needed for `observableRequiresReaction`\n */\n allowStateReads = true\n\n /**\n * If strict mode is enabled, state changes are by default not allowed\n */\n enforceActions: boolean | \"always\" = true\n\n /**\n * Spy callbacks\n */\n spyListeners: { (change: any): void }[] = []\n\n /**\n * Globally attached error handlers that react specifically to errors in reactions\n */\n globalReactionErrorHandlers: ((error: any, derivation: IDerivation) => void)[] = []\n\n /**\n * Warn if computed values are accessed outside a reactive context\n */\n computedRequiresReaction = false\n\n /**\n * (Experimental)\n * Warn if you try to create to derivation / reactive context without accessing any observable.\n */\n reactionRequiresObservable = false\n\n /**\n * (Experimental)\n * Warn if observables are accessed outside a reactive context\n */\n observableRequiresReaction = false\n\n /*\n * Don't catch and rethrow exceptions. This is useful for inspecting the state of\n * the stack when an exception occurs while debugging.\n */\n disableErrorBoundaries = false\n\n /*\n * If true, we are already handling an exception in an action. Any errors in reactions should be suppressed, as\n * they are not the cause, see: https://github.com/mobxjs/mobx/issues/1836\n */\n suppressReactionErrors = false\n\n useProxies = true\n /*\n * print warnings about code that would fail if proxies weren't available\n */\n verifyProxies = false\n\n /**\n * False forces all object's descriptors to\n * writable: true\n * configurable: true\n */\n safeDescriptors = true\n}\n\nlet canMergeGlobalState = true\nlet isolateCalled = false\n\nexport let globalState: MobXGlobals = (function () {\n let global = getGlobal()\n if (global.__mobxInstanceCount > 0 && !global.__mobxGlobals) {\n canMergeGlobalState = false\n }\n if (global.__mobxGlobals && global.__mobxGlobals.version !== new MobXGlobals().version) {\n canMergeGlobalState = false\n }\n\n if (!canMergeGlobalState) {\n // Because this is a IIFE we need to let isolateCalled a chance to change\n // so we run it after the event loop completed at least 1 iteration\n setTimeout(() => {\n if (!isolateCalled) {\n die(35)\n }\n }, 1)\n return new MobXGlobals()\n } else if (global.__mobxGlobals) {\n global.__mobxInstanceCount += 1\n if (!global.__mobxGlobals.UNCHANGED) {\n global.__mobxGlobals.UNCHANGED = {}\n } // make merge backward compatible\n return global.__mobxGlobals\n } else {\n global.__mobxInstanceCount = 1\n return (global.__mobxGlobals = new MobXGlobals())\n }\n})()\n\nexport function isolateGlobalState() {\n if (\n globalState.pendingReactions.length ||\n globalState.inBatch ||\n globalState.isRunningReactions\n ) {\n die(36)\n }\n isolateCalled = true\n if (canMergeGlobalState) {\n let global = getGlobal()\n if (--global.__mobxInstanceCount === 0) {\n global.__mobxGlobals = undefined\n }\n globalState = new MobXGlobals()\n }\n}\n\nexport function getGlobalState(): any {\n return globalState\n}\n\n/**\n * For testing purposes only; this will break the internal state of existing observables,\n * but can be used to get back at a stable state after throwing errors\n */\nexport function resetGlobalState() {\n const defaultGlobals = new MobXGlobals()\n for (let key in defaultGlobals) {\n if (persistentKeys.indexOf(key as any) === -1) {\n globalState[key] = defaultGlobals[key]\n }\n }\n globalState.allowStateChanges = !globalState.enforceActions\n}\n","import {\n Lambda,\n ComputedValue,\n IDependencyTree,\n IDerivation,\n IDerivationState_,\n TraceMode,\n getDependencyTree,\n globalState,\n runReactions,\n checkIfStateReadsAreAllowed\n} from \"../internal\"\n\nexport interface IDepTreeNode {\n name_: string\n observing_?: IObservable[]\n}\n\nexport interface IObservable extends IDepTreeNode {\n diffValue_: number\n /**\n * Id of the derivation *run* that last accessed this observable.\n * If this id equals the *run* id of the current derivation,\n * the dependency is already established\n */\n lastAccessedBy_: number\n isBeingObserved_: boolean\n\n lowestObserverState_: IDerivationState_ // Used to avoid redundant propagations\n isPendingUnobservation_: boolean // Used to push itself to global.pendingUnobservations at most once per batch.\n\n observers_: Set<IDerivation>\n\n onBUO(): void\n onBO(): void\n\n onBUOL: Set<Lambda> | undefined\n onBOL: Set<Lambda> | undefined\n}\n\nexport function hasObservers(observable: IObservable): boolean {\n return observable.observers_ && observable.observers_.size > 0\n}\n\nexport function getObservers(observable: IObservable): Set<IDerivation> {\n return observable.observers_\n}\n\n// function invariantObservers(observable: IObservable) {\n// const list = observable.observers\n// const map = observable.observersIndexes\n// const l = list.length\n// for (let i = 0; i < l; i++) {\n// const id = list[i].__mapid\n// if (i) {\n// invariant(map[id] === i, \"INTERNAL ERROR maps derivation.__mapid to index in list\") // for performance\n// } else {\n// invariant(!(id in map), \"INTERNAL ERROR observer on index 0 shouldn't be held in map.\") // for performance\n// }\n// }\n// invariant(\n// list.length === 0 || Object.keys(map).length === list.length - 1,\n// \"INTERNAL ERROR there is no junk in map\"\n// )\n// }\nexport function addObserver(observable: IObservable, node: IDerivation) {\n // invariant(node.dependenciesState !== -1, \"INTERNAL ERROR, can add only dependenciesState !== -1\");\n // invariant(observable._observers.indexOf(node) === -1, \"INTERNAL ERROR add already added node\");\n // invariantObservers(observable);\n\n observable.observers_.add(node)\n if (observable.lowestObserverState_ > node.dependenciesState_) {\n observable.lowestObserverState_ = node.dependenciesState_\n }\n\n // invariantObservers(observable);\n // invariant(observable._observers.indexOf(node) !== -1, \"INTERNAL ERROR didn't add node\");\n}\n\nexport function removeObserver(observable: IObservable, node: IDerivation) {\n // invariant(globalState.inBatch > 0, \"INTERNAL ERROR, remove should be called only inside batch\");\n // invariant(observable._observers.indexOf(node) !== -1, \"INTERNAL ERROR remove already removed node\");\n // invariantObservers(observable);\n observable.observers_.delete(node)\n if (observable.observers_.size === 0) {\n // deleting last observer\n queueForUnobservation(observable)\n }\n // invariantObservers(observable);\n // invariant(observable._observers.indexOf(node) === -1, \"INTERNAL ERROR remove already removed node2\");\n}\n\nexport function queueForUnobservation(observable: IObservable) {\n if (observable.isPendingUnobservation_ === false) {\n // invariant(observable._observers.length === 0, \"INTERNAL ERROR, should only queue for unobservation unobserved observables\");\n observable.isPendingUnobservation_ = true\n globalState.pendingUnobservations.push(observable)\n }\n}\n\n/**\n * Batch starts a transaction, at least for purposes of memoizing ComputedValues when nothing else does.\n * During a batch `onBecomeUnobserved` will be called at most once per observable.\n * Avoids unnecessary recalculations.\n */\nexport function startBatch() {\n globalState.inBatch++\n}\n\nexport function endBatch() {\n if (--globalState.inBatch === 0) {\n runReactions()\n // the batch is actually about to finish, all unobserving should happen here.\n const list = globalState.pendingUnobservations\n for (let i = 0; i < list.length; i++) {\n const observable = list[i]\n observable.isPendingUnobservation_ = false\n if (observable.observers_.size === 0) {\n if (observable.isBeingObserved_) {\n // if this observable had reactive observers, trigger the hooks\n observable.isBeingObserved_ = false\n observable.onBUO()\n }\n if (observable instanceof ComputedValue) {\n // computed values are automatically teared down when the last observer leaves\n // this process happens recursively, this computed might be the last observabe of another, etc..\n observable.suspend_()\n }\n }\n }\n globalState.pendingUnobservations = []\n }\n}\n\nexport function reportObserved(observable: IObservable): boolean {\n checkIfStateReadsAreAllowed(observable)\n\n const derivation = globalState.trackingDerivation\n if (derivation !== null) {\n /**\n * Simple optimization, give each derivation run an unique id (runId)\n * Check if last time this observable was accessed the same runId is used\n * if this is the case, the relation is already known\n */\n if (derivation.runId_ !== observable.lastAccessedBy_) {\n observable.lastAccessedBy_ = derivation.runId_\n // Tried storing newObserving, or observing, or both as Set, but performance didn't come close...\n derivation.newObserving_![derivation.unboundDepsCount_++] = observable\n if (!observable.isBeingObserved_ && globalState.trackingContext) {\n observable.isBeingObserved_ = true\n observable.onBO()\n }\n }\n return observable.isBeingObserved_\n } else if (observable.observers_.size === 0 && globalState.inBatch > 0) {\n queueForUnobservation(observable)\n }\n\n return false\n}\n\n// function invariantLOS(observable: IObservable, msg: string) {\n// // it's expensive so better not run it in produciton. but temporarily helpful for testing\n// const min = getObservers(observable).reduce((a, b) => Math.min(a, b.dependenciesState), 2)\n// if (min >= observable.lowestObserverState) return // <- the only assumption about `lowestObserverState`\n// throw new Error(\n// \"lowestObserverState is wrong for \" +\n// msg +\n// \" because \" +\n// min +\n// \" < \" +\n// observable.lowestObserverState\n// )\n// }\n\n/**\n * NOTE: current propagation mechanism will in case of self reruning autoruns behave unexpectedly\n * It will propagate changes to observers from previous run\n * It's hard or maybe impossible (with reasonable perf) to get it right with current approach\n * Hopefully self reruning autoruns aren't a feature people should depend on\n * Also most basic use cases should be ok\n */\n\n// Called by Atom when its value changes\nexport function propagateChanged(observable: IObservable) {\n // invariantLOS(observable, \"changed start\");\n if (observable.lowestObserverState_ === IDerivationState_.STALE_) {\n return\n }\n observable.lowestObserverState_ = IDerivationState_.STALE_\n\n // Ideally we use for..of here, but the downcompiled version is really slow...\n observable.observers_.forEach(d => {\n if (d.dependenciesState_ === IDerivationState_.UP_TO_DATE_) {\n if (__DEV__ && d.isTracing_ !== TraceMode.NONE) {\n logTraceInfo(d, observable)\n }\n d.onBecomeStale_()\n }\n d.dependenciesState_ = IDerivationState_.STALE_\n })\n // invariantLOS(observable, \"changed end\");\n}\n\n// Called by ComputedValue when it recalculate and its value changed\nexport function propagateChangeConfirmed(observable: IObservable) {\n // invariantLOS(observable, \"confirmed start\");\n if (observable.lowestObserverState_ === IDerivationState_.STALE_) {\n return\n }\n observable.lowestObserverState_ = IDerivationState_.STALE_\n\n observable.observers_.forEach(d => {\n if (d.dependenciesState_ === IDerivationState_.POSSIBLY_STALE_) {\n d.dependenciesState_ = IDerivationState_.STALE_\n if (__DEV__ && d.isTracing_ !== TraceMode.NONE) {\n logTraceInfo(d, observable)\n }\n } else if (\n d.dependenciesState_ === IDerivationState_.UP_TO_DATE_ // this happens during computing of `d`, just keep lowestObserverState up to date.\n ) {\n observable.lowestObserverState_ = IDerivationState_.UP_TO_DATE_\n }\n })\n // invariantLOS(observable, \"confirmed end\");\n}\n\n// Used by computed when its dependency changed, but we don't wan't to immediately recompute.\nexport function propagateMaybeChanged(observable: IObservable) {\n // invariantLOS(observable, \"maybe start\");\n if (observable.lowestObserverState_ !== IDerivationState_.UP_TO_DATE_) {\n return\n }\n observable.lowestObserverState_ = IDerivationState_.POSSIBLY_STALE_\n\n observable.observers_.forEach(d => {\n if (d.dependenciesState_ === IDerivationState_.UP_TO_DATE_) {\n d.dependenciesState_ = IDerivationState_.POSSIBLY_STALE_\n d.onBecomeStale_()\n }\n })\n // invariantLOS(observable, \"maybe end\");\n}\n\nfunction logTraceInfo(derivation: IDerivation, observable: IObservable) {\n console.log(\n `[mobx.trace] '${derivation.name_}' is invalidated due to a change in: '${observable.name_}'`\n )\n if (derivation.isTracing_ === TraceMode.BREAK) {\n const lines = []\n printDepTree(getDependencyTree(derivation), lines, 1)\n\n // prettier-ignore\n new Function(\n`debugger;\n/*\nTracing '${derivation.name_}'\n\nYou are entering this break point because derivation '${derivation.name_}' is being traced and '${observable.name_}' is now forcing it to update.\nJust follow the stacktrace you should now see in the devtools to see precisely what piece of your code is causing this update\nThe stackframe you are looking for is at least ~6-8 stack-frames up.\n\n${derivation instanceof ComputedValue ? derivation.derivation.toString().replace(/[*]\\//g, \"/\") : \"\"}\n\nThe dependencies for this derivation are:\n\n${lines.join(\"\\n\")}\n*/\n `)()\n }\n}\n\nfunction printDepTree(tree: IDependencyTree, lines: string[], depth: number) {\n if (lines.length >= 1000) {\n lines.push(\"(and many more)\")\n return\n }\n lines.push(`${\"\\t\".repeat(depth - 1)}${tree.name}`)\n if (tree.dependencies) {\n tree.dependencies.forEach(child => printDepTree(child, lines, depth + 1))\n }\n}\n","import {\n $mobx,\n IDerivation,\n IDerivationState_,\n IObservable,\n Lambda,\n TraceMode,\n clearObserving,\n createInstanceofPredicate,\n endBatch,\n getNextId,\n globalState,\n isCaughtException,\n isSpyEnabled,\n shouldCompute,\n spyReport,\n spyReportEnd,\n spyReportStart,\n startBatch,\n trace,\n trackDerivedFunction, GenericAbortSignal\n} from \"../internal\"\n\n/**\n * Reactions are a special kind of derivations. Several things distinguishes them from normal reactive computations\n *\n * 1) They will always run, whether they are used by other computations or not.\n * This means that they are very suitable for triggering side effects like logging, updating the DOM and making network requests.\n * 2) They are not observable themselves\n * 3) They will always run after any 'normal' derivations\n * 4) They are allowed to change the state and thereby triggering themselves again, as long as they make sure the state propagates to a stable state in a reasonable amount of iterations.\n *\n * The state machine of a Reaction is as follows:\n *\n * 1) after creating, the reaction should be started by calling `runReaction` or by scheduling it (see also `autorun`)\n * 2) the `onInvalidate` handler should somehow result in a call to `this.track(someFunction)`\n * 3) all observables accessed in `someFunction` will be observed by this reaction.\n * 4) as soon as some of the dependencies has changed the Reaction will be rescheduled for another run (after the current mutation or transaction). `isScheduled` will yield true once a dependency is stale and during this period\n * 5) `onInvalidate` will be called, and we are back at step 1.\n *\n */\n\nexport interface IReactionPublic {\n dispose(): void\n trace(enterBreakPoint?: boolean): void\n}\n\nexport interface IReactionDisposer {\n (): void\n $mobx: Reaction\n}\n\nexport class Reaction implements IDerivation, IReactionPublic {\n observing_: IObservable[] = [] // nodes we are looking at. Our value depends on these nodes\n newObserving_: IObservable[] = []\n dependenciesState_ = IDerivationState_.NOT_TRACKING_\n diffValue_ = 0\n runId_ = 0\n unboundDepsCount_ = 0\n isDisposed_ = false\n isScheduled_ = false\n isTrackPending_ = false\n isRunning_ = false\n isTracing_: TraceMode = TraceMode.NONE\n\n constructor(\n public name_: string = __DEV__ ? \"Reaction@\" + getNextId() : \"Reaction\",\n private onInvalidate_: () => void,\n private errorHandler_?: (error: any, derivation: IDerivation) => void,\n public requiresObservable_?\n ) {}\n\n onBecomeStale_() {\n this.schedule_()\n }\n\n schedule_() {\n if (!this.isScheduled_) {\n this.isScheduled_ = true\n globalState.pendingReactions.push(this)\n runReactions()\n }\n }\n\n isScheduled() {\n return this.isScheduled_\n }\n\n /**\n * internal, use schedule() if you intend to kick off a reaction\n */\n runReaction_() {\n if (!this.isDisposed_) {\n startBatch()\n this.isScheduled_ = false\n const prev = globalState.trackingContext\n globalState.trackingContext = this\n if (shouldCompute(this)) {\n this.isTrackPending_ = true\n\n try {\n this.onInvalidate_()\n if (__DEV__ && this.isTrackPending_ && isSpyEnabled()) {\n // onInvalidate didn't trigger track right away..\n spyReport({\n name: this.name_,\n type: \"scheduled-reaction\"\n })\n }\n } catch (e) {\n this.reportExceptionInDerivation_(e)\n }\n }\n globalState.trackingContext = prev\n endBatch()\n }\n }\n\n track(fn: () => void) {\n if (this.isDisposed_) {\n return\n // console.warn(\"Reaction already disposed\") // Note: Not a warning / error in mobx 4 either\n }\n startBatch()\n const notify = isSpyEnabled()\n let startTime\n if (__DEV__ && notify) {\n startTime = Date.now()\n spyReportStart({\n name: this.name_,\n type: \"reaction\"\n })\n }\n this.isRunning_ = true\n const prevReaction = globalState.trackingContext // reactions could create reactions...\n globalState.trackingContext = this\n const result = trackDerivedFunction(this, fn, undefined)\n globalState.trackingContext = prevReaction\n this.isRunning_ = false\n this.isTrackPending_ = false\n if (this.isDisposed_) {\n // disposed during last run. Clean up everything that was bound after the dispose call.\n clearObserving(this)\n }\n if (isCaughtException(result)) {\n this.reportExceptionInDerivation_(result.cause)\n }\n if (__DEV__ && notify) {\n spyReportEnd({\n time: Date.now() - startTime\n })\n }\n endBatch()\n }\n\n reportExceptionInDerivation_(error: any) {\n if (this.errorHandler_) {\n this.errorHandler_(error, this)\n return\n }\n\n if (globalState.disableErrorBoundaries) {\n throw error\n }\n\n const message = __DEV__\n ? `[mobx] Encountered an uncaught exception that was thrown by a reaction or observer component, in: '${this}'`\n : `[mobx] uncaught error in '${this}'`\n if (!globalState.suppressReactionErrors) {\n console.error(message, error)\n /** If debugging brought you here, please, read the above message :-). Tnx! */\n } else if (__DEV__) { console.warn(`[mobx] (error in reaction '${this.name_}' suppressed, fix error of causing action below)`) } // prettier-ignore\n\n if (__DEV__ && isSpyEnabled()) {\n spyReport({\n type: \"error\",\n name: this.name_,\n message,\n error: \"\" + error\n })\n }\n\n globalState.globalReactionErrorHandlers.forEach(f => f(error, this))\n }\n\n dispose() {\n if (!this.isDisposed_) {\n this.isDisposed_ = true\n if (!this.isRunning_) {\n // if disposed while running, clean up later. Maybe not optimal, but rare case\n startBatch()\n clearObserving(this)\n endBatch()\n }\n }\n }\n\n getDisposer_(abortSignal?: GenericAbortSignal): IReactionDisposer {\n const dispose = (() => {\n this.dispose()\n abortSignal?.removeEventListener?.(\"abort\", dispose)\n }) as IReactionDisposer\n abortSignal?.addEventListener?.(\"abort\", dispose)\n dispose[$mobx] = this\n\n return dispose\n }\n\n toString() {\n return `Reaction[${this.name_}]`\n }\n\n trace(enterBreakPoint: boolean = false) {\n trace(this, enterBreakPoint)\n }\n}\n\nexport function onReactionError(handler: (error: any, derivation: IDerivation) => void): Lambda {\n globalState.globalReactionErrorHandlers.push(handler)\n return () => {\n const idx = globalState.globalReactionErrorHandlers.indexOf(handler)\n if (idx >= 0) {\n globalState.globalReactionErrorHandlers.splice(idx, 1)\n }\n }\n}\n\n/**\n * Magic number alert!\n * Defines within how many times a reaction is allowed to re-trigger itself\n * until it is assumed that this is gonna be a never ending loop...\n */\nconst MAX_REACTION_ITERATIONS = 100\n\nlet reactionScheduler: (fn: () => void) => void = f => f()\n\nexport function runReactions() {\n // Trampolining, if runReactions are already running, new reactions will be picked up\n if (globalState.inBatch > 0 || globalState.isRunningReactions) {\n return\n }\n reactionScheduler(runReactionsHelper)\n}\n\nfunction runReactionsHelper() {\n globalState.isRunningReactions = true\n const allReactions = globalState.pendingReactions\n let iterations = 0\n\n // While running reactions, new reactions might be triggered.\n // Hence we work with two variables and check whether\n // we converge to no remaining reactions after a while.\n while (allReactions.length > 0) {\n if (++iterations === MAX_REACTION_ITERATIONS) {\n console.error(\n __DEV__\n ? `Reaction doesn't converge to a stable state after ${MAX_REACTION_ITERATIONS} iterations.` +\n ` Probably there is a cycle in the reactive function: ${allReactions[0]}`\n : `[mobx] cycle in reaction: ${allReactions[0]}`\n )\n allReactions.splice(0) // clear reactions\n }\n let remainingReactions = allReactions.splice(0)\n for (let i = 0, l = remainingReactions.length; i < l; i++) {\n remainingReactions[i].runReaction_()\n }\n }\n globalState.isRunningReactions = false\n}\n\nexport const isReaction = createInstanceofPredicate(\"Reaction\", Reaction)\n\nexport function setReactionScheduler(fn: (f: () => void) => void) {\n const baseScheduler = reactionScheduler\n reactionScheduler = f => fn(() => baseScheduler(f))\n}\n","import { IComputedDidChange } from \"./computedvalue\"\nimport { IValueDidChange, IBoxDidChange } from \"./../types/observablevalue\"\nimport { IObjectDidChange } from \"./../types/observableobject\"\nimport { IArrayDidChange } from \"./../types/observablearray\"\nimport { Lambda, globalState, once, ISetDidChange, IMapDidChange } from \"../internal\"\n\nexport function isSpyEnabled() {\n return __DEV__ && !!globalState.spyListeners.length\n}\n\nexport type PureSpyEvent =\n | { type: \"action\"; name: string; object: unknown; arguments: unknown[] }\n | { type: \"scheduled-reaction\"; name: string }\n | { type: \"reaction\"; name: string }\n | { type: \"error\"; name: string; message: string; error: string }\n | IComputedDidChange<unknown>\n | IObjectDidChange<unknown>\n | IArrayDidChange<unknown>\n | IMapDidChange<unknown, unknown>\n | ISetDidChange<unknown>\n | IValueDidChange<unknown>\n | IBoxDidChange<unknown>\n | { type: \"report-end\"; spyReportEnd: true; time?: number }\n\ntype SpyEvent = PureSpyEvent & { spyReportStart?: true }\n\nexport function spyReport(event: SpyEvent) {\n if (!__DEV__) {\n return\n } // dead code elimination can do the rest\n if (!globalState.spyListeners.length) {\n return\n }\n const listeners = globalState.spyListeners\n for (let i = 0, l = listeners.length; i < l; i++) {\n listeners[i](event)\n }\n}\n\nexport function spyReportStart(event: PureSpyEvent) {\n if (!__DEV__) {\n return\n }\n const change = { ...event, spyReportStart: true as const }\n spyReport(change)\n}\n\nconst END_EVENT: SpyEvent = { type: \"report-end\", spyReportEnd: true }\n\nexport function spyReportEnd(change?: { time?: number }) {\n if (!__DEV__) {\n return\n }\n if (change) {\n spyReport({ ...change, type: \"report-end\", spyReportEnd: true })\n } else {\n spyReport(END_EVENT)\n }\n}\n\nexport function spy(listener: (change: SpyEvent) => void): Lambda {\n if (!__DEV__) {\n console.warn(`[mobx.spy] Is a no-op in production builds`)\n return function () {}\n } else {\n globalState.spyListeners.push(listener)\n return once(() => {\n globalState.spyListeners = globalState.spyListeners.filter(l => l !== listener)\n })\n }\n}\n","import {\n createAction,\n executeAction,\n Annotation,\n storeAnnotation,\n die,\n isFunction,\n isStringish,\n createDecoratorAnnotation,\n createActionAnnotation,\n is20223Decorator\n} from \"../internal\"\n\nimport type { ClassFieldDecorator, ClassMethodDecorator } from \"../types/decorator_fills\"\n\nexport const ACTION = \"action\"\nexport const ACTION_BOUND = \"action.bound\"\nexport const AUTOACTION = \"autoAction\"\nexport const AUTOACTION_BOUND = \"autoAction.bound\"\n\nconst DEFAULT_ACTION_NAME = \"<unnamed action>\"\n\nconst actionAnnotation = createActionAnnotation(ACTION)\nconst actionBoundAnnotation = createActionAnnotation(ACTION_BOUND, {\n bound: true\n})\nconst autoActionAnnotation = createActionAnnotation(AUTOACTION, {\n autoAction: true\n})\nconst autoActionBoundAnnotation = createActionAnnotation(AUTOACTION_BOUND, {\n autoAction: true,\n bound: true\n})\n\nexport interface IActionFactory\n extends Annotation,\n PropertyDecorator,\n ClassMethodDecorator,\n ClassFieldDecorator {\n // nameless actions\n <T extends Function | undefined | null>(fn: T): T\n // named actions\n <T extends Function | undefined | null>(name: string, fn: T): T\n\n // named decorator\n (customName: string): PropertyDecorator &\n Annotation &\n ClassMethodDecorator &\n ClassFieldDecorator\n\n // decorator (name no longer supported)\n bound: Annotation & PropertyDecorator & ClassMethodDecorator & ClassFieldDecorator\n}\n\nfunction createActionFactory(autoAction: boolean): IActionFactory {\n const res: IActionFactory = function action(arg1, arg2?): any {\n // action(fn() {})\n if (isFunction(arg1)) {\n return createAction(arg1.name || DEFAULT_ACTION_NAME, arg1, autoAction)\n }\n // action(\"name\", fn() {})\n if (isFunction(arg2)) {\n return createAction(arg1, arg2, autoAction)\n }\n // @action (2022.3 Decorators)\n if (is20223Decorator(arg2)) {\n return (autoAction ? autoActionAnnotation : actionAnnotation).decorate_20223_(\n arg1,\n arg2\n )\n }\n // @action\n if (isStringish(arg2)) {\n return storeAnnotation(arg1, arg2, autoAction ? autoActionAnnotation : actionAnnotation)\n }\n // action(\"name\") & @action(\"name\")\n if (isStringish(arg1)) {\n return createDecoratorAnnotation(\n createActionAnnotation(autoAction ? AUTOACTION : ACTION, {\n name: arg1,\n autoAction\n })\n )\n }\n\n if (__DEV__) {\n die(\"Invalid arguments for `action`\")\n }\n } as IActionFactory\n return res\n}\n\nexport const action: IActionFactory = createActionFactory(false)\nObject.assign(action, actionAnnotation)\nexport const autoAction: IActionFactory = createActionFactory(true)\nObject.assign(autoAction, autoActionAnnotation)\n\naction.bound = createDecoratorAnnotation(actionBoundAnnotation)\nautoAction.bound = createDecoratorAnnotation(autoActionBoundAnnotation)\n\nexport function runInAction<T>(fn: () => T): T {\n return executeAction(fn.name || DEFAULT_ACTION_NAME, false, fn, this, undefined)\n}\n\nexport function isAction(thing: any) {\n return isFunction(thing) && thing.isMobxAction === true\n}\n","import {\n EMPTY_OBJECT,\n IEqualsComparer,\n IReactionDisposer,\n IReactionPublic,\n Lambda,\n Reaction,\n action,\n comparer,\n getNextId,\n isAction,\n isFunction,\n isPlainObject,\n die,\n allowStateChanges,\n GenericAbortSignal\n} from \"../internal\"\n\nexport interface IAutorunOptions {\n delay?: number\n name?: string\n /**\n * Experimental.\n * Warns if the view doesn't track observables\n */\n requiresObservable?: boolean\n scheduler?: (callback: () => void) => any\n onError?: (error: any) => void\n signal?: GenericAbortSignal\n}\n\n/**\n * Creates a named reactive view and keeps it alive, so that the view is always\n * updated if one of the dependencies changes, even when the view is not further used by something else.\n * @param view The reactive view\n * @returns disposer function, which can be used to stop the view from being updated in the future.\n */\nexport function autorun(\n view: (r: IReactionPublic) => any,\n opts: IAutorunOptions = EMPTY_OBJECT\n): IReactionDisposer {\n if (__DEV__) {\n if (!isFunction(view)) {\n die(\"Autorun expects a function as first argument\")\n }\n if (isAction(view)) {\n die(\"Autorun does not accept actions since actions are untrackable\")\n }\n }\n\n const name: string =\n opts?.name ?? (__DEV__ ? (view as any).name || \"Autorun@\" + getNextId() : \"Autorun\")\n const runSync = !opts.scheduler && !opts.delay\n let reaction: Reaction\n\n if (runSync) {\n // normal autorun\n reaction = new Reaction(\n name,\n function (this: Reaction) {\n this.track(reactionRunner)\n },\n opts.onError,\n opts.requiresObservable\n )\n } else {\n const scheduler = createSchedulerFromOptions(opts)\n // debounced autorun\n let isScheduled = false\n\n reaction = new Reaction(\n name,\n () => {\n if (!isScheduled) {\n isScheduled = true\n scheduler(() => {\n isScheduled = false\n if (!reaction.isDisposed_) {\n reaction.track(reactionRunner)\n }\n })\n }\n },\n opts.onError,\n opts.requiresObservable\n )\n }\n\n function reactionRunner() {\n view(reaction)\n }\n\n if(!opts?.signal?.aborted) {\n reaction.schedule_()\n }\n return reaction.getDisposer_(opts?.signal)\n}\n\nexport type IReactionOptions<T, FireImmediately extends boolean> = IAutorunOptions & {\n fireImmediately?: FireImmediately\n equals?: IEqualsComparer<T>\n}\n\nconst run = (f: Lambda) => f()\n\nfunction createSchedulerFromOptions(opts: IAutorunOptions) {\n return opts.scheduler\n ? opts.scheduler\n : opts.delay\n ? (f: Lambda) => setTimeout(f, opts.delay!)\n : run\n}\n\nexport function reaction<T, FireImmediately extends boolean = false>(\n expression: (r: IReactionPublic) => T,\n effect: (\n arg: T,\n prev: FireImmediately extends true ? T | undefined : T,\n r: IReactionPublic\n ) => void,\n opts: IReactionOptions<T, FireImmediately> = EMPTY_OBJECT\n): IReactionDisposer {\n if (__DEV__) {\n if (!isFunction(expression) || !isFunction(effect)) {\n die(\"First and second argument to reaction should be functions\")\n }\n if (!isPlainObject(opts)) {\n die(\"Third argument of reactions should be an object\")\n }\n }\n const name = opts.name ?? (__DEV__ ? \"Reaction@\" + getNextId() : \"Reaction\")\n const effectAction = action(\n name,\n opts.onError ? wrapErrorHandler(opts.onError, effect) : effect\n )\n const runSync = !opts.scheduler && !opts.delay\n const scheduler = createSchedulerFromOptions(opts)\n\n let firstTime = true\n let isScheduled = false\n let value: T\n let oldValue: T | undefined\n\n const equals: IEqualsComparer<T> = (opts as any).compareStructural\n ? comparer.structural\n : opts.equals || comparer.default\n\n const r = new Reaction(\n name,\n () => {\n if (firstTime || runSync) {\n reactionRunner()\n } else if (!isScheduled) {\n isScheduled = true\n scheduler!(reactionRunner)\n }\n },\n opts.onError,\n opts.requiresObservable\n )\n\n function reactionRunner() {\n isScheduled = false\n if (r.isDisposed_) {\n return\n }\n let changed: boolean = false\n r.track(() => {\n const nextValue = allowStateChanges(false, () => expression(r))\n changed = firstTime || !equals(value, nextValue)\n oldValue = value\n value = nextValue\n })\n\n // This casting is nesessary as TS cannot infer proper type in current funciton implementation\n type OldValue = FireImmediately extends true ? T | undefined : T\n if (firstTime && opts.fireImmediately!) {\n effectAction(value, oldValue as OldValue, r)\n } else if (!firstTime && changed) {\n effectAction(value, oldValue as OldValue, r)\n }\n firstTime = false\n }\n\n if(!opts?.signal?.aborted) {\n r.schedule_()\n }\n return r.getDisposer_(opts?.signal)\n}\n\nfunction wrapErrorHandler(errorHandler, baseFn) {\n return function () {\n try {\n return baseFn.apply(this, arguments)\n } catch (e) {\n errorHandler.call(this, e)\n }\n }\n}\n","import {\n IComputedValue,\n IObservable,\n IObservableArray,\n Lambda,\n ObservableMap,\n getAtom,\n ObservableSet,\n isFunction,\n IObservableValue\n} from \"../internal\"\n\nconst ON_BECOME_OBSERVED = \"onBO\"\nconst ON_BECOME_UNOBSERVED = \"onBUO\"\n\nexport function onBecomeObserved(\n value:\n | IObservable\n | IComputedValue<any>\n | IObservableArray<any>\n | ObservableMap<any, any>\n | ObservableSet<any>\n | IObservableValue<any>,\n listener: Lambda\n): Lambda\nexport function onBecomeObserved<K, V = any>(\n value: ObservableMap<K, V> | Object,\n property: K,\n listener: Lambda\n): Lambda\nexport function onBecomeObserved(thing, arg2, arg3?): Lambda {\n return interceptHook(ON_BECOME_OBSERVED, thing, arg2, arg3)\n}\n\nexport function onBecomeUnobserved(\n value:\n | IObservable\n | IComputedValue<any>\n | IObservableArray<any>\n | ObservableMap<any, any>\n | ObservableSet<any>\n | IObservableValue<any>,\n listener: Lambda\n): Lambda\nexport function onBecomeUnobserved<K, V = any>(\n value: ObservableMap<K, V> | Object,\n property: K,\n listener: Lambda\n): Lambda\nexport function onBecomeUnobserved(thing, arg2, arg3?): Lambda {\n return interceptHook(ON_BECOME_UNOBSERVED, thing, arg2, arg3)\n}\n\nfunction interceptHook(hook: \"onBO\" | \"onBUO\", thing, arg2, arg3) {\n const atom: IObservable =\n typeof arg3 === \"function\" ? getAtom(thing, arg2) : (getAtom(thing) as any)\n const cb = isFunction(arg3) ? arg3 : arg2\n const listenersKey = `${hook}L` as \"onBOL\" | \"onBUOL\"\n\n if (atom[listenersKey]) {\n atom[listenersKey]!.add(cb)\n } else {\n atom[listenersKey] = new Set<Lambda>([cb])\n }\n\n return function () {\n const hookListeners = atom[listenersKey]\n if (hookListeners) {\n hookListeners.delete(cb)\n if (hookListeners.size === 0) {\n delete atom[listenersKey]\n }\n }\n }\n}\n","import { globalState, isolateGlobalState, setReactionScheduler } from \"../internal\"\n\nconst NEVER = \"never\"\nconst ALWAYS = \"always\"\nconst OBSERVED = \"observed\"\n// const IF_AVAILABLE = \"ifavailable\"\n\nexport function configure(options: {\n enforceActions?: \"never\" | \"always\" | \"observed\"\n computedRequiresReaction?: boolean\n /**\n * Warn if you try to create to derivation / reactive context without accessing any observable.\n */\n reactionRequiresObservable?: boolean\n /**\n * Warn if observables are accessed outside a reactive context\n */\n observableRequiresReaction?: boolean\n isolateGlobalState?: boolean\n disableErrorBoundaries?: boolean\n safeDescriptors?: boolean\n reactionScheduler?: (f: () => void) => void\n useProxies?: \"always\" | \"never\" | \"ifavailable\"\n}): void {\n if (options.isolateGlobalState === true) {\n isolateGlobalState()\n }\n const { useProxies, enforceActions } = options\n if (useProxies !== undefined) {\n globalState.useProxies =\n useProxies === ALWAYS\n ? true\n : useProxies === NEVER\n ? false\n : typeof Proxy !== \"undefined\"\n }\n if (useProxies === \"ifavailable\") {\n globalState.verifyProxies = true\n }\n if (enforceActions !== undefined) {\n const ea = enforceActions === ALWAYS ? ALWAYS : enforceActions === OBSERVED\n globalState.enforceActions = ea\n globalState.allowStateChanges = ea === true || ea === ALWAYS ? false : true\n }\n ;[\n \"computedRequiresReaction\",\n \"reactionRequiresObservable\",\n \"observableRequiresReaction\",\n \"disableErrorBoundaries\",\n \"safeDescriptors\"\n ].forEach(key => {\n if (key in options) {\n globalState[key] = !!options[key]\n }\n })\n globalState.allowStateReads = !globalState.observableRequiresReaction\n if (__DEV__ && globalState.disableErrorBoundaries === true) {\n console.warn(\n \"WARNING: Debug feature only. MobX will NOT recover from errors when `disableErrorBoundaries` is enabled.\"\n )\n }\n if (options.reactionScheduler) {\n setReactionScheduler(options.reactionScheduler)\n }\n}\n","import {\n CreateObservableOptions,\n isObservableMap,\n AnnotationsMap,\n asObservableObject,\n isPlainObject,\n ObservableObjectAdministration,\n isObservable,\n die,\n getOwnPropertyDescriptors,\n $mobx,\n ownKeys,\n initObservable\n} from \"../internal\"\n\nexport function extendObservable<A extends Object, B extends Object>(\n target: A,\n properties: B,\n annotations?: AnnotationsMap<B, never>,\n options?: CreateObservableOptions\n): A & B {\n if (__DEV__) {\n if (arguments.length > 4) {\n die(\"'extendObservable' expected 2-4 arguments\")\n }\n if (typeof target !== \"object\") {\n die(\"'extendObservable' expects an object as first argument\")\n }\n if (isObservableMap(target)) {\n die(\"'extendObservable' should not be used on maps, use map.merge instead\")\n }\n if (!isPlainObject(properties)) {\n die(`'extendObservable' only accepts plain objects as second argument`)\n }\n if (isObservable(properties) || isObservable(annotations)) {\n die(`Extending an object with another observable (object) is not supported`)\n }\n }\n // Pull descriptors first, so we don't have to deal with props added by administration ($mobx)\n const descriptors = getOwnPropertyDescriptors(properties)\n\n initObservable(() => {\n const adm: ObservableObjectAdministration = asObservableObject(target, options)[$mobx]\n ownKeys(descriptors).forEach(key => {\n adm.extend_(\n key,\n descriptors[key as any],\n // must pass \"undefined\" for { key: undefined }\n !annotations ? true : key in annotations ? annotations[key] : true\n )\n })\n })\n\n return target as any\n}\n","import { IDepTreeNode, getAtom, getObservers, hasObservers } from \"../internal\"\n\nexport interface IDependencyTree {\n name: string\n dependencies?: IDependencyTree[]\n}\n\nexport interface IObserverTree {\n name: string\n observers?: IObserverTree[]\n}\n\nexport function getDependencyTree(thing: any, property?: string): IDependencyTree {\n return nodeToDependencyTree(getAtom(thing, property))\n}\n\nfunction nodeToDependencyTree(node: IDepTreeNode): IDependencyTree {\n const result: IDependencyTree = {\n name: node.name_\n }\n if (node.observing_ && node.observing_.length > 0) {\n result.dependencies = unique(node.observing_).map(nodeToDependencyTree)\n }\n return result\n}\n\nexport function getObserverTree(thing: any, property?: string): IObserverTree {\n return nodeToObserverTree(getAtom(thing, property))\n}\n\nfunction nodeToObserverTree(node: IDepTreeNode): IObserverTree {\n const result: IObserverTree = {\n name: node.name_\n }\n if (hasObservers(node as any)) {\n result.observers = Array.from(<any>getObservers(node as any)).map(<any>nodeToObserverTree)\n }\n return result\n}\n\nfunction unique<T>(list: T[]): T[] {\n return Array.from(new Set(list))\n}\n","import {\n action,\n noop,\n die,\n isFunction,\n Annotation,\n isStringish,\n storeAnnotation,\n createFlowAnnotation,\n createDecoratorAnnotation,\n is20223Decorator\n} from \"../internal\"\n\nimport type { ClassMethodDecorator } from \"../types/decorator_fills\"\n\nexport const FLOW = \"flow\"\n\nlet generatorId = 0\n\nexport function FlowCancellationError() {\n this.message = \"FLOW_CANCELLED\"\n}\nFlowCancellationError.prototype = Object.create(Error.prototype)\n\nexport function isFlowCancellationError(error: Error) {\n return error instanceof FlowCancellationError\n}\n\nexport type CancellablePromise<T> = Promise<T> & { cancel(): void }\n\ninterface Flow extends Annotation, PropertyDecorator, ClassMethodDecorator {\n <R, Args extends any[]>(\n generator: (...args: Args) => Generator<any, R, any> | AsyncGenerator<any, R, any>\n ): (...args: Args) => CancellablePromise<R>\n bound: Annotation & PropertyDecorator & ClassMethodDecorator\n}\n\nconst flowAnnotation = createFlowAnnotation(\"flow\")\nconst flowBoundAnnotation = createFlowAnnotation(\"flow.bound\", { bound: true })\n\nexport const flow: Flow = Object.assign(\n function flow(arg1, arg2?) {\n // @flow (2022.3 Decorators)\n if (is20223Decorator(arg2)) {\n return flowAnnotation.decorate_20223_(arg1, arg2)\n }\n // @flow\n if (isStringish(arg2)) {\n return storeAnnotation(arg1, arg2, flowAnnotation)\n }\n // flow(fn)\n if (__DEV__ && arguments.length !== 1) {\n die(`Flow expects single argument with generator function`)\n }\n const generator = arg1\n const name = generator.name || \"<unnamed flow>\"\n\n // Implementation based on https://github.com/tj/co/blob/master/index.js\n const res = function () {\n const ctx = this\n const args = arguments\n const runId = ++generatorId\n const gen = action(`${name} - runid: ${runId} - init`, generator).apply(ctx, args)\n let rejector: (error: any) => void\n let pendingPromise: CancellablePromise<any> | undefined = undefined\n\n const promise = new Promise(function (resolve, reject) {\n let stepId = 0\n rejector = reject\n\n function onFulfilled(res: any) {\n pendingPromise = undefined\n let ret\n try {\n ret = action(\n `${name} - runid: ${runId} - yield ${stepId++}`,\n gen.next\n ).call(gen, res)\n } catch (e) {\n return reject(e)\n }\n\n next(ret)\n }\n\n function onRejected(err: any) {\n pendingPromise = undefined\n let ret\n try {\n ret = action(\n `${name} - runid: ${runId} - yield ${stepId++}`,\n gen.throw!\n ).call(gen, err)\n } catch (e) {\n return reject(e)\n }\n next(ret)\n }\n\n function next(ret: any) {\n if (isFunction(ret?.then)) {\n // an async iterator\n ret.then(next, reject)\n return\n }\n if (ret.done) {\n return resolve(ret.value)\n }\n pendingPromise = Promise.resolve(ret.value) as any\n return pendingPromise!.then(onFulfilled, onRejected)\n }\n\n onFulfilled(undefined) // kick off the process\n }) as any\n\n promise.cancel = action(`${name} - runid: ${runId} - cancel`, function () {\n try {\n if (pendingPromise) {\n cancelPromise(pendingPromise)\n }\n // Finally block can return (or yield) stuff..\n const res = gen.return!(undefined as any)\n // eat anything that promise would do, it's cancelled!\n const yieldedPromise = Promise.resolve(res.value)\n yieldedPromise.then(noop, noop)\n cancelPromise(yieldedPromise) // maybe it can be cancelled :)\n // reject our original promise\n rejector(new FlowCancellationError())\n } catch (e) {\n rejector(e) // there could be a throwing finally block\n }\n })\n return promise\n }\n res.isMobXFlow = true\n return res\n } as any,\n flowAnnotation\n)\n\nflow.bound = createDecoratorAnnotation(flowBoundAnnotation)\n\nfunction cancelPromise(promise) {\n if (isFunction(promise.cancel)) {\n promise.cancel()\n }\n}\n\nexport function flowResult<T>(\n result: T\n): T extends Generator<any, infer R, any>\n ? CancellablePromise<R>\n : T extends CancellablePromise<any>\n ? T\n : never {\n return result as any // just tricking TypeScript :)\n}\n\nexport function isFlow(fn: any): boolean {\n return fn?.isMobXFlow === true\n}\n","import {\n IObservableArray,\n IObservableValue,\n Lambda,\n ObservableMap,\n getAdministration,\n isObservableArray,\n isObservableMap,\n isObservableObject,\n isObservableValue,\n ObservableSet,\n die,\n isStringish\n} from \"../internal\"\n\nexport type ReadInterceptor<T> = (value: any) => T\n\n/** Experimental feature right now, tested indirectly via Mobx-State-Tree */\nexport function interceptReads<T>(value: IObservableValue<T>, handler: ReadInterceptor<T>): Lambda\nexport function interceptReads<T>(\n observableArray: IObservableArray<T>,\n handler: ReadInterceptor<T>\n): Lambda\nexport function interceptReads<K, V>(\n observableMap: ObservableMap<K, V>,\n handler: ReadInterceptor<V>\n): Lambda\nexport function interceptReads<V>(\n observableSet: ObservableSet<V>,\n handler: ReadInterceptor<V>\n): Lambda\nexport function interceptReads(\n object: Object,\n property: string,\n handler: ReadInterceptor<any>\n): Lambda\nexport function interceptReads(thing, propOrHandler?, handler?): Lambda {\n let target\n if (isObservableMap(thing) || isObservableArray(thing) || isObservableValue(thing)) {\n target = getAdministration(thing)\n } else if (isObservableObject(thing)) {\n if (__DEV__ && !isStringish(propOrHandler)) {\n return die(\n `InterceptReads can only be used with a specific property, not with an object in general`\n )\n }\n target = getAdministration(thing, propOrHandler)\n } else if (__DEV__) {\n return die(`Expected observable map, object or array as first array`)\n }\n if (__DEV__ && target.dehancer !== undefined) {\n return die(`An intercept reader was already established`)\n }\n target.dehancer = typeof propOrHandler === \"function\" ? propOrHandler : handler\n return () => {\n target.dehancer = undefined\n }\n}\n","import {\n IArrayWillChange,\n IArrayWillSplice,\n IInterceptor,\n IMapWillChange,\n IObjectWillChange,\n IObservableArray,\n IObservableValue,\n IValueWillChange,\n Lambda,\n ObservableMap,\n getAdministration,\n ObservableSet,\n ISetWillChange,\n isFunction\n} from \"../internal\"\n\nexport function intercept<T>(\n value: IObservableValue<T>,\n handler: IInterceptor<IValueWillChange<T>>\n): Lambda\nexport function intercept<T>(\n observableArray: IObservableArray<T> | Array<T>,\n handler: IInterceptor<IArrayWillChange<T> | IArrayWillSplice<T>>\n): Lambda\nexport function intercept<K, V>(\n observableMap: ObservableMap<K, V> | Map<K, V>,\n handler: IInterceptor<IMapWillChange<K, V>>\n): Lambda\nexport function intercept<V>(\n observableSet: ObservableSet<V> | Set<V>,\n handler: IInterceptor<ISetWillChange<V>>\n): Lambda\nexport function intercept<K, V>(\n observableMap: ObservableMap<K, V> | Map<K, V>,\n property: K,\n handler: IInterceptor<IValueWillChange<V>>\n): Lambda\nexport function intercept(object: object, handler: IInterceptor<IObjectWillChange>): Lambda\nexport function intercept<T extends object, K extends keyof T>(\n object: T,\n property: K,\n handler: IInterceptor<IValueWillChange<T[K]>>\n): Lambda\nexport function intercept(thing, propOrHandler?, handler?): Lambda {\n if (isFunction(handler)) {\n return interceptProperty(thing, propOrHandler, handler)\n } else {\n return interceptInterceptable(thing, propOrHandler)\n }\n}\n\nfunction interceptInterceptable(thing, handler) {\n return getAdministration(thing).intercept_(handler)\n}\n\nfunction interceptProperty(thing, property, handler) {\n return getAdministration(thing, property).intercept_(handler)\n}\n","import { $mobx, getAtom, isComputedValue, isObservableObject, die, isStringish } from \"../internal\"\n\nexport function _isComputed(value, property?: PropertyKey): boolean {\n if (property === undefined) {\n return isComputedValue(value)\n }\n if (isObservableObject(value) === false) {\n return false\n }\n if (!value[$mobx].values_.has(property)) {\n return false\n }\n const atom = getAtom(value, property)\n return isComputedValue(atom)\n}\n\nexport function isComputed(value: any): boolean {\n if (__DEV__ && arguments.length > 1) {\n return die(\n `isComputed expects only 1 argument. Use isComputedProp to inspect the observability of a property`\n )\n }\n return _isComputed(value)\n}\n\nexport function isComputedProp(value: any, propName: PropertyKey): boolean {\n if (__DEV__ && !isStringish(propName)) {\n return die(`isComputed expected a property name as second argument`)\n }\n return _isComputed(value, propName)\n}\n","import {\n $mobx,\n isAtom,\n isComputedValue,\n isObservableArray,\n isObservableMap,\n isObservableObject,\n isReaction,\n die,\n isStringish\n} from \"../internal\"\n\nfunction _isObservable(value, property?: PropertyKey): boolean {\n if (!value) {\n return false\n }\n if (property !== undefined) {\n if (__DEV__ && (isObservableMap(value) || isObservableArray(value))) {\n return die(\n \"isObservable(object, propertyName) is not supported for arrays and maps. Use map.has or array.length instead.\"\n )\n }\n if (isObservableObject(value)) {\n return value[$mobx].values_.has(property)\n }\n return false\n }\n // For first check, see #701\n return (\n isObservableObject(value) ||\n !!value[$mobx] ||\n isAtom(value) ||\n isReaction(value) ||\n isComputedValue(value)\n )\n}\n\nexport function isObservable(value: any): boolean {\n if (__DEV__ && arguments.length !== 1) {\n die(\n `isObservable expects only 1 argument. Use isObservableProp to inspect the observability of a property`\n )\n }\n return _isObservable(value)\n}\n\nexport function isObservableProp(value: any, propName: PropertyKey): boolean {\n if (__DEV__ && !isStringish(propName)) {\n return die(`expected a property name as second argument`)\n }\n return _isObservable(value, propName)\n}\n","import {\n $mobx,\n IIsObservableObject,\n IObservableArray,\n ObservableMap,\n ObservableSet,\n ObservableObjectAdministration,\n endBatch,\n isObservableArray,\n isObservableMap,\n isObservableSet,\n isObservableObject,\n startBatch,\n die\n} from \"../internal\"\n\nexport function keys<K>(map: ObservableMap<K, any>): ReadonlyArray<K>\nexport function keys<T>(ar: IObservableArray<T>): ReadonlyArray<number>\nexport function keys<T>(set: ObservableSet<T>): ReadonlyArray<T>\nexport function keys<T extends Object>(obj: T): ReadonlyArray<PropertyKey>\nexport function keys(obj: any): any {\n if (isObservableObject(obj)) {\n return (\n (obj as any as IIsObservableObject)[$mobx] as ObservableObjectAdministration\n ).keys_()\n }\n if (isObservableMap(obj) || isObservableSet(obj)) {\n return Array.from(obj.keys())\n }\n if (isObservableArray(obj)) {\n return obj.map((_, index) => index)\n }\n die(5)\n}\n\nexport function values<K, T>(map: ObservableMap<K, T>): ReadonlyArray<T>\nexport function values<T>(set: ObservableSet<T>): ReadonlyArray<T>\nexport function values<T>(ar: IObservableArray<T>): ReadonlyArray<T>\nexport function values<T = any>(obj: T): ReadonlyArray<T extends object ? T[keyof T] : any>\nexport function values(obj: any): string[] {\n if (isObservableObject(obj)) {\n return keys(obj).map(key => obj[key])\n }\n if (isObservableMap(obj)) {\n return keys(obj).map(key => obj.get(key))\n }\n if (isObservableSet(obj)) {\n return Array.from(obj.values())\n }\n if (isObservableArray(obj)) {\n return obj.slice()\n }\n die(6)\n}\n\nexport function entries<K, T>(map: ObservableMap<K, T>): ReadonlyArray<[K, T]>\nexport function entries<T>(set: ObservableSet<T>): ReadonlyArray<[T, T]>\nexport function entries<T>(ar: IObservableArray<T>): ReadonlyArray<[number, T]>\nexport function entries<T = any>(\n obj: T\n): ReadonlyArray<[string, T extends object ? T[keyof T] : any]>\nexport function entries(obj: any): any {\n if (isObservableObject(obj)) {\n return keys(obj).map(key => [key, obj[key]])\n }\n if (isObservableMap(obj)) {\n return keys(obj).map(key => [key, obj.get(key)])\n }\n if (isObservableSet(obj)) {\n return Array.from(obj.entries())\n }\n if (isObservableArray(obj)) {\n return obj.map((key, index) => [index, key])\n }\n die(7)\n}\n\nexport function set<V>(obj: ObservableMap<PropertyKey, V>, values: { [key: string]: V })\nexport function set<K, V>(obj: ObservableMap<K, V>, key: K, value: V)\nexport function set<T>(obj: ObservableSet<T>, value: T)\nexport function set<T>(obj: IObservableArray<T>, index: number, value: T)\nexport function set<T extends Object>(obj: T, values: { [key: string]: any })\nexport function set<T extends Object>(obj: T, key: PropertyKey, value: any)\nexport function set(obj: any, key: any, value?: any): void {\n if (arguments.length === 2 && !isObservableSet(obj)) {\n startBatch()\n const values = key\n try {\n for (let key in values) {\n set(obj, key, values[key])\n }\n } finally {\n endBatch()\n }\n return\n }\n if (isObservableObject(obj)) {\n ;(obj as any as IIsObservableObject)[$mobx].set_(key, value)\n } else if (isObservableMap(obj)) {\n obj.set(key, value)\n } else if (isObservableSet(obj)) {\n obj.add(key)\n } else if (isObservableArray(obj)) {\n if (typeof key !== \"number\") {\n key = parseInt(key, 10)\n }\n if (key < 0) {\n die(`Invalid index: '${key}'`)\n }\n startBatch()\n if (key >= obj.length) {\n obj.length = key + 1\n }\n obj[key] = value\n endBatch()\n } else {\n die(8)\n }\n}\n\nexport function remove<K, V>(obj: ObservableMap<K, V>, key: K)\nexport function remove<T>(obj: ObservableSet<T>, key: T)\nexport function remove<T>(obj: IObservableArray<T>, index: number)\nexport function remove<T extends Object>(obj: T, key: string)\nexport function remove(obj: any, key: any): void {\n if (isObservableObject(obj)) {\n ;(obj as any as IIsObservableObject)[$mobx].delete_(key)\n } else if (isObservableMap(obj)) {\n obj.delete(key)\n } else if (isObservableSet(obj)) {\n obj.delete(key)\n } else if (isObservableArray(obj)) {\n if (typeof key !== \"number\") {\n key = parseInt(key, 10)\n }\n obj.splice(key, 1)\n } else {\n die(9)\n }\n}\n\nexport function has<K>(obj: ObservableMap<K, any>, key: K): boolean\nexport function has<T>(obj: ObservableSet<T>, key: T): boolean\nexport function has<T>(obj: IObservableArray<T>, index: number): boolean\nexport function has<T extends Object>(obj: T, key: string): boolean\nexport function has(obj: any, key: any): boolean {\n if (isObservableObject(obj)) {\n return (obj as any as IIsObservableObject)[$mobx].has_(key)\n } else if (isObservableMap(obj)) {\n return obj.has(key)\n } else if (isObservableSet(obj)) {\n return obj.has(key)\n } else if (isObservableArray(obj)) {\n return key >= 0 && key < obj.length\n }\n die(10)\n}\n\nexport function get<K, V>(obj: ObservableMap<K, V>, key: K): V | undefined\nexport function get<T>(obj: IObservableArray<T>, index: number): T | undefined\nexport function get<T extends Object>(obj: T, key: string): any\nexport function get(obj: any, key: any): any {\n if (!has(obj, key)) {\n return undefined\n }\n if (isObservableObject(obj)) {\n return (obj as any as IIsObservableObject)[$mobx].get_(key)\n } else if (isObservableMap(obj)) {\n return obj.get(key)\n } else if (isObservableArray(obj)) {\n return obj[key]\n }\n die(11)\n}\n\nexport function apiDefineProperty(obj: Object, key: PropertyKey, descriptor: PropertyDescriptor) {\n if (isObservableObject(obj)) {\n return (obj as any as IIsObservableObject)[$mobx].defineProperty_(key, descriptor)\n }\n die(39)\n}\n\nexport function apiOwnKeys(obj: Object) {\n if (isObservableObject(obj)) {\n return (obj as any as IIsObservableObject)[$mobx].ownKeys_()\n }\n die(38)\n}\n","import {\n IArrayDidChange,\n IComputedValue,\n IMapDidChange,\n IObjectDidChange,\n IObservableArray,\n IObservableValue,\n IValueDidChange,\n Lambda,\n ObservableMap,\n getAdministration,\n ObservableSet,\n ISetDidChange,\n isFunction\n} from \"../internal\"\n\nexport function observe<T>(\n value: IObservableValue<T> | IComputedValue<T>,\n listener: (change: IValueDidChange<T>) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe<T>(\n observableArray: IObservableArray<T> | Array<T>,\n listener: (change: IArrayDidChange<T>) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe<V>(\n // ObservableSet/ObservableMap are required despite they implement Set/Map: https://github.com/mobxjs/mobx/pull/3180#discussion_r746542929\n observableSet: ObservableSet<V> | Set<V>,\n listener: (change: ISetDidChange<V>) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe<K, V>(\n observableMap: ObservableMap<K, V> | Map<K, V>,\n listener: (change: IMapDidChange<K, V>) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe<K, V>(\n observableMap: ObservableMap<K, V> | Map<K, V>,\n property: K,\n listener: (change: IValueDidChange<V>) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe(\n object: Object,\n listener: (change: IObjectDidChange) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe<T, K extends keyof T>(\n object: T,\n property: K,\n listener: (change: IValueDidChange<T[K]>) => void,\n fireImmediately?: boolean\n): Lambda\nexport function observe(thing, propOrCb?, cbOrFire?, fireImmediately?): Lambda {\n if (isFunction(cbOrFire)) {\n return observeObservableProperty(thing, propOrCb, cbOrFire, fireImmediately)\n } else {\n return observeObservable(thing, propOrCb, cbOrFire)\n }\n}\n\nfunction observeObservable(thing, listener, fireImmediately: boolean) {\n return getAdministration(thing).observe_(listener, fireImmediately)\n}\n\nfunction observeObservableProperty(thing, property, listener, fireImmediately: boolean) {\n return getAdministration(thing, property).observe_(listener, fireImmediately)\n}\n","import {\n isObservable,\n isObservableArray,\n isObservableValue,\n isObservableMap,\n isObservableSet,\n isComputedValue,\n die,\n apiOwnKeys,\n objectPrototype\n} from \"../internal\"\n\nfunction cache<K, V>(map: Map<any, any>, key: K, value: V): V {\n map.set(key, value)\n return value\n}\n\nfunction toJSHelper(source, __alreadySeen: Map<any, any>) {\n if (\n source == null ||\n typeof source !== \"object\" ||\n source instanceof Date ||\n !isObservable(source)\n ) {\n return source\n }\n\n if (isObservableValue(source) || isComputedValue(source)) {\n return toJSHelper(source.get(), __alreadySeen)\n }\n if (__alreadySeen.has(source)) {\n return __alreadySeen.get(source)\n }\n if (isObservableArray(source)) {\n const res = cache(__alreadySeen, source, new Array(source.length))\n source.forEach((value, idx) => {\n res[idx] = toJSHelper(value, __alreadySeen)\n })\n return res\n }\n if (isObservableSet(source)) {\n const res = cache(__alreadySeen, source, new Set())\n source.forEach(value => {\n res.add(toJSHelper(value, __alreadySeen))\n })\n return res\n }\n if (isObservableMap(source)) {\n const res = cache(__alreadySeen, source, new Map())\n source.forEach((value, key) => {\n res.set(key, toJSHelper(value, __alreadySeen))\n })\n return res\n } else {\n // must be observable object\n const res = cache(__alreadySeen, source, {})\n apiOwnKeys(source).forEach((key: any) => {\n if (objectPrototype.propertyIsEnumerable.call(source, key)) {\n res[key] = toJSHelper(source[key], __alreadySeen)\n }\n })\n return res\n }\n}\n\n/**\n * Recursively converts an observable to it's non-observable native counterpart.\n * It does NOT recurse into non-observables, these are left as they are, even if they contain observables.\n * Computed and other non-enumerable properties are completely ignored.\n * Complex scenarios require custom solution, eg implementing `toJSON` or using `serializr` lib.\n */\nexport function toJS<T>(source: T, options?: any): T {\n if (__DEV__ && options) {\n die(\"toJS no longer supports options\")\n }\n return toJSHelper(source, new Map())\n}\n","import { TraceMode, die, getAtom, globalState } from \"../internal\"\n\nexport function trace(thing?: any, prop?: string, enterBreakPoint?: boolean): void\nexport function trace(thing?: any, enterBreakPoint?: boolean): void\nexport function trace(enterBreakPoint?: boolean): void\nexport function trace(...args: any[]): void {\n if (!__DEV__) {\n return\n }\n let enterBreakPoint = false\n if (typeof args[args.length - 1] === \"boolean\") {\n enterBreakPoint = args.pop()\n }\n const derivation = getAtomFromArgs(args)\n if (!derivation) {\n return die(\n `'trace(break?)' can only be used inside a tracked computed value or a Reaction. Consider passing in the computed value or reaction explicitly`\n )\n }\n if (derivation.isTracing_ === TraceMode.NONE) {\n console.log(`[mobx.trace] '${derivation.name_}' tracing enabled`)\n }\n derivation.isTracing_ = enterBreakPoint ? TraceMode.BREAK : TraceMode.LOG\n}\n\nfunction getAtomFromArgs(args): any {\n switch (args.length) {\n case 0:\n return globalState.trackingDerivation\n case 1:\n return getAtom(args[0])\n case 2:\n return getAtom(args[0], args[1])\n }\n}\n","import { endBatch, startBatch } from \"../internal\"\n\n/**\n * During a transaction no views are updated until the end of the transaction.\n * The transaction will be run synchronously nonetheless.\n *\n * @param action a function that updates some reactive state\n * @returns any value that was returned by the 'action' parameter.\n */\nexport function transaction<T>(action: () => T, thisArg = undefined): T {\n startBatch()\n try {\n return action.apply(thisArg)\n } finally {\n endBatch()\n }\n}\n","import {\n $mobx,\n IReactionDisposer,\n Lambda,\n autorun,\n createAction,\n getNextId,\n die,\n allowStateChanges,\n GenericAbortSignal\n} from \"../internal\"\n\nexport interface IWhenOptions {\n name?: string\n timeout?: number\n onError?: (error: any) => void\n signal?: GenericAbortSignal\n}\n\nexport function when(\n predicate: () => boolean,\n opts?: IWhenOptions\n): Promise<void> & { cancel(): void }\nexport function when(\n predicate: () => boolean,\n effect: Lambda,\n opts?: IWhenOptions\n): IReactionDisposer\nexport function when(predicate: any, arg1?: any, arg2?: any): any {\n if (arguments.length === 1 || (arg1 && typeof arg1 === \"object\")) {\n return whenPromise(predicate, arg1)\n }\n return _when(predicate, arg1, arg2 || {})\n}\n\nfunction _when(predicate: () => boolean, effect: Lambda, opts: IWhenOptions): IReactionDisposer {\n let timeoutHandle: any\n if (typeof opts.timeout === \"number\") {\n const error = new Error(\"WHEN_TIMEOUT\")\n timeoutHandle = setTimeout(() => {\n if (!disposer[$mobx].isDisposed_) {\n disposer()\n if (opts.onError) {\n opts.onError(error)\n } else {\n throw error\n }\n }\n }, opts.timeout)\n }\n\n opts.name = __DEV__ ? opts.name || \"When@\" + getNextId() : \"When\"\n const effectAction = createAction(\n __DEV__ ? opts.name + \"-effect\" : \"When-effect\",\n effect as Function\n )\n // eslint-disable-next-line\n var disposer = autorun(r => {\n // predicate should not change state\n let cond = allowStateChanges(false, predicate)\n if (cond) {\n r.dispose()\n if (timeoutHandle) {\n clearTimeout(timeoutHandle)\n }\n effectAction()\n }\n }, opts)\n return disposer\n}\n\nfunction whenPromise(\n predicate: () => boolean,\n opts?: IWhenOptions\n): Promise<void> & { cancel(): void } {\n if (__DEV__ && opts && opts.onError) {\n return die(`the options 'onError' and 'promise' cannot be combined`)\n }\n if (opts?.signal?.aborted) {\n return Object.assign(Promise.reject(new Error(\"WHEN_ABORTED\")), { cancel: () => null })\n }\n let cancel\n let abort\n const res = new Promise((resolve, reject) => {\n let disposer = _when(predicate, resolve as Lambda, { ...opts, onError: reject })\n cancel = () => {\n disposer()\n reject(new Error(\"WHEN_CANCELLED\"))\n }\n abort = () => {\n disposer()\n reject(new Error(\"WHEN_ABORTED\"))\n }\n opts?.signal?.addEventListener?.(\"abort\", abort)\n }).finally(() => opts?.signal?.removeEventListener?.(\"abort\", abort))\n ;(res as any).cancel = cancel\n return res as any\n}\n","import {\n $mobx,\n IIsObservableObject,\n ObservableObjectAdministration,\n warnAboutProxyRequirement,\n assertProxies,\n die,\n isStringish,\n globalState,\n CreateObservableOptions,\n asObservableObject\n} from \"../internal\"\n\nfunction getAdm(target): ObservableObjectAdministration {\n return target[$mobx]\n}\n\n// Optimization: we don't need the intermediate objects and could have a completely custom administration for DynamicObjects,\n// and skip either the internal values map, or the base object with its property descriptors!\nconst objectProxyTraps: ProxyHandler<any> = {\n has(target: IIsObservableObject, name: PropertyKey): boolean {\n if (__DEV__ && globalState.trackingDerivation) {\n warnAboutProxyRequirement(\n \"detect new properties using the 'in' operator. Use 'has' from 'mobx' instead.\"\n )\n }\n return getAdm(target).has_(name)\n },\n get(target: IIsObservableObject, name: PropertyKey): any {\n return getAdm(target).get_(name)\n },\n set(target: IIsObservableObject, name: PropertyKey, value: any): boolean {\n if (!isStringish(name)) {\n return false\n }\n if (__DEV__ && !getAdm(target).values_.has(name)) {\n warnAboutProxyRequirement(\n \"add a new observable property through direct assignment. Use 'set' from 'mobx' instead.\"\n )\n }\n // null (intercepted) -> true (success)\n return getAdm(target).set_(name, value, true) ?? true\n },\n deleteProperty(target: IIsObservableObject, name: PropertyKey): boolean {\n if (__DEV__) {\n warnAboutProxyRequirement(\n \"delete properties from an observable object. Use 'remove' from 'mobx' instead.\"\n )\n }\n if (!isStringish(name)) {\n return false\n }\n // null (intercepted) -> true (success)\n return getAdm(target).delete_(name, true) ?? true\n },\n defineProperty(\n target: IIsObservableObject,\n name: PropertyKey,\n descriptor: PropertyDescriptor\n ): boolean {\n if (__DEV__) {\n warnAboutProxyRequirement(\n \"define property on an observable object. Use 'defineProperty' from 'mobx' instead.\"\n )\n }\n // null (intercepted) -> true (success)\n return getAdm(target).defineProperty_(name, descriptor) ?? true\n },\n ownKeys(target: IIsObservableObject): ArrayLike<string | symbol> {\n if (__DEV__ && globalState.trackingDerivation) {\n warnAboutProxyRequirement(\n \"iterate keys to detect added / removed properties. Use 'keys' from 'mobx' instead.\"\n )\n }\n return getAdm(target).ownKeys_()\n },\n preventExtensions(target) {\n die(13)\n }\n}\n\nexport function asDynamicObservableObject(\n target: any,\n options?: CreateObservableOptions\n): IIsObservableObject {\n assertProxies()\n target = asObservableObject(target, options)\n return (target[$mobx].proxy_ ??= new Proxy(target, objectProxyTraps))\n}\n","import { Lambda, once, untrackedEnd, untrackedStart, die } from \"../internal\"\n\nexport type IInterceptor<T> = (change: T) => T | null\n\nexport interface IInterceptable<T> {\n interceptors_: IInterceptor<T>[] | undefined\n}\n\nexport function hasInterceptors(interceptable: IInterceptable<any>) {\n return interceptable.interceptors_ !== undefined && interceptable.interceptors_.length > 0\n}\n\nexport function registerInterceptor<T>(\n interceptable: IInterceptable<T>,\n handler: IInterceptor<T>\n): Lambda {\n const interceptors = interceptable.interceptors_ || (interceptable.interceptors_ = [])\n interceptors.push(handler)\n return once(() => {\n const idx = interceptors.indexOf(handler)\n if (idx !== -1) {\n interceptors.splice(idx, 1)\n }\n })\n}\n\nexport function interceptChange<T>(\n interceptable: IInterceptable<T | null>,\n change: T | null\n): T | null {\n const prevU = untrackedStart()\n try {\n // Interceptor can modify the array, copy it to avoid concurrent modification, see #1950\n const interceptors = [...(interceptable.interceptors_ || [])]\n for (let i = 0, l = interceptors.length; i < l; i++) {\n change = interceptors[i](change)\n if (change && !(change as any).type) {\n die(14)\n }\n if (!change) {\n break\n }\n }\n return change\n } finally {\n untrackedEnd(prevU)\n }\n}\n","import { Lambda, once, untrackedEnd, untrackedStart } from \"../internal\"\n\nexport interface IListenable {\n changeListeners_: Function[] | undefined\n}\n\nexport function hasListeners(listenable: IListenable) {\n return listenable.changeListeners_ !== undefined && listenable.changeListeners_.length > 0\n}\n\nexport function registerListener(listenable: IListenable, handler: Function): Lambda {\n const listeners = listenable.changeListeners_ || (listenable.changeListeners_ = [])\n listeners.push(handler)\n return once(() => {\n const idx = listeners.indexOf(handler)\n if (idx !== -1) {\n listeners.splice(idx, 1)\n }\n })\n}\n\nexport function notifyListeners<T>(listenable: IListenable, change: T) {\n const prevU = untrackedStart()\n let listeners = listenable.changeListeners_\n if (!listeners) {\n return\n }\n listeners = listeners.slice()\n for (let i = 0, l = listeners.length; i < l; i++) {\n listeners[i](change)\n }\n untrackedEnd(prevU)\n}\n","import {\n $mobx,\n asObservableObject,\n AnnotationsMap,\n CreateObservableOptions,\n ObservableObjectAdministration,\n collectStoredAnnotations,\n isPlainObject,\n isObservableObject,\n die,\n ownKeys,\n extendObservable,\n addHiddenProp,\n storedAnnotationsSymbol,\n initObservable\n} from \"../internal\"\n\n// Hack based on https://github.com/Microsoft/TypeScript/issues/14829#issuecomment-322267089\n// We need this, because otherwise, AdditionalKeys is going to be inferred to be any\n// set of superfluous keys. But, we rather want to get a compile error unless AdditionalKeys is\n// _explicity_ passed as generic argument\n// Fixes: https://github.com/mobxjs/mobx/issues/2325#issuecomment-691070022\ntype NoInfer<T> = [T][T extends any ? 0 : never]\n\ntype MakeObservableOptions = Omit<CreateObservableOptions, \"proxy\">\n\nexport function makeObservable<T extends object, AdditionalKeys extends PropertyKey = never>(\n target: T,\n annotations?: AnnotationsMap<T, NoInfer<AdditionalKeys>>,\n options?: MakeObservableOptions\n): T {\n initObservable(() => {\n const adm: ObservableObjectAdministration = asObservableObject(target, options)[$mobx]\n if (__DEV__ && annotations && target[storedAnnotationsSymbol]) {\n die(\n `makeObservable second arg must be nullish when using decorators. Mixing @decorator syntax with annotations is not supported.`\n )\n }\n // Default to decorators\n annotations ??= collectStoredAnnotations(target)\n\n // Annotate\n ownKeys(annotations).forEach(key => adm.make_(key, annotations![key]))\n })\n return target\n}\n\n// proto[keysSymbol] = new Set<PropertyKey>()\nconst keysSymbol = Symbol(\"mobx-keys\")\n\nexport function makeAutoObservable<T extends object, AdditionalKeys extends PropertyKey = never>(\n target: T,\n overrides?: AnnotationsMap<T, NoInfer<AdditionalKeys>>,\n options?: MakeObservableOptions\n): T {\n if (__DEV__) {\n if (!isPlainObject(target) && !isPlainObject(Object.getPrototypeOf(target))) {\n die(`'makeAutoObservable' can only be used for classes that don't have a superclass`)\n }\n if (isObservableObject(target)) {\n die(`makeAutoObservable can only be used on objects not already made observable`)\n }\n }\n\n // Optimization: avoid visiting protos\n // Assumes that annotation.make_/.extend_ works the same for plain objects\n if (isPlainObject(target)) {\n return extendObservable(target, target, overrides, options)\n }\n\n initObservable(() => {\n const adm: ObservableObjectAdministration = asObservableObject(target, options)[$mobx]\n\n // Optimization: cache keys on proto\n // Assumes makeAutoObservable can be called only once per object and can't be used in subclass\n if (!target[keysSymbol]) {\n const proto = Object.getPrototypeOf(target)\n const keys = new Set([...ownKeys(target), ...ownKeys(proto)])\n keys.delete(\"constructor\")\n keys.delete($mobx)\n addHiddenProp(proto, keysSymbol, keys)\n }\n\n target[keysSymbol].forEach(key =>\n adm.make_(\n key,\n // must pass \"undefined\" for { key: undefined }\n !overrides ? true : key in overrides ? overrides[key] : true\n )\n )\n })\n\n return target\n}\n","import {\n $mobx,\n Atom,\n EMPTY_ARRAY,\n IAtom,\n IEnhancer,\n IInterceptable,\n IInterceptor,\n IListenable,\n Lambda,\n addHiddenFinalProp,\n checkIfStateModificationsAreAllowed,\n createInstanceofPredicate,\n getNextId,\n hasInterceptors,\n hasListeners,\n interceptChange,\n isObject,\n isSpyEnabled,\n notifyListeners,\n registerInterceptor,\n registerListener,\n spyReportEnd,\n spyReportStart,\n assertProxies,\n reserveArrayBuffer,\n hasProp,\n die,\n globalState,\n initObservable\n} from \"../internal\"\n\nconst SPLICE = \"splice\"\nexport const UPDATE = \"update\"\nexport const MAX_SPLICE_SIZE = 10000 // See e.g. https://github.com/mobxjs/mobx/issues/859\n\nexport interface IObservableArray<T = any> extends Array<T> {\n spliceWithArray(index: number, deleteCount?: number, newItems?: T[]): T[]\n clear(): T[]\n replace(newItems: T[]): T[]\n remove(value: T): boolean\n toJSON(): T[]\n}\n\ninterface IArrayBaseChange<T> {\n object: IObservableArray<T>\n observableKind: \"array\"\n debugObjectName: string\n index: number\n}\n\nexport type IArrayDidChange<T = any> = IArrayUpdate<T> | IArraySplice<T>\n\nexport interface IArrayUpdate<T = any> extends IArrayBaseChange<T> {\n type: \"update\"\n newValue: T\n oldValue: T\n}\n\nexport interface IArraySplice<T = any> extends IArrayBaseChange<T> {\n type: \"splice\"\n added: T[]\n addedCount: number\n removed: T[]\n removedCount: number\n}\n\nexport interface IArrayWillChange<T = any> {\n object: IObservableArray<T>\n index: number\n type: \"update\"\n newValue: T\n}\n\nexport interface IArrayWillSplice<T = any> {\n object: IObservableArray<T>\n index: number\n type: \"splice\"\n added: T[]\n removedCount: number\n}\n\nconst arrayTraps = {\n get(target, name) {\n const adm: ObservableArrayAdministration = target[$mobx]\n if (name === $mobx) {\n return adm\n }\n if (name === \"length\") {\n return adm.getArrayLength_()\n }\n if (typeof name === \"string\" && !isNaN(name as any)) {\n return adm.get_(parseInt(name))\n }\n if (hasProp(arrayExtensions, name)) {\n return arrayExtensions[name]\n }\n return target[name]\n },\n set(target, name, value): boolean {\n const adm: ObservableArrayAdministration = target[$mobx]\n if (name === \"length\") {\n adm.setArrayLength_(value)\n }\n if (typeof name === \"symbol\" || isNaN(name)) {\n target[name] = value\n } else {\n // numeric string\n adm.set_(parseInt(name), value)\n }\n return true\n },\n preventExtensions() {\n die(15)\n }\n}\n\nexport class ObservableArrayAdministration\n implements IInterceptable<IArrayWillChange<any> | IArrayWillSplice<any>>, IListenable\n{\n atom_: IAtom\n readonly values_: any[] = [] // this is the prop that gets proxied, so can't replace it!\n interceptors_\n changeListeners_\n enhancer_: (newV: any, oldV: any | undefined) => any\n dehancer: any\n proxy_!: IObservableArray<any>\n lastKnownLength_ = 0\n\n constructor(\n name = __DEV__ ? \"ObservableArray@\" + getNextId() : \"ObservableArray\",\n enhancer: IEnhancer<any>,\n public owned_: boolean,\n public legacyMode_: boolean\n ) {\n this.atom_ = new Atom(name)\n this.enhancer_ = (newV, oldV) =>\n enhancer(newV, oldV, __DEV__ ? name + \"[..]\" : \"ObservableArray[..]\")\n }\n\n dehanceValue_(value: any): any {\n if (this.dehancer !== undefined) {\n return this.dehancer(value)\n }\n return value\n }\n\n dehanceValues_(values: any[]): any[] {\n if (this.dehancer !== undefined && values.length > 0) {\n return values.map(this.dehancer) as any\n }\n return values\n }\n\n intercept_(handler: IInterceptor<IArrayWillChange<any> | IArrayWillSplice<any>>): Lambda {\n return registerInterceptor<IArrayWillChange<any> | IArrayWillSplice<any>>(this, handler)\n }\n\n observe_(\n listener: (changeData: IArrayDidChange<any>) => void,\n fireImmediately = false\n ): Lambda {\n if (fireImmediately) {\n listener(<IArraySplice<any>>{\n observableKind: \"array\",\n object: this.proxy_ as any,\n debugObjectName: this.atom_.name_,\n type: \"splice\",\n index: 0,\n added: this.values_.slice(),\n addedCount: this.values_.length,\n removed: [],\n removedCount: 0\n })\n }\n return registerListener(this, listener)\n }\n\n getArrayLength_(): number {\n this.atom_.reportObserved()\n return this.values_.length\n }\n\n setArrayLength_(newLength: number) {\n if (typeof newLength !== \"number\" || isNaN(newLength) || newLength < 0) {\n die(\"Out of range: \" + newLength)\n }\n let currentLength = this.values_.length\n if (newLength === currentLength) {\n return\n } else if (newLength > currentLength) {\n const newItems = new Array(newLength - currentLength)\n for (let i = 0; i < newLength - currentLength; i++) {\n newItems[i] = undefined\n } // No Array.fill everywhere...\n this.spliceWithArray_(currentLength, 0, newItems)\n } else {\n this.spliceWithArray_(newLength, currentLength - newLength)\n }\n }\n\n updateArrayLength_(oldLength: number, delta: number) {\n if (oldLength !== this.lastKnownLength_) {\n die(16)\n }\n this.lastKnownLength_ += delta\n if (this.legacyMode_ && delta > 0) {\n reserveArrayBuffer(oldLength + delta + 1)\n }\n }\n\n spliceWithArray_(index: number, deleteCount?: number, newItems?: any[]): any[] {\n checkIfStateModificationsAreAllowed(this.atom_)\n const length = this.values_.length\n\n if (index === undefined) {\n index = 0\n } else if (index > length) {\n index = length\n } else if (index < 0) {\n index = Math.max(0, length + index)\n }\n\n if (arguments.length === 1) {\n deleteCount = length - index\n } else if (deleteCount === undefined || deleteCount === null) {\n deleteCount = 0\n } else {\n deleteCount = Math.max(0, Math.min(deleteCount, length - index))\n }\n\n if (newItems === undefined) {\n newItems = EMPTY_ARRAY\n }\n\n if (hasInterceptors(this)) {\n const change = interceptChange<IArrayWillSplice<any>>(this as any, {\n object: this.proxy_ as any,\n type: SPLICE,\n index,\n removedCount: deleteCount,\n added: newItems\n })\n if (!change) {\n return EMPTY_ARRAY\n }\n deleteCount = change.removedCount\n newItems = change.added\n }\n\n newItems =\n newItems.length === 0 ? newItems : newItems.map(v => this.enhancer_(v, undefined))\n if (this.legacyMode_ || __DEV__) {\n const lengthDelta = newItems.length - deleteCount\n this.updateArrayLength_(length, lengthDelta) // checks if internal array wasn't modified\n }\n const res = this.spliceItemsIntoValues_(index, deleteCount, newItems)\n\n if (deleteCount !== 0 || newItems.length !== 0) {\n this.notifyArraySplice_(index, newItems, res)\n }\n return this.dehanceValues_(res)\n }\n\n spliceItemsIntoValues_(index: number, deleteCount: number, newItems: any[]): any[] {\n if (newItems.length < MAX_SPLICE_SIZE) {\n return this.values_.splice(index, deleteCount, ...newItems)\n } else {\n // The items removed by the splice\n const res = this.values_.slice(index, index + deleteCount)\n // The items that that should remain at the end of the array\n let oldItems = this.values_.slice(index + deleteCount)\n // New length is the previous length + addition count - deletion count\n this.values_.length += newItems.length - deleteCount\n for (let i = 0; i < newItems.length; i++) {\n this.values_[index + i] = newItems[i]\n }\n for (let i = 0; i < oldItems.length; i++) {\n this.values_[index + newItems.length + i] = oldItems[i]\n }\n return res\n }\n }\n\n notifyArrayChildUpdate_(index: number, newValue: any, oldValue: any) {\n const notifySpy = !this.owned_ && isSpyEnabled()\n const notify = hasListeners(this)\n const change: IArrayDidChange | null =\n notify || notifySpy\n ? ({\n observableKind: \"array\",\n object: this.proxy_,\n type: UPDATE,\n debugObjectName: this.atom_.name_,\n index,\n newValue,\n oldValue\n } as const)\n : null\n\n // The reason why this is on right hand side here (and not above), is this way the uglifier will drop it, but it won't\n // cause any runtime overhead in development mode without NODE_ENV set, unless spying is enabled\n if (__DEV__ && notifySpy) {\n spyReportStart(change!)\n }\n this.atom_.reportChanged()\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n\n notifyArraySplice_(index: number, added: any[], removed: any[]) {\n const notifySpy = !this.owned_ && isSpyEnabled()\n const notify = hasListeners(this)\n const change: IArraySplice | null =\n notify || notifySpy\n ? ({\n observableKind: \"array\",\n object: this.proxy_,\n debugObjectName: this.atom_.name_,\n type: SPLICE,\n index,\n removed,\n added,\n removedCount: removed.length,\n addedCount: added.length\n } as const)\n : null\n\n if (__DEV__ && notifySpy) {\n spyReportStart(change!)\n }\n this.atom_.reportChanged()\n // conform: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/observe\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n\n get_(index: number): any | undefined {\n if (this.legacyMode_ && index >= this.values_.length) {\n console.warn(\n __DEV__\n ? `[mobx.array] Attempt to read an array index (${index}) that is out of bounds (${this.values_.length}). Please check length first. Out of bound indices will not be tracked by MobX`\n : `[mobx] Out of bounds read: ${index}`\n )\n return undefined\n }\n this.atom_.reportObserved()\n return this.dehanceValue_(this.values_[index])\n }\n\n set_(index: number, newValue: any) {\n const values = this.values_\n if (this.legacyMode_ && index > values.length) {\n // out of bounds\n die(17, index, values.length)\n }\n if (index < values.length) {\n // update at index in range\n checkIfStateModificationsAreAllowed(this.atom_)\n const oldValue = values[index]\n if (hasInterceptors(this)) {\n const change = interceptChange<IArrayWillChange<any>>(this as any, {\n type: UPDATE,\n object: this.proxy_ as any, // since \"this\" is the real array we need to pass its proxy\n index,\n newValue\n })\n if (!change) {\n return\n }\n newValue = change.newValue\n }\n newValue = this.enhancer_(newValue, oldValue)\n const changed = newValue !== oldValue\n if (changed) {\n values[index] = newValue\n this.notifyArrayChildUpdate_(index, newValue, oldValue)\n }\n } else {\n // For out of bound index, we don't create an actual sparse array,\n // but rather fill the holes with undefined (same as setArrayLength_).\n // This could be considered a bug.\n const newItems = new Array(index + 1 - values.length)\n for (let i = 0; i < newItems.length - 1; i++) {\n newItems[i] = undefined\n } // No Array.fill everywhere...\n newItems[newItems.length - 1] = newValue\n this.spliceWithArray_(values.length, 0, newItems)\n }\n }\n}\n\nexport function createObservableArray<T>(\n initialValues: T[] | undefined,\n enhancer: IEnhancer<T>,\n name = __DEV__ ? \"ObservableArray@\" + getNextId() : \"ObservableArray\",\n owned = false\n): IObservableArray<T> {\n assertProxies()\n return initObservable(() => {\n const adm = new ObservableArrayAdministration(name, enhancer, owned, false)\n addHiddenFinalProp(adm.values_, $mobx, adm)\n const proxy = new Proxy(adm.values_, arrayTraps) as any\n adm.proxy_ = proxy\n if (initialValues && initialValues.length) {\n adm.spliceWithArray_(0, 0, initialValues)\n }\n return proxy\n })\n}\n\n// eslint-disable-next-line\nexport var arrayExtensions = {\n clear(): any[] {\n return this.splice(0)\n },\n\n replace(newItems: any[]) {\n const adm: ObservableArrayAdministration = this[$mobx]\n return adm.spliceWithArray_(0, adm.values_.length, newItems)\n },\n\n // Used by JSON.stringify\n toJSON(): any[] {\n return this.slice()\n },\n\n /*\n * functions that do alter the internal structure of the array, (based on lib.es6.d.ts)\n * since these functions alter the inner structure of the array, the have side effects.\n * Because the have side effects, they should not be used in computed function,\n * and for that reason the do not call dependencyState.notifyObserved\n */\n splice(index: number, deleteCount?: number, ...newItems: any[]): any[] {\n const adm: ObservableArrayAdministration = this[$mobx]\n switch (arguments.length) {\n case 0:\n return []\n case 1:\n return adm.spliceWithArray_(index)\n case 2:\n return adm.spliceWithArray_(index, deleteCount)\n }\n return adm.spliceWithArray_(index, deleteCount, newItems)\n },\n\n spliceWithArray(index: number, deleteCount?: number, newItems?: any[]): any[] {\n return (this[$mobx] as ObservableArrayAdministration).spliceWithArray_(\n index,\n deleteCount,\n newItems\n )\n },\n\n push(...items: any[]): number {\n const adm: ObservableArrayAdministration = this[$mobx]\n adm.spliceWithArray_(adm.values_.length, 0, items)\n return adm.values_.length\n },\n\n pop() {\n return this.splice(Math.max(this[$mobx].values_.length - 1, 0), 1)[0]\n },\n\n shift() {\n return this.splice(0, 1)[0]\n },\n\n unshift(...items: any[]): number {\n const adm: ObservableArrayAdministration = this[$mobx]\n adm.spliceWithArray_(0, 0, items)\n return adm.values_.length\n },\n\n reverse(): any[] {\n // reverse by default mutates in place before returning the result\n // which makes it both a 'derivation' and a 'mutation'.\n if (globalState.trackingDerivation) {\n die(37, \"reverse\")\n }\n this.replace(this.slice().reverse())\n return this\n },\n\n sort(): any[] {\n // sort by default mutates in place before returning the result\n // which goes against all good practices. Let's not change the array in place!\n if (globalState.trackingDerivation) {\n die(37, \"sort\")\n }\n const copy = this.slice()\n copy.sort.apply(copy, arguments)\n this.replace(copy)\n return this\n },\n\n remove(value: any): boolean {\n const adm: ObservableArrayAdministration = this[$mobx]\n const idx = adm.dehanceValues_(adm.values_).indexOf(value)\n if (idx > -1) {\n this.splice(idx, 1)\n return true\n }\n return false\n }\n}\n\n/**\n * Wrap function from prototype\n * Without this, everything works as well, but this works\n * faster as everything works on unproxied values\n */\naddArrayExtension(\"at\", simpleFunc)\naddArrayExtension(\"concat\", simpleFunc)\naddArrayExtension(\"flat\", simpleFunc)\naddArrayExtension(\"includes\", simpleFunc)\naddArrayExtension(\"indexOf\", simpleFunc)\naddArrayExtension(\"join\", simpleFunc)\naddArrayExtension(\"lastIndexOf\", simpleFunc)\naddArrayExtension(\"slice\", simpleFunc)\naddArrayExtension(\"toString\", simpleFunc)\naddArrayExtension(\"toLocaleString\", simpleFunc)\naddArrayExtension(\"toSorted\", simpleFunc)\naddArrayExtension(\"toSpliced\", simpleFunc)\naddArrayExtension(\"with\", simpleFunc)\n// map\naddArrayExtension(\"every\", mapLikeFunc)\naddArrayExtension(\"filter\", mapLikeFunc)\naddArrayExtension(\"find\", mapLikeFunc)\naddArrayExtension(\"findIndex\", mapLikeFunc)\naddArrayExtension(\"findLast\", mapLikeFunc)\naddArrayExtension(\"findLastIndex\", mapLikeFunc)\naddArrayExtension(\"flatMap\", mapLikeFunc)\naddArrayExtension(\"forEach\", mapLikeFunc)\naddArrayExtension(\"map\", mapLikeFunc)\naddArrayExtension(\"some\", mapLikeFunc)\naddArrayExtension(\"toReversed\", mapLikeFunc)\n// reduce\naddArrayExtension(\"reduce\", reduceLikeFunc)\naddArrayExtension(\"reduceRight\", reduceLikeFunc)\n\nfunction addArrayExtension(funcName, funcFactory) {\n if (typeof Array.prototype[funcName] === \"function\") {\n arrayExtensions[funcName] = funcFactory(funcName)\n }\n}\n\n// Report and delegate to dehanced array\nfunction simpleFunc(funcName) {\n return function () {\n const adm: ObservableArrayAdministration = this[$mobx]\n adm.atom_.reportObserved()\n const dehancedValues = adm.dehanceValues_(adm.values_)\n return dehancedValues[funcName].apply(dehancedValues, arguments)\n }\n}\n\n// Make sure callbacks recieve correct array arg #2326\nfunction mapLikeFunc(funcName) {\n return function (callback, thisArg) {\n const adm: ObservableArrayAdministration = this[$mobx]\n adm.atom_.reportObserved()\n const dehancedValues = adm.dehanceValues_(adm.values_)\n return dehancedValues[funcName]((element, index) => {\n return callback.call(thisArg, element, index, this)\n })\n }\n}\n\n// Make sure callbacks recieve correct array arg #2326\nfunction reduceLikeFunc(funcName) {\n return function () {\n const adm: ObservableArrayAdministration = this[$mobx]\n adm.atom_.reportObserved()\n const dehancedValues = adm.dehanceValues_(adm.values_)\n // #2432 - reduce behavior depends on arguments.length\n const callback = arguments[0]\n arguments[0] = (accumulator, currentValue, index) => {\n return callback(accumulator, currentValue, index, this)\n }\n return dehancedValues[funcName].apply(dehancedValues, arguments)\n }\n}\n\nconst isObservableArrayAdministration = createInstanceofPredicate(\n \"ObservableArrayAdministration\",\n ObservableArrayAdministration\n)\n\nexport function isObservableArray(thing): thing is IObservableArray<any> {\n return isObject(thing) && isObservableArrayAdministration(thing[$mobx])\n}\n","import {\n $mobx,\n IEnhancer,\n IInterceptable,\n IInterceptor,\n IListenable,\n Lambda,\n ObservableValue,\n checkIfStateModificationsAreAllowed,\n createAtom,\n createInstanceofPredicate,\n deepEnhancer,\n getNextId,\n getPlainObjectKeys,\n hasInterceptors,\n hasListeners,\n interceptChange,\n isES6Map,\n isPlainObject,\n isSpyEnabled,\n makeIterable,\n notifyListeners,\n referenceEnhancer,\n registerInterceptor,\n registerListener,\n spyReportEnd,\n spyReportStart,\n stringifyKey,\n transaction,\n untracked,\n onBecomeUnobserved,\n globalState,\n die,\n isFunction,\n UPDATE,\n IAtom,\n PureSpyEvent,\n initObservable\n} from \"../internal\"\n\nexport interface IKeyValueMap<V = any> {\n [key: string]: V\n}\n\nexport type IMapEntry<K = any, V = any> = [K, V]\nexport type IReadonlyMapEntry<K = any, V = any> = readonly [K, V]\nexport type IMapEntries<K = any, V = any> = IMapEntry<K, V>[]\nexport type IReadonlyMapEntries<K = any, V = any> = IReadonlyMapEntry<K, V>[]\n\nexport type IMapDidChange<K = any, V = any> = { observableKind: \"map\"; debugObjectName: string } & (\n | {\n object: ObservableMap<K, V>\n name: K // actual the key or index, but this is based on the ancient .observe proposal for consistency\n type: \"update\"\n newValue: V\n oldValue: V\n }\n | {\n object: ObservableMap<K, V>\n name: K\n type: \"add\"\n newValue: V\n }\n | {\n object: ObservableMap<K, V>\n name: K\n type: \"delete\"\n oldValue: V\n }\n)\n\nexport interface IMapWillChange<K = any, V = any> {\n object: ObservableMap<K, V>\n type: \"update\" | \"add\" | \"delete\"\n name: K\n newValue?: V\n}\n\nconst ObservableMapMarker = {}\n\nexport const ADD = \"add\"\nexport const DELETE = \"delete\"\n\nexport type IObservableMapInitialValues<K = any, V = any> =\n | IMapEntries<K, V>\n | IReadonlyMapEntries<K, V>\n | IKeyValueMap<V>\n | Map<K, V>\n\n// just extend Map? See also https://gist.github.com/nestharus/13b4d74f2ef4a2f4357dbd3fc23c1e54\n// But: https://github.com/mobxjs/mobx/issues/1556\nexport class ObservableMap<K = any, V = any>\n implements Map<K, V>, IInterceptable<IMapWillChange<K, V>>, IListenable\n{\n [$mobx] = ObservableMapMarker\n data_!: Map<K, ObservableValue<V>>\n hasMap_!: Map<K, ObservableValue<boolean>> // hasMap, not hashMap >-).\n keysAtom_!: IAtom\n interceptors_\n changeListeners_\n dehancer: any\n\n constructor(\n initialData?: IObservableMapInitialValues<K, V>,\n public enhancer_: IEnhancer<V> = deepEnhancer,\n public name_ = __DEV__ ? \"ObservableMap@\" + getNextId() : \"ObservableMap\"\n ) {\n if (!isFunction(Map)) {\n die(18)\n }\n initObservable(() => {\n this.keysAtom_ = createAtom(__DEV__ ? `${this.name_}.keys()` : \"ObservableMap.keys()\")\n this.data_ = new Map()\n this.hasMap_ = new Map()\n if (initialData) {\n this.merge(initialData)\n }\n })\n }\n\n private has_(key: K): boolean {\n return this.data_.has(key)\n }\n\n has(key: K): boolean {\n if (!globalState.trackingDerivation) {\n return this.has_(key)\n }\n\n let entry = this.hasMap_.get(key)\n if (!entry) {\n const newEntry = (entry = new ObservableValue(\n this.has_(key),\n referenceEnhancer,\n __DEV__ ? `${this.name_}.${stringifyKey(key)}?` : \"ObservableMap.key?\",\n false\n ))\n this.hasMap_.set(key, newEntry)\n onBecomeUnobserved(newEntry, () => this.hasMap_.delete(key))\n }\n\n return entry.get()\n }\n\n set(key: K, value: V) {\n const hasKey = this.has_(key)\n if (hasInterceptors(this)) {\n const change = interceptChange<IMapWillChange<K, V>>(this, {\n type: hasKey ? UPDATE : ADD,\n object: this,\n newValue: value,\n name: key\n })\n if (!change) {\n return this\n }\n value = change.newValue!\n }\n if (hasKey) {\n this.updateValue_(key, value)\n } else {\n this.addValue_(key, value)\n }\n return this\n }\n\n delete(key: K): boolean {\n checkIfStateModificationsAreAllowed(this.keysAtom_)\n if (hasInterceptors(this)) {\n const change = interceptChange<IMapWillChange<K, V>>(this, {\n type: DELETE,\n object: this,\n name: key\n })\n if (!change) {\n return false\n }\n }\n if (this.has_(key)) {\n const notifySpy = isSpyEnabled()\n const notify = hasListeners(this)\n const change: IMapDidChange<K, V> | null =\n notify || notifySpy\n ? {\n observableKind: \"map\",\n debugObjectName: this.name_,\n type: DELETE,\n object: this,\n oldValue: (<any>this.data_.get(key)).value_,\n name: key\n }\n : null\n\n if (__DEV__ && notifySpy) {\n spyReportStart(change! as PureSpyEvent)\n } // TODO fix type\n transaction(() => {\n this.keysAtom_.reportChanged()\n this.hasMap_.get(key)?.setNewValue_(false)\n const observable = this.data_.get(key)!\n observable.setNewValue_(undefined as any)\n this.data_.delete(key)\n })\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n return true\n }\n return false\n }\n\n private updateValue_(key: K, newValue: V | undefined) {\n const observable = this.data_.get(key)!\n newValue = (observable as any).prepareNewValue_(newValue) as V\n if (newValue !== globalState.UNCHANGED) {\n const notifySpy = isSpyEnabled()\n const notify = hasListeners(this)\n const change: IMapDidChange<K, V> | null =\n notify || notifySpy\n ? {\n observableKind: \"map\",\n debugObjectName: this.name_,\n type: UPDATE,\n object: this,\n oldValue: (observable as any).value_,\n name: key,\n newValue\n }\n : null\n if (__DEV__ && notifySpy) {\n spyReportStart(change! as PureSpyEvent)\n } // TODO fix type\n observable.setNewValue_(newValue as V)\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n }\n\n private addValue_(key: K, newValue: V) {\n checkIfStateModificationsAreAllowed(this.keysAtom_)\n transaction(() => {\n const observable = new ObservableValue(\n newValue,\n this.enhancer_,\n __DEV__ ? `${this.name_}.${stringifyKey(key)}` : \"ObservableMap.key\",\n false\n )\n this.data_.set(key, observable)\n newValue = (observable as any).value_ // value might have been changed\n this.hasMap_.get(key)?.setNewValue_(true)\n this.keysAtom_.reportChanged()\n })\n const notifySpy = isSpyEnabled()\n const notify = hasListeners(this)\n const change: IMapDidChange<K, V> | null =\n notify || notifySpy\n ? {\n observableKind: \"map\",\n debugObjectName: this.name_,\n type: ADD,\n object: this,\n name: key,\n newValue\n }\n : null\n if (__DEV__ && notifySpy) {\n spyReportStart(change! as PureSpyEvent)\n } // TODO fix type\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n\n get(key: K): V | undefined {\n if (this.has(key)) {\n return this.dehanceValue_(this.data_.get(key)!.get())\n }\n return this.dehanceValue_(undefined)\n }\n\n private dehanceValue_<X extends V | undefined>(value: X): X {\n if (this.dehancer !== undefined) {\n return this.dehancer(value)\n }\n return value\n }\n\n keys(): IterableIterator<K> {\n this.keysAtom_.reportObserved()\n return this.data_.keys()\n }\n\n values(): IterableIterator<V> {\n const self = this\n const keys = this.keys()\n return makeIterable({\n next() {\n const { done, value } = keys.next()\n return {\n done,\n value: done ? (undefined as any) : self.get(value)\n }\n }\n })\n }\n\n entries(): IterableIterator<IMapEntry<K, V>> {\n const self = this\n const keys = this.keys()\n return makeIterable({\n next() {\n const { done, value } = keys.next()\n return {\n done,\n value: done ? (undefined as any) : ([value, self.get(value)!] as [K, V])\n }\n }\n })\n }\n\n [Symbol.iterator]() {\n return this.entries()\n }\n\n forEach(callback: (value: V, key: K, object: Map<K, V>) => void, thisArg?) {\n for (const [key, value] of this) {\n callback.call(thisArg, value, key, this)\n }\n }\n\n /** Merge another object into this object, returns this. */\n merge(other?: IObservableMapInitialValues<K, V>): ObservableMap<K, V> {\n if (isObservableMap(other)) {\n other = new Map(other)\n }\n transaction(() => {\n if (isPlainObject(other)) {\n getPlainObjectKeys(other).forEach((key: any) =>\n this.set(key as K, (other as IKeyValueMap)[key])\n )\n } else if (Array.isArray(other)) {\n other.forEach(([key, value]) => this.set(key, value))\n } else if (isES6Map(other)) {\n if (other.constructor !== Map) {\n die(19, other)\n }\n other.forEach((value, key) => this.set(key, value))\n } else if (other !== null && other !== undefined) {\n die(20, other)\n }\n })\n return this\n }\n\n clear() {\n transaction(() => {\n untracked(() => {\n for (const key of this.keys()) {\n this.delete(key)\n }\n })\n })\n }\n\n replace(values: IObservableMapInitialValues<K, V>): ObservableMap<K, V> {\n // Implementation requirements:\n // - respect ordering of replacement map\n // - allow interceptors to run and potentially prevent individual operations\n // - don't recreate observables that already exist in original map (so we don't destroy existing subscriptions)\n // - don't _keysAtom.reportChanged if the keys of resulting map are indentical (order matters!)\n // - note that result map may differ from replacement map due to the interceptors\n transaction(() => {\n // Convert to map so we can do quick key lookups\n const replacementMap = convertToMap(values)\n const orderedData = new Map()\n // Used for optimization\n let keysReportChangedCalled = false\n // Delete keys that don't exist in replacement map\n // if the key deletion is prevented by interceptor\n // add entry at the beginning of the result map\n for (const key of this.data_.keys()) {\n // Concurrently iterating/deleting keys\n // iterator should handle this correctly\n if (!replacementMap.has(key)) {\n const deleted = this.delete(key)\n // Was the key removed?\n if (deleted) {\n // _keysAtom.reportChanged() was already called\n keysReportChangedCalled = true\n } else {\n // Delete prevented by interceptor\n const value = this.data_.get(key)\n orderedData.set(key, value)\n }\n }\n }\n // Merge entries\n for (const [key, value] of replacementMap.entries()) {\n // We will want to know whether a new key is added\n const keyExisted = this.data_.has(key)\n // Add or update value\n this.set(key, value)\n // The addition could have been prevent by interceptor\n if (this.data_.has(key)) {\n // The update could have been prevented by interceptor\n // and also we want to preserve existing values\n // so use value from _data map (instead of replacement map)\n const value = this.data_.get(key)\n orderedData.set(key, value)\n // Was a new key added?\n if (!keyExisted) {\n // _keysAtom.reportChanged() was already called\n keysReportChangedCalled = true\n }\n }\n }\n // Check for possible key order change\n if (!keysReportChangedCalled) {\n if (this.data_.size !== orderedData.size) {\n // If size differs, keys are definitely modified\n this.keysAtom_.reportChanged()\n } else {\n const iter1 = this.data_.keys()\n const iter2 = orderedData.keys()\n let next1 = iter1.next()\n let next2 = iter2.next()\n while (!next1.done) {\n if (next1.value !== next2.value) {\n this.keysAtom_.reportChanged()\n break\n }\n next1 = iter1.next()\n next2 = iter2.next()\n }\n }\n }\n // Use correctly ordered map\n this.data_ = orderedData\n })\n return this\n }\n\n get size(): number {\n this.keysAtom_.reportObserved()\n return this.data_.size\n }\n\n toString(): string {\n return \"[object ObservableMap]\"\n }\n\n toJSON(): [K, V][] {\n return Array.from(this)\n }\n\n get [Symbol.toStringTag]() {\n return \"Map\"\n }\n\n /**\n * Observes this object. Triggers for the events 'add', 'update' and 'delete'.\n * See: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/observe\n * for callback details\n */\n observe_(listener: (changes: IMapDidChange<K, V>) => void, fireImmediately?: boolean): Lambda {\n if (__DEV__ && fireImmediately === true) {\n die(\"`observe` doesn't support fireImmediately=true in combination with maps.\")\n }\n return registerListener(this, listener)\n }\n\n intercept_(handler: IInterceptor<IMapWillChange<K, V>>): Lambda {\n return registerInterceptor(this, handler)\n }\n}\n\n// eslint-disable-next-line\nexport var isObservableMap = createInstanceofPredicate(\"ObservableMap\", ObservableMap) as (\n thing: any\n) => thing is ObservableMap<any, any>\n\nfunction convertToMap(dataStructure: any): Map<any, any> {\n if (isES6Map(dataStructure) || isObservableMap(dataStructure)) {\n return dataStructure\n } else if (Array.isArray(dataStructure)) {\n return new Map(dataStructure)\n } else if (isPlainObject(dataStructure)) {\n const map = new Map()\n for (const key in dataStructure) {\n map.set(key, dataStructure[key])\n }\n return map\n } else {\n return die(21, dataStructure)\n }\n}\n","import {\n $mobx,\n createAtom,\n deepEnhancer,\n getNextId,\n IEnhancer,\n isSpyEnabled,\n hasListeners,\n IListenable,\n registerListener,\n Lambda,\n spyReportStart,\n notifyListeners,\n spyReportEnd,\n createInstanceofPredicate,\n hasInterceptors,\n interceptChange,\n IInterceptable,\n IInterceptor,\n registerInterceptor,\n checkIfStateModificationsAreAllowed,\n untracked,\n makeIterable,\n transaction,\n isES6Set,\n IAtom,\n DELETE,\n ADD,\n die,\n isFunction,\n initObservable\n} from \"../internal\"\n\nconst ObservableSetMarker = {}\n\nexport type IObservableSetInitialValues<T> = Set<T> | readonly T[]\n\nexport type ISetDidChange<T = any> =\n | {\n object: ObservableSet<T>\n observableKind: \"set\"\n debugObjectName: string\n type: \"add\"\n newValue: T\n }\n | {\n object: ObservableSet<T>\n observableKind: \"set\"\n debugObjectName: string\n type: \"delete\"\n oldValue: T\n }\n\nexport type ISetWillChange<T = any> =\n | {\n type: \"delete\"\n object: ObservableSet<T>\n oldValue: T\n }\n | {\n type: \"add\"\n object: ObservableSet<T>\n newValue: T\n }\n\nexport class ObservableSet<T = any> implements Set<T>, IInterceptable<ISetWillChange>, IListenable {\n [$mobx] = ObservableSetMarker\n private data_: Set<any> = new Set()\n atom_!: IAtom\n changeListeners_\n interceptors_\n dehancer: any\n enhancer_: (newV: any, oldV: any | undefined) => any\n\n constructor(\n initialData?: IObservableSetInitialValues<T>,\n enhancer: IEnhancer<T> = deepEnhancer,\n public name_ = __DEV__ ? \"ObservableSet@\" + getNextId() : \"ObservableSet\"\n ) {\n if (!isFunction(Set)) {\n die(22)\n }\n this.enhancer_ = (newV, oldV) => enhancer(newV, oldV, name_)\n initObservable(() => {\n this.atom_ = createAtom(this.name_)\n if (initialData) {\n this.replace(initialData)\n }\n })\n }\n\n private dehanceValue_<X extends T | undefined>(value: X): X {\n if (this.dehancer !== undefined) {\n return this.dehancer(value)\n }\n return value\n }\n\n clear() {\n transaction(() => {\n untracked(() => {\n for (const value of this.data_.values()) {\n this.delete(value)\n }\n })\n })\n }\n\n forEach(callbackFn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any) {\n for (const value of this) {\n callbackFn.call(thisArg, value, value, this)\n }\n }\n\n get size() {\n this.atom_.reportObserved()\n return this.data_.size\n }\n\n add(value: T) {\n checkIfStateModificationsAreAllowed(this.atom_)\n if (hasInterceptors(this)) {\n const change = interceptChange<ISetWillChange<T>>(this, {\n type: ADD,\n object: this,\n newValue: value\n })\n if (!change) {\n return this\n }\n // ideally, value = change.value would be done here, so that values can be\n // changed by interceptor. Same applies for other Set and Map api's.\n }\n if (!this.has(value)) {\n transaction(() => {\n this.data_.add(this.enhancer_(value, undefined))\n this.atom_.reportChanged()\n })\n const notifySpy = __DEV__ && isSpyEnabled()\n const notify = hasListeners(this)\n const change =\n notify || notifySpy\n ? <ISetDidChange<T>>{\n observableKind: \"set\",\n debugObjectName: this.name_,\n type: ADD,\n object: this,\n newValue: value\n }\n : null\n if (notifySpy && __DEV__) {\n spyReportStart(change!)\n }\n if (notify) {\n notifyListeners(this, change)\n }\n if (notifySpy && __DEV__) {\n spyReportEnd()\n }\n }\n\n return this\n }\n\n delete(value: T) {\n if (hasInterceptors(this)) {\n const change = interceptChange<ISetWillChange<T>>(this, {\n type: DELETE,\n object: this,\n oldValue: value\n })\n if (!change) {\n return false\n }\n }\n if (this.has(value)) {\n const notifySpy = __DEV__ && isSpyEnabled()\n const notify = hasListeners(this)\n const change =\n notify || notifySpy\n ? <ISetDidChange<T>>{\n observableKind: \"set\",\n debugObjectName: this.name_,\n type: DELETE,\n object: this,\n oldValue: value\n }\n : null\n\n if (notifySpy && __DEV__) {\n spyReportStart(change!)\n }\n transaction(() => {\n this.atom_.reportChanged()\n this.data_.delete(value)\n })\n if (notify) {\n notifyListeners(this, change)\n }\n if (notifySpy && __DEV__) {\n spyReportEnd()\n }\n return true\n }\n return false\n }\n\n has(value: T) {\n this.atom_.reportObserved()\n return this.data_.has(this.dehanceValue_(value))\n }\n\n entries() {\n let nextIndex = 0\n const keys = Array.from(this.keys())\n const values = Array.from(this.values())\n return makeIterable<[T, T]>({\n next() {\n const index = nextIndex\n nextIndex += 1\n return index < values.length\n ? { value: [keys[index], values[index]], done: false }\n : { done: true }\n }\n } as any)\n }\n\n keys(): IterableIterator<T> {\n return this.values()\n }\n\n values(): IterableIterator<T> {\n this.atom_.reportObserved()\n const self = this\n let nextIndex = 0\n const observableValues = Array.from(this.data_.values())\n return makeIterable<T>({\n next() {\n return nextIndex < observableValues.length\n ? { value: self.dehanceValue_(observableValues[nextIndex++]), done: false }\n : { done: true }\n }\n } as any)\n }\n\n replace(other: ObservableSet<T> | IObservableSetInitialValues<T>): ObservableSet<T> {\n if (isObservableSet(other)) {\n other = new Set(other)\n }\n\n transaction(() => {\n if (Array.isArray(other)) {\n this.clear()\n other.forEach(value => this.add(value))\n } else if (isES6Set(other)) {\n this.clear()\n other.forEach(value => this.add(value))\n } else if (other !== null && other !== undefined) {\n die(\"Cannot initialize set from \" + other)\n }\n })\n\n return this\n }\n observe_(listener: (changes: ISetDidChange<T>) => void, fireImmediately?: boolean): Lambda {\n // ... 'fireImmediately' could also be true?\n if (__DEV__ && fireImmediately === true) {\n die(\"`observe` doesn't support fireImmediately=true in combination with sets.\")\n }\n return registerListener(this, listener)\n }\n\n intercept_(handler: IInterceptor<ISetWillChange<T>>): Lambda {\n return registerInterceptor(this, handler)\n }\n\n toJSON(): T[] {\n return Array.from(this)\n }\n\n toString(): string {\n return \"[object ObservableSet]\"\n }\n\n [Symbol.iterator]() {\n return this.values()\n }\n\n get [Symbol.toStringTag]() {\n return \"Set\"\n }\n}\n\n// eslint-disable-next-line\nexport var isObservableSet = createInstanceofPredicate(\"ObservableSet\", ObservableSet) as (\n thing: any\n) => thing is ObservableSet<any>\n","import {\n CreateObservableOptions,\n getAnnotationFromOptions,\n propagateChanged,\n isAnnotation,\n $mobx,\n Atom,\n Annotation,\n ComputedValue,\n IAtom,\n IComputedValueOptions,\n IEnhancer,\n IInterceptable,\n IListenable,\n Lambda,\n ObservableValue,\n addHiddenProp,\n createInstanceofPredicate,\n endBatch,\n getNextId,\n hasInterceptors,\n hasListeners,\n interceptChange,\n isObject,\n isPlainObject,\n isSpyEnabled,\n notifyListeners,\n referenceEnhancer,\n registerInterceptor,\n registerListener,\n spyReportEnd,\n spyReportStart,\n startBatch,\n stringifyKey,\n globalState,\n ADD,\n UPDATE,\n die,\n hasProp,\n getDescriptor,\n storedAnnotationsSymbol,\n ownKeys,\n isOverride,\n defineProperty,\n autoAnnotation,\n getAdministration,\n getDebugName,\n objectPrototype,\n MakeResult,\n checkIfStateModificationsAreAllowed\n} from \"../internal\"\n\nconst descriptorCache = Object.create(null)\n\nexport type IObjectDidChange<T = any> = {\n observableKind: \"object\"\n name: PropertyKey\n object: T\n debugObjectName: string\n} & (\n | {\n type: \"add\"\n newValue: any\n }\n | {\n type: \"update\"\n oldValue: any\n newValue: any\n }\n | {\n type: \"remove\"\n oldValue: any\n }\n)\n\nexport type IObjectWillChange<T = any> =\n | {\n object: T\n type: \"update\" | \"add\"\n name: PropertyKey\n newValue: any\n }\n | {\n object: T\n type: \"remove\"\n name: PropertyKey\n }\n\nconst REMOVE = \"remove\"\n\nexport class ObservableObjectAdministration\n implements IInterceptable<IObjectWillChange>, IListenable\n{\n keysAtom_: IAtom\n changeListeners_\n interceptors_\n proxy_: any\n isPlainObject_: boolean\n appliedAnnotations_?: object\n private pendingKeys_: undefined | Map<PropertyKey, ObservableValue<boolean>>\n\n constructor(\n public target_: any,\n public values_ = new Map<PropertyKey, ObservableValue<any> | ComputedValue<any>>(),\n public name_: string,\n // Used anytime annotation is not explicitely provided\n public defaultAnnotation_: Annotation = autoAnnotation\n ) {\n this.keysAtom_ = new Atom(__DEV__ ? `${this.name_}.keys` : \"ObservableObject.keys\")\n // Optimization: we use this frequently\n this.isPlainObject_ = isPlainObject(this.target_)\n if (__DEV__ && !isAnnotation(this.defaultAnnotation_)) {\n die(`defaultAnnotation must be valid annotation`)\n }\n if (__DEV__) {\n // Prepare structure for tracking which fields were already annotated\n this.appliedAnnotations_ = {}\n }\n }\n\n getObservablePropValue_(key: PropertyKey): any {\n return this.values_.get(key)!.get()\n }\n\n setObservablePropValue_(key: PropertyKey, newValue): boolean | null {\n const observable = this.values_.get(key)\n if (observable instanceof ComputedValue) {\n observable.set(newValue)\n return true\n }\n\n // intercept\n if (hasInterceptors(this)) {\n const change = interceptChange<IObjectWillChange>(this, {\n type: UPDATE,\n object: this.proxy_ || this.target_,\n name: key,\n newValue\n })\n if (!change) {\n return null\n }\n newValue = (change as any).newValue\n }\n newValue = (observable as any).prepareNewValue_(newValue)\n\n // notify spy & observers\n if (newValue !== globalState.UNCHANGED) {\n const notify = hasListeners(this)\n const notifySpy = __DEV__ && isSpyEnabled()\n const change: IObjectDidChange | null =\n notify || notifySpy\n ? {\n type: UPDATE,\n observableKind: \"object\",\n debugObjectName: this.name_,\n object: this.proxy_ || this.target_,\n oldValue: (observable as any).value_,\n name: key,\n newValue\n }\n : null\n\n if (__DEV__ && notifySpy) {\n spyReportStart(change!)\n }\n ;(observable as ObservableValue<any>).setNewValue_(newValue)\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n return true\n }\n\n get_(key: PropertyKey): any {\n if (globalState.trackingDerivation && !hasProp(this.target_, key)) {\n // Key doesn't exist yet, subscribe for it in case it's added later\n this.has_(key)\n }\n return this.target_[key]\n }\n\n /**\n * @param {PropertyKey} key\n * @param {any} value\n * @param {Annotation|boolean} annotation true - use default annotation, false - copy as is\n * @param {boolean} proxyTrap whether it's called from proxy trap\n * @returns {boolean|null} true on success, false on failure (proxyTrap + non-configurable), null when cancelled by interceptor\n */\n set_(key: PropertyKey, value: any, proxyTrap: boolean = false): boolean | null {\n // Don't use .has(key) - we care about own\n if (hasProp(this.target_, key)) {\n // Existing prop\n if (this.values_.has(key)) {\n // Observable (can be intercepted)\n return this.setObservablePropValue_(key, value)\n } else if (proxyTrap) {\n // Non-observable - proxy\n return Reflect.set(this.target_, key, value)\n } else {\n // Non-observable\n this.target_[key] = value\n return true\n }\n } else {\n // New prop\n return this.extend_(\n key,\n { value, enumerable: true, writable: true, configurable: true },\n this.defaultAnnotation_,\n proxyTrap\n )\n }\n }\n\n // Trap for \"in\"\n has_(key: PropertyKey): boolean {\n if (!globalState.trackingDerivation) {\n // Skip key subscription outside derivation\n return key in this.target_\n }\n this.pendingKeys_ ||= new Map()\n let entry = this.pendingKeys_.get(key)\n if (!entry) {\n entry = new ObservableValue(\n key in this.target_,\n referenceEnhancer,\n __DEV__ ? `${this.name_}.${stringifyKey(key)}?` : \"ObservableObject.key?\",\n false\n )\n this.pendingKeys_.set(key, entry)\n }\n return entry.get()\n }\n\n /**\n * @param {PropertyKey} key\n * @param {Annotation|boolean} annotation true - use default annotation, false - ignore prop\n */\n make_(key: PropertyKey, annotation: Annotation | boolean): void {\n if (annotation === true) {\n annotation = this.defaultAnnotation_\n }\n if (annotation === false) {\n return\n }\n assertAnnotable(this, annotation, key)\n if (!(key in this.target_)) {\n // Throw on missing key, except for decorators:\n // Decorator annotations are collected from whole prototype chain.\n // When called from super() some props may not exist yet.\n // However we don't have to worry about missing prop,\n // because the decorator must have been applied to something.\n if (this.target_[storedAnnotationsSymbol]?.[key]) {\n return // will be annotated by subclass constructor\n } else {\n die(1, annotation.annotationType_, `${this.name_}.${key.toString()}`)\n }\n }\n let source = this.target_\n while (source && source !== objectPrototype) {\n const descriptor = getDescriptor(source, key)\n if (descriptor) {\n const outcome = annotation.make_(this, key, descriptor, source)\n if (outcome === MakeResult.Cancel) {\n return\n }\n if (outcome === MakeResult.Break) {\n break\n }\n }\n source = Object.getPrototypeOf(source)\n }\n recordAnnotationApplied(this, annotation, key)\n }\n\n /**\n * @param {PropertyKey} key\n * @param {PropertyDescriptor} descriptor\n * @param {Annotation|boolean} annotation true - use default annotation, false - copy as is\n * @param {boolean} proxyTrap whether it's called from proxy trap\n * @returns {boolean|null} true on success, false on failure (proxyTrap + non-configurable), null when cancelled by interceptor\n */\n extend_(\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n annotation: Annotation | boolean,\n proxyTrap: boolean = false\n ): boolean | null {\n if (annotation === true) {\n annotation = this.defaultAnnotation_\n }\n if (annotation === false) {\n return this.defineProperty_(key, descriptor, proxyTrap)\n }\n assertAnnotable(this, annotation, key)\n const outcome = annotation.extend_(this, key, descriptor, proxyTrap)\n if (outcome) {\n recordAnnotationApplied(this, annotation, key)\n }\n return outcome\n }\n\n /**\n * @param {PropertyKey} key\n * @param {PropertyDescriptor} descriptor\n * @param {boolean} proxyTrap whether it's called from proxy trap\n * @returns {boolean|null} true on success, false on failure (proxyTrap + non-configurable), null when cancelled by interceptor\n */\n defineProperty_(\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean = false\n ): boolean | null {\n checkIfStateModificationsAreAllowed(this.keysAtom_)\n try {\n startBatch()\n\n // Delete\n const deleteOutcome = this.delete_(key)\n if (!deleteOutcome) {\n // Failure or intercepted\n return deleteOutcome\n }\n\n // ADD interceptor\n if (hasInterceptors(this)) {\n const change = interceptChange<IObjectWillChange>(this, {\n object: this.proxy_ || this.target_,\n name: key,\n type: ADD,\n newValue: descriptor.value\n })\n if (!change) {\n return null\n }\n const { newValue } = change as any\n if (descriptor.value !== newValue) {\n descriptor = {\n ...descriptor,\n value: newValue\n }\n }\n }\n\n // Define\n if (proxyTrap) {\n if (!Reflect.defineProperty(this.target_, key, descriptor)) {\n return false\n }\n } else {\n defineProperty(this.target_, key, descriptor)\n }\n\n // Notify\n this.notifyPropertyAddition_(key, descriptor.value)\n } finally {\n endBatch()\n }\n return true\n }\n\n // If original descriptor becomes relevant, move this to annotation directly\n defineObservableProperty_(\n key: PropertyKey,\n value: any,\n enhancer: IEnhancer<any>,\n proxyTrap: boolean = false\n ): boolean | null {\n checkIfStateModificationsAreAllowed(this.keysAtom_)\n try {\n startBatch()\n\n // Delete\n const deleteOutcome = this.delete_(key)\n if (!deleteOutcome) {\n // Failure or intercepted\n return deleteOutcome\n }\n\n // ADD interceptor\n if (hasInterceptors(this)) {\n const change = interceptChange<IObjectWillChange>(this, {\n object: this.proxy_ || this.target_,\n name: key,\n type: ADD,\n newValue: value\n })\n if (!change) {\n return null\n }\n value = (change as any).newValue\n }\n\n const cachedDescriptor = getCachedObservablePropDescriptor(key)\n const descriptor = {\n configurable: globalState.safeDescriptors ? this.isPlainObject_ : true,\n enumerable: true,\n get: cachedDescriptor.get,\n set: cachedDescriptor.set\n }\n\n // Define\n if (proxyTrap) {\n if (!Reflect.defineProperty(this.target_, key, descriptor)) {\n return false\n }\n } else {\n defineProperty(this.target_, key, descriptor)\n }\n\n const observable = new ObservableValue(\n value,\n enhancer,\n __DEV__ ? `${this.name_}.${key.toString()}` : \"ObservableObject.key\",\n false\n )\n\n this.values_.set(key, observable)\n\n // Notify (value possibly changed by ObservableValue)\n this.notifyPropertyAddition_(key, observable.value_)\n } finally {\n endBatch()\n }\n return true\n }\n\n // If original descriptor becomes relevant, move this to annotation directly\n defineComputedProperty_(\n key: PropertyKey,\n options: IComputedValueOptions<any>,\n proxyTrap: boolean = false\n ): boolean | null {\n checkIfStateModificationsAreAllowed(this.keysAtom_)\n try {\n startBatch()\n\n // Delete\n const deleteOutcome = this.delete_(key)\n if (!deleteOutcome) {\n // Failure or intercepted\n return deleteOutcome\n }\n\n // ADD interceptor\n if (hasInterceptors(this)) {\n const change = interceptChange<IObjectWillChange>(this, {\n object: this.proxy_ || this.target_,\n name: key,\n type: ADD,\n newValue: undefined\n })\n if (!change) {\n return null\n }\n }\n options.name ||= __DEV__ ? `${this.name_}.${key.toString()}` : \"ObservableObject.key\"\n options.context = this.proxy_ || this.target_\n const cachedDescriptor = getCachedObservablePropDescriptor(key)\n const descriptor = {\n configurable: globalState.safeDescriptors ? this.isPlainObject_ : true,\n enumerable: false,\n get: cachedDescriptor.get,\n set: cachedDescriptor.set\n }\n\n // Define\n if (proxyTrap) {\n if (!Reflect.defineProperty(this.target_, key, descriptor)) {\n return false\n }\n } else {\n defineProperty(this.target_, key, descriptor)\n }\n\n this.values_.set(key, new ComputedValue(options))\n\n // Notify\n this.notifyPropertyAddition_(key, undefined)\n } finally {\n endBatch()\n }\n return true\n }\n\n /**\n * @param {PropertyKey} key\n * @param {PropertyDescriptor} descriptor\n * @param {boolean} proxyTrap whether it's called from proxy trap\n * @returns {boolean|null} true on success, false on failure (proxyTrap + non-configurable), null when cancelled by interceptor\n */\n delete_(key: PropertyKey, proxyTrap: boolean = false): boolean | null {\n checkIfStateModificationsAreAllowed(this.keysAtom_)\n // No such prop\n if (!hasProp(this.target_, key)) {\n return true\n }\n\n // Intercept\n if (hasInterceptors(this)) {\n const change = interceptChange<IObjectWillChange>(this, {\n object: this.proxy_ || this.target_,\n name: key,\n type: REMOVE\n })\n // Cancelled\n if (!change) {\n return null\n }\n }\n\n // Delete\n try {\n startBatch()\n const notify = hasListeners(this)\n const notifySpy = __DEV__ && isSpyEnabled()\n const observable = this.values_.get(key)\n // Value needed for spies/listeners\n let value = undefined\n // Optimization: don't pull the value unless we will need it\n if (!observable && (notify || notifySpy)) {\n value = getDescriptor(this.target_, key)?.value\n }\n // delete prop (do first, may fail)\n if (proxyTrap) {\n if (!Reflect.deleteProperty(this.target_, key)) {\n return false\n }\n } else {\n delete this.target_[key]\n }\n // Allow re-annotating this field\n if (__DEV__) {\n delete this.appliedAnnotations_![key]\n }\n // Clear observable\n if (observable) {\n this.values_.delete(key)\n // for computed, value is undefined\n if (observable instanceof ObservableValue) {\n value = observable.value_\n }\n // Notify: autorun(() => obj[key]), see #1796\n propagateChanged(observable)\n }\n // Notify \"keys/entries/values\" observers\n this.keysAtom_.reportChanged()\n\n // Notify \"has\" observers\n // \"in\" as it may still exist in proto\n this.pendingKeys_?.get(key)?.set(key in this.target_)\n\n // Notify spies/listeners\n if (notify || notifySpy) {\n const change: IObjectDidChange = {\n type: REMOVE,\n observableKind: \"object\",\n object: this.proxy_ || this.target_,\n debugObjectName: this.name_,\n oldValue: value,\n name: key\n }\n if (__DEV__ && notifySpy) {\n spyReportStart(change!)\n }\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n } finally {\n endBatch()\n }\n return true\n }\n\n /**\n * Observes this object. Triggers for the events 'add', 'update' and 'delete'.\n * See: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/observe\n * for callback details\n */\n observe_(callback: (changes: IObjectDidChange) => void, fireImmediately?: boolean): Lambda {\n if (__DEV__ && fireImmediately === true) {\n die(\"`observe` doesn't support the fire immediately property for observable objects.\")\n }\n return registerListener(this, callback)\n }\n\n intercept_(handler): Lambda {\n return registerInterceptor(this, handler)\n }\n\n notifyPropertyAddition_(key: PropertyKey, value: any) {\n const notify = hasListeners(this)\n const notifySpy = __DEV__ && isSpyEnabled()\n if (notify || notifySpy) {\n const change: IObjectDidChange | null =\n notify || notifySpy\n ? ({\n type: ADD,\n observableKind: \"object\",\n debugObjectName: this.name_,\n object: this.proxy_ || this.target_,\n name: key,\n newValue: value\n } as const)\n : null\n\n if (__DEV__ && notifySpy) {\n spyReportStart(change!)\n }\n if (notify) {\n notifyListeners(this, change)\n }\n if (__DEV__ && notifySpy) {\n spyReportEnd()\n }\n }\n\n this.pendingKeys_?.get(key)?.set(true)\n\n // Notify \"keys/entries/values\" observers\n this.keysAtom_.reportChanged()\n }\n\n ownKeys_(): ArrayLike<string | symbol> {\n this.keysAtom_.reportObserved()\n return ownKeys(this.target_)\n }\n\n keys_(): PropertyKey[] {\n // Returns enumerable && own, but unfortunately keysAtom will report on ANY key change.\n // There is no way to distinguish between Object.keys(object) and Reflect.ownKeys(object) - both are handled by ownKeys trap.\n // We can either over-report in Object.keys(object) or under-report in Reflect.ownKeys(object)\n // We choose to over-report in Object.keys(object), because:\n // - typically it's used with simple data objects\n // - when symbolic/non-enumerable keys are relevant Reflect.ownKeys works as expected\n this.keysAtom_.reportObserved()\n return Object.keys(this.target_)\n }\n}\n\nexport interface IIsObservableObject {\n $mobx: ObservableObjectAdministration\n}\n\nexport function asObservableObject(\n target: any,\n options?: CreateObservableOptions\n): IIsObservableObject {\n if (__DEV__ && options && isObservableObject(target)) {\n die(`Options can't be provided for already observable objects.`)\n }\n\n if (hasProp(target, $mobx)) {\n if (__DEV__ && !(getAdministration(target) instanceof ObservableObjectAdministration)) {\n die(\n `Cannot convert '${getDebugName(target)}' into observable object:` +\n `\\nThe target is already observable of different type.` +\n `\\nExtending builtins is not supported.`\n )\n }\n return target\n }\n\n if (__DEV__ && !Object.isExtensible(target)) {\n die(\"Cannot make the designated object observable; it is not extensible\")\n }\n\n const name =\n options?.name ??\n (__DEV__\n ? `${\n isPlainObject(target) ? \"ObservableObject\" : target.constructor.name\n }@${getNextId()}`\n : \"ObservableObject\")\n\n const adm = new ObservableObjectAdministration(\n target,\n new Map(),\n String(name),\n getAnnotationFromOptions(options)\n )\n\n addHiddenProp(target, $mobx, adm)\n\n return target\n}\n\nconst isObservableObjectAdministration = createInstanceofPredicate(\n \"ObservableObjectAdministration\",\n ObservableObjectAdministration\n)\n\nfunction getCachedObservablePropDescriptor(key) {\n return (\n descriptorCache[key] ||\n (descriptorCache[key] = {\n get() {\n return this[$mobx].getObservablePropValue_(key)\n },\n set(value) {\n return this[$mobx].setObservablePropValue_(key, value)\n }\n })\n )\n}\n\nexport function isObservableObject(thing: any): boolean {\n if (isObject(thing)) {\n return isObservableObjectAdministration((thing as any)[$mobx])\n }\n return false\n}\n\nexport function recordAnnotationApplied(\n adm: ObservableObjectAdministration,\n annotation: Annotation,\n key: PropertyKey\n) {\n if (__DEV__) {\n adm.appliedAnnotations_![key] = annotation\n }\n // Remove applied decorator annotation so we don't try to apply it again in subclass constructor\n delete adm.target_[storedAnnotationsSymbol]?.[key]\n}\n\nfunction assertAnnotable(\n adm: ObservableObjectAdministration,\n annotation: Annotation,\n key: PropertyKey\n) {\n // Valid annotation\n if (__DEV__ && !isAnnotation(annotation)) {\n die(`Cannot annotate '${adm.name_}.${key.toString()}': Invalid annotation.`)\n }\n\n /*\n // Configurable, not sealed, not frozen\n // Possibly not needed, just a little better error then the one thrown by engine.\n // Cases where this would be useful the most (subclass field initializer) are not interceptable by this.\n if (__DEV__) {\n const configurable = getDescriptor(adm.target_, key)?.configurable\n const frozen = Object.isFrozen(adm.target_)\n const sealed = Object.isSealed(adm.target_)\n if (!configurable || frozen || sealed) {\n const fieldName = `${adm.name_}.${key.toString()}`\n const requestedAnnotationType = annotation.annotationType_\n let error = `Cannot apply '${requestedAnnotationType}' to '${fieldName}':`\n if (frozen) {\n error += `\\nObject is frozen.`\n }\n if (sealed) {\n error += `\\nObject is sealed.`\n }\n if (!configurable) {\n error += `\\nproperty is not configurable.`\n // Mention only if caused by us to avoid confusion\n if (hasProp(adm.appliedAnnotations!, key)) {\n error += `\\nTo prevent accidental re-definition of a field by a subclass, `\n error += `all annotated fields of non-plain objects (classes) are not configurable.`\n }\n }\n die(error)\n }\n }\n */\n\n // Not annotated\n if (__DEV__ && !isOverride(annotation) && hasProp(adm.appliedAnnotations_!, key)) {\n const fieldName = `${adm.name_}.${key.toString()}`\n const currentAnnotationType = adm.appliedAnnotations_![key].annotationType_\n const requestedAnnotationType = annotation.annotationType_\n die(\n `Cannot apply '${requestedAnnotationType}' to '${fieldName}':` +\n `\\nThe field is already annotated with '${currentAnnotationType}'.` +\n `\\nRe-annotating fields is not allowed.` +\n `\\nUse 'override' annotation for methods overridden by subclass.`\n )\n }\n}\n","import {\n getNextId,\n addHiddenFinalProp,\n makeIterable,\n addHiddenProp,\n ObservableArrayAdministration,\n $mobx,\n arrayExtensions,\n IEnhancer,\n isObservableArray,\n IObservableArray,\n defineProperty,\n initObservable\n} from \"../internal\"\n\n// Bug in safari 9.* (or iOS 9 safari mobile). See #364\nconst ENTRY_0 = createArrayEntryDescriptor(0)\n\nconst safariPrototypeSetterInheritanceBug = (() => {\n let v = false\n const p = {}\n Object.defineProperty(p, \"0\", {\n set: () => {\n v = true\n }\n })\n Object.create(p)[\"0\"] = 1\n return v === false\n})()\n\n/**\n * This array buffer contains two lists of properties, so that all arrays\n * can recycle their property definitions, which significantly improves performance of creating\n * properties on the fly.\n */\nlet OBSERVABLE_ARRAY_BUFFER_SIZE = 0\n\n// Typescript workaround to make sure ObservableArray extends Array\nclass StubArray {}\nfunction inherit(ctor, proto) {\n if (Object.setPrototypeOf) {\n Object.setPrototypeOf(ctor.prototype, proto)\n } else if (ctor.prototype.__proto__ !== undefined) {\n ctor.prototype.__proto__ = proto\n } else {\n ctor.prototype = proto\n }\n}\ninherit(StubArray, Array.prototype)\n\n// Weex proto freeze protection was here,\n// but it is unclear why the hack is need as MobX never changed the prototype\n// anyway, so removed it in V6\n\nexport class LegacyObservableArray<T> extends StubArray {\n constructor(\n initialValues: T[] | undefined,\n enhancer: IEnhancer<T>,\n name = __DEV__ ? \"ObservableArray@\" + getNextId() : \"ObservableArray\",\n owned = false\n ) {\n super()\n initObservable(() => {\n const adm = new ObservableArrayAdministration(name, enhancer, owned, true)\n adm.proxy_ = this as any\n addHiddenFinalProp(this, $mobx, adm)\n\n if (initialValues && initialValues.length) {\n // @ts-ignore\n this.spliceWithArray(0, 0, initialValues)\n }\n\n if (safariPrototypeSetterInheritanceBug) {\n // Seems that Safari won't use numeric prototype setter untill any * numeric property is\n // defined on the instance. After that it works fine, even if this property is deleted.\n Object.defineProperty(this, \"0\", ENTRY_0)\n }\n })\n }\n\n concat(...arrays: T[][]): T[] {\n ;(this[$mobx] as ObservableArrayAdministration).atom_.reportObserved()\n return Array.prototype.concat.apply(\n (this as any).slice(),\n //@ts-ignore\n arrays.map(a => (isObservableArray(a) ? a.slice() : a))\n )\n }\n\n get length(): number {\n return (this[$mobx] as ObservableArrayAdministration).getArrayLength_()\n }\n\n set length(newLength: number) {\n ;(this[$mobx] as ObservableArrayAdministration).setArrayLength_(newLength)\n }\n\n get [Symbol.toStringTag]() {\n return \"Array\"\n }\n\n [Symbol.iterator]() {\n const self = this\n let nextIndex = 0\n return makeIterable({\n next() {\n return nextIndex < self.length\n ? { value: self[nextIndex++], done: false }\n : { done: true, value: undefined }\n }\n })\n }\n}\n\nObject.entries(arrayExtensions).forEach(([prop, fn]) => {\n if (prop !== \"concat\") {\n addHiddenProp(LegacyObservableArray.prototype, prop, fn)\n }\n})\n\nfunction createArrayEntryDescriptor(index: number) {\n return {\n enumerable: false,\n configurable: true,\n get: function () {\n return this[$mobx].get_(index)\n },\n set: function (value) {\n this[$mobx].set_(index, value)\n }\n }\n}\n\nfunction createArrayBufferItem(index: number) {\n defineProperty(LegacyObservableArray.prototype, \"\" + index, createArrayEntryDescriptor(index))\n}\n\nexport function reserveArrayBuffer(max: number) {\n if (max > OBSERVABLE_ARRAY_BUFFER_SIZE) {\n for (let index = OBSERVABLE_ARRAY_BUFFER_SIZE; index < max + 100; index++) {\n createArrayBufferItem(index)\n }\n OBSERVABLE_ARRAY_BUFFER_SIZE = max\n }\n}\n\nreserveArrayBuffer(1000)\n\nexport function createLegacyArray<T>(\n initialValues: T[] | undefined,\n enhancer: IEnhancer<T>,\n name?: string\n): IObservableArray<T> {\n return new LegacyObservableArray(initialValues, enhancer, name) as any\n}\n","import { isAction } from \"../api/action\"\nimport {\n $mobx,\n IDepTreeNode,\n isAtom,\n isComputedValue,\n isObservableArray,\n isObservableMap,\n isObservableObject,\n isReaction,\n isObservableSet,\n die,\n isFunction,\n allowStateChangesStart,\n untrackedStart,\n allowStateChangesEnd,\n untrackedEnd,\n startBatch,\n endBatch\n} from \"../internal\"\n\nexport function getAtom(thing: any, property?: PropertyKey): IDepTreeNode {\n if (typeof thing === \"object\" && thing !== null) {\n if (isObservableArray(thing)) {\n if (property !== undefined) {\n die(23)\n }\n return (thing as any)[$mobx].atom_\n }\n if (isObservableSet(thing)) {\n return thing.atom_\n }\n if (isObservableMap(thing)) {\n if (property === undefined) {\n return thing.keysAtom_\n }\n const observable = thing.data_.get(property) || thing.hasMap_.get(property)\n if (!observable) {\n die(25, property, getDebugName(thing))\n }\n return observable\n }\n if (property && !thing[$mobx]) {\n thing[property]\n } // See #1072\n if (isObservableObject(thing)) {\n if (!property) {\n return die(26)\n }\n const observable = (thing as any)[$mobx].values_.get(property)\n if (!observable) {\n die(27, property, getDebugName(thing))\n }\n return observable\n }\n if (isAtom(thing) || isComputedValue(thing) || isReaction(thing)) {\n return thing\n }\n } else if (isFunction(thing)) {\n if (isReaction(thing[$mobx])) {\n // disposer function\n return thing[$mobx]\n }\n }\n die(28)\n}\n\nexport function getAdministration(thing: any, property?: string) {\n if (!thing) {\n die(29)\n }\n if (property !== undefined) {\n return getAdministration(getAtom(thing, property))\n }\n if (isAtom(thing) || isComputedValue(thing) || isReaction(thing)) {\n return thing\n }\n if (isObservableMap(thing) || isObservableSet(thing)) {\n return thing\n }\n if (thing[$mobx]) {\n return thing[$mobx]\n }\n die(24, thing)\n}\n\nexport function getDebugName(thing: any, property?: string): string {\n let named\n if (property !== undefined) {\n named = getAtom(thing, property)\n } else if (isAction(thing)) {\n return thing.name\n } else if (isObservableObject(thing) || isObservableMap(thing) || isObservableSet(thing)) {\n named = getAdministration(thing)\n } else {\n // valid for arrays as well\n named = getAtom(thing)\n }\n return named.name_\n}\n\n/**\n * Helper function for initializing observable structures, it applies:\n * 1. allowStateChanges so we don't violate enforceActions.\n * 2. untracked so we don't accidentaly subscribe to anything observable accessed during init in case the observable is created inside derivation.\n * 3. batch to avoid state version updates\n */\nexport function initObservable<T>(cb: () => T): T {\n const derivation = untrackedStart()\n const allowStateChanges = allowStateChangesStart(true)\n startBatch()\n try {\n return cb()\n } finally {\n endBatch()\n allowStateChangesEnd(allowStateChanges)\n untrackedEnd(derivation)\n }\n}\n","import {\n isES6Map,\n isObservableArray,\n isObservableMap,\n isES6Set,\n isObservableSet,\n hasProp,\n isFunction,\n objectPrototype\n} from \"../internal\"\n\ndeclare const Symbol\nconst toString = objectPrototype.toString\n\nexport function deepEqual(a: any, b: any, depth: number = -1): boolean {\n return eq(a, b, depth)\n}\n\n// Copied from https://github.com/jashkenas/underscore/blob/5c237a7c682fb68fd5378203f0bf22dce1624854/underscore.js#L1186-L1289\n// Internal recursive comparison function for `isEqual`.\nfunction eq(a: any, b: any, depth: number, aStack?: any[], bStack?: any[]) {\n // Identical objects are equal. `0 === -0`, but they aren't identical.\n // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).\n if (a === b) {\n return a !== 0 || 1 / a === 1 / b\n }\n // `null` or `undefined` only equal to itself (strict comparison).\n if (a == null || b == null) {\n return false\n }\n // `NaN`s are equivalent, but non-reflexive.\n if (a !== a) {\n return b !== b\n }\n // Exhaust primitive checks\n const type = typeof a\n if (type !== \"function\" && type !== \"object\" && typeof b != \"object\") {\n return false\n }\n\n // Compare `[[Class]]` names.\n const className = toString.call(a)\n if (className !== toString.call(b)) {\n return false\n }\n switch (className) {\n // Strings, numbers, regular expressions, dates, and booleans are compared by value.\n case \"[object RegExp]\":\n // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')\n case \"[object String]\":\n // Primitives and their corresponding object wrappers are equivalent; thus, `\"5\"` is\n // equivalent to `new String(\"5\")`.\n return \"\" + a === \"\" + b\n case \"[object Number]\":\n // `NaN`s are equivalent, but non-reflexive.\n // Object(NaN) is equivalent to NaN.\n if (+a !== +a) {\n return +b !== +b\n }\n // An `egal` comparison is performed for other numeric values.\n return +a === 0 ? 1 / +a === 1 / b : +a === +b\n case \"[object Date]\":\n case \"[object Boolean]\":\n // Coerce dates and booleans to numeric primitive values. Dates are compared by their\n // millisecond representations. Note that invalid dates with millisecond representations\n // of `NaN` are not equivalent.\n return +a === +b\n case \"[object Symbol]\":\n return (\n typeof Symbol !== \"undefined\" && Symbol.valueOf.call(a) === Symbol.valueOf.call(b)\n )\n case \"[object Map]\":\n case \"[object Set]\":\n // Maps and Sets are unwrapped to arrays of entry-pairs, adding an incidental level.\n // Hide this extra level by increasing the depth.\n if (depth >= 0) {\n depth++\n }\n break\n }\n // Unwrap any wrapped objects.\n a = unwrap(a)\n b = unwrap(b)\n\n const areArrays = className === \"[object Array]\"\n if (!areArrays) {\n if (typeof a != \"object\" || typeof b != \"object\") {\n return false\n }\n\n // Objects with different constructors are not equivalent, but `Object`s or `Array`s\n // from different frames are.\n const aCtor = a.constructor,\n bCtor = b.constructor\n if (\n aCtor !== bCtor &&\n !(\n isFunction(aCtor) &&\n aCtor instanceof aCtor &&\n isFunction(bCtor) &&\n bCtor instanceof bCtor\n ) &&\n \"constructor\" in a &&\n \"constructor\" in b\n ) {\n return false\n }\n }\n\n if (depth === 0) {\n return false\n } else if (depth < 0) {\n depth = -1\n }\n\n // Assume equality for cyclic structures. The algorithm for detecting cyclic\n // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.\n\n // Initializing stack of traversed objects.\n // It's done here since we only need them for objects and arrays comparison.\n aStack = aStack || []\n bStack = bStack || []\n let length = aStack.length\n while (length--) {\n // Linear search. Performance is inversely proportional to the number of\n // unique nested structures.\n if (aStack[length] === a) {\n return bStack[length] === b\n }\n }\n\n // Add the first object to the stack of traversed objects.\n aStack.push(a)\n bStack.push(b)\n\n // Recursively compare objects and arrays.\n if (areArrays) {\n // Compare array lengths to determine if a deep comparison is necessary.\n length = a.length\n if (length !== b.length) {\n return false\n }\n // Deep compare the contents, ignoring non-numeric properties.\n while (length--) {\n if (!eq(a[length], b[length], depth - 1, aStack, bStack)) {\n return false\n }\n }\n } else {\n // Deep compare objects.\n const keys = Object.keys(a)\n let key\n length = keys.length\n // Ensure that both objects contain the same number of properties before comparing deep equality.\n if (Object.keys(b).length !== length) {\n return false\n }\n while (length--) {\n // Deep compare each member\n key = keys[length]\n if (!(hasProp(b, key) && eq(a[key], b[key], depth - 1, aStack, bStack))) {\n return false\n }\n }\n }\n // Remove the first object from the stack of traversed objects.\n aStack.pop()\n bStack.pop()\n return true\n}\n\nfunction unwrap(a: any) {\n if (isObservableArray(a)) {\n return a.slice()\n }\n if (isES6Map(a) || isObservableMap(a)) {\n return Array.from(a.entries())\n }\n if (isES6Set(a) || isObservableSet(a)) {\n return Array.from(a.entries())\n }\n return a\n}\n","export function makeIterable<T>(iterator: Iterator<T>): IterableIterator<T> {\n iterator[Symbol.iterator] = getSelf\n return iterator as any\n}\n\nfunction getSelf() {\n return this\n}\n","import { ObservableObjectAdministration, isFunction } from \"../internal\"\n\nexport const enum MakeResult {\n Cancel,\n Break,\n Continue\n}\n\nexport type Annotation = {\n annotationType_: string\n make_(\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n source: object\n ): MakeResult\n extend_(\n adm: ObservableObjectAdministration,\n key: PropertyKey,\n descriptor: PropertyDescriptor,\n proxyTrap: boolean\n ): boolean | null\n decorate_20223_(value: any, context: DecoratorContext)\n options_?: any\n}\n\nexport type AnnotationMapEntry =\n | Annotation\n | true /* follow the default decorator, usually deep */\n | false /* don't decorate this property */\n\n// AdditionalFields can be used to declare additional keys that can be used, for example to be able to\n// declare annotations for private/ protected members, see #2339\nexport type AnnotationsMap<T, AdditionalFields extends PropertyKey> = {\n [P in Exclude<keyof T, \"toString\">]?: AnnotationMapEntry\n} & Record<AdditionalFields, AnnotationMapEntry>\n\nexport function isAnnotation(thing: any) {\n return (\n // Can be function\n thing instanceof Object &&\n typeof thing.annotationType_ === \"string\" &&\n isFunction(thing.make_) &&\n isFunction(thing.extend_)\n )\n}\n\nexport function isAnnotationMapEntry(thing: any) {\n return typeof thing === \"boolean\" || isAnnotation(thing)\n}\n","/**\n * (c) Michel Weststrate 2015 - 2020\n * MIT Licensed\n *\n * Welcome to the mobx sources! To get a global overview of how MobX internally works,\n * this is a good place to start:\n * https://medium.com/@mweststrate/becoming-fully-reactive-an-in-depth-explanation-of-mobservable-55995262a254#.xvbh6qd74\n *\n * Source folders:\n * ===============\n *\n * - api/ Most of the public static methods exposed by the module can be found here.\n * - core/ Implementation of the MobX algorithm; atoms, derivations, reactions, dependency trees, optimizations. Cool stuff can be found here.\n * - types/ All the magic that is need to have observable objects, arrays and values is in this folder. Including the modifiers like `asFlat`.\n * - utils/ Utility stuff.\n *\n */\nimport { die } from \"./errors\"\nimport { getGlobal } from \"./utils/global\"\n;[\"Symbol\", \"Map\", \"Set\"].forEach(m => {\n let g = getGlobal()\n if (typeof g[m] === \"undefined\") {\n die(`MobX requires global '${m}' to be available or polyfilled`)\n }\n})\n\nimport { spy, getDebugName, $mobx } from \"./internal\"\n\nexport {\n IObservable,\n IDepTreeNode,\n Reaction,\n IReactionPublic,\n IReactionDisposer,\n untracked,\n IAtom,\n createAtom,\n spy,\n IComputedValue,\n IEqualsComparer,\n comparer,\n IEnhancer,\n IInterceptable,\n IInterceptor,\n IListenable,\n IObjectWillChange,\n IObjectDidChange,\n isObservableObject,\n IValueDidChange,\n IValueWillChange,\n IObservableValue,\n isObservableValue as isBoxedObservable,\n IObservableArray,\n IArrayWillChange,\n IArrayWillSplice,\n IArraySplice,\n IArrayUpdate,\n IArrayDidChange,\n isObservableArray,\n IKeyValueMap,\n ObservableMap,\n IMapEntries,\n IMapEntry,\n IMapWillChange,\n IMapDidChange,\n isObservableMap,\n IObservableMapInitialValues,\n ObservableSet,\n isObservableSet,\n ISetDidChange,\n ISetWillChange,\n IObservableSetInitialValues,\n transaction,\n observable,\n IObservableFactory,\n CreateObservableOptions,\n computed,\n IComputedFactory,\n isObservable,\n isObservableProp,\n isComputed,\n isComputedProp,\n extendObservable,\n observe,\n intercept,\n autorun,\n IAutorunOptions,\n reaction,\n IReactionOptions,\n when,\n IWhenOptions,\n action,\n isAction,\n runInAction,\n IActionFactory,\n keys,\n values,\n entries,\n set,\n remove,\n has,\n get,\n apiOwnKeys as ownKeys,\n apiDefineProperty as defineProperty,\n configure,\n onBecomeObserved,\n onBecomeUnobserved,\n flow,\n isFlow,\n flowResult,\n FlowCancellationError,\n isFlowCancellationError,\n toJS,\n trace,\n IObserverTree,\n IDependencyTree,\n getDependencyTree,\n getObserverTree,\n resetGlobalState as _resetGlobalState,\n getGlobalState as _getGlobalState,\n getDebugName,\n getAtom,\n getAdministration as _getAdministration,\n allowStateChanges as _allowStateChanges,\n runInAction as _allowStateChangesInsideComputed, // This has become the default behavior in Mobx 6\n Lambda,\n $mobx,\n isComputingDerivation as _isComputingDerivation,\n onReactionError,\n interceptReads as _interceptReads,\n IComputedValueOptions,\n IActionRunInfo,\n _startAction,\n _endAction,\n allowStateReadsStart as _allowStateReadsStart,\n allowStateReadsEnd as _allowStateReadsEnd,\n makeObservable,\n makeAutoObservable,\n autoAction as _autoAction,\n AnnotationsMap,\n AnnotationMapEntry,\n override\n} from \"./internal\"\n\n// Devtools support\ndeclare const __MOBX_DEVTOOLS_GLOBAL_HOOK__: { injectMobx: (any) => void }\nif (typeof __MOBX_DEVTOOLS_GLOBAL_HOOK__ === \"object\") {\n // See: https://github.com/andykog/mobx-devtools/\n __MOBX_DEVTOOLS_GLOBAL_HOOK__.injectMobx({\n spy,\n extras: {\n getDebugName\n },\n $mobx\n })\n}\n","var __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __commonJS = (cb, mod) => function __require() {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n};\nvar __export = (target, all) => {\n for (var name in all)\n __defProp(target, name, { get: all[name], enumerable: true });\n};\nvar __copyProps = (to, from, except, desc) => {\n if (from && typeof from === \"object\" || typeof from === \"function\") {\n for (let key of __getOwnPropNames(from))\n if (!__hasOwnProp.call(to, key) && key !== except)\n __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });\n }\n return to;\n};\nvar __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(\n // If the importer is in node compatibility mode or this is not an ESM\n // file that has been converted to a CommonJS file using a Babel-\n // compatible transform (i.e. \"__esModule\" has not been set), then set\n // \"default\" to the CommonJS \"module.exports\" for node compatibility.\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: true }) : target,\n mod\n));\n\nexport {\n __commonJS,\n __export,\n __toESM\n};\n//# sourceMappingURL=chunk-KRQZ6V4Y.min.js.map","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Type = exports.JsonType = exports.JavaScriptTypeBuilder = exports.JsonTypeBuilder = exports.TypeBuilder = exports.TypeBuilderError = exports.TransformEncodeBuilder = exports.TransformDecodeBuilder = exports.TemplateLiteralDslParser = exports.TemplateLiteralGenerator = exports.TemplateLiteralGeneratorError = exports.TemplateLiteralFinite = exports.TemplateLiteralFiniteError = exports.TemplateLiteralParser = exports.TemplateLiteralParserError = exports.TemplateLiteralResolver = exports.TemplateLiteralPattern = exports.TemplateLiteralPatternError = exports.UnionResolver = exports.KeyArrayResolver = exports.KeyArrayResolverError = exports.KeyResolver = exports.ObjectMap = exports.Intrinsic = exports.IndexedAccessor = exports.TypeClone = exports.TypeExtends = exports.TypeExtendsResult = exports.TypeExtendsError = exports.ExtendsUndefined = exports.TypeGuard = exports.TypeGuardUnknownTypeError = exports.ValueGuard = exports.FormatRegistry = exports.TypeBoxError = exports.TypeRegistry = exports.PatternStringExact = exports.PatternNumberExact = exports.PatternBooleanExact = exports.PatternString = exports.PatternNumber = exports.PatternBoolean = exports.Kind = exports.Hint = exports.Optional = exports.Readonly = exports.Transform = void 0;\n// --------------------------------------------------------------------------\n// Symbols\n// --------------------------------------------------------------------------\nexports.Transform = Symbol.for('TypeBox.Transform');\nexports.Readonly = Symbol.for('TypeBox.Readonly');\nexports.Optional = Symbol.for('TypeBox.Optional');\nexports.Hint = Symbol.for('TypeBox.Hint');\nexports.Kind = Symbol.for('TypeBox.Kind');\n// --------------------------------------------------------------------------\n// Patterns\n// --------------------------------------------------------------------------\nexports.PatternBoolean = '(true|false)';\nexports.PatternNumber = '(0|[1-9][0-9]*)';\nexports.PatternString = '(.*)';\nexports.PatternBooleanExact = `^${exports.PatternBoolean}$`;\nexports.PatternNumberExact = `^${exports.PatternNumber}$`;\nexports.PatternStringExact = `^${exports.PatternString}$`;\n/** A registry for user defined types */\nvar TypeRegistry;\n(function (TypeRegistry) {\n const map = new Map();\n /** Returns the entries in this registry */\n function Entries() {\n return new Map(map);\n }\n TypeRegistry.Entries = Entries;\n /** Clears all user defined types */\n function Clear() {\n return map.clear();\n }\n TypeRegistry.Clear = Clear;\n /** Deletes a registered type */\n function Delete(kind) {\n return map.delete(kind);\n }\n TypeRegistry.Delete = Delete;\n /** Returns true if this registry contains this kind */\n function Has(kind) {\n return map.has(kind);\n }\n TypeRegistry.Has = Has;\n /** Sets a validation function for a user defined type */\n function Set(kind, func) {\n map.set(kind, func);\n }\n TypeRegistry.Set = Set;\n /** Gets a custom validation function for a user defined type */\n function Get(kind) {\n return map.get(kind);\n }\n TypeRegistry.Get = Get;\n})(TypeRegistry || (exports.TypeRegistry = TypeRegistry = {}));\n// --------------------------------------------------------------------------\n// TypeBoxError\n// --------------------------------------------------------------------------\nclass TypeBoxError extends Error {\n constructor(message) {\n super(message);\n }\n}\nexports.TypeBoxError = TypeBoxError;\n/** A registry for user defined string formats */\nvar FormatRegistry;\n(function (FormatRegistry) {\n const map = new Map();\n /** Returns the entries in this registry */\n function Entries() {\n return new Map(map);\n }\n FormatRegistry.Entries = Entries;\n /** Clears all user defined string formats */\n function Clear() {\n return map.clear();\n }\n FormatRegistry.Clear = Clear;\n /** Deletes a registered format */\n function Delete(format) {\n return map.delete(format);\n }\n FormatRegistry.Delete = Delete;\n /** Returns true if the user defined string format exists */\n function Has(format) {\n return map.has(format);\n }\n FormatRegistry.Has = Has;\n /** Sets a validation function for a user defined string format */\n function Set(format, func) {\n map.set(format, func);\n }\n FormatRegistry.Set = Set;\n /** Gets a validation function for a user defined string format */\n function Get(format) {\n return map.get(format);\n }\n FormatRegistry.Get = Get;\n})(FormatRegistry || (exports.FormatRegistry = FormatRegistry = {}));\n// --------------------------------------------------------------------------\n// ValueGuard\n// --------------------------------------------------------------------------\n/** Provides functions to type guard raw JavaScript values */\nvar ValueGuard;\n(function (ValueGuard) {\n /** Returns true if this value is an array */\n function IsArray(value) {\n return Array.isArray(value);\n }\n ValueGuard.IsArray = IsArray;\n /** Returns true if this value is bigint */\n function IsBigInt(value) {\n return typeof value === 'bigint';\n }\n ValueGuard.IsBigInt = IsBigInt;\n /** Returns true if this value is a boolean */\n function IsBoolean(value) {\n return typeof value === 'boolean';\n }\n ValueGuard.IsBoolean = IsBoolean;\n /** Returns true if this value is a Date object */\n function IsDate(value) {\n return value instanceof globalThis.Date;\n }\n ValueGuard.IsDate = IsDate;\n /** Returns true if this value is null */\n function IsNull(value) {\n return value === null;\n }\n ValueGuard.IsNull = IsNull;\n /** Returns true if this value is number */\n function IsNumber(value) {\n return typeof value === 'number';\n }\n ValueGuard.IsNumber = IsNumber;\n /** Returns true if this value is an object */\n function IsObject(value) {\n return typeof value === 'object' && value !== null;\n }\n ValueGuard.IsObject = IsObject;\n /** Returns true if this value is string */\n function IsString(value) {\n return typeof value === 'string';\n }\n ValueGuard.IsString = IsString;\n /** Returns true if this value is a Uint8Array */\n function IsUint8Array(value) {\n return value instanceof globalThis.Uint8Array;\n }\n ValueGuard.IsUint8Array = IsUint8Array;\n /** Returns true if this value is undefined */\n function IsUndefined(value) {\n return value === undefined;\n }\n ValueGuard.IsUndefined = IsUndefined;\n})(ValueGuard || (exports.ValueGuard = ValueGuard = {}));\n// --------------------------------------------------------------------------\n// TypeGuard\n// --------------------------------------------------------------------------\nclass TypeGuardUnknownTypeError extends TypeBoxError {\n}\nexports.TypeGuardUnknownTypeError = TypeGuardUnknownTypeError;\n/** Provides functions to test if JavaScript values are TypeBox types */\nvar TypeGuard;\n(function (TypeGuard) {\n function IsPattern(value) {\n try {\n new RegExp(value);\n return true;\n }\n catch {\n return false;\n }\n }\n function IsControlCharacterFree(value) {\n if (!ValueGuard.IsString(value))\n return false;\n for (let i = 0; i < value.length; i++) {\n const code = value.charCodeAt(i);\n if ((code >= 7 && code <= 13) || code === 27 || code === 127) {\n return false;\n }\n }\n return true;\n }\n function IsAdditionalProperties(value) {\n return IsOptionalBoolean(value) || TSchema(value);\n }\n function IsOptionalBigInt(value) {\n return ValueGuard.IsUndefined(value) || ValueGuard.IsBigInt(value);\n }\n function IsOptionalNumber(value) {\n return ValueGuard.IsUndefined(value) || ValueGuard.IsNumber(value);\n }\n function IsOptionalBoolean(value) {\n return ValueGuard.IsUndefined(value) || ValueGuard.IsBoolean(value);\n }\n function IsOptionalString(value) {\n return ValueGuard.IsUndefined(value) || ValueGuard.IsString(value);\n }\n function IsOptionalPattern(value) {\n return ValueGuard.IsUndefined(value) || (ValueGuard.IsString(value) && IsControlCharacterFree(value) && IsPattern(value));\n }\n function IsOptionalFormat(value) {\n return ValueGuard.IsUndefined(value) || (ValueGuard.IsString(value) && IsControlCharacterFree(value));\n }\n function IsOptionalSchema(value) {\n return ValueGuard.IsUndefined(value) || TSchema(value);\n }\n // ----------------------------------------------------------------\n // Types\n // ----------------------------------------------------------------\n /** Returns true if the given value is TAny */\n function TAny(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Any') &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TAny = TAny;\n /** Returns true if the given value is TArray */\n function TArray(schema) {\n return (TKindOf(schema, 'Array') &&\n schema.type === 'array' &&\n IsOptionalString(schema.$id) &&\n TSchema(schema.items) &&\n IsOptionalNumber(schema.minItems) &&\n IsOptionalNumber(schema.maxItems) &&\n IsOptionalBoolean(schema.uniqueItems) &&\n IsOptionalSchema(schema.contains) &&\n IsOptionalNumber(schema.minContains) &&\n IsOptionalNumber(schema.maxContains));\n }\n TypeGuard.TArray = TArray;\n /** Returns true if the given value is TAsyncIterator */\n function TAsyncIterator(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'AsyncIterator') &&\n schema.type === 'AsyncIterator' &&\n IsOptionalString(schema.$id) &&\n TSchema(schema.items));\n }\n TypeGuard.TAsyncIterator = TAsyncIterator;\n /** Returns true if the given value is TBigInt */\n function TBigInt(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'BigInt') &&\n schema.type === 'bigint' &&\n IsOptionalString(schema.$id) &&\n IsOptionalBigInt(schema.exclusiveMaximum) &&\n IsOptionalBigInt(schema.exclusiveMinimum) &&\n IsOptionalBigInt(schema.maximum) &&\n IsOptionalBigInt(schema.minimum) &&\n IsOptionalBigInt(schema.multipleOf));\n }\n TypeGuard.TBigInt = TBigInt;\n /** Returns true if the given value is TBoolean */\n function TBoolean(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Boolean') &&\n schema.type === 'boolean' &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TBoolean = TBoolean;\n /** Returns true if the given value is TConstructor */\n function TConstructor(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Constructor') &&\n schema.type === 'Constructor' &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsArray(schema.parameters) &&\n schema.parameters.every(schema => TSchema(schema)) &&\n TSchema(schema.returns));\n }\n TypeGuard.TConstructor = TConstructor;\n /** Returns true if the given value is TDate */\n function TDate(schema) {\n return (TKindOf(schema, 'Date') &&\n schema.type === 'Date' &&\n IsOptionalString(schema.$id) &&\n IsOptionalNumber(schema.exclusiveMaximumTimestamp) &&\n IsOptionalNumber(schema.exclusiveMinimumTimestamp) &&\n IsOptionalNumber(schema.maximumTimestamp) &&\n IsOptionalNumber(schema.minimumTimestamp) &&\n IsOptionalNumber(schema.multipleOfTimestamp));\n }\n TypeGuard.TDate = TDate;\n /** Returns true if the given value is TFunction */\n function TFunction(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Function') &&\n schema.type === 'Function' &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsArray(schema.parameters) &&\n schema.parameters.every(schema => TSchema(schema)) &&\n TSchema(schema.returns));\n }\n TypeGuard.TFunction = TFunction;\n /** Returns true if the given value is TInteger */\n function TInteger(schema) {\n return (TKindOf(schema, 'Integer') &&\n schema.type === 'integer' &&\n IsOptionalString(schema.$id) &&\n IsOptionalNumber(schema.exclusiveMaximum) &&\n IsOptionalNumber(schema.exclusiveMinimum) &&\n IsOptionalNumber(schema.maximum) &&\n IsOptionalNumber(schema.minimum) &&\n IsOptionalNumber(schema.multipleOf));\n }\n TypeGuard.TInteger = TInteger;\n /** Returns true if the given value is TIntersect */\n function TIntersect(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Intersect') &&\n (ValueGuard.IsString(schema.type) && schema.type !== 'object' ? false : true) &&\n ValueGuard.IsArray(schema.allOf) &&\n schema.allOf.every(schema => TSchema(schema) && !TTransform(schema)) &&\n IsOptionalString(schema.type) &&\n (IsOptionalBoolean(schema.unevaluatedProperties) || IsOptionalSchema(schema.unevaluatedProperties)) &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TIntersect = TIntersect;\n /** Returns true if the given value is TIterator */\n function TIterator(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Iterator') &&\n schema.type === 'Iterator' &&\n IsOptionalString(schema.$id) &&\n TSchema(schema.items));\n }\n TypeGuard.TIterator = TIterator;\n /** Returns true if the given value is a TKind with the given name. */\n function TKindOf(schema, kind) {\n return TKind(schema) && schema[exports.Kind] === kind;\n }\n TypeGuard.TKindOf = TKindOf;\n /** Returns true if the given value is TKind */\n function TKind(schema) {\n return ValueGuard.IsObject(schema) && exports.Kind in schema && ValueGuard.IsString(schema[exports.Kind]);\n }\n TypeGuard.TKind = TKind;\n /** Returns true if the given value is TLiteral<string> */\n function TLiteralString(schema) {\n return TLiteral(schema) && ValueGuard.IsString(schema.const);\n }\n TypeGuard.TLiteralString = TLiteralString;\n /** Returns true if the given value is TLiteral<number> */\n function TLiteralNumber(schema) {\n return TLiteral(schema) && ValueGuard.IsNumber(schema.const);\n }\n TypeGuard.TLiteralNumber = TLiteralNumber;\n /** Returns true if the given value is TLiteral<boolean> */\n function TLiteralBoolean(schema) {\n return TLiteral(schema) && ValueGuard.IsBoolean(schema.const);\n }\n TypeGuard.TLiteralBoolean = TLiteralBoolean;\n /** Returns true if the given value is TLiteral */\n function TLiteral(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Literal') &&\n IsOptionalString(schema.$id) && (ValueGuard.IsBoolean(schema.const) ||\n ValueGuard.IsNumber(schema.const) ||\n ValueGuard.IsString(schema.const)));\n }\n TypeGuard.TLiteral = TLiteral;\n /** Returns true if the given value is TNever */\n function TNever(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Never') &&\n ValueGuard.IsObject(schema.not) &&\n Object.getOwnPropertyNames(schema.not).length === 0);\n }\n TypeGuard.TNever = TNever;\n /** Returns true if the given value is TNot */\n function TNot(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Not') &&\n TSchema(schema.not));\n }\n TypeGuard.TNot = TNot;\n /** Returns true if the given value is TNull */\n function TNull(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Null') &&\n schema.type === 'null' &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TNull = TNull;\n /** Returns true if the given value is TNumber */\n function TNumber(schema) {\n return (TKindOf(schema, 'Number') &&\n schema.type === 'number' &&\n IsOptionalString(schema.$id) &&\n IsOptionalNumber(schema.exclusiveMaximum) &&\n IsOptionalNumber(schema.exclusiveMinimum) &&\n IsOptionalNumber(schema.maximum) &&\n IsOptionalNumber(schema.minimum) &&\n IsOptionalNumber(schema.multipleOf));\n }\n TypeGuard.TNumber = TNumber;\n /** Returns true if the given value is TObject */\n function TObject(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Object') &&\n schema.type === 'object' &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsObject(schema.properties) &&\n IsAdditionalProperties(schema.additionalProperties) &&\n IsOptionalNumber(schema.minProperties) &&\n IsOptionalNumber(schema.maxProperties) &&\n Object.entries(schema.properties).every(([key, schema]) => IsControlCharacterFree(key) && TSchema(schema)));\n }\n TypeGuard.TObject = TObject;\n /** Returns true if the given value is TPromise */\n function TPromise(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Promise') &&\n schema.type === 'Promise' &&\n IsOptionalString(schema.$id) &&\n TSchema(schema.item));\n }\n TypeGuard.TPromise = TPromise;\n /** Returns true if the given value is TRecord */\n function TRecord(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Record') &&\n schema.type === 'object' &&\n IsOptionalString(schema.$id) &&\n IsAdditionalProperties(schema.additionalProperties) &&\n ValueGuard.IsObject(schema.patternProperties) &&\n ((schema) => {\n const keys = Object.getOwnPropertyNames(schema.patternProperties);\n return (keys.length === 1 &&\n IsPattern(keys[0]) &&\n ValueGuard.IsObject(schema.patternProperties) &&\n TSchema(schema.patternProperties[keys[0]]));\n })(schema));\n }\n TypeGuard.TRecord = TRecord;\n /** Returns true if this value is TRecursive */\n function TRecursive(schema) {\n return ValueGuard.IsObject(schema) && exports.Hint in schema && schema[exports.Hint] === 'Recursive';\n }\n TypeGuard.TRecursive = TRecursive;\n /** Returns true if the given value is TRef */\n function TRef(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Ref') &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsString(schema.$ref));\n }\n TypeGuard.TRef = TRef;\n /** Returns true if the given value is TString */\n function TString(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'String') &&\n schema.type === 'string' &&\n IsOptionalString(schema.$id) &&\n IsOptionalNumber(schema.minLength) &&\n IsOptionalNumber(schema.maxLength) &&\n IsOptionalPattern(schema.pattern) &&\n IsOptionalFormat(schema.format));\n }\n TypeGuard.TString = TString;\n /** Returns true if the given value is TSymbol */\n function TSymbol(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Symbol') &&\n schema.type === 'symbol' &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TSymbol = TSymbol;\n /** Returns true if the given value is TTemplateLiteral */\n function TTemplateLiteral(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'TemplateLiteral') &&\n schema.type === 'string' &&\n ValueGuard.IsString(schema.pattern) &&\n schema.pattern[0] === '^' &&\n schema.pattern[schema.pattern.length - 1] === '$');\n }\n TypeGuard.TTemplateLiteral = TTemplateLiteral;\n /** Returns true if the given value is TThis */\n function TThis(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'This') &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsString(schema.$ref));\n }\n TypeGuard.TThis = TThis;\n /** Returns true of this value is TTransform */\n function TTransform(schema) {\n return ValueGuard.IsObject(schema) && exports.Transform in schema;\n }\n TypeGuard.TTransform = TTransform;\n /** Returns true if the given value is TTuple */\n function TTuple(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Tuple') &&\n schema.type === 'array' &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsNumber(schema.minItems) &&\n ValueGuard.IsNumber(schema.maxItems) &&\n schema.minItems === schema.maxItems &&\n (( // empty\n ValueGuard.IsUndefined(schema.items) &&\n ValueGuard.IsUndefined(schema.additionalItems) &&\n schema.minItems === 0) || (ValueGuard.IsArray(schema.items) &&\n schema.items.every(schema => TSchema(schema)))));\n }\n TypeGuard.TTuple = TTuple;\n /** Returns true if the given value is TUndefined */\n function TUndefined(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Undefined') &&\n schema.type === 'undefined' &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TUndefined = TUndefined;\n /** Returns true if the given value is TUnion<Literal<string | number>[]> */\n function TUnionLiteral(schema) {\n return TUnion(schema) && schema.anyOf.every((schema) => TLiteralString(schema) || TLiteralNumber(schema));\n }\n TypeGuard.TUnionLiteral = TUnionLiteral;\n /** Returns true if the given value is TUnion */\n function TUnion(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Union') &&\n IsOptionalString(schema.$id) &&\n ValueGuard.IsObject(schema) &&\n ValueGuard.IsArray(schema.anyOf) &&\n schema.anyOf.every(schema => TSchema(schema)));\n }\n TypeGuard.TUnion = TUnion;\n /** Returns true if the given value is TUint8Array */\n function TUint8Array(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Uint8Array') &&\n schema.type === 'Uint8Array' &&\n IsOptionalString(schema.$id) &&\n IsOptionalNumber(schema.minByteLength) &&\n IsOptionalNumber(schema.maxByteLength));\n }\n TypeGuard.TUint8Array = TUint8Array;\n /** Returns true if the given value is TUnknown */\n function TUnknown(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Unknown') &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TUnknown = TUnknown;\n /** Returns true if the given value is a raw TUnsafe */\n function TUnsafe(schema) {\n return TKindOf(schema, 'Unsafe');\n }\n TypeGuard.TUnsafe = TUnsafe;\n /** Returns true if the given value is TVoid */\n function TVoid(schema) {\n // prettier-ignore\n return (TKindOf(schema, 'Void') &&\n schema.type === 'void' &&\n IsOptionalString(schema.$id));\n }\n TypeGuard.TVoid = TVoid;\n /** Returns true if this value has a Readonly symbol */\n function TReadonly(schema) {\n return ValueGuard.IsObject(schema) && schema[exports.Readonly] === 'Readonly';\n }\n TypeGuard.TReadonly = TReadonly;\n /** Returns true if this value has a Optional symbol */\n function TOptional(schema) {\n return ValueGuard.IsObject(schema) && schema[exports.Optional] === 'Optional';\n }\n TypeGuard.TOptional = TOptional;\n /** Returns true if the given value is TSchema */\n function TSchema(schema) {\n // prettier-ignore\n return (ValueGuard.IsObject(schema)) && (TAny(schema) ||\n TArray(schema) ||\n TBoolean(schema) ||\n TBigInt(schema) ||\n TAsyncIterator(schema) ||\n TConstructor(schema) ||\n TDate(schema) ||\n TFunction(schema) ||\n TInteger(schema) ||\n TIntersect(schema) ||\n TIterator(schema) ||\n TLiteral(schema) ||\n TNever(schema) ||\n TNot(schema) ||\n TNull(schema) ||\n TNumber(schema) ||\n TObject(schema) ||\n TPromise(schema) ||\n TRecord(schema) ||\n TRef(schema) ||\n TString(schema) ||\n TSymbol(schema) ||\n TTemplateLiteral(schema) ||\n TThis(schema) ||\n TTuple(schema) ||\n TUndefined(schema) ||\n TUnion(schema) ||\n TUint8Array(schema) ||\n TUnknown(schema) ||\n TUnsafe(schema) ||\n TVoid(schema) ||\n (TKind(schema) && TypeRegistry.Has(schema[exports.Kind])));\n }\n TypeGuard.TSchema = TSchema;\n})(TypeGuard || (exports.TypeGuard = TypeGuard = {}));\n// --------------------------------------------------------------------------\n// ExtendsUndefined\n// --------------------------------------------------------------------------\n/** Fast undefined check used for properties of type undefined */\nvar ExtendsUndefined;\n(function (ExtendsUndefined) {\n function Check(schema) {\n return schema[exports.Kind] === 'Intersect'\n ? schema.allOf.every((schema) => Check(schema))\n : schema[exports.Kind] === 'Union'\n ? schema.anyOf.some((schema) => Check(schema))\n : schema[exports.Kind] === 'Undefined'\n ? true\n : schema[exports.Kind] === 'Not'\n ? !Check(schema.not)\n : false;\n }\n ExtendsUndefined.Check = Check;\n})(ExtendsUndefined || (exports.ExtendsUndefined = ExtendsUndefined = {}));\n// --------------------------------------------------------------------------\n// TypeExtends\n// --------------------------------------------------------------------------\nclass TypeExtendsError extends TypeBoxError {\n}\nexports.TypeExtendsError = TypeExtendsError;\nvar TypeExtendsResult;\n(function (TypeExtendsResult) {\n TypeExtendsResult[TypeExtendsResult[\"Union\"] = 0] = \"Union\";\n TypeExtendsResult[TypeExtendsResult[\"True\"] = 1] = \"True\";\n TypeExtendsResult[TypeExtendsResult[\"False\"] = 2] = \"False\";\n})(TypeExtendsResult || (exports.TypeExtendsResult = TypeExtendsResult = {}));\nvar TypeExtends;\n(function (TypeExtends) {\n // --------------------------------------------------------------------------\n // IntoBooleanResult\n // --------------------------------------------------------------------------\n function IntoBooleanResult(result) {\n return result === TypeExtendsResult.False ? result : TypeExtendsResult.True;\n }\n // --------------------------------------------------------------------------\n // Throw\n // --------------------------------------------------------------------------\n function Throw(message) {\n throw new TypeExtendsError(message);\n }\n // --------------------------------------------------------------------------\n // StructuralRight\n // --------------------------------------------------------------------------\n function IsStructuralRight(right) {\n // prettier-ignore\n return (TypeGuard.TNever(right) ||\n TypeGuard.TIntersect(right) ||\n TypeGuard.TUnion(right) ||\n TypeGuard.TUnknown(right) ||\n TypeGuard.TAny(right));\n }\n function StructuralRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TNever(right) ? TNeverRight(left, right) :\n TypeGuard.TIntersect(right) ? TIntersectRight(left, right) :\n TypeGuard.TUnion(right) ? TUnionRight(left, right) :\n TypeGuard.TUnknown(right) ? TUnknownRight(left, right) :\n TypeGuard.TAny(right) ? TAnyRight(left, right) :\n Throw('StructuralRight'));\n }\n // --------------------------------------------------------------------------\n // Any\n // --------------------------------------------------------------------------\n function TAnyRight(left, right) {\n return TypeExtendsResult.True;\n }\n function TAny(left, right) {\n // prettier-ignore\n return (TypeGuard.TIntersect(right) ? TIntersectRight(left, right) :\n (TypeGuard.TUnion(right) && right.anyOf.some((schema) => TypeGuard.TAny(schema) || TypeGuard.TUnknown(schema))) ? TypeExtendsResult.True :\n TypeGuard.TUnion(right) ? TypeExtendsResult.Union :\n TypeGuard.TUnknown(right) ? TypeExtendsResult.True :\n TypeGuard.TAny(right) ? TypeExtendsResult.True :\n TypeExtendsResult.Union);\n }\n // --------------------------------------------------------------------------\n // Array\n // --------------------------------------------------------------------------\n function TArrayRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TUnknown(left) ? TypeExtendsResult.False :\n TypeGuard.TAny(left) ? TypeExtendsResult.Union :\n TypeGuard.TNever(left) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n function TArray(left, right) {\n // prettier-ignore\n return (TypeGuard.TObject(right) && IsObjectArrayLike(right) ? TypeExtendsResult.True :\n IsStructuralRight(right) ? StructuralRight(left, right) :\n !TypeGuard.TArray(right) ? TypeExtendsResult.False :\n IntoBooleanResult(Visit(left.items, right.items)));\n }\n // --------------------------------------------------------------------------\n // AsyncIterator\n // --------------------------------------------------------------------------\n function TAsyncIterator(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n !TypeGuard.TAsyncIterator(right) ? TypeExtendsResult.False :\n IntoBooleanResult(Visit(left.items, right.items)));\n }\n // --------------------------------------------------------------------------\n // BigInt\n // --------------------------------------------------------------------------\n function TBigInt(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TBigInt(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Boolean\n // --------------------------------------------------------------------------\n function TBooleanRight(left, right) {\n return TypeGuard.TLiteral(left) && ValueGuard.IsBoolean(left.const) ? TypeExtendsResult.True : TypeGuard.TBoolean(left) ? TypeExtendsResult.True : TypeExtendsResult.False;\n }\n function TBoolean(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TBoolean(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Constructor\n // --------------------------------------------------------------------------\n function TConstructor(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n !TypeGuard.TConstructor(right) ? TypeExtendsResult.False :\n left.parameters.length > right.parameters.length ? TypeExtendsResult.False :\n (!left.parameters.every((schema, index) => IntoBooleanResult(Visit(right.parameters[index], schema)) === TypeExtendsResult.True)) ? TypeExtendsResult.False :\n IntoBooleanResult(Visit(left.returns, right.returns)));\n }\n // --------------------------------------------------------------------------\n // Date\n // --------------------------------------------------------------------------\n function TDate(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TDate(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Function\n // --------------------------------------------------------------------------\n function TFunction(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n !TypeGuard.TFunction(right) ? TypeExtendsResult.False :\n left.parameters.length > right.parameters.length ? TypeExtendsResult.False :\n (!left.parameters.every((schema, index) => IntoBooleanResult(Visit(right.parameters[index], schema)) === TypeExtendsResult.True)) ? TypeExtendsResult.False :\n IntoBooleanResult(Visit(left.returns, right.returns)));\n }\n // --------------------------------------------------------------------------\n // Integer\n // --------------------------------------------------------------------------\n function TIntegerRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TLiteral(left) && ValueGuard.IsNumber(left.const) ? TypeExtendsResult.True :\n TypeGuard.TNumber(left) || TypeGuard.TInteger(left) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n function TInteger(left, right) {\n // prettier-ignore\n return (TypeGuard.TInteger(right) || TypeGuard.TNumber(right) ? TypeExtendsResult.True :\n IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Intersect\n // --------------------------------------------------------------------------\n function TIntersectRight(left, right) {\n // prettier-ignore\n return right.allOf.every((schema) => Visit(left, schema) === TypeExtendsResult.True)\n ? TypeExtendsResult.True\n : TypeExtendsResult.False;\n }\n function TIntersect(left, right) {\n // prettier-ignore\n return left.allOf.some((schema) => Visit(schema, right) === TypeExtendsResult.True)\n ? TypeExtendsResult.True\n : TypeExtendsResult.False;\n }\n // --------------------------------------------------------------------------\n // Iterator\n // --------------------------------------------------------------------------\n function TIterator(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n !TypeGuard.TIterator(right) ? TypeExtendsResult.False :\n IntoBooleanResult(Visit(left.items, right.items)));\n }\n // --------------------------------------------------------------------------\n // Literal\n // --------------------------------------------------------------------------\n function TLiteral(left, right) {\n // prettier-ignore\n return (TypeGuard.TLiteral(right) && right.const === left.const ? TypeExtendsResult.True :\n IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TString(right) ? TStringRight(left, right) :\n TypeGuard.TNumber(right) ? TNumberRight(left, right) :\n TypeGuard.TInteger(right) ? TIntegerRight(left, right) :\n TypeGuard.TBoolean(right) ? TBooleanRight(left, right) :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Never\n // --------------------------------------------------------------------------\n function TNeverRight(left, right) {\n return TypeExtendsResult.False;\n }\n function TNever(left, right) {\n return TypeExtendsResult.True;\n }\n // --------------------------------------------------------------------------\n // Not\n // --------------------------------------------------------------------------\n function UnwrapTNot(schema) {\n let [current, depth] = [schema, 0];\n while (true) {\n if (!TypeGuard.TNot(current))\n break;\n current = current.not;\n depth += 1;\n }\n return depth % 2 === 0 ? current : exports.Type.Unknown();\n }\n function TNot(left, right) {\n // TypeScript has no concept of negated types, and attempts to correctly check the negated\n // type at runtime would put TypeBox at odds with TypeScripts ability to statically infer\n // the type. Instead we unwrap to either unknown or T and continue evaluating.\n // prettier-ignore\n return (TypeGuard.TNot(left) ? Visit(UnwrapTNot(left), right) :\n TypeGuard.TNot(right) ? Visit(left, UnwrapTNot(right)) :\n Throw('Invalid fallthrough for Not'));\n }\n // --------------------------------------------------------------------------\n // Null\n // --------------------------------------------------------------------------\n function TNull(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TNull(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Number\n // --------------------------------------------------------------------------\n function TNumberRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TLiteralNumber(left) ? TypeExtendsResult.True :\n TypeGuard.TNumber(left) || TypeGuard.TInteger(left) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n function TNumber(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TInteger(right) || TypeGuard.TNumber(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Object\n // --------------------------------------------------------------------------\n function IsObjectPropertyCount(schema, count) {\n return Object.getOwnPropertyNames(schema.properties).length === count;\n }\n function IsObjectStringLike(schema) {\n return IsObjectArrayLike(schema);\n }\n function IsObjectSymbolLike(schema) {\n // prettier-ignore\n return IsObjectPropertyCount(schema, 0) || (IsObjectPropertyCount(schema, 1) && 'description' in schema.properties && TypeGuard.TUnion(schema.properties.description) && schema.properties.description.anyOf.length === 2 && ((TypeGuard.TString(schema.properties.description.anyOf[0]) &&\n TypeGuard.TUndefined(schema.properties.description.anyOf[1])) || (TypeGuard.TString(schema.properties.description.anyOf[1]) &&\n TypeGuard.TUndefined(schema.properties.description.anyOf[0]))));\n }\n function IsObjectNumberLike(schema) {\n return IsObjectPropertyCount(schema, 0);\n }\n function IsObjectBooleanLike(schema) {\n return IsObjectPropertyCount(schema, 0);\n }\n function IsObjectBigIntLike(schema) {\n return IsObjectPropertyCount(schema, 0);\n }\n function IsObjectDateLike(schema) {\n return IsObjectPropertyCount(schema, 0);\n }\n function IsObjectUint8ArrayLike(schema) {\n return IsObjectArrayLike(schema);\n }\n function IsObjectFunctionLike(schema) {\n const length = exports.Type.Number();\n return IsObjectPropertyCount(schema, 0) || (IsObjectPropertyCount(schema, 1) && 'length' in schema.properties && IntoBooleanResult(Visit(schema.properties['length'], length)) === TypeExtendsResult.True);\n }\n function IsObjectConstructorLike(schema) {\n return IsObjectPropertyCount(schema, 0);\n }\n function IsObjectArrayLike(schema) {\n const length = exports.Type.Number();\n return IsObjectPropertyCount(schema, 0) || (IsObjectPropertyCount(schema, 1) && 'length' in schema.properties && IntoBooleanResult(Visit(schema.properties['length'], length)) === TypeExtendsResult.True);\n }\n function IsObjectPromiseLike(schema) {\n const then = exports.Type.Function([exports.Type.Any()], exports.Type.Any());\n return IsObjectPropertyCount(schema, 0) || (IsObjectPropertyCount(schema, 1) && 'then' in schema.properties && IntoBooleanResult(Visit(schema.properties['then'], then)) === TypeExtendsResult.True);\n }\n // --------------------------------------------------------------------------\n // Property\n // --------------------------------------------------------------------------\n function Property(left, right) {\n // prettier-ignore\n return (Visit(left, right) === TypeExtendsResult.False ? TypeExtendsResult.False :\n TypeGuard.TOptional(left) && !TypeGuard.TOptional(right) ? TypeExtendsResult.False :\n TypeExtendsResult.True);\n }\n function TObjectRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TUnknown(left) ? TypeExtendsResult.False :\n TypeGuard.TAny(left) ? TypeExtendsResult.Union : (TypeGuard.TNever(left) ||\n (TypeGuard.TLiteralString(left) && IsObjectStringLike(right)) ||\n (TypeGuard.TLiteralNumber(left) && IsObjectNumberLike(right)) ||\n (TypeGuard.TLiteralBoolean(left) && IsObjectBooleanLike(right)) ||\n (TypeGuard.TSymbol(left) && IsObjectSymbolLike(right)) ||\n (TypeGuard.TBigInt(left) && IsObjectBigIntLike(right)) ||\n (TypeGuard.TString(left) && IsObjectStringLike(right)) ||\n (TypeGuard.TSymbol(left) && IsObjectSymbolLike(right)) ||\n (TypeGuard.TNumber(left) && IsObjectNumberLike(right)) ||\n (TypeGuard.TInteger(left) && IsObjectNumberLike(right)) ||\n (TypeGuard.TBoolean(left) && IsObjectBooleanLike(right)) ||\n (TypeGuard.TUint8Array(left) && IsObjectUint8ArrayLike(right)) ||\n (TypeGuard.TDate(left) && IsObjectDateLike(right)) ||\n (TypeGuard.TConstructor(left) && IsObjectConstructorLike(right)) ||\n (TypeGuard.TFunction(left) && IsObjectFunctionLike(right))) ? TypeExtendsResult.True :\n (TypeGuard.TRecord(left) && TypeGuard.TString(RecordKey(left))) ? (() => {\n // When expressing a Record with literal key values, the Record is converted into a Object with\n // the Hint assigned as `Record`. This is used to invert the extends logic.\n return right[exports.Hint] === 'Record' ? TypeExtendsResult.True : TypeExtendsResult.False;\n })() :\n (TypeGuard.TRecord(left) && TypeGuard.TNumber(RecordKey(left))) ? (() => {\n return IsObjectPropertyCount(right, 0)\n ? TypeExtendsResult.True\n : TypeExtendsResult.False;\n })() :\n TypeExtendsResult.False);\n }\n function TObject(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n !TypeGuard.TObject(right) ? TypeExtendsResult.False :\n (() => {\n for (const key of Object.getOwnPropertyNames(right.properties)) {\n if (!(key in left.properties) && !TypeGuard.TOptional(right.properties[key])) {\n return TypeExtendsResult.False;\n }\n if (TypeGuard.TOptional(right.properties[key])) {\n return TypeExtendsResult.True;\n }\n if (Property(left.properties[key], right.properties[key]) === TypeExtendsResult.False) {\n return TypeExtendsResult.False;\n }\n }\n return TypeExtendsResult.True;\n })());\n }\n // --------------------------------------------------------------------------\n // Promise\n // --------------------------------------------------------------------------\n function TPromise(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) && IsObjectPromiseLike(right) ? TypeExtendsResult.True :\n !TypeGuard.TPromise(right) ? TypeExtendsResult.False :\n IntoBooleanResult(Visit(left.item, right.item)));\n }\n // --------------------------------------------------------------------------\n // Record\n // --------------------------------------------------------------------------\n function RecordKey(schema) {\n // prettier-ignore\n return (exports.PatternNumberExact in schema.patternProperties ? exports.Type.Number() :\n exports.PatternStringExact in schema.patternProperties ? exports.Type.String() :\n Throw('Unknown record key pattern'));\n }\n function RecordValue(schema) {\n // prettier-ignore\n return (exports.PatternNumberExact in schema.patternProperties ? schema.patternProperties[exports.PatternNumberExact] :\n exports.PatternStringExact in schema.patternProperties ? schema.patternProperties[exports.PatternStringExact] :\n Throw('Unable to get record value schema'));\n }\n function TRecordRight(left, right) {\n const [Key, Value] = [RecordKey(right), RecordValue(right)];\n // prettier-ignore\n return ((TypeGuard.TLiteralString(left) && TypeGuard.TNumber(Key) && IntoBooleanResult(Visit(left, Value)) === TypeExtendsResult.True) ? TypeExtendsResult.True :\n TypeGuard.TUint8Array(left) && TypeGuard.TNumber(Key) ? Visit(left, Value) :\n TypeGuard.TString(left) && TypeGuard.TNumber(Key) ? Visit(left, Value) :\n TypeGuard.TArray(left) && TypeGuard.TNumber(Key) ? Visit(left, Value) :\n TypeGuard.TObject(left) ? (() => {\n for (const key of Object.getOwnPropertyNames(left.properties)) {\n if (Property(Value, left.properties[key]) === TypeExtendsResult.False) {\n return TypeExtendsResult.False;\n }\n }\n return TypeExtendsResult.True;\n })() :\n TypeExtendsResult.False);\n }\n function TRecord(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n !TypeGuard.TRecord(right) ? TypeExtendsResult.False :\n Visit(RecordValue(left), RecordValue(right)));\n }\n // --------------------------------------------------------------------------\n // String\n // --------------------------------------------------------------------------\n function TStringRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TLiteral(left) && ValueGuard.IsString(left.const) ? TypeExtendsResult.True :\n TypeGuard.TString(left) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n function TString(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TString(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Symbol\n // --------------------------------------------------------------------------\n function TSymbol(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TSymbol(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // TemplateLiteral\n // --------------------------------------------------------------------------\n function TTemplateLiteral(left, right) {\n // TemplateLiteral types are resolved to either unions for finite expressions or string\n // for infinite expressions. Here we call to TemplateLiteralResolver to resolve for\n // either type and continue evaluating.\n // prettier-ignore\n return (TypeGuard.TTemplateLiteral(left) ? Visit(TemplateLiteralResolver.Resolve(left), right) :\n TypeGuard.TTemplateLiteral(right) ? Visit(left, TemplateLiteralResolver.Resolve(right)) :\n Throw('Invalid fallthrough for TemplateLiteral'));\n }\n // --------------------------------------------------------------------------\n // Tuple\n // --------------------------------------------------------------------------\n function IsArrayOfTuple(left, right) {\n // prettier-ignore\n return (TypeGuard.TArray(right) &&\n left.items !== undefined &&\n left.items.every((schema) => Visit(schema, right.items) === TypeExtendsResult.True));\n }\n function TTupleRight(left, right) {\n // prettier-ignore\n return (TypeGuard.TNever(left) ? TypeExtendsResult.True :\n TypeGuard.TUnknown(left) ? TypeExtendsResult.False :\n TypeGuard.TAny(left) ? TypeExtendsResult.Union :\n TypeExtendsResult.False);\n }\n function TTuple(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) && IsObjectArrayLike(right) ? TypeExtendsResult.True :\n TypeGuard.TArray(right) && IsArrayOfTuple(left, right) ? TypeExtendsResult.True :\n !TypeGuard.TTuple(right) ? TypeExtendsResult.False :\n (ValueGuard.IsUndefined(left.items) && !ValueGuard.IsUndefined(right.items)) || (!ValueGuard.IsUndefined(left.items) && ValueGuard.IsUndefined(right.items)) ? TypeExtendsResult.False :\n (ValueGuard.IsUndefined(left.items) && !ValueGuard.IsUndefined(right.items)) ? TypeExtendsResult.True :\n left.items.every((schema, index) => Visit(schema, right.items[index]) === TypeExtendsResult.True) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Uint8Array\n // --------------------------------------------------------------------------\n function TUint8Array(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TUint8Array(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Undefined\n // --------------------------------------------------------------------------\n function TUndefined(left, right) {\n // prettier-ignore\n return (IsStructuralRight(right) ? StructuralRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TRecord(right) ? TRecordRight(left, right) :\n TypeGuard.TVoid(right) ? VoidRight(left, right) :\n TypeGuard.TUndefined(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Union\n // --------------------------------------------------------------------------\n function TUnionRight(left, right) {\n // prettier-ignore\n return right.anyOf.some((schema) => Visit(left, schema) === TypeExtendsResult.True)\n ? TypeExtendsResult.True\n : TypeExtendsResult.False;\n }\n function TUnion(left, right) {\n // prettier-ignore\n return left.anyOf.every((schema) => Visit(schema, right) === TypeExtendsResult.True)\n ? TypeExtendsResult.True\n : TypeExtendsResult.False;\n }\n // --------------------------------------------------------------------------\n // Unknown\n // --------------------------------------------------------------------------\n function TUnknownRight(left, right) {\n return TypeExtendsResult.True;\n }\n function TUnknown(left, right) {\n // prettier-ignore\n return (TypeGuard.TNever(right) ? TNeverRight(left, right) :\n TypeGuard.TIntersect(right) ? TIntersectRight(left, right) :\n TypeGuard.TUnion(right) ? TUnionRight(left, right) :\n TypeGuard.TAny(right) ? TAnyRight(left, right) :\n TypeGuard.TString(right) ? TStringRight(left, right) :\n TypeGuard.TNumber(right) ? TNumberRight(left, right) :\n TypeGuard.TInteger(right) ? TIntegerRight(left, right) :\n TypeGuard.TBoolean(right) ? TBooleanRight(left, right) :\n TypeGuard.TArray(right) ? TArrayRight(left, right) :\n TypeGuard.TTuple(right) ? TTupleRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TUnknown(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False);\n }\n // --------------------------------------------------------------------------\n // Void\n // --------------------------------------------------------------------------\n function VoidRight(left, right) {\n // prettier-ignore\n return TypeGuard.TUndefined(left) ? TypeExtendsResult.True :\n TypeGuard.TUndefined(left) ? TypeExtendsResult.True :\n TypeExtendsResult.False;\n }\n function TVoid(left, right) {\n // prettier-ignore\n return TypeGuard.TIntersect(right) ? TIntersectRight(left, right) :\n TypeGuard.TUnion(right) ? TUnionRight(left, right) :\n TypeGuard.TUnknown(right) ? TUnknownRight(left, right) :\n TypeGuard.TAny(right) ? TAnyRight(left, right) :\n TypeGuard.TObject(right) ? TObjectRight(left, right) :\n TypeGuard.TVoid(right) ? TypeExtendsResult.True :\n TypeExtendsResult.False;\n }\n function Visit(left, right) {\n // prettier-ignore\n return (\n // resolvable\n (TypeGuard.TTemplateLiteral(left) || TypeGuard.TTemplateLiteral(right)) ? TTemplateLiteral(left, right) :\n (TypeGuard.TNot(left) || TypeGuard.TNot(right)) ? TNot(left, right) :\n // standard\n TypeGuard.TAny(left) ? TAny(left, right) :\n TypeGuard.TArray(left) ? TArray(left, right) :\n TypeGuard.TBigInt(left) ? TBigInt(left, right) :\n TypeGuard.TBoolean(left) ? TBoolean(left, right) :\n TypeGuard.TAsyncIterator(left) ? TAsyncIterator(left, right) :\n TypeGuard.TConstructor(left) ? TConstructor(left, right) :\n TypeGuard.TDate(left) ? TDate(left, right) :\n TypeGuard.TFunction(left) ? TFunction(left, right) :\n TypeGuard.TInteger(left) ? TInteger(left, right) :\n TypeGuard.TIntersect(left) ? TIntersect(left, right) :\n TypeGuard.TIterator(left) ? TIterator(left, right) :\n TypeGuard.TLiteral(left) ? TLiteral(left, right) :\n TypeGuard.TNever(left) ? TNever(left, right) :\n TypeGuard.TNull(left) ? TNull(left, right) :\n TypeGuard.TNumber(left) ? TNumber(left, right) :\n TypeGuard.TObject(left) ? TObject(left, right) :\n TypeGuard.TRecord(left) ? TRecord(left, right) :\n TypeGuard.TString(left) ? TString(left, right) :\n TypeGuard.TSymbol(left) ? TSymbol(left, right) :\n TypeGuard.TTuple(left) ? TTuple(left, right) :\n TypeGuard.TPromise(left) ? TPromise(left, right) :\n TypeGuard.TUint8Array(left) ? TUint8Array(left, right) :\n TypeGuard.TUndefined(left) ? TUndefined(left, right) :\n TypeGuard.TUnion(left) ? TUnion(left, right) :\n TypeGuard.TUnknown(left) ? TUnknown(left, right) :\n TypeGuard.TVoid(left) ? TVoid(left, right) :\n Throw(`Unknown left type operand '${left[exports.Kind]}'`));\n }\n function Extends(left, right) {\n return Visit(left, right);\n }\n TypeExtends.Extends = Extends;\n})(TypeExtends || (exports.TypeExtends = TypeExtends = {}));\n// --------------------------------------------------------------------------\n// TypeClone\n// --------------------------------------------------------------------------\n/** Specialized Clone for Types */\nvar TypeClone;\n(function (TypeClone) {\n function ArrayType(value) {\n return value.map((value) => Visit(value));\n }\n function DateType(value) {\n return new Date(value.getTime());\n }\n function Uint8ArrayType(value) {\n return new Uint8Array(value);\n }\n function ObjectType(value) {\n const clonedProperties = Object.getOwnPropertyNames(value).reduce((acc, key) => ({ ...acc, [key]: Visit(value[key]) }), {});\n const clonedSymbols = Object.getOwnPropertySymbols(value).reduce((acc, key) => ({ ...acc, [key]: Visit(value[key]) }), {});\n return { ...clonedProperties, ...clonedSymbols };\n }\n function Visit(value) {\n // prettier-ignore\n return (ValueGuard.IsArray(value) ? ArrayType(value) :\n ValueGuard.IsDate(value) ? DateType(value) :\n ValueGuard.IsUint8Array(value) ? Uint8ArrayType(value) :\n ValueGuard.IsObject(value) ? ObjectType(value) :\n value);\n }\n /** Clones a Rest */\n function Rest(schemas) {\n return schemas.map((schema) => Type(schema));\n }\n TypeClone.Rest = Rest;\n /** Clones a Type */\n function Type(schema, options = {}) {\n return { ...Visit(schema), ...options };\n }\n TypeClone.Type = Type;\n})(TypeClone || (exports.TypeClone = TypeClone = {}));\n// --------------------------------------------------------------------------\n// IndexedAccessor\n// --------------------------------------------------------------------------\nvar IndexedAccessor;\n(function (IndexedAccessor) {\n function OptionalUnwrap(schema) {\n return schema.map((schema) => {\n const { [exports.Optional]: _, ...clone } = TypeClone.Type(schema);\n return clone;\n });\n }\n function IsIntersectOptional(schema) {\n return schema.every((schema) => TypeGuard.TOptional(schema));\n }\n function IsUnionOptional(schema) {\n return schema.some((schema) => TypeGuard.TOptional(schema));\n }\n function ResolveIntersect(schema) {\n return IsIntersectOptional(schema.allOf) ? exports.Type.Optional(exports.Type.Intersect(OptionalUnwrap(schema.allOf))) : schema;\n }\n function ResolveUnion(schema) {\n return IsUnionOptional(schema.anyOf) ? exports.Type.Optional(exports.Type.Union(OptionalUnwrap(schema.anyOf))) : schema;\n }\n function ResolveOptional(schema) {\n // prettier-ignore\n return schema[exports.Kind] === 'Intersect' ? ResolveIntersect(schema) :\n schema[exports.Kind] === 'Union' ? ResolveUnion(schema) :\n schema;\n }\n function TIntersect(schema, key) {\n const resolved = schema.allOf.reduce((acc, schema) => {\n const indexed = Visit(schema, key);\n return indexed[exports.Kind] === 'Never' ? acc : [...acc, indexed];\n }, []);\n return ResolveOptional(exports.Type.Intersect(resolved));\n }\n function TUnion(schema, key) {\n const resolved = schema.anyOf.map((schema) => Visit(schema, key));\n return ResolveOptional(exports.Type.Union(resolved));\n }\n function TObject(schema, key) {\n const property = schema.properties[key];\n return ValueGuard.IsUndefined(property) ? exports.Type.Never() : exports.Type.Union([property]);\n }\n function TTuple(schema, key) {\n const items = schema.items;\n if (ValueGuard.IsUndefined(items))\n return exports.Type.Never();\n const element = items[key]; //\n if (ValueGuard.IsUndefined(element))\n return exports.Type.Never();\n return element;\n }\n function Visit(schema, key) {\n // prettier-ignore\n return schema[exports.Kind] === 'Intersect' ? TIntersect(schema, key) :\n schema[exports.Kind] === 'Union' ? TUnion(schema, key) :\n schema[exports.Kind] === 'Object' ? TObject(schema, key) :\n schema[exports.Kind] === 'Tuple' ? TTuple(schema, key) :\n exports.Type.Never();\n }\n function Resolve(schema, keys, options = {}) {\n const resolved = keys.map((key) => Visit(schema, key.toString()));\n return ResolveOptional(exports.Type.Union(resolved, options));\n }\n IndexedAccessor.Resolve = Resolve;\n})(IndexedAccessor || (exports.IndexedAccessor = IndexedAccessor = {}));\n// --------------------------------------------------------------------------\n// Intrinsic\n// --------------------------------------------------------------------------\nvar Intrinsic;\n(function (Intrinsic) {\n function Uncapitalize(value) {\n const [first, rest] = [value.slice(0, 1), value.slice(1)];\n return `${first.toLowerCase()}${rest}`;\n }\n function Capitalize(value) {\n const [first, rest] = [value.slice(0, 1), value.slice(1)];\n return `${first.toUpperCase()}${rest}`;\n }\n function Uppercase(value) {\n return value.toUpperCase();\n }\n function Lowercase(value) {\n return value.toLowerCase();\n }\n function IntrinsicTemplateLiteral(schema, mode) {\n // note: template literals require special runtime handling as they are encoded in string patterns.\n // This diverges from the mapped type which would otherwise map on the template literal kind.\n const expression = TemplateLiteralParser.ParseExact(schema.pattern);\n const finite = TemplateLiteralFinite.Check(expression);\n if (!finite)\n return { ...schema, pattern: IntrinsicLiteral(schema.pattern, mode) };\n const strings = [...TemplateLiteralGenerator.Generate(expression)];\n const literals = strings.map((value) => exports.Type.Literal(value));\n const mapped = IntrinsicRest(literals, mode);\n const union = exports.Type.Union(mapped);\n return exports.Type.TemplateLiteral([union]);\n }\n function IntrinsicLiteral(value, mode) {\n // prettier-ignore\n return typeof value === 'string' ? (mode === 'Uncapitalize' ? Uncapitalize(value) :\n mode === 'Capitalize' ? Capitalize(value) :\n mode === 'Uppercase' ? Uppercase(value) :\n mode === 'Lowercase' ? Lowercase(value) :\n value) : value.toString();\n }\n function IntrinsicRest(schema, mode) {\n if (schema.length === 0)\n return [];\n const [L, ...R] = schema;\n return [Map(L, mode), ...IntrinsicRest(R, mode)];\n }\n function Visit(schema, mode) {\n // prettier-ignore\n return TypeGuard.TTemplateLiteral(schema) ? IntrinsicTemplateLiteral(schema, mode) :\n TypeGuard.TUnion(schema) ? exports.Type.Union(IntrinsicRest(schema.anyOf, mode)) :\n TypeGuard.TLiteral(schema) ? exports.Type.Literal(IntrinsicLiteral(schema.const, mode)) :\n schema;\n }\n /** Applies an intrinsic string manipulation to the given type. */\n function Map(schema, mode) {\n return Visit(schema, mode);\n }\n Intrinsic.Map = Map;\n})(Intrinsic || (exports.Intrinsic = Intrinsic = {}));\n// --------------------------------------------------------------------------\n// ObjectMap\n// --------------------------------------------------------------------------\nvar ObjectMap;\n(function (ObjectMap) {\n function TIntersect(schema, callback) {\n // prettier-ignore\n return exports.Type.Intersect(schema.allOf.map((inner) => Visit(inner, callback)), { ...schema });\n }\n function TUnion(schema, callback) {\n // prettier-ignore\n return exports.Type.Union(schema.anyOf.map((inner) => Visit(inner, callback)), { ...schema });\n }\n function TObject(schema, callback) {\n return callback(schema);\n }\n function Visit(schema, callback) {\n // There are cases where users need to map objects with unregistered kinds. Using a TypeGuard here would\n // prevent sub schema mapping as unregistered kinds will not pass TSchema checks. This is notable in the\n // case of TObject where unregistered property kinds cause the TObject check to fail. As mapping is only\n // used for composition, we use explicit checks instead.\n // prettier-ignore\n return (schema[exports.Kind] === 'Intersect' ? TIntersect(schema, callback) :\n schema[exports.Kind] === 'Union' ? TUnion(schema, callback) :\n schema[exports.Kind] === 'Object' ? TObject(schema, callback) :\n schema);\n }\n function Map(schema, callback, options) {\n return { ...Visit(TypeClone.Type(schema), callback), ...options };\n }\n ObjectMap.Map = Map;\n})(ObjectMap || (exports.ObjectMap = ObjectMap = {}));\nvar KeyResolver;\n(function (KeyResolver) {\n function UnwrapPattern(key) {\n return key[0] === '^' && key[key.length - 1] === '$' ? key.slice(1, key.length - 1) : key;\n }\n function TIntersect(schema, options) {\n return schema.allOf.reduce((acc, schema) => [...acc, ...Visit(schema, options)], []);\n }\n function TUnion(schema, options) {\n const sets = schema.anyOf.map((inner) => Visit(inner, options));\n return [...sets.reduce((set, outer) => outer.map((key) => (sets.every((inner) => inner.includes(key)) ? set.add(key) : set))[0], new Set())];\n }\n function TObject(schema, options) {\n return Object.getOwnPropertyNames(schema.properties);\n }\n function TRecord(schema, options) {\n return options.includePatterns ? Object.getOwnPropertyNames(schema.patternProperties) : [];\n }\n function Visit(schema, options) {\n // prettier-ignore\n return (TypeGuard.TIntersect(schema) ? TIntersect(schema, options) :\n TypeGuard.TUnion(schema) ? TUnion(schema, options) :\n TypeGuard.TObject(schema) ? TObject(schema, options) :\n TypeGuard.TRecord(schema) ? TRecord(schema, options) :\n []);\n }\n /** Resolves an array of keys in this schema */\n function ResolveKeys(schema, options) {\n return [...new Set(Visit(schema, options))];\n }\n KeyResolver.ResolveKeys = ResolveKeys;\n /** Resolves a regular expression pattern matching all keys in this schema */\n function ResolvePattern(schema) {\n const keys = ResolveKeys(schema, { includePatterns: true });\n const pattern = keys.map((key) => `(${UnwrapPattern(key)})`);\n return `^(${pattern.join('|')})$`;\n }\n KeyResolver.ResolvePattern = ResolvePattern;\n})(KeyResolver || (exports.KeyResolver = KeyResolver = {}));\n// --------------------------------------------------------------------------\n// KeyArrayResolver\n// --------------------------------------------------------------------------\nclass KeyArrayResolverError extends TypeBoxError {\n}\nexports.KeyArrayResolverError = KeyArrayResolverError;\nvar KeyArrayResolver;\n(function (KeyArrayResolver) {\n /** Resolves an array of string[] keys from the given schema or array type. */\n function Resolve(schema) {\n // prettier-ignore\n return Array.isArray(schema) ? schema :\n TypeGuard.TUnionLiteral(schema) ? schema.anyOf.map((schema) => schema.const.toString()) :\n TypeGuard.TLiteral(schema) ? [schema.const] :\n TypeGuard.TTemplateLiteral(schema) ? (() => {\n const expression = TemplateLiteralParser.ParseExact(schema.pattern);\n if (!TemplateLiteralFinite.Check(expression))\n throw new KeyArrayResolverError('Cannot resolve keys from infinite template expression');\n return [...TemplateLiteralGenerator.Generate(expression)];\n })() : [];\n }\n KeyArrayResolver.Resolve = Resolve;\n})(KeyArrayResolver || (exports.KeyArrayResolver = KeyArrayResolver = {}));\n// --------------------------------------------------------------------------\n// UnionResolver\n// --------------------------------------------------------------------------\nvar UnionResolver;\n(function (UnionResolver) {\n function* TUnion(union) {\n for (const schema of union.anyOf) {\n if (schema[exports.Kind] === 'Union') {\n yield* TUnion(schema);\n }\n else {\n yield schema;\n }\n }\n }\n /** Returns a resolved union with interior unions flattened */\n function Resolve(union) {\n return exports.Type.Union([...TUnion(union)], { ...union });\n }\n UnionResolver.Resolve = Resolve;\n})(UnionResolver || (exports.UnionResolver = UnionResolver = {}));\n// --------------------------------------------------------------------------\n// TemplateLiteralPattern\n// --------------------------------------------------------------------------\nclass TemplateLiteralPatternError extends TypeBoxError {\n}\nexports.TemplateLiteralPatternError = TemplateLiteralPatternError;\nvar TemplateLiteralPattern;\n(function (TemplateLiteralPattern) {\n function Throw(message) {\n throw new TemplateLiteralPatternError(message);\n }\n function Escape(value) {\n return value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&');\n }\n function Visit(schema, acc) {\n // prettier-ignore\n return (TypeGuard.TTemplateLiteral(schema) ? schema.pattern.slice(1, schema.pattern.length - 1) :\n TypeGuard.TUnion(schema) ? `(${schema.anyOf.map((schema) => Visit(schema, acc)).join('|')})` :\n TypeGuard.TNumber(schema) ? `${acc}${exports.PatternNumber}` :\n TypeGuard.TInteger(schema) ? `${acc}${exports.PatternNumber}` :\n TypeGuard.TBigInt(schema) ? `${acc}${exports.PatternNumber}` :\n TypeGuard.TString(schema) ? `${acc}${exports.PatternString}` :\n TypeGuard.TLiteral(schema) ? `${acc}${Escape(schema.const.toString())}` :\n TypeGuard.TBoolean(schema) ? `${acc}${exports.PatternBoolean}` :\n Throw(`Unexpected Kind '${schema[exports.Kind]}'`));\n }\n function Create(kinds) {\n return `^${kinds.map((schema) => Visit(schema, '')).join('')}\\$`;\n }\n TemplateLiteralPattern.Create = Create;\n})(TemplateLiteralPattern || (exports.TemplateLiteralPattern = TemplateLiteralPattern = {}));\n// --------------------------------------------------------------------------------------\n// TemplateLiteralResolver\n// --------------------------------------------------------------------------------------\nvar TemplateLiteralResolver;\n(function (TemplateLiteralResolver) {\n /** Resolves a template literal as a TUnion */\n function Resolve(template) {\n const expression = TemplateLiteralParser.ParseExact(template.pattern);\n if (!TemplateLiteralFinite.Check(expression))\n return exports.Type.String();\n const literals = [...TemplateLiteralGenerator.Generate(expression)].map((value) => exports.Type.Literal(value));\n return exports.Type.Union(literals);\n }\n TemplateLiteralResolver.Resolve = Resolve;\n})(TemplateLiteralResolver || (exports.TemplateLiteralResolver = TemplateLiteralResolver = {}));\n// --------------------------------------------------------------------------------------\n// TemplateLiteralParser\n// --------------------------------------------------------------------------------------\nclass TemplateLiteralParserError extends TypeBoxError {\n}\nexports.TemplateLiteralParserError = TemplateLiteralParserError;\nvar TemplateLiteralParser;\n(function (TemplateLiteralParser) {\n function IsNonEscaped(pattern, index, char) {\n return pattern[index] === char && pattern.charCodeAt(index - 1) !== 92;\n }\n function IsOpenParen(pattern, index) {\n return IsNonEscaped(pattern, index, '(');\n }\n function IsCloseParen(pattern, index) {\n return IsNonEscaped(pattern, index, ')');\n }\n function IsSeparator(pattern, index) {\n return IsNonEscaped(pattern, index, '|');\n }\n function IsGroup(pattern) {\n if (!(IsOpenParen(pattern, 0) && IsCloseParen(pattern, pattern.length - 1)))\n return false;\n let count = 0;\n for (let index = 0; index < pattern.length; index++) {\n if (IsOpenParen(pattern, index))\n count += 1;\n if (IsCloseParen(pattern, index))\n count -= 1;\n if (count === 0 && index !== pattern.length - 1)\n return false;\n }\n return true;\n }\n function InGroup(pattern) {\n return pattern.slice(1, pattern.length - 1);\n }\n function IsPrecedenceOr(pattern) {\n let count = 0;\n for (let index = 0; index < pattern.length; index++) {\n if (IsOpenParen(pattern, index))\n count += 1;\n if (IsCloseParen(pattern, index))\n count -= 1;\n if (IsSeparator(pattern, index) && count === 0)\n return true;\n }\n return false;\n }\n function IsPrecedenceAnd(pattern) {\n for (let index = 0; index < pattern.length; index++) {\n if (IsOpenParen(pattern, index))\n return true;\n }\n return false;\n }\n function Or(pattern) {\n let [count, start] = [0, 0];\n const expressions = [];\n for (let index = 0; index < pattern.length; index++) {\n if (IsOpenParen(pattern, index))\n count += 1;\n if (IsCloseParen(pattern, index))\n count -= 1;\n if (IsSeparator(pattern, index) && count === 0) {\n const range = pattern.slice(start, index);\n if (range.length > 0)\n expressions.push(Parse(range));\n start = index + 1;\n }\n }\n const range = pattern.slice(start);\n if (range.length > 0)\n expressions.push(Parse(range));\n if (expressions.length === 0)\n return { type: 'const', const: '' };\n if (expressions.length === 1)\n return expressions[0];\n return { type: 'or', expr: expressions };\n }\n function And(pattern) {\n function Group(value, index) {\n if (!IsOpenParen(value, index))\n throw new TemplateLiteralParserError(`TemplateLiteralParser: Index must point to open parens`);\n let count = 0;\n for (let scan = index; scan < value.length; scan++) {\n if (IsOpenParen(value, scan))\n count += 1;\n if (IsCloseParen(value, scan))\n count -= 1;\n if (count === 0)\n return [index, scan];\n }\n throw new TemplateLiteralParserError(`TemplateLiteralParser: Unclosed group parens in expression`);\n }\n function Range(pattern, index) {\n for (let scan = index; scan < pattern.length; scan++) {\n if (IsOpenParen(pattern, scan))\n return [index, scan];\n }\n return [index, pattern.length];\n }\n const expressions = [];\n for (let index = 0; index < pattern.length; index++) {\n if (IsOpenParen(pattern, index)) {\n const [start, end] = Group(pattern, index);\n const range = pattern.slice(start, end + 1);\n expressions.push(Parse(range));\n index = end;\n }\n else {\n const [start, end] = Range(pattern, index);\n const range = pattern.slice(start, end);\n if (range.length > 0)\n expressions.push(Parse(range));\n index = end - 1;\n }\n }\n // prettier-ignore\n return (expressions.length === 0) ? { type: 'const', const: '' } :\n (expressions.length === 1) ? expressions[0] :\n { type: 'and', expr: expressions };\n }\n /** Parses a pattern and returns an expression tree */\n function Parse(pattern) {\n // prettier-ignore\n return IsGroup(pattern) ? Parse(InGroup(pattern)) :\n IsPrecedenceOr(pattern) ? Or(pattern) :\n IsPrecedenceAnd(pattern) ? And(pattern) :\n { type: 'const', const: pattern };\n }\n TemplateLiteralParser.Parse = Parse;\n /** Parses a pattern and strips forward and trailing ^ and $ */\n function ParseExact(pattern) {\n return Parse(pattern.slice(1, pattern.length - 1));\n }\n TemplateLiteralParser.ParseExact = ParseExact;\n})(TemplateLiteralParser || (exports.TemplateLiteralParser = TemplateLiteralParser = {}));\n// --------------------------------------------------------------------------------------\n// TemplateLiteralFinite\n// --------------------------------------------------------------------------------------\nclass TemplateLiteralFiniteError extends TypeBoxError {\n}\nexports.TemplateLiteralFiniteError = TemplateLiteralFiniteError;\nvar TemplateLiteralFinite;\n(function (TemplateLiteralFinite) {\n function Throw(message) {\n throw new TemplateLiteralFiniteError(message);\n }\n function IsNumber(expression) {\n // prettier-ignore\n return (expression.type === 'or' &&\n expression.expr.length === 2 &&\n expression.expr[0].type === 'const' &&\n expression.expr[0].const === '0' &&\n expression.expr[1].type === 'const' &&\n expression.expr[1].const === '[1-9][0-9]*');\n }\n function IsBoolean(expression) {\n // prettier-ignore\n return (expression.type === 'or' &&\n expression.expr.length === 2 &&\n expression.expr[0].type === 'const' &&\n expression.expr[0].const === 'true' &&\n expression.expr[1].type === 'const' &&\n expression.expr[1].const === 'false');\n }\n function IsString(expression) {\n return expression.type === 'const' && expression.const === '.*';\n }\n function Check(expression) {\n // prettier-ignore\n return IsBoolean(expression) ? true :\n IsNumber(expression) || IsString(expression) ? false :\n (expression.type === 'and') ? expression.expr.every((expr) => Check(expr)) :\n (expression.type === 'or') ? expression.expr.every((expr) => Check(expr)) :\n (expression.type === 'const') ? true :\n Throw(`Unknown expression type`);\n }\n TemplateLiteralFinite.Check = Check;\n})(TemplateLiteralFinite || (exports.TemplateLiteralFinite = TemplateLiteralFinite = {}));\n// --------------------------------------------------------------------------------------\n// TemplateLiteralGenerator\n// --------------------------------------------------------------------------------------\nclass TemplateLiteralGeneratorError extends TypeBoxError {\n}\nexports.TemplateLiteralGeneratorError = TemplateLiteralGeneratorError;\nvar TemplateLiteralGenerator;\n(function (TemplateLiteralGenerator) {\n function* Reduce(buffer) {\n if (buffer.length === 1)\n return yield* buffer[0];\n for (const left of buffer[0]) {\n for (const right of Reduce(buffer.slice(1))) {\n yield `${left}${right}`;\n }\n }\n }\n function* And(expression) {\n return yield* Reduce(expression.expr.map((expr) => [...Generate(expr)]));\n }\n function* Or(expression) {\n for (const expr of expression.expr)\n yield* Generate(expr);\n }\n function* Const(expression) {\n return yield expression.const;\n }\n function* Generate(expression) {\n // prettier-ignore\n return (expression.type === 'and' ? yield* And(expression) :\n expression.type === 'or' ? yield* Or(expression) :\n expression.type === 'const' ? yield* Const(expression) :\n (() => { throw new TemplateLiteralGeneratorError('Unknown expression'); })());\n }\n TemplateLiteralGenerator.Generate = Generate;\n})(TemplateLiteralGenerator || (exports.TemplateLiteralGenerator = TemplateLiteralGenerator = {}));\n// ---------------------------------------------------------------------\n// TemplateLiteralDslParser\n// ---------------------------------------------------------------------\nvar TemplateLiteralDslParser;\n(function (TemplateLiteralDslParser) {\n function* ParseUnion(template) {\n const trim = template.trim().replace(/\"|'/g, '');\n // prettier-ignore\n return (trim === 'boolean' ? yield exports.Type.Boolean() :\n trim === 'number' ? yield exports.Type.Number() :\n trim === 'bigint' ? yield exports.Type.BigInt() :\n trim === 'string' ? yield exports.Type.String() :\n yield (() => {\n const literals = trim.split('|').map((literal) => exports.Type.Literal(literal.trim()));\n return (literals.length === 0 ? exports.Type.Never() :\n literals.length === 1 ? literals[0] :\n exports.Type.Union(literals));\n })());\n }\n function* ParseTerminal(template) {\n if (template[1] !== '{') {\n const L = exports.Type.Literal('$');\n const R = ParseLiteral(template.slice(1));\n return yield* [L, ...R];\n }\n for (let i = 2; i < template.length; i++) {\n if (template[i] === '}') {\n const L = ParseUnion(template.slice(2, i));\n const R = ParseLiteral(template.slice(i + 1));\n return yield* [...L, ...R];\n }\n }\n yield exports.Type.Literal(template);\n }\n function* ParseLiteral(template) {\n for (let i = 0; i < template.length; i++) {\n if (template[i] === '$') {\n const L = exports.Type.Literal(template.slice(0, i));\n const R = ParseTerminal(template.slice(i));\n return yield* [L, ...R];\n }\n }\n yield exports.Type.Literal(template);\n }\n function Parse(template_dsl) {\n return [...ParseLiteral(template_dsl)];\n }\n TemplateLiteralDslParser.Parse = Parse;\n})(TemplateLiteralDslParser || (exports.TemplateLiteralDslParser = TemplateLiteralDslParser = {}));\n// ---------------------------------------------------------------------\n// TransformBuilder\n// ---------------------------------------------------------------------\nclass TransformDecodeBuilder {\n constructor(schema) {\n this.schema = schema;\n }\n Decode(decode) {\n return new TransformEncodeBuilder(this.schema, decode);\n }\n}\nexports.TransformDecodeBuilder = TransformDecodeBuilder;\nclass TransformEncodeBuilder {\n constructor(schema, decode) {\n this.schema = schema;\n this.decode = decode;\n }\n Encode(encode) {\n const schema = TypeClone.Type(this.schema);\n // prettier-ignore\n return (TypeGuard.TTransform(schema) ? (() => {\n const Encode = (value) => schema[exports.Transform].Encode(encode(value));\n const Decode = (value) => this.decode(schema[exports.Transform].Decode(value));\n const Codec = { Encode: Encode, Decode: Decode };\n return { ...schema, [exports.Transform]: Codec };\n })() : (() => {\n const Codec = { Decode: this.decode, Encode: encode };\n return { ...schema, [exports.Transform]: Codec };\n })());\n }\n}\nexports.TransformEncodeBuilder = TransformEncodeBuilder;\n// --------------------------------------------------------------------------\n// TypeOrdinal: Used for auto $id generation\n// --------------------------------------------------------------------------\nlet TypeOrdinal = 0;\n// --------------------------------------------------------------------------\n// TypeBuilder\n// --------------------------------------------------------------------------\nclass TypeBuilderError extends TypeBoxError {\n}\nexports.TypeBuilderError = TypeBuilderError;\nclass TypeBuilder {\n /** `[Internal]` Creates a schema without `static` and `params` types */\n Create(schema) {\n return schema;\n }\n /** `[Internal]` Throws a TypeBuilder error with the given message */\n Throw(message) {\n throw new TypeBuilderError(message);\n }\n /** `[Internal]` Discards property keys from the given record type */\n Discard(record, keys) {\n return keys.reduce((acc, key) => {\n const { [key]: _, ...rest } = acc;\n return rest;\n }, record);\n }\n /** `[Json]` Omits compositing symbols from this schema */\n Strict(schema) {\n return JSON.parse(JSON.stringify(schema));\n }\n}\nexports.TypeBuilder = TypeBuilder;\n// --------------------------------------------------------------------------\n// JsonTypeBuilder\n// --------------------------------------------------------------------------\nclass JsonTypeBuilder extends TypeBuilder {\n // ------------------------------------------------------------------------\n // Modifiers\n // ------------------------------------------------------------------------\n /** `[Json]` Creates a Readonly and Optional property */\n ReadonlyOptional(schema) {\n return this.Readonly(this.Optional(schema));\n }\n /** `[Json]` Creates a Readonly property */\n Readonly(schema) {\n return { ...TypeClone.Type(schema), [exports.Readonly]: 'Readonly' };\n }\n /** `[Json]` Creates an Optional property */\n Optional(schema) {\n return { ...TypeClone.Type(schema), [exports.Optional]: 'Optional' };\n }\n // ------------------------------------------------------------------------\n // Types\n // ------------------------------------------------------------------------\n /** `[Json]` Creates an Any type */\n Any(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Any' });\n }\n /** `[Json]` Creates an Array type */\n Array(schema, options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Array', type: 'array', items: TypeClone.Type(schema) });\n }\n /** `[Json]` Creates a Boolean type */\n Boolean(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Boolean', type: 'boolean' });\n }\n /** `[Json]` Intrinsic function to Capitalize LiteralString types */\n Capitalize(schema, options = {}) {\n return { ...Intrinsic.Map(TypeClone.Type(schema), 'Capitalize'), ...options };\n }\n /** `[Json]` Creates a Composite object type */\n Composite(objects, options) {\n const intersect = exports.Type.Intersect(objects, {});\n const keys = KeyResolver.ResolveKeys(intersect, { includePatterns: false });\n const properties = keys.reduce((acc, key) => ({ ...acc, [key]: exports.Type.Index(intersect, [key]) }), {});\n return exports.Type.Object(properties, options);\n }\n /** `[Json]` Creates a Enum type */\n Enum(item, options = {}) {\n if (ValueGuard.IsUndefined(item))\n return this.Throw('Enum undefined or empty');\n // prettier-ignore\n const values1 = Object.getOwnPropertyNames(item).filter((key) => isNaN(key)).map((key) => item[key]);\n const values2 = [...new Set(values1)];\n const anyOf = values2.map((value) => exports.Type.Literal(value));\n return this.Union(anyOf, { ...options, [exports.Hint]: 'Enum' });\n }\n /** `[Json]` Creates a Conditional type */\n Extends(left, right, trueType, falseType, options = {}) {\n switch (TypeExtends.Extends(left, right)) {\n case TypeExtendsResult.Union:\n return this.Union([TypeClone.Type(trueType, options), TypeClone.Type(falseType, options)]);\n case TypeExtendsResult.True:\n return TypeClone.Type(trueType, options);\n case TypeExtendsResult.False:\n return TypeClone.Type(falseType, options);\n }\n }\n /** `[Json]` Constructs a type by excluding from unionType all union members that are assignable to excludedMembers */\n Exclude(unionType, excludedMembers, options = {}) {\n // prettier-ignore\n return (TypeGuard.TTemplateLiteral(unionType) ? this.Exclude(TemplateLiteralResolver.Resolve(unionType), excludedMembers, options) :\n TypeGuard.TTemplateLiteral(excludedMembers) ? this.Exclude(unionType, TemplateLiteralResolver.Resolve(excludedMembers), options) :\n TypeGuard.TUnion(unionType) ? (() => {\n const narrowed = unionType.anyOf.filter((inner) => TypeExtends.Extends(inner, excludedMembers) === TypeExtendsResult.False);\n return (narrowed.length === 1 ? TypeClone.Type(narrowed[0], options) : this.Union(narrowed, options));\n })() :\n TypeExtends.Extends(unionType, excludedMembers) !== TypeExtendsResult.False ? this.Never(options) :\n TypeClone.Type(unionType, options));\n }\n /** `[Json]` Constructs a type by extracting from type all union members that are assignable to union */\n Extract(type, union, options = {}) {\n // prettier-ignore\n return (TypeGuard.TTemplateLiteral(type) ? this.Extract(TemplateLiteralResolver.Resolve(type), union, options) :\n TypeGuard.TTemplateLiteral(union) ? this.Extract(type, TemplateLiteralResolver.Resolve(union), options) :\n TypeGuard.TUnion(type) ? (() => {\n const narrowed = type.anyOf.filter((inner) => TypeExtends.Extends(inner, union) !== TypeExtendsResult.False);\n return (narrowed.length === 1 ? TypeClone.Type(narrowed[0], options) : this.Union(narrowed, options));\n })() :\n TypeExtends.Extends(type, union) !== TypeExtendsResult.False ? TypeClone.Type(type, options) :\n this.Never(options));\n }\n /** `[Json]` Returns an Indexed property type for the given keys */\n Index(schema, unresolved, options = {}) {\n // prettier-ignore\n return (TypeGuard.TArray(schema) && TypeGuard.TNumber(unresolved) ? (() => {\n return TypeClone.Type(schema.items, options);\n })() :\n TypeGuard.TTuple(schema) && TypeGuard.TNumber(unresolved) ? (() => {\n const items = ValueGuard.IsUndefined(schema.items) ? [] : schema.items;\n const cloned = items.map((schema) => TypeClone.Type(schema));\n return this.Union(cloned, options);\n })() : (() => {\n const keys = KeyArrayResolver.Resolve(unresolved);\n const clone = TypeClone.Type(schema);\n return IndexedAccessor.Resolve(clone, keys, options);\n })());\n }\n /** `[Json]` Creates an Integer type */\n Integer(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Integer', type: 'integer' });\n }\n /** `[Json]` Creates an Intersect type */\n Intersect(allOf, options = {}) {\n if (allOf.length === 0)\n return exports.Type.Never();\n if (allOf.length === 1)\n return TypeClone.Type(allOf[0], options);\n if (allOf.some((schema) => TypeGuard.TTransform(schema)))\n this.Throw('Cannot intersect transform types');\n const objects = allOf.every((schema) => TypeGuard.TObject(schema));\n const cloned = TypeClone.Rest(allOf);\n // prettier-ignore\n const clonedUnevaluatedProperties = TypeGuard.TSchema(options.unevaluatedProperties)\n ? { unevaluatedProperties: TypeClone.Type(options.unevaluatedProperties) }\n : {};\n return options.unevaluatedProperties === false || TypeGuard.TSchema(options.unevaluatedProperties) || objects\n ? this.Create({ ...options, ...clonedUnevaluatedProperties, [exports.Kind]: 'Intersect', type: 'object', allOf: cloned })\n : this.Create({ ...options, ...clonedUnevaluatedProperties, [exports.Kind]: 'Intersect', allOf: cloned });\n }\n /** `[Json]` Creates a KeyOf type */\n KeyOf(schema, options = {}) {\n // prettier-ignore\n return (TypeGuard.TRecord(schema) ? (() => {\n const pattern = Object.getOwnPropertyNames(schema.patternProperties)[0];\n return (pattern === exports.PatternNumberExact ? this.Number(options) :\n pattern === exports.PatternStringExact ? this.String(options) :\n this.Throw('Unable to resolve key type from Record key pattern'));\n })() :\n TypeGuard.TTuple(schema) ? (() => {\n const items = ValueGuard.IsUndefined(schema.items) ? [] : schema.items;\n const literals = items.map((_, index) => exports.Type.Literal(index.toString()));\n return this.Union(literals, options);\n })() :\n TypeGuard.TArray(schema) ? (() => {\n return this.Number(options);\n })() : (() => {\n const keys = KeyResolver.ResolveKeys(schema, { includePatterns: false });\n if (keys.length === 0)\n return this.Never(options);\n const literals = keys.map((key) => this.Literal(key));\n return this.Union(literals, options);\n })());\n }\n /** `[Json]` Creates a Literal type */\n Literal(value, options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Literal', const: value, type: typeof value });\n }\n /** `[Json]` Intrinsic function to Lowercase LiteralString types */\n Lowercase(schema, options = {}) {\n return { ...Intrinsic.Map(TypeClone.Type(schema), 'Lowercase'), ...options };\n }\n /** `[Json]` Creates a Never type */\n Never(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Never', not: {} });\n }\n /** `[Json]` Creates a Not type */\n Not(schema, options) {\n return this.Create({ ...options, [exports.Kind]: 'Not', not: TypeClone.Type(schema) });\n }\n /** `[Json]` Creates a Null type */\n Null(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Null', type: 'null' });\n }\n /** `[Json]` Creates a Number type */\n Number(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Number', type: 'number' });\n }\n /** `[Json]` Creates an Object type */\n Object(properties, options = {}) {\n const propertyKeys = Object.getOwnPropertyNames(properties);\n const optionalKeys = propertyKeys.filter((key) => TypeGuard.TOptional(properties[key]));\n const requiredKeys = propertyKeys.filter((name) => !optionalKeys.includes(name));\n const clonedAdditionalProperties = TypeGuard.TSchema(options.additionalProperties) ? { additionalProperties: TypeClone.Type(options.additionalProperties) } : {};\n const clonedProperties = propertyKeys.reduce((acc, key) => ({ ...acc, [key]: TypeClone.Type(properties[key]) }), {});\n return requiredKeys.length > 0\n ? this.Create({ ...options, ...clonedAdditionalProperties, [exports.Kind]: 'Object', type: 'object', properties: clonedProperties, required: requiredKeys })\n : this.Create({ ...options, ...clonedAdditionalProperties, [exports.Kind]: 'Object', type: 'object', properties: clonedProperties });\n }\n /** `[Json]` Constructs a type whose keys are omitted from the given type */\n Omit(schema, unresolved, options = {}) {\n const keys = KeyArrayResolver.Resolve(unresolved);\n // prettier-ignore\n return ObjectMap.Map(this.Discard(TypeClone.Type(schema), ['$id', exports.Transform]), (object) => {\n if (ValueGuard.IsArray(object.required)) {\n object.required = object.required.filter((key) => !keys.includes(key));\n if (object.required.length === 0)\n delete object.required;\n }\n for (const key of Object.getOwnPropertyNames(object.properties)) {\n if (keys.includes(key))\n delete object.properties[key];\n }\n return this.Create(object);\n }, options);\n }\n /** `[Json]` Constructs a type where all properties are optional */\n Partial(schema, options = {}) {\n // prettier-ignore\n return ObjectMap.Map(this.Discard(TypeClone.Type(schema), ['$id', exports.Transform]), (object) => {\n const properties = Object.getOwnPropertyNames(object.properties).reduce((acc, key) => {\n return { ...acc, [key]: this.Optional(object.properties[key]) };\n }, {});\n return this.Object(properties, this.Discard(object, ['required']) /* object used as options to retain other constraints */);\n }, options);\n }\n /** `[Json]` Constructs a type whose keys are picked from the given type */\n Pick(schema, unresolved, options = {}) {\n const keys = KeyArrayResolver.Resolve(unresolved);\n // prettier-ignore\n return ObjectMap.Map(this.Discard(TypeClone.Type(schema), ['$id', exports.Transform]), (object) => {\n if (ValueGuard.IsArray(object.required)) {\n object.required = object.required.filter((key) => keys.includes(key));\n if (object.required.length === 0)\n delete object.required;\n }\n for (const key of Object.getOwnPropertyNames(object.properties)) {\n if (!keys.includes(key))\n delete object.properties[key];\n }\n return this.Create(object);\n }, options);\n }\n /** `[Json]` Creates a Record type */\n Record(key, schema, options = {}) {\n // prettier-ignore\n return (TypeGuard.TTemplateLiteral(key) ? (() => {\n const expression = TemplateLiteralParser.ParseExact(key.pattern);\n // prettier-ignore\n return TemplateLiteralFinite.Check(expression)\n ? (this.Object([...TemplateLiteralGenerator.Generate(expression)].reduce((acc, key) => ({ ...acc, [key]: TypeClone.Type(schema) }), {}), options))\n : this.Create({ ...options, [exports.Kind]: 'Record', type: 'object', patternProperties: { [key.pattern]: TypeClone.Type(schema) } });\n })() :\n TypeGuard.TUnion(key) ? (() => {\n const union = UnionResolver.Resolve(key);\n if (TypeGuard.TUnionLiteral(union)) {\n const properties = union.anyOf.reduce((acc, literal) => ({ ...acc, [literal.const]: TypeClone.Type(schema) }), {});\n return this.Object(properties, { ...options, [exports.Hint]: 'Record' });\n }\n else\n this.Throw('Record key of type union contains non-literal types');\n })() :\n TypeGuard.TLiteral(key) ? (() => {\n // prettier-ignore\n return (ValueGuard.IsString(key.const) || ValueGuard.IsNumber(key.const))\n ? this.Object({ [key.const]: TypeClone.Type(schema) }, options)\n : this.Throw('Record key of type literal is not of type string or number');\n })() :\n TypeGuard.TInteger(key) || TypeGuard.TNumber(key) ? (() => {\n return this.Create({ ...options, [exports.Kind]: 'Record', type: 'object', patternProperties: { [exports.PatternNumberExact]: TypeClone.Type(schema) } });\n })() :\n TypeGuard.TString(key) ? (() => {\n const pattern = ValueGuard.IsUndefined(key.pattern) ? exports.PatternStringExact : key.pattern;\n return this.Create({ ...options, [exports.Kind]: 'Record', type: 'object', patternProperties: { [pattern]: TypeClone.Type(schema) } });\n })() :\n this.Never());\n }\n /** `[Json]` Creates a Recursive type */\n Recursive(callback, options = {}) {\n if (ValueGuard.IsUndefined(options.$id))\n options.$id = `T${TypeOrdinal++}`;\n const thisType = callback({ [exports.Kind]: 'This', $ref: `${options.$id}` });\n thisType.$id = options.$id;\n return this.Create({ ...options, [exports.Hint]: 'Recursive', ...thisType });\n }\n /** `[Json]` Creates a Ref type. */\n Ref(unresolved, options = {}) {\n if (ValueGuard.IsString(unresolved))\n return this.Create({ ...options, [exports.Kind]: 'Ref', $ref: unresolved });\n if (ValueGuard.IsUndefined(unresolved.$id))\n this.Throw('Reference target type must specify an $id');\n return this.Create({ ...options, [exports.Kind]: 'Ref', $ref: unresolved.$id });\n }\n /** `[Json]` Constructs a type where all properties are required */\n Required(schema, options = {}) {\n // prettier-ignore\n return ObjectMap.Map(this.Discard(TypeClone.Type(schema), ['$id', exports.Transform]), (object) => {\n const properties = Object.getOwnPropertyNames(object.properties).reduce((acc, key) => {\n return { ...acc, [key]: this.Discard(object.properties[key], [exports.Optional]) };\n }, {});\n return this.Object(properties, object /* object used as options to retain other constraints */);\n }, options);\n }\n /** `[Json]` Extracts interior Rest elements from Tuple, Intersect and Union types */\n Rest(schema) {\n return (TypeGuard.TTuple(schema) && !ValueGuard.IsUndefined(schema.items) ? TypeClone.Rest(schema.items) : TypeGuard.TIntersect(schema) ? TypeClone.Rest(schema.allOf) : TypeGuard.TUnion(schema) ? TypeClone.Rest(schema.anyOf) : []);\n }\n /** `[Json]` Creates a String type */\n String(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'String', type: 'string' });\n }\n /** `[Json]` Creates a TemplateLiteral type */\n TemplateLiteral(unresolved, options = {}) {\n // prettier-ignore\n const pattern = ValueGuard.IsString(unresolved)\n ? TemplateLiteralPattern.Create(TemplateLiteralDslParser.Parse(unresolved))\n : TemplateLiteralPattern.Create(unresolved);\n return this.Create({ ...options, [exports.Kind]: 'TemplateLiteral', type: 'string', pattern });\n }\n /** `[Json]` Creates a Transform type */\n Transform(schema) {\n return new TransformDecodeBuilder(schema);\n }\n /** `[Json]` Creates a Tuple type */\n Tuple(items, options = {}) {\n const [additionalItems, minItems, maxItems] = [false, items.length, items.length];\n const clonedItems = TypeClone.Rest(items);\n // prettier-ignore\n const schema = (items.length > 0 ?\n { ...options, [exports.Kind]: 'Tuple', type: 'array', items: clonedItems, additionalItems, minItems, maxItems } :\n { ...options, [exports.Kind]: 'Tuple', type: 'array', minItems, maxItems });\n return this.Create(schema);\n }\n /** `[Json]` Intrinsic function to Uncapitalize LiteralString types */\n Uncapitalize(schema, options = {}) {\n return { ...Intrinsic.Map(TypeClone.Type(schema), 'Uncapitalize'), ...options };\n }\n /** `[Json]` Creates a Union type */\n Union(union, options = {}) {\n // prettier-ignore\n return TypeGuard.TTemplateLiteral(union)\n ? TemplateLiteralResolver.Resolve(union)\n : (() => {\n const anyOf = union;\n if (anyOf.length === 0)\n return this.Never(options);\n if (anyOf.length === 1)\n return this.Create(TypeClone.Type(anyOf[0], options));\n const clonedAnyOf = TypeClone.Rest(anyOf);\n return this.Create({ ...options, [exports.Kind]: 'Union', anyOf: clonedAnyOf });\n })();\n }\n /** `[Json]` Creates an Unknown type */\n Unknown(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Unknown' });\n }\n /** `[Json]` Creates a Unsafe type that will infers as the generic argument T */\n Unsafe(options = {}) {\n return this.Create({ ...options, [exports.Kind]: options[exports.Kind] || 'Unsafe' });\n }\n /** `[Json]` Intrinsic function to Uppercase LiteralString types */\n Uppercase(schema, options = {}) {\n return { ...Intrinsic.Map(TypeClone.Type(schema), 'Uppercase'), ...options };\n }\n}\nexports.JsonTypeBuilder = JsonTypeBuilder;\n// --------------------------------------------------------------------------\n// JavaScriptTypeBuilder\n// --------------------------------------------------------------------------\nclass JavaScriptTypeBuilder extends JsonTypeBuilder {\n /** `[JavaScript]` Creates a AsyncIterator type */\n AsyncIterator(items, options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'AsyncIterator', type: 'AsyncIterator', items: TypeClone.Type(items) });\n }\n /** `[JavaScript]` Constructs a type by recursively unwrapping Promise types */\n Awaited(schema, options = {}) {\n // prettier-ignore\n const Unwrap = (rest) => rest.length > 0 ? (() => {\n const [L, ...R] = rest;\n return [this.Awaited(L), ...Unwrap(R)];\n })() : rest;\n // prettier-ignore\n return (TypeGuard.TIntersect(schema) ? exports.Type.Intersect(Unwrap(schema.allOf)) :\n TypeGuard.TUnion(schema) ? exports.Type.Union(Unwrap(schema.anyOf)) :\n TypeGuard.TPromise(schema) ? this.Awaited(schema.item) :\n TypeClone.Type(schema, options));\n }\n /** `[JavaScript]` Creates a BigInt type */\n BigInt(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'BigInt', type: 'bigint' });\n }\n /** `[JavaScript]` Extracts the ConstructorParameters from the given Constructor type */\n ConstructorParameters(schema, options = {}) {\n return this.Tuple([...schema.parameters], { ...options });\n }\n /** `[JavaScript]` Creates a Constructor type */\n Constructor(parameters, returns, options) {\n const [clonedParameters, clonedReturns] = [TypeClone.Rest(parameters), TypeClone.Type(returns)];\n return this.Create({ ...options, [exports.Kind]: 'Constructor', type: 'Constructor', parameters: clonedParameters, returns: clonedReturns });\n }\n /** `[JavaScript]` Creates a Date type */\n Date(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Date', type: 'Date' });\n }\n /** `[JavaScript]` Creates a Function type */\n Function(parameters, returns, options) {\n const [clonedParameters, clonedReturns] = [TypeClone.Rest(parameters), TypeClone.Type(returns)];\n return this.Create({ ...options, [exports.Kind]: 'Function', type: 'Function', parameters: clonedParameters, returns: clonedReturns });\n }\n /** `[JavaScript]` Extracts the InstanceType from the given Constructor type */\n InstanceType(schema, options = {}) {\n return TypeClone.Type(schema.returns, options);\n }\n /** `[JavaScript]` Creates an Iterator type */\n Iterator(items, options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Iterator', type: 'Iterator', items: TypeClone.Type(items) });\n }\n /** `[JavaScript]` Extracts the Parameters from the given Function type */\n Parameters(schema, options = {}) {\n return this.Tuple(schema.parameters, { ...options });\n }\n /** `[JavaScript]` Creates a Promise type */\n Promise(item, options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Promise', type: 'Promise', item: TypeClone.Type(item) });\n }\n /** `[Extended]` Creates a String type */\n RegExp(unresolved, options = {}) {\n const pattern = ValueGuard.IsString(unresolved) ? unresolved : unresolved.source;\n return this.Create({ ...options, [exports.Kind]: 'String', type: 'string', pattern });\n }\n /**\n * @deprecated Use `Type.RegExp`\n */\n RegEx(regex, options = {}) {\n return this.RegExp(regex, options);\n }\n /** `[JavaScript]` Extracts the ReturnType from the given Function type */\n ReturnType(schema, options = {}) {\n return TypeClone.Type(schema.returns, options);\n }\n /** `[JavaScript]` Creates a Symbol type */\n Symbol(options) {\n return this.Create({ ...options, [exports.Kind]: 'Symbol', type: 'symbol' });\n }\n /** `[JavaScript]` Creates a Undefined type */\n Undefined(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Undefined', type: 'undefined' });\n }\n /** `[JavaScript]` Creates a Uint8Array type */\n Uint8Array(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Uint8Array', type: 'Uint8Array' });\n }\n /** `[JavaScript]` Creates a Void type */\n Void(options = {}) {\n return this.Create({ ...options, [exports.Kind]: 'Void', type: 'void' });\n }\n}\nexports.JavaScriptTypeBuilder = JavaScriptTypeBuilder;\n/** Json Type Builder with Static Resolution for TypeScript */\nexports.JsonType = new JsonTypeBuilder();\n/** JavaScript Type Builder with Static Resolution for TypeScript */\nexports.Type = new JavaScriptTypeBuilder();\n","import { Type as T } from '@sinclair/typebox'\nimport { IObservableArray } from 'mobx'\n// import { Thread } from '../thread/basic'\n\n// ! circular import\n// export const ThreadTB = TypeSystem.Type<Thread>('Thread', (options, value) => {\n// \treturn value instanceof Thread\n// })()\nconst { String: StringTB, Optional: OptionalTB, Boolean: BooleanTB, Object: ObjectTB, Number: NumberTB } = T\nexport const Str: typeof StringTB = StringTB.bind(T)\nexport const Num: typeof NumberTB = NumberTB.bind(T)\nexport const Obj: typeof ObjectTB = ObjectTB.bind(T)\nexport const Opt: typeof OptionalTB = OptionalTB.bind(T)\nexport const Bool: typeof BooleanTB = BooleanTB.bind(T)\n\nexport const STR: ReturnType<typeof T.String> = Str()\nexport const NUM: ReturnType<typeof T.Number> = Num()\nexport const BOOL: ReturnType<typeof T.Boolean> = Bool()\n\nexport type GenericObject = Record<string, any>\nexport type Omit<T, K extends keyof T> = Pick<T, Exclude<keyof T, K>>\nexport type PartialBy<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>\nexport type PromiseType<T extends Promise<any>> = T extends Promise<infer U> ? U : never\n\nexport type CoerceToString<T> = T extends string ? T : never\n\n/**\n * Define nominal type of U based on type of T. Similar to Opaque types in Flow\n */\nexport type Tagged<T, Tag> = T & { tag?: Tag }\n\n// export interface Service {\n// \tendpoint?: URL\n// \ttoken: string\n// \trateLimiter?: RateLimiter\n// \tfetch?: typeof _fetch\n// }\n\n// https://stackoverflow.com/a/76276541\nexport type LastElementOf<T extends readonly unknown[]> = T extends readonly [...unknown[], infer Last] ? Last : never\n\nexport function checkParityTB() {\n\t/* Most examples are constantly calling Type.*() - needed to check if its really needed\n https://github.com/sinclairzx81/typebox/issues/587#issuecomment-1712457623\n */\n\tconst s1 = Str()\n\tconst s2 = Str()\n\tconst n1 = Num()\n\tconst n2 = Num()\n\tconsole.log({ s1, s2, n1, n2 })\n}\n\n/** solidjs Setter requires returning something, which I often don't */\nexport type GenericSetter<T> = (newValue: T) => void\n\nexport type ArrayOrSingle<T> = T | T[] | readonly T[]\nexport function arrayIfSingle<T>(arrOrSingle: ArrayOrSingle<T>): readonly T[] {\n\tif (Array.isArray(arrOrSingle)) return arrOrSingle\n\telse return [arrOrSingle] as readonly T[]\n}\nexport type ArrayType<T> = T extends (infer U)[] ? U : T\nexport type ArrayElementType<T> = T extends readonly (infer U)[] ? Extract<U, string> : never\nexport type X<T> = ArrayType<IObservableArray<T>>\nexport type ReadonlyObservableArray<T> = ReadonlyArray<T>\nexport type ReadonlyObservableSet<T> = ReadonlySet<T>\nexport type ConstructorType<T, S = {}> = {\n\tnew(...args: any[]): T\n} & S\n","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\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\nvar isBrowser = typeof window !== \"undefined\" && typeof window.document !== \"undefined\";\n\nvar isNode = typeof process !== \"undefined\" && process.versions != null && process.versions.node != null;\n\nvar isWebWorker = (typeof self === \"undefined\" ? \"undefined\" : _typeof(self)) === \"object\" && self.constructor && self.constructor.name === \"DedicatedWorkerGlobalScope\";\n\n/**\n * @see https://github.com/jsdom/jsdom/releases/tag/12.0.0\n * @see https://github.com/jsdom/jsdom/issues/1537\n */\nvar isJsDom = typeof window !== \"undefined\" && window.name === \"nodejs\" || typeof navigator !== \"undefined\" && (navigator.userAgent.includes(\"Node.js\") || navigator.userAgent.includes(\"jsdom\"));\n\nvar isDeno = typeof Deno !== \"undefined\" && typeof Deno.version !== \"undefined\" && typeof Deno.version.deno !== \"undefined\";\n\nexports.isBrowser = isBrowser;\nexports.isWebWorker = isWebWorker;\nexports.isNode = isNode;\nexports.isJsDom = isJsDom;\nexports.isDeno = isDeno;","'use strict';\n\nmodule.exports = function (data, opts) {\n if (!opts) opts = {};\n if (typeof opts === 'function') opts = { cmp: opts };\n var cycles = (typeof opts.cycles === 'boolean') ? opts.cycles : false;\n\n var cmp = opts.cmp && (function (f) {\n return function (node) {\n return function (a, b) {\n var aobj = { key: a, value: node[a] };\n var bobj = { key: b, value: node[b] };\n return f(aobj, bobj);\n };\n };\n })(opts.cmp);\n\n var seen = [];\n return (function stringify (node) {\n if (node && node.toJSON && typeof node.toJSON === 'function') {\n node = node.toJSON();\n }\n\n if (node === undefined) return;\n if (typeof node == 'number') return isFinite(node) ? '' + node : 'null';\n if (typeof node !== 'object') return JSON.stringify(node);\n\n var i, out;\n if (Array.isArray(node)) {\n out = '[';\n for (i = 0; i < node.length; i++) {\n if (i) out += ',';\n out += stringify(node[i]) || 'null';\n }\n return out + ']';\n }\n\n if (node === null) return 'null';\n\n if (seen.indexOf(node) !== -1) {\n if (cycles) return JSON.stringify('__cycle__');\n throw new TypeError('Converting circular structure to JSON');\n }\n\n var seenIndex = seen.push(node) - 1;\n var keys = Object.keys(node).sort(cmp && cmp(node));\n out = '';\n for (i = 0; i < keys.length; i++) {\n var key = keys[i];\n var value = stringify(node[key]);\n\n if (!value) continue;\n if (out) out += ',';\n out += JSON.stringify(key) + ':' + value;\n }\n seen.splice(seenIndex, 1);\n return '{' + out + '}';\n })(data);\n};\n","'use strict'\n\nconst { hasOwnProperty } = Object.prototype\n\nconst stringify = configure()\n\n// @ts-expect-error\nstringify.configure = configure\n// @ts-expect-error\nstringify.stringify = stringify\n\n// @ts-expect-error\nstringify.default = stringify\n\n// @ts-expect-error used for named export\nexports.stringify = stringify\n// @ts-expect-error used for named export\nexports.configure = configure\n\nmodule.exports = stringify\n\n// eslint-disable-next-line no-control-regex\nconst strEscapeSequencesRegExp = /[\\u0000-\\u001f\\u0022\\u005c\\ud800-\\udfff]|[\\ud800-\\udbff](?![\\udc00-\\udfff])|(?:[^\\ud800-\\udbff]|^)[\\udc00-\\udfff]/\n\n// Escape C0 control characters, double quotes, the backslash and every code\n// unit with a numeric value in the inclusive range 0xD800 to 0xDFFF.\nfunction strEscape (str) {\n // Some magic numbers that worked out fine while benchmarking with v8 8.0\n if (str.length < 5000 && !strEscapeSequencesRegExp.test(str)) {\n return `\"${str}\"`\n }\n return JSON.stringify(str)\n}\n\nfunction insertSort (array) {\n // Insertion sort is very efficient for small input sizes but it has a bad\n // worst case complexity. Thus, use native array sort for bigger values.\n if (array.length > 2e2) {\n return array.sort()\n }\n for (let i = 1; i < array.length; i++) {\n const currentValue = array[i]\n let position = i\n while (position !== 0 && array[position - 1] > currentValue) {\n array[position] = array[position - 1]\n position--\n }\n array[position] = currentValue\n }\n return array\n}\n\nconst typedArrayPrototypeGetSymbolToStringTag =\n Object.getOwnPropertyDescriptor(\n Object.getPrototypeOf(\n Object.getPrototypeOf(\n new Int8Array()\n )\n ),\n Symbol.toStringTag\n ).get\n\nfunction isTypedArrayWithEntries (value) {\n return typedArrayPrototypeGetSymbolToStringTag.call(value) !== undefined && value.length !== 0\n}\n\nfunction stringifyTypedArray (array, separator, maximumBreadth) {\n if (array.length < maximumBreadth) {\n maximumBreadth = array.length\n }\n const whitespace = separator === ',' ? '' : ' '\n let res = `\"0\":${whitespace}${array[0]}`\n for (let i = 1; i < maximumBreadth; i++) {\n res += `${separator}\"${i}\":${whitespace}${array[i]}`\n }\n return res\n}\n\nfunction getCircularValueOption (options) {\n if (hasOwnProperty.call(options, 'circularValue')) {\n const circularValue = options.circularValue\n if (typeof circularValue === 'string') {\n return `\"${circularValue}\"`\n }\n if (circularValue == null) {\n return circularValue\n }\n if (circularValue === Error || circularValue === TypeError) {\n return {\n toString () {\n throw new TypeError('Converting circular structure to JSON')\n }\n }\n }\n throw new TypeError('The \"circularValue\" argument must be of type string or the value null or undefined')\n }\n return '\"[Circular]\"'\n}\n\nfunction getBooleanOption (options, key) {\n let value\n if (hasOwnProperty.call(options, key)) {\n value = options[key]\n if (typeof value !== 'boolean') {\n throw new TypeError(`The \"${key}\" argument must be of type boolean`)\n }\n }\n return value === undefined ? true : value\n}\n\nfunction getPositiveIntegerOption (options, key) {\n let value\n if (hasOwnProperty.call(options, key)) {\n value = options[key]\n if (typeof value !== 'number') {\n throw new TypeError(`The \"${key}\" argument must be of type number`)\n }\n if (!Number.isInteger(value)) {\n throw new TypeError(`The \"${key}\" argument must be an integer`)\n }\n if (value < 1) {\n throw new RangeError(`The \"${key}\" argument must be >= 1`)\n }\n }\n return value === undefined ? Infinity : value\n}\n\nfunction getItemCount (number) {\n if (number === 1) {\n return '1 item'\n }\n return `${number} items`\n}\n\nfunction getUniqueReplacerSet (replacerArray) {\n const replacerSet = new Set()\n for (const value of replacerArray) {\n if (typeof value === 'string' || typeof value === 'number') {\n replacerSet.add(String(value))\n }\n }\n return replacerSet\n}\n\nfunction getStrictOption (options) {\n if (hasOwnProperty.call(options, 'strict')) {\n const value = options.strict\n if (typeof value !== 'boolean') {\n throw new TypeError('The \"strict\" argument must be of type boolean')\n }\n if (value) {\n return (value) => {\n let message = `Object can not safely be stringified. Received type ${typeof value}`\n if (typeof value !== 'function') message += ` (${value.toString()})`\n throw new Error(message)\n }\n }\n }\n}\n\nfunction configure (options) {\n options = { ...options }\n const fail = getStrictOption(options)\n if (fail) {\n if (options.bigint === undefined) {\n options.bigint = false\n }\n if (!('circularValue' in options)) {\n options.circularValue = Error\n }\n }\n const circularValue = getCircularValueOption(options)\n const bigint = getBooleanOption(options, 'bigint')\n const deterministic = getBooleanOption(options, 'deterministic')\n const maximumDepth = getPositiveIntegerOption(options, 'maximumDepth')\n const maximumBreadth = getPositiveIntegerOption(options, 'maximumBreadth')\n\n function stringifyFnReplacer (key, parent, stack, replacer, spacer, indentation) {\n let value = parent[key]\n\n if (typeof value === 'object' && value !== null && typeof value.toJSON === 'function') {\n value = value.toJSON(key)\n }\n value = replacer.call(parent, key, value)\n\n switch (typeof value) {\n case 'string':\n return strEscape(value)\n case 'object': {\n if (value === null) {\n return 'null'\n }\n if (stack.indexOf(value) !== -1) {\n return circularValue\n }\n\n let res = ''\n let join = ','\n const originalIndentation = indentation\n\n if (Array.isArray(value)) {\n if (value.length === 0) {\n return '[]'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Array]\"'\n }\n stack.push(value)\n if (spacer !== '') {\n indentation += spacer\n res += `\\n${indentation}`\n join = `,\\n${indentation}`\n }\n const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n let i = 0\n for (; i < maximumValuesToStringify - 1; i++) {\n const tmp = stringifyFnReplacer(String(i), value, stack, replacer, spacer, indentation)\n res += tmp !== undefined ? tmp : 'null'\n res += join\n }\n const tmp = stringifyFnReplacer(String(i), value, stack, replacer, spacer, indentation)\n res += tmp !== undefined ? tmp : 'null'\n if (value.length - 1 > maximumBreadth) {\n const removedKeys = value.length - maximumBreadth - 1\n res += `${join}\"... ${getItemCount(removedKeys)} not stringified\"`\n }\n if (spacer !== '') {\n res += `\\n${originalIndentation}`\n }\n stack.pop()\n return `[${res}]`\n }\n\n let keys = Object.keys(value)\n const keyLength = keys.length\n if (keyLength === 0) {\n return '{}'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Object]\"'\n }\n let whitespace = ''\n let separator = ''\n if (spacer !== '') {\n indentation += spacer\n join = `,\\n${indentation}`\n whitespace = ' '\n }\n const maximumPropertiesToStringify = Math.min(keyLength, maximumBreadth)\n if (deterministic && !isTypedArrayWithEntries(value)) {\n keys = insertSort(keys)\n }\n stack.push(value)\n for (let i = 0; i < maximumPropertiesToStringify; i++) {\n const key = keys[i]\n const tmp = stringifyFnReplacer(key, value, stack, replacer, spacer, indentation)\n if (tmp !== undefined) {\n res += `${separator}${strEscape(key)}:${whitespace}${tmp}`\n separator = join\n }\n }\n if (keyLength > maximumBreadth) {\n const removedKeys = keyLength - maximumBreadth\n res += `${separator}\"...\":${whitespace}\"${getItemCount(removedKeys)} not stringified\"`\n separator = join\n }\n if (spacer !== '' && separator.length > 1) {\n res = `\\n${indentation}${res}\\n${originalIndentation}`\n }\n stack.pop()\n return `{${res}}`\n }\n case 'number':\n return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n case 'boolean':\n return value === true ? 'true' : 'false'\n case 'undefined':\n return undefined\n case 'bigint':\n if (bigint) {\n return String(value)\n }\n // fallthrough\n default:\n return fail ? fail(value) : undefined\n }\n }\n\n function stringifyArrayReplacer (key, value, stack, replacer, spacer, indentation) {\n if (typeof value === 'object' && value !== null && typeof value.toJSON === 'function') {\n value = value.toJSON(key)\n }\n\n switch (typeof value) {\n case 'string':\n return strEscape(value)\n case 'object': {\n if (value === null) {\n return 'null'\n }\n if (stack.indexOf(value) !== -1) {\n return circularValue\n }\n\n const originalIndentation = indentation\n let res = ''\n let join = ','\n\n if (Array.isArray(value)) {\n if (value.length === 0) {\n return '[]'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Array]\"'\n }\n stack.push(value)\n if (spacer !== '') {\n indentation += spacer\n res += `\\n${indentation}`\n join = `,\\n${indentation}`\n }\n const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n let i = 0\n for (; i < maximumValuesToStringify - 1; i++) {\n const tmp = stringifyArrayReplacer(String(i), value[i], stack, replacer, spacer, indentation)\n res += tmp !== undefined ? tmp : 'null'\n res += join\n }\n const tmp = stringifyArrayReplacer(String(i), value[i], stack, replacer, spacer, indentation)\n res += tmp !== undefined ? tmp : 'null'\n if (value.length - 1 > maximumBreadth) {\n const removedKeys = value.length - maximumBreadth - 1\n res += `${join}\"... ${getItemCount(removedKeys)} not stringified\"`\n }\n if (spacer !== '') {\n res += `\\n${originalIndentation}`\n }\n stack.pop()\n return `[${res}]`\n }\n stack.push(value)\n let whitespace = ''\n if (spacer !== '') {\n indentation += spacer\n join = `,\\n${indentation}`\n whitespace = ' '\n }\n let separator = ''\n for (const key of replacer) {\n const tmp = stringifyArrayReplacer(key, value[key], stack, replacer, spacer, indentation)\n if (tmp !== undefined) {\n res += `${separator}${strEscape(key)}:${whitespace}${tmp}`\n separator = join\n }\n }\n if (spacer !== '' && separator.length > 1) {\n res = `\\n${indentation}${res}\\n${originalIndentation}`\n }\n stack.pop()\n return `{${res}}`\n }\n case 'number':\n return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n case 'boolean':\n return value === true ? 'true' : 'false'\n case 'undefined':\n return undefined\n case 'bigint':\n if (bigint) {\n return String(value)\n }\n // fallthrough\n default:\n return fail ? fail(value) : undefined\n }\n }\n\n function stringifyIndent (key, value, stack, spacer, indentation) {\n switch (typeof value) {\n case 'string':\n return strEscape(value)\n case 'object': {\n if (value === null) {\n return 'null'\n }\n if (typeof value.toJSON === 'function') {\n value = value.toJSON(key)\n // Prevent calling `toJSON` again.\n if (typeof value !== 'object') {\n return stringifyIndent(key, value, stack, spacer, indentation)\n }\n if (value === null) {\n return 'null'\n }\n }\n if (stack.indexOf(value) !== -1) {\n return circularValue\n }\n const originalIndentation = indentation\n\n if (Array.isArray(value)) {\n if (value.length === 0) {\n return '[]'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Array]\"'\n }\n stack.push(value)\n indentation += spacer\n let res = `\\n${indentation}`\n const join = `,\\n${indentation}`\n const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n let i = 0\n for (; i < maximumValuesToStringify - 1; i++) {\n const tmp = stringifyIndent(String(i), value[i], stack, spacer, indentation)\n res += tmp !== undefined ? tmp : 'null'\n res += join\n }\n const tmp = stringifyIndent(String(i), value[i], stack, spacer, indentation)\n res += tmp !== undefined ? tmp : 'null'\n if (value.length - 1 > maximumBreadth) {\n const removedKeys = value.length - maximumBreadth - 1\n res += `${join}\"... ${getItemCount(removedKeys)} not stringified\"`\n }\n res += `\\n${originalIndentation}`\n stack.pop()\n return `[${res}]`\n }\n\n let keys = Object.keys(value)\n const keyLength = keys.length\n if (keyLength === 0) {\n return '{}'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Object]\"'\n }\n indentation += spacer\n const join = `,\\n${indentation}`\n let res = ''\n let separator = ''\n let maximumPropertiesToStringify = Math.min(keyLength, maximumBreadth)\n if (isTypedArrayWithEntries(value)) {\n res += stringifyTypedArray(value, join, maximumBreadth)\n keys = keys.slice(value.length)\n maximumPropertiesToStringify -= value.length\n separator = join\n }\n if (deterministic) {\n keys = insertSort(keys)\n }\n stack.push(value)\n for (let i = 0; i < maximumPropertiesToStringify; i++) {\n const key = keys[i]\n const tmp = stringifyIndent(key, value[key], stack, spacer, indentation)\n if (tmp !== undefined) {\n res += `${separator}${strEscape(key)}: ${tmp}`\n separator = join\n }\n }\n if (keyLength > maximumBreadth) {\n const removedKeys = keyLength - maximumBreadth\n res += `${separator}\"...\": \"${getItemCount(removedKeys)} not stringified\"`\n separator = join\n }\n if (separator !== '') {\n res = `\\n${indentation}${res}\\n${originalIndentation}`\n }\n stack.pop()\n return `{${res}}`\n }\n case 'number':\n return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n case 'boolean':\n return value === true ? 'true' : 'false'\n case 'undefined':\n return undefined\n case 'bigint':\n if (bigint) {\n return String(value)\n }\n // fallthrough\n default:\n return fail ? fail(value) : undefined\n }\n }\n\n function stringifySimple (key, value, stack) {\n switch (typeof value) {\n case 'string':\n return strEscape(value)\n case 'object': {\n if (value === null) {\n return 'null'\n }\n if (typeof value.toJSON === 'function') {\n value = value.toJSON(key)\n // Prevent calling `toJSON` again\n if (typeof value !== 'object') {\n return stringifySimple(key, value, stack)\n }\n if (value === null) {\n return 'null'\n }\n }\n if (stack.indexOf(value) !== -1) {\n return circularValue\n }\n\n let res = ''\n\n if (Array.isArray(value)) {\n if (value.length === 0) {\n return '[]'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Array]\"'\n }\n stack.push(value)\n const maximumValuesToStringify = Math.min(value.length, maximumBreadth)\n let i = 0\n for (; i < maximumValuesToStringify - 1; i++) {\n const tmp = stringifySimple(String(i), value[i], stack)\n res += tmp !== undefined ? tmp : 'null'\n res += ','\n }\n const tmp = stringifySimple(String(i), value[i], stack)\n res += tmp !== undefined ? tmp : 'null'\n if (value.length - 1 > maximumBreadth) {\n const removedKeys = value.length - maximumBreadth - 1\n res += `,\"... ${getItemCount(removedKeys)} not stringified\"`\n }\n stack.pop()\n return `[${res}]`\n }\n\n let keys = Object.keys(value)\n const keyLength = keys.length\n if (keyLength === 0) {\n return '{}'\n }\n if (maximumDepth < stack.length + 1) {\n return '\"[Object]\"'\n }\n let separator = ''\n let maximumPropertiesToStringify = Math.min(keyLength, maximumBreadth)\n if (isTypedArrayWithEntries(value)) {\n res += stringifyTypedArray(value, ',', maximumBreadth)\n keys = keys.slice(value.length)\n maximumPropertiesToStringify -= value.length\n separator = ','\n }\n if (deterministic) {\n keys = insertSort(keys)\n }\n stack.push(value)\n for (let i = 0; i < maximumPropertiesToStringify; i++) {\n const key = keys[i]\n const tmp = stringifySimple(key, value[key], stack)\n if (tmp !== undefined) {\n res += `${separator}${strEscape(key)}:${tmp}`\n separator = ','\n }\n }\n if (keyLength > maximumBreadth) {\n const removedKeys = keyLength - maximumBreadth\n res += `${separator}\"...\":\"${getItemCount(removedKeys)} not stringified\"`\n }\n stack.pop()\n return `{${res}}`\n }\n case 'number':\n return isFinite(value) ? String(value) : fail ? fail(value) : 'null'\n case 'boolean':\n return value === true ? 'true' : 'false'\n case 'undefined':\n return undefined\n case 'bigint':\n if (bigint) {\n return String(value)\n }\n // fallthrough\n default:\n return fail ? fail(value) : undefined\n }\n }\n\n function stringify (value, replacer, space) {\n if (arguments.length > 1) {\n let spacer = ''\n if (typeof space === 'number') {\n spacer = ' '.repeat(Math.min(space, 10))\n } else if (typeof space === 'string') {\n spacer = space.slice(0, 10)\n }\n if (replacer != null) {\n if (typeof replacer === 'function') {\n return stringifyFnReplacer('', { '': value }, [], replacer, spacer, '')\n }\n if (Array.isArray(replacer)) {\n return stringifyArrayReplacer('', value, [], getUniqueReplacerSet(replacer), spacer, '')\n }\n }\n if (spacer.length !== 0) {\n return stringifyIndent('', value, [], spacer, '')\n }\n }\n return stringifySimple('', value, [])\n }\n\n return stringify\n}\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/value\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.IsValueType = exports.IsSymbol = exports.IsFunction = exports.IsString = exports.IsBigInt = exports.IsInteger = exports.IsNumber = exports.IsBoolean = exports.IsNull = exports.IsUndefined = exports.IsArray = exports.IsObject = exports.IsPlainObject = exports.HasPropertyKey = exports.IsDate = exports.IsUint8Array = exports.IsPromise = exports.IsTypedArray = exports.IsIterator = exports.IsAsyncIterator = void 0;\n// --------------------------------------------------------------------------\n// Iterators\n// --------------------------------------------------------------------------\n/** Returns true if this value is an async iterator */\nfunction IsAsyncIterator(value) {\n return IsObject(value) && Symbol.asyncIterator in value;\n}\nexports.IsAsyncIterator = IsAsyncIterator;\n/** Returns true if this value is an iterator */\nfunction IsIterator(value) {\n return IsObject(value) && Symbol.iterator in value;\n}\nexports.IsIterator = IsIterator;\n// --------------------------------------------------------------------------\n// Nominal\n// --------------------------------------------------------------------------\n/** Returns true if this value is a typed array */\nfunction IsTypedArray(value) {\n return ArrayBuffer.isView(value);\n}\nexports.IsTypedArray = IsTypedArray;\n/** Returns true if this value is a Promise */\nfunction IsPromise(value) {\n return value instanceof Promise;\n}\nexports.IsPromise = IsPromise;\n/** Returns true if the value is a Uint8Array */\nfunction IsUint8Array(value) {\n return value instanceof Uint8Array;\n}\nexports.IsUint8Array = IsUint8Array;\n/** Returns true if this value is a Date */\nfunction IsDate(value) {\n return value instanceof Date && Number.isFinite(value.getTime());\n}\nexports.IsDate = IsDate;\n// --------------------------------------------------------------------------\n// Standard\n// --------------------------------------------------------------------------\n/** Returns true if this value has this property key */\nfunction HasPropertyKey(value, key) {\n return key in value;\n}\nexports.HasPropertyKey = HasPropertyKey;\n/** Returns true if this object is not an instance of any other type */\nfunction IsPlainObject(value) {\n return IsObject(value) && IsFunction(value.constructor) && value.constructor.name === 'Object';\n}\nexports.IsPlainObject = IsPlainObject;\n/** Returns true of this value is an object type */\nfunction IsObject(value) {\n return value !== null && typeof value === 'object';\n}\nexports.IsObject = IsObject;\n/** Returns true if this value is an array, but not a typed array */\nfunction IsArray(value) {\n return Array.isArray(value) && !ArrayBuffer.isView(value);\n}\nexports.IsArray = IsArray;\n/** Returns true if this value is an undefined */\nfunction IsUndefined(value) {\n return value === undefined;\n}\nexports.IsUndefined = IsUndefined;\n/** Returns true if this value is an null */\nfunction IsNull(value) {\n return value === null;\n}\nexports.IsNull = IsNull;\n/** Returns true if this value is an boolean */\nfunction IsBoolean(value) {\n return typeof value === 'boolean';\n}\nexports.IsBoolean = IsBoolean;\n/** Returns true if this value is an number */\nfunction IsNumber(value) {\n return typeof value === 'number';\n}\nexports.IsNumber = IsNumber;\n/** Returns true if this value is an integer */\nfunction IsInteger(value) {\n return IsNumber(value) && Number.isInteger(value);\n}\nexports.IsInteger = IsInteger;\n/** Returns true if this value is bigint */\nfunction IsBigInt(value) {\n return typeof value === 'bigint';\n}\nexports.IsBigInt = IsBigInt;\n/** Returns true if this value is string */\nfunction IsString(value) {\n return typeof value === 'string';\n}\nexports.IsString = IsString;\n/** Returns true if this value is a function */\nfunction IsFunction(value) {\n return typeof value === 'function';\n}\nexports.IsFunction = IsFunction;\n/** Returns true if this value is a symbol */\nfunction IsSymbol(value) {\n return typeof value === 'symbol';\n}\nexports.IsSymbol = IsSymbol;\n/** Returns true if this value is a value type such as number, string, boolean */\nfunction IsValueType(value) {\n // prettier-ignore\n return (IsBigInt(value) ||\n IsBoolean(value) ||\n IsNull(value) ||\n IsNumber(value) ||\n IsString(value) ||\n IsSymbol(value) ||\n IsUndefined(value));\n}\nexports.IsValueType = IsValueType;\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/system\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.DefaultErrorFunction = exports.TypeSystemPolicy = exports.TypeSystemErrorFunction = exports.TypeSystem = exports.TypeSystemDuplicateFormat = exports.TypeSystemDuplicateTypeKind = void 0;\nconst guard_1 = require(\"../value/guard\");\nconst errors_1 = require(\"../errors/errors\");\nconst Types = require(\"../typebox\");\n// --------------------------------------------------------------------------\n// Errors\n// --------------------------------------------------------------------------\nclass TypeSystemDuplicateTypeKind extends Types.TypeBoxError {\n constructor(kind) {\n super(`Duplicate type kind '${kind}' detected`);\n }\n}\nexports.TypeSystemDuplicateTypeKind = TypeSystemDuplicateTypeKind;\nclass TypeSystemDuplicateFormat extends Types.TypeBoxError {\n constructor(kind) {\n super(`Duplicate string format '${kind}' detected`);\n }\n}\nexports.TypeSystemDuplicateFormat = TypeSystemDuplicateFormat;\n// -------------------------------------------------------------------------------------------\n// TypeSystem\n// -------------------------------------------------------------------------------------------\n/** Creates user defined types and formats and provides overrides for value checking behaviours */\nvar TypeSystem;\n(function (TypeSystem) {\n /** Creates a new type */\n function Type(kind, check) {\n if (Types.TypeRegistry.Has(kind))\n throw new TypeSystemDuplicateTypeKind(kind);\n Types.TypeRegistry.Set(kind, check);\n return (options = {}) => Types.Type.Unsafe({ ...options, [Types.Kind]: kind });\n }\n TypeSystem.Type = Type;\n /** Creates a new string format */\n function Format(format, check) {\n if (Types.FormatRegistry.Has(format))\n throw new TypeSystemDuplicateFormat(format);\n Types.FormatRegistry.Set(format, check);\n return format;\n }\n TypeSystem.Format = Format;\n})(TypeSystem || (exports.TypeSystem = TypeSystem = {}));\n// --------------------------------------------------------------------------\n// TypeSystemErrorFunction\n// --------------------------------------------------------------------------\n/** Manages error message providers */\nvar TypeSystemErrorFunction;\n(function (TypeSystemErrorFunction) {\n let errorMessageFunction = DefaultErrorFunction;\n /** Resets the error message function to en-us */\n function Reset() {\n errorMessageFunction = DefaultErrorFunction;\n }\n TypeSystemErrorFunction.Reset = Reset;\n /** Sets the error message function used to generate error messages */\n function Set(callback) {\n errorMessageFunction = callback;\n }\n TypeSystemErrorFunction.Set = Set;\n /** Gets the error message function */\n function Get() {\n return errorMessageFunction;\n }\n TypeSystemErrorFunction.Get = Get;\n})(TypeSystemErrorFunction || (exports.TypeSystemErrorFunction = TypeSystemErrorFunction = {}));\n// --------------------------------------------------------------------------\n// TypeSystemPolicy\n// --------------------------------------------------------------------------\n/** Shared assertion routines used by the value and errors modules */\nvar TypeSystemPolicy;\n(function (TypeSystemPolicy) {\n /** Sets whether TypeBox should assert optional properties using the TypeScript `exactOptionalPropertyTypes` assertion policy. The default is `false` */\n TypeSystemPolicy.ExactOptionalPropertyTypes = false;\n /** Sets whether arrays should be treated as a kind of objects. The default is `false` */\n TypeSystemPolicy.AllowArrayObject = false;\n /** Sets whether `NaN` or `Infinity` should be treated as valid numeric values. The default is `false` */\n TypeSystemPolicy.AllowNaN = false;\n /** Sets whether `null` should validate for void types. The default is `false` */\n TypeSystemPolicy.AllowNullVoid = false;\n /** Asserts this value using the ExactOptionalPropertyTypes policy */\n function IsExactOptionalProperty(value, key) {\n return TypeSystemPolicy.ExactOptionalPropertyTypes ? key in value : value[key] !== undefined;\n }\n TypeSystemPolicy.IsExactOptionalProperty = IsExactOptionalProperty;\n /** Asserts this value using the AllowArrayObjects policy */\n function IsObjectLike(value) {\n const isObject = (0, guard_1.IsObject)(value);\n return TypeSystemPolicy.AllowArrayObject ? isObject : isObject && !(0, guard_1.IsArray)(value);\n }\n TypeSystemPolicy.IsObjectLike = IsObjectLike;\n /** Asserts this value as a record using the AllowArrayObjects policy */\n function IsRecordLike(value) {\n return IsObjectLike(value) && !(value instanceof Date) && !(value instanceof Uint8Array);\n }\n TypeSystemPolicy.IsRecordLike = IsRecordLike;\n /** Asserts this value using the AllowNaN policy */\n function IsNumberLike(value) {\n const isNumber = (0, guard_1.IsNumber)(value);\n return TypeSystemPolicy.AllowNaN ? isNumber : isNumber && Number.isFinite(value);\n }\n TypeSystemPolicy.IsNumberLike = IsNumberLike;\n /** Asserts this value using the AllowVoidNull policy */\n function IsVoidLike(value) {\n const isUndefined = (0, guard_1.IsUndefined)(value);\n return TypeSystemPolicy.AllowNullVoid ? isUndefined || value === null : isUndefined;\n }\n TypeSystemPolicy.IsVoidLike = IsVoidLike;\n})(TypeSystemPolicy || (exports.TypeSystemPolicy = TypeSystemPolicy = {}));\n// --------------------------------------------------------------------------\n// DefaultErrorFunction\n// --------------------------------------------------------------------------\n/** Creates an error message using en-US as the default locale */\nfunction DefaultErrorFunction(schema, errorType) {\n switch (errorType) {\n case errors_1.ValueErrorType.ArrayContains:\n return 'Expected array to contain at least one matching value';\n case errors_1.ValueErrorType.ArrayMaxContains:\n return `Expected array to contain no more than ${schema.maxContains} matching values`;\n case errors_1.ValueErrorType.ArrayMinContains:\n return `Expected array to contain at least ${schema.minContains} matching values`;\n case errors_1.ValueErrorType.ArrayMaxItems:\n return `Expected array length to be less or equal to ${schema.maxItems}`;\n case errors_1.ValueErrorType.ArrayMinItems:\n return `Expected array length to be greater or equal to ${schema.minItems}`;\n case errors_1.ValueErrorType.ArrayUniqueItems:\n return 'Expected array elements to be unique';\n case errors_1.ValueErrorType.Array:\n return 'Expected array';\n case errors_1.ValueErrorType.AsyncIterator:\n return 'Expected AsyncIterator';\n case errors_1.ValueErrorType.BigIntExclusiveMaximum:\n return `Expected bigint to be less than ${schema.exclusiveMaximum}`;\n case errors_1.ValueErrorType.BigIntExclusiveMinimum:\n return `Expected bigint to be greater than ${schema.exclusiveMinimum}`;\n case errors_1.ValueErrorType.BigIntMaximum:\n return `Expected bigint to be less or equal to ${schema.maximum}`;\n case errors_1.ValueErrorType.BigIntMinimum:\n return `Expected bigint to be greater or equal to ${schema.minimum}`;\n case errors_1.ValueErrorType.BigIntMultipleOf:\n return `Expected bigint to be a multiple of ${schema.multipleOf}`;\n case errors_1.ValueErrorType.BigInt:\n return 'Expected bigint';\n case errors_1.ValueErrorType.Boolean:\n return 'Expected boolean';\n case errors_1.ValueErrorType.DateExclusiveMinimumTimestamp:\n return `Expected Date timestamp to be greater than ${schema.exclusiveMinimumTimestamp}`;\n case errors_1.ValueErrorType.DateExclusiveMaximumTimestamp:\n return `Expected Date timestamp to be less than ${schema.exclusiveMaximumTimestamp}`;\n case errors_1.ValueErrorType.DateMinimumTimestamp:\n return `Expected Date timestamp to be greater or equal to ${schema.minimumTimestamp}`;\n case errors_1.ValueErrorType.DateMaximumTimestamp:\n return `Expected Date timestamp to be less or equal to ${schema.maximumTimestamp}`;\n case errors_1.ValueErrorType.DateMultipleOfTimestamp:\n return `Expected Date timestamp to be a multiple of ${schema.multipleOfTimestamp}`;\n case errors_1.ValueErrorType.Date:\n return 'Expected Date';\n case errors_1.ValueErrorType.Function:\n return 'Expected function';\n case errors_1.ValueErrorType.IntegerExclusiveMaximum:\n return `Expected integer to be less than ${schema.exclusiveMaximum}`;\n case errors_1.ValueErrorType.IntegerExclusiveMinimum:\n return `Expected integer to be greater than ${schema.exclusiveMinimum}`;\n case errors_1.ValueErrorType.IntegerMaximum:\n return `Expected integer to be less or equal to ${schema.maximum}`;\n case errors_1.ValueErrorType.IntegerMinimum:\n return `Expected integer to be greater or equal to ${schema.minimum}`;\n case errors_1.ValueErrorType.IntegerMultipleOf:\n return `Expected integer to be a multiple of ${schema.multipleOf}`;\n case errors_1.ValueErrorType.Integer:\n return 'Expected integer';\n case errors_1.ValueErrorType.IntersectUnevaluatedProperties:\n return 'Unexpected property';\n case errors_1.ValueErrorType.Intersect:\n return 'Expected all values to match';\n case errors_1.ValueErrorType.Iterator:\n return 'Expected Iterator';\n case errors_1.ValueErrorType.Literal:\n return `Expected ${typeof schema.const === 'string' ? `'${schema.const}'` : schema.const}`;\n case errors_1.ValueErrorType.Never:\n return 'Never';\n case errors_1.ValueErrorType.Not:\n return 'Value should not match';\n case errors_1.ValueErrorType.Null:\n return 'Expected null';\n case errors_1.ValueErrorType.NumberExclusiveMaximum:\n return `Expected number to be less than ${schema.exclusiveMaximum}`;\n case errors_1.ValueErrorType.NumberExclusiveMinimum:\n return `Expected number to be greater than ${schema.exclusiveMinimum}`;\n case errors_1.ValueErrorType.NumberMaximum:\n return `Expected number to be less or equal to ${schema.maximum}`;\n case errors_1.ValueErrorType.NumberMinimum:\n return `Expected number to be greater or equal to ${schema.minimum}`;\n case errors_1.ValueErrorType.NumberMultipleOf:\n return `Expected number to be a multiple of ${schema.multipleOf}`;\n case errors_1.ValueErrorType.Number:\n return 'Expected number';\n case errors_1.ValueErrorType.Object:\n return 'Expected object';\n case errors_1.ValueErrorType.ObjectAdditionalProperties:\n return 'Unexpected property';\n case errors_1.ValueErrorType.ObjectMaxProperties:\n return `Expected object to have no more than ${schema.maxProperties} properties`;\n case errors_1.ValueErrorType.ObjectMinProperties:\n return `Expected object to have at least ${schema.minProperties} properties`;\n case errors_1.ValueErrorType.ObjectRequiredProperty:\n return 'Required property';\n case errors_1.ValueErrorType.Promise:\n return 'Expected Promise';\n case errors_1.ValueErrorType.StringFormatUnknown:\n return `Unknown format '${schema.format}'`;\n case errors_1.ValueErrorType.StringFormat:\n return `Expected string to match '${schema.format}' format`;\n case errors_1.ValueErrorType.StringMaxLength:\n return `Expected string length less or equal to ${schema.maxLength}`;\n case errors_1.ValueErrorType.StringMinLength:\n return `Expected string length greater or equal to ${schema.minLength}`;\n case errors_1.ValueErrorType.StringPattern:\n return `Expected string to match '${schema.pattern}'`;\n case errors_1.ValueErrorType.String:\n return 'Expected string';\n case errors_1.ValueErrorType.Symbol:\n return 'Expected symbol';\n case errors_1.ValueErrorType.TupleLength:\n return `Expected tuple to have ${schema.maxItems || 0} elements`;\n case errors_1.ValueErrorType.Tuple:\n return 'Expected tuple';\n case errors_1.ValueErrorType.Uint8ArrayMaxByteLength:\n return `Expected byte length less or equal to ${schema.maxByteLength}`;\n case errors_1.ValueErrorType.Uint8ArrayMinByteLength:\n return `Expected byte length greater or equal to ${schema.minByteLength}`;\n case errors_1.ValueErrorType.Uint8Array:\n return 'Expected Uint8Array';\n case errors_1.ValueErrorType.Undefined:\n return 'Expected undefined';\n case errors_1.ValueErrorType.Union:\n return 'Expected union value';\n case errors_1.ValueErrorType.Void:\n return 'Expected void';\n case errors_1.ValueErrorType.Kind:\n return `Expected kind '${schema[Types.Kind]}'`;\n default:\n return 'Unknown error type';\n }\n}\nexports.DefaultErrorFunction = DefaultErrorFunction;\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/value\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Deref = exports.TypeDereferenceError = void 0;\nconst typebox_1 = require(\"../typebox\");\nclass TypeDereferenceError extends typebox_1.TypeBoxError {\n constructor(schema) {\n super(`Unable to dereference schema with $id '${schema.$id}'`);\n this.schema = schema;\n }\n}\nexports.TypeDereferenceError = TypeDereferenceError;\n/** Dereferences a schema from the references array or throws if not found */\nfunction Deref(schema, references) {\n const index = references.findIndex((target) => target.$id === schema.$ref);\n if (index === -1)\n throw new TypeDereferenceError(schema);\n return references[index];\n}\nexports.Deref = Deref;\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/value\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Hash = exports.ByteMarker = exports.ValueHashError = void 0;\nconst guard_1 = require(\"./guard\");\n// --------------------------------------------------------------------------\n// Errors\n// --------------------------------------------------------------------------\nclass ValueHashError extends Error {\n constructor(value) {\n super(`Unable to hash value`);\n this.value = value;\n }\n}\nexports.ValueHashError = ValueHashError;\n// --------------------------------------------------------------------------\n// ByteMarker\n// --------------------------------------------------------------------------\nvar ByteMarker;\n(function (ByteMarker) {\n ByteMarker[ByteMarker[\"Undefined\"] = 0] = \"Undefined\";\n ByteMarker[ByteMarker[\"Null\"] = 1] = \"Null\";\n ByteMarker[ByteMarker[\"Boolean\"] = 2] = \"Boolean\";\n ByteMarker[ByteMarker[\"Number\"] = 3] = \"Number\";\n ByteMarker[ByteMarker[\"String\"] = 4] = \"String\";\n ByteMarker[ByteMarker[\"Object\"] = 5] = \"Object\";\n ByteMarker[ByteMarker[\"Array\"] = 6] = \"Array\";\n ByteMarker[ByteMarker[\"Date\"] = 7] = \"Date\";\n ByteMarker[ByteMarker[\"Uint8Array\"] = 8] = \"Uint8Array\";\n ByteMarker[ByteMarker[\"Symbol\"] = 9] = \"Symbol\";\n ByteMarker[ByteMarker[\"BigInt\"] = 10] = \"BigInt\";\n})(ByteMarker || (exports.ByteMarker = ByteMarker = {}));\n// --------------------------------------------------------------------------\n// State\n// --------------------------------------------------------------------------\nlet Accumulator = BigInt('14695981039346656037');\nconst [Prime, Size] = [BigInt('1099511628211'), BigInt('2') ** BigInt('64')];\nconst Bytes = Array.from({ length: 256 }).map((_, i) => BigInt(i));\nconst F64 = new Float64Array(1);\nconst F64In = new DataView(F64.buffer);\nconst F64Out = new Uint8Array(F64.buffer);\n// --------------------------------------------------------------------------\n// NumberToBytes\n// --------------------------------------------------------------------------\nfunction* NumberToBytes(value) {\n const byteCount = value === 0 ? 1 : Math.ceil(Math.floor(Math.log2(value) + 1) / 8);\n for (let i = 0; i < byteCount; i++) {\n yield (value >> (8 * (byteCount - 1 - i))) & 0xff;\n }\n}\n// --------------------------------------------------------------------------\n// Hashing Functions\n// --------------------------------------------------------------------------\nfunction ArrayType(value) {\n FNV1A64(ByteMarker.Array);\n for (const item of value) {\n Visit(item);\n }\n}\nfunction BooleanType(value) {\n FNV1A64(ByteMarker.Boolean);\n FNV1A64(value ? 1 : 0);\n}\nfunction BigIntType(value) {\n FNV1A64(ByteMarker.BigInt);\n F64In.setBigInt64(0, value);\n for (const byte of F64Out) {\n FNV1A64(byte);\n }\n}\nfunction DateType(value) {\n FNV1A64(ByteMarker.Date);\n Visit(value.getTime());\n}\nfunction NullType(value) {\n FNV1A64(ByteMarker.Null);\n}\nfunction NumberType(value) {\n FNV1A64(ByteMarker.Number);\n F64In.setFloat64(0, value);\n for (const byte of F64Out) {\n FNV1A64(byte);\n }\n}\nfunction ObjectType(value) {\n FNV1A64(ByteMarker.Object);\n for (const key of globalThis.Object.keys(value).sort()) {\n Visit(key);\n Visit(value[key]);\n }\n}\nfunction StringType(value) {\n FNV1A64(ByteMarker.String);\n for (let i = 0; i < value.length; i++) {\n for (const byte of NumberToBytes(value.charCodeAt(i))) {\n FNV1A64(byte);\n }\n }\n}\nfunction SymbolType(value) {\n FNV1A64(ByteMarker.Symbol);\n Visit(value.description);\n}\nfunction Uint8ArrayType(value) {\n FNV1A64(ByteMarker.Uint8Array);\n for (let i = 0; i < value.length; i++) {\n FNV1A64(value[i]);\n }\n}\nfunction UndefinedType(value) {\n return FNV1A64(ByteMarker.Undefined);\n}\nfunction Visit(value) {\n if ((0, guard_1.IsArray)(value))\n return ArrayType(value);\n if ((0, guard_1.IsBoolean)(value))\n return BooleanType(value);\n if ((0, guard_1.IsBigInt)(value))\n return BigIntType(value);\n if ((0, guard_1.IsDate)(value))\n return DateType(value);\n if ((0, guard_1.IsNull)(value))\n return NullType(value);\n if ((0, guard_1.IsNumber)(value))\n return NumberType(value);\n if ((0, guard_1.IsPlainObject)(value))\n return ObjectType(value);\n if ((0, guard_1.IsString)(value))\n return StringType(value);\n if ((0, guard_1.IsSymbol)(value))\n return SymbolType(value);\n if ((0, guard_1.IsUint8Array)(value))\n return Uint8ArrayType(value);\n if ((0, guard_1.IsUndefined)(value))\n return UndefinedType(value);\n throw new ValueHashError(value);\n}\nfunction FNV1A64(byte) {\n Accumulator = Accumulator ^ Bytes[byte];\n Accumulator = (Accumulator * Prime) % Size;\n}\n// --------------------------------------------------------------------------\n// Hash\n// --------------------------------------------------------------------------\n/** Creates a FNV1A-64 non cryptographic hash of the given value */\nfunction Hash(value) {\n Accumulator = BigInt('14695981039346656037');\n Visit(value);\n return Accumulator;\n}\nexports.Hash = Hash;\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/errors\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Errors = exports.ValueErrorIterator = exports.EscapeKey = exports.ValueErrorsUnknownTypeError = exports.ValueErrorType = void 0;\nconst guard_1 = require(\"../value/guard\");\nconst system_1 = require(\"../system/system\");\nconst deref_1 = require(\"../value/deref\");\nconst hash_1 = require(\"../value/hash\");\nconst Types = require(\"../typebox\");\n// --------------------------------------------------------------------------\n// ValueErrorType\n// --------------------------------------------------------------------------\nvar ValueErrorType;\n(function (ValueErrorType) {\n ValueErrorType[ValueErrorType[\"ArrayContains\"] = 0] = \"ArrayContains\";\n ValueErrorType[ValueErrorType[\"ArrayMaxContains\"] = 1] = \"ArrayMaxContains\";\n ValueErrorType[ValueErrorType[\"ArrayMaxItems\"] = 2] = \"ArrayMaxItems\";\n ValueErrorType[ValueErrorType[\"ArrayMinContains\"] = 3] = \"ArrayMinContains\";\n ValueErrorType[ValueErrorType[\"ArrayMinItems\"] = 4] = \"ArrayMinItems\";\n ValueErrorType[ValueErrorType[\"ArrayUniqueItems\"] = 5] = \"ArrayUniqueItems\";\n ValueErrorType[ValueErrorType[\"Array\"] = 6] = \"Array\";\n ValueErrorType[ValueErrorType[\"AsyncIterator\"] = 7] = \"AsyncIterator\";\n ValueErrorType[ValueErrorType[\"BigIntExclusiveMaximum\"] = 8] = \"BigIntExclusiveMaximum\";\n ValueErrorType[ValueErrorType[\"BigIntExclusiveMinimum\"] = 9] = \"BigIntExclusiveMinimum\";\n ValueErrorType[ValueErrorType[\"BigIntMaximum\"] = 10] = \"BigIntMaximum\";\n ValueErrorType[ValueErrorType[\"BigIntMinimum\"] = 11] = \"BigIntMinimum\";\n ValueErrorType[ValueErrorType[\"BigIntMultipleOf\"] = 12] = \"BigIntMultipleOf\";\n ValueErrorType[ValueErrorType[\"BigInt\"] = 13] = \"BigInt\";\n ValueErrorType[ValueErrorType[\"Boolean\"] = 14] = \"Boolean\";\n ValueErrorType[ValueErrorType[\"DateExclusiveMaximumTimestamp\"] = 15] = \"DateExclusiveMaximumTimestamp\";\n ValueErrorType[ValueErrorType[\"DateExclusiveMinimumTimestamp\"] = 16] = \"DateExclusiveMinimumTimestamp\";\n ValueErrorType[ValueErrorType[\"DateMaximumTimestamp\"] = 17] = \"DateMaximumTimestamp\";\n ValueErrorType[ValueErrorType[\"DateMinimumTimestamp\"] = 18] = \"DateMinimumTimestamp\";\n ValueErrorType[ValueErrorType[\"DateMultipleOfTimestamp\"] = 19] = \"DateMultipleOfTimestamp\";\n ValueErrorType[ValueErrorType[\"Date\"] = 20] = \"Date\";\n ValueErrorType[ValueErrorType[\"Function\"] = 21] = \"Function\";\n ValueErrorType[ValueErrorType[\"IntegerExclusiveMaximum\"] = 22] = \"IntegerExclusiveMaximum\";\n ValueErrorType[ValueErrorType[\"IntegerExclusiveMinimum\"] = 23] = \"IntegerExclusiveMinimum\";\n ValueErrorType[ValueErrorType[\"IntegerMaximum\"] = 24] = \"IntegerMaximum\";\n ValueErrorType[ValueErrorType[\"IntegerMinimum\"] = 25] = \"IntegerMinimum\";\n ValueErrorType[ValueErrorType[\"IntegerMultipleOf\"] = 26] = \"IntegerMultipleOf\";\n ValueErrorType[ValueErrorType[\"Integer\"] = 27] = \"Integer\";\n ValueErrorType[ValueErrorType[\"IntersectUnevaluatedProperties\"] = 28] = \"IntersectUnevaluatedProperties\";\n ValueErrorType[ValueErrorType[\"Intersect\"] = 29] = \"Intersect\";\n ValueErrorType[ValueErrorType[\"Iterator\"] = 30] = \"Iterator\";\n ValueErrorType[ValueErrorType[\"Kind\"] = 31] = \"Kind\";\n ValueErrorType[ValueErrorType[\"Literal\"] = 32] = \"Literal\";\n ValueErrorType[ValueErrorType[\"Never\"] = 33] = \"Never\";\n ValueErrorType[ValueErrorType[\"Not\"] = 34] = \"Not\";\n ValueErrorType[ValueErrorType[\"Null\"] = 35] = \"Null\";\n ValueErrorType[ValueErrorType[\"NumberExclusiveMaximum\"] = 36] = \"NumberExclusiveMaximum\";\n ValueErrorType[ValueErrorType[\"NumberExclusiveMinimum\"] = 37] = \"NumberExclusiveMinimum\";\n ValueErrorType[ValueErrorType[\"NumberMaximum\"] = 38] = \"NumberMaximum\";\n ValueErrorType[ValueErrorType[\"NumberMinimum\"] = 39] = \"NumberMinimum\";\n ValueErrorType[ValueErrorType[\"NumberMultipleOf\"] = 40] = \"NumberMultipleOf\";\n ValueErrorType[ValueErrorType[\"Number\"] = 41] = \"Number\";\n ValueErrorType[ValueErrorType[\"ObjectAdditionalProperties\"] = 42] = \"ObjectAdditionalProperties\";\n ValueErrorType[ValueErrorType[\"ObjectMaxProperties\"] = 43] = \"ObjectMaxProperties\";\n ValueErrorType[ValueErrorType[\"ObjectMinProperties\"] = 44] = \"ObjectMinProperties\";\n ValueErrorType[ValueErrorType[\"ObjectRequiredProperty\"] = 45] = \"ObjectRequiredProperty\";\n ValueErrorType[ValueErrorType[\"Object\"] = 46] = \"Object\";\n ValueErrorType[ValueErrorType[\"Promise\"] = 47] = \"Promise\";\n ValueErrorType[ValueErrorType[\"StringFormatUnknown\"] = 48] = \"StringFormatUnknown\";\n ValueErrorType[ValueErrorType[\"StringFormat\"] = 49] = \"StringFormat\";\n ValueErrorType[ValueErrorType[\"StringMaxLength\"] = 50] = \"StringMaxLength\";\n ValueErrorType[ValueErrorType[\"StringMinLength\"] = 51] = \"StringMinLength\";\n ValueErrorType[ValueErrorType[\"StringPattern\"] = 52] = \"StringPattern\";\n ValueErrorType[ValueErrorType[\"String\"] = 53] = \"String\";\n ValueErrorType[ValueErrorType[\"Symbol\"] = 54] = \"Symbol\";\n ValueErrorType[ValueErrorType[\"TupleLength\"] = 55] = \"TupleLength\";\n ValueErrorType[ValueErrorType[\"Tuple\"] = 56] = \"Tuple\";\n ValueErrorType[ValueErrorType[\"Uint8ArrayMaxByteLength\"] = 57] = \"Uint8ArrayMaxByteLength\";\n ValueErrorType[ValueErrorType[\"Uint8ArrayMinByteLength\"] = 58] = \"Uint8ArrayMinByteLength\";\n ValueErrorType[ValueErrorType[\"Uint8Array\"] = 59] = \"Uint8Array\";\n ValueErrorType[ValueErrorType[\"Undefined\"] = 60] = \"Undefined\";\n ValueErrorType[ValueErrorType[\"Union\"] = 61] = \"Union\";\n ValueErrorType[ValueErrorType[\"Void\"] = 62] = \"Void\";\n})(ValueErrorType || (exports.ValueErrorType = ValueErrorType = {}));\n// --------------------------------------------------------------------------\n// ValueErrors\n// --------------------------------------------------------------------------\nclass ValueErrorsUnknownTypeError extends Types.TypeBoxError {\n constructor(schema) {\n super('Unknown type');\n this.schema = schema;\n }\n}\nexports.ValueErrorsUnknownTypeError = ValueErrorsUnknownTypeError;\n// --------------------------------------------------------------------------\n// EscapeKey\n// --------------------------------------------------------------------------\nfunction EscapeKey(key) {\n return key.replace(/~/g, '~0').replace(/\\//g, '~1'); // RFC6901 Path\n}\nexports.EscapeKey = EscapeKey;\n// --------------------------------------------------------------------------\n// Guards\n// --------------------------------------------------------------------------\nfunction IsDefined(value) {\n return value !== undefined;\n}\n// --------------------------------------------------------------------------\n// ValueErrorIterator\n// --------------------------------------------------------------------------\nclass ValueErrorIterator {\n constructor(iterator) {\n this.iterator = iterator;\n }\n [Symbol.iterator]() {\n return this.iterator;\n }\n /** Returns the first value error or undefined if no errors */\n First() {\n const next = this.iterator.next();\n return next.done ? undefined : next.value;\n }\n}\nexports.ValueErrorIterator = ValueErrorIterator;\n// --------------------------------------------------------------------------\n// Create\n// --------------------------------------------------------------------------\nfunction Create(type, schema, path, value) {\n return { type, schema, path, value, message: system_1.TypeSystemErrorFunction.Get()(schema, type) };\n}\n// --------------------------------------------------------------------------\n// Types\n// --------------------------------------------------------------------------\nfunction* TAny(schema, references, path, value) { }\nfunction* TArray(schema, references, path, value) {\n if (!(0, guard_1.IsArray)(value)) {\n return yield Create(ValueErrorType.Array, schema, path, value);\n }\n if (IsDefined(schema.minItems) && !(value.length >= schema.minItems)) {\n yield Create(ValueErrorType.ArrayMinItems, schema, path, value);\n }\n if (IsDefined(schema.maxItems) && !(value.length <= schema.maxItems)) {\n yield Create(ValueErrorType.ArrayMaxItems, schema, path, value);\n }\n for (let i = 0; i < value.length; i++) {\n yield* Visit(schema.items, references, `${path}/${i}`, value[i]);\n }\n // prettier-ignore\n if (schema.uniqueItems === true && !((function () { const set = new Set(); for (const element of value) {\n const hashed = (0, hash_1.Hash)(element);\n if (set.has(hashed)) {\n return false;\n }\n else {\n set.add(hashed);\n }\n } return true; })())) {\n yield Create(ValueErrorType.ArrayUniqueItems, schema, path, value);\n }\n // contains\n if (!(IsDefined(schema.contains) || IsDefined(schema.minContains) || IsDefined(schema.maxContains))) {\n return;\n }\n const containsSchema = IsDefined(schema.contains) ? schema.contains : Types.Type.Never();\n const containsCount = value.reduce((acc, value, index) => (Visit(containsSchema, references, `${path}${index}`, value).next().done === true ? acc + 1 : acc), 0);\n if (containsCount === 0) {\n yield Create(ValueErrorType.ArrayContains, schema, path, value);\n }\n if ((0, guard_1.IsNumber)(schema.minContains) && containsCount < schema.minContains) {\n yield Create(ValueErrorType.ArrayMinContains, schema, path, value);\n }\n if ((0, guard_1.IsNumber)(schema.maxContains) && containsCount > schema.maxContains) {\n yield Create(ValueErrorType.ArrayMaxContains, schema, path, value);\n }\n}\nfunction* TAsyncIterator(schema, references, path, value) {\n if (!(0, guard_1.IsAsyncIterator)(value))\n yield Create(ValueErrorType.AsyncIterator, schema, path, value);\n}\nfunction* TBigInt(schema, references, path, value) {\n if (!(0, guard_1.IsBigInt)(value))\n return yield Create(ValueErrorType.BigInt, schema, path, value);\n if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {\n yield Create(ValueErrorType.BigIntExclusiveMaximum, schema, path, value);\n }\n if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {\n yield Create(ValueErrorType.BigIntExclusiveMinimum, schema, path, value);\n }\n if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {\n yield Create(ValueErrorType.BigIntMaximum, schema, path, value);\n }\n if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {\n yield Create(ValueErrorType.BigIntMinimum, schema, path, value);\n }\n if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === BigInt(0))) {\n yield Create(ValueErrorType.BigIntMultipleOf, schema, path, value);\n }\n}\nfunction* TBoolean(schema, references, path, value) {\n if (!(0, guard_1.IsBoolean)(value))\n yield Create(ValueErrorType.Boolean, schema, path, value);\n}\nfunction* TConstructor(schema, references, path, value) {\n yield* Visit(schema.returns, references, path, value.prototype);\n}\nfunction* TDate(schema, references, path, value) {\n if (!(0, guard_1.IsDate)(value))\n return yield Create(ValueErrorType.Date, schema, path, value);\n if (IsDefined(schema.exclusiveMaximumTimestamp) && !(value.getTime() < schema.exclusiveMaximumTimestamp)) {\n yield Create(ValueErrorType.DateExclusiveMaximumTimestamp, schema, path, value);\n }\n if (IsDefined(schema.exclusiveMinimumTimestamp) && !(value.getTime() > schema.exclusiveMinimumTimestamp)) {\n yield Create(ValueErrorType.DateExclusiveMinimumTimestamp, schema, path, value);\n }\n if (IsDefined(schema.maximumTimestamp) && !(value.getTime() <= schema.maximumTimestamp)) {\n yield Create(ValueErrorType.DateMaximumTimestamp, schema, path, value);\n }\n if (IsDefined(schema.minimumTimestamp) && !(value.getTime() >= schema.minimumTimestamp)) {\n yield Create(ValueErrorType.DateMinimumTimestamp, schema, path, value);\n }\n if (IsDefined(schema.multipleOfTimestamp) && !(value.getTime() % schema.multipleOfTimestamp === 0)) {\n yield Create(ValueErrorType.DateMultipleOfTimestamp, schema, path, value);\n }\n}\nfunction* TFunction(schema, references, path, value) {\n if (!(0, guard_1.IsFunction)(value))\n yield Create(ValueErrorType.Function, schema, path, value);\n}\nfunction* TInteger(schema, references, path, value) {\n if (!(0, guard_1.IsInteger)(value))\n return yield Create(ValueErrorType.Integer, schema, path, value);\n if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {\n yield Create(ValueErrorType.IntegerExclusiveMaximum, schema, path, value);\n }\n if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {\n yield Create(ValueErrorType.IntegerExclusiveMinimum, schema, path, value);\n }\n if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {\n yield Create(ValueErrorType.IntegerMaximum, schema, path, value);\n }\n if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {\n yield Create(ValueErrorType.IntegerMinimum, schema, path, value);\n }\n if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === 0)) {\n yield Create(ValueErrorType.IntegerMultipleOf, schema, path, value);\n }\n}\nfunction* TIntersect(schema, references, path, value) {\n for (const inner of schema.allOf) {\n const next = Visit(inner, references, path, value).next();\n if (!next.done) {\n yield Create(ValueErrorType.Intersect, schema, path, value);\n yield next.value;\n }\n }\n if (schema.unevaluatedProperties === false) {\n const keyCheck = new RegExp(Types.KeyResolver.ResolvePattern(schema));\n for (const valueKey of Object.getOwnPropertyNames(value)) {\n if (!keyCheck.test(valueKey)) {\n yield Create(ValueErrorType.IntersectUnevaluatedProperties, schema, `${path}/${valueKey}`, value);\n }\n }\n }\n if (typeof schema.unevaluatedProperties === 'object') {\n const keyCheck = new RegExp(Types.KeyResolver.ResolvePattern(schema));\n for (const valueKey of Object.getOwnPropertyNames(value)) {\n if (!keyCheck.test(valueKey)) {\n const next = Visit(schema.unevaluatedProperties, references, `${path}/${valueKey}`, value[valueKey]).next();\n if (!next.done)\n yield next.value; // yield interior\n }\n }\n }\n}\nfunction* TIterator(schema, references, path, value) {\n if (!(0, guard_1.IsIterator)(value))\n yield Create(ValueErrorType.Iterator, schema, path, value);\n}\nfunction* TLiteral(schema, references, path, value) {\n if (!(value === schema.const))\n yield Create(ValueErrorType.Literal, schema, path, value);\n}\nfunction* TNever(schema, references, path, value) {\n yield Create(ValueErrorType.Never, schema, path, value);\n}\nfunction* TNot(schema, references, path, value) {\n if (Visit(schema.not, references, path, value).next().done === true)\n yield Create(ValueErrorType.Not, schema, path, value);\n}\nfunction* TNull(schema, references, path, value) {\n if (!(0, guard_1.IsNull)(value))\n yield Create(ValueErrorType.Null, schema, path, value);\n}\nfunction* TNumber(schema, references, path, value) {\n if (!system_1.TypeSystemPolicy.IsNumberLike(value))\n return yield Create(ValueErrorType.Number, schema, path, value);\n if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {\n yield Create(ValueErrorType.NumberExclusiveMaximum, schema, path, value);\n }\n if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {\n yield Create(ValueErrorType.NumberExclusiveMinimum, schema, path, value);\n }\n if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {\n yield Create(ValueErrorType.NumberMaximum, schema, path, value);\n }\n if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {\n yield Create(ValueErrorType.NumberMinimum, schema, path, value);\n }\n if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === 0)) {\n yield Create(ValueErrorType.NumberMultipleOf, schema, path, value);\n }\n}\nfunction* TObject(schema, references, path, value) {\n if (!system_1.TypeSystemPolicy.IsObjectLike(value))\n return yield Create(ValueErrorType.Object, schema, path, value);\n if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {\n yield Create(ValueErrorType.ObjectMinProperties, schema, path, value);\n }\n if (IsDefined(schema.maxProperties) && !(Object.getOwnPropertyNames(value).length <= schema.maxProperties)) {\n yield Create(ValueErrorType.ObjectMaxProperties, schema, path, value);\n }\n const requiredKeys = Array.isArray(schema.required) ? schema.required : [];\n const knownKeys = Object.getOwnPropertyNames(schema.properties);\n const unknownKeys = Object.getOwnPropertyNames(value);\n for (const requiredKey of requiredKeys) {\n if (unknownKeys.includes(requiredKey))\n continue;\n yield Create(ValueErrorType.ObjectRequiredProperty, schema.properties[requiredKey], `${path}/${EscapeKey(requiredKey)}`, undefined);\n }\n if (schema.additionalProperties === false) {\n for (const valueKey of unknownKeys) {\n if (!knownKeys.includes(valueKey)) {\n yield Create(ValueErrorType.ObjectAdditionalProperties, schema, `${path}/${EscapeKey(valueKey)}`, value[valueKey]);\n }\n }\n }\n if (typeof schema.additionalProperties === 'object') {\n for (const valueKey of unknownKeys) {\n if (knownKeys.includes(valueKey))\n continue;\n yield* Visit(schema.additionalProperties, references, `${path}/${EscapeKey(valueKey)}`, value[valueKey]);\n }\n }\n for (const knownKey of knownKeys) {\n const property = schema.properties[knownKey];\n if (schema.required && schema.required.includes(knownKey)) {\n yield* Visit(property, references, `${path}/${EscapeKey(knownKey)}`, value[knownKey]);\n if (Types.ExtendsUndefined.Check(schema) && !(knownKey in value)) {\n yield Create(ValueErrorType.ObjectRequiredProperty, property, `${path}/${EscapeKey(knownKey)}`, undefined);\n }\n }\n else {\n if (system_1.TypeSystemPolicy.IsExactOptionalProperty(value, knownKey)) {\n yield* Visit(property, references, `${path}/${EscapeKey(knownKey)}`, value[knownKey]);\n }\n }\n }\n}\nfunction* TPromise(schema, references, path, value) {\n if (!(0, guard_1.IsPromise)(value))\n yield Create(ValueErrorType.Promise, schema, path, value);\n}\nfunction* TRecord(schema, references, path, value) {\n if (!system_1.TypeSystemPolicy.IsRecordLike(value))\n return yield Create(ValueErrorType.Object, schema, path, value);\n if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {\n yield Create(ValueErrorType.ObjectMinProperties, schema, path, value);\n }\n if (IsDefined(schema.maxProperties) && !(Object.getOwnPropertyNames(value).length <= schema.maxProperties)) {\n yield Create(ValueErrorType.ObjectMaxProperties, schema, path, value);\n }\n const [patternKey, patternSchema] = Object.entries(schema.patternProperties)[0];\n const regex = new RegExp(patternKey);\n for (const [propertyKey, propertyValue] of Object.entries(value)) {\n if (regex.test(propertyKey))\n yield* Visit(patternSchema, references, `${path}/${EscapeKey(propertyKey)}`, propertyValue);\n }\n if (typeof schema.additionalProperties === 'object') {\n for (const [propertyKey, propertyValue] of Object.entries(value)) {\n if (!regex.test(propertyKey))\n yield* Visit(schema.additionalProperties, references, `${path}/${EscapeKey(propertyKey)}`, propertyValue);\n }\n }\n if (schema.additionalProperties === false) {\n for (const [propertyKey, propertyValue] of Object.entries(value)) {\n if (regex.test(propertyKey))\n continue;\n return yield Create(ValueErrorType.ObjectAdditionalProperties, schema, `${path}/${EscapeKey(propertyKey)}`, propertyValue);\n }\n }\n}\nfunction* TRef(schema, references, path, value) {\n yield* Visit((0, deref_1.Deref)(schema, references), references, path, value);\n}\nfunction* TString(schema, references, path, value) {\n if (!(0, guard_1.IsString)(value))\n return yield Create(ValueErrorType.String, schema, path, value);\n if (IsDefined(schema.minLength) && !(value.length >= schema.minLength)) {\n yield Create(ValueErrorType.StringMinLength, schema, path, value);\n }\n if (IsDefined(schema.maxLength) && !(value.length <= schema.maxLength)) {\n yield Create(ValueErrorType.StringMaxLength, schema, path, value);\n }\n if ((0, guard_1.IsString)(schema.pattern)) {\n const regex = new RegExp(schema.pattern);\n if (!regex.test(value)) {\n yield Create(ValueErrorType.StringPattern, schema, path, value);\n }\n }\n if ((0, guard_1.IsString)(schema.format)) {\n if (!Types.FormatRegistry.Has(schema.format)) {\n yield Create(ValueErrorType.StringFormatUnknown, schema, path, value);\n }\n else {\n const format = Types.FormatRegistry.Get(schema.format);\n if (!format(value)) {\n yield Create(ValueErrorType.StringFormat, schema, path, value);\n }\n }\n }\n}\nfunction* TSymbol(schema, references, path, value) {\n if (!(0, guard_1.IsSymbol)(value))\n yield Create(ValueErrorType.Symbol, schema, path, value);\n}\nfunction* TTemplateLiteral(schema, references, path, value) {\n if (!(0, guard_1.IsString)(value))\n return yield Create(ValueErrorType.String, schema, path, value);\n const regex = new RegExp(schema.pattern);\n if (!regex.test(value)) {\n yield Create(ValueErrorType.StringPattern, schema, path, value);\n }\n}\nfunction* TThis(schema, references, path, value) {\n yield* Visit((0, deref_1.Deref)(schema, references), references, path, value);\n}\nfunction* TTuple(schema, references, path, value) {\n if (!(0, guard_1.IsArray)(value))\n return yield Create(ValueErrorType.Tuple, schema, path, value);\n if (schema.items === undefined && !(value.length === 0)) {\n return yield Create(ValueErrorType.TupleLength, schema, path, value);\n }\n if (!(value.length === schema.maxItems)) {\n return yield Create(ValueErrorType.TupleLength, schema, path, value);\n }\n if (!schema.items) {\n return;\n }\n for (let i = 0; i < schema.items.length; i++) {\n yield* Visit(schema.items[i], references, `${path}/${i}`, value[i]);\n }\n}\nfunction* TUndefined(schema, references, path, value) {\n if (!(0, guard_1.IsUndefined)(value))\n yield Create(ValueErrorType.Undefined, schema, path, value);\n}\nfunction* TUnion(schema, references, path, value) {\n let count = 0;\n for (const subschema of schema.anyOf) {\n const errors = [...Visit(subschema, references, path, value)];\n if (errors.length === 0)\n return; // matched\n count += errors.length;\n }\n if (count > 0) {\n yield Create(ValueErrorType.Union, schema, path, value);\n }\n}\nfunction* TUint8Array(schema, references, path, value) {\n if (!(0, guard_1.IsUint8Array)(value))\n return yield Create(ValueErrorType.Uint8Array, schema, path, value);\n if (IsDefined(schema.maxByteLength) && !(value.length <= schema.maxByteLength)) {\n yield Create(ValueErrorType.Uint8ArrayMaxByteLength, schema, path, value);\n }\n if (IsDefined(schema.minByteLength) && !(value.length >= schema.minByteLength)) {\n yield Create(ValueErrorType.Uint8ArrayMinByteLength, schema, path, value);\n }\n}\nfunction* TUnknown(schema, references, path, value) { }\nfunction* TVoid(schema, references, path, value) {\n if (!system_1.TypeSystemPolicy.IsVoidLike(value))\n yield Create(ValueErrorType.Void, schema, path, value);\n}\nfunction* TKind(schema, references, path, value) {\n const check = Types.TypeRegistry.Get(schema[Types.Kind]);\n if (!check(schema, value))\n yield Create(ValueErrorType.Kind, schema, path, value);\n}\nfunction* Visit(schema, references, path, value) {\n const references_ = IsDefined(schema.$id) ? [...references, schema] : references;\n const schema_ = schema;\n switch (schema_[Types.Kind]) {\n case 'Any':\n return yield* TAny(schema_, references_, path, value);\n case 'Array':\n return yield* TArray(schema_, references_, path, value);\n case 'AsyncIterator':\n return yield* TAsyncIterator(schema_, references_, path, value);\n case 'BigInt':\n return yield* TBigInt(schema_, references_, path, value);\n case 'Boolean':\n return yield* TBoolean(schema_, references_, path, value);\n case 'Constructor':\n return yield* TConstructor(schema_, references_, path, value);\n case 'Date':\n return yield* TDate(schema_, references_, path, value);\n case 'Function':\n return yield* TFunction(schema_, references_, path, value);\n case 'Integer':\n return yield* TInteger(schema_, references_, path, value);\n case 'Intersect':\n return yield* TIntersect(schema_, references_, path, value);\n case 'Iterator':\n return yield* TIterator(schema_, references_, path, value);\n case 'Literal':\n return yield* TLiteral(schema_, references_, path, value);\n case 'Never':\n return yield* TNever(schema_, references_, path, value);\n case 'Not':\n return yield* TNot(schema_, references_, path, value);\n case 'Null':\n return yield* TNull(schema_, references_, path, value);\n case 'Number':\n return yield* TNumber(schema_, references_, path, value);\n case 'Object':\n return yield* TObject(schema_, references_, path, value);\n case 'Promise':\n return yield* TPromise(schema_, references_, path, value);\n case 'Record':\n return yield* TRecord(schema_, references_, path, value);\n case 'Ref':\n return yield* TRef(schema_, references_, path, value);\n case 'String':\n return yield* TString(schema_, references_, path, value);\n case 'Symbol':\n return yield* TSymbol(schema_, references_, path, value);\n case 'TemplateLiteral':\n return yield* TTemplateLiteral(schema_, references_, path, value);\n case 'This':\n return yield* TThis(schema_, references_, path, value);\n case 'Tuple':\n return yield* TTuple(schema_, references_, path, value);\n case 'Undefined':\n return yield* TUndefined(schema_, references_, path, value);\n case 'Union':\n return yield* TUnion(schema_, references_, path, value);\n case 'Uint8Array':\n return yield* TUint8Array(schema_, references_, path, value);\n case 'Unknown':\n return yield* TUnknown(schema_, references_, path, value);\n case 'Void':\n return yield* TVoid(schema_, references_, path, value);\n default:\n if (!Types.TypeRegistry.Has(schema_[Types.Kind]))\n throw new ValueErrorsUnknownTypeError(schema);\n return yield* TKind(schema_, references_, path, value);\n }\n}\n/** Returns an iterator for each error in this value. */\nfunction Errors(...args) {\n const iterator = args.length === 3 ? Visit(args[0], args[1], '', args[2]) : Visit(args[0], [], '', args[1]);\n return new ValueErrorIterator(iterator);\n}\nexports.Errors = Errors;\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/errors\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./errors\"), exports);\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/system\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ValueErrorType = void 0;\nvar errors_1 = require(\"../errors/errors\");\nObject.defineProperty(exports, \"ValueErrorType\", { enumerable: true, get: function () { return errors_1.ValueErrorType; } });\n__exportStar(require(\"./system\"), exports);\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/value\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Check = exports.ValueCheckUnknownTypeError = void 0;\nconst guard_1 = require(\"./guard\");\nconst index_1 = require(\"../system/index\");\nconst deref_1 = require(\"./deref\");\nconst hash_1 = require(\"./hash\");\nconst Types = require(\"../typebox\");\n// --------------------------------------------------------------------------\n// Errors\n// --------------------------------------------------------------------------\nclass ValueCheckUnknownTypeError extends Types.TypeBoxError {\n constructor(schema) {\n super(`Unknown type`);\n this.schema = schema;\n }\n}\nexports.ValueCheckUnknownTypeError = ValueCheckUnknownTypeError;\n// --------------------------------------------------------------------------\n// TypeGuards\n// --------------------------------------------------------------------------\nfunction IsAnyOrUnknown(schema) {\n return schema[Types.Kind] === 'Any' || schema[Types.Kind] === 'Unknown';\n}\n// --------------------------------------------------------------------------\n// Guards\n// --------------------------------------------------------------------------\nfunction IsDefined(value) {\n return value !== undefined;\n}\n// --------------------------------------------------------------------------\n// Types\n// --------------------------------------------------------------------------\nfunction TAny(schema, references, value) {\n return true;\n}\nfunction TArray(schema, references, value) {\n if (!(0, guard_1.IsArray)(value))\n return false;\n if (IsDefined(schema.minItems) && !(value.length >= schema.minItems)) {\n return false;\n }\n if (IsDefined(schema.maxItems) && !(value.length <= schema.maxItems)) {\n return false;\n }\n if (!value.every((value) => Visit(schema.items, references, value))) {\n return false;\n }\n // prettier-ignore\n if (schema.uniqueItems === true && !((function () { const set = new Set(); for (const element of value) {\n const hashed = (0, hash_1.Hash)(element);\n if (set.has(hashed)) {\n return false;\n }\n else {\n set.add(hashed);\n }\n } return true; })())) {\n return false;\n }\n // contains\n if (!(IsDefined(schema.contains) || (0, guard_1.IsNumber)(schema.minContains) || (0, guard_1.IsNumber)(schema.maxContains))) {\n return true; // exit\n }\n const containsSchema = IsDefined(schema.contains) ? schema.contains : Types.Type.Never();\n const containsCount = value.reduce((acc, value) => (Visit(containsSchema, references, value) ? acc + 1 : acc), 0);\n if (containsCount === 0) {\n return false;\n }\n if ((0, guard_1.IsNumber)(schema.minContains) && containsCount < schema.minContains) {\n return false;\n }\n if ((0, guard_1.IsNumber)(schema.maxContains) && containsCount > schema.maxContains) {\n return false;\n }\n return true;\n}\nfunction TAsyncIterator(schema, references, value) {\n return (0, guard_1.IsAsyncIterator)(value);\n}\nfunction TBigInt(schema, references, value) {\n if (!(0, guard_1.IsBigInt)(value))\n return false;\n if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {\n return false;\n }\n if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {\n return false;\n }\n if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {\n return false;\n }\n if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {\n return false;\n }\n if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === BigInt(0))) {\n return false;\n }\n return true;\n}\nfunction TBoolean(schema, references, value) {\n return (0, guard_1.IsBoolean)(value);\n}\nfunction TConstructor(schema, references, value) {\n return Visit(schema.returns, references, value.prototype);\n}\nfunction TDate(schema, references, value) {\n if (!(0, guard_1.IsDate)(value))\n return false;\n if (IsDefined(schema.exclusiveMaximumTimestamp) && !(value.getTime() < schema.exclusiveMaximumTimestamp)) {\n return false;\n }\n if (IsDefined(schema.exclusiveMinimumTimestamp) && !(value.getTime() > schema.exclusiveMinimumTimestamp)) {\n return false;\n }\n if (IsDefined(schema.maximumTimestamp) && !(value.getTime() <= schema.maximumTimestamp)) {\n return false;\n }\n if (IsDefined(schema.minimumTimestamp) && !(value.getTime() >= schema.minimumTimestamp)) {\n return false;\n }\n if (IsDefined(schema.multipleOfTimestamp) && !(value.getTime() % schema.multipleOfTimestamp === 0)) {\n return false;\n }\n return true;\n}\nfunction TFunction(schema, references, value) {\n return (0, guard_1.IsFunction)(value);\n}\nfunction TInteger(schema, references, value) {\n if (!(0, guard_1.IsInteger)(value)) {\n return false;\n }\n if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {\n return false;\n }\n if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {\n return false;\n }\n if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {\n return false;\n }\n if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {\n return false;\n }\n if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === 0)) {\n return false;\n }\n return true;\n}\nfunction TIntersect(schema, references, value) {\n const check1 = schema.allOf.every((schema) => Visit(schema, references, value));\n if (schema.unevaluatedProperties === false) {\n const keyPattern = new RegExp(Types.KeyResolver.ResolvePattern(schema));\n const check2 = Object.getOwnPropertyNames(value).every((key) => keyPattern.test(key));\n return check1 && check2;\n }\n else if (Types.TypeGuard.TSchema(schema.unevaluatedProperties)) {\n const keyCheck = new RegExp(Types.KeyResolver.ResolvePattern(schema));\n const check2 = Object.getOwnPropertyNames(value).every((key) => keyCheck.test(key) || Visit(schema.unevaluatedProperties, references, value[key]));\n return check1 && check2;\n }\n else {\n return check1;\n }\n}\nfunction TIterator(schema, references, value) {\n return (0, guard_1.IsIterator)(value);\n}\nfunction TLiteral(schema, references, value) {\n return value === schema.const;\n}\nfunction TNever(schema, references, value) {\n return false;\n}\nfunction TNot(schema, references, value) {\n return !Visit(schema.not, references, value);\n}\nfunction TNull(schema, references, value) {\n return (0, guard_1.IsNull)(value);\n}\nfunction TNumber(schema, references, value) {\n if (!index_1.TypeSystemPolicy.IsNumberLike(value))\n return false;\n if (IsDefined(schema.exclusiveMaximum) && !(value < schema.exclusiveMaximum)) {\n return false;\n }\n if (IsDefined(schema.exclusiveMinimum) && !(value > schema.exclusiveMinimum)) {\n return false;\n }\n if (IsDefined(schema.minimum) && !(value >= schema.minimum)) {\n return false;\n }\n if (IsDefined(schema.maximum) && !(value <= schema.maximum)) {\n return false;\n }\n if (IsDefined(schema.multipleOf) && !(value % schema.multipleOf === 0)) {\n return false;\n }\n return true;\n}\nfunction TObject(schema, references, value) {\n if (!index_1.TypeSystemPolicy.IsObjectLike(value))\n return false;\n if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {\n return false;\n }\n if (IsDefined(schema.maxProperties) && !(Object.getOwnPropertyNames(value).length <= schema.maxProperties)) {\n return false;\n }\n const knownKeys = Object.getOwnPropertyNames(schema.properties);\n for (const knownKey of knownKeys) {\n const property = schema.properties[knownKey];\n if (schema.required && schema.required.includes(knownKey)) {\n if (!Visit(property, references, value[knownKey])) {\n return false;\n }\n if ((Types.ExtendsUndefined.Check(property) || IsAnyOrUnknown(property)) && !(knownKey in value)) {\n return false;\n }\n }\n else {\n if (index_1.TypeSystemPolicy.IsExactOptionalProperty(value, knownKey) && !Visit(property, references, value[knownKey])) {\n return false;\n }\n }\n }\n if (schema.additionalProperties === false) {\n const valueKeys = Object.getOwnPropertyNames(value);\n // optimization: value is valid if schemaKey length matches the valueKey length\n if (schema.required && schema.required.length === knownKeys.length && valueKeys.length === knownKeys.length) {\n return true;\n }\n else {\n return valueKeys.every((valueKey) => knownKeys.includes(valueKey));\n }\n }\n else if (typeof schema.additionalProperties === 'object') {\n const valueKeys = Object.getOwnPropertyNames(value);\n return valueKeys.every((key) => knownKeys.includes(key) || Visit(schema.additionalProperties, references, value[key]));\n }\n else {\n return true;\n }\n}\nfunction TPromise(schema, references, value) {\n return (0, guard_1.IsPromise)(value);\n}\nfunction TRecord(schema, references, value) {\n if (!index_1.TypeSystemPolicy.IsRecordLike(value)) {\n return false;\n }\n if (IsDefined(schema.minProperties) && !(Object.getOwnPropertyNames(value).length >= schema.minProperties)) {\n return false;\n }\n if (IsDefined(schema.maxProperties) && !(Object.getOwnPropertyNames(value).length <= schema.maxProperties)) {\n return false;\n }\n const [patternKey, patternSchema] = Object.entries(schema.patternProperties)[0];\n const regex = new RegExp(patternKey);\n // prettier-ignore\n const check1 = Object.entries(value).every(([key, value]) => {\n return (regex.test(key)) ? Visit(patternSchema, references, value) : true;\n });\n // prettier-ignore\n const check2 = typeof schema.additionalProperties === 'object' ? Object.entries(value).every(([key, value]) => {\n return (!regex.test(key)) ? Visit(schema.additionalProperties, references, value) : true;\n }) : true;\n const check3 = schema.additionalProperties === false\n ? Object.getOwnPropertyNames(value).every((key) => {\n return regex.test(key);\n })\n : true;\n return check1 && check2 && check3;\n}\nfunction TRef(schema, references, value) {\n return Visit((0, deref_1.Deref)(schema, references), references, value);\n}\nfunction TString(schema, references, value) {\n if (!(0, guard_1.IsString)(value)) {\n return false;\n }\n if (IsDefined(schema.minLength)) {\n if (!(value.length >= schema.minLength))\n return false;\n }\n if (IsDefined(schema.maxLength)) {\n if (!(value.length <= schema.maxLength))\n return false;\n }\n if (IsDefined(schema.pattern)) {\n const regex = new RegExp(schema.pattern);\n if (!regex.test(value))\n return false;\n }\n if (IsDefined(schema.format)) {\n if (!Types.FormatRegistry.Has(schema.format))\n return false;\n const func = Types.FormatRegistry.Get(schema.format);\n return func(value);\n }\n return true;\n}\nfunction TSymbol(schema, references, value) {\n return (0, guard_1.IsSymbol)(value);\n}\nfunction TTemplateLiteral(schema, references, value) {\n return (0, guard_1.IsString)(value) && new RegExp(schema.pattern).test(value);\n}\nfunction TThis(schema, references, value) {\n return Visit((0, deref_1.Deref)(schema, references), references, value);\n}\nfunction TTuple(schema, references, value) {\n if (!(0, guard_1.IsArray)(value)) {\n return false;\n }\n if (schema.items === undefined && !(value.length === 0)) {\n return false;\n }\n if (!(value.length === schema.maxItems)) {\n return false;\n }\n if (!schema.items) {\n return true;\n }\n for (let i = 0; i < schema.items.length; i++) {\n if (!Visit(schema.items[i], references, value[i]))\n return false;\n }\n return true;\n}\nfunction TUndefined(schema, references, value) {\n return (0, guard_1.IsUndefined)(value);\n}\nfunction TUnion(schema, references, value) {\n return schema.anyOf.some((inner) => Visit(inner, references, value));\n}\nfunction TUint8Array(schema, references, value) {\n if (!(0, guard_1.IsUint8Array)(value)) {\n return false;\n }\n if (IsDefined(schema.maxByteLength) && !(value.length <= schema.maxByteLength)) {\n return false;\n }\n if (IsDefined(schema.minByteLength) && !(value.length >= schema.minByteLength)) {\n return false;\n }\n return true;\n}\nfunction TUnknown(schema, references, value) {\n return true;\n}\nfunction TVoid(schema, references, value) {\n return index_1.TypeSystemPolicy.IsVoidLike(value);\n}\nfunction TKind(schema, references, value) {\n if (!Types.TypeRegistry.Has(schema[Types.Kind]))\n return false;\n const func = Types.TypeRegistry.Get(schema[Types.Kind]);\n return func(schema, value);\n}\nfunction Visit(schema, references, value) {\n const references_ = IsDefined(schema.$id) ? [...references, schema] : references;\n const schema_ = schema;\n switch (schema_[Types.Kind]) {\n case 'Any':\n return TAny(schema_, references_, value);\n case 'Array':\n return TArray(schema_, references_, value);\n case 'AsyncIterator':\n return TAsyncIterator(schema_, references_, value);\n case 'BigInt':\n return TBigInt(schema_, references_, value);\n case 'Boolean':\n return TBoolean(schema_, references_, value);\n case 'Constructor':\n return TConstructor(schema_, references_, value);\n case 'Date':\n return TDate(schema_, references_, value);\n case 'Function':\n return TFunction(schema_, references_, value);\n case 'Integer':\n return TInteger(schema_, references_, value);\n case 'Intersect':\n return TIntersect(schema_, references_, value);\n case 'Iterator':\n return TIterator(schema_, references_, value);\n case 'Literal':\n return TLiteral(schema_, references_, value);\n case 'Never':\n return TNever(schema_, references_, value);\n case 'Not':\n return TNot(schema_, references_, value);\n case 'Null':\n return TNull(schema_, references_, value);\n case 'Number':\n return TNumber(schema_, references_, value);\n case 'Object':\n return TObject(schema_, references_, value);\n case 'Promise':\n return TPromise(schema_, references_, value);\n case 'Record':\n return TRecord(schema_, references_, value);\n case 'Ref':\n return TRef(schema_, references_, value);\n case 'String':\n return TString(schema_, references_, value);\n case 'Symbol':\n return TSymbol(schema_, references_, value);\n case 'TemplateLiteral':\n return TTemplateLiteral(schema_, references_, value);\n case 'This':\n return TThis(schema_, references_, value);\n case 'Tuple':\n return TTuple(schema_, references_, value);\n case 'Undefined':\n return TUndefined(schema_, references_, value);\n case 'Union':\n return TUnion(schema_, references_, value);\n case 'Uint8Array':\n return TUint8Array(schema_, references_, value);\n case 'Unknown':\n return TUnknown(schema_, references_, value);\n case 'Void':\n return TVoid(schema_, references_, value);\n default:\n if (!Types.TypeRegistry.Has(schema_[Types.Kind]))\n throw new ValueCheckUnknownTypeError(schema_);\n return TKind(schema_, references_, value);\n }\n}\n/** Returns true if the value matches the given type. */\nfunction Check(...args) {\n return args.length === 3 ? Visit(args[0], args[1], args[2]) : Visit(args[0], [], args[1]);\n}\nexports.Check = Check;\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/value\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.EncodeTransform = exports.DecodeTransform = exports.HasTransform = exports.TransformEncodeError = exports.TransformDecodeError = exports.TransformEncodeCheckError = exports.TransformDecodeCheckError = void 0;\nconst guard_1 = require(\"./guard\");\nconst deref_1 = require(\"./deref\");\nconst check_1 = require(\"./check\");\nconst Types = require(\"../typebox\");\n// -------------------------------------------------------------------------\n// Errors\n// -------------------------------------------------------------------------\nclass TransformDecodeCheckError extends Types.TypeBoxError {\n constructor(schema, value, error) {\n super(`Unable to decode due to invalid value`);\n this.schema = schema;\n this.value = value;\n this.error = error;\n }\n}\nexports.TransformDecodeCheckError = TransformDecodeCheckError;\nclass TransformEncodeCheckError extends Types.TypeBoxError {\n constructor(schema, value, error) {\n super(`Unable to encode due to invalid value`);\n this.schema = schema;\n this.value = value;\n this.error = error;\n }\n}\nexports.TransformEncodeCheckError = TransformEncodeCheckError;\nclass TransformDecodeError extends Types.TypeBoxError {\n constructor(schema, value, error) {\n super(`${error instanceof Error ? error.message : 'Unknown error'}`);\n this.schema = schema;\n this.value = value;\n }\n}\nexports.TransformDecodeError = TransformDecodeError;\nclass TransformEncodeError extends Types.TypeBoxError {\n constructor(schema, value, error) {\n super(`${error instanceof Error ? error.message : 'Unknown error'}`);\n this.schema = schema;\n this.value = value;\n }\n}\nexports.TransformEncodeError = TransformEncodeError;\n// ------------------------------------------------------------------\n// HasTransform\n// ------------------------------------------------------------------\n/** Recursively checks a schema for transform codecs */\nvar HasTransform;\n(function (HasTransform) {\n function TArray(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.items, references);\n }\n function TAsyncIterator(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.items, references);\n }\n function TConstructor(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.returns, references) || schema.parameters.some((schema) => Visit(schema, references));\n }\n function TFunction(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.returns, references) || schema.parameters.some((schema) => Visit(schema, references));\n }\n function TIntersect(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Types.TypeGuard.TTransform(schema.unevaluatedProperties) || schema.allOf.some((schema) => Visit(schema, references));\n }\n function TIterator(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.items, references);\n }\n function TNot(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.not, references);\n }\n function TObject(schema, references) {\n // prettier-ignore\n return (Types.TypeGuard.TTransform(schema) || Object.values(schema.properties).some((schema) => Visit(schema, references)) || Types.TypeGuard.TSchema(schema.additionalProperties) && Visit(schema.additionalProperties, references));\n }\n function TPromise(schema, references) {\n return Types.TypeGuard.TTransform(schema) || Visit(schema.item, references);\n }\n function TRecord(schema, references) {\n const pattern = Object.getOwnPropertyNames(schema.patternProperties)[0];\n const property = schema.patternProperties[pattern];\n return Types.TypeGuard.TTransform(schema) || Visit(property, references) || (Types.TypeGuard.TSchema(schema.additionalProperties) && Types.TypeGuard.TTransform(schema.additionalProperties));\n }\n function TRef(schema, references) {\n if (Types.TypeGuard.TTransform(schema))\n return true;\n return Visit((0, deref_1.Deref)(schema, references), references);\n }\n function TThis(schema, references) {\n if (Types.TypeGuard.TTransform(schema))\n return true;\n return Visit((0, deref_1.Deref)(schema, references), references);\n }\n function TTuple(schema, references) {\n return Types.TypeGuard.TTransform(schema) || (!(0, guard_1.IsUndefined)(schema.items) && schema.items.some((schema) => Visit(schema, references)));\n }\n function TUnion(schema, references) {\n return Types.TypeGuard.TTransform(schema) || schema.anyOf.some((schema) => Visit(schema, references));\n }\n function Visit(schema, references) {\n const references_ = (0, guard_1.IsString)(schema.$id) ? [...references, schema] : references;\n const schema_ = schema;\n if (schema.$id && visited.has(schema.$id))\n return false;\n if (schema.$id)\n visited.add(schema.$id);\n switch (schema[Types.Kind]) {\n case 'Array':\n return TArray(schema_, references_);\n case 'AsyncIterator':\n return TAsyncIterator(schema_, references_);\n case 'Constructor':\n return TConstructor(schema_, references_);\n case 'Function':\n return TFunction(schema_, references_);\n case 'Intersect':\n return TIntersect(schema_, references_);\n case 'Iterator':\n return TIterator(schema_, references_);\n case 'Not':\n return TNot(schema_, references_);\n case 'Object':\n return TObject(schema_, references_);\n case 'Promise':\n return TPromise(schema_, references_);\n case 'Record':\n return TRecord(schema_, references_);\n case 'Ref':\n return TRef(schema_, references_);\n case 'This':\n return TThis(schema_, references_);\n case 'Tuple':\n return TTuple(schema_, references_);\n case 'Union':\n return TUnion(schema_, references_);\n default:\n return Types.TypeGuard.TTransform(schema);\n }\n }\n const visited = new Set();\n /** Returns true if this schema contains a transform codec */\n function Has(schema, references) {\n visited.clear();\n return Visit(schema, references);\n }\n HasTransform.Has = Has;\n})(HasTransform || (exports.HasTransform = HasTransform = {}));\n// ------------------------------------------------------------------\n// DecodeTransform\n// ------------------------------------------------------------------\n/** Decodes a value using transform decoders if available. Does not ensure correct results. */\nvar DecodeTransform;\n(function (DecodeTransform) {\n function Default(schema, value) {\n try {\n return Types.TypeGuard.TTransform(schema) ? schema[Types.Transform].Decode(value) : value;\n }\n catch (error) {\n throw new TransformDecodeError(schema, value, error);\n }\n }\n // prettier-ignore\n function TArray(schema, references, value) {\n return ((0, guard_1.IsArray)(value))\n ? Default(schema, value.map((value) => Visit(schema.items, references, value)))\n : Default(schema, value);\n }\n // prettier-ignore\n function TIntersect(schema, references, value) {\n if (!(0, guard_1.IsPlainObject)(value) || (0, guard_1.IsValueType)(value))\n return Default(schema, value);\n const knownKeys = Types.KeyResolver.ResolveKeys(schema, { includePatterns: false });\n const knownProperties = knownKeys.reduce((value, key) => {\n return (key in value)\n ? { ...value, [key]: Visit(Types.IndexedAccessor.Resolve(schema, [key]), references, value[key]) }\n : value;\n }, value);\n if (!Types.TypeGuard.TTransform(schema.unevaluatedProperties)) {\n return Default(schema, knownProperties);\n }\n const unknownKeys = Object.getOwnPropertyNames(knownProperties);\n const unevaluatedProperties = schema.unevaluatedProperties;\n const unknownProperties = unknownKeys.reduce((value, key) => {\n return !knownKeys.includes(key)\n ? { ...value, [key]: Default(unevaluatedProperties, value[key]) }\n : value;\n }, knownProperties);\n return Default(schema, unknownProperties);\n }\n function TNot(schema, references, value) {\n return Default(schema, Visit(schema.not, references, value));\n }\n // prettier-ignore\n function TObject(schema, references, value) {\n if (!(0, guard_1.IsPlainObject)(value))\n return Default(schema, value);\n const knownKeys = Types.KeyResolver.ResolveKeys(schema, { includePatterns: false });\n const knownProperties = knownKeys.reduce((value, key) => {\n return (key in value)\n ? { ...value, [key]: Visit(schema.properties[key], references, value[key]) }\n : value;\n }, value);\n if (!Types.TypeGuard.TSchema(schema.additionalProperties)) {\n return Default(schema, knownProperties);\n }\n const unknownKeys = Object.getOwnPropertyNames(knownProperties);\n const additionalProperties = schema.additionalProperties;\n const unknownProperties = unknownKeys.reduce((value, key) => {\n return !knownKeys.includes(key)\n ? { ...value, [key]: Default(additionalProperties, value[key]) }\n : value;\n }, knownProperties);\n return Default(schema, unknownProperties);\n }\n // prettier-ignore\n function TRecord(schema, references, value) {\n if (!(0, guard_1.IsPlainObject)(value))\n return Default(schema, value);\n const pattern = Object.getOwnPropertyNames(schema.patternProperties)[0];\n const knownKeys = new RegExp(pattern);\n const knownProperties = Object.getOwnPropertyNames(value).reduce((value, key) => {\n return knownKeys.test(key)\n ? { ...value, [key]: Visit(schema.patternProperties[pattern], references, value[key]) }\n : value;\n }, value);\n if (!Types.TypeGuard.TSchema(schema.additionalProperties)) {\n return Default(schema, knownProperties);\n }\n const unknownKeys = Object.getOwnPropertyNames(knownProperties);\n const additionalProperties = schema.additionalProperties;\n const unknownProperties = unknownKeys.reduce((value, key) => {\n return !knownKeys.test(key)\n ? { ...value, [key]: Default(additionalProperties, value[key]) }\n : value;\n }, knownProperties);\n return Default(schema, unknownProperties);\n }\n function TRef(schema, references, value) {\n const target = (0, deref_1.Deref)(schema, references);\n return Default(schema, Visit(target, references, value));\n }\n function TThis(schema, references, value) {\n const target = (0, deref_1.Deref)(schema, references);\n return Default(schema, Visit(target, references, value));\n }\n // prettier-ignore\n function TTuple(schema, references, value) {\n return ((0, guard_1.IsArray)(value) && (0, guard_1.IsArray)(schema.items))\n ? Default(schema, schema.items.map((schema, index) => Visit(schema, references, value[index])))\n : Default(schema, value);\n }\n function TUnion(schema, references, value) {\n const defaulted = Default(schema, value);\n for (const subschema of schema.anyOf) {\n if (!(0, check_1.Check)(subschema, references, defaulted))\n continue;\n return Visit(subschema, references, defaulted);\n }\n return defaulted;\n }\n function Visit(schema, references, value) {\n const references_ = typeof schema.$id === 'string' ? [...references, schema] : references;\n const schema_ = schema;\n switch (schema[Types.Kind]) {\n case 'Array':\n return TArray(schema_, references_, value);\n case 'Intersect':\n return TIntersect(schema_, references_, value);\n case 'Not':\n return TNot(schema_, references_, value);\n case 'Object':\n return TObject(schema_, references_, value);\n case 'Record':\n return TRecord(schema_, references_, value);\n case 'Ref':\n return TRef(schema_, references_, value);\n case 'Symbol':\n return Default(schema_, value);\n case 'This':\n return TThis(schema_, references_, value);\n case 'Tuple':\n return TTuple(schema_, references_, value);\n case 'Union':\n return TUnion(schema_, references_, value);\n default:\n return Default(schema_, value);\n }\n }\n function Decode(schema, references, value) {\n return Visit(schema, references, value);\n }\n DecodeTransform.Decode = Decode;\n})(DecodeTransform || (exports.DecodeTransform = DecodeTransform = {}));\n// ------------------------------------------------------------------\n// DecodeTransform\n// ------------------------------------------------------------------\n/** Encodes a value using transform encoders if available. Does not ensure correct results. */\nvar EncodeTransform;\n(function (EncodeTransform) {\n function Default(schema, value) {\n try {\n return Types.TypeGuard.TTransform(schema) ? schema[Types.Transform].Encode(value) : value;\n }\n catch (error) {\n throw new TransformEncodeError(schema, value, error);\n }\n }\n // prettier-ignore\n function TArray(schema, references, value) {\n const defaulted = Default(schema, value);\n return (0, guard_1.IsArray)(defaulted)\n ? defaulted.map((value) => Visit(schema.items, references, value))\n : defaulted;\n }\n // prettier-ignore\n function TIntersect(schema, references, value) {\n const defaulted = Default(schema, value);\n if (!(0, guard_1.IsPlainObject)(value) || (0, guard_1.IsValueType)(value))\n return defaulted;\n const knownKeys = Types.KeyResolver.ResolveKeys(schema, { includePatterns: false });\n const knownProperties = knownKeys.reduce((value, key) => {\n return key in defaulted\n ? { ...value, [key]: Visit(Types.IndexedAccessor.Resolve(schema, [key]), references, value[key]) }\n : value;\n }, defaulted);\n if (!Types.TypeGuard.TTransform(schema.unevaluatedProperties)) {\n return Default(schema, knownProperties);\n }\n const unknownKeys = Object.getOwnPropertyNames(knownProperties);\n const unevaluatedProperties = schema.unevaluatedProperties;\n return unknownKeys.reduce((value, key) => {\n return !knownKeys.includes(key)\n ? { ...value, [key]: Default(unevaluatedProperties, value[key]) }\n : value;\n }, knownProperties);\n }\n function TNot(schema, references, value) {\n return Default(schema.not, Default(schema, value));\n }\n // prettier-ignore\n function TObject(schema, references, value) {\n const defaulted = Default(schema, value);\n if (!(0, guard_1.IsPlainObject)(value))\n return defaulted;\n const knownKeys = Types.KeyResolver.ResolveKeys(schema, { includePatterns: false });\n const knownProperties = knownKeys.reduce((value, key) => {\n return key in value\n ? { ...value, [key]: Visit(schema.properties[key], references, value[key]) }\n : value;\n }, defaulted);\n if (!Types.TypeGuard.TSchema(schema.additionalProperties)) {\n return knownProperties;\n }\n const unknownKeys = Object.getOwnPropertyNames(knownProperties);\n const additionalProperties = schema.additionalProperties;\n return unknownKeys.reduce((value, key) => {\n return !knownKeys.includes(key)\n ? { ...value, [key]: Default(additionalProperties, value[key]) }\n : value;\n }, knownProperties);\n }\n // prettier-ignore\n function TRecord(schema, references, value) {\n const defaulted = Default(schema, value);\n if (!(0, guard_1.IsPlainObject)(value))\n return defaulted;\n const pattern = Object.getOwnPropertyNames(schema.patternProperties)[0];\n const knownKeys = new RegExp(pattern);\n const knownProperties = Object.getOwnPropertyNames(value).reduce((value, key) => {\n return knownKeys.test(key)\n ? { ...value, [key]: Visit(schema.patternProperties[pattern], references, value[key]) }\n : value;\n }, defaulted);\n if (!Types.TypeGuard.TSchema(schema.additionalProperties)) {\n return Default(schema, knownProperties);\n }\n const unknownKeys = Object.getOwnPropertyNames(knownProperties);\n const additionalProperties = schema.additionalProperties;\n return unknownKeys.reduce((value, key) => {\n return !knownKeys.test(key)\n ? { ...value, [key]: Default(additionalProperties, value[key]) }\n : value;\n }, knownProperties);\n }\n function TRef(schema, references, value) {\n const target = (0, deref_1.Deref)(schema, references);\n const resolved = Visit(target, references, value);\n return Default(schema, resolved);\n }\n function TThis(schema, references, value) {\n const target = (0, deref_1.Deref)(schema, references);\n const resolved = Visit(target, references, value);\n return Default(schema, resolved);\n }\n function TTuple(schema, references, value) {\n const value1 = Default(schema, value);\n return (0, guard_1.IsArray)(schema.items) ? schema.items.map((schema, index) => Visit(schema, references, value1[index])) : [];\n }\n function TUnion(schema, references, value) {\n // test value against union variants\n for (const subschema of schema.anyOf) {\n if (!(0, check_1.Check)(subschema, references, value))\n continue;\n const value1 = Visit(subschema, references, value);\n return Default(schema, value1);\n }\n // test transformed value against union variants\n for (const subschema of schema.anyOf) {\n const value1 = Visit(subschema, references, value);\n if (!(0, check_1.Check)(schema, references, value1))\n continue;\n return Default(schema, value1);\n }\n return Default(schema, value);\n }\n function Visit(schema, references, value) {\n const references_ = typeof schema.$id === 'string' ? [...references, schema] : references;\n const schema_ = schema;\n switch (schema[Types.Kind]) {\n case 'Array':\n return TArray(schema_, references_, value);\n case 'Intersect':\n return TIntersect(schema_, references_, value);\n case 'Not':\n return TNot(schema_, references_, value);\n case 'Object':\n return TObject(schema_, references_, value);\n case 'Record':\n return TRecord(schema_, references_, value);\n case 'Ref':\n return TRef(schema_, references_, value);\n case 'This':\n return TThis(schema_, references_, value);\n case 'Tuple':\n return TTuple(schema_, references_, value);\n case 'Union':\n return TUnion(schema_, references_, value);\n default:\n return Default(schema_, value);\n }\n }\n function Encode(schema, references, value) {\n return Visit(schema, references, value);\n }\n EncodeTransform.Encode = Encode;\n})(EncodeTransform || (exports.EncodeTransform = EncodeTransform = {}));\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/compiler\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.TypeCompiler = exports.Policy = exports.TypeCompilerTypeGuardError = exports.TypeCompilerUnknownTypeError = exports.TypeCheck = void 0;\nconst transform_1 = require(\"../value/transform\");\nconst guard_1 = require(\"../value/guard\");\nconst errors_1 = require(\"../errors/errors\");\nconst index_1 = require(\"../system/index\");\nconst deref_1 = require(\"../value/deref\");\nconst hash_1 = require(\"../value/hash\");\nconst Types = require(\"../typebox\");\n// -------------------------------------------------------------------\n// TypeCheck\n// -------------------------------------------------------------------\nclass TypeCheck {\n constructor(schema, references, checkFunc, code) {\n this.schema = schema;\n this.references = references;\n this.checkFunc = checkFunc;\n this.code = code;\n this.hasTransform = transform_1.HasTransform.Has(schema, references);\n }\n /** Returns the generated assertion code used to validate this type. */\n Code() {\n return this.code;\n }\n /** Returns an iterator for each error in this value. */\n Errors(value) {\n return (0, errors_1.Errors)(this.schema, this.references, value);\n }\n /** Returns true if the value matches the compiled type. */\n Check(value) {\n return this.checkFunc(value);\n }\n /** Decodes a value or throws if error */\n Decode(value) {\n if (!this.checkFunc(value))\n throw new transform_1.TransformDecodeCheckError(this.schema, value, this.Errors(value).First());\n return this.hasTransform ? transform_1.DecodeTransform.Decode(this.schema, this.references, value) : value;\n }\n /** Encodes a value or throws if error */\n Encode(value) {\n const encoded = this.hasTransform ? transform_1.EncodeTransform.Encode(this.schema, this.references, value) : value;\n if (!this.checkFunc(encoded))\n throw new transform_1.TransformEncodeCheckError(this.schema, value, this.Errors(value).First());\n return encoded;\n }\n}\nexports.TypeCheck = TypeCheck;\n// -------------------------------------------------------------------\n// Character\n// -------------------------------------------------------------------\nvar Character;\n(function (Character) {\n function DollarSign(code) {\n return code === 36;\n }\n Character.DollarSign = DollarSign;\n function IsUnderscore(code) {\n return code === 95;\n }\n Character.IsUnderscore = IsUnderscore;\n function IsAlpha(code) {\n return (code >= 65 && code <= 90) || (code >= 97 && code <= 122);\n }\n Character.IsAlpha = IsAlpha;\n function IsNumeric(code) {\n return code >= 48 && code <= 57;\n }\n Character.IsNumeric = IsNumeric;\n})(Character || (Character = {}));\n// -------------------------------------------------------------------\n// MemberExpression\n// -------------------------------------------------------------------\nvar MemberExpression;\n(function (MemberExpression) {\n function IsFirstCharacterNumeric(value) {\n if (value.length === 0)\n return false;\n return Character.IsNumeric(value.charCodeAt(0));\n }\n function IsAccessor(value) {\n if (IsFirstCharacterNumeric(value))\n return false;\n for (let i = 0; i < value.length; i++) {\n const code = value.charCodeAt(i);\n const check = Character.IsAlpha(code) || Character.IsNumeric(code) || Character.DollarSign(code) || Character.IsUnderscore(code);\n if (!check)\n return false;\n }\n return true;\n }\n function EscapeHyphen(key) {\n return key.replace(/'/g, \"\\\\'\");\n }\n function Encode(object, key) {\n return IsAccessor(key) ? `${object}.${key}` : `${object}['${EscapeHyphen(key)}']`;\n }\n MemberExpression.Encode = Encode;\n})(MemberExpression || (MemberExpression = {}));\n// -------------------------------------------------------------------\n// Identifier\n// -------------------------------------------------------------------\nvar Identifier;\n(function (Identifier) {\n function Encode($id) {\n const buffer = [];\n for (let i = 0; i < $id.length; i++) {\n const code = $id.charCodeAt(i);\n if (Character.IsNumeric(code) || Character.IsAlpha(code)) {\n buffer.push($id.charAt(i));\n }\n else {\n buffer.push(`_${code}_`);\n }\n }\n return buffer.join('').replace(/__/g, '_');\n }\n Identifier.Encode = Encode;\n})(Identifier || (Identifier = {}));\n// -------------------------------------------------------------------\n// LiteralString\n// -------------------------------------------------------------------\nvar LiteralString;\n(function (LiteralString) {\n function Escape(content) {\n return content.replace(/'/g, \"\\\\'\");\n }\n LiteralString.Escape = Escape;\n})(LiteralString || (LiteralString = {}));\n// -------------------------------------------------------------------\n// Errors\n// -------------------------------------------------------------------\nclass TypeCompilerUnknownTypeError extends Types.TypeBoxError {\n constructor(schema) {\n super('Unknown type');\n this.schema = schema;\n }\n}\nexports.TypeCompilerUnknownTypeError = TypeCompilerUnknownTypeError;\nclass TypeCompilerTypeGuardError extends Types.TypeBoxError {\n constructor(schema) {\n super('Preflight validation check failed to guard for the given schema');\n this.schema = schema;\n }\n}\nexports.TypeCompilerTypeGuardError = TypeCompilerTypeGuardError;\n// -------------------------------------------------------------------\n// Policy\n// -------------------------------------------------------------------\nvar Policy;\n(function (Policy) {\n function IsExactOptionalProperty(value, key, expression) {\n return index_1.TypeSystemPolicy.ExactOptionalPropertyTypes ? `('${key}' in ${value} ? ${expression} : true)` : `(${MemberExpression.Encode(value, key)} !== undefined ? ${expression} : true)`;\n }\n Policy.IsExactOptionalProperty = IsExactOptionalProperty;\n function IsObjectLike(value) {\n return !index_1.TypeSystemPolicy.AllowArrayObject ? `(typeof ${value} === 'object' && ${value} !== null && !Array.isArray(${value}))` : `(typeof ${value} === 'object' && ${value} !== null)`;\n }\n Policy.IsObjectLike = IsObjectLike;\n function IsRecordLike(value) {\n return !index_1.TypeSystemPolicy.AllowArrayObject\n ? `(typeof ${value} === 'object' && ${value} !== null && !Array.isArray(${value}) && !(${value} instanceof Date) && !(${value} instanceof Uint8Array))`\n : `(typeof ${value} === 'object' && ${value} !== null && !(${value} instanceof Date) && !(${value} instanceof Uint8Array))`;\n }\n Policy.IsRecordLike = IsRecordLike;\n function IsNumberLike(value) {\n return !index_1.TypeSystemPolicy.AllowNaN ? `(typeof ${value} === 'number' && Number.isFinite(${value}))` : `typeof ${value} === 'number'`;\n }\n Policy.IsNumberLike = IsNumberLike;\n function IsVoidLike(value) {\n return index_1.TypeSystemPolicy.AllowNullVoid ? `(${value} === undefined || ${value} === null)` : `${value} === undefined`;\n }\n Policy.IsVoidLike = IsVoidLike;\n})(Policy || (exports.Policy = Policy = {}));\n/** Compiles Types for Runtime Type Checking */\nvar TypeCompiler;\n(function (TypeCompiler) {\n // ----------------------------------------------------------------------\n // Guards\n // ----------------------------------------------------------------------\n function IsAnyOrUnknown(schema) {\n return schema[Types.Kind] === 'Any' || schema[Types.Kind] === 'Unknown';\n }\n // -------------------------------------------------------------------\n // Types\n // -------------------------------------------------------------------\n function* TAny(schema, references, value) {\n yield 'true';\n }\n function* TArray(schema, references, value) {\n yield `Array.isArray(${value})`;\n const [parameter, accumulator] = [CreateParameter('value', 'any'), CreateParameter('acc', 'number')];\n if ((0, guard_1.IsNumber)(schema.maxItems))\n yield `${value}.length <= ${schema.maxItems}`;\n if ((0, guard_1.IsNumber)(schema.minItems))\n yield `${value}.length >= ${schema.minItems}`;\n const elementExpression = CreateExpression(schema.items, references, 'value');\n yield `${value}.every((${parameter}) => ${elementExpression})`;\n if (Types.TypeGuard.TSchema(schema.contains) || (0, guard_1.IsNumber)(schema.minContains) || (0, guard_1.IsNumber)(schema.maxContains)) {\n const containsSchema = Types.TypeGuard.TSchema(schema.contains) ? schema.contains : Types.Type.Never();\n const checkExpression = CreateExpression(containsSchema, references, 'value');\n const checkMinContains = (0, guard_1.IsNumber)(schema.minContains) ? [`(count >= ${schema.minContains})`] : [];\n const checkMaxContains = (0, guard_1.IsNumber)(schema.maxContains) ? [`(count <= ${schema.maxContains})`] : [];\n const checkCount = `const count = value.reduce((${accumulator}, ${parameter}) => ${checkExpression} ? acc + 1 : acc, 0)`;\n const check = [`(count > 0)`, ...checkMinContains, ...checkMaxContains].join(' && ');\n yield `((${parameter}) => { ${checkCount}; return ${check}})(${value})`;\n }\n if (schema.uniqueItems === true) {\n const check = `const hashed = hash(element); if(set.has(hashed)) { return false } else { set.add(hashed) } } return true`;\n const block = `const set = new Set(); for(const element of value) { ${check} }`;\n yield `((${parameter}) => { ${block} )(${value})`;\n }\n }\n function* TAsyncIterator(schema, references, value) {\n yield `(typeof value === 'object' && Symbol.asyncIterator in ${value})`;\n }\n function* TBigInt(schema, references, value) {\n yield `(typeof ${value} === 'bigint')`;\n if ((0, guard_1.IsBigInt)(schema.exclusiveMaximum))\n yield `${value} < BigInt(${schema.exclusiveMaximum})`;\n if ((0, guard_1.IsBigInt)(schema.exclusiveMinimum))\n yield `${value} > BigInt(${schema.exclusiveMinimum})`;\n if ((0, guard_1.IsBigInt)(schema.maximum))\n yield `${value} <= BigInt(${schema.maximum})`;\n if ((0, guard_1.IsBigInt)(schema.minimum))\n yield `${value} >= BigInt(${schema.minimum})`;\n if ((0, guard_1.IsBigInt)(schema.multipleOf))\n yield `(${value} % BigInt(${schema.multipleOf})) === 0`;\n }\n function* TBoolean(schema, references, value) {\n yield `(typeof ${value} === 'boolean')`;\n }\n function* TConstructor(schema, references, value) {\n yield* Visit(schema.returns, references, `${value}.prototype`);\n }\n function* TDate(schema, references, value) {\n yield `(${value} instanceof Date) && Number.isFinite(${value}.getTime())`;\n if ((0, guard_1.IsNumber)(schema.exclusiveMaximumTimestamp))\n yield `${value}.getTime() < ${schema.exclusiveMaximumTimestamp}`;\n if ((0, guard_1.IsNumber)(schema.exclusiveMinimumTimestamp))\n yield `${value}.getTime() > ${schema.exclusiveMinimumTimestamp}`;\n if ((0, guard_1.IsNumber)(schema.maximumTimestamp))\n yield `${value}.getTime() <= ${schema.maximumTimestamp}`;\n if ((0, guard_1.IsNumber)(schema.minimumTimestamp))\n yield `${value}.getTime() >= ${schema.minimumTimestamp}`;\n if ((0, guard_1.IsNumber)(schema.multipleOfTimestamp))\n yield `(${value}.getTime() % ${schema.multipleOfTimestamp}) === 0`;\n }\n function* TFunction(schema, references, value) {\n yield `(typeof ${value} === 'function')`;\n }\n function* TInteger(schema, references, value) {\n yield `(typeof ${value} === 'number' && Number.isInteger(${value}))`;\n if ((0, guard_1.IsNumber)(schema.exclusiveMaximum))\n yield `${value} < ${schema.exclusiveMaximum}`;\n if ((0, guard_1.IsNumber)(schema.exclusiveMinimum))\n yield `${value} > ${schema.exclusiveMinimum}`;\n if ((0, guard_1.IsNumber)(schema.maximum))\n yield `${value} <= ${schema.maximum}`;\n if ((0, guard_1.IsNumber)(schema.minimum))\n yield `${value} >= ${schema.minimum}`;\n if ((0, guard_1.IsNumber)(schema.multipleOf))\n yield `(${value} % ${schema.multipleOf}) === 0`;\n }\n function* TIntersect(schema, references, value) {\n const check1 = schema.allOf.map((schema) => CreateExpression(schema, references, value)).join(' && ');\n if (schema.unevaluatedProperties === false) {\n const keyCheck = CreateVariable(`${new RegExp(Types.KeyResolver.ResolvePattern(schema))};`);\n const check2 = `Object.getOwnPropertyNames(${value}).every(key => ${keyCheck}.test(key))`;\n yield `(${check1} && ${check2})`;\n }\n else if (Types.TypeGuard.TSchema(schema.unevaluatedProperties)) {\n const keyCheck = CreateVariable(`${new RegExp(Types.KeyResolver.ResolvePattern(schema))};`);\n const check2 = `Object.getOwnPropertyNames(${value}).every(key => ${keyCheck}.test(key) || ${CreateExpression(schema.unevaluatedProperties, references, `${value}[key]`)})`;\n yield `(${check1} && ${check2})`;\n }\n else {\n yield `(${check1})`;\n }\n }\n function* TIterator(schema, references, value) {\n yield `(typeof value === 'object' && Symbol.iterator in ${value})`;\n }\n function* TLiteral(schema, references, value) {\n if (typeof schema.const === 'number' || typeof schema.const === 'boolean') {\n yield `(${value} === ${schema.const})`;\n }\n else {\n yield `(${value} === '${LiteralString.Escape(schema.const)}')`;\n }\n }\n function* TNever(schema, references, value) {\n yield `false`;\n }\n function* TNot(schema, references, value) {\n const expression = CreateExpression(schema.not, references, value);\n yield `(!${expression})`;\n }\n function* TNull(schema, references, value) {\n yield `(${value} === null)`;\n }\n function* TNumber(schema, references, value) {\n yield Policy.IsNumberLike(value);\n if ((0, guard_1.IsNumber)(schema.exclusiveMaximum))\n yield `${value} < ${schema.exclusiveMaximum}`;\n if ((0, guard_1.IsNumber)(schema.exclusiveMinimum))\n yield `${value} > ${schema.exclusiveMinimum}`;\n if ((0, guard_1.IsNumber)(schema.maximum))\n yield `${value} <= ${schema.maximum}`;\n if ((0, guard_1.IsNumber)(schema.minimum))\n yield `${value} >= ${schema.minimum}`;\n if ((0, guard_1.IsNumber)(schema.multipleOf))\n yield `(${value} % ${schema.multipleOf}) === 0`;\n }\n function* TObject(schema, references, value) {\n yield Policy.IsObjectLike(value);\n if ((0, guard_1.IsNumber)(schema.minProperties))\n yield `Object.getOwnPropertyNames(${value}).length >= ${schema.minProperties}`;\n if ((0, guard_1.IsNumber)(schema.maxProperties))\n yield `Object.getOwnPropertyNames(${value}).length <= ${schema.maxProperties}`;\n const knownKeys = Object.getOwnPropertyNames(schema.properties);\n for (const knownKey of knownKeys) {\n const memberExpression = MemberExpression.Encode(value, knownKey);\n const property = schema.properties[knownKey];\n if (schema.required && schema.required.includes(knownKey)) {\n yield* Visit(property, references, memberExpression);\n if (Types.ExtendsUndefined.Check(property) || IsAnyOrUnknown(property))\n yield `('${knownKey}' in ${value})`;\n }\n else {\n const expression = CreateExpression(property, references, memberExpression);\n yield Policy.IsExactOptionalProperty(value, knownKey, expression);\n }\n }\n if (schema.additionalProperties === false) {\n if (schema.required && schema.required.length === knownKeys.length) {\n yield `Object.getOwnPropertyNames(${value}).length === ${knownKeys.length}`;\n }\n else {\n const keys = `[${knownKeys.map((key) => `'${key}'`).join(', ')}]`;\n yield `Object.getOwnPropertyNames(${value}).every(key => ${keys}.includes(key))`;\n }\n }\n if (typeof schema.additionalProperties === 'object') {\n const expression = CreateExpression(schema.additionalProperties, references, `${value}[key]`);\n const keys = `[${knownKeys.map((key) => `'${key}'`).join(', ')}]`;\n yield `(Object.getOwnPropertyNames(${value}).every(key => ${keys}.includes(key) || ${expression}))`;\n }\n }\n function* TPromise(schema, references, value) {\n yield `(typeof value === 'object' && typeof ${value}.then === 'function')`;\n }\n function* TRecord(schema, references, value) {\n yield Policy.IsRecordLike(value);\n if ((0, guard_1.IsNumber)(schema.minProperties))\n yield `Object.getOwnPropertyNames(${value}).length >= ${schema.minProperties}`;\n if ((0, guard_1.IsNumber)(schema.maxProperties))\n yield `Object.getOwnPropertyNames(${value}).length <= ${schema.maxProperties}`;\n const [patternKey, patternSchema] = Object.entries(schema.patternProperties)[0];\n const variable = CreateVariable(`${new RegExp(patternKey)}`);\n const check1 = CreateExpression(patternSchema, references, 'value');\n const check2 = Types.TypeGuard.TSchema(schema.additionalProperties) ? CreateExpression(schema.additionalProperties, references, value) : schema.additionalProperties === false ? 'false' : 'true';\n const expression = `(${variable}.test(key) ? ${check1} : ${check2})`;\n yield `(Object.entries(${value}).every(([key, value]) => ${expression}))`;\n }\n function* TRef(schema, references, value) {\n const target = (0, deref_1.Deref)(schema, references);\n // Reference: If we have seen this reference before we can just yield and return the function call.\n // If this isn't the case we defer to visit to generate and set the function for subsequent passes.\n if (state.functions.has(schema.$ref))\n return yield `${CreateFunctionName(schema.$ref)}(${value})`;\n yield* Visit(target, references, value);\n }\n function* TString(schema, references, value) {\n yield `(typeof ${value} === 'string')`;\n if ((0, guard_1.IsNumber)(schema.maxLength))\n yield `${value}.length <= ${schema.maxLength}`;\n if ((0, guard_1.IsNumber)(schema.minLength))\n yield `${value}.length >= ${schema.minLength}`;\n if (schema.pattern !== undefined) {\n const variable = CreateVariable(`${new RegExp(schema.pattern)};`);\n yield `${variable}.test(${value})`;\n }\n if (schema.format !== undefined) {\n yield `format('${schema.format}', ${value})`;\n }\n }\n function* TSymbol(schema, references, value) {\n yield `(typeof ${value} === 'symbol')`;\n }\n function* TTemplateLiteral(schema, references, value) {\n yield `(typeof ${value} === 'string')`;\n const variable = CreateVariable(`${new RegExp(schema.pattern)};`);\n yield `${variable}.test(${value})`;\n }\n function* TThis(schema, references, value) {\n // Note: This types are assured to be hoisted prior to this call. Just yield the function.\n yield `${CreateFunctionName(schema.$ref)}(${value})`;\n }\n function* TTuple(schema, references, value) {\n yield `Array.isArray(${value})`;\n if (schema.items === undefined)\n return yield `${value}.length === 0`;\n yield `(${value}.length === ${schema.maxItems})`;\n for (let i = 0; i < schema.items.length; i++) {\n const expression = CreateExpression(schema.items[i], references, `${value}[${i}]`);\n yield `${expression}`;\n }\n }\n function* TUndefined(schema, references, value) {\n yield `${value} === undefined`;\n }\n function* TUnion(schema, references, value) {\n const expressions = schema.anyOf.map((schema) => CreateExpression(schema, references, value));\n yield `(${expressions.join(' || ')})`;\n }\n function* TUint8Array(schema, references, value) {\n yield `${value} instanceof Uint8Array`;\n if ((0, guard_1.IsNumber)(schema.maxByteLength))\n yield `(${value}.length <= ${schema.maxByteLength})`;\n if ((0, guard_1.IsNumber)(schema.minByteLength))\n yield `(${value}.length >= ${schema.minByteLength})`;\n }\n function* TUnknown(schema, references, value) {\n yield 'true';\n }\n function* TVoid(schema, references, value) {\n yield Policy.IsVoidLike(value);\n }\n function* TKind(schema, references, value) {\n const instance = state.instances.size;\n state.instances.set(instance, schema);\n yield `kind('${schema[Types.Kind]}', ${instance}, ${value})`;\n }\n function* Visit(schema, references, value, useHoisting = true) {\n const references_ = (0, guard_1.IsString)(schema.$id) ? [...references, schema] : references;\n const schema_ = schema;\n // ----------------------------------------------------------------------------------\n // Hoisting\n // ----------------------------------------------------------------------------------\n if (useHoisting && (0, guard_1.IsString)(schema.$id)) {\n const functionName = CreateFunctionName(schema.$id);\n if (state.functions.has(functionName)) {\n return yield `${functionName}(${value})`;\n }\n else {\n const functionCode = CreateFunction(functionName, schema, references, 'value', false);\n state.functions.set(functionName, functionCode);\n return yield `${functionName}(${value})`;\n }\n }\n switch (schema_[Types.Kind]) {\n case 'Any':\n return yield* TAny(schema_, references_, value);\n case 'Array':\n return yield* TArray(schema_, references_, value);\n case 'AsyncIterator':\n return yield* TAsyncIterator(schema_, references_, value);\n case 'BigInt':\n return yield* TBigInt(schema_, references_, value);\n case 'Boolean':\n return yield* TBoolean(schema_, references_, value);\n case 'Constructor':\n return yield* TConstructor(schema_, references_, value);\n case 'Date':\n return yield* TDate(schema_, references_, value);\n case 'Function':\n return yield* TFunction(schema_, references_, value);\n case 'Integer':\n return yield* TInteger(schema_, references_, value);\n case 'Intersect':\n return yield* TIntersect(schema_, references_, value);\n case 'Iterator':\n return yield* TIterator(schema_, references_, value);\n case 'Literal':\n return yield* TLiteral(schema_, references_, value);\n case 'Never':\n return yield* TNever(schema_, references_, value);\n case 'Not':\n return yield* TNot(schema_, references_, value);\n case 'Null':\n return yield* TNull(schema_, references_, value);\n case 'Number':\n return yield* TNumber(schema_, references_, value);\n case 'Object':\n return yield* TObject(schema_, references_, value);\n case 'Promise':\n return yield* TPromise(schema_, references_, value);\n case 'Record':\n return yield* TRecord(schema_, references_, value);\n case 'Ref':\n return yield* TRef(schema_, references_, value);\n case 'String':\n return yield* TString(schema_, references_, value);\n case 'Symbol':\n return yield* TSymbol(schema_, references_, value);\n case 'TemplateLiteral':\n return yield* TTemplateLiteral(schema_, references_, value);\n case 'This':\n return yield* TThis(schema_, references_, value);\n case 'Tuple':\n return yield* TTuple(schema_, references_, value);\n case 'Undefined':\n return yield* TUndefined(schema_, references_, value);\n case 'Union':\n return yield* TUnion(schema_, references_, value);\n case 'Uint8Array':\n return yield* TUint8Array(schema_, references_, value);\n case 'Unknown':\n return yield* TUnknown(schema_, references_, value);\n case 'Void':\n return yield* TVoid(schema_, references_, value);\n default:\n if (!Types.TypeRegistry.Has(schema_[Types.Kind]))\n throw new TypeCompilerUnknownTypeError(schema);\n return yield* TKind(schema_, references_, value);\n }\n }\n // -------------------------------------------------------------------\n // Compiler State\n // -------------------------------------------------------------------\n // prettier-ignore\n const state = {\n language: 'javascript',\n functions: new Map(),\n variables: new Map(),\n instances: new Map() // exterior kind instances\n };\n // -------------------------------------------------------------------\n // Compiler Factory\n // -------------------------------------------------------------------\n function CreateExpression(schema, references, value, useHoisting = true) {\n return `(${[...Visit(schema, references, value, useHoisting)].join(' && ')})`;\n }\n function CreateFunctionName($id) {\n return `check_${Identifier.Encode($id)}`;\n }\n function CreateVariable(expression) {\n const variableName = `local_${state.variables.size}`;\n state.variables.set(variableName, `const ${variableName} = ${expression}`);\n return variableName;\n }\n function CreateFunction(name, schema, references, value, useHoisting = true) {\n const [newline, pad] = ['\\n', (length) => ''.padStart(length, ' ')];\n const parameter = CreateParameter('value', 'any');\n const returns = CreateReturns('boolean');\n const expression = [...Visit(schema, references, value, useHoisting)].map((expression) => `${pad(4)}${expression}`).join(` &&${newline}`);\n return `function ${name}(${parameter})${returns} {${newline}${pad(2)}return (${newline}${expression}${newline}${pad(2)})\\n}`;\n }\n function CreateParameter(name, type) {\n const annotation = state.language === 'typescript' ? `: ${type}` : '';\n return `${name}${annotation}`;\n }\n function CreateReturns(type) {\n return state.language === 'typescript' ? `: ${type}` : '';\n }\n // -------------------------------------------------------------------\n // Compile\n // -------------------------------------------------------------------\n function Build(schema, references, options) {\n const functionCode = CreateFunction('check', schema, references, 'value'); // will populate functions and variables\n const parameter = CreateParameter('value', 'any');\n const returns = CreateReturns('boolean');\n const functions = [...state.functions.values()];\n const variables = [...state.variables.values()];\n // prettier-ignore\n const checkFunction = (0, guard_1.IsString)(schema.$id) // ensure top level schemas with $id's are hoisted\n ? `return function check(${parameter})${returns} {\\n return ${CreateFunctionName(schema.$id)}(value)\\n}`\n : `return ${functionCode}`;\n return [...variables, ...functions, checkFunction].join('\\n');\n }\n /** Generates the code used to assert this type and returns it as a string */\n function Code(...args) {\n const defaults = { language: 'javascript' };\n // prettier-ignore\n const [schema, references, options] = (args.length === 2 && (0, guard_1.IsArray)(args[1]) ? [args[0], args[1], defaults] :\n args.length === 2 && !(0, guard_1.IsArray)(args[1]) ? [args[0], [], args[1]] :\n args.length === 3 ? [args[0], args[1], args[2]] :\n args.length === 1 ? [args[0], [], defaults] :\n [null, [], defaults]);\n // compiler-reset\n state.language = options.language;\n state.variables.clear();\n state.functions.clear();\n state.instances.clear();\n if (!Types.TypeGuard.TSchema(schema))\n throw new TypeCompilerTypeGuardError(schema);\n for (const schema of references)\n if (!Types.TypeGuard.TSchema(schema))\n throw new TypeCompilerTypeGuardError(schema);\n return Build(schema, references, options);\n }\n TypeCompiler.Code = Code;\n /** Compiles a TypeBox type for optimal runtime type checking. Types must be valid TypeBox types of TSchema */\n function Compile(schema, references = []) {\n const generatedCode = Code(schema, references, { language: 'javascript' });\n const compiledFunction = globalThis.Function('kind', 'format', 'hash', generatedCode);\n const instances = new Map(state.instances);\n function typeRegistryFunction(kind, instance, value) {\n if (!Types.TypeRegistry.Has(kind) || !instances.has(instance))\n return false;\n const checkFunc = Types.TypeRegistry.Get(kind);\n const schema = instances.get(instance);\n return checkFunc(schema, value);\n }\n function formatRegistryFunction(format, value) {\n if (!Types.FormatRegistry.Has(format))\n return false;\n const checkFunc = Types.FormatRegistry.Get(format);\n return checkFunc(value);\n }\n function hashFunction(value) {\n return (0, hash_1.Hash)(value);\n }\n const checkFunction = compiledFunction(typeRegistryFunction, formatRegistryFunction, hashFunction);\n return new TypeCheck(schema, references, checkFunction, generatedCode);\n }\n TypeCompiler.Compile = Compile;\n})(TypeCompiler || (exports.TypeCompiler = TypeCompiler = {}));\n","\"use strict\";\n/*--------------------------------------------------------------------------\n\n@sinclair/typebox/compiler\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2023 Haydn Paterson (sinclair) <haydn.developer@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n var desc = Object.getOwnPropertyDescriptor(m, k);\n if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n desc = { enumerable: true, get: function() { return m[k]; } };\n }\n Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ValueErrorIterator = exports.ValueErrorType = void 0;\nvar index_1 = require(\"../errors/index\");\nObject.defineProperty(exports, \"ValueErrorType\", { enumerable: true, get: function () { return index_1.ValueErrorType; } });\nObject.defineProperty(exports, \"ValueErrorIterator\", { enumerable: true, get: function () { return index_1.ValueErrorIterator; } });\n__exportStar(require(\"./compiler\"), exports);\n","import { isBrowser, isNode } from 'browser-or-node'\nimport stringify from 'fast-json-stable-stringify'\n\n////////////\n// CONFIG //\n////////////\n\n//(i) disabled by default bc. the detection logic has disappeared after the refactor.\n//TODO: Find it and check if it works\nlet TIME_PREFIX_ENABLED = false\nlet PERFORMANCE_PREFIX_ENABLED = false\nif (isNode) {\n // console.debug('isNode checking', { process })\n if (process?.env?.LOGGER_TIME_PREFIX) TIME_PREFIX_ENABLED = process?.env?.LOGGER_TIME_PREFIX === 'true'\n if (process?.env?.LOGGER_PERF_PREFIX) PERFORMANCE_PREFIX_ENABLED = process?.env?.LOGGER_PERF_PREFIX === 'true'\n}\nexport let LOGGER_DEFAULT_CONFIG ={\n prefix: undefined as string | undefined,\n time: TIME_PREFIX_ENABLED,\n delta: PERFORMANCE_PREFIX_ENABLED,\n dimDebugOnServer: true,\n printOriginOnServer: true,\n serverInspectOptions: {},\n customFormattersOnServer: true,\n // Depth of stacktrace to show on server\n // - integer saying how many lines\n // - false to disable, true for all\n printStackLinesOnServer: false as boolean | number,\n dim: true,\n}\n\nexport type Config = Partial<typeof LOGGER_DEFAULT_CONFIG>\nexport type ConsoleFx = (...data: any[]) => void\nexport const StringFormatters = [\n // Format to string (Client console - currently not on server)\n // {\n // match: obj => obj instanceof Model,\n // format: m => {\n // const { displayName } = m\n // return `${m.constructor.name}#${m.ID}${displayName ? `{${displayName}}` : ''}`\n // },\n // },\n] as unknown as {\n match: (obj: any) => boolean\n format: (m: any) => string\n}[]\n\n// let applyCustomFormatters;\n// applyCustomFormatters = (value, config) => {\n// for (const formatter of StringFormatters) {\n// if (formatter.match(value)) return formatter.format(value);\n// }\n// if (!_.isString(value)) {\n// return util.inspect(value, config.inspectOptionsOnServer);\n// }\n// return value;\n// };\n\n/// ////////////////\n// RUNTIME STUFF //\n/// ////////////////\n\nexport class LoggerTime {\n sinceFirst = 0\n sinceLast = 0\n time = false\n delta = false\n constructor(sinceFirst: number, sinceLast: number, time: boolean, delta: boolean) {\n Object.assign(this, { sinceFirst, sinceLast, time, delta })\n }\n\n toString() {\n const sinceFirstNum = (this.sinceFirst * 0.001)\n const sinceFirst = sinceFirstNum.toFixed(sinceFirstNum < 5 ? 2 : 1) /* .padStart(3, ' ') */\n const sinceLast\n = this.sinceLast < 1000 // when >= 1s, format as seconds\n ? `${this.sinceLast.toFixed(0)}`.padStart(5, ' ')\n : `${`${(this.sinceLast * 0.001).toFixed(this.sinceLast < 10000 ? 1 : 0)}`.padStart(4, ' ')}s`\n return `[${[this.time ? sinceFirst : null, this.delta ? sinceLast : null]\n .filter(t => t!=null)\n .join(',')}]`\n }\n}\n\nexport class Style {\n constructor(style: string, string: string) {\n Object.assign(this, { style, string })\n }\n}\nlet formattersEnabled = false // for tracking if chrome formatters are enabled (don't change manually)\n\nexport class Logger {\n static ERROR = 2 as const\n static WARN = 4 as const\n static INFO = 6 as const // alias for LOG\n static LOG = 6 as const\n static DEBUG = 8 as const\n static VERBOSE = 10 as const\n\n static firstLog = 0\n static lastLog = 0\n\n /**\n * This is a clever way to log without the extra check on each log line.\n * Use it like this:\n * ```\n * const { WARN, LOG, DEBUG, VERBOSE } = Logger.setup(Logger.INFO); // eslint-disable-line no-unused-vars\n * LOG('message', data);\n * DEBUG(this.collectionName, '...')\n * if (!VERBOSE.isDisabled) {\n * const verboseStuff = generateVerboseStuff(); // computationally intensive\n * VERBOSE('Here it is:', verboseStuff)\n * }\n * ```\n *\n * @ param {number} level See {@link LVs}\n * @ param {object} config see LOGGER_DEFAULT_CONFIG\n * @ typedef {Function & {isDisabled: boolean, isEnabled: boolean, ...}} LogFunc\n * @ returns {{LOG: LogFunc, VERBOSE: LogFunc, DEBUG: LogFunc, WARN: LogFunc, ERROR: LogFunc}}\n */\n static setup(level: 2 | 4 | 6 | 8 | 10 = Logger.INFO, config: Config = {}) {\n config = Object.assign({}, LOGGER_DEFAULT_CONFIG, config) // defaults(config, LOGGER_DEFAULT_CONFIG) // fyi this is like the reverse of Object.assign\n if (level > 10) console.debug('setup logger', { config }) // manual overide to level:11 to show this trace\n\n const debugLogForStub = this.wrapLog(console.debug, { ...config, dim: config.dimDebugOnServer })\n const stub = (...args: any[]) => {\n // @ts-expect-error hack to enable DEBUG logging EVERYWHERE\n if (typeof window !== 'undefined' && window?.FORCE_DISABLE_LOGLEVEL)\n debugLogForStub(...args)\n } // For disabled log-levels, we just return a stub function\n stub.isDisabled = true // this makes it possible to check, e.g. `DEBUG.isDisabled`\n stub.isEnabled = false // depending on syntactic preference\n const groupCollapsed = this.wrapLog(console.groupCollapsed, config)\n\n const addExtraFxs = (enabled: boolean, func: (...T: any) => void) =>/* : ((...T) => void & {isDisabled: boolean}) */ {\n // warning - weird TS hacks approaching:\n function group<T extends Func>(\n ...args: [...any[], T]\n ): ReturnType<T> extends Promise<any> ? Promise<ReturnType<T>> : ReturnType<T> {\n const functionToWrap = args[args.length - 1] as T\n\n if (functionToWrap as Func === stub)\n return functionToWrap() as ReturnType<T>\n\n groupCollapsed(...args.slice(0, -1)) // except last\n\n const asyncWrapper = async () => {\n try {\n const result = functionToWrap()\n return result instanceof Promise ? await result : result\n } finally {\n console.groupEnd()\n }\n }\n\n return asyncWrapper() as ReturnType<T> // Cast to bypass the Promise type inference\n }\n\n const realFunc = Object.assign(\n func.bind({}), // clone function - https://stackoverflow.com/a/6772648\n {\n isEnabled: enabled,\n isDisabled: !enabled,\n group,\n force: func,\n },\n )\n if (enabled) {\n return realFunc\n } else {\n return Object.assign(\n stub.bind({}), // clone stub function - https://stackoverflow.com/a/6772648\n {\n isEnabled: enabled,\n isDisabled: !enabled,\n group,\n force: realFunc,\n },\n )\n }\n }\n\n const ERRFX = addExtraFxs(level >= Logger.ERROR, this.wrapLog(console.error, config))\n const ERROR = (...params: any[]) => {\n ERRFX(...params)\n return new Error(stringify(params)) // return so we can throw it, stringify is fast & safe with circular references\n }\n\n // console.debug(\"Logger init:\", config)\n return {\n ERROR,\n WARN: addExtraFxs(level >= Logger.WARN, this.wrapLog(console.warn, config)),\n LOG: addExtraFxs(level >= Logger.INFO, this.wrapLog(console.log, config)),\n DEBUG: addExtraFxs(level >= Logger.DEBUG, this.wrapLog(console.log, { ...config, dim: config.dimDebugOnServer })), // not using console.debug as that requires dev tools verbose to be enabled\n VERBOSE: addExtraFxs(level >= Logger.VERBOSE, this.wrapLog(console.debug, { ...config, dim: config.dimDebugOnServer })),\n }\n }\n\n static wrapLog(logFunc: ConsoleFx, config: Config) {\n if (!isNode) {\n // ℹ In browser we can only do some of the fancy things, because we cannot call console.log ourselves,\n // as that would pollute the stacktrace\n\n // ℹ Would be nice to get formtted links in devtools, but <a> tags are not allowed:\n // const stack = new Error().stack;\n // const origin = Logger.getOriginFromStack(stack);\n // const originFilename = origin.split('\\\\').pop().split('/').pop(); // eslint-disable-line\n // if (origin) fixedArgs.push({ link: originFilename, href: `http://localhost:63342/api/file/${origin}` });\n\n // on the client, we need to return the original log function, as otherwise the origin of the log is set to here\n // But luckily we can bind fixed parameters on the function:\n const fixedArgs = []\n // if the custom formatters are enabled, and we want performance logging - we add an instance of P as a static prefix\n if (config.time || config.delta) {\n const isChrome = isBrowser && navigator.userAgent.includes('Chrome')\n\n const p = isChrome\n ? ['', Logger.timeStr(!!config.time, !!config.delta)] // this is a placeholder that gets replaced by the custom formatter\n : [] // [{ get perfNiceTry () { return Logger.timeStr(,,true) } }] // this (of course) shows the time when you click the getter\n fixedArgs.push(...p) // if we start with a non-string, all strings are rendered with quotes :/\n }\n if (config.prefix) {\n if (formattersEnabled)\n fixedArgs.push(new Style('dim', config.prefix))\n else fixedArgs.push(config.prefix)\n }\n // console.log('logger-log', { config, fixedArgs })\n return logFunc.bind(console, ...fixedArgs)\n } else {\n // ℹ in nodejs we print the stack trace origin ourselves, so we can do a lot more things\n // TODO: re-import removed code - https://gitlab.com/onezoomin/ztax/ztax/-/commit/f6f9bde617cd9ae93d1bc4bc49a4b5275e4cbff2#b1d1e091ca27ae560becf7ae1b27a4d53d39c061\n return logFunc.bind(console)\n }\n }\n\n // static log(msg, logPerformance = true) {\n // const p = this.perf();\n // return logPerformance ? `${p} ${msg}` : msg;\n // }\n\n static timeStr(time: boolean, delta: boolean, returnAsString = 0): LoggerTime | string | undefined {\n if (!performance.now)\n return undefined // TODO: server? p = { now: require('performance-now') };\n const now = performance.now()\n if (!Logger.firstLog) {\n Logger.firstLog = now\n Logger.lastLog = now\n }\n const p = new LoggerTime(now - Logger.firstLog, now - Logger.lastLog, time, delta)\n Logger.lastLog = now\n return returnAsString ? p.toString() : p\n }\n\n // (for nodejs) ~ https://stackoverflow.com/a/47296370/1633985\n static getOriginFromStack(stack: any): string | undefined {\n let skippedFirst = false // the first one is Logger.js\n for (const line of stack.split('\\n')) {\n const matches = line.match(/^\\s+at\\s+(.*)/)\n if (matches) {\n if (skippedFirst) {\n // first line - current function\n // second line - caller (what we are looking for)\n return (\n matches[1]\n .trim() // Removes spaces\n // .replace(/^module /, '') // Removes 'module ' at beginning\n // .replace(/^at /, '') // Removes 'at ' at beginning\n // .replace(/^ \$/, '') // Removes parentheseses around file\n // .replace(/\$$/, '') // -||-\n .replace(__dirname, '') // Removes script folder path (if exists)\n )\n }\n skippedFirst = true\n }\n }\n }\n}\n\nif (isBrowser) { // isBrowser is not true for web workers\n // CLIENT or Worker //\n\n // @ts-expect-error window hack\n window.devtoolsFormatters = window.devtoolsFormatters ?? []\n // noinspection JSUnusedGlobalSymbols\n // @ts-expect-error window hack\n window.devtoolsFormatters.push(\n {\n // Custom formatters\n header: (obj: any) => {\n if (StringFormatters && StringFormatters.length) {\n for (const formatter of StringFormatters) {\n if (formatter.match(obj))\n return ['span', {}, formatter.format(obj)]\n }\n }\n return null\n },\n hasBody: () => true,\n },\n {\n // Performance object //\n // This is a sneaky way to show performance info withouth any extra calls when logging:\n // LOG(`...`)\n // it would work without this if we would have some way to intercept the call:\n // L.INFO('...') - a getter on L that adds the current time as prefix\n // LOG('...')() - returns the log function with all argumends bound\n // But instead we are adding a custom formatter that replaced the placeholder object of class P with the performance info\n header: (obj: any) => {\n if (!(obj instanceof LoggerTime))\n return null\n if (!formattersEnabled)\n formattersEnabled = true\n const p = Logger.timeStr(obj.time, obj.delta)\n return [\n 'span',\n { style: 'font-weight: light; color: grey' },\n p?.toString(),\n // ['a', { href: 'vscodium://file/home/manu/dev/tamera/bookr/imports/lib/utils/Logger.js' }, 'WOW'],\n ]\n },\n hasBody: () => false,\n },\n {\n // Style object\n header: (obj: { string: any }) => {\n if (!(obj instanceof Style))\n return null\n if (!formattersEnabled)\n formattersEnabled = true\n return ['span', { style: 'font-weight: light; color: grey; '/* font-style: italic; */ }, obj.string]\n },\n hasBody: () => false,\n },\n )\n}\nelse if (isNode) {\n // SERVER //\n // node stuff removed as it breaks/bloats webworker build\n}\n\nexport function logriniTest(): string {\n return 'logrini'\n}\n\ntype Func<T = any> = () => T\n","import cjsModule from '../index.js'\n\nexport const configure = cjsModule.configure\n\nexport const stringify = cjsModule\nexport default cjsModule\n","import { Logger } from 'besonders-logger'\nimport {\n\t_getGlobalState,\n\t_isComputingDerivation,\n\tautorun,\n\tcomparer,\n\tcomputed,\n\tconfigure,\n\tgetAtom,\n\tgetDebugName,\n\tgetDependencyTree,\n\tgetObserverTree,\n\tIComputedValue,\n\tIObservableArray,\n\tisAction,\n\tobservable,\n\tObservableMap,\n\tObservableSet,\n\tonBecomeObserved,\n\tonBecomeUnobserved,\n\tReaction,\n\trunInAction,\n\tspy,\n\ttoJS,\n\ttrace,\n\tuntracked,\n} from 'mobx'\n// import { IComputedFnOptions } from 'npm:mobx-utils/lib/computedFn' // HACK - for jsr\nimport { IComputedFnOptions } from 'mobx-utils/lib/computedFn'\nimport stringify from 'safe-stable-stringify'\nimport type { Applog, DatalogQueryPattern } from '../applog/datom-types'\nimport type { QueryResult } from '../query/types'\nimport type { Thread } from '../thread/basic'\nimport { ArrayType, ReadonlyObservableArray, ReadonlyObservableSet } from '../types/typescript-utils'\n\nconst PERF_CHECK = 100\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport const rootsQueries = observable.set()\n\n// mobx linting - https://mobx.js.org/configuration.html#linting-options\nconfigure({\n\tenforceActions: 'always',\n\t// disableErrorBoundaries: true // (i) this can be useful in case of exceptions to see where they were caused - https://mobx.js.org/configuration.html#disableerrorboundaries-boolean\n\t// computedRequiresReaction: true,\n\t// reactionRequiresObservable: true,\n\t// observableRequiresReaction: true,\n})\n// https://mobx.js.org/installation.html#use-spec-compliant-transpilation-for-class-properties\nif (\n\t!new class {\n\t\txyz\n\t}().hasOwnProperty('xyz')\n) throw new Error('Transpiler is not configured correctly')\n\nexport const createDebugName = ({ caller, thread, pattern, args }: {\n\tcaller?: string\n\tthread?: Thread | Applog[]\n\tpattern?: DatalogQueryPattern | DatalogQueryPattern[] | string // ? | any\n\targs?: any\n}) => {\n\treturn untracked(() => {\n\t\targs = args || pattern\n\t\tconst str = `${(!Array.isArray(thread) && thread?.name) ? thread.name + ' | ' : ''}`\n\t\t\t+ `${caller ?? 'caller?'}`\n\t\t\t+ `${args ? `{${typeof args === 'string' ? args : stringify(args)}}` : ''}`\n\t\treturn str\n\t})\n}\nexport const createDebugNameObj = (args: Parameters<typeof createDebugName>[0]) => {\n\treturn { name: createDebugName(args) } as const\n}\n\nexport function computedStructuralComparer<T>(a: IComputedValue<T>, b: IComputedValue<T>) {\n\treturn untracked(() => comparer.structural(a.get(), b.get()))\n}\nexport function applogThreadComparer(a: Thread, b: Thread) {\n\treturn comparer.shallow(a.applogs, b.applogs)\n}\nexport function queryNodesComparer(a: QueryResult, b: QueryResult) {\n\tif (a.size !== b.size) return false\n\tfor (let i = 0; i < a.size; i++) {\n\t\tconst nodeA = a.nodes[i]\n\t\tconst nodeB = b.nodes[i]\n\t\tif (VERBOSE.isEnabled) VERBOSE(`queryNodesComparer`, i, nodeA, nodeB)\n\t\tif (!comparer.structural(nodeA.variables, nodeB.variables)) {\n\t\t\tif (VERBOSE.isEnabled) VERBOSE(`[queryNodesComparer] changed vars:`, i, nodeA, nodeB)\n\t\t\treturn false\n\t\t}\n\t\t// ? compare logsOfAllTrails?\n\t\tif (!applogThreadComparer(nodeA.logsOfThisNode, nodeB.logsOfThisNode)) {\n\t\t\tif (VERBOSE.isEnabled) VERBOSE(`[queryNodesComparer] changed logsOfThisNode:`, i, nodeA, nodeB)\n\t\t\treturn false\n\t\t}\n\t}\n\tif (VERBOSE.isEnabled) VERBOSE(`[queryNodesComparer] equal:`, { a, b })\n\treturn true\n}\n\nlet observableArrayMapID = 0\nexport function observableArrayMap<T>(fn: () => readonly T[], { name, equals }: {\n\tname?: string\n\tequals?: typeof comparer.structural\n} = {}) {\n\tconst debugName = `observableArrayMap@${++observableArrayMapID}{${name}}`\n\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] create`, { fnname: fn.name, fn, name, equals })\n\n\tlet observableArr: IObservableArray<T>\n\n\tconst disposeAutorun = autorunButAlsoImmediately(\n\t\tfn,\n\t\t(items) => {\n\t\t\tif (!observableArr) {\n\t\t\t\tobservableArr = observable.array(items, /* ['NEVER'] as T[] */ { deep: false, name, equals })\n\t\t\t} else {\n\t\t\t\tif (!untracked(() => (equals ?? comparer.structural)(observableArr, items))) { // ? is this not handled by mobx\n\t\t\t\t\tobservableArr.replace(items)\n\t\t\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] updated`, { updatedItems: items, observableArr })\n\t\t\t\t} else {\n\t\t\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] update skipped`, { updatedItems: items, observableArr })\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: debugName },\n\t)\n\n\tif (debugName.includes('useRoots')) {\n\t\tvar rootsAtom = getAtom(observableArr)\n\t\tDEBUG(`[${debugName}] deps`, { disposeAutorun, rootsAtom, observableArr, observers: getObserverTree(observableArr) })\n\t\trunInAction(() => rootsQueries.add(rootsAtom))\n\t}\n\tif (VERBOSE.isEnabled) {\n\t\tonBecomeObserved(observableArr, () => {\n\t\t\tVERBOSE(`[${debugName}] observed`, getObserverTree(observableArr), { rootsAtom, observableArr })\n\t\t})\n\t}\n\t// WARN: if the array never becomes observed, it doesn't become unobserved...\n\t/*const unobserveUnobserving =*/ onBecomeUnobserved(observableArr, () => {\n\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] dispose`)\n\t\t// unobserveUnobserving() - not necessary\n\t\tif (rootsAtom) runInAction(() => rootsQueries.delete(rootsAtom))\n\t\tdisposeAutorun()\n\t})\n\treturn observableArr as ReadonlyObservableArray<T>\n}\n\nlet observableSetMapID = 0\n/** ! WARN ObservableSet doesn't have fine-grained reactivity - https://github.com/mobxjs/mobx/issues/3761 **/\nexport function observableSetMap<T>(fn: () => readonly T[], { name }: {\n\tname?: string\n\t// equals?: typeof comparer.structural\n} = {}) {\n\tconst debugName = `observableSetMap@${++observableSetMapID}{${name}}`\n\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] create`, { fnname: fn.name, fn, name })\n\n\tlet observableSet: ObservableSet<T>\n\n\tconst disposeAutorun = autorunButAlsoImmediately(\n\t\tfn,\n\t\t(items) => {\n\t\t\tif (!observableSet) {\n\t\t\t\tobservableSet = observable.set(items, /* ['NEVER'] as T[] */ { deep: false, name })\n\t\t\t} else {\n\t\t\t\tconst { deleted, added } = untracked(() => {\n\t\t\t\t\tconst unseen = new Set(observableSet.values())\n\t\t\t\t\tconst added = new Set<T>()\n\t\t\t\t\tfor (const item of items) {\n\t\t\t\t\t\t// (equals ?? comparer.structural)(observableSetItem, item)))\n\t\t\t\t\t\tif (observableSet.has(item)) {\n\t\t\t\t\t\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] unchanged`, item, { updatedItems: items, observableSet })\n\t\t\t\t\t\t\tunseen.delete(item)\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tadded.add(item)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] updated:`, { unseen, added, updatedItems: items, observableSet })\n\t\t\t\t\treturn {\n\t\t\t\t\t\tadded,\n\t\t\t\t\t\tdeleted: unseen,\n\t\t\t\t\t}\n\t\t\t\t})\n\t\t\t\tfor (const del of deleted) observableSet.delete(del)\n\t\t\t\tfor (const add of added) observableSet.add(add)\n\t\t\t}\n\t\t},\n\t\t{ name: debugName },\n\t)\n\n\tif (debugName.includes('useRoots')) {\n\t\tvar rootsAtom = getAtom(observableSet)\n\t\tif (DEBUG.isEnabled) {\n\t\t\tDEBUG(`[${debugName}] deps`, { disposeAutorun, rootsAtom, observableSet, observers: getObserverTree(observableSet) })\n\t\t}\n\t\trunInAction(() => rootsQueries.add(rootsAtom))\n\t}\n\tif (VERBOSE.isEnabled) {\n\t\tonBecomeObserved(observableSet, () => {\n\t\t\tVERBOSE(`[${debugName}] observed`, getObserverTree(observableSet), { rootsAtom, observableSet })\n\t\t})\n\t}\n\t// WARN: if the array never becomes observed, it doesn't become unobserved...\n\t/*const unobserveUnobserving =*/ onBecomeUnobserved(observableSet, () => {\n\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] dispose`)\n\t\t// unobserveUnobserving() - not necessary, as we dispose\n\t\tif (rootsAtom) runInAction(() => rootsQueries.delete(rootsAtom))\n\t\tdisposeAutorun()\n\t})\n\treturn observableSet as ReadonlyObservableSet<T>\n}\n\n// export function observableArrayMap<T>(fn: () => T[], { name, equals }: {\n// \tname?: string\n// \tequals?: typeof comparer.structural\n// } = {}) {\n// \t// if (!name) name = `${fn.name}_${fn.pattern}`\n// \tif (VERBOSE.isEnabled) VERBOSE(`[observableArrayMap] create`, { fnname: fn.name, fn, name, equals })\n// \tconst debugName = `observableArrayMap@${++observableArrayMapID}{${name}}`\n\n// \tlet observableArr: IObservableArray<T>\n// \tlet items\n\n// \tfunction runAndTrack() {\n// \t\treaction.track(() => {\n// \t\t\tlet start = PERF_CHECK && performance.now()\n// \t\t\tif(DEBUG.isEnabled) DEBUG(`[${debugName}] runAndTrack:`, { name: name ?? fn.name, fn })\n// \t\t\titems = fn()\n// \t\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] runAndTrack =>`, items)\n// \t\t\tif (PERF_CHECK && performance.now() - start > PERF_CHECK) {\n// \t\t\t\tWARN(`[${debugName}] took ${performance.now() - start}ms`)\n// \t\t\t}\n// \t\t})\n// \t}\n\n// \tconst reaction = new Reaction(debugName, (...args) => {\n// \t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] reaction.invalidate`, args)\n// \t\trunAndTrack()\n// \t\trunInAction(() => {\n// \t\t\tif (!(equals ?? comparer.structural)(observableArr, items)) {\n// \t\t\t\tobservableArr.replace(items)\n// \t\t\t}\n// \t\t})\n// \t})\n// \trunAndTrack() // initial run\n\n// \tobservableArr = observable.array(items, /* ['NEVER'] as T[] */ { deep: false, name })\n// \tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] deps of reaction`, getDependencyTree(reaction), 'array:', getDependencyTree(observableArr), {\n// \t\treaction,\n// \t\tobservableArr,\n// \t})\n\n// \tconst unobserveUnobserving = onBecomeUnobserved(observableArr, () => {\n// \t\tif (VERBOSE.isEnabled) VERBOSE(`[observableArrayMap] dispose`)\n// \t\t// disposer()\n// \t\tunobserveUnobserving()\n// \t\treaction.dispose()\n// \t})\n// \treturn observableArr\n// }\n\nlet observableMapMapID = 0\nexport function observableMapMap<K, V>(fn: () => Array<readonly [K, V]>, { name, equals }: {\n\tname?: string\n\tequals?: typeof comparer.structural\n} = {}) {\n\tconst debugName = `observableMapMap@${++observableMapMapID}{${name}}`\n\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] create`, { fnname: fn.name, fn, name, equals })\n\n\tlet observableMap: ObservableMap<K, V>\n\n\tconst dispose = autorunButAlsoImmediately(\n\t\tfn,\n\t\t(items) => {\n\t\t\tif (!observableMap) {\n\t\t\t\tobservableMap = observable.map(items, /* ['NEVER'] as T[] */ { deep: false, name })\n\t\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] initial`, { items, observableMap })\n\t\t\t} else {\n\t\t\t\tif (!untracked(() => (equals ?? comparer.structural)([...observableMap.entries()], items))) { // ? is this not handled by mobx\n\t\t\t\t\t// FIXME: does not ignore order (which is kind of to be expected)\n\t\t\t\t\tobservableMap.replace(items)\n\t\t\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] updated`, { items, observableMap })\n\t\t\t\t} else if (DEBUG.isEnabled) DEBUG(`[${debugName}] update skipped`, { items, observableMap })\n\t\t\t}\n\t\t},\n\t\t{ name: debugName },\n\t)\n\tif (VERBOSE.isEnabled) autorun(() => VERBOSE(`[${debugName}] result change`, toJS(observableMap)))\n\n\tconst unobserveUnobserving = onBecomeUnobserved(observableMap, () => {\n\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] dispose`)\n\t\tunobserveUnobserving()\n\t\t// dispose()\n\t\tsetTimeout(() => dispose()) // HACK for maximum callstack size\n\t})\n\treturn observableMap\n}\n\nexport function autorunButAlsoImmediately<T>(\n\tfn: () => T,\n\t// init: (T) => any,\n\tupdate: (T) => any = null, // TODO: refactor to actually remove this function too\n\t{ name }: { name?: string } = {},\n) {\n\tif (DEBUG.isEnabled) DEBUG(`[autorunButAlsoImmediately] create`, { fnname: fn.name, fn, name })\n\tconst debugName = `${name}.autorunImm`\n\n\tlet result: T\n\tconst reaction = new Reaction(debugName, function autorunImmReaction(...args) {\n\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] reaction.invalidate`, args)\n\t\trunAndTrack()\n\t\t// runInAction(() => {\n\t\t// \tupdate(result)\n\t\t// })\n\t})\n\tfunction runAndTrack() {\n\t\treaction.track(function autorunImmRunAndTrack() {\n\t\t\tlet start = PERF_CHECK && performance.now()\n\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] runAndTrack:`, { name: name ?? fn.name, fn })\n\t\t\tresult = fn()\n\t\t\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] runAndTrack =>`, result)\n\n\t\t\trunInAction(() => {\n\t\t\t\tupdate?.(result)\n\t\t\t})\n\t\t\tif (PERF_CHECK && performance.now() - start > PERF_CHECK) {\n\t\t\t\tWARN(`[${debugName}] took ${performance.now() - start}ms`)\n\t\t\t}\n\t\t})\n\t}\n\n\trunAndTrack() // initial run\n\tif (DEBUG.isEnabled) DEBUG(`[${debugName}] deps of reaction`, { reaction, result, deps: getDependencyTree(reaction) })\n\n\t// THIS STRATEGIES DON'T WORK BECAUSE:\n\t// - Affected reactions run by default immediately (synchronously) if an observable is changed.\n\t// However, they won't run before the end of the current outermost (trans)action.\n\t// (https://mobx.js.org/reactions.html#rules)\n\n\t// const disposer = reaction(\n\t// () => {\n\t// const items = fn();\n\t// if (VERBOSE.isEnabled) VERBOSE(`[observableArrayMap] reaction.check`, items)\n\t// return items\n\t// }, // This function defines what to track\n\t// (items, reaction) => {\n\t// if (VERBOSE.isEnabled) VERBOSE(`[observableArrayMap] reaction.react`, items, reaction)\n\t// runInAction(() => observableArr.replace(items))\n\t// },\n\t// {\n\t// fireImmediately: true // This ensures the reaction runs immediately upon creation\n\t// }\n\t// );\n\n\t// const disposer = autorun(() => {\n\t// const newItems = fn();\n\t// if (VERBOSE.isEnabled) VERBOSE(`[observableArrayMap] items:`, newItems)\n\t// runInAction(() => observableArr.replace(newItems))\n\t// })\n\n\tconst dispose = () => {\n\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] dispose`)\n\t\t// reaction.dispose()\n\t\tsetTimeout(() => reaction.dispose()) // HACK for maximum callstack size\n\t}\n\treturn dispose\n}\n\n/**\n * ADAPTED from https://github.com/mobxjs/mobx-utils/blob/362cbbfb384820d416f253eddc532ebecba89bcb/src/computedFn.ts#L50 to\n * - deep-compare arguments\n * - allow dynamic/optional args\n * - not be so friggin complicated... DeepMap... closest... why?!\n *\n * // TODO: PR upthread\n *\n * computedFnDeepCompare takes a function with an arbitrary amount of arguments,\n * and memoizes the output of the function based on the arguments passed in.\n *\n * computedFnDeepCompare(fn) returns a function with the very same signature. There is no limit on the amount of arguments\n * that is accepted.\n *\n * By default the output of a function call will only be memoized as long as the\n * output is being observed.\n *\n * The function passes into `computedFnDeepCompare` should be pure, not be an action and only be relying on\n * observables.\n *\n * Setting `keepAlive` to `true` will cause the output to be forcefully cached forever.\n * Note that this might introduce memory leaks!\n *\n * @example\n * const store = observable({\n * \ta: 1,\n * \tb: 2,\n * \tc: 3,\n * \tm: computedFnDeepCompare(function(x) {\n * \t\treturn this.a * this.b * x\n * \t})\n * })\n * const d = autorun(() => {\n * \t// store.m(3) will be cached as long as this autorun is running\n * \tconsole.log(store.m(3) * store.c)\n * })\n *\n * @param fn\n * @param keepAliveOrOptions\n */\nexport function computedFnDeepCompare<T extends (...args: any[]) => any>(\n\tname: string,\n\tfn: T,\n\tkeepAliveOrOptions: (IComputedFnOptions<T> & { argsDebugName?: (...args: Parameters<T>) => string }) | boolean = false,\n): T {\n\tif (isAction(fn)) throw new Error(\"computedFnDeepCompare shouldn't be used on actions\")\n\n\tlet memoWarned = false\n\tlet i = 0\n\tconst opts = typeof keepAliveOrOptions === 'boolean'\n\t\t? { keepAlive: keepAliveOrOptions }\n\t\t: keepAliveOrOptions\n\tconst map = new Map<Parameters<T>, IComputedValue<any>>()\n\n\treturn function(this: any, ...args: Parameters<T>): ReturnType<T> {\n\t\tlet existing\n\t\tconst untrackedArgs = untracked(() => args)\n\t\tconst debugName = `computedFnDeepCompare(${name || fn.name}#${++i})${opts.argsDebugName ? `{${opts.argsDebugName(...args)}}` : ''}`\n\n\t\tfor (let [existingArgs, computation] of map.entries()) {\n\t\t\tif (comparer.structural(existingArgs, untrackedArgs)) {\n\t\t\t\texisting = computation\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\t// cache hit, return\n\t\tif (existing) {\n\t\t\tconst cachedResult = existing.get()\n\t\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] cache hit`, { untrackedArgs, cachedResult })\n\t\t\treturn cachedResult\n\t\t}\n\n\t\t// if function is invoked, and its a cache miss without reactive, there is no point in caching...\n\t\tif (!opts.keepAlive && !_isComputingDerivation()) {\n\t\t\tif (!memoWarned && _getGlobalState().computedRequiresReaction) {\n\t\t\t\tconsole.warn(\n\t\t\t\t\t\"invoking a computedFn from outside an reactive context won't be memoized, unless keepAlive is set\",\n\t\t\t\t)\n\t\t\t\tmemoWarned = true\n\t\t\t}\n\t\t\treturn fn.apply(this, args)\n\t\t}\n\n\t\t// create new entry\n\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] new computation`, { untrackedArgs })\n\t\tlet latestValue: ReturnType<T> | undefined\n\t\tconst computation = computed(\n\t\t\t() => {\n\t\t\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] update->rerun`, untracked(() => ({ args })), fn)\n\t\t\t\tif (VERBOSE.isEnabled) trace()\n\t\t\t\treturn (latestValue = fn.apply(this, args))\n\t\t\t},\n\t\t\t{\n\t\t\t\t...opts,\n\t\t\t\tname: debugName,\n\t\t\t},\n\t\t)\n\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] deps`, getDependencyTree(computation), { untrackedArgs })\n\t\tmap.set(untrackedArgs, computation)\n\n\t\t// clean up if no longer observed\n\t\tif (!opts.keepAlive) {\n\t\t\tconst unobserveUnobserving = onBecomeUnobserved(computation, () => {\n\t\t\t\tif (VERBOSE.isEnabled) VERBOSE(`[${debugName}] dispose`, computation)\n\t\t\t\tunobserveUnobserving()\n\t\t\t\tmap.delete(untrackedArgs)\n\t\t\t\tif (opts.onCleanup) opts.onCleanup(latestValue, ...args)\n\t\t\t\tlatestValue = undefined\n\t\t\t})\n\t\t}\n\t\t// return current val\n\t\treturn computation.get()\n\t} as any\n}\n\nexport function prettifyThreadName(input: string): string {\n\tlet depth = 0\n\tlet result = ''\n\tlet insideCurlyBraces = 0\n\n\tfor (let i = 0; i < input.length; i++) {\n\t\tconst char = input[i]\n\n\t\tif (char === '(') {\n\t\t\tresult += char + '\\n' + '\\t'.repeat(++depth)\n\t\t} else if (char === ')') {\n\t\t\tresult += '\\n' + '\\t'.repeat(--depth) + char\n\t\t} else if (char === ',' && insideCurlyBraces === 0) {\n\t\t\tresult += char + '\\n' + '\\t'.repeat(depth)\n\t\t} else if (char === '{' && insideCurlyBraces === 0) {\n\t\t\tinsideCurlyBraces++\n\t\t\tresult += char + '\\n' + '\\t'.repeat(depth + 1)\n\t\t} else if (char === '}' && insideCurlyBraces === 1) {\n\t\t\tinsideCurlyBraces--\n\t\t\tresult += '\\n' + '\\t'.repeat(depth) + char\n\t\t} else if (char === '{' && insideCurlyBraces > 0) {\n\t\t\tinsideCurlyBraces++\n\t\t\tresult += char\n\t\t} else if (char === '}' && insideCurlyBraces > 1) {\n\t\t\tinsideCurlyBraces--\n\t\t\tresult += char\n\t\t} else {\n\t\t\tresult += char\n\t\t}\n\t}\n\n\treturn result\n}\nexport function observableMapToObject<K extends string | number | symbol, V>(mapped: ObservableMap<K, V>) {\n\treturn new Proxy({}, {\n\t\tget: function(_target, prop) {\n\t\t\treturn mapped.get(prop as any)\n\t\t},\n\t}) as Record<K, V>\n}\n","import { action, comparer, computed, IObservableArray, makeObservable, untracked } from 'mobx'\n\nimport { Logger } from 'besonders-logger'\nimport { pick } from 'lodash-es'\nimport { CID } from 'multiformats'\nimport { arraysContainSameElements } from '../applog/applog-utils'\nimport { areApplogsEqual } from '../applog/applog-utils'\nimport { type Applog, ApplogForInsert, CidString } from '../applog/datom-types'\nimport { areCidsEqual } from '../ipfs/ipfs-utils'\nimport { prettifyThreadName } from '../mobx/mobx-utils'\nimport { arrayIfSingle, ArrayOrSingle } from '../types/typescript-utils'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO, { prefix: '[thread]' })\n\nexport type ThreadEvent = { added: readonly Applog[]; removed: readonly Applog[] | null } | { init: readonly Applog[] }\nexport function isInitEvent(event: ThreadEvent): event is { init: readonly Applog[] } {\n\treturn (event as any).init !== undefined\n}\n\nexport type ApplogsOrThread = Thread | readonly Applog[]\n\nexport abstract class Thread {\n\treadonly filters: readonly string[]\n\treadonly parents: IObservableArray<Thread> | Thread[] | readonly Thread[] | null\n\tprotected _subscribers: ((event: ThreadEvent) => void)[] = []\n\n\tconstructor(\n\t\treadonly name: string, /* = null */\n\t\tparents: ArrayOrSingle<Thread> | IObservableArray<Thread> | readonly Thread[] | null,\n\t\tfilters: readonly string[],\n\t\tprotected _applogs: Applog[] = [],\n\t\topts: { skipObservable?: boolean } = {},\n\t) {\n\t\tthis.parents = parents === null ? null : arrayIfSingle(parents) as readonly Thread[]\n\t\tthis.filters = filters // ? uniq([...parents?.map(p => p.filters), filters])\n\t\tif (untracked(() => this.parents?.length === 0)) {\n\t\t\tWARN(`[Thread] empty parents array`, name) // just to see where it happens, is actually mostly fine\n\t\t}\n\t\tif (!opts.skipObservable) {\n\t\t\tmakeObservable(this, {\n\t\t\t\t// applogs: computed, //observable.shallow,\n\t\t\t\t// applogsSorted: computed,\n\t\t\t\tapplogsCids: computed,\n\t\t\t\tapplogsByCid: computed,\n\t\t\t\tinsert: action,\n\t\t\t\tsize: computed,\n\t\t\t\tisEmpty: computed,\n\t\t\t\tfirstLog: computed,\n\t\t\t\tlatestLog: computed,\n\t\t\t}, { name: `Thread{${name}}` })\n\t\t}\n\t}\n\n\tget readOnly() {\n\t\tif (this.parents.length !== 1) return true // ? multi-parent writable stream? - we don't have a use-case for this yet, but could this be a thing?\n\t\treturn this.parents[0].readOnly\n\t}\n\n\tpublic insert(appLogsToInsert: readonly ApplogForInsert[]) {\n\t\tif (this.readOnly) throw ERROR(`[Thread] insert() called on read-only thread:`, this.nameAndSizeUntracked)\n\t\tif (!this.parents) throw ERROR(`[Thread] insert() called on non-writable thread without parents:`, this.nameAndSizeUntracked)\n\t\tif (this.parents?.length !== 1) throw ERROR(`[Thread] insert() called on thread with multiple parents:`, this.nameAndSizeUntracked)\n\t\treturn this.parents[0].insert(appLogsToInsert)\n\t}\n\tpublic insertRaw(appLogsToInsert: readonly Applog[]) {\n\t\tif (this.readOnly) throw ERROR(`[Thread] insertRaw() called on read-only thread:`, this.nameAndSizeUntracked)\n\t\tif (!this.parents) throw ERROR(`[Thread] insertRaw() called on non-writable thread without parents:`, this.nameAndSizeUntracked)\n\t\tif (this.parents?.length !== 1) throw ERROR(`[Thread] insertRaw() called on thread with multiple parents:`, this.nameAndSizeUntracked)\n\t\treturn this.parents[0].insertRaw(appLogsToInsert)\n\t}\n\n\tsubscribe(callback: (event: ThreadEvent) => void) {\n\t\tthis._subscribers.push(callback)\n\t\treturn this.unsubscribe.bind(this, callback)\n\t}\n\n\tunsubscribe(callback: (event: ThreadEvent) => void) {\n\t\tconst index = this._subscribers.indexOf(callback)\n\t\tif (index !== -1) {\n\t\t\tthis._subscribers.splice(index, 1)\n\t\t} else WARN(`unsubscribe called for non-existent`, callback)\n\t}\n\n\tprotected notifySubscribers(event: ThreadEvent) {\n\t\tDEBUG(`[thread: ${this.name}] notifying`, this._subscribers.length, 'subscribers of', { ...event, subs: this._subscribers })\n\t\tfor (const subscriber of this._subscribers) {\n\t\t\tsubscriber(event)\n\t\t}\n\t}\n\n\tget applogs(): readonly Applog[] /* (i) only type hint, not actually immutable */ {\n\t\t// VERBOSE.isDisabled || trace()\n\t\treturn this._applogs\n\t}\n\tget applogsCids(): readonly CidString[] {\n\t\treturn this._applogs.map(l => l.cid)\n\t}\n\n\tpublic map<R>(fn: (applog: Applog) => R) {\n\t\t// if (!this.applogs.map) throw ERROR(`thread.applogs is not an array?!`, this.applogs)\n\t\treturn this.applogs.map(fn)\n\t}\n\tpublic get findLast() {\n\t\treturn this.applogs.findLast.bind(this.applogs)\n\t}\n\tpublic get findFirst() {\n\t\treturn this.applogs.find.bind(this.applogs)\n\t}\n\n\tget firstLog() {\n\t\treturn this.applogs[0]\n\t}\n\tget latestLog() {\n\t\treturn this.applogs[this.applogs.length - 1]\n\t}\n\tpublic hasApplog(applog: Applog, byRef: boolean) {\n\t\tif (byRef) {\n\t\t\treturn this.applogs.includes(applog)\n\t\t} else {\n\t\t\tif (!applog.cid) throw ERROR(`[hasApplogs] applog without CID:`, applog) // trying to make this be always the case\n\t\t\treturn this.hasApplogCid(applog.cid)\n\t\t\t// const keySet = Object.keys(applog) / / HACK: sanity check to catch bugs\n\t\t\t// return !!this.applogs.find(log => {\n\t\t\t// \tif (!arraysContainSameElements(keySet, Object.keys(log))) {\n\t\t\t// \t\t/* throw */ ERROR(`[hasApplog] field set mismatch:`, { applog, log }) / / HACK: properly handle this\n\t\t\t// \t\treturn comparer.structural(pick(log, ['en', 'at', 'vl', 'ag', 'ts']), pick(applog, ['en', 'at', 'vl', 'ag', 'ts']))\n\t\t\t// \t}\n\t\t\t// \treturn areApplogsEqual(log, applog)\n\t\t\t// })\n\t\t}\n\t}\n\tpublic hasApplogCid(cid: CID | CidString) {\n\t\treturn this.applogsCids.includes(cid.toString()) // ? is using the map faster?\n\t}\n\tget applogsByCid() {\n\t\treturn new Map(this.applogs.map(log => [log.cid, log]))\n\t}\n\tpublic getApplog(cid: CID | CidString) {\n\t\treturn this.applogsByCid.get(cid.toString())\n\t\t// \t.find(function findApplogInThread(log) {\n\t\t// \treturn areCidsEqual(log.cid, cid)\n\t\t// })\n\t}\n\n\tpublic hasApplogWithDiffTs(applog: ApplogForInsert) {\n\t\t// HACK this is basically as inefficient as it gets\n\t\treturn this.applogs.find(existing => (\n\t\t\texisting.en === applog.en\n\t\t\t&& existing.at === applog.at\n\t\t\t&& existing.vl === applog.vl\n\t\t\t&& existing.ag === applog.ag\n\t\t))\n\t}\n\n\tget isEmpty() {\n\t\treturn this.size === 0\n\t}\n\tget size() {\n\t\treturn this.applogs.length\n\t}\n\tget length() {\n\t\treturn this.applogs.length\n\t}\n\tget untrackedSize() {\n\t\treturn untracked(() => this.size)\n\t}\n\tget nameAndSizeUntracked() {\n\t\treturn untracked(() => `${this.name} (${this.size})`)\n\t}\n\tget prettyName() {\n\t\treturn prettifyThreadName(this.name)\n\t}\n\tget hasParents() {\n\t\treturn !!this.parents?.length\n\t}\n}\n\nexport const getLogsFromThread = (logsOrThread: ApplogsOrThread) => logsOrThread instanceof Thread ? logsOrThread.applogs : logsOrThread\n\nexport class StaticThread extends Thread {\n\tstatic fromArray(applogs: Applog[], name?: string) {\n\t\treturn new StaticThread(name || 'static', null, [], applogs)\n\t}\n\tconstructor(\n\t\tname: string, /* = null */\n\t\tparents: ArrayOrSingle<Thread> | IObservableArray<Thread> | readonly Thread[] | null,\n\t\tfilters: readonly string[],\n\t\t_applogs: Applog[],\n\t) {\n\t\tsuper(name, parents, filters, _applogs, { skipObservable: true })\n\t}\n\n\tget readOnly() {\n\t\treturn true\n\t}\n}\n","/* eslint max-depth: [\"error\", 7] */\nimport { Token, Type } from 'cborg'\nimport * as cborgJson from 'cborg/json'\nimport { CID } from 'multiformats'\nimport { base64 } from 'multiformats/bases/base64'\n\n/**\n * @template T\n * @typedef {import('multiformats/codecs/interface').ByteView<T>} ByteView\n */\n/**\n * @template T\n * @typedef {import('multiformats').ToString<T>} ToString\n */\n/**\n * @typedef {import('cborg/interface').DecodeTokenizer} DecodeTokenizer\n */\n\n/**\n * cidEncoder will receive all Objects during encode, it needs to filter out\n * anything that's not a CID and return `null` for that so it's encoded as\n * normal. Encoding a CID means replacing it with a `{\"/\":\"<CidString>}`\n * object as per the DAG-JSON spec.\n *\n * @param {any} obj\n * @returns {Token[]|null}\n */\nfunction cidEncoder (obj) {\n if (obj.asCID !== obj && obj['/'] !== obj.bytes) {\n return null // any other kind of object\n }\n const cid = CID.asCID(obj)\n /* c8 ignore next 4 */\n // very unlikely case, and it'll probably throw a recursion error in cborg\n if (!cid) {\n return null\n }\n const cidString = cid.toString()\n\n return [\n new Token(Type.map, Infinity, 1),\n new Token(Type.string, '/', 1), // key\n new Token(Type.string, cidString, cidString.length), // value\n new Token(Type.break, undefined, 1)\n ]\n}\n\n/**\n * bytesEncoder will receive all Uint8Arrays (and friends) during encode, it\n * needs to replace it with a `{\"/\":{\"bytes\":\"Base64ByteString\"}}` object as\n * per the DAG-JSON spec.\n *\n * @param {Uint8Array} bytes\n * @returns {Token[]|null}\n */\nfunction bytesEncoder (bytes) {\n const bytesString = base64.encode(bytes).slice(1) // no mbase prefix\n return [\n new Token(Type.map, Infinity, 1),\n new Token(Type.string, '/', 1), // key\n new Token(Type.map, Infinity, 1), // value\n new Token(Type.string, 'bytes', 5), // inner key\n new Token(Type.string, bytesString, bytesString.length), // inner value\n new Token(Type.break, undefined, 1),\n new Token(Type.break, undefined, 1)\n ]\n}\n\n/**\n * taBytesEncoder wraps bytesEncoder() but for the more exotic typed arrays so\n * that we access the underlying ArrayBuffer data\n *\n * @param {Int8Array|Uint16Array|Int16Array|Uint32Array|Int32Array|Float32Array|Float64Array|Uint8ClampedArray|BigInt64Array|BigUint64Array} obj\n * @returns {Token[]|null}\n */\nfunction taBytesEncoder (obj) {\n return bytesEncoder(new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength))\n}\n\n/**\n * abBytesEncoder wraps bytesEncoder() but for plain ArrayBuffers\n *\n * @param {ArrayBuffer} ab\n * @returns {Token[]|null}\n */\nfunction abBytesEncoder (ab) {\n return bytesEncoder(new Uint8Array(ab))\n}\n\n// eslint-disable-next-line jsdoc/require-returns-check\n/**\n * Intercept all `undefined` values from an object walk and reject the entire\n * object if we find one.\n *\n * @returns {null}\n */\nfunction undefinedEncoder () {\n throw new Error('`undefined` is not supported by the IPLD Data Model and cannot be encoded')\n}\n\n/**\n * Intercept all `number` values from an object walk and reject the entire\n * object if we find something that doesn't fit the IPLD data model (NaN &\n * Infinity).\n *\n * @param {number} num\n * @returns {null}\n */\nfunction numberEncoder (num) {\n if (Number.isNaN(num)) {\n throw new Error('`NaN` is not supported by the IPLD Data Model and cannot be encoded')\n }\n if (num === Infinity || num === -Infinity) {\n throw new Error('`Infinity` and `-Infinity` is not supported by the IPLD Data Model and cannot be encoded')\n }\n return null // process with standard number encoder\n}\n\nconst encodeOptions = {\n typeEncoders: {\n Object: cidEncoder,\n Buffer: bytesEncoder,\n Uint8Array: bytesEncoder,\n Int8Array: taBytesEncoder,\n Uint16Array: taBytesEncoder,\n Int16Array: taBytesEncoder,\n Uint32Array: taBytesEncoder,\n Int32Array: taBytesEncoder,\n Float32Array: taBytesEncoder,\n Float64Array: taBytesEncoder,\n Uint8ClampedArray: taBytesEncoder,\n BigInt64Array: taBytesEncoder,\n BigUint64Array: taBytesEncoder,\n DataView: taBytesEncoder,\n ArrayBuffer: abBytesEncoder,\n undefined: undefinedEncoder,\n number: numberEncoder\n }\n}\n\n/**\n * @implements {DecodeTokenizer}\n */\nclass DagJsonTokenizer extends cborgJson.Tokenizer {\n /**\n * @param {Uint8Array} data\n * @param {object} [options]\n */\n constructor (data, options) {\n super(data, options)\n /** @type {Token[]} */\n this.tokenBuffer = []\n }\n\n /**\n * @returns {boolean}\n */\n done () {\n return this.tokenBuffer.length === 0 && super.done()\n }\n\n /**\n * @returns {Token}\n */\n _next () {\n if (this.tokenBuffer.length > 0) {\n // @ts-ignore https://github.com/Microsoft/TypeScript/issues/30406\n return this.tokenBuffer.pop()\n }\n return super.next()\n }\n\n /**\n * Implements rules outlined in https://github.com/ipld/specs/pull/356\n *\n * @returns {Token}\n */\n next () {\n const token = this._next()\n\n if (token.type === Type.map) {\n const keyToken = this._next()\n if (keyToken.type === Type.string && keyToken.value === '/') {\n const valueToken = this._next()\n if (valueToken.type === Type.string) { // *must* be a CID\n const breakToken = this._next() // swallow the end-of-map token\n if (breakToken.type !== Type.break) {\n throw new Error('Invalid encoded CID form')\n }\n this.tokenBuffer.push(valueToken) // CID.parse will pick this up after our tag token\n return new Token(Type.tag, 42, 0)\n }\n if (valueToken.type === Type.map) {\n const innerKeyToken = this._next()\n if (innerKeyToken.type === Type.string && innerKeyToken.value === 'bytes') {\n const innerValueToken = this._next()\n if (innerValueToken.type === Type.string) { // *must* be Bytes\n for (let i = 0; i < 2; i++) {\n const breakToken = this._next() // swallow two end-of-map tokens\n if (breakToken.type !== Type.break) {\n throw new Error('Invalid encoded Bytes form')\n }\n }\n const bytes = base64.decode(`m${innerValueToken.value}`)\n return new Token(Type.bytes, bytes, innerValueToken.value.length)\n }\n this.tokenBuffer.push(innerValueToken) // bail\n }\n this.tokenBuffer.push(innerKeyToken) // bail\n }\n this.tokenBuffer.push(valueToken) // bail\n }\n this.tokenBuffer.push(keyToken) // bail\n }\n return token\n }\n}\n\nconst decodeOptions = {\n allowIndefinite: false,\n allowUndefined: false,\n allowNaN: false,\n allowInfinity: false,\n allowBigInt: true, // this will lead to BigInt for ints outside of\n // safe-integer range, which may surprise users\n strict: true,\n useMaps: false,\n rejectDuplicateMapKeys: true,\n /** @type {import('cborg').TagDecoder[]} */\n tags: []\n}\n\n// we're going to get TAG(42)STRING(\"bafy...\") from the tokenizer so we only need\n// to deal with the STRING(\"bafy...\") at this point\ndecodeOptions.tags[42] = CID.parse\n\nexport const name = 'dag-json'\nexport const code = 0x0129\n\n/**\n * @template T\n * @param {T} node\n * @returns {ByteView<T>}\n */\nexport const encode = (node) => cborgJson.encode(node, encodeOptions)\n\n/**\n * @template T\n * @param {ByteView<T>} data\n * @returns {T}\n */\nexport const decode = (data) => {\n // the tokenizer is stateful so we need a single instance of it\n const options = Object.assign(decodeOptions, { tokenizer: new DagJsonTokenizer(data, decodeOptions) })\n return cborgJson.decode(data, options)\n}\n\n/**\n * @template T\n * @param {T} node\n * @returns {ToString<T>}\n */\nexport const format = (node) => utf8Decoder.decode(encode(node))\nexport { format as stringify }\nconst utf8Decoder = new TextDecoder()\n\n/**\n * @template T\n * @param {ToString<T>} data\n * @returns {T}\n */\nexport const parse = (data) => decode(utf8Encoder.encode(data))\nconst utf8Encoder = new TextEncoder()\n","// This is an unfortunate replacement for @sindresorhus/is that we need to\n// re-implement for performance purposes. In particular the is.observable()\n// check is expensive, and unnecessary for our purposes. The values returned\n// are compatible with @sindresorhus/is, however.\n\nconst typeofs = [\n 'string',\n 'number',\n 'bigint',\n 'symbol'\n]\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]\n\n/**\n * @param {any} value\n * @returns {string}\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 /* c8 ignore next 4 */\n // not going to bother testing this, it's not going to be valid anyway\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 /* c8 ignore next */\n return 'Object'\n}\n\n/**\n * @param {any} value\n * @returns {boolean}\n */\nfunction isBuffer (value) {\n return value && value.constructor && value.constructor.isBuffer && value.constructor.isBuffer.call(null, value)\n}\n\n/**\n * @param {any} value\n * @returns {string|undefined}\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 /* c8 ignore next */\n return undefined\n}\n","class Type {\n /**\n * @param {number} major\n * @param {string} name\n * @param {boolean} terminal\n */\n constructor (major, name, terminal) {\n this.major = major\n this.majorEncoded = major << 5\n this.name = name\n this.terminal = terminal\n }\n\n /* c8 ignore next 3 */\n toString () {\n return `Type[${this.major}].${this.name}`\n }\n\n /**\n * @param {Type} typ\n * @returns {number}\n */\n compare (typ) {\n /* c8 ignore next 1 */\n return this.major < typ.major ? -1 : this.major > typ.major ? 1 : 0\n }\n}\n\n// convert to static fields when better supported\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) // terminal?\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)\n// Type.indefiniteLength = new Type(0, 'indefiniteLength', true)\n\nclass Token {\n /**\n * @param {Type} type\n * @param {any} [value]\n * @param {number} [encodedLength]\n */\n constructor (type, value, encodedLength) {\n this.type = type\n this.value = value\n this.encodedLength = encodedLength\n /** @type {Uint8Array|undefined} */\n this.encodedBytes = undefined\n /** @type {Uint8Array|undefined} */\n this.byteValue = undefined\n }\n\n /* c8 ignore next 3 */\n toString () {\n return `Token[${this.type}].${this.value}`\n }\n}\n\nexport { Type, Token }\n","// Use Uint8Array directly in the browser, use Buffer in Node.js but don't\n// speak its name directly to avoid bundlers pulling in the `Buffer` polyfill\n\n// @ts-ignore\nexport const useBuffer = globalThis.process &&\n // @ts-ignore\n !globalThis.process.browser &&\n // @ts-ignore\n globalThis.Buffer &&\n // @ts-ignore\n typeof globalThis.Buffer.isBuffer === 'function'\n\nconst textDecoder = new TextDecoder()\nconst textEncoder = new TextEncoder()\n\n/**\n * @param {Uint8Array} buf\n * @returns {boolean}\n */\nfunction isBuffer (buf) {\n // @ts-ignore\n return useBuffer && globalThis.Buffer.isBuffer(buf)\n}\n\n/**\n * @param {Uint8Array|number[]} buf\n * @returns {Uint8Array}\n */\nexport function asU8A (buf) {\n /* c8 ignore next */\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}\n\nexport const toString = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array} bytes\n * @param {number} start\n * @param {number} end\n */\n (bytes, start, end) => {\n return end - start > 64\n ? // eslint-disable-line operator-linebreak\n // @ts-ignore\n globalThis.Buffer.from(bytes.subarray(start, end)).toString('utf8')\n : utf8Slice(bytes, start, end)\n }\n /* c8 ignore next 11 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array} bytes\n * @param {number} start\n * @param {number} end\n */\n (bytes, start, end) => {\n return end - start > 64\n ? textDecoder.decode(bytes.subarray(start, end))\n : utf8Slice(bytes, start, end)\n }\n\nexport const fromString = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {string} string\n */\n (string) => {\n return string.length > 64\n ? // eslint-disable-line operator-linebreak\n // @ts-ignore\n globalThis.Buffer.from(string)\n : utf8ToBytes(string)\n }\n /* c8 ignore next 7 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {string} string\n */\n (string) => {\n return string.length > 64 ? textEncoder.encode(string) : utf8ToBytes(string)\n }\n\n/**\n * Buffer variant not fast enough for what we need\n * @param {number[]} arr\n * @returns {Uint8Array}\n */\nexport const fromArray = (arr) => {\n return Uint8Array.from(arr)\n}\n\nexport const slice = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array} bytes\n * @param {number} start\n * @param {number} end\n */\n (bytes, start, end) => {\n if (isBuffer(bytes)) {\n return new Uint8Array(bytes.subarray(start, end))\n }\n return bytes.slice(start, end)\n }\n /* c8 ignore next 9 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array} bytes\n * @param {number} start\n * @param {number} end\n */\n (bytes, start, end) => {\n return bytes.slice(start, end)\n }\n\nexport const concat = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array[]} chunks\n * @param {number} length\n * @returns {Uint8Array}\n */\n (chunks, length) => {\n // might get a stray plain Array here\n /* c8 ignore next 1 */\n chunks = chunks.map((c) => c instanceof Uint8Array\n ? c\n // this case is occasionally missed during test runs so becomes coverage-flaky\n /* c8 ignore next 4 */\n : // eslint-disable-line operator-linebreak\n // @ts-ignore\n globalThis.Buffer.from(c))\n // @ts-ignore\n return asU8A(globalThis.Buffer.concat(chunks, length))\n }\n /* c8 ignore next 19 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array[]} chunks\n * @param {number} length\n * @returns {Uint8Array}\n */\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 // final chunk that's bigger than we need\n b = b.subarray(0, out.length - off)\n }\n out.set(b, off)\n off += b.length\n }\n return out\n }\n\nexport const alloc = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {number} size\n * @returns {Uint8Array}\n */\n (size) => {\n // we always write over the contents we expose so this should be safe\n // @ts-ignore\n return globalThis.Buffer.allocUnsafe(size)\n }\n /* c8 ignore next 8 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {number} size\n * @returns {Uint8Array}\n */\n (size) => {\n return new Uint8Array(size)\n }\n\nexport const toHex = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array} d\n * @returns {string}\n */\n (d) => {\n if (typeof d === 'string') {\n return d\n }\n // @ts-ignore\n return globalThis.Buffer.from(toBytes(d)).toString('hex')\n }\n /* c8 ignore next 12 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {Uint8Array} d\n * @returns {string}\n */\n (d) => {\n if (typeof d === 'string') {\n return d\n }\n // @ts-ignore not smart enough to figure this out\n return Array.prototype.reduce.call(toBytes(d), (p, c) => `${p}${c.toString(16).padStart(2, '0')}`, '')\n }\n\nexport const fromHex = useBuffer\n ? // eslint-disable-line operator-linebreak\n /**\n * @param {string|Uint8Array} hex\n * @returns {Uint8Array}\n */\n (hex) => {\n if (hex instanceof Uint8Array) {\n return hex\n }\n // @ts-ignore\n return globalThis.Buffer.from(hex, 'hex')\n }\n /* c8 ignore next 17 */\n : // eslint-disable-line operator-linebreak\n /**\n * @param {string|Uint8Array} hex\n * @returns {Uint8Array}\n */\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('')\n .map((/** @type {string} */ c, /** @type {number} */ i, /** @type {string[]} */ d) => i % 2 === 0 ? `0x${c}${d[i + 1]}` : '')\n .filter(Boolean)\n .map((/** @type {string} */ e) => parseInt(e, 16)))\n }\n\n/**\n * @param {Uint8Array|ArrayBuffer|ArrayBufferView} obj\n * @returns {Uint8Array}\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 /* c8 ignore next */\n throw new Error('Unknown type, must be binary type')\n}\n\n/**\n * @param {Uint8Array} b1\n * @param {Uint8Array} b2\n * @returns {number}\n */\nexport function compare (b1, b2) {\n /* c8 ignore next 5 */\n if (isBuffer(b1) && isBuffer(b2)) {\n // probably not possible to get here in the current API\n // @ts-ignore Buffer\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 } /* c8 ignore next 3 */\n return 0\n}\n\n// The below code is taken from https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n// Licensed Apache-2.0.\n\n/**\n * @param {string} str\n * @returns {number[]}\n */\nfunction utf8ToBytes (str) {\n const out = []\n let p = 0\n for (let i = 0; i < str.length; i++) {\n let c = str.charCodeAt(i)\n if (c < 128) {\n out[p++] = c\n } else if (c < 2048) {\n out[p++] = (c >> 6) | 192\n out[p++] = (c & 63) | 128\n } else if (\n ((c & 0xFC00) === 0xD800) && (i + 1) < str.length &&\n ((str.charCodeAt(i + 1) & 0xFC00) === 0xDC00)) {\n // Surrogate Pair\n c = 0x10000 + ((c & 0x03FF) << 10) + (str.charCodeAt(++i) & 0x03FF)\n out[p++] = (c >> 18) | 240\n out[p++] = ((c >> 12) & 63) | 128\n out[p++] = ((c >> 6) & 63) | 128\n out[p++] = (c & 63) | 128\n } else {\n out[p++] = (c >> 12) | 224\n out[p++] = ((c >> 6) & 63) | 128\n out[p++] = (c & 63) | 128\n }\n }\n return out\n}\n\n// The below code is mostly taken from https://github.com/feross/buffer\n// Licensed MIT. Copyright (c) Feross Aboukhadijeh\n\n/**\n * @param {Uint8Array} buf\n * @param {number} offset\n * @param {number} end\n * @returns {string}\n */\nfunction utf8Slice (buf, offset, end) {\n const res = []\n\n while (offset < end) {\n const firstByte = buf[offset]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xef) ? 4 : (firstByte > 0xdf) ? 3 : (firstByte > 0xbf) ? 2 : 1\n\n if (offset + 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[offset + 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[offset + 1]\n thirdByte = buf[offset + 2]\n if ((secondByte & 0xc0) === 0x80 && (thirdByte & 0xc0) === 0x80) {\n tempCodePoint = (firstByte & 0xf) << 0xc | (secondByte & 0x3f) << 0x6 | (thirdByte & 0x3f)\n /* c8 ignore next 3 */\n if (tempCodePoint > 0x7ff && (tempCodePoint < 0xd800 || tempCodePoint > 0xdfff)) {\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 & 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 /* c8 ignore next 5 */\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 offset += 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\n/**\n * @param {number[]} codePoints\n * @returns {string}\n */\nexport function 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 /* c8 ignore next 10 */\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","/**\n * Bl is a list of byte chunks, similar to https://github.com/rvagg/bl but for\n * writing rather than reading.\n * A Bl object accepts set() operations for individual bytes and copyTo() for\n * inserting byte arrays. These write operations don't automatically increment\n * the internal cursor so its \"length\" won't be changed. Instead, increment()\n * must be called to extend its length to cover the inserted data.\n * The toBytes() call will convert all internal memory to a single Uint8Array of\n * the correct length, truncating any data that is stored but hasn't been\n * included by an increment().\n * get() can retrieve a single byte.\n * All operations (except toBytes()) take an \"offset\" argument that will perform\n * the write at the offset _from the current cursor_. For most operations this\n * will be `0` to write at the current cursor position but it can be ahead of\n * the current cursor. Negative offsets probably work but are untested.\n */\n\n// TODO: ipjs doesn't support this, only for test files: https://github.com/mikeal/ipjs/blob/master/src/package/testFile.js#L39\nimport { alloc, concat, slice } from './byte-utils.js'\n\n// the ts-ignores in this file are almost all for the `Uint8Array|number[]` duality that exists\n// for perf reasons. Consider better approaches to this or removing it entirely, it is quite\n// risky because of some assumptions about small chunks === number[] and everything else === Uint8Array.\n\nconst defaultChunkSize = 256\n\nexport class Bl {\n /**\n * @param {number} [chunkSize]\n */\n constructor (chunkSize = defaultChunkSize) {\n this.chunkSize = chunkSize\n /** @type {number} */\n this.cursor = 0\n /** @type {number} */\n this.maxCursor = -1\n /** @type {(Uint8Array|number[])[]} */\n this.chunks = []\n // keep the first chunk around if we can to save allocations for future encodes\n /** @type {Uint8Array|number[]|null} */\n this._initReuseChunk = null\n }\n\n reset () {\n this.cursor = 0\n this.maxCursor = -1\n if (this.chunks.length) {\n this.chunks = []\n }\n if (this._initReuseChunk !== null) {\n this.chunks.push(this._initReuseChunk)\n this.maxCursor = this._initReuseChunk.length - 1\n }\n }\n\n /**\n * @param {Uint8Array|number[]} bytes\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 // we have at least one chunk and we can fit these bytes into that chunk\n const chunkPos = topChunk.length - (this.maxCursor - this.cursor) - 1\n // @ts-ignore\n topChunk.set(bytes, chunkPos)\n } else {\n // can't fit it in\n if (topChunk) {\n // trip the last chunk to `cursor` if we need to\n const chunkPos = topChunk.length - (this.maxCursor - this.cursor) - 1\n if (chunkPos < topChunk.length) {\n // @ts-ignore\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 // make a new chunk and copy the new one into it\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 // @ts-ignore\n topChunk.set(bytes, 0)\n } else {\n // push the new bytes in as its own chunk\n this.chunks.push(bytes)\n this.maxCursor += bytes.length\n }\n }\n this.cursor += bytes.length\n }\n\n /**\n * @param {boolean} [reset]\n * @returns {Uint8Array}\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 /* c8 ignore next 2 */\n // @ts-ignore\n byts = this.cursor === chunk.length ? chunk : chunk.subarray(0, this.cursor)\n this._initReuseChunk = null\n this.chunks = []\n } else {\n // @ts-ignore\n byts = slice(chunk, 0, this.cursor)\n }\n } else {\n // @ts-ignore\n byts = concat(this.chunks, this.cursor)\n }\n if (reset) {\n this.reset()\n }\n return byts\n }\n}\n","const decodeErrPrefix = 'CBOR decode error:'\nconst encodeErrPrefix = 'CBOR encode error:'\n\nconst uintMinorPrefixBytes = []\nuintMinorPrefixBytes[23] = 1\nuintMinorPrefixBytes[24] = 2\nuintMinorPrefixBytes[25] = 3\nuintMinorPrefixBytes[26] = 5\nuintMinorPrefixBytes[27] = 9\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} need\n */\nfunction assertEnoughData (data, pos, need) {\n if (data.length - pos < need) {\n throw new Error(`${decodeErrPrefix} not enough data for type`)\n }\n}\n\nexport {\n decodeErrPrefix,\n encodeErrPrefix,\n uintMinorPrefixBytes,\n assertEnoughData\n}\n","/* globals BigInt */\n\nimport { Token, Type } from './token.js'\nimport { decodeErrPrefix, assertEnoughData } from './common.js'\n\nexport const uintBoundaries = [24, 256, 65536, 4294967296, BigInt('18446744073709551616')]\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} data\n * @param {number} offset\n * @param {DecodeOptions} options\n * @returns {number}\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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} offset\n * @param {DecodeOptions} options\n * @returns {number}\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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} offset\n * @param {DecodeOptions} options\n * @returns {number}\n */\nexport function readUint32 (data, offset, options) {\n assertEnoughData(data, offset, 4)\n const value = (data[offset] * 16777216 /* 2 ** 24 */) + (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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} offset\n * @param {DecodeOptions} options\n * @returns {number|bigint}\n */\nexport function readUint64 (data, offset, options) {\n // assume BigInt, convert back to Number if within safe range\n assertEnoughData(data, offset, 8)\n const hi = (data[offset] * 16777216 /* 2 ** 24 */) + (data[offset + 1] << 16) + (data[offset + 2] << 8) + data[offset + 3]\n const lo = (data[offset + 4] * 16777216 /* 2 ** 24 */) + (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}\n\n/* not required thanks to quick[] list\nconst oneByteTokens = new Array(24).fill(0).map((v, i) => new Token(Type.uint, i, 1))\nexport function decodeUintCompact (data, pos, minor, options) {\n return oneByteTokens[minor]\n}\n*/\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeUint8 (data, pos, _minor, options) {\n return new Token(Type.uint, readUint8(data, pos + 1, options), 2)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeUint16 (data, pos, _minor, options) {\n return new Token(Type.uint, readUint16(data, pos + 1, options), 3)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeUint32 (data, pos, _minor, options) {\n return new Token(Type.uint, readUint32(data, pos + 1, options), 5)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeUint64 (data, pos, _minor, options) {\n return new Token(Type.uint, readUint64(data, pos + 1, options), 9)\n}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\n */\nexport function encodeUint (buf, token) {\n return encodeUintValue(buf, 0, token.value)\n}\n\n/**\n * @param {Bl} buf\n * @param {number} major\n * @param {number|bigint} uint\n */\nexport function encodeUintValue (buf, major, uint) {\n if (uint < uintBoundaries[0]) {\n const nuint = Number(uint)\n // pack into one byte, minor=0, additional=value\n buf.push([major | nuint])\n } else if (uint < uintBoundaries[1]) {\n const nuint = Number(uint)\n // pack into two byte, minor=0, additional=24\n buf.push([major | 24, nuint])\n } else if (uint < uintBoundaries[2]) {\n const nuint = Number(uint)\n // pack into three byte, minor=0, additional=25\n buf.push([major | 25, nuint >>> 8, nuint & 0xff])\n } else if (uint < uintBoundaries[3]) {\n const nuint = Number(uint)\n // pack into five byte, minor=0, additional=26\n buf.push([major | 26, (nuint >>> 24) & 0xff, (nuint >>> 16) & 0xff, (nuint >>> 8) & 0xff, nuint & 0xff])\n } else {\n const buint = BigInt(uint)\n if (buint < uintBoundaries[4]) {\n // pack into nine byte, minor=0, additional=27\n const set = [major | 27, 0, 0, 0, 0, 0, 0, 0]\n // simulate bitwise above 32 bits\n let lo = Number(buint & BigInt(0xffffffff))\n let hi = Number(buint >> BigInt(32) & BigInt(0xffffffff))\n set[8] = lo & 0xff\n lo = lo >> 8\n set[7] = lo & 0xff\n lo = lo >> 8\n set[6] = lo & 0xff\n lo = lo >> 8\n set[5] = lo & 0xff\n set[4] = hi & 0xff\n hi = hi >> 8\n set[3] = hi & 0xff\n hi = hi >> 8\n set[2] = hi & 0xff\n hi = hi >> 8\n set[1] = hi & 0xff\n buf.push(set)\n } else {\n throw new Error(`${decodeErrPrefix} encountered BigInt larger than allowable range`)\n }\n }\n}\n\n/**\n * @param {Token} token\n * @returns {number}\n */\nencodeUint.encodedSize = function encodedSize (token) {\n return encodeUintValue.encodedSize(token.value)\n}\n\n/**\n * @param {number} uint\n * @returns {number}\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}\n\n/**\n * @param {Token} tok1\n * @param {Token} tok2\n * @returns {number}\n */\nencodeUint.compareTokens = function compareTokens (tok1, tok2) {\n return tok1.value < tok2.value ? -1 : tok1.value > tok2.value ? 1 : /* c8 ignore next */ 0\n}\n","/* eslint-env es2020 */\n\nimport { Token, Type } from './token.js'\nimport * as uint from './0uint.js'\nimport { decodeErrPrefix } from './common.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeNegint8 (data, pos, _minor, options) {\n return new Token(Type.negint, -1 - uint.readUint8(data, pos + 1, options), 2)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeNegint16 (data, pos, _minor, options) {\n return new Token(Type.negint, -1 - uint.readUint16(data, pos + 1, options), 3)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeNegint32 (data, pos, _minor, options) {\n return new Token(Type.negint, -1 - uint.readUint32(data, pos + 1, options), 5)\n}\n\nconst neg1b = BigInt(-1)\nconst pos1b = BigInt(1)\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\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}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\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}\n\n/**\n * @param {Token} token\n * @returns {number}\n */\nencodeNegint.encodedSize = function encodedSize (token) {\n const negint = token.value\n const unsigned = (typeof negint === 'bigint' ? (negint * neg1b - pos1b) : (negint * -1 - 1))\n /* c8 ignore next 4 */\n // handled by quickEncode, we shouldn't get here but it's included for completeness\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}\n\n/**\n * @param {Token} tok1\n * @param {Token} tok2\n * @returns {number}\n */\nencodeNegint.compareTokens = function compareTokens (tok1, tok2) {\n // opposite of the uint comparison since we store the uint version in bytes\n return tok1.value < tok2.value ? 1 : tok1.value > tok2.value ? -1 : /* c8 ignore next */ 0\n}\n","import { Token, Type } from './token.js'\nimport { assertEnoughData, decodeErrPrefix } from './common.js'\nimport * as uint from './0uint.js'\nimport { compare, fromString, slice } from './byte-utils.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} prefix\n * @param {number} length\n * @returns {Token}\n */\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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} minor\n * @param {DecodeOptions} _options\n * @returns {Token}\n */\nexport function decodeBytesCompact (data, pos, minor, _options) {\n return toToken(data, pos, 1, minor)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeBytes8 (data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options))\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeBytes16 (data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options))\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeBytes32 (data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options))\n}\n\n// TODO: maybe we shouldn't support this ..\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * `encodedBytes` allows for caching when we do a byte version of a string\n * for key sorting purposes\n * @param {Token} token\n * @returns {Uint8Array}\n */\nfunction tokenBytes (token) {\n if (token.encodedBytes === undefined) {\n token.encodedBytes = token.type === Type.string ? fromString(token.value) : token.value\n }\n // @ts-ignore c'mon\n return token.encodedBytes\n}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\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}\n\n/**\n * @param {Token} token\n * @returns {number}\n */\nencodeBytes.encodedSize = function encodedSize (token) {\n const bytes = tokenBytes(token)\n return uint.encodeUintValue.encodedSize(bytes.length) + bytes.length\n}\n\n/**\n * @param {Token} tok1\n * @param {Token} tok2\n * @returns {number}\n */\nencodeBytes.compareTokens = function compareTokens (tok1, tok2) {\n return compareBytes(tokenBytes(tok1), tokenBytes(tok2))\n}\n\n/**\n * @param {Uint8Array} b1\n * @param {Uint8Array} b2\n * @returns {number}\n */\nexport function compareBytes (b1, b2) {\n return b1.length < b2.length ? -1 : b1.length > b2.length ? 1 : compare(b1, b2)\n}\n","import { Token, Type } from './token.js'\nimport { assertEnoughData, decodeErrPrefix } from './common.js'\nimport * as uint from './0uint.js'\nimport { encodeBytes } from './2bytes.js'\nimport { toString, slice } from './byte-utils.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} prefix\n * @param {number} length\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nfunction toToken (data, pos, prefix, length, options) {\n const totLength = prefix + length\n assertEnoughData(data, pos, totLength)\n const tok = new Token(Type.string, toString(data, pos + prefix, pos + totLength), totLength)\n if (options.retainStringBytes === true) {\n tok.byteValue = slice(data, pos + prefix, pos + totLength)\n }\n return tok\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeStringCompact (data, pos, minor, options) {\n return toToken(data, pos, 1, minor, options)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeString8 (data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options), options)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeString16 (data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options), options)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeString32 (data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options), options)\n}\n\n// TODO: maybe we shouldn't support this ..\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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, options)\n}\n\nexport const encodeString = encodeBytes\n","import { Token, Type } from './token.js'\nimport * as uint from './0uint.js'\nimport { decodeErrPrefix } from './common.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} _data\n * @param {number} _pos\n * @param {number} prefix\n * @param {number} length\n * @returns {Token}\n */\nfunction toToken (_data, _pos, prefix, length) {\n return new Token(Type.array, length, prefix)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} minor\n * @param {DecodeOptions} _options\n * @returns {Token}\n */\nexport function decodeArrayCompact (data, pos, minor, _options) {\n return toToken(data, pos, 1, minor)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeArray8 (data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options))\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeArray16 (data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options))\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeArray32 (data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options))\n}\n\n// TODO: maybe we shouldn't support this ..\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\n */\nexport function encodeArray (buf, token) {\n uint.encodeUintValue(buf, Type.array.majorEncoded, token.value)\n}\n\n// using an array as a map key, are you sure about this? we can only sort\n// by map length here, it's up to the encoder to decide to look deeper\nencodeArray.compareTokens = uint.encodeUint.compareTokens\n\n/**\n * @param {Token} token\n * @returns {number}\n */\nencodeArray.encodedSize = function encodedSize (token) {\n return uint.encodeUintValue.encodedSize(token.value)\n}\n","import { Token, Type } from './token.js'\nimport * as uint from './0uint.js'\nimport { decodeErrPrefix } from './common.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} _data\n * @param {number} _pos\n * @param {number} prefix\n * @param {number} length\n * @returns {Token}\n */\nfunction toToken (_data, _pos, prefix, length) {\n return new Token(Type.map, length, prefix)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} minor\n * @param {DecodeOptions} _options\n * @returns {Token}\n */\nexport function decodeMapCompact (data, pos, minor, _options) {\n return toToken(data, pos, 1, minor)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeMap8 (data, pos, _minor, options) {\n return toToken(data, pos, 2, uint.readUint8(data, pos + 1, options))\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeMap16 (data, pos, _minor, options) {\n return toToken(data, pos, 3, uint.readUint16(data, pos + 1, options))\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeMap32 (data, pos, _minor, options) {\n return toToken(data, pos, 5, uint.readUint32(data, pos + 1, options))\n}\n\n// TODO: maybe we shouldn't support this ..\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\n */\nexport function encodeMap (buf, token) {\n uint.encodeUintValue(buf, Type.map.majorEncoded, token.value)\n}\n\n// using a map as a map key, are you sure about this? we can only sort\n// by map length here, it's up to the encoder to decide to look deeper\nencodeMap.compareTokens = uint.encodeUint.compareTokens\n\n/**\n * @param {Token} token\n * @returns {number}\n */\nencodeMap.encodedSize = function encodedSize (token) {\n return uint.encodeUintValue.encodedSize(token.value)\n}\n","import { Token, Type } from './token.js'\nimport * as uint from './0uint.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} _data\n * @param {number} _pos\n * @param {number} minor\n * @param {DecodeOptions} _options\n * @returns {Token}\n */\nexport function decodeTagCompact (_data, _pos, minor, _options) {\n return new Token(Type.tag, minor, 1)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeTag8 (data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint8(data, pos + 1, options), 2)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeTag16 (data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint16(data, pos + 1, options), 3)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeTag32 (data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint32(data, pos + 1, options), 5)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeTag64 (data, pos, _minor, options) {\n return new Token(Type.tag, uint.readUint64(data, pos + 1, options), 9)\n}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\n */\nexport function encodeTag (buf, token) {\n uint.encodeUintValue(buf, Type.tag.majorEncoded, token.value)\n}\n\nencodeTag.compareTokens = uint.encodeUint.compareTokens\n\n/**\n * @param {Token} token\n * @returns {number}\n */\nencodeTag.encodedSize = function encodedSize (token) {\n return uint.encodeUintValue.encodedSize(token.value)\n}\n","// TODO: shift some of the bytes logic to bytes-utils so we can use Buffer\n// where possible\n\nimport { Token, Type } from './token.js'\nimport { decodeErrPrefix } from './common.js'\nimport { encodeUint } from './0uint.js'\n\n/**\n * @typedef {import('./bl.js').Bl} Bl\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n * @typedef {import('../interface').EncodeOptions} EncodeOptions\n */\n\nconst MINOR_FALSE = 20\nconst MINOR_TRUE = 21\nconst MINOR_NULL = 22\nconst MINOR_UNDEFINED = 23\n\n/**\n * @param {Uint8Array} _data\n * @param {number} _pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeUndefined (_data, _pos, _minor, options) {\n if (options.allowUndefined === false) {\n throw new Error(`${decodeErrPrefix} undefined values are not supported`)\n } else if (options.coerceUndefinedToNull === true) {\n return new Token(Type.null, null, 1)\n }\n return new Token(Type.undefined, undefined, 1)\n}\n\n/**\n * @param {Uint8Array} _data\n * @param {number} _pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * @param {number} value\n * @param {number} bytes\n * @param {DecodeOptions} options\n * @returns {Token}\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}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeFloat16 (data, pos, _minor, options) {\n return createToken(readFloat16(data, pos + 1), 3, options)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeFloat32 (data, pos, _minor, options) {\n return createToken(readFloat32(data, pos + 1), 5, options)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} _minor\n * @param {DecodeOptions} options\n * @returns {Token}\n */\nexport function decodeFloat64 (data, pos, _minor, options) {\n return createToken(readFloat64(data, pos + 1), 9, options)\n}\n\n/**\n * @param {Bl} buf\n * @param {Token} token\n * @param {EncodeOptions} options\n */\nexport function encodeFloat (buf, token, options) {\n const float = token.value\n\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] = 0xf9\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] = 0xfa\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] = 0xfb\n buf.push(ui8a.slice(0, 9))\n }\n }\n}\n\n/**\n * @param {Token} token\n * @param {EncodeOptions} options\n * @returns {number}\n */\nencodeFloat.encodedSize = function encodedSize (token, options) {\n const float = token.value\n\n if (float === false || float === true || float === null || float === undefined) {\n return 1\n }\n\n if (!options || options.float64 !== true) {\n encodeFloat16(float)\n let 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}\n\nconst buffer = new ArrayBuffer(9)\nconst dataView = new DataView(buffer, 1)\nconst ui8a = new Uint8Array(buffer, 0)\n\n/**\n * @param {number} inp\n */\nfunction encodeFloat16 (inp) {\n if (inp === Infinity) {\n dataView.setUint16(0, 0x7c00, false)\n } else if (inp === -Infinity) {\n dataView.setUint16(0, 0xfc00, false)\n } else if (Number.isNaN(inp)) {\n dataView.setUint16(0, 0x7e00, false)\n } else {\n dataView.setFloat32(0, inp)\n const valu32 = dataView.getUint32(0)\n const exponent = (valu32 & 0x7f800000) >> 23\n const mantissa = valu32 & 0x7fffff\n\n /* c8 ignore next 6 */\n if (exponent === 0xff) {\n // too big, Infinity, but this should be hard (impossible?) to trigger\n dataView.setUint16(0, 0x7c00, false)\n } else if (exponent === 0x00) {\n // 0.0, -0.0 and subnormals, shouldn't be possible to get here because 0.0 should be counted as an int\n dataView.setUint16(0, ((inp & 0x80000000) >> 16) | (mantissa >> 13), false)\n } else { // standard numbers\n // chunks of logic here borrowed from https://github.com/PJK/libcbor/blob/c78f437182533e3efa8d963ff4b945bb635c2284/src/cbor/encoding.c#L127\n const logicalExponent = exponent - 127\n // Now we know that 2^exponent <= 0 logically\n /* c8 ignore next 6 */\n if (logicalExponent < -24) {\n /* No unambiguous representation exists, this float is not a half float\n and is too small to be represented using a half, round off to zero.\n Consistent with the reference implementation. */\n // should be difficult (impossible?) to get here in JS\n dataView.setUint16(0, 0)\n } else if (logicalExponent < -14) {\n /* Offset the remaining decimal places by shifting the significand, the\n value is lost. This is an implementation decision that works around the\n absence of standard half-float in the language. */\n dataView.setUint16(0, ((valu32 & 0x80000000) >> 16) | /* sign bit */ (1 << (24 + logicalExponent)), false)\n } else {\n dataView.setUint16(0, ((valu32 & 0x80000000) >> 16) | ((logicalExponent + 15) << 10) | (mantissa >> 13), false)\n }\n }\n }\n}\n\n/**\n * @param {Uint8Array} ui8a\n * @param {number} pos\n * @returns {number}\n */\nfunction readFloat16 (ui8a, pos) {\n if (ui8a.length - pos < 2) {\n throw new Error(`${decodeErrPrefix} not enough data for float16`)\n }\n\n const half = (ui8a[pos] << 8) + ui8a[pos + 1]\n if (half === 0x7c00) {\n return Infinity\n }\n if (half === 0xfc00) {\n return -Infinity\n }\n if (half === 0x7e00) {\n return NaN\n }\n const exp = (half >> 10) & 0x1f\n const mant = half & 0x3ff\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 /* c8 ignore next 4 */\n } else {\n // may not be possible to get here\n val = mant === 0 ? Infinity : NaN\n }\n return (half & 0x8000) ? -val : val\n}\n\n/**\n * @param {number} inp\n */\nfunction encodeFloat32 (inp) {\n dataView.setFloat32(0, inp, false)\n}\n\n/**\n * @param {Uint8Array} ui8a\n * @param {number} pos\n * @returns {number}\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}\n\n/**\n * @param {number} inp\n */\nfunction encodeFloat64 (inp) {\n dataView.setFloat64(0, inp, false)\n}\n\n/**\n * @param {Uint8Array} ui8a\n * @param {number} pos\n * @returns {number}\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}\n\n/**\n * @param {Token} _tok1\n * @param {Token} _tok2\n * @returns {number}\n */\nencodeFloat.compareTokens = encodeUint.compareTokens\n/*\nencodeFloat.compareTokens = function compareTokens (_tok1, _tok2) {\n return _tok1\n throw new Error(`${encodeErrPrefix} cannot use floats as map keys`)\n}\n*/\n","import { Token, Type } 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'\n\n/**\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n */\n\n/**\n * @param {Uint8Array} data\n * @param {number} pos\n * @param {number} minor\n */\nfunction invalidMinor (data, pos, minor) {\n throw new Error(`${decodeErrPrefix} encountered invalid minor (${minor}) for major ${data[pos] >>> 5}`)\n}\n\n/**\n * @param {string} msg\n * @returns {()=>any}\n */\nfunction errorer (msg) {\n return () => { throw new Error(`${decodeErrPrefix} ${msg}`) }\n}\n\n/** @type {((data:Uint8Array, pos:number, minor:number, options?:DecodeOptions) => any)[]} */\nexport const jump = []\n\n// unsigned integer, 0x00..0x17 (0..23)\nfor (let i = 0; i <= 0x17; i++) {\n jump[i] = invalidMinor // uint.decodeUintCompact, handled by quick[]\n}\njump[0x18] = uint.decodeUint8 // unsigned integer, one-byte uint8_t follows\njump[0x19] = uint.decodeUint16 // unsigned integer, two-byte uint16_t follows\njump[0x1a] = uint.decodeUint32 // unsigned integer, four-byte uint32_t follows\njump[0x1b] = uint.decodeUint64 // unsigned integer, eight-byte uint64_t follows\njump[0x1c] = invalidMinor\njump[0x1d] = invalidMinor\njump[0x1e] = invalidMinor\njump[0x1f] = invalidMinor\n// negative integer, -1-0x00..-1-0x17 (-1..-24)\nfor (let i = 0x20; i <= 0x37; i++) {\n jump[i] = invalidMinor // negintDecode, handled by quick[]\n}\njump[0x38] = negint.decodeNegint8 // negative integer, -1-n one-byte uint8_t for n follows\njump[0x39] = negint.decodeNegint16 // negative integer, -1-n two-byte uint16_t for n follows\njump[0x3a] = negint.decodeNegint32 // negative integer, -1-n four-byte uint32_t for follows\njump[0x3b] = negint.decodeNegint64 // negative integer, -1-n eight-byte uint64_t for follows\njump[0x3c] = invalidMinor\njump[0x3d] = invalidMinor\njump[0x3e] = invalidMinor\njump[0x3f] = invalidMinor\n// byte string, 0x00..0x17 bytes follow\nfor (let i = 0x40; i <= 0x57; i++) {\n jump[i] = bytes.decodeBytesCompact\n}\njump[0x58] = bytes.decodeBytes8 // byte string, one-byte uint8_t for n, and then n bytes follow\njump[0x59] = bytes.decodeBytes16 // byte string, two-byte uint16_t for n, and then n bytes follow\njump[0x5a] = bytes.decodeBytes32 // byte string, four-byte uint32_t for n, and then n bytes follow\njump[0x5b] = bytes.decodeBytes64 // byte string, eight-byte uint64_t for n, and then n bytes follow\njump[0x5c] = invalidMinor\njump[0x5d] = invalidMinor\njump[0x5e] = invalidMinor\njump[0x5f] = errorer('indefinite length bytes/strings are not supported') // byte string, byte strings follow, terminated by \"break\"\n// UTF-8 string 0x00..0x17 bytes follow\nfor (let i = 0x60; i <= 0x77; i++) {\n jump[i] = string.decodeStringCompact\n}\njump[0x78] = string.decodeString8 // UTF-8 string, one-byte uint8_t for n, and then n bytes follow\njump[0x79] = string.decodeString16 // UTF-8 string, two-byte uint16_t for n, and then n bytes follow\njump[0x7a] = string.decodeString32 // UTF-8 string, four-byte uint32_t for n, and then n bytes follow\njump[0x7b] = string.decodeString64 // UTF-8 string, eight-byte uint64_t for n, and then n bytes follow\njump[0x7c] = invalidMinor\njump[0x7d] = invalidMinor\njump[0x7e] = invalidMinor\njump[0x7f] = errorer('indefinite length bytes/strings are not supported') // UTF-8 strings follow, terminated by \"break\"\n// array, 0x00..0x17 data items follow\nfor (let i = 0x80; i <= 0x97; i++) {\n jump[i] = array.decodeArrayCompact\n}\njump[0x98] = array.decodeArray8 // array, one-byte uint8_t for n, and then n data items follow\njump[0x99] = array.decodeArray16 // array, two-byte uint16_t for n, and then n data items follow\njump[0x9a] = array.decodeArray32 // array, four-byte uint32_t for n, and then n data items follow\njump[0x9b] = array.decodeArray64 // array, eight-byte uint64_t for n, and then n data items follow\njump[0x9c] = invalidMinor\njump[0x9d] = invalidMinor\njump[0x9e] = invalidMinor\njump[0x9f] = array.decodeArrayIndefinite // array, data items follow, terminated by \"break\"\n// map, 0x00..0x17 pairs of data items follow\nfor (let i = 0xa0; i <= 0xb7; i++) {\n jump[i] = map.decodeMapCompact\n}\njump[0xb8] = map.decodeMap8 // map, one-byte uint8_t for n, and then n pairs of data items follow\njump[0xb9] = map.decodeMap16 // map, two-byte uint16_t for n, and then n pairs of data items follow\njump[0xba] = map.decodeMap32 // map, four-byte uint32_t for n, and then n pairs of data items follow\njump[0xbb] = map.decodeMap64 // map, eight-byte uint64_t for n, and then n pairs of data items follow\njump[0xbc] = invalidMinor\njump[0xbd] = invalidMinor\njump[0xbe] = invalidMinor\njump[0xbf] = map.decodeMapIndefinite // map, pairs of data items follow, terminated by \"break\"\n// tags\nfor (let i = 0xc0; i <= 0xd7; i++) {\n jump[i] = tag.decodeTagCompact\n}\njump[0xd8] = tag.decodeTag8\njump[0xd9] = tag.decodeTag16\njump[0xda] = tag.decodeTag32\njump[0xdb] = tag.decodeTag64\njump[0xdc] = invalidMinor\njump[0xdd] = invalidMinor\njump[0xde] = invalidMinor\njump[0xdf] = invalidMinor\n// 0xe0..0xf3 simple values, unsupported\nfor (let i = 0xe0; i <= 0xf3; i++) {\n jump[i] = errorer('simple values are not supported')\n}\njump[0xf4] = invalidMinor // false, handled by quick[]\njump[0xf5] = invalidMinor // true, handled by quick[]\njump[0xf6] = invalidMinor // null, handled by quick[]\njump[0xf7] = float.decodeUndefined // undefined\njump[0xf8] = errorer('simple values are not supported') // simple value, one byte follows, unsupported\njump[0xf9] = float.decodeFloat16 // half-precision float (two-byte IEEE 754)\njump[0xfa] = float.decodeFloat32 // single-precision float (four-byte IEEE 754)\njump[0xfb] = float.decodeFloat64 // double-precision float (eight-byte IEEE 754)\njump[0xfc] = invalidMinor\njump[0xfd] = invalidMinor\njump[0xfe] = invalidMinor\njump[0xff] = float.decodeBreak // \"break\" stop code\n\n/** @type {Token[]} */\nexport const quick = []\n// ints <24\nfor (let i = 0; i < 24; i++) {\n quick[i] = new Token(Type.uint, i, 1)\n}\n// negints >= -24\nfor (let i = -1; i >= -24; i--) {\n quick[31 - i] = new Token(Type.negint, i, 1)\n}\n// empty bytes\nquick[0x40] = new Token(Type.bytes, new Uint8Array(0), 1)\n// empty string\nquick[0x60] = new Token(Type.string, '', 1)\n// empty list\nquick[0x80] = new Token(Type.array, 0, 1)\n// empty map\nquick[0xa0] = new Token(Type.map, 0, 1)\n// false\nquick[0xf4] = new Token(Type.false, false, 1)\n// true\nquick[0xf5] = new Token(Type.true, true, 1)\n// null\nquick[0xf6] = new Token(Type.null, null, 1)\n\n/**\n * @param {Token} token\n * @returns {Uint8Array|undefined}\n */\nexport function quickEncodeToken (token) {\n switch (token.type) {\n case Type.false:\n return fromArray([0xf4])\n case Type.true:\n return fromArray([0xf5])\n case Type.null:\n return fromArray([0xf6])\n case Type.bytes:\n if (!token.value.length) {\n return fromArray([0x40])\n }\n return\n case Type.string:\n if (token.value === '') {\n return fromArray([0x60])\n }\n return\n case Type.array:\n if (token.value === 0) {\n return fromArray([0x80])\n }\n /* c8 ignore next 2 */\n // shouldn't be possible if this were called when there was only one token\n return\n case Type.map:\n if (token.value === 0) {\n return fromArray([0xa0])\n }\n /* c8 ignore next 2 */\n // shouldn't be possible if this were called when there was only one token\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}\n","import { is } from './is.js'\nimport { Token, Type } from './token.js'\nimport { Bl } from './bl.js'\nimport { encodeErrPrefix } from './common.js'\nimport { quickEncodeToken } from './jump.js'\nimport { asU8A } from './byte-utils.js'\n\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'\n\n/**\n * @typedef {import('../interface').EncodeOptions} EncodeOptions\n * @typedef {import('../interface').OptionalTypeEncoder} OptionalTypeEncoder\n * @typedef {import('../interface').Reference} Reference\n * @typedef {import('../interface').StrictTypeEncoder} StrictTypeEncoder\n * @typedef {import('../interface').TokenTypeEncoder} TokenTypeEncoder\n * @typedef {import('../interface').TokenOrNestedTokens} TokenOrNestedTokens\n */\n\n/** @type {EncodeOptions} */\nconst defaultEncodeOptions = {\n float64: false,\n mapSorter,\n quickEncodeToken\n}\n\n/** @returns {TokenTypeEncoder[]} */\nexport function makeCborEncoders () {\n const encoders = []\n encoders[Type.uint.major] = encodeUint\n encoders[Type.negint.major] = encodeNegint\n encoders[Type.bytes.major] = encodeBytes\n encoders[Type.string.major] = encodeString\n encoders[Type.array.major] = encodeArray\n encoders[Type.map.major] = encodeMap\n encoders[Type.tag.major] = encodeTag\n encoders[Type.float.major] = encodeFloat\n return encoders\n}\n\nconst cborEncoders = makeCborEncoders()\n\nconst buf = new Bl()\n\n/** @implements {Reference} */\nclass Ref {\n /**\n * @param {object|any[]} obj\n * @param {Reference|undefined} parent\n */\n constructor (obj, parent) {\n this.obj = obj\n this.parent = parent\n }\n\n /**\n * @param {object|any[]} obj\n * @returns {boolean}\n */\n includes (obj) {\n /** @type {Reference|undefined} */\n let p = this\n do {\n if (p.obj === obj) {\n return true\n }\n } while (p = p.parent) // eslint-disable-line\n return false\n }\n\n /**\n * @param {Reference|undefined} stack\n * @param {object|any[]} obj\n * @returns {Reference}\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}\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}\n\n/** @type {{[typeName: string]: StrictTypeEncoder}} */\nconst typeEncoders = {\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\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\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\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\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n Uint8Array (obj, _typ, _options, _refStack) {\n return new Token(Type.bytes, obj)\n },\n\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n string (obj, _typ, _options, _refStack) {\n return new Token(Type.string, obj)\n },\n\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n boolean (obj, _typ, _options, _refStack) {\n return obj ? simpleTokens.true : simpleTokens.false\n },\n\n /**\n * @param {any} _obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n null (_obj, _typ, _options, _refStack) {\n return simpleTokens.null\n },\n\n /**\n * @param {any} _obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n undefined (_obj, _typ, _options, _refStack) {\n return simpleTokens.undefined\n },\n\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n ArrayBuffer (obj, _typ, _options, _refStack) {\n return new Token(Type.bytes, new Uint8Array(obj))\n },\n\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} _options\n * @param {Reference} [_refStack]\n * @returns {TokenOrNestedTokens}\n */\n DataView (obj, _typ, _options, _refStack) {\n return new Token(Type.bytes, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength))\n },\n\n /**\n * @param {any} obj\n * @param {string} _typ\n * @param {EncodeOptions} options\n * @param {Reference} [refStack]\n * @returns {TokenOrNestedTokens}\n */\n Array (obj, _typ, options, refStack) {\n if (!obj.length) {\n if (options.addBreakTokens === true) {\n return [simpleTokens.emptyArray, new Token(Type.break)]\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 [new Token(Type.array, obj.length), entries, new Token(Type.break)]\n }\n return [new Token(Type.array, obj.length), entries]\n },\n\n /**\n * @param {any} obj\n * @param {string} typ\n * @param {EncodeOptions} options\n * @param {Reference} [refStack]\n * @returns {TokenOrNestedTokens}\n */\n Object (obj, typ, options, refStack) {\n // could be an Object or a Map\n const isMap = typ !== 'Object'\n // it's slightly quicker to use Object.keys() than Object.entries()\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 [simpleTokens.emptyMap, new Token(Type.break)]\n }\n return simpleTokens.emptyMap\n }\n refStack = Ref.createCheck(refStack, obj)\n /** @type {TokenOrNestedTokens[]} */\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 [new Token(Type.map, length), entries, new Token(Type.break)]\n }\n return [new Token(Type.map, length), 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}\n\n/**\n * @param {any} obj\n * @param {EncodeOptions} [options]\n * @param {Reference} [refStack]\n * @returns {TokenOrNestedTokens}\n */\nfunction objectToTokens (obj, options = {}, refStack) {\n const typ = is(obj)\n const customTypeEncoder = (options && options.typeEncoders && /** @type {OptionalTypeEncoder} */ 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}\n\n/*\nCBOR key sorting is a mess.\n\nThe canonicalisation recommendation from https://tools.ietf.org/html/rfc7049#section-3.9\nincludes the wording:\n\n> The keys in every map must be sorted lowest value to highest.\n> Sorting is performed on the bytes of the representation of the key\n> data items without paying attention to the 3/5 bit splitting for\n> major types.\n> ...\n> * If two keys have different lengths, the shorter one sorts\n earlier;\n> * If two keys have the same length, the one with the lower value\n in (byte-wise) lexical order sorts earlier.\n\n1. It is not clear what \"bytes of the representation of the key\" means: is it\n the CBOR representation, or the binary representation of the object itself?\n Consider the int and uint difference here.\n2. It is not clear what \"without paying attention to\" means: do we include it\n and compare on that? Or do we omit the special prefix byte, (mostly) treating\n the key in its plain binary representation form.\n\nThe FIDO 2.0: Client To Authenticator Protocol spec takes the original CBOR\nwording and clarifies it according to their understanding.\nhttps://fidoalliance.org/specs/fido-v2.0-rd-20170927/fido-client-to-authenticator-protocol-v2.0-rd-20170927.html#message-encoding\n\n> The keys in every map must be sorted lowest value to highest. Sorting is\n> performed on the bytes of the representation of the key data items without\n> paying attention to the 3/5 bit splitting for major types. The sorting rules\n> are:\n> * If the major types are different, the one with the lower value in numerical\n> order sorts earlier.\n> * If two keys have different lengths, the shorter one sorts earlier;\n> * If two keys have the same length, the one with the lower value in\n> (byte-wise) lexical order sorts earlier.\n\nSome other implementations, such as borc, do a full encode then do a\nlength-first, byte-wise-second comparison:\nhttps://github.com/dignifiedquire/borc/blob/b6bae8b0bcde7c3976b0f0f0957208095c392a36/src/encoder.js#L358\nhttps://github.com/dignifiedquire/borc/blob/b6bae8b0bcde7c3976b0f0f0957208095c392a36/src/utils.js#L143-L151\n\nThis has the benefit of being able to easily handle arbitrary keys, including\ncomplex types (maps and arrays).\n\nWe'll opt for the FIDO approach, since it affords some efficies since we don't\nneed a full encode of each key to determine order and can defer to the types\nto determine how to most efficiently order their values (i.e. int and uint\nordering can be done on the numbers, no need for byte-wise, for example).\n\nRecommendation: stick to single key types or you'll get into trouble, and prefer\nstring keys because it's much simpler that way.\n*/\n\n/*\n(UPDATE, Dec 2020)\nhttps://tools.ietf.org/html/rfc8949 is the updated CBOR spec and clarifies some\nof the questions above with a new recommendation for sorting order being much\ncloser to what would be expected in other environments (i.e. no length-first\nweirdness).\nThis new sorting order is not yet implemented here but could be added as an\noption. \"Determinism\" (canonicity) is system dependent and it's difficult to\nchange existing systems that are built with existing expectations. So if a new\nordering is introduced here, the old needs to be kept as well with the user\nhaving the option.\n*/\n\n/**\n * @param {TokenOrNestedTokens[]} entries\n * @param {EncodeOptions} options\n */\nfunction sortMapEntries (entries, options) {\n if (options.mapSorter) {\n entries.sort(options.mapSorter)\n }\n}\n\n/**\n * @param {(Token|Token[])[]} e1\n * @param {(Token|Token[])[]} e2\n * @returns {number}\n */\nfunction mapSorter (e1, e2) {\n // the key position ([0]) could have a single token or an array\n // almost always it'll be a single token but complex key might get involved\n /* c8 ignore next 2 */\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\n // different key types\n if (keyToken1.type !== keyToken2.type) {\n return keyToken1.type.compare(keyToken2.type)\n }\n\n const major = keyToken1.type.major\n // TODO: handle case where cmp === 0 but there are more keyToken e. complex type)\n const tcmp = cborEncoders[major].compareTokens(keyToken1, keyToken2)\n /* c8 ignore next 5 */\n if (tcmp === 0) {\n // duplicate key or complex type where the first token matched,\n // i.e. a map or array and we're only comparing the opening token\n console.warn('WARNING: complex key types used, CBOR key sorting guarantees are gone')\n }\n return tcmp\n}\n\n/**\n * @param {Bl} buf\n * @param {TokenOrNestedTokens} tokens\n * @param {TokenTypeEncoder[]} encoders\n * @param {EncodeOptions} options\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}\n\n/**\n * @param {any} data\n * @param {TokenTypeEncoder[]} encoders\n * @param {EncodeOptions} options\n * @returns {Uint8Array}\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 /* c8 ignore next 4 */\n // this would be a problem with encodedSize() functions\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 buf.reset()\n tokensToEncoded(buf, tokens, encoders, options)\n return buf.toBytes(true)\n}\n\n/**\n * @param {any} data\n * @param {EncodeOptions} [options]\n * @returns {Uint8Array}\n */\nfunction encode (data, options) {\n options = Object.assign({}, defaultEncodeOptions, options)\n return encodeCustom(data, cborEncoders, options)\n}\n\nexport { objectToTokens, encode, encodeCustom, Ref }\n","import { decodeErrPrefix } from './common.js'\nimport { Type } from './token.js'\nimport { jump, quick } from './jump.js'\n\n/**\n * @typedef {import('./token.js').Token} Token\n * @typedef {import('../interface').DecodeOptions} DecodeOptions\n * @typedef {import('../interface').DecodeTokenizer} DecodeTokenizer\n */\n\nconst defaultDecodeOptions = {\n strict: false,\n allowIndefinite: true,\n allowUndefined: true,\n allowBigInt: true\n}\n\n/**\n * @implements {DecodeTokenizer}\n */\nclass Tokeniser {\n /**\n * @param {Uint8Array} data\n * @param {DecodeOptions} options\n */\n constructor (data, options = {}) {\n this._pos = 0\n this.data = data\n this.options = options\n }\n\n pos () {\n return this._pos\n }\n\n done () {\n return this._pos >= this.data.length\n }\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 /* c8 ignore next 4 */\n // if we're here then there's something wrong with our jump or quick lists!\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 // @ts-ignore we get to assume encodedLength is set (crossing fingers slightly)\n this._pos += token.encodedLength\n return token\n }\n}\n\nconst DONE = Symbol.for('DONE')\nconst BREAK = Symbol.for('BREAK')\n\n/**\n * @param {Token} token\n * @param {DecodeTokenizer} tokeniser\n * @param {DecodeOptions} options\n * @returns {any|BREAK|DONE}\n */\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 // normal end to indefinite length array\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}\n\n/**\n * @param {Token} token\n * @param {DecodeTokenizer} tokeniser\n * @param {DecodeOptions} options\n * @returns {any|BREAK|DONE}\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 // normal end to indefinite length map\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 if (options.rejectDuplicateMapKeys === true) {\n // @ts-ignore\n if ((useMaps && m.has(key)) || (!useMaps && (key in obj))) {\n throw new Error(`${decodeErrPrefix} found repeat map key \"${key}\"`)\n }\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 // @ts-ignore TODO reconsider this .. maybe needs to be strict about key types\n m.set(key, value)\n } else {\n // @ts-ignore TODO reconsider this .. maybe needs to be strict about key types\n obj[key] = value\n }\n }\n // @ts-ignore c'mon man\n return useMaps ? m : obj\n}\n\n/**\n * @param {DecodeTokenizer} tokeniser\n * @param {DecodeOptions} options\n * @returns {any|BREAK|DONE}\n */\nfunction tokensToObject (tokeniser, options) {\n // should we support array as an argument?\n // check for tokenIter[Symbol.iterator] and replace tokenIter with what that returns?\n if (tokeniser.done()) {\n return DONE\n }\n\n const token = tokeniser.next()\n\n if (token.type === Type.break) {\n return BREAK\n }\n\n if (token.type.terminal) {\n return token.value\n }\n\n if (token.type === Type.array) {\n return tokenToArray(token, tokeniser, options)\n }\n\n if (token.type === Type.map) {\n return tokenToMap(token, tokeniser, options)\n }\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 /* c8 ignore next */\n throw new Error('unsupported')\n}\n\n/**\n * @param {Uint8Array} data\n * @param {DecodeOptions} [options]\n * @returns {[any, Uint8Array]}\n */\nfunction decodeFirst (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 return [decoded, data.subarray(tokeniser.pos())]\n}\n\n/**\n * @param {Uint8Array} data\n * @param {DecodeOptions} [options]\n * @returns {any}\n */\nfunction decode (data, options) {\n const [decoded, remainder] = decodeFirst(data, options)\n if (remainder.length > 0) {\n throw new Error(`${decodeErrPrefix} too many terminals, data makes no sense`)\n }\n return decoded\n}\n\nexport { Tokeniser, tokensToObject, decode, decodeFirst }\n","import { Type } from '../token.js'\nimport { encodeCustom } from '../encode.js'\nimport { encodeErrPrefix } from '../common.js'\nimport { asU8A, fromString } from '../byte-utils.js'\n\n/**\n * @typedef {import('../../interface').EncodeOptions} EncodeOptions\n * @typedef {import('../token').Token} Token\n * @typedef {import('../bl').Bl} Bl\n */\n\nclass JSONEncoder extends Array {\n constructor () {\n super()\n /** @type {{type:Type,elements:number}[]} */\n this.inRecursive = []\n }\n\n /**\n * @param {Bl} buf\n */\n prefix (buf) {\n const recurs = this.inRecursive[this.inRecursive.length - 1]\n if (recurs) {\n if (recurs.type === Type.array) {\n recurs.elements++\n if (recurs.elements !== 1) { // >first\n buf.push([44]) // ','\n }\n }\n if (recurs.type === Type.map) {\n recurs.elements++\n if (recurs.elements !== 1) { // >first\n if (recurs.elements % 2 === 1) { // key\n buf.push([44]) // ','\n } else {\n buf.push([58]) // ':'\n }\n }\n }\n }\n }\n\n /**\n * @param {Bl} buf\n * @param {Token} token\n */\n [Type.uint.major] (buf, token) {\n this.prefix(buf)\n const is = String(token.value)\n const isa = []\n for (let i = 0; i < is.length; i++) {\n isa[i] = is.charCodeAt(i)\n }\n buf.push(isa)\n }\n\n /**\n * @param {Bl} buf\n * @param {Token} token\n */\n [Type.negint.major] (buf, token) {\n // @ts-ignore hack\n this[Type.uint.major](buf, token)\n }\n\n /**\n * @param {Bl} _buf\n * @param {Token} _token\n */\n [Type.bytes.major] (_buf, _token) {\n throw new Error(`${encodeErrPrefix} unsupported type: Uint8Array`)\n }\n\n /**\n * @param {Bl} buf\n * @param {Token} token\n */\n [Type.string.major] (buf, token) {\n this.prefix(buf)\n // buf.push(34) // '\"'\n // encodeUtf8(token.value, byts)\n // buf.push(34) // '\"'\n const byts = fromString(JSON.stringify(token.value))\n buf.push(byts.length > 32 ? asU8A(byts) : byts)\n }\n\n /**\n * @param {Bl} buf\n * @param {Token} _token\n */\n [Type.array.major] (buf, _token) {\n this.prefix(buf)\n this.inRecursive.push({ type: Type.array, elements: 0 })\n buf.push([91]) // '['\n }\n\n /**\n * @param {Bl} buf\n * @param {Token} _token\n */\n [Type.map.major] (buf, _token) {\n this.prefix(buf)\n this.inRecursive.push({ type: Type.map, elements: 0 })\n buf.push([123]) // '{'\n }\n\n /**\n * @param {Bl} _buf\n * @param {Token} _token\n */\n [Type.tag.major] (_buf, _token) {}\n\n /**\n * @param {Bl} buf\n * @param {Token} token\n */\n [Type.float.major] (buf, token) {\n if (token.type.name === 'break') {\n const recurs = this.inRecursive.pop()\n if (recurs) {\n if (recurs.type === Type.array) {\n buf.push([93]) // ']'\n } else if (recurs.type === Type.map) {\n buf.push([125]) // '}'\n /* c8 ignore next 3 */\n } else {\n throw new Error('Unexpected recursive type; this should not happen!')\n }\n return\n }\n /* c8 ignore next 2 */\n throw new Error('Unexpected break; this should not happen!')\n }\n if (token.value === undefined) {\n throw new Error(`${encodeErrPrefix} unsupported type: undefined`)\n }\n\n this.prefix(buf)\n if (token.type.name === 'true') {\n buf.push([116, 114, 117, 101]) // 'true'\n return\n } else if (token.type.name === 'false') {\n buf.push([102, 97, 108, 115, 101]) // 'false'\n return\n } else if (token.type.name === 'null') {\n buf.push([110, 117, 108, 108]) // 'null'\n return\n }\n\n // number\n const is = String(token.value)\n const isa = []\n let dp = false\n for (let i = 0; i < is.length; i++) {\n isa[i] = is.charCodeAt(i)\n if (!dp && (isa[i] === 46 || isa[i] === 101 || isa[i] === 69)) { // '[.eE]'\n dp = true\n }\n }\n if (!dp) { // need a decimal point for floats\n isa.push(46) // '.'\n isa.push(48) // '0'\n }\n buf.push(isa)\n }\n}\n\n// The below code is mostly taken and modified from https://github.com/feross/buffer\n// Licensed MIT. Copyright (c) Feross Aboukhadijeh\n// function encodeUtf8 (string, byts) {\n// let codePoint\n// const length = string.length\n// let leadSurrogate = null\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// /* c8 ignore next 9 */\n// if (codePoint > 0xdbff) {\n// // unexpected trail\n// byts.push(0xef, 0xbf, 0xbd)\n// continue\n// } else if (i + 1 === length) {\n// // unpaired lead\n// byts.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// /* c8 ignore next 5 */\n// if (codePoint < 0xdc00) {\n// byts.push(0xef, 0xbf, 0xbd)\n// leadSurrogate = codePoint\n// continue\n// }\n\n// // valid surrogate pair\n// codePoint = (leadSurrogate - 0xd800 << 10 | codePoint - 0xdc00) + 0x10000\n// /* c8 ignore next 4 */\n// } else if (leadSurrogate) {\n// // valid bmp char, but last char was a lead\n// byts.push(0xef, 0xbf, 0xbd)\n// }\n\n// leadSurrogate = null\n\n// // encode utf8\n// if (codePoint < 0x80) {\n// // special JSON escapes\n// switch (codePoint) {\n// case 8: // '\\b'\n// byts.push(92, 98) // '\\\\b'\n// continue\n// case 9: // '\\t'\n// byts.push(92, 116) // '\\\\t'\n// continue\n// case 10: // '\\n'\n// byts.push(92, 110) // '\\\\n'\n// continue\n// case 12: // '\\f'\n// byts.push(92, 102) // '\\\\f'\n// continue\n// case 13: // '\\r'\n// byts.push(92, 114) // '\\\\r'\n// continue\n// case 34: // '\"'\n// byts.push(92, 34) // '\\\\\"'\n// continue\n// case 92: // '\\\\'\n// byts.push(92, 92) // '\\\\\\\\'\n// continue\n// }\n\n// byts.push(codePoint)\n// } else if (codePoint < 0x800) {\n// /* c8 ignore next 1 */\n// byts.push(\n// codePoint >> 0x6 | 0xc0,\n// codePoint & 0x3f | 0x80\n// )\n// } else if (codePoint < 0x10000) {\n// /* c8 ignore next 1 */\n// byts.push(\n// codePoint >> 0xc | 0xe0,\n// codePoint >> 0x6 & 0x3f | 0x80,\n// codePoint & 0x3f | 0x80\n// )\n// /* c8 ignore next 9 */\n// } else if (codePoint < 0x110000) {\n// byts.push(\n// codePoint >> 0x12 | 0xf0,\n// codePoint >> 0xc & 0x3f | 0x80,\n// codePoint >> 0x6 & 0x3f | 0x80,\n// codePoint & 0x3f | 0x80\n// )\n// } else {\n// /* c8 ignore next 2 */\n// throw new Error('Invalid code point')\n// }\n// }\n// }\n\n/**\n * @param {(Token|Token[])[]} e1\n * @param {(Token|Token[])[]} e2\n * @returns {number}\n */\nfunction mapSorter (e1, e2) {\n if (Array.isArray(e1[0]) || Array.isArray(e2[0])) {\n throw new Error(`${encodeErrPrefix} complex map keys are not supported`)\n }\n const keyToken1 = e1[0]\n const keyToken2 = e2[0]\n if (keyToken1.type !== Type.string || keyToken2.type !== Type.string) {\n throw new Error(`${encodeErrPrefix} non-string map keys are not supported`)\n }\n if (keyToken1 < keyToken2) {\n return -1\n }\n if (keyToken1 > keyToken2) {\n return 1\n }\n /* c8 ignore next 1 */\n throw new Error(`${encodeErrPrefix} unexpected duplicate map keys, this is not supported`)\n}\n\nconst defaultEncodeOptions = { addBreakTokens: true, mapSorter }\n\n/**\n * @param {any} data\n * @param {EncodeOptions} [options]\n * @returns {Uint8Array}\n */\nfunction encode (data, options) {\n options = Object.assign({}, defaultEncodeOptions, options)\n return encodeCustom(data, new JSONEncoder(), options)\n}\n\nexport { encode }\n","import { decode as _decode, decodeFirst as _decodeFirst } from '../decode.js'\nimport { Token, Type } from '../token.js'\nimport { decodeCodePointsArray } from '../byte-utils.js'\nimport { decodeErrPrefix } from '../common.js'\n\n/**\n * @typedef {import('../../interface').DecodeOptions} DecodeOptions\n * @typedef {import('../../interface').DecodeTokenizer} DecodeTokenizer\n */\n\n/**\n * @implements {DecodeTokenizer}\n */\nclass Tokenizer {\n /**\n * @param {Uint8Array} data\n * @param {DecodeOptions} options\n */\n constructor (data, options = {}) {\n this._pos = 0\n this.data = data\n this.options = options\n /** @type {string[]} */\n this.modeStack = ['value']\n this.lastToken = ''\n }\n\n pos () {\n return this._pos\n }\n\n /**\n * @returns {boolean}\n */\n done () {\n return this._pos >= this.data.length\n }\n\n /**\n * @returns {number}\n */\n ch () {\n return this.data[this._pos]\n }\n\n /**\n * @returns {string}\n */\n currentMode () {\n return this.modeStack[this.modeStack.length - 1]\n }\n\n skipWhitespace () {\n let c = this.ch()\n // @ts-ignore\n while (c === 32 /* ' ' */ || c === 9 /* '\\t' */ || c === 13 /* '\\r' */ || c === 10 /* '\\n' */) {\n c = this.data[++this._pos]\n }\n }\n\n /**\n * @param {number[]} str\n */\n expect (str) {\n if (this.data.length - this._pos < str.length) {\n throw new Error(`${decodeErrPrefix} unexpected end of input at position ${this._pos}`)\n }\n for (let i = 0; i < str.length; i++) {\n if (this.data[this._pos++] !== str[i]) {\n throw new Error(`${decodeErrPrefix} unexpected token at position ${this._pos}, expected to find '${String.fromCharCode(...str)}'`)\n }\n }\n }\n\n parseNumber () {\n const startPos = this._pos\n let negative = false\n let float = false\n\n /**\n * @param {number[]} chars\n */\n const swallow = (chars) => {\n while (!this.done()) {\n const ch = this.ch()\n if (chars.includes(ch)) {\n this._pos++\n } else {\n break\n }\n }\n }\n\n // lead\n if (this.ch() === 45) { // '-'\n negative = true\n this._pos++\n }\n if (this.ch() === 48) { // '0'\n this._pos++\n if (this.ch() === 46) { // '.'\n this._pos++\n float = true\n } else {\n return new Token(Type.uint, 0, this._pos - startPos)\n }\n }\n swallow([48, 49, 50, 51, 52, 53, 54, 55, 56, 57]) // DIGIT\n if (negative && this._pos === startPos + 1) {\n throw new Error(`${decodeErrPrefix} unexpected token at position ${this._pos}`)\n }\n if (!this.done() && this.ch() === 46) { // '.'\n if (float) {\n throw new Error(`${decodeErrPrefix} unexpected token at position ${this._pos}`)\n }\n float = true\n this._pos++\n swallow([48, 49, 50, 51, 52, 53, 54, 55, 56, 57]) // DIGIT\n }\n if (!this.done() && (this.ch() === 101 || this.ch() === 69)) { // '[eE]'\n float = true\n this._pos++\n if (!this.done() && (this.ch() === 43 || this.ch() === 45)) { // '+', '-'\n this._pos++\n }\n swallow([48, 49, 50, 51, 52, 53, 54, 55, 56, 57]) // DIGIT\n }\n // @ts-ignore\n const numStr = String.fromCharCode.apply(null, this.data.subarray(startPos, this._pos))\n const num = parseFloat(numStr)\n if (float) {\n return new Token(Type.float, num, this._pos - startPos)\n }\n if (this.options.allowBigInt !== true || Number.isSafeInteger(num)) {\n return new Token(num >= 0 ? Type.uint : Type.negint, num, this._pos - startPos)\n }\n return new Token(num >= 0 ? Type.uint : Type.negint, BigInt(numStr), this._pos - startPos)\n }\n\n /**\n * @returns {Token}\n */\n parseString () {\n /* c8 ignore next 4 */\n if (this.ch() !== 34) { // '\"'\n // this would be a programming error\n throw new Error(`${decodeErrPrefix} unexpected character at position ${this._pos}; this shouldn't happen`)\n }\n this._pos++\n\n // check for simple fast-path, all printable ascii, no escapes\n // >0x10000 elements may fail fn.apply() (http://stackoverflow.com/a/22747272/680742)\n for (let i = this._pos, l = 0; i < this.data.length && l < 0x10000; i++, l++) {\n const ch = this.data[i]\n if (ch === 92 || ch < 32 || ch >= 128) { // '\\', ' ', control-chars or non-trivial\n break\n }\n if (ch === 34) { // '\"'\n // @ts-ignore\n const str = String.fromCharCode.apply(null, this.data.subarray(this._pos, i))\n this._pos = i + 1\n return new Token(Type.string, str, l)\n }\n }\n\n const startPos = this._pos\n const chars = []\n\n const readu4 = () => {\n if (this._pos + 4 >= this.data.length) {\n throw new Error(`${decodeErrPrefix} unexpected end of unicode escape sequence at position ${this._pos}`)\n }\n let u4 = 0\n for (let i = 0; i < 4; i++) {\n let ch = this.ch()\n if (ch >= 48 && ch <= 57) { // '0' && '9'\n ch -= 48\n } else if (ch >= 97 && ch <= 102) { // 'a' && 'f'\n ch = ch - 97 + 10\n } else if (ch >= 65 && ch <= 70) { // 'A' && 'F'\n ch = ch - 65 + 10\n } else {\n throw new Error(`${decodeErrPrefix} unexpected unicode escape character at position ${this._pos}`)\n }\n u4 = u4 * 16 + ch\n this._pos++\n }\n return u4\n }\n\n // mostly taken from feross/buffer and adjusted to fit\n const readUtf8Char = () => {\n const firstByte = this.ch()\n let codePoint = null\n /* c8 ignore next 1 */\n let bytesPerSequence = (firstByte > 0xef) ? 4 : (firstByte > 0xdf) ? 3 : (firstByte > 0xbf) ? 2 : 1\n\n if (this._pos + bytesPerSequence > this.data.length) {\n throw new Error(`${decodeErrPrefix} unexpected unicode sequence at position ${this._pos}`)\n }\n\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n /* c8 ignore next 6 */\n // this case is dealt with by the caller function\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = this.data[this._pos + 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 = this.data[this._pos + 1]\n thirdByte = this.data[this._pos + 2]\n if ((secondByte & 0xc0) === 0x80 && (thirdByte & 0xc0) === 0x80) {\n tempCodePoint = (firstByte & 0xf) << 0xc | (secondByte & 0x3f) << 0x6 | (thirdByte & 0x3f)\n /* c8 ignore next 3 */\n if (tempCodePoint > 0x7ff && (tempCodePoint < 0xd800 || tempCodePoint > 0xdfff)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = this.data[this._pos + 1]\n thirdByte = this.data[this._pos + 2]\n fourthByte = this.data[this._pos + 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 /* c8 ignore next 5 */\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 chars.push(codePoint >>> 10 & 0x3ff | 0xd800)\n codePoint = 0xdc00 | codePoint & 0x3ff\n }\n\n chars.push(codePoint)\n this._pos += bytesPerSequence\n }\n\n // TODO: could take the approach of a quick first scan for special chars like encoding/json/decode.go#unquoteBytes\n // and converting all of the ascii chars from the base array in bulk\n while (!this.done()) {\n const ch = this.ch()\n let ch1\n switch (ch) {\n case 92: // '\\'\n this._pos++\n if (this.done()) {\n throw new Error(`${decodeErrPrefix} unexpected string termination at position ${this._pos}`)\n }\n ch1 = this.ch()\n this._pos++\n switch (ch1) {\n case 34: // '\"'\n case 39: // '\\''\n case 92: // '\\'\n case 47: // '/'\n chars.push(ch1)\n break\n case 98: // 'b'\n chars.push(8)\n break\n case 116: // 't'\n chars.push(9)\n break\n case 110: // 'n'\n chars.push(10)\n break\n case 102: // 'f'\n chars.push(12)\n break\n case 114: // 'r'\n chars.push(13)\n break\n case 117: // 'u'\n chars.push(readu4())\n break\n default:\n throw new Error(`${decodeErrPrefix} unexpected string escape character at position ${this._pos}`)\n }\n break\n case 34: // '\"'\n this._pos++\n return new Token(Type.string, decodeCodePointsArray(chars), this._pos - startPos)\n default:\n if (ch < 32) { // ' '\n throw new Error(`${decodeErrPrefix} invalid control character at position ${this._pos}`)\n } else if (ch < 0x80) {\n chars.push(ch)\n this._pos++\n } else {\n readUtf8Char()\n }\n }\n }\n\n throw new Error(`${decodeErrPrefix} unexpected end of string at position ${this._pos}`)\n }\n\n /**\n * @returns {Token}\n */\n parseValue () {\n switch (this.ch()) {\n case 123: // '{'\n this.modeStack.push('obj-start')\n this._pos++\n return new Token(Type.map, Infinity, 1)\n case 91: // '['\n this.modeStack.push('array-start')\n this._pos++\n return new Token(Type.array, Infinity, 1)\n case 34: { // '\"'\n return this.parseString()\n }\n case 110: // 'n' / null\n this.expect([110, 117, 108, 108]) // 'null'\n return new Token(Type.null, null, 4)\n case 102: // 'f' / // false\n this.expect([102, 97, 108, 115, 101]) // 'false'\n return new Token(Type.false, false, 5)\n case 116: // 't' / // true\n this.expect([116, 114, 117, 101]) // 'true'\n return new Token(Type.true, true, 4)\n case 45: // '-'\n case 48: // '0'\n case 49: // '1'\n case 50: // '2'\n case 51: // '3'\n case 52: // '4'\n case 53: // '5'\n case 54: // '6'\n case 55: // '7'\n case 56: // '8'\n case 57: // '9'\n return this.parseNumber()\n default:\n throw new Error(`${decodeErrPrefix} unexpected character at position ${this._pos}`)\n }\n }\n\n /**\n * @returns {Token}\n */\n next () {\n this.skipWhitespace()\n switch (this.currentMode()) {\n case 'value':\n this.modeStack.pop()\n return this.parseValue()\n case 'array-value': {\n this.modeStack.pop()\n if (this.ch() === 93) { // ']'\n this._pos++\n this.skipWhitespace()\n return new Token(Type.break, undefined, 1)\n }\n if (this.ch() !== 44) { // ','\n throw new Error(`${decodeErrPrefix} unexpected character at position ${this._pos}, was expecting array delimiter but found '${String.fromCharCode(this.ch())}'`)\n }\n this._pos++\n this.modeStack.push('array-value')\n this.skipWhitespace()\n return this.parseValue()\n }\n case 'array-start': {\n this.modeStack.pop()\n if (this.ch() === 93) { // ']'\n this._pos++\n this.skipWhitespace()\n return new Token(Type.break, undefined, 1)\n }\n this.modeStack.push('array-value')\n this.skipWhitespace()\n return this.parseValue()\n }\n // @ts-ignore\n case 'obj-key':\n if (this.ch() === 125) { // '}'\n this.modeStack.pop()\n this._pos++\n this.skipWhitespace()\n return new Token(Type.break, undefined, 1)\n }\n if (this.ch() !== 44) { // ','\n throw new Error(`${decodeErrPrefix} unexpected character at position ${this._pos}, was expecting object delimiter but found '${String.fromCharCode(this.ch())}'`)\n }\n this._pos++\n this.skipWhitespace()\n case 'obj-start': { // eslint-disable-line no-fallthrough\n this.modeStack.pop()\n if (this.ch() === 125) { // '}'\n this._pos++\n this.skipWhitespace()\n return new Token(Type.break, undefined, 1)\n }\n const token = this.parseString()\n this.skipWhitespace()\n if (this.ch() !== 58) { // ':'\n throw new Error(`${decodeErrPrefix} unexpected character at position ${this._pos}, was expecting key/value delimiter ':' but found '${String.fromCharCode(this.ch())}'`)\n }\n this._pos++\n this.modeStack.push('obj-value')\n return token\n }\n case 'obj-value': {\n this.modeStack.pop()\n this.modeStack.push('obj-key')\n this.skipWhitespace()\n return this.parseValue()\n }\n /* c8 ignore next 2 */\n default:\n throw new Error(`${decodeErrPrefix} unexpected parse state at position ${this._pos}; this shouldn't happen`)\n }\n }\n}\n\n/**\n * @param {Uint8Array} data\n * @param {DecodeOptions} [options]\n * @returns {any}\n */\nfunction decode (data, options) {\n options = Object.assign({ tokenizer: new Tokenizer(data, options) }, options)\n return _decode(data, options)\n}\n\n/**\n * @param {Uint8Array} data\n * @param {DecodeOptions} [options]\n * @returns {[any, Uint8Array]}\n */\nfunction decodeFirst (data, options) {\n options = Object.assign({ tokenizer: new Tokenizer(data, options) }, options)\n return _decodeFirst(data, options)\n}\n\nexport { decode, decodeFirst, Tokenizer }\n","export const empty = new Uint8Array(0)\n\nexport function toHex (d: Uint8Array): string {\n return d.reduce((hex, byte) => hex + byte.toString(16).padStart(2, '0'), '')\n}\n\nexport function fromHex (hex: string): Uint8Array {\n const hexes = hex.match(/../g)\n return hexes != null ? new Uint8Array(hexes.map(b => parseInt(b, 16))) : empty\n}\n\nexport function equals (aa: Uint8Array, bb: Uint8Array): boolean {\n if (aa === bb) return true\n if (aa.byteLength !== bb.byteLength) {\n return false\n }\n\n for (let ii = 0; ii < aa.byteLength; ii++) {\n if (aa[ii] !== bb[ii]) {\n return false\n }\n }\n\n return true\n}\n\nexport function coerce (o: ArrayBufferView | ArrayBuffer | Uint8Array): Uint8Array {\n if (o instanceof Uint8Array && o.constructor.name === 'Uint8Array') return o\n if (o instanceof ArrayBuffer) return new Uint8Array(o)\n if (ArrayBuffer.isView(o)) {\n return new Uint8Array(o.buffer, o.byteOffset, o.byteLength)\n }\n throw new Error('Unknown type, must be binary type')\n}\n\nexport function isBinary (o: unknown): o is ArrayBuffer | ArrayBufferView {\n return o instanceof ArrayBuffer || ArrayBuffer.isView(o)\n}\n\nexport function fromString (str: string): Uint8Array {\n return new TextEncoder().encode(str)\n}\n\nexport function toString (b: Uint8Array): string {\n return new TextDecoder().decode(b)\n}\n","/* eslint-disable */\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.\n/**\n * @param {string} ALPHABET\n * @param {any} name\n */\nfunction base (ALPHABET, name) {\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 /**\n * @param {any[] | Iterable<number>} source\n */\n function encode (source) {\n // @ts-ignore\n if (source instanceof Uint8Array) ; 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 /**\n * @param {string | string[]} source\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 /**\n * @param {string | string[]} string\n */\n function decode (string) {\n var buffer = decodeUnsafe(string);\n if (buffer) { return buffer }\n throw new Error(`Non-${name} character`)\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nvar src = base;\n\nvar _brrp__multiformats_scope_baseX = src;\n\nexport default _brrp__multiformats_scope_baseX;\n","import { coerce } from '../bytes.js'\nimport basex from '../vendor/base-x.js'\nimport type { BaseCodec, BaseDecoder, BaseEncoder, CombobaseDecoder, Multibase, MultibaseCodec, MultibaseDecoder, MultibaseEncoder, UnibaseDecoder } from './interface.js'\n\ninterface EncodeFn { (bytes: Uint8Array): string }\ninterface DecodeFn { (text: string): Uint8Array }\n\n/**\n * Class represents both BaseEncoder and MultibaseEncoder meaning it\n * can be used to encode to multibase or base encode without multibase\n * prefix.\n */\nclass Encoder<Base extends string, Prefix extends string> implements MultibaseEncoder<Prefix>, BaseEncoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseEncode: EncodeFn\n\n constructor (name: Base, prefix: Prefix, baseEncode: EncodeFn) {\n this.name = name\n this.prefix = prefix\n this.baseEncode = baseEncode\n }\n\n encode (bytes: Uint8Array): Multibase<Prefix> {\n if (bytes instanceof Uint8Array) {\n return `${this.prefix}${this.baseEncode(bytes)}`\n } else {\n throw Error('Unknown type, must be binary type')\n }\n }\n}\n\n/**\n * Class represents both BaseDecoder and MultibaseDecoder so it could be used\n * to decode multibases (with matching prefix) or just base decode strings\n * with corresponding base encoding.\n */\nclass Decoder<Base extends string, Prefix extends string> implements MultibaseDecoder<Prefix>, UnibaseDecoder<Prefix>, BaseDecoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseDecode: DecodeFn\n private readonly prefixCodePoint: number\n\n constructor (name: Base, prefix: Prefix, baseDecode: DecodeFn) {\n this.name = name\n this.prefix = prefix\n /* c8 ignore next 3 */\n if (prefix.codePointAt(0) === undefined) {\n throw new Error('Invalid prefix character')\n }\n this.prefixCodePoint = prefix.codePointAt(0) as number\n this.baseDecode = baseDecode\n }\n\n decode (text: string): Uint8Array {\n if (typeof text === 'string') {\n if (text.codePointAt(0) !== this.prefixCodePoint) {\n throw Error(`Unable to decode multibase string ${JSON.stringify(text)}, ${this.name} decoder only supports inputs prefixed with ${this.prefix}`)\n }\n return this.baseDecode(text.slice(this.prefix.length))\n } else {\n throw Error('Can only multibase decode strings')\n }\n }\n\n or<OtherPrefix extends string> (decoder: UnibaseDecoder<OtherPrefix> | ComposedDecoder<OtherPrefix>): ComposedDecoder<Prefix | OtherPrefix> {\n return or(this, decoder)\n }\n}\n\ntype Decoders<Prefix extends string> = Record<Prefix, UnibaseDecoder<Prefix>>\n\nclass ComposedDecoder<Prefix extends string> implements MultibaseDecoder<Prefix>, CombobaseDecoder<Prefix> {\n readonly decoders: Decoders<Prefix>\n\n constructor (decoders: Decoders<Prefix>) {\n this.decoders = decoders\n }\n\n or <OtherPrefix extends string> (decoder: UnibaseDecoder<OtherPrefix> | ComposedDecoder<OtherPrefix>): ComposedDecoder<Prefix | OtherPrefix> {\n return or(this, decoder)\n }\n\n decode (input: string): Uint8Array {\n const prefix = input[0] as Prefix\n const decoder = this.decoders[prefix]\n if (decoder != null) {\n return decoder.decode(input)\n } else {\n throw RangeError(`Unable to decode multibase string ${JSON.stringify(input)}, only inputs prefixed with ${Object.keys(this.decoders)} are supported`)\n }\n }\n}\n\nexport function or <L extends string, R extends string> (left: UnibaseDecoder<L> | CombobaseDecoder<L>, right: UnibaseDecoder<R> | CombobaseDecoder<R>): ComposedDecoder<L | R> {\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n return new ComposedDecoder({\n ...(left.decoders ?? { [(left as UnibaseDecoder<L>).prefix]: left }),\n ...(right.decoders ?? { [(right as UnibaseDecoder<R>).prefix]: right })\n } as Decoders<L | R>)\n}\n\nexport class Codec<Base extends string, Prefix extends string> implements MultibaseCodec<Prefix>, MultibaseEncoder<Prefix>, MultibaseDecoder<Prefix>, BaseCodec, BaseEncoder, BaseDecoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseEncode: EncodeFn\n readonly baseDecode: DecodeFn\n readonly encoder: Encoder<Base, Prefix>\n readonly decoder: Decoder<Base, Prefix>\n\n constructor (name: Base, prefix: Prefix, baseEncode: EncodeFn, baseDecode: DecodeFn) {\n this.name = name\n this.prefix = prefix\n this.baseEncode = baseEncode\n this.baseDecode = baseDecode\n this.encoder = new Encoder(name, prefix, baseEncode)\n this.decoder = new Decoder(name, prefix, baseDecode)\n }\n\n encode (input: Uint8Array): string {\n return this.encoder.encode(input)\n }\n\n decode (input: string): Uint8Array {\n return this.decoder.decode(input)\n }\n}\n\nexport function from <Base extends string, Prefix extends string> ({ name, prefix, encode, decode }: { name: Base, prefix: Prefix, encode: EncodeFn, decode: DecodeFn }): Codec<Base, Prefix> {\n return new Codec(name, prefix, encode, decode)\n}\n\nexport function baseX <Base extends string, Prefix extends string> ({ name, prefix, alphabet }: { name: Base, prefix: Prefix, alphabet: string }): Codec<Base, Prefix> {\n const { encode, decode } = basex(alphabet, name)\n return from({\n prefix,\n name,\n encode,\n decode: (text: string): Uint8Array => coerce(decode(text))\n })\n}\n\nfunction decode (string: string, alphabet: string, bitsPerChar: number, name: string): Uint8Array {\n // Build the character lookup table:\n const codes: Record<string, number> = {}\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(`Non-${name} character`)\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))) !== 0) {\n throw new SyntaxError('Unexpected end of data')\n }\n\n return out\n}\n\nfunction encode (data: Uint8Array, alphabet: string, bitsPerChar: number): string {\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 !== 0) {\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) !== 0) {\n out += '='\n }\n }\n\n return out\n}\n\n/**\n * RFC4648 Factory\n */\nexport function rfc4648 <Base extends string, Prefix extends string> ({ name, prefix, bitsPerChar, alphabet }: { name: Base, prefix: Prefix, bitsPerChar: number, alphabet: string }): Codec<Base, Prefix> {\n return from({\n prefix,\n name,\n encode (input: Uint8Array): string {\n return encode(input, alphabet, bitsPerChar)\n },\n decode (input: string): Uint8Array {\n return decode(input, alphabet, bitsPerChar, name)\n }\n })\n}\n","import { rfc4648 } from './base.js'\n\nexport const base32 = rfc4648({\n prefix: 'b',\n name: 'base32',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567',\n bitsPerChar: 5\n})\n\nexport const base32upper = rfc4648({\n prefix: 'B',\n name: 'base32upper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567',\n bitsPerChar: 5\n})\n\nexport const base32pad = rfc4648({\n prefix: 'c',\n name: 'base32pad',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567=',\n bitsPerChar: 5\n})\n\nexport const base32padupper = rfc4648({\n prefix: 'C',\n name: 'base32padupper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=',\n bitsPerChar: 5\n})\n\nexport const base32hex = rfc4648({\n prefix: 'v',\n name: 'base32hex',\n alphabet: '0123456789abcdefghijklmnopqrstuv',\n bitsPerChar: 5\n})\n\nexport const base32hexupper = rfc4648({\n prefix: 'V',\n name: 'base32hexupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV',\n bitsPerChar: 5\n})\n\nexport const base32hexpad = rfc4648({\n prefix: 't',\n name: 'base32hexpad',\n alphabet: '0123456789abcdefghijklmnopqrstuv=',\n bitsPerChar: 5\n})\n\nexport const base32hexpadupper = rfc4648({\n prefix: 'T',\n name: 'base32hexpadupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV=',\n bitsPerChar: 5\n})\n\nexport const base32z = rfc4648({\n prefix: 'h',\n name: 'base32z',\n alphabet: 'ybndrfg8ejkmcpqxot1uwisza345h769',\n bitsPerChar: 5\n})\n","import { baseX } from './base.js'\n\nexport const base58btc = baseX({\n name: 'base58btc',\n prefix: 'z',\n alphabet: '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n})\n\nexport const base58flickr = baseX({\n name: 'base58flickr',\n prefix: 'Z',\n alphabet: '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n})\n","import { coerce, equals as equalBytes } from '../bytes.js'\nimport * as varint from '../varint.js'\nimport type { MultihashDigest } from './interface.js'\n\n/**\n * Creates a multihash digest.\n */\nexport function create <Code extends number> (code: Code, digest: Uint8Array): Digest<Code, number> {\n const size = digest.byteLength\n const sizeOffset = varint.encodingLength(code)\n const digestOffset = sizeOffset + varint.encodingLength(size)\n\n const bytes = new Uint8Array(digestOffset + size)\n varint.encodeTo(code, bytes, 0)\n varint.encodeTo(size, bytes, sizeOffset)\n bytes.set(digest, digestOffset)\n\n return new Digest(code, size, digest, bytes)\n}\n\n/**\n * Turns bytes representation of multihash digest into an instance.\n */\nexport function decode (multihash: Uint8Array): MultihashDigest {\n const bytes = coerce(multihash)\n const [code, sizeOffset] = varint.decode(bytes)\n const [size, digestOffset] = varint.decode(bytes.subarray(sizeOffset))\n const digest = bytes.subarray(sizeOffset + digestOffset)\n\n if (digest.byteLength !== size) {\n throw new Error('Incorrect length')\n }\n\n return new Digest(code, size, digest, bytes)\n}\n\nexport function equals (a: MultihashDigest, b: unknown): b is MultihashDigest {\n if (a === b) {\n return true\n } else {\n const data = b as { code?: unknown, size?: unknown, bytes?: unknown }\n\n return (\n a.code === data.code &&\n a.size === data.size &&\n data.bytes instanceof Uint8Array &&\n equalBytes(a.bytes, data.bytes)\n )\n }\n}\n\n/**\n * Represents a multihash digest which carries information about the\n * hashing algorithm and an actual hash digest.\n */\nexport class Digest<Code extends number, Size extends number> implements MultihashDigest {\n readonly code: Code\n readonly size: Size\n readonly digest: Uint8Array\n readonly bytes: Uint8Array\n\n /**\n * Creates a multihash digest.\n */\n constructor (code: Code, size: Size, digest: Uint8Array, bytes: Uint8Array) {\n this.code = code\n this.size = size\n this.digest = digest\n this.bytes = bytes\n }\n}\n","/* eslint-disable */\nvar encode_1 = encode;\n\nvar MSB = 0x80\n , REST = 0x7F\n , MSBALL = ~REST\n , INT = Math.pow(2, 31);\n\n/**\n * @param {number} num\n * @param {number[]} out\n * @param {number} offset\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 // @ts-ignore\n encode.bytes = offset - oldOffset + 1;\n \n return out\n}\n\nvar decode = read;\n\nvar MSB$1 = 0x80\n , REST$1 = 0x7F;\n\n/**\n * @param {string | any[]} buf\n * @param {number} offset\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 // @ts-ignore\n read.bytes = 0;\n throw new RangeError('Could not decode varint')\n }\n b = buf[counter++];\n res += shift < 28\n ? (b & REST$1) << shift\n : (b & REST$1) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB$1)\n\n // @ts-ignore\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\nvar length = function (/** @type {number} */ 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\nvar varint = {\n encode: encode_1\n , decode: decode\n , encodingLength: length\n};\n\nvar _brrp_varint = varint;\n\nexport default _brrp_varint;\n","import varint from './vendor/varint.js'\n\nexport function decode (data: Uint8Array, offset = 0): [number, number] {\n const code = varint.decode(data, offset)\n return [code, varint.decode.bytes]\n}\n\nexport function encodeTo (int: number, target: Uint8Array, offset = 0): Uint8Array {\n varint.encode(int, target, offset)\n return target\n}\n\nexport function encodingLength (int: number): number {\n return varint.encodingLength(int)\n}\n","import { base32 } from './bases/base32.js'\nimport { base58btc } from './bases/base58.js'\nimport { coerce } from './bytes.js'\nimport * as Digest from './hashes/digest.js'\nimport * as varint from './varint.js'\nimport type * as API from './link/interface.js'\n\n// This way TS will also expose all the types from module\nexport * from './link/interface.js'\n\nexport function format <T extends API.Link<unknown, number, number, API.Version>, Prefix extends string> (link: T, base?: API.MultibaseEncoder<Prefix>): API.ToString<T, Prefix> {\n const { bytes, version } = link\n switch (version) {\n case 0:\n return toStringV0(\n bytes,\n baseCache(link),\n base as API.MultibaseEncoder<'z'> ?? base58btc.encoder\n )\n default:\n return toStringV1(\n bytes,\n baseCache(link),\n (base ?? base32.encoder) as API.MultibaseEncoder<Prefix>\n )\n }\n}\n\nexport function toJSON <Link extends API.UnknownLink> (link: Link): API.LinkJSON<Link> {\n return {\n '/': format(link)\n }\n}\n\nexport function fromJSON <Link extends API.UnknownLink> (json: API.LinkJSON<Link>): CID<unknown, number, number, API.Version> {\n return CID.parse(json['/'])\n}\n\nconst cache = new WeakMap<API.UnknownLink, Map<string, string>>()\n\nfunction baseCache (cid: API.UnknownLink): Map<string, string> {\n const baseCache = cache.get(cid)\n if (baseCache == null) {\n const baseCache = new Map()\n cache.set(cid, baseCache)\n return baseCache\n }\n return baseCache\n}\n\nexport class CID<Data = unknown, Format extends number = number, Alg extends number = number, Version extends API.Version = API.Version> implements API.Link<Data, Format, Alg, Version> {\n readonly code: Format\n readonly version: Version\n readonly multihash: API.MultihashDigest<Alg>\n readonly bytes: Uint8Array\n readonly '/': Uint8Array\n\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param multihash - (Multi)hash of the of the content.\n */\n constructor (version: Version, code: Format, multihash: API.MultihashDigest<Alg>, bytes: Uint8Array) {\n this.code = code\n this.version = version\n this.multihash = multihash\n this.bytes = bytes\n\n // flag to serializers that this is a CID and\n // should be treated specially\n this['/'] = bytes\n }\n\n /**\n * Signalling `cid.asCID === cid` has been replaced with `cid['/'] === cid.bytes`\n * please either use `CID.asCID(cid)` or switch to new signalling mechanism\n *\n * @deprecated\n */\n get asCID (): this {\n return this\n }\n\n // ArrayBufferView\n get byteOffset (): number {\n return this.bytes.byteOffset\n }\n\n // ArrayBufferView\n get byteLength (): number {\n return this.bytes.byteLength\n }\n\n toV0 (): CID<Data, API.DAG_PB, API.SHA_256, 0> {\n switch (this.version) {\n case 0: {\n return this as CID<Data, API.DAG_PB, API.SHA_256, 0>\n }\n case 1: {\n const { code, multihash } = this\n\n if (code !== DAG_PB_CODE) {\n throw new Error('Cannot convert a non dag-pb CID to CIDv0')\n }\n\n // sha2-256\n if (multihash.code !== SHA_256_CODE) {\n throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0')\n }\n\n return (\n CID.createV0(\n multihash as API.MultihashDigest<API.SHA_256>\n )\n )\n }\n default: {\n throw Error(\n `Can not convert CID version ${this.version} to version 0. This is a bug please report`\n )\n }\n }\n }\n\n toV1 (): CID<Data, Format, Alg, 1> {\n switch (this.version) {\n case 0: {\n const { code, digest } = this.multihash\n const multihash = Digest.create(code, digest)\n return (\n CID.createV1(this.code, multihash)\n )\n }\n case 1: {\n return this as CID<Data, Format, Alg, 1>\n }\n default: {\n throw Error(\n `Can not convert CID version ${this.version} to version 1. This is a bug please report`\n )\n }\n }\n }\n\n equals (other: unknown): other is CID<Data, Format, Alg, Version> {\n return CID.equals(this, other)\n }\n\n static equals <Data, Format extends number, Alg extends number, Version extends API.Version>(self: API.Link<Data, Format, Alg, Version>, other: unknown): other is CID {\n const unknown = other as { code?: unknown, version?: unknown, multihash?: unknown }\n return (\n unknown != null &&\n self.code === unknown.code &&\n self.version === unknown.version &&\n Digest.equals(self.multihash, unknown.multihash)\n )\n }\n\n toString (base?: API.MultibaseEncoder<string>): string {\n return format(this, base)\n }\n\n toJSON (): API.LinkJSON<this> {\n return { '/': format(this) }\n }\n\n link (): this {\n return this\n }\n\n readonly [Symbol.toStringTag] = 'CID';\n\n // Legacy\n\n [Symbol.for('nodejs.util.inspect.custom')] (): string {\n return `CID(${this.toString()})`\n }\n\n /**\n * Takes any input `value` and returns a `CID` instance if it was\n * a `CID` otherwise returns `null`. If `value` is instanceof `CID`\n * it will return value back. If `value` is not instance of this CID\n * class, but is compatible CID it will return new instance of this\n * `CID` class. Otherwise returns null.\n *\n * This allows two different incompatible versions of CID library to\n * co-exist and interop as long as binary interface is compatible.\n */\n static asCID <Data, Format extends number, Alg extends number, Version extends API.Version, U>(input: API.Link<Data, Format, Alg, Version> | U): CID<Data, Format, Alg, Version> | null {\n if (input == null) {\n return null\n }\n\n const value = input as any\n if (value instanceof CID) {\n // If value is instance of CID then we're all set.\n return value\n } else if ((value['/'] != null && value['/'] === value.bytes) || value.asCID === value) {\n // If value isn't instance of this CID class but `this.asCID === this` or\n // `value['/'] === value.bytes` is true it is CID instance coming from a\n // different implementation (diff version or duplicate). In that case we\n // rebase it to this `CID` implementation so caller is guaranteed to get\n // instance with expected API.\n const { version, code, multihash, bytes } = value\n return new CID(\n version,\n code,\n multihash as API.MultihashDigest<Alg>,\n bytes ?? encodeCID(version, code, multihash.bytes)\n )\n } else if (value[cidSymbol] === true) {\n // If value is a CID from older implementation that used to be tagged via\n // symbol we still rebase it to the this `CID` implementation by\n // delegating that to a constructor.\n const { version, multihash, code } = value\n const digest = Digest.decode(multihash) as API.MultihashDigest<Alg>\n return CID.create(version, code, digest)\n } else {\n // Otherwise value is not a CID (or an incompatible version of it) in\n // which case we return `null`.\n return null\n }\n }\n\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param digest - (Multi)hash of the of the content.\n */\n static create <Data, Format extends number, Alg extends number, Version extends API.Version>(version: Version, code: Format, digest: API.MultihashDigest<Alg>): CID<Data, Format, Alg, Version> {\n if (typeof code !== 'number') {\n throw new Error('String codecs are no longer supported')\n }\n\n if (!(digest.bytes instanceof Uint8Array)) {\n throw new Error('Invalid digest')\n }\n\n switch (version) {\n case 0: {\n if (code !== DAG_PB_CODE) {\n throw new Error(\n `Version 0 CID must use dag-pb (code: ${DAG_PB_CODE}) block encoding`\n )\n } else {\n return new CID(version, code, digest, digest.bytes)\n }\n }\n case 1: {\n const bytes = encodeCID(version, code, digest.bytes)\n return new CID(version, code, digest, bytes)\n }\n default: {\n throw new Error('Invalid version')\n }\n }\n }\n\n /**\n * Simplified version of `create` for CIDv0.\n */\n static createV0 <T = unknown>(digest: API.MultihashDigest<typeof SHA_256_CODE>): CID<T, typeof DAG_PB_CODE, typeof SHA_256_CODE, 0> {\n return CID.create(0, DAG_PB_CODE, digest)\n }\n\n /**\n * Simplified version of `create` for CIDv1.\n *\n * @param code - Content encoding format code.\n * @param digest - Multihash of the content.\n */\n static createV1 <Data, Code extends number, Alg extends number>(code: Code, digest: API.MultihashDigest<Alg>): CID<Data, Code, Alg, 1> {\n return CID.create(1, code, digest)\n }\n\n /**\n * Decoded a CID from its binary representation. The byte array must contain\n * only the CID with no additional bytes.\n *\n * An error will be thrown if the bytes provided do not contain a valid\n * binary representation of a CID.\n */\n static decode <Data, Code extends number, Alg extends number, Version extends API.Version>(bytes: API.ByteView<API.Link<Data, Code, Alg, Version>>): CID<Data, Code, Alg, Version> {\n const [cid, remainder] = CID.decodeFirst(bytes)\n if (remainder.length !== 0) {\n throw new Error('Incorrect length')\n }\n return cid\n }\n\n /**\n * Decoded a CID from its binary representation at the beginning of a byte\n * array.\n *\n * Returns an array with the first element containing the CID and the second\n * element containing the remainder of the original byte array. The remainder\n * will be a zero-length byte array if the provided bytes only contained a\n * binary CID representation.\n */\n static decodeFirst <T, C extends number, A extends number, V extends API.Version>(bytes: API.ByteView<API.Link<T, C, A, V>>): [CID<T, C, A, V>, Uint8Array] {\n const specs = CID.inspectBytes(bytes)\n const prefixSize = specs.size - specs.multihashSize\n const multihashBytes = coerce(\n bytes.subarray(prefixSize, prefixSize + specs.multihashSize)\n )\n if (multihashBytes.byteLength !== specs.multihashSize) {\n throw new Error('Incorrect length')\n }\n const digestBytes = multihashBytes.subarray(\n specs.multihashSize - specs.digestSize\n )\n const digest = new Digest.Digest(\n specs.multihashCode,\n specs.digestSize,\n digestBytes,\n multihashBytes\n )\n const cid =\n specs.version === 0\n ? CID.createV0(digest as API.MultihashDigest<API.SHA_256>)\n : CID.createV1(specs.codec, digest)\n return [cid as CID<T, C, A, V>, bytes.subarray(specs.size)]\n }\n\n /**\n * Inspect the initial bytes of a CID to determine its properties.\n *\n * Involves decoding up to 4 varints. Typically this will require only 4 to 6\n * bytes but for larger multicodec code values and larger multihash digest\n * lengths these varints can be quite large. It is recommended that at least\n * 10 bytes be made available in the `initialBytes` argument for a complete\n * inspection.\n */\n static inspectBytes <T, C extends number, A extends number, V extends API.Version>(initialBytes: API.ByteView<API.Link<T, C, A, V>>): { version: V, codec: C, multihashCode: A, digestSize: number, multihashSize: number, size: number } {\n let offset = 0\n const next = (): number => {\n const [i, length] = varint.decode(initialBytes.subarray(offset))\n offset += length\n return i\n }\n\n let version = next() as V\n let codec = DAG_PB_CODE as C\n if (version as number === 18) {\n // CIDv0\n version = 0 as V\n offset = 0\n } else {\n codec = next() as C\n }\n\n if (version !== 0 && version !== 1) {\n throw new RangeError(`Invalid CID version ${version}`)\n }\n\n const prefixSize = offset\n const multihashCode = next() as A // multihash code\n const digestSize = next() // multihash length\n const size = offset + digestSize\n const multihashSize = size - prefixSize\n\n return { version, codec, multihashCode, digestSize, multihashSize, size }\n }\n\n /**\n * Takes cid in a string representation and creates an instance. If `base`\n * decoder is not provided will use a default from the configuration. It will\n * throw an error if encoding of the CID is not compatible with supplied (or\n * a default decoder).\n */\n static parse <Prefix extends string, Data, Code extends number, Alg extends number, Version extends API.Version>(source: API.ToString<API.Link<Data, Code, Alg, Version>, Prefix>, base?: API.MultibaseDecoder<Prefix>): CID<Data, Code, Alg, Version> {\n const [prefix, bytes] = parseCIDtoBytes(source, base)\n\n const cid = CID.decode(bytes)\n\n if (cid.version === 0 && source[0] !== 'Q') {\n throw Error('Version 0 CID string must not include multibase prefix')\n }\n\n // Cache string representation to avoid computing it on `this.toString()`\n baseCache(cid).set(prefix, source)\n\n return cid\n }\n}\n\nfunction parseCIDtoBytes <Prefix extends string, Data, Code extends number, Alg extends number, Version extends API.Version> (source: API.ToString<API.Link<Data, Code, Alg, Version>, Prefix>, base?: API.MultibaseDecoder<Prefix>): [Prefix, API.ByteView<API.Link<Data, Code, Alg, Version>>] {\n switch (source[0]) {\n // CIDv0 is parsed differently\n case 'Q': {\n const decoder = base ?? base58btc\n return [\n base58btc.prefix as Prefix,\n decoder.decode(`${base58btc.prefix}${source}`)\n ]\n }\n case base58btc.prefix: {\n const decoder = base ?? base58btc\n return [base58btc.prefix as Prefix, decoder.decode(source)]\n }\n case base32.prefix: {\n const decoder = base ?? base32\n return [base32.prefix as Prefix, decoder.decode(source)]\n }\n default: {\n if (base == null) {\n throw Error(\n 'To parse non base32 or base58btc encoded CID multibase decoder must be provided'\n )\n }\n return [source[0] as Prefix, base.decode(source)]\n }\n }\n}\n\nfunction toStringV0 (bytes: Uint8Array, cache: Map<string, string>, base: API.MultibaseEncoder<'z'>): string {\n const { prefix } = base\n if (prefix !== base58btc.prefix) {\n throw Error(`Cannot string encode V0 in ${base.name} encoding`)\n }\n\n const cid = cache.get(prefix)\n if (cid == null) {\n const cid = base.encode(bytes).slice(1)\n cache.set(prefix, cid)\n return cid\n } else {\n return cid\n }\n}\n\nfunction toStringV1 <Prefix extends string> (bytes: Uint8Array, cache: Map<string, string>, base: API.MultibaseEncoder<Prefix>): string {\n const { prefix } = base\n const cid = cache.get(prefix)\n if (cid == null) {\n const cid = base.encode(bytes)\n cache.set(prefix, cid)\n return cid\n } else {\n return cid\n }\n}\n\nconst DAG_PB_CODE = 0x70\nconst SHA_256_CODE = 0x12\n\nfunction encodeCID (version: API.Version, code: number, multihash: Uint8Array): Uint8Array {\n const codeOffset = varint.encodingLength(version)\n const hashOffset = codeOffset + varint.encodingLength(code)\n const bytes = new Uint8Array(hashOffset + multihash.byteLength)\n varint.encodeTo(version, bytes, 0)\n varint.encodeTo(code, bytes, codeOffset)\n bytes.set(multihash, hashOffset)\n return bytes\n}\n\nconst cidSymbol = Symbol.for('@ipld/js-cid/CID')\n","import * as Digest from './digest.js'\nimport type { MultihashHasher } from './interface.js'\n\ntype Await<T> = Promise<T> | T\n\nexport function from <Name extends string, Code extends number> ({ name, code, encode }: { name: Name, code: Code, encode(input: Uint8Array): Await<Uint8Array> }): Hasher<Name, Code> {\n return new Hasher(name, code, encode)\n}\n\n/**\n * Hasher represents a hashing algorithm implementation that produces as\n * `MultihashDigest`.\n */\nexport class Hasher<Name extends string, Code extends number> implements MultihashHasher<Code> {\n readonly name: Name\n readonly code: Code\n readonly encode: (input: Uint8Array) => Await<Uint8Array>\n\n constructor (name: Name, code: Code, encode: (input: Uint8Array) => Await<Uint8Array>) {\n this.name = name\n this.code = code\n this.encode = encode\n }\n\n digest (input: Uint8Array): Await<Digest.Digest<Code, number>> {\n if (input instanceof Uint8Array) {\n const result = this.encode(input)\n return result instanceof Uint8Array\n ? Digest.create(this.code, result)\n /* c8 ignore next 1 */\n : result.then(digest => Digest.create(this.code, digest))\n } else {\n throw Error('Unknown type, must be binary type')\n /* c8 ignore next 1 */\n }\n }\n}\n","import { rfc4648 } from './base.js'\n\nexport const base64 = rfc4648({\n prefix: 'm',\n name: 'base64',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/',\n bitsPerChar: 6\n})\n\nexport const base64pad = rfc4648({\n prefix: 'M',\n name: 'base64pad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=',\n bitsPerChar: 6\n})\n\nexport const base64url = rfc4648({\n prefix: 'u',\n name: 'base64url',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_',\n bitsPerChar: 6\n})\n\nexport const base64urlpad = rfc4648({\n prefix: 'U',\n name: 'base64urlpad',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=',\n bitsPerChar: 6\n})\n","function number(n: number) {\n if (!Number.isSafeInteger(n) || n < 0) throw new Error(`Wrong positive integer: ${n}`);\n}\n\nfunction bool(b: boolean) {\n if (typeof b !== 'boolean') throw new Error(`Expected boolean, not ${b}`);\n}\n\n// copied from utils\nfunction isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\nfunction bytes(b: Uint8Array | undefined, ...lengths: number[]) {\n if (!isBytes(b)) throw new Error('Expected Uint8Array');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error(`Expected Uint8Array of length ${lengths}, not of length=${b.length}`);\n}\n\ntype Hash = {\n (data: Uint8Array): Uint8Array;\n blockLen: number;\n outputLen: number;\n create: any;\n};\nfunction hash(hash: Hash) {\n if (typeof hash !== 'function' || typeof hash.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n number(hash.outputLen);\n number(hash.blockLen);\n}\n\nfunction exists(instance: any, checkFinished = true) {\n if (instance.destroyed) throw new Error('Hash instance has been destroyed');\n if (checkFinished && instance.finished) throw new Error('Hash#digest() has already been called');\n}\nfunction output(out: any, instance: any) {\n bytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error(`digestInto() expects output buffer of length at least ${min}`);\n }\n}\n\nexport { number, bool, bytes, hash, exists, output };\n\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n\n// We use WebCrypto aka globalThis.crypto, which exists in browsers and node.js 16+.\n// node.js versions earlier than v19 don't declare it in global scope.\n// For node.js, package.json#exports field mapping rewrites import\n// from `crypto` to `cryptoNode`, which imports native module.\n// Makes the utils un-importable in browsers without a bundler.\n// Once node.js 18 is deprecated (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n\n// prettier-ignore\nexport type TypedArray = Int8Array | Uint8ClampedArray | Uint8Array |\n Uint16Array | Int16Array | Uint32Array | Int32Array;\n\n// Cast array to different type\nexport const u8 = (arr: TypedArray) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr: TypedArray) =>\n new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n\nfunction isBytes(a: unknown): a is Uint8Array {\n return (\n a instanceof Uint8Array ||\n (a != null && typeof a === 'object' && a.constructor.name === 'Uint8Array')\n );\n}\n\n// Cast array to view\nexport const createView = (arr: TypedArray) =>\n new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word: number, shift: number) => (word << (32 - shift)) | (word >>> shift);\n\n// big-endian hardware is rare. Just in case someone still decides to run hashes:\n// early-throw an error because we don't support BE yet.\n// Other libraries would silently corrupt the data instead of throwing an error,\n// when they don't support it.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE) throw new Error('Non little-endian hardware is not supported');\n\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) =>\n i.toString(16).padStart(2, '0')\n);\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes: Uint8Array): string {\n if (!isBytes(bytes)) throw new Error('Uint8Array expected');\n // pre-caching improves the speed 6x\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\n\n// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, _A: 65, _F: 70, _a: 97, _f: 102 } as const;\nfunction asciiToBase16(char: number): number | undefined {\n if (char >= asciis._0 && char <= asciis._9) return char - asciis._0;\n if (char >= asciis._A && char <= asciis._F) return char - (asciis._A - 10);\n if (char >= asciis._a && char <= asciis._f) return char - (asciis._a - 10);\n return;\n}\n\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex: string): Uint8Array {\n if (typeof hex !== 'string') throw new Error('hex string expected, got ' + typeof hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2) throw new Error('padded hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2;\n }\n return array;\n}\n\n// There is no setImmediate in browser and setTimeout is slow.\n// call of async fn will return Promise, which will be fullfiled only on\n// next scheduler queue processing step and this is exactly what we need.\nexport const nextTick = async () => {};\n\n// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters: number, tick: number, cb: (i: number) => void) {\n let ts = Date.now();\n for (let i = 0; i < iters; i++) {\n cb(i);\n // Date.now() is not monotonic, so in case if clock goes backwards we return return control too\n const diff = Date.now() - ts;\n if (diff >= 0 && diff < tick) continue;\n await nextTick();\n ts += diff;\n }\n}\n\n// Global symbols in both browsers and Node.js since v11\n// See https://github.com/microsoft/TypeScript/issues/31535\ndeclare const TextEncoder: any;\n\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str: string): Uint8Array {\n if (typeof str !== 'string') throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n\nexport type Input = Uint8Array | string;\n/**\n * Normalizes (non-hex) string or Uint8Array to Uint8Array.\n * Warning: when Uint8Array is passed, it would NOT get copied.\n * Keep in mind for future mutable operations.\n */\nexport function toBytes(data: Input): Uint8Array {\n if (typeof data === 'string') data = utf8ToBytes(data);\n if (!isBytes(data)) throw new Error(`expected Uint8Array, got ${typeof data}`);\n return data;\n}\n\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays: Uint8Array[]): Uint8Array {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n if (!isBytes(a)) throw new Error('Uint8Array expected');\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\n\n// For runtime check if class implements interface\nexport abstract class Hash<T extends Hash<T>> {\n abstract blockLen: number; // Bytes per block\n abstract outputLen: number; // Bytes in output\n abstract update(buf: Input): this;\n // Writes digest into buf\n abstract digestInto(buf: Uint8Array): void;\n abstract digest(): Uint8Array;\n /**\n * Resets internal state. Makes Hash instance unusable.\n * Reset is impossible for keyed hashes if key is consumed into state. If digest is not consumed\n * by user, they will need to manually call `destroy()` when zeroing is necessary.\n */\n abstract destroy(): void;\n /**\n * Clones hash instance. Unsafe: doesn't check whether `to` is valid. Can be used as `clone()`\n * when no options are passed.\n * Reasons to use `_cloneInto` instead of clone: 1) performance 2) reuse instance => all internal\n * buffers are overwritten => causes buffer overwrite which is used for digest in some cases.\n * There are no guarantees for clean-up because it's impossible in JS.\n */\n abstract _cloneInto(to?: T): T;\n // Safe version that clones internal state\n clone(): T {\n return this._cloneInto();\n }\n}\n\n/**\n * XOF: streaming API to read digest in chunks.\n * Same as 'squeeze' in keccak/k12 and 'seek' in blake3, but more generic name.\n * When hash used in XOF mode it is up to user to call '.destroy' afterwards, since we cannot\n * destroy state, next call can require more bytes.\n */\nexport type HashXOF<T extends Hash<T>> = Hash<T> & {\n xof(bytes: number): Uint8Array; // Read 'bytes' bytes from digest stream\n xofInto(buf: Uint8Array): Uint8Array; // read buf.length bytes from digest stream into buf\n};\n\nconst toStr = {}.toString;\ntype EmptyObj = {};\nexport function checkOpts<T1 extends EmptyObj, T2 extends EmptyObj>(\n defaults: T1,\n opts?: T2\n): T1 & T2 {\n if (opts !== undefined && toStr.call(opts) !== '[object Object]')\n throw new Error('Options should be object or undefined');\n const merged = Object.assign(defaults, opts);\n return merged as T1 & T2;\n}\n\nexport type CHash = ReturnType<typeof wrapConstructor>;\n\nexport function wrapConstructor<T extends Hash<T>>(hashCons: () => Hash<T>) {\n const hashC = (msg: Input): Uint8Array => hashCons().update(toBytes(msg)).digest();\n const tmp = hashCons();\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = () => hashCons();\n return hashC;\n}\n\nexport function wrapConstructorWithOpts<H extends Hash<H>, T extends Object>(\n hashCons: (opts?: T) => Hash<H>\n) {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts: T) => hashCons(opts);\n return hashC;\n}\n\nexport function wrapXOFConstructorWithOpts<H extends HashXOF<H>, T extends Object>(\n hashCons: (opts?: T) => HashXOF<H>\n) {\n const hashC = (msg: Input, opts?: T): Uint8Array => hashCons(opts).update(toBytes(msg)).digest();\n const tmp = hashCons({} as T);\n hashC.outputLen = tmp.outputLen;\n hashC.blockLen = tmp.blockLen;\n hashC.create = (opts: T) => hashCons(opts);\n return hashC;\n}\n\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32): Uint8Array {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n","import { exists, output } from './_assert.js';\nimport { Hash, createView, Input, toBytes } from './utils.js';\n\n// Polyfill for Safari 14\nfunction setBigUint64(view: DataView, byteOffset: number, value: bigint, isLE: boolean): void {\n if (typeof view.setBigUint64 === 'function') return view.setBigUint64(byteOffset, value, isLE);\n const _32n = BigInt(32);\n const _u32_max = BigInt(0xffffffff);\n const wh = Number((value >> _32n) & _u32_max);\n const wl = Number(value & _u32_max);\n const h = isLE ? 4 : 0;\n const l = isLE ? 0 : 4;\n view.setUint32(byteOffset + h, wh, isLE);\n view.setUint32(byteOffset + l, wl, isLE);\n}\n\n// Base SHA2 class (RFC 6234)\nexport abstract class SHA2<T extends SHA2<T>> extends Hash<T> {\n protected abstract process(buf: DataView, offset: number): void;\n protected abstract get(): number[];\n protected abstract set(...args: number[]): void;\n abstract destroy(): void;\n protected abstract roundClean(): void;\n // For partial updates less than block size\n protected buffer: Uint8Array;\n protected view: DataView;\n protected finished = false;\n protected length = 0;\n protected pos = 0;\n protected destroyed = false;\n\n constructor(\n readonly blockLen: number,\n public outputLen: number,\n readonly padOffset: number,\n readonly isLE: boolean\n ) {\n super();\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data: Input): this {\n exists(this);\n const { view, buffer, blockLen } = this;\n data = toBytes(data);\n const len = data.length;\n for (let pos = 0; pos < len; ) {\n const take = Math.min(blockLen - this.pos, len - pos);\n // Fast path: we have at least one block in input, cast it to view and process\n if (take === blockLen) {\n const dataView = createView(data);\n for (; blockLen <= len - pos; pos += blockLen) this.process(dataView, pos);\n continue;\n }\n buffer.set(data.subarray(pos, pos + take), this.pos);\n this.pos += take;\n pos += take;\n if (this.pos === blockLen) {\n this.process(view, 0);\n this.pos = 0;\n }\n }\n this.length += data.length;\n this.roundClean();\n return this;\n }\n digestInto(out: Uint8Array) {\n exists(this);\n output(out, this);\n this.finished = true;\n // Padding\n // We can avoid allocation of buffer for padding completely if it\n // was previously not allocated here. But it won't change performance.\n const { buffer, view, blockLen, isLE } = this;\n let { pos } = this;\n // append the bit '1' to the message\n buffer[pos++] = 0b10000000;\n this.buffer.subarray(pos).fill(0);\n // we have less than padOffset left in buffer, so we cannot put length in current block, need process it and pad again\n if (this.padOffset > blockLen - pos) {\n this.process(view, 0);\n pos = 0;\n }\n // Pad until full block byte with zeros\n for (let i = pos; i < blockLen; i++) buffer[i] = 0;\n // Note: sha512 requires length to be 128bit integer, but length in JS will overflow before that\n // You need to write around 2 exabytes (u64_max / 8 / (1024**6)) for this to happen.\n // So we just write lowest 64 bits of that value.\n setBigUint64(view, blockLen - 8, BigInt(this.length * 8), isLE);\n this.process(view, 0);\n const oview = createView(out);\n const len = this.outputLen;\n // NOTE: we do division by 4 later, which should be fused in single op with modulo by JIT\n if (len % 4) throw new Error('_sha2: outputLen should be aligned to 32bit');\n const outLen = len / 4;\n const state = this.get();\n if (outLen > state.length) throw new Error('_sha2: outputLen bigger than state');\n for (let i = 0; i < outLen; i++) oview.setUint32(4 * i, state[i], isLE);\n }\n digest() {\n const { buffer, outputLen } = this;\n this.digestInto(buffer);\n const res = buffer.slice(0, outputLen);\n this.destroy();\n return res;\n }\n _cloneInto(to?: T): T {\n to ||= new (this.constructor as any)() as T;\n to.set(...this.get());\n const { blockLen, buffer, length, finished, destroyed, pos } = this;\n to.length = length;\n to.pos = pos;\n to.finished = finished;\n to.destroyed = destroyed;\n if (length % blockLen) to.buffer.set(buffer);\n return to;\n }\n}\n","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\n\n// SHA2-256 need to try 2^128 hashes to execute birthday attack.\n// BTC network is doing 2^67 hashes/sec as per early 2023.\n\n// Choice: a ? b : c\nconst Chi = (a: number, b: number, c: number) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a: number, b: number, c: number) => (a & b) ^ (a & c) ^ (b & c);\n\n// Round constants:\n// first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\n// prettier-ignore\nconst SHA256_K = /* @__PURE__ */new Uint32Array([\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n// Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n// prettier-ignore\nconst IV = /* @__PURE__ */new Uint32Array([\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n]);\n\n// Temporary buffer, not used to store anything between runs\n// Named this way because it matches specification.\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nclass SHA256 extends SHA2<SHA256> {\n // We cannot use array here since array allows indexing by variable\n // which means optimizer/compiler cannot use registers.\n A = IV[0] | 0;\n B = IV[1] | 0;\n C = IV[2] | 0;\n D = IV[3] | 0;\n E = IV[4] | 0;\n F = IV[5] | 0;\n G = IV[6] | 0;\n H = IV[7] | 0;\n\n constructor() {\n super(64, 32, 8, false);\n }\n protected get(): [number, number, number, number, number, number, number, number] {\n const { A, B, C, D, E, F, G, H } = this;\n return [A, B, C, D, E, F, G, H];\n }\n // prettier-ignore\n protected set(\n A: number, B: number, C: number, D: number, E: number, F: number, G: number, H: number\n ) {\n this.A = A | 0;\n this.B = B | 0;\n this.C = C | 0;\n this.D = D | 0;\n this.E = E | 0;\n this.F = F | 0;\n this.G = G | 0;\n this.H = H | 0;\n }\n protected process(view: DataView, offset: number): void {\n // Extend the first 16 words into the remaining 48 words w[16..63] of the message schedule array\n for (let i = 0; i < 16; i++, offset += 4) SHA256_W[i] = view.getUint32(offset, false);\n for (let i = 16; i < 64; i++) {\n const W15 = SHA256_W[i - 15];\n const W2 = SHA256_W[i - 2];\n const s0 = rotr(W15, 7) ^ rotr(W15, 18) ^ (W15 >>> 3);\n const s1 = rotr(W2, 17) ^ rotr(W2, 19) ^ (W2 >>> 10);\n SHA256_W[i] = (s1 + SHA256_W[i - 7] + s0 + SHA256_W[i - 16]) | 0;\n }\n // Compression function main loop, 64 rounds\n let { A, B, C, D, E, F, G, H } = this;\n for (let i = 0; i < 64; i++) {\n const sigma1 = rotr(E, 6) ^ rotr(E, 11) ^ rotr(E, 25);\n const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n const sigma0 = rotr(A, 2) ^ rotr(A, 13) ^ rotr(A, 22);\n const T2 = (sigma0 + Maj(A, B, C)) | 0;\n H = G;\n G = F;\n F = E;\n E = (D + T1) | 0;\n D = C;\n C = B;\n B = A;\n A = (T1 + T2) | 0;\n }\n // Add the compressed chunk to the current hash value\n A = (A + this.A) | 0;\n B = (B + this.B) | 0;\n C = (C + this.C) | 0;\n D = (D + this.D) | 0;\n E = (E + this.E) | 0;\n F = (F + this.F) | 0;\n G = (G + this.G) | 0;\n H = (H + this.H) | 0;\n this.set(A, B, C, D, E, F, G, H);\n }\n protected roundClean() {\n SHA256_W.fill(0);\n }\n destroy() {\n this.set(0, 0, 0, 0, 0, 0, 0, 0);\n this.buffer.fill(0);\n }\n}\n// Constants from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf\nclass SHA224 extends SHA256 {\n A = 0xc1059ed8 | 0;\n B = 0x367cd507 | 0;\n C = 0x3070dd17 | 0;\n D = 0xf70e5939 | 0;\n E = 0xffc00b31 | 0;\n F = 0x68581511 | 0;\n G = 0x64f98fa7 | 0;\n H = 0xbefa4fa4 | 0;\n constructor() {\n super();\n this.outputLen = 28;\n }\n}\n\n/**\n * SHA2-256 hash function\n * @param message - data that would be hashed\n */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\nexport const sha224 = /* @__PURE__ */ wrapConstructor(() => new SHA224());\n","import { bytes as binary, CID } from './index.js'\nimport type * as API from './interface.js'\n\nfunction readonly ({ enumerable = true, configurable = false } = {}): { enumerable: boolean, configurable: boolean, writable: false } {\n return { enumerable, configurable, writable: false }\n}\n\nfunction * linksWithin (path: [string | number, string], value: any): Iterable<[string, CID]> {\n if (value != null && typeof value === 'object') {\n if (Array.isArray(value)) {\n for (const [index, element] of value.entries()) {\n const elementPath = [...path, index]\n const cid = CID.asCID(element)\n if (cid != null) {\n yield [elementPath.join('/'), cid]\n } else if (typeof element === 'object') {\n yield * links(element, elementPath)\n }\n }\n } else {\n const cid = CID.asCID(value)\n if (cid != null) {\n yield [path.join('/'), cid]\n } else {\n yield * links(value, path)\n }\n }\n }\n}\n\nfunction * links <T> (source: T, base: Array<string | number>): Iterable<[string, CID]> {\n if (source == null || source instanceof Uint8Array) {\n return\n }\n const cid = CID.asCID(source)\n if (cid != null) {\n yield [base.join('/'), cid]\n }\n for (const [key, value] of Object.entries(source)) {\n const path = [...base, key] as [string | number, string]\n yield * linksWithin(path, value)\n }\n}\n\nfunction * treeWithin (path: [string | number, string], value: any): Iterable<string> {\n if (Array.isArray(value)) {\n for (const [index, element] of value.entries()) {\n const elementPath = [...path, index]\n yield elementPath.join('/')\n if (typeof element === 'object' && (CID.asCID(element) == null)) {\n yield * tree(element, elementPath)\n }\n }\n } else {\n yield * tree(value, path)\n }\n}\n\nfunction * tree <T> (source: T, base: Array<string | number>): Iterable<string> {\n if (source == null || typeof source !== 'object') {\n return\n }\n for (const [key, value] of Object.entries(source)) {\n const path = [...base, key] as [string | number, string]\n yield path.join('/')\n if (value != null && !(value instanceof Uint8Array) && typeof value === 'object' && (CID.asCID(value) == null)) {\n yield * treeWithin(path, value)\n }\n }\n}\n\nfunction get <T> (source: T, path: string[]): API.BlockCursorView<unknown> {\n let node = source as Record<string, any>\n for (const [index, key] of path.entries()) {\n node = node[key]\n if (node == null) {\n throw new Error(`Object has no property at ${path.slice(0, index + 1).map(part => `[${JSON.stringify(part)}]`).join('')}`)\n }\n const cid = CID.asCID(node)\n if (cid != null) {\n return { value: cid, remaining: path.slice(index + 1).join('/') }\n }\n }\n return { value: node }\n}\n\n/**\n * @template T - Logical type of the data encoded in the block\n * @template C - multicodec code corresponding to codec used to encode the block\n * @template A - multicodec code corresponding to the hashing algorithm used in CID creation.\n * @template V - CID version\n */\nexport class Block<T, C extends number, A extends number, V extends API.Version> implements API.BlockView<T, C, A, V> {\n readonly cid: CID<T, C, A, V>\n readonly bytes: API.ByteView<T>\n readonly value: T\n readonly asBlock: this\n\n constructor ({ cid, bytes, value }: { cid: CID<T, C, A, V>, bytes: API.ByteView<T>, value: T }) {\n if (cid == null || bytes == null || typeof value === 'undefined') { throw new Error('Missing required argument') }\n\n this.cid = cid\n this.bytes = bytes\n this.value = value\n this.asBlock = this\n\n // Mark all the properties immutable\n Object.defineProperties(this, {\n cid: readonly(),\n bytes: readonly(),\n value: readonly(),\n asBlock: readonly()\n })\n }\n\n links (): Iterable<[string, CID<unknown, number, number, API.Version>]> {\n return links(this.value, [])\n }\n\n tree (): Iterable<string> {\n return tree(this.value, [])\n }\n\n get (path = '/'): API.BlockCursorView<unknown> {\n return get(this.value, path.split('/').filter(Boolean))\n }\n}\n\ninterface EncodeInput <T, Code extends number, Alg extends number> {\n value: T\n codec: API.BlockEncoder<Code, T>\n hasher: API.MultihashHasher<Alg>\n}\n\n/**\n * @template T - Logical type of the data encoded in the block\n * @template Code - multicodec code corresponding to codec used to encode the block\n * @template Alg - multicodec code corresponding to the hashing algorithm used in CID creation.\n */\nexport async function encode <T, Code extends number, Alg extends number> ({ value, codec, hasher }: EncodeInput<T, Code, Alg>): Promise<API.BlockView<T, Code, Alg>> {\n if (typeof value === 'undefined') throw new Error('Missing required argument \"value\"')\n if (codec == null || hasher == null) throw new Error('Missing required argument: codec or hasher')\n\n const bytes = codec.encode(value)\n const hash = await hasher.digest(bytes)\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n const cid = CID.create(\n 1,\n codec.code,\n hash\n ) as CID<T, Code, Alg, 1>\n\n return new Block({ value, bytes, cid })\n}\n\ninterface DecodeInput <T, Code extends number, Alg extends number> {\n bytes: API.ByteView<T>\n codec: API.BlockDecoder<Code, T>\n hasher: API.MultihashHasher<Alg>\n}\n\n/**\n * @template T - Logical type of the data encoded in the block\n * @template Code - multicodec code corresponding to codec used to encode the block\n * @template Alg - multicodec code corresponding to the hashing algorithm used in CID creation.\n */\nexport async function decode <T, Code extends number, Alg extends number> ({ bytes, codec, hasher }: DecodeInput<T, Code, Alg>): Promise<API.BlockView<T, Code, Alg>> {\n if (bytes == null) throw new Error('Missing required argument \"bytes\"')\n if (codec == null || hasher == null) throw new Error('Missing required argument: codec or hasher')\n\n const value = codec.decode(bytes)\n const hash = await hasher.digest(bytes)\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-type-assertion\n const cid = CID.create(1, codec.code, hash) as CID<T, Code, Alg, 1>\n\n return new Block({ value, bytes, cid })\n}\n\ntype CreateUnsafeInput <T, Code extends number, Alg extends number, V extends API.Version> = {\n cid: API.Link<T, Code, Alg, V>\n value: T\n codec?: API.BlockDecoder<Code, T>\n bytes: API.ByteView<T>\n} | {\n cid: API.Link<T, Code, Alg, V>\n value?: undefined\n codec: API.BlockDecoder<Code, T>\n bytes: API.ByteView<T>\n}\n\n/**\n * @template T - Logical type of the data encoded in the block\n * @template Code - multicodec code corresponding to codec used to encode the block\n * @template Alg - multicodec code corresponding to the hashing algorithm used in CID creation.\n * @template V - CID version\n */\nexport function createUnsafe <T, Code extends number, Alg extends number, V extends API.Version> ({ bytes, cid, value: maybeValue, codec }: CreateUnsafeInput<T, Code, Alg, V>): API.BlockView<T, Code, Alg, V> {\n const value = maybeValue !== undefined\n ? maybeValue\n : (codec?.decode(bytes))\n\n if (value === undefined) throw new Error('Missing required argument, must either provide \"value\" or \"codec\"')\n\n return new Block({\n cid: cid as CID<T, Code, Alg, V>,\n bytes,\n value\n })\n}\n\ninterface CreateInput <T, Code extends number, Alg extends number, V extends API.Version> {\n bytes: API.ByteView<T>\n cid: API.Link<T, Code, Alg, V>\n hasher: API.MultihashHasher<Alg>\n codec: API.BlockDecoder<Code, T>\n}\n\n/**\n * @template T - Logical type of the data encoded in the block\n * @template Code - multicodec code corresponding to codec used to encode the block\n * @template Alg - multicodec code corresponding to the hashing algorithm used in CID creation.\n * @template V - CID version\n */\nexport async function create <T, Code extends number, Alg extends number, V extends API.Version> ({ bytes, cid, hasher, codec }: CreateInput<T, Code, Alg, V>): Promise<API.BlockView<T, Code, Alg, V>> {\n if (bytes == null) throw new Error('Missing required argument \"bytes\"')\n if (hasher == null) throw new Error('Missing required argument \"hasher\"')\n const value = codec.decode(bytes)\n const hash = await hasher.digest(bytes)\n if (!binary.equals(cid.multihash.bytes, hash.bytes)) {\n throw new Error('CID hash does not match bytes')\n }\n\n return createUnsafe({\n bytes,\n cid,\n value,\n codec\n })\n}\n","// import type { AgentHash } from '../pubsub/pubsub-types'\n// import type { CID } from '@oddjs/odd'\nimport { FormatRegistry, Static, TSchema, Type } from '@sinclair/typebox'\nimport { TypeCompiler } from '@sinclair/typebox/compiler'\nimport { CID } from 'multiformats/cid'\nimport type { PartialBy, Tagged } from '../types/typescript-utils'\n\nexport const Nullable = <T extends TSchema>(schema: T) => Type.Union([schema, Type.Null()])\nexport const EntityID_LENGTH = 7\n// const bagu = 'baguqeerav3h4b46j2pyxikqhtm5si5vhzsyrba2duhrtltfutrlmj42anmvq'\n// const k51q = 'k51qzi5uqu5dhe1bxxjxj144bj2a225o1681yobevns26xlxtsfidjgnpwknfd'\nconst isCID = /^(k51qz|baguq)[0-9a-z]{56,57}$/ // FIXME: k51 is not really a CID, is it?\nconst isShortHash = /^[0-9A-Fa-f]{7,8}$/g // TODO awkward why are some 7 and some 8 long\n// engine level: min 6 (lenient within reason)\n// note3 TBD... either fixed for all entity types VS 7 for pub/sub, 8 for tags, 9 for blocks, 10 for relations etc...\n\nFormatRegistry.Set('EntityID', (value) => !!value.match(isShortHash) || !!value.match(isCID))\nexport const EntityID = Type.String() // HACK how to configure ID format?\n/*{ format: 'EntityID' }*/\nexport type EntityID = Static<typeof EntityID>\n\nexport type AgentHash = Tagged<string, 'AgentHash'>\nexport type DatomPart = string // TODO refactor\nexport type CidString = Tagged<string, CID>\nexport type IpnsString = Tagged<CidString, 'IPNS'>\nexport type AgentID = EntityID\nexport type Attribute = string\nexport type ApplogValue = string | boolean | number | null // TODO: use Tagged types\n// ? allow objects? or just as serialized strings? Or serialize everything anyways?\n\nexport interface Atom {\n\ten: EntityID\n\tat: Attribute\n\tvl: ApplogValue\n}\n\nexport type Timestamp = string\nexport interface Applog extends Atom {\n\tcid: CidString\n\tpv: CidString | null // ? | CID\n\tts: Timestamp\n\tag: AgentHash\n}\nexport type ApplogNoCid = Omit<Applog, 'cid'>\nexport type ApplogOptionalCid = PartialBy<Applog, 'cid'>\nexport type ApplogForInsert = PartialBy<ApplogNoCid, 'ts' | 'pv'>\nexport type ApplogForInsertOptionalAgent = PartialBy<ApplogForInsert, 'ag'>\n\nexport interface ApplogEnc {\n\tcid: CidString\n\tenc: Uint8Array\n\tiv?: Uint8Array // iv may be needed if we prefer a different strategy for transmitting iv (odd appends a random iv to the payload via keystoreAES.(en|de)cryptBytes)\n}\nexport type ApplogEncNoCid = Omit<ApplogEnc, 'cid'>\n\nexport type ApplogArrayMaybeEncrypted = (Applog | ApplogEnc)[]\nexport type ApplogArrayMaybeEncryptedRO = readonly (Applog | ApplogEnc)[]\nexport type ApplogArrayNoCIDMaybeEncryptedRO = readonly (ApplogNoCid | ApplogEncNoCid)[]\n\nexport type ApplogOfSomeSort = Applog | ApplogEnc | ApplogNoCid | ApplogEncNoCid | ApplogForInsert\n\nexport const isEncryptedApplog = (l: ApplogOfSomeSort): l is ApplogEnc => (l as ApplogEnc)?.enc instanceof Uint8Array\n\nexport type AtomPattern = Atom | Applog\n\nexport interface DatalogStateIdentifier {\n\tlastTS: Timestamp\n}\n\n// New generic type for fields that can be a value, an array of that, or a function\nexport type ValueOrMatcher<T> = T | readonly T[] | ReadonlySet<T> | ((value: T) => boolean)\n// Generic type that applies ValueOrMatcher to each field of T\nexport type WithMatchers<T extends Record<string, any>> = {\n\t[K in keyof T & string as `${K}` | `!${K}`]?: ValueOrMatcher<T[K]>\n}\n\nexport type DatalogQueryPattern = Partial<WithMatchers<Applog>>\nexport type DatalogQueryPatternArray = DatalogQueryPattern[]\nexport interface DatalogQuery<SELECT extends string> {\n\tfind: readonly SELECT[] // see: https://github.com/microsoft/TypeScript/issues/20965#issuecomment-868981458\n\twhere: DatalogQueryPatternArray\n\tonlyLatest?: boolean\n}\nexport type DatalogQueryResultEntry<SELECT extends string> = Record<\n\t// SELECT,\n\tStripPrefix<'?', SELECT>,\n\tDatomPart\n>\nexport type DatalogQueryResultRows<SELECT extends string> = DatalogQueryResultEntry<SELECT>[]\n// export type StripTest = StripPrefix<'?', '?A' | '?B'>\n// export type DatalogQueryResultEntryTEST = DatalogQueryResultEntry<'?A' | '?B'>\n// export type DatalogQueryResultEntryTESTX = MapKeysStripPrefix<'?A' | '?B', '?'>\n\nexport interface SearchContext {\n\t[key: string]: ApplogValue\n}\nexport interface SearchContextWithLog {\n\tcontext: SearchContext\n\tapplog?: Applog\n}\n\nexport type ResultContext = SearchContext | null\n\n/* https://stackoverflow.com/a/72497461 */\ntype StripPrefix<\n\tTPrefix extends string,\n\tT extends string,\n> = T extends `${TPrefix}${infer R}` ? R : never\n\ntype MapKeysStripPrefix<SELECT extends string, TPrefix extends string> = {\n\t[K in SELECT as StripPrefix<TPrefix, K>]: DatomPart\n}\n\nFormatRegistry.Set('CID', (value) => !!value.match(isCID))\nexport const CIDTB = Type.String({ format: 'CID' })\nexport type CIDTB = Static<typeof EntityID>\n\nconst isURL = /^http([s]?):\\/\\/.*\\..*/\nFormatRegistry.Set('URL', (value) => !!value.match(isURL))\nexport const URL = Type.String({ format: 'URL' })\nexport type URL = Static<typeof URL>\n\nexport const AppLogNoCidTB = Type.Object({\n\ten: EntityID, // EntityID\n\tat: Type.String(), // Attribute\n\tvl: Nullable(Type.Union([Type.String(), Type.Boolean(), Type.Number()])), // TODO refactor to semantic typesafe ApplogValue\n\tts: Type.String(), // Timestamp\n\tag: Type.String(), // AgentHash\n\tpv: Nullable(CIDTB), // CidString\n})\nexport type AppLogNoCidTB = Static<typeof AppLogNoCidTB> // type T = {\n\nexport const AppLogNoCidTBC = TypeCompiler.Compile(AppLogNoCidTB)\nexport const getApplogNoCidTypeErrors = (obj: any) => Array.from(AppLogNoCidTBC.Errors(obj))\nexport const isValidApplogNoCid = AppLogNoCidTBC.Check.bind(AppLogNoCidTBC) // ? Include CID\n\nexport const AppLogTB = Type.Composite([\n\tType.Object({\n\t\tcid: CIDTB,\n\t}),\n\tAppLogNoCidTB,\n])\nexport type AppLogTB = Static<typeof AppLogTB> // type T = {\n\nexport const AppLogTBC = TypeCompiler.Compile(AppLogTB)\nexport const getApplogTypeErrors = (obj: any) => Array.from(AppLogTBC.Errors(obj))\nexport const isValidApplog = AppLogTBC.Check.bind(AppLogTBC) // ? Include CID\n// maybe useful for defaulting https://github.com/sinclairzx81/typebox#cast\n","import { baseX } from './base.js'\n\nexport const base36 = baseX({\n prefix: 'k',\n name: 'base36',\n alphabet: '0123456789abcdefghijklmnopqrstuvwxyz'\n})\n\nexport const base36upper = baseX({\n prefix: 'K',\n name: 'base36upper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n})\n","/* global crypto */\n\nimport { from } from './hasher.js'\n\nfunction sha (name: AlgorithmIdentifier): (data: Uint8Array) => Promise<Uint8Array> {\n return async data => new Uint8Array(await crypto.subtle.digest(name, data))\n}\n\nexport const sha256 = from({\n name: 'sha2-256',\n code: 0x12,\n encode: sha('SHA-256')\n})\n\nexport const sha512 = from({\n name: 'sha2-512',\n code: 0x13,\n encode: sha('SHA-512')\n})\n","import * as dagJson from '@ipld/dag-json'\nimport { sha256 } from '@noble/hashes/sha256'\nimport { Logger } from 'besonders-logger'\nimport { CID, digest as Digest } from 'multiformats'\nimport { encode as multiformatsEncode } from 'multiformats/block'\n// import { encode } from 'multiformats/block';\nimport { Applog, ApplogEncNoCid, ApplogNoCid, ApplogOfSomeSort, CidString, IpnsString, isEncryptedApplog } from '../applog/datom-types'\n\nimport { base36 } from 'multiformats/bases/base36'\nimport { sha256 as sha265Hasher } from 'multiformats/hashes/sha2'\n\n/* THIS FILE SHOULD NOT DEPEND ON UI STUFF, SO THAT TESTS CAN RUN WITH MINIMAL DEPENDENCIES */\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport const MULTICODEC_IPNS_KEY = 0x72\n\nexport function prepareForPub(log: ApplogOfSomeSort, without: string[] = ['cid']) {\n\tif (!log) throw ERROR('falsy log', log)\n\tlet cid = (log as Applog).cid\n\tif (isEncryptedApplog(log)) {\n\t\tif (!cid) cid = getCidSync(encodeBlock(log as ApplogEncNoCid).bytes).toString()\n\t\tWARN('preparing an encrypted applog - really?')\n\t\treturn { log, cid }\n\t}\n\tconst logWithout = {}\n\tfor (let [key, val] of Object.entries(log)) {\n\t\tif (val === undefined) {\n\t\t\tWARN(`log.${key} is undefined, which is not allowed - encoding as null`, log)\n\t\t\tval = null\n\t\t}\n\t\tif (!without.includes(key)) {\n\t\t\tlogWithout[key] = val // && key === 'pv' ? CID.parse(val) : val //HACK: disabled until clarified: https://discuss.ipfs.tech/t/pin-dag-with-open-ends/17612\n\t\t} else {\n\t\t\tVERBOSE('excluding app log', { key, val })\n\t\t}\n\t}\n\treturn { log: logWithout as Applog, cid }\n}\n\nexport function encodeApplogAndGetCid(log: ApplogNoCid) {\n\treturn getCidSync(encodeApplog(log).bytes)\n}\nexport function encodeApplog(log: ApplogNoCid | ApplogEncNoCid): { bytes: dagJson.ByteView<any>; cid: CID } {\n\treturn encodeBlock(prepareForPub(log)?.log)\n}\n\nexport function getCidSync(bytes: dagJson.ByteView<any>) {\n\t// Hacky way to use a sync sha265 lib to create a CID - code inspired by https://github.com/multiformats/js-multiformats#multihash-hashers\n\tconst hash = sha256(bytes)\n\tconst digest = Digest.create(sha265Hasher.code, hash)\n\tconst cid = CID.create(1, dagJson.code, digest)\n\tVERBOSE(`[getCidSync]`, { bytes, hash, digest, cid })\n\treturn cid\n}\n/** encode the json object into an IPLD block */\nexport function encodeBlock(jsonObject: any): { bytes: dagJson.ByteView<any>; cid: CID } {\n\tDEBUG('[encodeBlock]', jsonObject)\n\tconst byteView = dagJson.encode(jsonObject)\n\treturn { bytes: byteView, cid: getCidSync(byteView) }\n}\n\nexport async function encodeBlockOriginal(jsonObject: any) {\n\t// HACK re-added this to verify the sync variant is sane\n\tconst encoded = await multiformatsEncode({ value: jsonObject, codec: dagJson, hasher: sha265Hasher })\n\tconst syncVariant = encodeBlock(jsonObject)\n\tif (syncVariant.cid.toString() !== encoded.cid.toString()) {\n\t\tERROR(`[encodeBlockOriginal] sync cid mismatch`, { jsonObject, encoded, syncVariant })\n\t}\n\treturn encoded\n}\n\nexport function tryParseCID(cidString: CidString) {\n\tlet cid: CID | null = null\n\tlet errors = []\n\ttry {\n\t\tcid = CID.parse(cidString)\n\t} catch (err) {\n\t\tVERBOSE(`[retrieveThread] couldn't parse pubID with default base`)\n\t\terrors.push(err)\n\t}\n\tif (!cid) {\n\t\ttry {\n\t\t\tcid = CID.parse(cidString, base36) // e.g. for IPNS\n\t\t} catch (err) {\n\t\t\tVERBOSE(`[retrieveThread] couldn't parse pubID with base36`)\n\t\t\terrors.push(err)\n\t\t}\n\t}\n\treturn {\n\t\tcid,\n\t\terrors: cid ? null : errors, // we only care about errors if we failed to parse\n\t\tisIpns: cid && isIpnsKeyCid(cid),\n\t}\n}\nexport function isIpnsKeyCid(cid: CID) {\n\treturn cid.code === MULTICODEC_IPNS_KEY\n}\n\nexport function cidToString(cid: CID) {\n\tif (cid.code == MULTICODEC_IPNS_KEY) {\n\t\treturn toIpnsString(cid)\n\t} else {\n\t\treturn cid.toString()\n\t}\n}\nexport function toIpnsString(cid: CID) {\n\tif (cid.code !== MULTICODEC_IPNS_KEY) throw ERROR(`Not an IPNS cid (${cid.code}):`, cid.toString())\n\treturn cid.toString(base36) as IpnsString\n}\nexport function ensureValidCIDinstance(cidOrStringA: CID | CidString) {\n\treturn typeof cidOrStringA === 'string'\n\t\t? CID.parse(cidOrStringA)\n\t\t: typeof cidOrStringA.toV1 != 'function'\n\t\t? CID.decode(cidOrStringA.bytes)\n\t\t: cidOrStringA\n}\nexport function areCidsEqual(cidOrStringA: CID | CidString, cidOrStringB: CID | CidString) {\n\tif (!cidOrStringA || !cidOrStringB) throw new Error(`[areCidsEqual] invalid params: ${cidOrStringA}, ${cidOrStringB}`)\n\tif (cidOrStringA === cidOrStringB) return true // shortcut if both are strings\n\tconst cidA = ensureValidCIDinstance(cidOrStringA)\n\tconst cidB = ensureValidCIDinstance(cidOrStringB)\n\treturn cidA.toV1().toString() === cidB.toV1().toString()\n}\nexport function containsCid(list: (CID | CidString)[] | Set<CidString>, needle: CID | CidString) {\n\tif (list instanceof Set) return list.has(typeof needle === 'string' ? needle : needle.toV1().toString()) // ? what if the CidString is a different form? (parse and format would cost performance)\n\treturn list.some(cidOrString => areCidsEqual(cidOrString, needle))\n}\n","/**\n * @name toDate\n * @category Common Helpers\n * @summary Convert the given argument to an instance of Date.\n *\n * @description\n * Convert the given argument to an instance of Date.\n *\n * If the argument is an instance of Date, the function returns its clone.\n *\n * If the argument is a number, it is treated as a timestamp.\n *\n * If the argument is none of the above, the function returns Invalid Date.\n *\n * **Note**: *all* Date arguments passed to any *date-fns* function is processed by `toDate`.\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n *\n * @param argument - The value to convert\n *\n * @returns The parsed date in the local time zone\n *\n * @example\n * // Clone the date:\n * const result = toDate(new Date(2014, 1, 11, 11, 30, 30))\n * //=> Tue Feb 11 2014 11:30:30\n *\n * @example\n * // Convert the timestamp to date:\n * const result = toDate(1392098430000)\n * //=> Tue Feb 11 2014 11:30:30\n */\nexport function toDate(argument) {\n const argStr = Object.prototype.toString.call(argument);\n\n // Clone the date\n if (\n argument instanceof Date ||\n (typeof argument === \"object\" && argStr === \"[object Date]\")\n ) {\n // Prevent the date to lose the milliseconds when passed to new Date() in IE10\n return new argument.constructor(+argument);\n } else if (\n typeof argument === \"number\" ||\n argStr === \"[object Number]\" ||\n typeof argument === \"string\" ||\n argStr === \"[object String]\"\n ) {\n // TODO: Can we get rid of as?\n return new Date(argument);\n } else {\n // TODO: Can we get rid of as?\n return new Date(NaN);\n }\n}\n\n// Fallback for modularized imports:\nexport default toDate;\n","import { toDate } from \"./toDate.mjs\";\n\n/**\n * @name isBefore\n * @category Common Helpers\n * @summary Is the first date before the second one?\n *\n * @description\n * Is the first date before the second one?\n *\n * @typeParam DateType - The `Date` type, the function operates on. Gets inferred from passed arguments. Allows to use extensions like [`UTCDate`](https://github.com/date-fns/utc).\n *\n * @param date - The date that should be before the other one to return true\n * @param dateToCompare - The date to compare with\n *\n * @returns The first date is before the second date\n *\n * @example\n * // Is 10 July 1989 before 11 February 1987?\n * const result = isBefore(new Date(1989, 6, 10), new Date(1987, 1, 11))\n * //=> false\n */\nexport function isBefore(date, dateToCompare) {\n const _date = toDate(date);\n const _dateToCompare = toDate(dateToCompare);\n return +_date < +_dateToCompare;\n}\n\n// Fallback for modularized imports:\nexport default isBefore;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\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 */\nfunction 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\nexport default getRawTag;\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 nativeObjectToString = objectProto.toString;\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 */\nfunction objectToString(value) {\n return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\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 */\nfunction 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\nexport default baseGetTag;\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 != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\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) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\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 */\nfunction 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\nexport default arrayMap;\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 */\nvar isArray = Array.isArray;\n\nexport default isArray;\n","import Symbol from './_Symbol.js';\nimport arrayMap from './_arrayMap.js';\nimport isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolToString = symbolProto ? symbolProto.toString : undefined;\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 */\nfunction 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\nexport default baseToString;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\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 */\nfunction trimmedEndIndex(string) {\n var index = string.length;\n\n while (index-- && reWhitespace.test(string.charAt(index))) {}\n return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\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 */\nfunction baseTrim(string) {\n return string\n ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n : string;\n}\n\nexport default baseTrim;\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 != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\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 * 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 = 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\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n MAX_INTEGER = 1.7976931348623157e+308;\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\nexport default toFinite;\n","import toFinite from './toFinite.js';\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\nexport default toInteger;\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 */\nfunction identity(value) {\n return value;\n}\n\nexport default identity;\n","import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n funcTag = '[object Function]',\n genTag = '[object GeneratorFunction]',\n proxyTag = '[object Proxy]';\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 */\nfunction 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\nexport default isFunction;\n","import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n","import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n return uid ? ('Symbol(src)_1.' + uid) : '';\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 */\nfunction isMasked(func) {\n return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\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 */\nfunction 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\nexport default toSource;\n","import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\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 */\nfunction 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\nexport default baseIsNative;\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 */\nfunction getValue(object, key) {\n return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n","import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\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 */\nfunction getNative(object, key) {\n var value = getValue(object, key);\n return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nexport default WeakMap;\n","import WeakMap from './_WeakMap.js';\n\n/** Used to store function metadata. */\nvar metaMap = WeakMap && new WeakMap;\n\nexport default metaMap;\n","import identity from './identity.js';\nimport metaMap from './_metaMap.js';\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 */\nvar baseSetData = !metaMap ? identity : function(func, data) {\n metaMap.set(func, data);\n return func;\n};\n\nexport default baseSetData;\n","import isObject from './isObject.js';\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\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 */\nvar 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\nexport default baseCreate;\n","import baseCreate from './_baseCreate.js';\nimport isObject from './isObject.js';\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 */\nfunction 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\nexport default createCtor;\n","import createCtor from './_createCtor.js';\nimport root from './_root.js';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1;\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 */\nfunction 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\nexport default createBind;\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 */\nfunction 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\nexport default apply;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\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 */\nfunction 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\nexport default composeArgs;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\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 */\nfunction 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\nexport default composeArgsRight;\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 */\nfunction 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\nexport default countHolders;\n","/**\n * The function whose prototype chain sequence wrappers inherit from.\n *\n * @private\n */\nfunction baseLodash() {\n // No operation performed.\n}\n\nexport default baseLodash;\n","import baseCreate from './_baseCreate.js';\nimport baseLodash from './_baseLodash.js';\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295;\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 */\nfunction 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// Ensure `LazyWrapper` is an instance of `baseLodash`.\nLazyWrapper.prototype = baseCreate(baseLodash.prototype);\nLazyWrapper.prototype.constructor = LazyWrapper;\n\nexport default LazyWrapper;\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 */\nfunction noop() {\n // No operation performed.\n}\n\nexport default noop;\n","import metaMap from './_metaMap.js';\nimport noop from './noop.js';\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 */\nvar getData = !metaMap ? noop : function(func) {\n return metaMap.get(func);\n};\n\nexport default getData;\n","/** Used to lookup unminified function names. */\nvar realNames = {};\n\nexport default realNames;\n","import realNames from './_realNames.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default getFuncName;\n","import baseCreate from './_baseCreate.js';\nimport baseLodash from './_baseLodash.js';\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 */\nfunction LodashWrapper(value, chainAll) {\n this.__wrapped__ = value;\n this.__actions__ = [];\n this.__chain__ = !!chainAll;\n this.__index__ = 0;\n this.__values__ = undefined;\n}\n\nLodashWrapper.prototype = baseCreate(baseLodash.prototype);\nLodashWrapper.prototype.constructor = LodashWrapper;\n\nexport default LodashWrapper;\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 */\nfunction 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\nexport default copyArray;\n","import LazyWrapper from './_LazyWrapper.js';\nimport LodashWrapper from './_LodashWrapper.js';\nimport copyArray from './_copyArray.js';\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 */\nfunction 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\nexport default wrapperClone;\n","import LazyWrapper from './_LazyWrapper.js';\nimport LodashWrapper from './_LodashWrapper.js';\nimport baseLodash from './_baseLodash.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\nimport wrapperClone from './_wrapperClone.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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// Ensure wrappers are instances of `baseLodash`.\nlodash.prototype = baseLodash.prototype;\nlodash.prototype.constructor = lodash;\n\nexport default lodash;\n","import LazyWrapper from './_LazyWrapper.js';\nimport getData from './_getData.js';\nimport getFuncName from './_getFuncName.js';\nimport lodash from './wrapperLodash.js';\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 */\nfunction 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\nexport default isLaziable;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\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 */\nfunction 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\nexport default shortOut;\n","import baseSetData from './_baseSetData.js';\nimport shortOut from './_shortOut.js';\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 */\nvar setData = shortOut(baseSetData);\n\nexport default setData;\n","/** Used to match wrap detail comments. */\nvar reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n reSplitDetails = /,? & /;\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 */\nfunction getWrapDetails(source) {\n var match = source.match(reWrapDetails);\n return match ? match[1].split(reSplitDetails) : [];\n}\n\nexport default getWrapDetails;\n","/** Used to match wrap detail comments. */\nvar reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\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 */\nfunction 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\nexport default insertWrapDetails;\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 */\nfunction constant(value) {\n return function() {\n return value;\n };\n}\n\nexport default constant;\n","import getNative from './_getNative.js';\n\nvar defineProperty = (function() {\n try {\n var func = getNative(Object, 'defineProperty');\n func({}, '', {});\n return func;\n } catch (e) {}\n}());\n\nexport default defineProperty;\n","import constant from './constant.js';\nimport defineProperty from './_defineProperty.js';\nimport identity from './identity.js';\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 */\nvar 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\nexport default baseSetToString;\n","import baseSetToString from './_baseSetToString.js';\nimport shortOut from './_shortOut.js';\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 */\nvar setToString = shortOut(baseSetToString);\n\nexport default setToString;\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 */\nfunction 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\nexport default arrayEach;\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\nexport default baseFindIndex;\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\nexport default baseIsNaN;\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 */\nfunction 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\nexport default strictIndexOf;\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIsNaN from './_baseIsNaN.js';\nimport strictIndexOf from './_strictIndexOf.js';\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 return value === value\n ? strictIndexOf(array, value, fromIndex)\n : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nexport default baseIndexOf;\n","import baseIndexOf from './_baseIndexOf.js';\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 */\nfunction arrayIncludes(array, value) {\n var length = array == null ? 0 : array.length;\n return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nexport default arrayIncludes;\n","import arrayEach from './_arrayEach.js';\nimport arrayIncludes from './_arrayIncludes.js';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\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 to associate wrap methods with their bit flags. */\nvar 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/**\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 */\nfunction 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\nexport default updateWrapDetails;\n","import getWrapDetails from './_getWrapDetails.js';\nimport insertWrapDetails from './_insertWrapDetails.js';\nimport setToString from './_setToString.js';\nimport updateWrapDetails from './_updateWrapDetails.js';\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 */\nfunction setWrapToString(wrapper, reference, bitmask) {\n var source = (reference + '');\n return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n}\n\nexport default setWrapToString;\n","import isLaziable from './_isLaziable.js';\nimport setData from './_setData.js';\nimport setWrapToString from './_setWrapToString.js';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64;\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 */\nfunction 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\nexport default createRecurry;\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 */\nfunction getHolder(func) {\n var object = func;\n return object.placeholder;\n}\n\nexport default getHolder;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\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 */\nfunction 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\nexport default isIndex;\n","import copyArray from './_copyArray.js';\nimport isIndex from './_isIndex.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\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 */\nfunction 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\nexport default reorder;\n","/** Used as the internal argument placeholder. */\nvar PLACEHOLDER = '__lodash_placeholder__';\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 */\nfunction 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\nexport default replaceHolders;\n","import composeArgs from './_composeArgs.js';\nimport composeArgsRight from './_composeArgsRight.js';\nimport countHolders from './_countHolders.js';\nimport createCtor from './_createCtor.js';\nimport createRecurry from './_createRecurry.js';\nimport getHolder from './_getHolder.js';\nimport reorder from './_reorder.js';\nimport replaceHolders from './_replaceHolders.js';\nimport root from './_root.js';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_ARY_FLAG = 128,\n WRAP_FLIP_FLAG = 512;\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 */\nfunction 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\nexport default createHybrid;\n","import apply from './_apply.js';\nimport createCtor from './_createCtor.js';\nimport createHybrid from './_createHybrid.js';\nimport createRecurry from './_createRecurry.js';\nimport getHolder from './_getHolder.js';\nimport replaceHolders from './_replaceHolders.js';\nimport root from './_root.js';\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 */\nfunction 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\nexport default createCurry;\n","import apply from './_apply.js';\nimport createCtor from './_createCtor.js';\nimport root from './_root.js';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1;\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 */\nfunction 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\nexport default createPartial;\n","import composeArgs from './_composeArgs.js';\nimport composeArgsRight from './_composeArgsRight.js';\nimport replaceHolders from './_replaceHolders.js';\n\n/** Used as the internal argument placeholder. */\nvar PLACEHOLDER = '__lodash_placeholder__';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_BOUND_FLAG = 4,\n WRAP_CURRY_FLAG = 8,\n WRAP_ARY_FLAG = 128,\n WRAP_REARG_FLAG = 256;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\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 */\nfunction 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\nexport default mergeData;\n","import baseSetData from './_baseSetData.js';\nimport createBind from './_createBind.js';\nimport createCurry from './_createCurry.js';\nimport createHybrid from './_createHybrid.js';\nimport createPartial from './_createPartial.js';\nimport getData from './_getData.js';\nimport mergeData from './_mergeData.js';\nimport setData from './_setData.js';\nimport setWrapToString from './_setWrapToString.js';\nimport toInteger from './toInteger.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_BIND_FLAG = 1,\n WRAP_BIND_KEY_FLAG = 2,\n WRAP_CURRY_FLAG = 8,\n WRAP_CURRY_RIGHT_FLAG = 16,\n WRAP_PARTIAL_FLAG = 32,\n WRAP_PARTIAL_RIGHT_FLAG = 64;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\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 */\nfunction 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\nexport default createWrap;\n","import defineProperty from './_defineProperty.js';\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 */\nfunction 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\nexport default baseAssignValue;\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 */\nfunction eq(value, other) {\n return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n","import baseAssignValue from './_baseAssignValue.js';\nimport eq from './eq.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default assignValue;\n","import apply from './_apply.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\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 */\nfunction 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\nexport default overRest;\n","import identity from './identity.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\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 */\nfunction baseRest(func, start) {\n return setToString(overRest(func, start, identity), func + '');\n}\n\nexport default baseRest;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\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 */\nfunction isLength(value) {\n return typeof value == 'number' &&\n value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n","import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\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 */\nfunction isArrayLike(value) {\n return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\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 */\nfunction isPrototype(value) {\n var Ctor = value && value.constructor,\n proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n return value === proto;\n}\n\nexport default isPrototype;\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 */\nfunction 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\nexport default baseTimes;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\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 */\nfunction baseIsArguments(value) {\n return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nexport default baseIsArguments;\n","import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\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 */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\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 */\nfunction stubFalse() {\n return false;\n}\n\nexport default stubFalse;\n","import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\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 */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n","import baseGetTag from './_baseGetTag.js';\nimport isLength from './isLength.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n funcTag = '[object Function]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n objectTag = '[object Object]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n weakMapTag = '[object WeakMap]';\n\nvar 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 identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\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 */\nfunction baseIsTypedArray(value) {\n return isObjectLike(value) &&\n isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nexport default baseIsTypedArray;\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 */\nfunction baseUnary(func) {\n return function(value) {\n return func(value);\n };\n}\n\nexport default baseUnary;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar 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\nexport default nodeUtil;\n","import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\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 */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n","import baseTimes from './_baseTimes.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isIndex from './_isIndex.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default arrayLikeKeys;\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 */\nfunction overArg(func, transform) {\n return function(arg) {\n return func(transform(arg));\n };\n}\n\nexport default overArg;\n","import overArg from './_overArg.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nexport default nativeKeys;\n","import isPrototype from './_isPrototype.js';\nimport nativeKeys from './_nativeKeys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default baseKeys;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\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 */\nfunction keys(object) {\n return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n","import isArray from './isArray.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n reIsPlainProp = /^\\w*$/;\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 */\nfunction 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\nexport default isKey;\n","import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n this.__data__ = nativeCreate ? nativeCreate(null) : {};\n this.size = 0;\n}\n\nexport default hashClear;\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 */\nfunction hashDelete(key) {\n var result = this.has(key) && delete this.__data__[key];\n this.size -= result ? 1 : 0;\n return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction hashHas(key) {\n var data = this.__data__;\n return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\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 */\nfunction 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\nexport default hashSet;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction 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// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n this.__data__ = [];\n this.size = 0;\n}\n\nexport default listCacheClear;\n","import eq from './eq.js';\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 */\nfunction 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\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\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 */\nfunction 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\nexport default listCacheDelete;\n","import assocIndexOf from './_assocIndexOf.js';\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 */\nfunction listCacheGet(key) {\n var data = this.__data__,\n index = assocIndexOf(data, key);\n\n return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\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 */\nfunction listCacheHas(key) {\n return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\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 */\nfunction 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\nexport default listCacheSet;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction 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// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n this.size = 0;\n this.__data__ = {\n 'hash': new Hash,\n 'map': new (Map || ListCache),\n 'string': new Hash\n };\n}\n\nexport default mapCacheClear;\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 */\nfunction 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\nexport default isKeyable;\n","import isKeyable from './_isKeyable.js';\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 */\nfunction getMapData(map, key) {\n var data = map.__data__;\n return isKeyable(key)\n ? data[typeof key == 'string' ? 'string' : 'hash']\n : data.map;\n}\n\nexport default getMapData;\n","import getMapData from './_getMapData.js';\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 */\nfunction mapCacheDelete(key) {\n var result = getMapData(this, key)['delete'](key);\n this.size -= result ? 1 : 0;\n return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\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 */\nfunction mapCacheGet(key) {\n return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\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 */\nfunction mapCacheHas(key) {\n return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\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 */\nfunction 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\nexport default mapCacheSet;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\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 */\nfunction 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// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n","import MapCache from './_MapCache.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\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 */\nfunction 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`.\nmemoize.Cache = MapCache;\n\nexport default memoize;\n","import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\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 */\nfunction 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\nexport default memoizeCapped;\n","import memoizeCapped from './_memoizeCapped.js';\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\$\\\$?/g;\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 */\nvar 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\nexport default stringToPath;\n","import baseToString from './_baseToString.js';\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 */\nfunction toString(value) {\n return value == null ? '' : baseToString(value);\n}\n\nexport default toString;\n","import isArray from './isArray.js';\nimport isKey from './_isKey.js';\nimport stringToPath from './_stringToPath.js';\nimport toString from './toString.js';\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 */\nfunction castPath(value, object) {\n if (isArray(value)) {\n return value;\n }\n return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nexport default castPath;\n","import isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\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 */\nfunction 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\nexport default toKey;\n","import castPath from './_castPath.js';\nimport toKey from './_toKey.js';\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 */\nfunction 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\nexport default baseGet;\n","import baseGet from './_baseGet.js';\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 */\nfunction get(object, path, defaultValue) {\n var result = object == null ? undefined : baseGet(object, path);\n return result === undefined ? defaultValue : result;\n}\n\nexport default get;\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 */\nfunction 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\nexport default arrayPush;\n","import Symbol from './_Symbol.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\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 */\nfunction isFlattenable(value) {\n return isArray(value) || isArguments(value) ||\n !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nexport default isFlattenable;\n","import arrayPush from './_arrayPush.js';\nimport isFlattenable from './_isFlattenable.js';\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 */\nfunction 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\nexport default baseFlatten;\n","import baseFlatten from './_baseFlatten.js';\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 */\nfunction flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import flatten from './flatten.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\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 */\nfunction flatRest(func) {\n return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nexport default flatRest;\n","import ListCache from './_ListCache.js';\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n this.__data__ = new ListCache;\n this.size = 0;\n}\n\nexport default stackClear;\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 */\nfunction stackDelete(key) {\n var data = this.__data__,\n result = data['delete'](key);\n\n this.size = data.size;\n return result;\n}\n\nexport default stackDelete;\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 */\nfunction stackGet(key) {\n return this.__data__.get(key);\n}\n\nexport default stackGet;\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 */\nfunction stackHas(key) {\n return this.__data__.has(key);\n}\n\nexport default stackHas;\n","import ListCache from './_ListCache.js';\nimport Map from './_Map.js';\nimport MapCache from './_MapCache.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\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 */\nfunction 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\nexport default stackSet;\n","import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\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 */\nfunction Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\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 */\nfunction 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\nexport default arrayFilter;\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 */\nfunction stubArray() {\n return [];\n}\n\nexport default stubArray;\n","import arrayFilter from './_arrayFilter.js';\nimport stubArray from './stubArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\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 */\nvar 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\nexport default getSymbols;\n","import arrayPush from './_arrayPush.js';\nimport isArray from './isArray.js';\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 */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n var result = keysFunc(object);\n return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nexport default baseGetAllKeys;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbols from './_getSymbols.js';\nimport keys from './keys.js';\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 */\nfunction getAllKeys(object) {\n return baseGetAllKeys(object, keys, getSymbols);\n}\n\nexport default getAllKeys;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nexport default DataView;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nexport default Promise;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nexport default Set;\n","import DataView from './_DataView.js';\nimport Map from './_Map.js';\nimport Promise from './_Promise.js';\nimport Set from './_Set.js';\nimport WeakMap from './_WeakMap.js';\nimport baseGetTag from './_baseGetTag.js';\nimport toSource from './_toSource.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n objectTag = '[object Object]',\n promiseTag = '[object Promise]',\n setTag = '[object Set]',\n weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n mapCtorString = toSource(Map),\n promiseCtorString = toSource(Promise),\n setCtorString = toSource(Set),\n weakMapCtorString = toSource(WeakMap);\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 */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((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\nexport default getTag;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nexport default Uint8Array;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\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 */\nfunction setCacheAdd(value) {\n this.__data__.set(value, HASH_UNDEFINED);\n return this;\n}\n\nexport default setCacheAdd;\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 */\nfunction setCacheHas(value) {\n return this.__data__.has(value);\n}\n\nexport default setCacheHas;\n","import MapCache from './_MapCache.js';\nimport setCacheAdd from './_setCacheAdd.js';\nimport setCacheHas from './_setCacheHas.js';\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 */\nfunction 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// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nexport default SetCache;\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 */\nfunction 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\nexport default arraySome;\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 */\nfunction cacheHas(cache, key) {\n return cache.has(key);\n}\n\nexport default cacheHas;\n","import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\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 */\nfunction 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\nexport default equalArrays;\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 */\nfunction 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\nexport default mapToArray;\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 */\nfunction 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\nexport default setToArray;\n","import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n dateTag = '[object Date]',\n errorTag = '[object Error]',\n mapTag = '[object Map]',\n numberTag = '[object Number]',\n regexpTag = '[object RegExp]',\n setTag = '[object Set]',\n stringTag = '[object String]',\n symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\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 */\nfunction 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\nexport default equalByTag;\n","import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default equalObjects;\n","import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n arrayTag = '[object Array]',\n objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\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 */\nfunction 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\nexport default baseIsEqualDeep;\n","import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\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 */\nfunction 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\nexport default baseIsEqual;\n","import Stack from './_Stack.js';\nimport baseIsEqual from './_baseIsEqual.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\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 */\nfunction 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\nexport default baseIsMatch;\n","import isObject from './isObject.js';\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 */\nfunction isStrictComparable(value) {\n return value === value && !isObject(value);\n}\n\nexport default isStrictComparable;\n","import isStrictComparable from './_isStrictComparable.js';\nimport keys from './keys.js';\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 */\nfunction 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\nexport default getMatchData;\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 */\nfunction 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\nexport default matchesStrictComparable;\n","import baseIsMatch from './_baseIsMatch.js';\nimport getMatchData from './_getMatchData.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\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 */\nfunction 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\nexport default baseMatches;\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 */\nfunction baseHasIn(object, key) {\n return object != null && key in Object(object);\n}\n\nexport default baseHasIn;\n","import castPath from './_castPath.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isIndex from './_isIndex.js';\nimport isLength from './isLength.js';\nimport toKey from './_toKey.js';\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 */\nfunction 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\nexport default hasPath;\n","import baseHasIn from './_baseHasIn.js';\nimport hasPath from './_hasPath.js';\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 */\nfunction hasIn(object, path) {\n return object != null && hasPath(object, path, baseHasIn);\n}\n\nexport default hasIn;\n","import baseIsEqual from './_baseIsEqual.js';\nimport get from './get.js';\nimport hasIn from './hasIn.js';\nimport isKey from './_isKey.js';\nimport isStrictComparable from './_isStrictComparable.js';\nimport matchesStrictComparable from './_matchesStrictComparable.js';\nimport toKey from './_toKey.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n COMPARE_UNORDERED_FLAG = 2;\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 */\nfunction 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\nexport default baseMatchesProperty;\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 */\nfunction baseProperty(key) {\n return function(object) {\n return object == null ? undefined : object[key];\n };\n}\n\nexport default baseProperty;\n","import baseGet from './_baseGet.js';\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 */\nfunction basePropertyDeep(path) {\n return function(object) {\n return baseGet(object, path);\n };\n}\n\nexport default basePropertyDeep;\n","import baseProperty from './_baseProperty.js';\nimport basePropertyDeep from './_basePropertyDeep.js';\nimport isKey from './_isKey.js';\nimport toKey from './_toKey.js';\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 */\nfunction property(path) {\n return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nexport default property;\n","import baseMatches from './_baseMatches.js';\nimport baseMatchesProperty from './_baseMatchesProperty.js';\nimport identity from './identity.js';\nimport isArray from './isArray.js';\nimport property from './property.js';\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 */\nfunction 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\nexport default baseIteratee;\n","import root from './_root.js';\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 */\nvar now = function() {\n return root.Date.now();\n};\n\nexport default now;\n","import isObject from './isObject.js';\nimport now from './now.js';\nimport toNumber from './toNumber.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n nativeMin = Math.min;\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 */\nfunction 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\nexport default debounce;\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 */\nfunction 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\nexport default arrayIncludesWith;\n","import assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\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 */\nfunction 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\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\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 */\nfunction 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\nexport default basePickBy;\n","import baseRest from './_baseRest.js';\nimport createWrap from './_createWrap.js';\nimport getHolder from './_getHolder.js';\nimport replaceHolders from './_replaceHolders.js';\n\n/** Used to compose bitmasks for function metadata. */\nvar WRAP_PARTIAL_FLAG = 32;\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 */\nvar 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// Assign default placeholders.\npartial.placeholder = {};\n\nexport default partial;\n","import basePickBy from './_basePickBy.js';\nimport hasIn from './hasIn.js';\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 */\nfunction basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n}\n\nexport default basePick;\n","import basePick from './_basePick.js';\nimport flatRest from './_flatRest.js';\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 */\nvar pick = flatRest(function(object, paths) {\n return object == null ? {} : basePick(object, paths);\n});\n\nexport default pick;\n","import isSymbol from './isSymbol.js';\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295,\n MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeFloor = Math.floor,\n nativeMin = Math.min;\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 */\nfunction 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\nexport default baseSortedIndexBy;\n","import baseIteratee from './_baseIteratee.js';\nimport baseSortedIndexBy from './_baseSortedIndexBy.js';\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 */\nfunction sortedIndexBy(array, value, iteratee) {\n return baseSortedIndexBy(array, value, baseIteratee(iteratee, 2));\n}\n\nexport default sortedIndexBy;\n","import Set from './_Set.js';\nimport noop from './noop.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\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 */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n return new Set(values);\n};\n\nexport default createSet;\n","import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport cacheHas from './_cacheHas.js';\nimport createSet from './_createSet.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\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 */\nfunction 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\nexport default baseUniq;\n","import baseUniq from './_baseUniq.js';\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 */\nfunction uniqWith(array, comparator) {\n comparator = typeof comparator == 'function' ? comparator : undefined;\n return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n}\n\nexport default uniqWith;\n","import { Logger } from 'besonders-logger'\nimport { isBefore } from 'date-fns'\nimport { partial, pick } from 'lodash-es'\nimport { comparer } from 'mobx'\nimport stringify from 'safe-stable-stringify'\nimport type {\n\tApplog,\n\tApplogForInsert,\n\tApplogValue,\n\tDatalogQueryPattern,\n\tDatalogQueryResultEntry,\n\tResultContext,\n\tSearchContext,\n\tValueOrMatcher,\n} from './datom-types'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport const isoDateStrCompare = (strA: string, strB: string, dir: 'asc' | 'desc' = 'asc') =>\n\tdir === 'asc'\n\t\t? strA.localeCompare(strB, 'en-US')\n\t\t: strB.localeCompare(strA, 'en-US')\nexport const objEqualByKeys = (keys: string[], objA: object, objB: object) => {\n\treturn comparer.structural(pick(objA, keys), pick(objB, keys))\n}\n\nexport const compareApplogsByTs = (logA: Applog, logB: Applog, dir: 'asc' | 'desc' = 'asc') => isoDateStrCompare(logA.ts, logB.ts, dir)\nexport const compareApplogsByEnAt = partial(objEqualByKeys, ['en', 'at'])\n\n/** Sort by TS (modifies the array, but also returns for ease of use) */\nexport function sortApplogsByTs(appLogArray: Applog[], dir: 'asc' | 'desc' = 'asc') {\n\treturn appLogArray.sort((a, b) => compareApplogsByTs(a, b, dir))\n}\nexport const isTsBefore = (log: Applog, logToCompare: Applog) => isBefore(new Date(log.ts), new Date(logToCompare.ts))\nexport const uniqueEnFromAppLogs = (appLogArray: Applog[]) => [...new Set(appLogArray.map(eachLog => eachLog.en))]\nexport const areApplogsEqual = (logA: Applog, logB: Applog) => comparer.structural(logA, logB)\n\nexport const removeDuplicateAppLogs = (appLogArray: Applog[]) => {\n\tconst logMap = new Map<string, Applog>()\n\tfor (const eachLog of appLogArray) {\n\t\tif (!eachLog) {\n\t\t\tERROR(`falsy entry in applogs`, appLogArray)\n\t\t\tthrow new Error(`falsy entry in applogs`)\n\t\t}\n\t\tconst key = eachLog.cid // stringify(eachLog)\n\t\tif (logMap.has(key)) {\n\t\t\tVERBOSE(`Skipping duplicate applog:`, [logMap.get(key), eachLog])\n\t\t} else {\n\t\t\tlogMap.set(key, eachLog)\n\t\t}\n\t}\n\treturn Array.from(logMap.values())\n}\n\n// export const removeDuplicateAndMaybeDeletedAppLogs = (ds: Thread, appLogArray: Applog[], removeDeletedEntities = true) => {\n// \tconst logMap = new Map()\n// \tfor (const eachLog of appLogArray) {\n// \t\tif (!removeDeletedEntities || ds.entityIsDeleted(eachLog.en))\n// \t\t\tlogMap.set(stringify(eachLog), eachLog)\n// \t}\n// \treturn Array.from(logMap.values())\n// }\n\nexport const getHashID = (stringifiable: any, lngth = 8) => cyrb53hash(stringify(stringifiable), 31, lngth) as string\n\nexport function isVariable(x: any): x is string {\n\treturn typeof x === 'string' && x.startsWith('?')\n}\nexport function variableNameWithoutQuestionmark(str: string) {\n\treturn str.slice(1)\n}\n// export function isMatcher(x: any): x is string {\n// \treturn\n// }\nexport function isStaticPattern(x: any): x is ApplogValue {\n\tif (!['string', 'boolean', 'number', 'function'].includes(typeof x)) WARN(`Unhandled pattern value type:`, typeof x, x)\n\treturn !isVariable(x) && ['string', 'boolean', 'number'].includes(typeof x)\n}\n// export function isIgnorePattern(x: any): boolean {\n// \treturn x === '_'\n// }\n\n/*\n * In a pattern from a Query:\n * - variables that don't have a value in the search context:\n * - remove from pattern\n * - add to variableToFill as: { en: 'movieID' } (useful for mapTo)\n * - variables that have a value set:\n * - replace placeholder with actual value\n */\nexport function resolveOrRemoveVariables(pattern: DatalogQueryPattern, candidate: SearchContext) {\n\tlet variablesToFill = {} as Partial<{ [key in keyof Applog]: string }>\n\tconst newPattern: DatalogQueryPattern = {}\n\tfor (const [patternKey, patternValue] of Object.entries(pattern)) {\n\t\tif (isVariable(patternValue)) {\n\t\t\tconst varName = variableNameWithoutQuestionmark(patternValue)\n\t\t\tconst candidateValue = candidate[varName]\n\t\t\tif (candidateValue) {\n\t\t\t\tnewPattern[patternKey] = candidateValue\n\t\t\t\t// & not adding it to newPattern\n\t\t\t} else {\n\t\t\t\tvariablesToFill[patternKey] = varName\n\t\t\t}\n\t\t} else {\n\t\t\tnewPattern[patternKey] = patternValue // keep static value\n\t\t}\n\t}\n\n\treturn [newPattern, variablesToFill] as const\n}\n\nfunction matchVariable(variable: string, triplePart: ApplogValue, context: SearchContext): SearchContext {\n\tif (context.hasOwnProperty(variable)) {\n\t\t// TODO: fix lint error with: if (Object.hasOwnProperty.call(context, variable)) {\n\t\tconst bound = context[variable]\n\t\tconst match = matchPart(bound, triplePart, context)\n\t\t// if (VERBOSE.isEnabled) VERBOSE('[matchVariable] match?', variable, bound, match)\n\t\treturn match\n\t}\n\t// if (VERBOSE.isEnabled) VERBOSE('[matchVariable] initializing variable', variable, 'to', triplePart)\n\treturn { ...context, [variable]: triplePart }\n}\n\nexport function matchPartStatic(field: keyof Applog, patternPart: ValueOrMatcher<ApplogValue>, atomPart: ApplogValue): boolean {\n\t// if (VERBOSE.isEnabled) VERBOSE('[matchPartStatic]', field, patternPart, patternPart === atomPart ? '===' : '!==', atomPart)\n\tlet result\n\tif (patternPart) {\n\t\tconst typ = typeof patternPart\n\t\tif (typ === 'string') {\n\t\t\tresult = patternPart === atomPart // shortcut for most common use-case\n\t\t} else if (typ === 'function') {\n\t\t\tresult = (patternPart as Function)(atomPart)\n\t\t} else if (typeof (patternPart as any).has === 'function') {\n\t\t\tresult = (patternPart as Set<any>).has(atomPart)\n\t\t} else if (Array.isArray(patternPart) && !Array.isArray(atomPart) /* ? how to handle array values */) {\n\t\t\tresult = patternPart.includes(atomPart)\n\t\t} // if (field === 'at' && typ === 'string' && patternPart.endsWith('*')) {\n\t\t// \treturn typeof atomPart === 'string' && atomPart.startsWith(patternPart.slice(0, -1))\n\t\t// }\n\t\telse {\n\t\t\tresult = patternPart === atomPart\n\t\t}\n\t} else {\n\t\tresult = patternPart === atomPart\n\t}\n\n\t// if (VERBOSE.isEnabled) VERBOSE('[matchPartStatic] =>', field.startsWith('!') ? '!' : '', result)\n\tif (field.charAt(0) === '!') {\n\t\treturn !result\n\t} else {\n\t\treturn result\n\t}\n}\nexport function matchPart(patternPart: ValueOrMatcher<ApplogValue>, atomPart: ApplogValue, context: SearchContext): ResultContext {\n\tif (!context) {\n\t\t// if (VERBOSE.isEnabled) VERBOSE('[matchPart] no context')\n\t\treturn null\n\t}\n\tif (typeof patternPart === 'string') {\n\t\tif (isVariable(patternPart)) {\n\t\t\treturn matchVariable(patternPart, atomPart, context)\n\t\t} /* TODO: else if (isIgnorePattern(patternPart)) {\n\t\t\treturn matchVariable(patternPart, atomPart, context)\n\t\t} */\n\t}\n\t// if (VERBOSE.isEnabled) VERBOSE('[matchPart]', patternPart, patternPart === atomPart ? '===' : '!==', atomPart)\n\tif (typeof patternPart === 'function') {\n\t\treturn patternPart(atomPart) ? context : null\n\t}\n\treturn patternPart === atomPart ? context : null\n}\n\n/**\n * Check if pattern matches triple with context substitutions\n */\nexport function matchPattern(pattern: DatalogQueryPattern, applog: Applog, context: SearchContext): ResultContext {\n\treturn Object.entries(pattern).reduce((context, [field, patternValue]) => {\n\t\tconst applogValue = applog[field]\n\t\t// @ts-expect-error wtf no idea //HACK: ts weird\n\t\tconst patternValT: ValueOrMatcher<ApplogValue> = patternValue\n\t\treturn matchPart(patternValT, applogValue, context)\n\t}, context)\n}\n\nexport function actualize<SELECT extends string>(context: ResultContext, find: readonly SELECT[]): DatalogQueryResultEntry<SELECT> {\n\treturn Object.fromEntries(find.map((findField) => {\n\t\tif (context === null) {\n\t\t\tthrow new Error(`actualize context is null ${find}`)\n\t\t}\n\t\treturn [\n\t\t\tisVariable(findField) ? findField.replace(/^\\?/, '') : findField,\n\t\t\tisVariable(findField) ? context[findField] : findField,\n\t\t]\n\t})) as DatalogQueryResultEntry<SELECT>\n}\nconst sum = function sum(array: number[]) {\n\tvar num = 0\n\tfor (var i = 0, l = array.length; i < l; i++) num += array[i]\n\treturn num\n}\nconst mean = function mean(array: number[]) {\n\treturn sum(array) / array.length\n}\nexport const arrStats = {\n\tmax: function(array: number[]) {\n\t\treturn Math.max.apply(null, array)\n\t},\n\n\tmin: function(array: number[]) {\n\t\treturn Math.min.apply(null, array)\n\t},\n\n\trange: function(array: number[]) {\n\t\treturn arrStats.max(array) - arrStats.min(array)\n\t},\n\n\tmidrange: function(array: number[]) {\n\t\treturn arrStats.range(array) / 2\n\t},\n\n\tsum,\n\n\tmean,\n\n\taverage: mean,\n\n\tmedian: function(array: number[]) {\n\t\tarray.sort(function(a, b) {\n\t\t\treturn a - b\n\t\t})\n\t\tvar mid = array.length / 2\n\t\treturn mid % 1 ? array[mid - 0.5] : (array[mid - 1] + array[mid]) / 2\n\t},\n\n\tmodes: function(array: number[]) {\n\t\tif (!array.length) return []\n\t\tvar modeMap = {},\n\t\t\tmaxCount = 0,\n\t\t\tmodes = []\n\n\t\tarray.forEach(function(val) {\n\t\t\tif (!modeMap[val]) modeMap[val] = 1\n\t\t\telse modeMap[val]++\n\n\t\t\tif (modeMap[val] > maxCount) {\n\t\t\t\tmodes = [val]\n\t\t\t\tmaxCount = modeMap[val]\n\t\t\t} else if (modeMap[val] === maxCount) {\n\t\t\t\tmodes.push(val)\n\t\t\t\tmaxCount = modeMap[val]\n\t\t\t}\n\t\t})\n\t\treturn modes\n\t},\n\n\tvariance: function(array: number[]) {\n\t\tvar mean = arrStats.mean(array)\n\t\treturn arrStats.mean(array.map(function(num) {\n\t\t\treturn Math.pow(num - mean, 2)\n\t\t}))\n\t},\n\n\tstandardDeviation: function(array: number[]) {\n\t\treturn Math.sqrt(arrStats.variance(array))\n\t},\n\n\tmeanAbsoluteDeviation: function(array: number[]) {\n\t\tvar mean = arrStats.mean(array)\n\t\treturn arrStats.mean(array.map(function(num) {\n\t\t\treturn Math.abs(num - mean)\n\t\t}))\n\t},\n\n\tzScores: function(array: number[]) {\n\t\tvar mean = arrStats.mean(array)\n\t\tvar standardDeviation = arrStats.standardDeviation(array)\n\t\treturn array.map(function(num) {\n\t\t\treturn (num - mean) / standardDeviation\n\t\t})\n\t},\n}\n\n// Function aliases:\narrStats.average = arrStats.mean\n\nexport const tsNearlySame = (timeA: string, timeB: string) => timeB.startsWith(timeA.slice(0, timeA.length - 4)) // HACK: to quickly check if same second\n\n/*\n\t\t\t\tcyrb53 (c) 2018 bryc (github.com/bryc)\n\t\t\t\tA fast and simple hash function with decent collision resistance.\n\t\t\t\tLargely inspired by MurmurHash2/3, but with a focus on speed/simplicity.\n\t\t\t\tPublic domain. Attribution appreciated.\n\n\tripped from https://github.com/bryc/code/blob/mast`er/jshash/experimental/cyrb53.js\n*/\nexport const cyrb53hash = function(\n\tstr: string,\n\tseed = 13,\n\tstrLength: number, /* = 0 */\n) {\n\tif (!str?.length) {\n\t\tthrow new Error(`Empty string: ${str}`)\n\t}\n\n\tlet h1 = 0xdeadbeef ^ seed\n\tlet h2 = 0x41c6ce57 ^ seed\n\tfor (let i = 0, ch; i < str.length; i++) {\n\t\tch = str.charCodeAt(i)\n\t\th1 = Math.imul(h1 ^ ch, 2654435761)\n\t\th2 = Math.imul(h2 ^ ch, 1597334677)\n\t}\n\th1 = Math.imul(h1 ^ (h1 >>> 16), 2246822507) ^ Math.imul(h2 ^ (h2 >>> 13), 3266489909)\n\th2 = Math.imul(h2 ^ (h2 >>> 16), 2246822507) ^ Math.imul(h1 ^ (h1 >>> 13), 3266489909)\n\t// if (strLength) {\n\tconst asHex = (4294967296 * (2097151 & h2) + (h1 >>> 0)).toString(16)\n\treturn asHex.slice(-strLength).padStart(strLength, '0')\n\t// }\n\t// // if not specified return as 16 digit integer\n\t// return 4294967296 * (2097151 & h2) + (h1 >>> 0)\n}\nexport function arraysContainSameElements(arr1, arr2) {\n\tif (arr1.length !== arr2.length) {\n\t\treturn false\n\t}\n\n\tconst sortedArr1 = [...arr1].sort()\n\tconst sortedArr2 = [...arr2].sort()\n\n\tfor (let i = 0; i < sortedArr1.length; i++) {\n\t\tif (sortedArr1[i] !== sortedArr2[i]) {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\nexport function dateNowIso(): string {\n\tconst now = new Date()\n\treturn now.toISOString()\n}\n","import { Logger } from 'besonders-logger'\nimport { action, untracked } from 'mobx'\nimport { encodeApplogAndGetCid } from '../ipfs/ipfs-utils'\nimport { lastWriteWins } from '../query/basic'\nimport { ApplogEventMapper, isInitEvent, MappedThread, rollingFilter, Thread, ThreadOnlyCurrent } from '../thread'\nimport { PartialBy } from '../types/typescript-utils'\nimport { dateNowIso, objEqualByKeys, removeDuplicateAppLogs, sortApplogsByTs } from './applog-utils'\nimport {\n\tApplog,\n\tApplogForInsert,\n\tApplogForInsertOptionalAgent,\n\tApplogNoCid,\n\tgetApplogTypeErrors,\n\tisValidApplog,\n\tTimestamp,\n} from './datom-types'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport function ensureTsPvAndFinalizeApplogs(appLogsToInsert: ApplogForInsert[], threadForPv: Thread) {\n\tconst ts = dateNowIso()\n\t// const currentThread = lastWriteWins(threadForPv, { tolerateAlreadyFiltered: true }) // HACK to get `pv` from last write\n\tconst currentThread = threadForPv // HACK to not do un-cached lastWriteWins\n\n\tconst mapped = appLogsToInsert.map(log => {\n\t\treturn finalizeApplogForInsert(log, { ts, threadForPv: currentThread })\n\t})\n\treturn mapped\n}\nexport function ensureTsPvAndFinalizeApplog(applogToInsert: ApplogForInsert, threadForPv: Thread) {\n\treturn ensureTsPvAndFinalizeApplogs([applogToInsert], threadForPv)[0]\n}\n\nexport function finalizeApplogForInsert(\n\tlog: ApplogForInsert,\n\t{ ts, threadForPv }: { ts?: string; threadForPv?: Thread /*OnlyCurrent*/ } = {},\n) {\n\tconst logWithTs = withTs(log, ts ?? dateNowIso())\n\tconst logWithPv = withPvFrom(logWithTs, threadForPv)\n\tconst cid = encodeApplogAndGetCid(logWithPv).toString()\n\tif ((log as Applog).cid && (log as Applog).cid !== cid) WARN(`[finalizeApplogForInsert] overwriting wrong CID`, { log, cid, logWithPv })\n\tconst logWithCid = { ...logWithPv, cid } satisfies Applog\n\tif (!isValidApplog(logWithCid)) {\n\t\tthrow ERROR(`Bogus Applog ${JSON.stringify(logWithCid)}`, getApplogTypeErrors(logWithCid))\n\t}\n\treturn Object.freeze(logWithCid)\n}\n\nexport function hasAg(log: ApplogForInsertOptionalAgent): log is ApplogForInsert {\n\treturn !!log.ag\n}\nexport function hasTs(log: ApplogForInsert): log is Omit<ApplogForInsert, 'ts'> & { ts: Timestamp } {\n\treturn !!log.ts\n}\nexport function hasPv(log: ApplogForInsert): log is ApplogForInsert & { pv: string } {\n\treturn !!log.pv\n}\n\nexport function withTs(log: ApplogForInsert, ts: Timestamp) {\n\treturn hasTs(log) ? log : { ...log, ts }\n}\nexport function withPvFrom(log: PartialBy<ApplogNoCid, 'pv'>, thread: Thread /*OnlyCurrent*/ | null) {\n\tif (log.pv !== undefined) return log as ApplogNoCid // TODO: ? devMode WARN if it's different for catching bugs)\n\tif (!thread) {\n\t\tif (!hasPv(log)) throw ERROR(`[withPvFrom] no thread and no pv:`, log)\n\t\treturn log // satisfies Pick<Applog, 'pv'>\n\t} else {\n\t\tconst { en, at } = log\n\t\tconst prevLog = thread.findLast(l => l.en == en && l.at == at) // HACK to not do lastWriteWins calc\n\t\t// const prevLogs = rollingFilter(thread, { en, at }) // ? use some non-reactive filter here?\n\t\t// if (prevLogs.size > 1) throw ERROR(`[withPvFrom] unexpected previous count:`, prevLogs.size, { log, prevLogs, thread }) // `thread` arg must be only current\n\t\t// let prevLog = prevLogs.isEmpty ? null : prevLogs.applogs[0]\n\t\t// const isMatchingPv = prevLog?.cid === log.pv\n\t\tif (objEqualByKeys(['en', 'at', 'vl', 'ts', 'ag'], log, prevLog)) {\n\t\t\tthrow ERROR(`[withPvFrom] Same as previous:`, { log, pv: prevLog, thread }) // bug catcher\n\t\t}\n\t\t// if (log.pv && !isMatchingPv) { // ineffective bc. shortcut in the beginning of this func\n\t\t// \tWARN(`[withPvFrom] different than pre-set pv:`, { queriedPv: prevLog, logPv: log.pv })\n\t\t// }\n\t\tconst prevLogCid = (log.pv !== undefined ? log.pv : prevLog?.cid) ?? null\n\t\treturn { ...log, pv: prevLogCid }\n\t}\n}\nexport function joinThreads(threads: ReadonlyArray<Thread>) {\n\tconst fullJoin = () => {\n\t\tuntracked(() => (threads.length < 2) && DEBUG(`joinThreads with count=${threads.length}`)) // ? EmptyThread\n\t\treturn sortApplogsByTs(\n\t\t\tremoveDuplicateAppLogs(threads.flatMap(s => {\n\t\t\t\tconst logs = s.applogs\n\t\t\t\tif (!logs) {\n\t\t\t\t\tERROR(`falsy applogs of thread`, s)\n\t\t\t\t\tthrow new Error(`falsy applogs of thread`)\n\t\t\t\t}\n\t\t\t\treturn logs\n\t\t\t})),\n\t\t)\n\t}\n\tlet initialMergeResult = untracked(() => fullJoin())\n\tconst eventMapper: ApplogEventMapper = action(function(event, sourceThread) {\n\t\tif (isInitEvent(event)) {\n\t\t\treturn { init: untracked(() => fullJoin()) } // HACK: if this would become a common thing, think of a better solution\n\t\t} else {\n\t\t\t// if (event.removed) WARN(`JoinThreads with parents removing stuff - NOT IMPLEMENTED CORRECTLY`, { event, joined: this, sourceThread }) // TODO: joinTHreads & removed?\n\t\t\treturn {\n\t\t\t\t// TODO: test this stuff\n\t\t\t\tadded: event.added.filter(addedLog => !this.hasApplog(addedLog, true)),\n\t\t\t\tremoved: event.removed?.filter(removedLog => {\n\t\t\t\t\tconst otherParentHasLog = !this.parents.some(parent => {\n\t\t\t\t\t\tif (parent === sourceThread) return false\n\t\t\t\t\t\treturn parent.hasApplog(removedLog, true)\n\t\t\t\t\t})\n\t\t\t\t\treturn !otherParentHasLog\n\t\t\t\t}),\n\t\t\t}\n\t\t}\n\t})\n\treturn new MappedThread(\n\t\tuntracked(() => `join(~ ${threads.map(s => s.name).join(', ')})`),\n\t\tthreads,\n\t\t['?'], // HACK this basically says \"we're not sure what filters are applied\"\n\t\tinitialMergeResult,\n\t\teventMapper,\n\t)\n}\n","import { Logger } from 'besonders-logger'\nimport { DebouncedFunc, pull, sortedIndexBy } from 'lodash-es'\nimport { action, autorun, getDependencyTree, IObservableArray, makeObservable, observable, toJS, untracked } from 'mobx'\nimport { Applog, ApplogForInsert } from '../applog/datom-types'\nimport { isInitEvent, Thread, ThreadEvent } from './basic'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport type ApplogEventMapper = (this: MappedThread, event: ThreadEvent, sourceThread: Thread) => ThreadEvent\n// export type ApplogWriteMapper<T extends Applog[] | ApplogForInsert[]> = (this: MappedThread, applogs: T) => T | null // FIXME: the TS generics don't actually work how I want them to\nexport type ApplogWriteMapper = (this: MappedThread, applogs: Applog[] | ApplogForInsert[]) => Applog[] | ApplogForInsert[] | null\n\nexport class MappedThread extends Thread {\n\tstatic mapWrites(parent: Thread, name: string, mapper: ApplogWriteMapper) {\n\t\treturn new MappedThread(\n\t\t\t`${name}<${parent.nameAndSizeUntracked}>`,\n\t\t\tparent,\n\t\t\tparent.filters,\n\t\t\t// @ts-expect-error ? what's the proper way\n\t\t\tparent._applogs,\n\t\t\tnull,\n\t\t\tmapper,\n\t\t)\n\t}\n\tprivate _parentSubscriptions: Map<Thread, (() => void)> = null // mapped to unsubscribe function\n\n\tconstructor(\n\t\treadonly name: string,\n\t\tparents: Thread | readonly Thread[],\n\t\tfilters: readonly string[],\n\t\treadonly _initialLogs: Applog[],\n\t\tprivate _eventMapper: ApplogEventMapper | null,\n\t\tprivate _writeMapper: ApplogWriteMapper = null,\n\t) {\n\t\t// if (!isObservableArray(_initialLogs)) WARN(`[MappedThread: ${name}] initialized with non-observable array`, _initialLogs)\n\t\tsuper(\n\t\t\tname,\n\t\t\tparents,\n\t\t\tfilters,\n\t\t\t_eventMapper ?\n\t\t\t\tobservable.array([..._initialLogs], { deep: false, name: `${name}.array` }) // ? not sure if array clone is totally necessary - but I also don't want to risk weird bugs\n\t\t\t\t: _initialLogs, // if we don't map events, we just re-use the array and then don't need to subscribe\n\t\t)\n\n\t\tmakeObservable(this, {\n\t\t\t// @ts-expect-error bc it's private\n\t\t\tonParentUpdate: action,\n\t\t})\n\n\t\tif (_eventMapper) { // if we don't map events, we just re-use the array and then don't need to subscribe\n\t\t\tthis.subscribeToParents()\n\t\t}\n\t}\n\n\tpublic insert(appLogsToInsert: ApplogForInsert[]) {\n\t\tconst mapped = this._writeMapper ? this._writeMapper(appLogsToInsert) : appLogsToInsert\n\t\tif (this._writeMapper && !mapped) return\n\t\treturn this.parents.forEach(parent => parent.insert(mapped))\n\t}\n\tpublic insertRaw(appLogsToInsert: Applog[]) {\n\t\tconst mapped = this._writeMapper ? this._writeMapper(appLogsToInsert) : appLogsToInsert\n\t\tif (this._writeMapper && !mapped) return\n\t\treturn this.parents.forEach(parent => parent.insertRaw(mapped as Applog[]))\n\t}\n\n\tprivate subscribeToParents() {\n\t\tthis._parentSubscriptions = new Map()\n\t\tconst autorunDisposer = autorun(() => {\n\t\t\tif (!this.parents.length) {\n\t\t\t\tWARN(`MappedThread has no parents`, this)\n\t\t\t}\n\t\t\t// if (this._parentSubscriptions.size) {\n\t\t\t// \tthrow ERROR(`parents subs must not be called twice`, this)\n\t\t\t// }\n\t\t\tVERBOSE(`[MappedThread: ${this.name}] subscribing to parents:`, this.parents.map(p => p.name))\n\n\t\t\tconst unseen = new Set([...this._parentSubscriptions.keys()])\n\t\t\tfor (const p of this.parents) {\n\t\t\t\tlet existed = unseen.delete(p)\n\t\t\t\tif (existed) VERBOSE(`[MappedThread: ${this.name}] Skipping re-sub to parent`, p.nameAndSizeUntracked)\n\t\t\t\tVERBOSE(`[MappedThread: ${this.name}] sub to new parent`, p.nameAndSizeUntracked)\n\t\t\t\tconst sub = this.onParentUpdate.bind(this, p)\n\t\t\t\tconst unsubscribe = p.subscribe(sub)\n\t\t\t\tthis._parentSubscriptions.set(p, unsubscribe)\n\t\t\t}\n\t\t\tfor (const p of unseen) {\n\t\t\t\tVERBOSE(`[MappedThread: ${this.name}] un-subscribing from old parent`, p.nameAndSizeUntracked)\n\t\t\t\tlet unsubscribe = this._parentSubscriptions.get(p)\n\t\t\t\tunsubscribe()\n\t\t\t\tthis._parentSubscriptions.delete(p)\n\t\t\t}\n\t\t})\n\n\t\t// TODO: how to check when to dispose this?\n\t\t// onBecomeUnobserved(this as unknown as IObservable, '_applogs', () => {\n\t\t// DEBUG(`[MappedThread: ${this.name}] disposed - unsubscribing from parents:`, { parents: this.parents, subs: this._parentSubscriptions })\n\t\t// if (this._subscribers.length) WARN(`[MappedThread: ${this.name}] disposed but got subscriptions:`, this._subscribers)\n\t\t// this.parents.forEach(p => {\n\t\t// const sub = this.onParentUpdate.bind(this, p)\n\t\t// p.unsubscribe(sub)\n\t\t// this._parentSubscriptions.delete(p)\n\t\t// })\n\t\t// this._parentSubscriptions = null\n\t\t// autorunDisposer()\n\t\t// })\n\t}\n\n\tsubscribe(callback: (event: ThreadEvent) => void) {\n\t\tif (!this._parentSubscriptions) {\n\t\t\tthis.subscribeToParents()\n\t\t}\n\t\treturn super.subscribe(callback)\n\t}\n\t// ? same on unsubscribe?\n\n\t/**\n\t * // HACK to trigger remap on pattern change in rollingFilter\n\t * should not be used lightly\n\t */\n\ttriggerRemap() {\n\t\tif (!this._eventMapper) throw ERROR(`triggerRemap on a thread that is not actually mapping?!`, this.nameAndSizeUntracked)\n\t\tDEBUG(`MappedThread{${this.nameAndSizeUntracked}} triggerRemap`)\n\t\tif (this.parents.length !== 1) {\n\t\t\tWARN(`MappedThread{${this.nameAndSizeUntracked}} triggerRemap with parentCount=${this.parents.length} - not meant for this`)\n\t\t}\n\t\tthis.parents.forEach(p => {\n\t\t\tthis.onParentUpdate(p, { init: untracked(() => toJS(p.applogs)) })\n\t\t})\n\t}\n\n\tprotected onParentUpdate(thread: Thread, event: ThreadEvent) {\n\t\tVERBOSE(`MappedThread{${this.nameAndSizeUntracked}} parentUpdate`, event)\n\t\tconst mapResult = this._eventMapper ? this._eventMapper(event, thread) : event\n\t\tif (this._eventMapper) {\n\t\t\tVERBOSE(`MappedThread{${this.nameAndSizeUntracked}} parentUpdate => mapped`, mapResult)\n\t\t\tif (isInitEvent(mapResult)) {\n\t\t\t\t;(this._applogs as IObservableArray<Applog>).replace([...mapResult.init])\n\t\t\t} else {\n\t\t\t\tfor (const log of mapResult.added) {\n\t\t\t\t\t// insert at right location to maintain sort order\n\t\t\t\t\tthis._applogs.splice(sortedIndexBy(this._applogs, log, 'ts'), 0, log)\n\t\t\t\t}\n\t\t\t\tif (mapResult.removed) {\n\t\t\t\t\tfor (const toRemove of mapResult.removed) {\n\t\t\t\t\t\tif (!(this._applogs as IObservableArray<Applog>).remove(toRemove)) {\n\t\t\t\t\t\t\tif (!isInitEvent(event) && event.removed?.includes(toRemove)) {\n\t\t\t\t\t\t\t\tDEBUG(`Ignoring remove event for non-existent because it was part of parent event's removed`, toRemove, event) // ? convenience? - or is this a code smell?\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthrow ERROR(`MappedThread{${this.name}} toRemove contained log that doesn't exist`, toRemove, {\n\t\t\t\t\t\t\t\t\tthread: this,\n\t\t\t\t\t\t\t\t\tevent,\n\t\t\t\t\t\t\t\t\tmapResult,\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} // (i) else, the _applogs is reactive to parent automatically, so no need\n\t\tVERBOSE(`MappedThread{${this.nameAndSizeUntracked}} parentUpdate => deps?`, getDependencyTree(this._applogs))\n\t\tthis.notifySubscribers(mapResult)\n\t}\n\tget readOnly() {\n\t\treturn false\n\t}\n}\n","import { Logger } from 'besonders-logger'\nimport {\n\taction,\n\tautorun,\n\tIObservableArray,\n\tobservable,\n\tObservableMap,\n\tObservableSet,\n\tonBecomeUnobserved,\n\treaction,\n\ttoJS,\n\tuntracked,\n} from 'mobx'\nimport stringify from 'safe-stable-stringify'\nimport { finalizeApplogForInsert } from '../applog/applog-helpers'\nimport { dateNowIso, matchPartStatic } from '../applog/applog-utils'\nimport { Applog, ApplogForInsert, ApplogValue, CidString, DatalogQueryPattern, ValueOrMatcher } from '../applog/datom-types'\nimport { applogThreadComparer, computedFnDeepCompare, createDebugName } from '../mobx/mobx-utils'\nimport { isInitEvent, Thread, ThreadEvent } from './basic'\nimport { ApplogEventMapper, MappedThread } from './mapped'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport const rollingFilter = computedFnDeepCompare('rollingFilter', function rollingFilter(\n\tthread: Thread,\n\tpattern: DatalogQueryPattern,\n\topts: { name?: string; extraFilterName?: string } = {},\n) {\n\tlet untrackedPattern = getUntrackedPattern(pattern) // updated in reaction\n\tlet filter = makeFilter(untrackedPattern) // updated in reaction\n\n\t// we are not tracking the filter results here as we are subscribing explicitly to the thread below\n\tconst observableArr = observable.array(\n\t\tuntracked(function rollingFilterUntrackedObservableArray() {\n\t\t\treturn filter(thread.applogs)\n\t\t}),\n\t\t{ deep: false, name: `${thread.name} | ${opts.name || `rollingFilter.array{${stringify(untrackedPattern)}}`}` },\n\t)\n\tconst handleUpdateEvent: ApplogEventMapper = (event) => {\n\t\tlet mappedEvent: ThreadEvent\n\t\tif (isInitEvent(event)) {\n\t\t\tmappedEvent = { init: filter(event.init) }\n\t\t} else {\n\t\t\tmappedEvent = {\n\t\t\t\tadded: filter(event.added),\n\t\t\t\tremoved: event.removed, // whatever's removed shall be removed\n\t\t\t}\n\t\t}\n\t\tVERBOSE(\n\t\t\t`rollingFilter{${thread.nameAndSizeUntracked} | ${opts.name ? ` '${opts.name}'}` : ''} parentUpdate`,\n\t\t\tuntrackedPattern,\n\t\t\tevent,\n\t\t\t'=>',\n\t\t\tmappedEvent,\n\t\t)\n\t\t// console.trace('rollingFilter.addFiltered', getObserverTree(observableArr))\n\t\t// trace()\n\t\treturn mappedEvent\n\t}\n\tconst mappedThread = new MappedThread(\n\t\t`${thread.name} | ${opts.name || `rollingFilter{${stringify(untrackedPattern)}}`}`,\n\t\tthread,\n\t\t[...thread.filters, ...(opts.extraFilterName ? [opts.extraFilterName] : [])],\n\t\tobservableArr,\n\t\thandleUpdateEvent,\n\t)\n\n\t// observe pattern manually and invalidate thread in case it changes\n\tconst cancelPatternReaction = reaction(\n\t\t() => toJS(pattern), // JSON.parse(JSON.stringify(pattern)), - old but inefficient\n\t\t(pat) => {\n\t\t\tVERBOSE(\n\t\t\t\t`rollingFilter<${thread.nameAndSizeUntracked}>${opts.name ? ` '${opts.name}'` : ''} patternUpdate`,\n\t\t\t\tuntrackedPattern,\n\t\t\t\t'=>',\n\t\t\t\tpat, /* , getDependencyTree(pat) */\n\t\t\t)\n\t\t\tuntrackedPattern = pat\n\t\t\tfilter = makeFilter(untrackedPattern)\n\t\t\tmappedThread.triggerRemap() // HACK\n\t\t},\n\t)\n\n\tconst unobserveUnobserving = onBecomeUnobserved(observableArr, () => {\n\t\tVERBOSE(`rollingFilter<${untracked(() => thread.name)}>${opts.name ? ` '${opts.name}'` : ''} unobserve`, untrackedPattern)\n\t\tcancelPatternReaction()\n\t\tunobserveUnobserving()\n\t})\n\n\treturn mappedThread\n}, {\n\tequals: applogThreadComparer,\n\targsDebugName: (thread, pattern, opts) => createDebugName({ caller: 'rollingFilter', thread, pattern, args: opts }),\n})\n\nexport const rollingMapper = computedFnDeepCompare('rollingMapper', function rollingMapper(\n\tthread: Thread,\n\teventMapper: ApplogEventMapper,\n\topts: { name?: string; extraFilterName?: string } = {},\n) {\n\tconst initialMapResult = untracked(() => eventMapper.call(null, { init: thread.applogs }, thread))\n\tif (!isInitEvent(initialMapResult)) {\n\t\tthrow ERROR('Initial run must return init event')\n\t}\n\tconst initialLogs = initialMapResult.init\n\n\treturn new MappedThread(\n\t\t`${thread.name} | ${opts.name || `rollingMapper`}`,\n\t\tthread,\n\t\t[...thread.filters, ...(opts.extraFilterName ? [opts.extraFilterName] as const : [] as const)],\n\t\t// @ts-expect-error readonly.... FIXME\n\t\tinitialLogs,\n\t\teventMapper,\n\t)\n}, {\n\tequals: applogThreadComparer,\n\targsDebugName: (thread, _mapper, opts) => createDebugName({ caller: 'rollingMapper', thread, args: opts }),\n})\n\nexport const rollingAcc = computedFnDeepCompare(\n\t'rollingAcc',\n\tfunction rollingAcc<ACC extends IObservableArray | ObservableMap | ObservableSet>(\n\t\tthread: Thread,\n\t\tacc: ACC,\n\t\teventMapper: (event: ThreadEvent, acc: ACC) => void,\n\t\topts: { name?: string } = {},\n\t) {\n\t\t// (i) actions are untracked - https://mobx.js.org/actions.html#actions-are-untracked\n\t\tconst eventMapperAction = action(eventMapper)\n\t\teventMapperAction({ init: thread.applogs }, acc) // Do initial mapping\n\t\tthread.subscribe(event => {\n\t\t\teventMapperAction(event, acc)\n\t\t})\n\n\t\treturn acc\n\t},\n\t{ argsDebugName: (thread, _acc, _mapper, opts) => `rollingAcc{${thread.nameAndSizeUntracked}${opts?.name ? ` | ${opts?.name}` : ''}}` },\n)\n\n// function rollingFilter(\n// db: ThreadIDB,\n// filter: (logs: Applog[]) => Applog[],\n// name: string,\n// ) {\n// const filtered = observable.array(filter(untracked(() => db.applogs)), { deep: false });\n\n// const observableArr = rollingFilter(filter, db)\n// const addFiltered = /* action( */(added: Applog[]) => {\n// VERBOSE(`rollingFilter<${db.nameAndSize}>.update`, pattern, added)\n// // filter(added).forEach(log => result.push(log)) //? no bulk insert?\n// observableArr.push(...added)\n// }/* ) */;\n\n// db.subscribe(addFiltered);\n// onBecomeUnobserved(filtered, () => {\n// VERBOSE(`rollingFilter<${db.nameAndSize}>.unobserve`, filter)\n// db.unsubscribe(addFiltered);\n// });\n// return new Thread(filtered, `${db.name} | ${name}`)\n// }\n\nexport const getUntrackedPattern = function getUntrackedPattern(\n\tpattern: DatalogQueryPattern,\n) {\n\tconst untrackedPattern = untracked(function innerUntrackedPattern() {\n\t\treturn Object.fromEntries(Object.entries(toJS(pattern)).map(([k, v]) => [toJS(k), toJS(v)]))\n\t})\n\tif (!Object.entries(untrackedPattern).length) {\n\t\tthrow new Error(`Pattern is empty`)\n\t}\n\treturn untrackedPattern\n}\nexport function makeFilter(\n\tpattern: DatalogQueryPattern,\n) {\n\treturn function madeFilter(logs: readonly Applog[]) {\n\t\treturn logs.filter(function madeFilterSingleLog(applog) {\n\t\t\tfor (const field of Object.keys(pattern)) {\n\t\t\t\tlet patternValue = pattern[field] // (i) not using .entries bc. https://gists.cwidanage.com/2018/06/how-to-iterate-over-object-entries-in.html\n\t\t\t\tif (patternValue === undefined) continue // undefined in pattern means \"no constraint/query on this field\"\n\t\t\t\tconst applogValue = applog[field.startsWith('!') ? field.slice(1) : field]\n\t\t\t\tconst patternValT: ValueOrMatcher<ApplogValue> = patternValue\n\t\t\t\tif (!matchPartStatic(field as keyof Applog, patternValT, applogValue)) {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true\n\t\t})\n\t}\n}\n\n/**\n * // ! think twice before using\n */\nexport const getUntrackedFilterResults = function getUntrackedFilterResults(\n\tthread: Thread,\n\tpattern: DatalogQueryPattern,\n\topts: { name?: string } = {},\n) {\n\tconst untrackedPattern = getUntrackedPattern(pattern)\n\tconst filter = makeFilter(untrackedPattern)\n\treturn untracked(() => filter(thread.applogs))\n}\n\n///////////////////////////\n// FILTERED THREAD TYPES //\n///////////////////////////\nexport type ThreadWithFilter<T extends string> = Thread & {\n\tfilters: readonly T[]\n}\nexport function hasFilter<T extends string>(thread: Thread, filter: T): thread is ThreadWithFilter<T> {\n\treturn thread.filters.includes(filter)\n}\nexport function assertRaw(thread: Thread) /* : thread is ThreadWithoutFilters */ {\n\tif (thread.filters.length) {\n\t\tWARN(`[assertRaw] but '${thread.nameAndSizeUntracked}' has filters:`, thread.filters)\n\t}\n\treturn thread as ThreadWithoutFilters\n}\nexport function assertOnlyCurrent(thread: Thread) /* : thread is ThreadOnlyCurrent */ {\n\tif (\n\t\t!hasFilter(thread, 'lastWriteWins') ||\n\t\t!hasFilter(thread, 'withoutDeleted')\n\t) throw ERROR(`should be filtered thread, but is:`, thread.filters)\n\treturn thread\n}\nexport type ThreadOnlyCurrent = ThreadWithFilter<'lastWriteWins'>\nexport type ThreadNoDeleted = ThreadWithFilter<'withoutDeleted'>\nexport type ThreadOnlyCurrentNoDeleted = ThreadWithFilter<'lastWriteWins' | 'withoutDeleted'>\nexport type ThreadWithoutFilters = Thread & { filters: [] }\n\n//////////////////\n// MISC HELPERS //\n//////////////////\n\nexport type ApplogMapper = (log: Applog, sourceThread: Thread) => ApplogForInsert\nexport const simpleApplogMapper = function simpleApplogMapper(\n\tthread: Thread,\n\tlogMapper: ApplogMapper,\n\topts: { name?: string; extraFilterName?: string } = {},\n) {\n\tconst mappedTo = new Map<CidString, Applog>() // source log CID to result log\n\tconst mapLogs = (applogs: readonly Applog[], thread: Thread) => {\n\t\tconst ts = dateNowIso()\n\t\treturn applogs.map(log => {\n\t\t\tconst mapped = logMapper(log, thread)\n\t\t\tlet mapTo: Applog\n\t\t\tif (mapped === log) {\n\t\t\t\tmapTo = log\n\t\t\t} else {\n\t\t\t\tif ((mapped as Applog).cid === log.cid) {\n\t\t\t\t\tdelete (mapped as Applog).cid // for convenience of not needing to remove it in the mapper\n\t\t\t\t}\n\t\t\t\tmapTo = finalizeApplogForInsert(mapped, {\n\t\t\t\t\tts,\n\t\t\t\t\tthreadForPv: null, // ? should not be inferred, right?\n\t\t\t\t})\n\t\t\t}\n\t\t\tmappedTo.set(log.cid, mapTo)\n\t\t\treturn mapTo\n\t\t})\n\t}\n\n\tconst handleUpdateEvent: ApplogEventMapper = (event) => {\n\t\tlet mappedEvent: ThreadEvent\n\t\tif (isInitEvent(event)) {\n\t\t\tmappedEvent = { init: mapLogs(event.init, thread) }\n\t\t} else {\n\t\t\tmappedEvent = {\n\t\t\t\tadded: mapLogs(event.added, thread),\n\t\t\t\tremoved: event.removed.map(removedSourceLog => {\n\t\t\t\t\tconst mappedLog = mappedTo.get(removedSourceLog.cid)\n\t\t\t\t\tif (!mappedLog) {\n\t\t\t\t\t\tthrow ERROR(`[simpleApplogMapper] Parent remove event for Applog that we don't know about`, { removedSourceLog })\n\t\t\t\t\t}\n\t\t\t\t\tmappedTo.delete(removedSourceLog.cid)\n\t\t\t\t\treturn mappedLog\n\t\t\t\t}),\n\t\t\t}\n\t\t}\n\t\tVERBOSE(\n\t\t\t`simpleApplogMapper{${thread.nameAndSizeUntracked} | ${opts?.name ? ` '${opts?.name}'}` : ''} parentUpdate`,\n\t\t\tevent,\n\t\t\t'=>',\n\t\t\tmappedEvent,\n\t\t)\n\t\t// console.trace('rollingFilter.addFiltered', getObserverTree(observableArr))\n\t\t// trace()\n\t\treturn mappedEvent\n\t}\n\tconst mappedThread = rollingMapper(thread, handleUpdateEvent, opts)\n\tVERBOSE.isDisabled || autorun(() => {\n\t\tVERBOSE(`simpleApplogMapper<${thread.nameAndSizeUntracked}> mapped to`, mappedThread.applogs)\n\t})\n\treturn mappedThread\n}\n","import { Logger } from 'besonders-logger'\nimport { makeObservable, observable } from 'mobx'\nimport { ensureTsPvAndFinalizeApplogs } from '../applog/applog-helpers'\nimport { isTsBefore, removeDuplicateAppLogs, sortApplogsByTs } from '../applog/applog-utils'\nimport { type Applog, ApplogForInsert, isValidApplog, CidString } from '../applog/datom-types'\nimport { Thread } from './basic'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport abstract class WriteableThread extends Thread {\n\tconstructor(\n\t\tname: string,\n\t\t// parents: Thread | readonly Thread[] | null, // ? would this ever be a thing\n\t\tapplogs: Applog[] = [],\n\t\tfilters: readonly string[],\n\t) {\n\t\tsuper(name, null, filters, applogs)\n\n\t\tmakeObservable(this, {\n\t\t\t// (i) all fields handled in parent\n\t\t})\n\t}\n\n\tpublic purge(cidsToPurge: CidString[]) {\n\t\tconst beforeCount = this.applogs.length\n\t\t//HACK setting readonly\n\t\tthis._applogs = this.applogs.filter(log=>!(cidsToPurge.includes(log.cid)))\n\t\treturn beforeCount - this.applogs.length\n\t}\n\tpublic insert(appLogsToInsert: ApplogForInsert[]) {\n\t\tconst mapped = ensureTsPvAndFinalizeApplogs(appLogsToInsert, this)\n\t\treturn this.insertRaw(mapped)\n\t}\n\n\tpublic insertRaw(appLogsToInsert: Applog[]) {\n\t\tconst deduplicated = removeDuplicateAppLogs(appLogsToInsert)\n\t\tif (deduplicated.length !== appLogsToInsert.length) {\n\t\t\tthrow ERROR(`[insertRaw] duplicate applogs passed: ${appLogsToInsert.length - deduplicated.length}`, {\n\t\t\t\tappLogsToInsert,\n\t\t\t\tdeduplicated,\n\t\t\t})\n\t\t}\n\n\t\tconst bogus = appLogsToInsert.filter(log => !isValidApplog(log))\n\t\tif (bogus.length) {\n\t\t\tthrow ERROR(`[insertRaw] bogus applogs passed: ${bogus.length}`, { bogus })\n\t\t}\n\n\t\tconst existing = appLogsToInsert.filter(log => this.hasApplog(log, false))\n\t\tif (existing.length) {\n\t\t\tthrow ERROR(`[insertRaw] already existing applogs passed: ${existing.length}`, { existing })\n\t\t}\n\n\t\tif (!appLogsToInsert.length) {\n\t\t\tWARN('[insertRaw] skipping empty insert empty logs array')\n\t\t\treturn\n\t\t}\n\n\t\t;(!this.hasParents && !(this instanceof ThreadInMemory) ? LOG : DEBUG)(\n\t\t\t'Inserting:',\n\t\t\tappLogsToInsert.length === 1 ? appLogsToInsert[0] : appLogsToInsert,\n\t\t\t{ ds: this },\n\t\t)\n\t\tsortApplogsByTs(appLogsToInsert)\n\t\tconst sortNeeded = this._applogs.length && isTsBefore(appLogsToInsert[0], this._applogs[this._applogs.length - 1])\n\t\tthis._applogs.push(...appLogsToInsert)\n\t\tif (sortNeeded) {\n\t\t\tsortApplogsByTs(this._applogs)\n\t\t}\n\t\tthis.notifySubscribers({ added: appLogsToInsert, removed: null })\n\n\t\t// ? persist sync\n\t\tvoid this.persist(appLogsToInsert)\n\t\treturn appLogsToInsert\n\t}\n\n\tget readOnly() {\n\t\treturn false\n\t}\n\n\tprotected abstract persist(logs: Applog[]): Promise<void>\n}\nexport class ThreadInMemory extends WriteableThread {\n\tstatic empty(name?: string) {\n\t\treturn ThreadInMemory.fromArray([], name ?? 'empty in-memory', false)\n\t}\n\tstatic fromArray(applogs: Applog[], name?: string, readOnly = false) {\n\t\treturn new ThreadInMemory(name ?? 'in-memory', applogs, [], readOnly)\n\t}\n\n\tconstructor(\n\t\tname: string,\n\t\tapplogs: Applog[],\n\t\tfilters: readonly string[],\n\t\treadonly _readOnly: boolean,\n\t) {\n\t\tsuper(name, applogs, filters)\n\n\t\tmakeObservable(this, {\n\t\t\t// @ts-expect-error bc it's private\n\t\t\t_applogs: observable.shallow,\n\t\t})\n\t}\n\n\tget readOnly() {\n\t\treturn this._readOnly\n\t}\n\n\tprotected async persist(logs: Applog[]) {\n\t\tVERBOSE(`[InMem.persist] no persist for`, logs)\n\t\tif (this.readOnly) {\n\t\t\tthrow ERROR(`[persist] called for readOnly thread`)\n\t\t}\n\t}\n}\n","import { Logger } from 'besonders-logger'\nimport { curry, debounce, partial, pull, uniqBy, uniqWith } from 'lodash-es'\nimport { untracked } from 'mobx'\nimport { ensureTsPvAndFinalizeApplogs, joinThreads } from '../applog/applog-helpers'\nimport { compareApplogsByEnAt, compareApplogsByTs, objEqualByKeys } from '../applog/applog-utils'\nimport { Applog, ApplogForInsert, EntityID } from '../applog/datom-types'\nimport { Thread } from './basic'\nimport { MappedThread } from './mapped'\nimport { ThreadInMemory, WriteableThread } from './writeable'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport function entityCount(thread: Thread) {\n\treturn allEntityIDs(thread).size // at some point: index size?\n}\nexport function allEntityIDs(thread: Thread) {\n\treturn accumulateLogsToSet(thread, log => log.en)\n}\n\nfunction accumulateLogsToSet<ACC>(\n\tthreadOrLogs: Thread | Applog[],\n\tcallback: (log: Applog, acc: Set<ACC>) => ACC | undefined,\n) {\n\tconst logs = threadOrLogs instanceof Thread ? threadOrLogs.applogs : threadOrLogs\n\tconst set = new Set<ACC>()\n\tfor (const log of logs) {\n\t\tset.add(callback(log, set))\n\t}\n\treturn set\n}\n\nexport function debounceWrites(\n\tthread: Thread,\n\twait = 700,\n\tremoveDuplicatesWith = compareApplogsByEnAt,\n) {\n\tif (thread.readOnly) throw ERROR(`[debounceWrites] but readOnly thread`, thread.name)\n\tlet insertQueue: Array<Applog | ApplogForInsert> = []\n\n\tconst debouncedCommit = debounce(() => {\n\t\tWARN(`Debounce tail`, { thread, mappedThread, insertQueue })\n\t\tconst toInsert = ensureTsPvAndFinalizeApplogs(\n\t\t\t// ? uniq, sure - but which one is used? (update: seems the first one, so reverse)\n\t\t\tuniqWith(insertQueue.reverse(), removeDuplicatesWith),\n\t\t\tthread,\n\t\t)\n\t\tthread.insertRaw(toInsert)\n\t\tinsertQueue.splice(0, insertQueue.length) // clear queue\n\t}, wait)\n\tconst handleInsert = (applogs: Applog[] | ApplogForInsert[]) => {\n\t\tDEBUG(`Debounce input:`, applogs, { thread, mappedThread, insertQueue })\n\t\tinsertQueue.push(...applogs)\n\t\tdebouncedCommit()\n\t\treturn null // don't insert anything\n\t}\n\n\tconst mappedThread = MappedThread.mapWrites(\n\t\tthread,\n\t\t`Debounce(${wait})`,\n\t\thandleInsert,\n\t)\n\treturn mappedThread\n}\n\n/**\n * @param deduplicateHoldItemsWith called with (heldLog, realLog), if it returns true, the held log is skipped\n * @param onFirstWrite called with held logs about to be inserted, if it returns an array, those logs will be inserted instead\n */\nexport function holdTillFirstWrite(\n\tthread: Thread,\n\tapplogsToHold: ApplogForInsert[],\n\topts: {\n\t\tdeduplicateHoldItemsWith?: typeof compareApplogsByEnAt\n\t\tonFirstWrite: (heldLogsToInsert: Applog[]) => Applog[] | undefined\n\t},\n) {\n\tDEBUG(`[holdTillFirstWrite] holding logs:`, { applogsToHold })\n\tif (thread.readOnly) throw ERROR(`[holdTillFirstWrite] but readOnly thread`, thread.nameAndSizeUntracked)\n\tconst heldLogs = untracked(() =>\n\t\t// we don't want reactivity on the underlying thread... or do we?\n\t\tensureTsPvAndFinalizeApplogs([...applogsToHold], thread)\n\t)\n\tconst heldThread = ThreadInMemory.fromArray(heldLogs)\n\n\tlet hasInserted = false\n\tconst handleInsert = (realApplogs: Applog[] | ApplogForInsert[]) => {\n\t\tif (hasInserted) return realApplogs\n\t\thasInserted = true\n\n\t\tlet toInsert = [...heldLogs]\n\t\t// heldLogs.splice(0, heldLogs.length) // ? joinThread could take care of this\n\t\tif (opts.deduplicateHoldItemsWith) {\n\t\t\ttoInsert = toInsert.filter(heldLog =>\n\t\t\t\t// some duplicate? so don't insert\n\t\t\t\t!realApplogs.some(realLog => opts.deduplicateHoldItemsWith(heldLog, realLog))\n\t\t\t)\n\t\t}\n\t\tif (opts.onFirstWrite) {\n\t\t\tconst callbackResult = opts.onFirstWrite(toInsert)\n\t\t\tif (callbackResult !== undefined) {\n\t\t\t\ttoInsert = callbackResult\n\t\t\t}\n\t\t}\n\t\tDEBUG(`[holdTillFirstWrite] adding hold logs:`, { applogsToHold, heldLogs, toInsert, realApplogs })\n\t\treturn [...toInsert, ...realApplogs]\n\t}\n\tconst joinedThread = joinThreads([thread, heldThread])\n\treturn new MappedThread(\n\t\t`HoldTillFirstWrite[${applogsToHold.length}]<${thread.nameAndSizeUntracked}>`,\n\t\tjoinedThread,\n\t\tthread.filters,\n\t\t// @ts-expect-error ? what's the proper way\n\t\tjoinedThread.applogs,\n\t\tnull,\n\t\t(applogs) => {\n\t\t\tconst logsToInsert = handleInsert(applogs)\n\t\t\tthread.insert(logsToInsert)\n\t\t\treturn null\n\t\t},\n\t)\n}\n","import { Logger } from 'besonders-logger'\nimport { CID } from 'multiformats'\nimport { ensureTsPvAndFinalizeApplog } from '../applog/applog-helpers'\nimport { EntityID } from '../applog/datom-types'\nimport { Thread } from '../thread'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport type PubPullData = {\n\tcid: CID\n\tthread: Thread\n}\n\nexport function integratePub({ targetThread, agentHash, subID, pubData }: {\n\ttargetThread: Thread\n\tagentHash: EntityID\n\tpubData: PubPullData\n\tsubID?: EntityID\n}) {\n\tconst newLogs = pubData.thread.applogs.filter(log => !targetThread.hasApplog(log, false))\n\tDEBUG(`[integratePub] integrating ${newLogs.length} logs`, { targetThread, subID, pubData })\n\tlet toInsert = newLogs\n\tif (subID) {\n\t\ttoInsert = toInsert.concat(ensureTsPvAndFinalizeApplog(\n\t\t\t{ en: subID, at: 'subscription/cid', vl: pubData.cid.toString(), ag: agentHash },\n\t\t\ttargetThread,\n\t\t))\n\t}\n\ttargetThread.insertRaw(toInsert)\n\treturn newLogs\n}\n","import { CID } from 'multiformats/cid'\nimport { cyrb53hash } from './../applog/applog-utils'\nimport { AgentHash, AgentID, CidString } from '../applog/datom-types'\nimport { Tagged } from '../types'\n\ntype AgentString = Tagged<string, 'AgentString'>\ntype DIDString = Tagged<string, 'DID'>\nexport type { AgentHash, AgentString, DIDString }\n\nexport interface AppAgent {\n\tag: AgentHash\n\tagentString: AgentString\n\tdid: DIDString\n\tsign(data: Uint8Array): Promise<Uint8Array>\n}\nexport interface AppAgentForWorker {\n\tag: AgentHash\n\tagentString: AgentString\n\tdid: DIDString\n\tsignerSecret?: Uint8Array\n\tsign?: (data: Uint8Array)=> Promise<Uint8Array>\n}\nexport interface PubBlockRoot {\n\tapplogs: CID\n\tapplogsSignature: Uint8Array\n\tinfo: CID\n\tinfoSignature: Uint8Array\n\tprev?: CID\n}\nexport interface PubBlockLogs {\n\tlogs: CID[]\n}\nexport interface PubBlockChunks {\n\tchunks: CID[]\n}\nexport type PubBlockLogsOrChunks = PubBlockLogs | PubBlockChunks\n\n// HACK: this is actually note3 types, not wovin\nexport interface IPublication {\n\tid?: string // string hash of pub (used as unique id in IDB) `W3Name.create().toString()` starts with k51qzi5uqu5d\n\tcreatedAt: string // ISO timestamp of creation\n\tname: string // nick name for the pub\n\tisDeleted?: boolean\n\tpurgeBeforePush?: boolean\n\n\tpk: Uint8Array // exported privatekey - needed to create WritableName for publishing //TODO: store as non-extractable / encrypted?\n\n\tautopush: boolean\n\tlastPush: string | null\n\tlastCID?: string\n\tlatestLogTs?: string\n\tpubCounter?: number\n\n\tpublishedBy: string // local user appAgent\n\tselectors?: string[] // to be used as a filter for which applogs to pub\n\tencryptedFor?: string | null // short agentHash\n\tencryptedWith?: CryptoKey | null // AES-GCM derived key from ECDH keys (local private and remote public)\n\n\t// HACK WIP #39 - shared encryption\n\tsharedKey?: CryptoKey | null // AES-GCM derived key from ECDH keys (local private and ipns public)\n\tsharedAgents?: AgentID[] | null // array of string EntityIDs for the chosen agents (we need public jwkd atoms for each of them)\n\tsharedKeyMap?: Map<AgentID, string> | null // uses public key from each agent to derive an aes key that is used to encrypt and btoa the sharedKey that is actually used to encrypt and decrypt the applogs\n}\nexport interface ISubscription {\n\tid: string // string hash of pub (used as unique id in IDB) `W3Name.create().toString()` starts with k51qzi5uqu5d\n\tcreatedAt: string // ISO timestamp of creation\n\tname: string // nick name for the pub\n\tisDeleted: boolean\n\n\tlastPull?: string | null\n\tlastPullAttempt?: string | null\n\tautopull: boolean\n\tlastCID?: string // ? why not CidString\n\tlastApplogCID?: string\n\tpublishedBy?: string // remote publisher short agentHash\n\tencryptedFor?: string | undefined // short agentHash\n\tencryptedWith?: CryptoKey | undefined // AES-GCM derived key from ECDH keys (local private and remote public)\n}\nexport function isPublication(obj: any): obj is IPublication {\n\treturn obj?.pk !== undefined && obj?.lastPush !== undefined\n}\nexport function isSubscription(obj: any): obj is ISubscription {\n\treturn obj?.lastPull !== undefined\n}\n\nexport type TSubPub = IPublication | ISubscription\n\nexport function agentToShortHash(agentString: string) {\n\treturn cyrb53hash(agentString, 31, 7) as string\n}\n","import { computed, makeObservable, untracked } from 'mobx'\nimport { joinThreads } from '../applog/applog-helpers'\nimport { SearchContext } from '../applog/datom-types'\nimport { observableArrayMap } from '../mobx/mobx-utils'\nimport type { Thread } from '../thread/basic'\nimport { ReadonlyObservableArray } from '../types/typescript-utils'\n\nexport class QueryNode {\n\tconstructor(\n\t\treadonly logsOfThisNode: Thread,\n\t\treadonly variables: SearchContext,\n\t\treadonly prevNode: QueryNode | null = null,\n\t) {\n\t\tmakeObservable(this, {\n\t\t\tthreadOfTrail: computed, // ? intuitively only put the ones here that felt expensive to compute (join)\n\t\t})\n\t}\n\tget record() {\n\t\treturn this.variables // alias for end-user consumption\n\t}\n\n\tget threadOfTrail() {\n\t\tif (!this.prevNode) return this.logsOfThisNode\n\t\treturn joinThreads([\n\t\t\tthis.logsOfThisNode,\n\t\t\tthis.prevNode.threadOfTrail,\n\t\t])\n\t}\n\tget trailLogs() {\n\t\treturn this.threadOfTrail.applogs\n\t}\n}\n/**\n * The result of a query (-step)\n */\nexport class QueryResult {\n\tconstructor(\n\t\tpublic nodes: ReadonlyObservableArray<QueryNode>,\n\t) {\n\t\tmakeObservable(this, {\n\t\t\tthreadOfAllTrails: computed, // ? intuitively only put the ones here that felt expensive to compute (join)\n\t\t\tsize: computed, // ... or cheap to cache\n\t\t\tisEmpty: computed,\n\t\t})\n\t}\n\n\tget size() {\n\t\treturn this.records.length\n\t}\n\tget isEmpty() {\n\t\treturn this.records.length === 0\n\t}\n\tget untrackedSize() {\n\t\treturn untracked(() => this.records.length)\n\t}\n\n\tget records() {\n\t\treturn observableArrayMap(() => this.nodes.map(({ variables }) => variables), { name: 'QueryResult.records' })\n\t}\n\tget leafNodeThread() {\n\t\treturn joinThreads(\n\t\t\tobservableArrayMap(() => this.nodes.map(({ logsOfThisNode: thread }) => thread), { name: 'QueryResult.leafNodeThread' }),\n\t\t)\n\t}\n\tget leafNodeLogs() {\n\t\treturn observableArrayMap(() => this.nodes.map(({ logsOfThisNode: thread }) => thread.applogs), { name: 'QueryResult.leafNodeLogs' })\n\t}\n\t// get trailThreads() {\n\t// \treturn observableArrayMap(() => this.nodes.map(({ trailThread }) => trailThread))\n\t// }\n\tget threadOfAllTrails() {\n\t\treturn joinThreads(observableArrayMap(() => this.nodes.map(node => node.threadOfTrail), { name: 'QueryResult.threadOfAllTrails' }))\n\t}\n\tget thread() {\n\t\treturn this.threadOfAllTrails // alias\n\t}\n\tget allApplogs() {\n\t\treturn this.threadOfAllTrails.applogs // mostly for easy logging\n\t}\n}\n","import { AgentHash, Applog, ApplogValue, DatalogQueryPattern, EntityID, SearchContext, ValueOrMatcher } from '../applog/datom-types'\n\nimport { Logger } from 'besonders-logger'\nimport { action, autorun, comparer, computed, makeObservable, observable, onBecomeObserved, toJS, untracked } from 'mobx'\n\nimport { isEmpty } from 'lodash-es'\nimport stringify from 'safe-stable-stringify'\nimport { resolveOrRemoveVariables, sortApplogsByTs } from '../applog/applog-utils'\nimport {\n\tapplogThreadComparer,\n\tcomputedFnDeepCompare,\n\tcomputedStructuralComparer,\n\tcreateDebugName,\n\tobservableArrayMap,\n\tobservableSetMap,\n\tqueryNodesComparer,\n} from '../mobx/mobx-utils'\nimport { isInitEvent, StaticThread, Thread, ThreadEvent } from '../thread/basic'\nimport { rollingFilter, rollingMapper, ThreadOnlyCurrent } from '../thread/filters'\nimport { MappedThread } from '../thread/mapped'\nimport { ThreadInMemory } from '../thread/writeable'\nimport { QueryNode, QueryResult } from './types'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO, { prefix: '[q]' }) // eslint-disable-line no-unused-vars\n\n// util.inspect.defaultOptions.depth = 5;\n\n// export interface QueryExecutorArguments {\n// db: Thread\n// // applogs: AppLog[]\n// nodes: SearchContextWithLog[]\n// }\n// export interface QueryExecutorResult {\n// // applogs: AppLog[]\n// nodes: SearchContextWithLog[]\n// }\n// export type QueryExecutor = (args: QueryExecutorArguments) => QueryExecutorResult\n\n/////////////\n// QUERIES //\n/////////////\n\n/**\n * Keep only the latest logs for each en&at (= last write wins)\n */\nexport const lastWriteWins = computedFnDeepCompare('lastWriteWins', function lastWriteWins(\n\tthread: Thread,\n\t{ inverseToOnlyReturnFirstLogs, tolerateAlreadyFiltered }: {\n\t\tinverseToOnlyReturnFirstLogs?: boolean\n\t\ttolerateAlreadyFiltered?: boolean\n\t} = {},\n): ThreadOnlyCurrent {\n\tVERBOSE(`lastWriteWins${inverseToOnlyReturnFirstLogs ? '.inversed' : ''} < ${thread.nameAndSizeUntracked} > initializing`)\n\t// if (thread.name.includes('lastWriteWins')) WARN(`thread already contains lastWriteWins:`, thread.name)\n\tif (thread.filters.includes('lastWriteWins')) {\n\t\tif (tolerateAlreadyFiltered) {\n\t\t\tDEBUG(`[lastWriteWins] already filtered, but tolerateAlreadyFiltered=true, so returning`)\n\t\t\treturn thread as ThreadOnlyCurrent\n\t\t}\n\t\tthrow ERROR(`thread already filtered lastWriteWins:`, thread.filters, { name: thread.name })\n\t}\n\n\tlet rollingMap: Map<string, Applog>\n\tconst mappedThread = rollingMapper(thread, function lastWriteWinsMapper(event, sourceThread) {\n\t\tconst isInitial = isInitEvent(event)\n\n\t\tlet newLogs: readonly Applog[]\n\t\tconst toAdd = [] as Applog[]\n\t\tconst toRemove = isInitial ? null : [] as Applog[]\n\t\tif (isInitial) {\n\t\t\trollingMap = new Map()\n\t\t\tnewLogs = event.init\n\t\t} else {\n\t\t\tnewLogs = event.added\n\t\t}\n\n\t\tlet tsCheck: string\n\t\tfor (\n\t\t\tlet i = inverseToOnlyReturnFirstLogs ? 0 : newLogs.length - 1;\n\t\t\tinverseToOnlyReturnFirstLogs ? i < newLogs.length : i >= 0;\n\t\t\tinverseToOnlyReturnFirstLogs ? i++ : i--\n\t\t) {\n\t\t\tconst log = newLogs[i]\n\t\t\tconst key = log.en + '|' + log.at // stringify([log.en, log.at]) - less efficient\n\n\t\t\t// TODO: use isoDateStrCompare ?\n\t\t\tif (tsCheck && (inverseToOnlyReturnFirstLogs ? tsCheck > log.ts : tsCheck < log.ts)) {\n\t\t\t\tthrow ERROR(`lastWriteWins.mapper logs not sorted:`, tsCheck, inverseToOnlyReturnFirstLogs ? '>' : '<', log.ts, {\n\t\t\t\t\tlog,\n\t\t\t\t\ti,\n\t\t\t\t\tnewLogs,\n\t\t\t\t\tinverseToOnlyReturnFirstLogs,\n\t\t\t\t})\n\t\t\t}\n\t\t\ttsCheck = log.ts\n\n\t\t\tconst existing = rollingMap.get(key)\n\t\t\tif (!existing || (inverseToOnlyReturnFirstLogs ? (existing.ts > log.ts) : (existing.ts < log.ts))) {\n\t\t\t\tif (existing && !isInitial) toRemove.push(existing)\n\t\t\t\ttoAdd.push(log)\n\t\t\t\trollingMap.set(key, log)\n\t\t\t}\n\t\t}\n\t\tsortApplogsByTs(toAdd) // HACK: find logical solution\n\t\tVERBOSE.isDisabled ||\n\t\t\tVERBOSE(\n\t\t\t\t`lastWriteWins${inverseToOnlyReturnFirstLogs ? '.inversed' : ''}<${thread.nameAndSizeUntracked}> mapped event`,\n\t\t\t\tisInitial ?\n\t\t\t\t\t{ ...Object.fromEntries(Object.entries(event).map(([k, v]) => [k, v?.length])), toAdd: toAdd.length, toRemove } :\n\t\t\t\t\t{ ...event, toAdd, toRemove },\n\t\t\t)\n\t\treturn isInitial ?\n\t\t\t{ init: toAdd }\n\t\t\t: { added: toAdd, removed: toRemove }\n\t}, { name: `lastWriteWins${inverseToOnlyReturnFirstLogs ? '.inversed' : ''}`, extraFilterName: 'lastWriteWins' })\n\tVERBOSE.isDisabled || autorun(() => {\n\t\tVERBOSE(`lastWriteWins<${thread.nameAndSizeUntracked}> filtered down to`, mappedThread.applogs.length) // using applogs.length, as size might not change, but we still want a log\n\t})\n\treturn mappedThread as ThreadOnlyCurrent\n\t// const filtered = observableArrayMap(() => {\n\t// VERBOSE(`lastWriteWins thread deps:`, getDependencyTree(thread.applogs), thread)\n\t// thread.applogs.forEach(applog => {\n\t// const key = stringify([applog.en, applog.at])\n\t// const existing = mapped.get(key)\n\t// if (!existing || existing.ts < applog.ts)\n\t// mapped.set(key, applog)\n\t// })\n\t// VERBOSE(`[lastWriteWins] mapped:`, mapped.size)\n\t// return Array.from(mapped.values())\n\t// }, { name: obsArrMapName })\n\t// VERBOSE(`lastWriteWins deps of filteredArr:`, getDependencyTree(filtered))\n\t// return new MappedThread(thread, filtered, `${thread.name} | lastWriteWins`)\n}, { equals: applogThreadComparer, argsDebugName: (thread) => createDebugName({ caller: 'lastWriteWins', thread }) })\n\n/**\n * Remove all applogs for entities that have an applog: { at: `isDeleted`, val: true }\n * ! WARNING: If not based on lastWriteWins, it will not respect un-deletions yet (isDeleted: false)\n */\nexport const withoutDeleted = computedFnDeepCompare('withoutDeleted', function withoutDeleted(\n\tthread: Thread,\n) {\n\tif (VERBOSE.isEnabled) VERBOSE(`withoutDeleted<${thread.nameAndSizeUntracked}>`)\n\t// if (thread.name.includes('withoutDeleted')) WARN(`thread already contains withoutDeleted:`, withoutDeleted)\n\tif (thread.filters.includes('withoutDeleted')) {\n\t\tthrow ERROR(`thread already filtered withoutDeleted:`, thread.filters, { name: thread.name })\n\t}\n\n\tconst deletionLogs = rollingFilter(\n\t\tthread, // TODO: handle un-delection\n\t\t{ at: ['isDeleted', 'relation/isDeleted', 'block/isDeleted'], vl: true },\n\t\t{ name: 'isDeleted' },\n\t)\n\tVERBOSE.isEnabled &&\n\t\tVERBOSE(\n\t\t\t`withoutDeleted<${thread.nameAndSizeUntracked}> deletionLogs:`,\n\t\t\tuntracked(function expensiveAssUntrackedVerboseFx() {\n\t\t\t\treturn [...deletionLogs.applogs]\n\t\t\t}),\n\t\t)\n\tconst obsArrMapName = createDebugName({ caller: 'allDeletedEntities', thread })\n\tconst deleted = observableSetMap(function observableSetMapForDeleted() {\n\t\treturn deletionLogs.map(log => log.en)\n\t}, { name: obsArrMapName })\n\t// if (VERBOSE.isEnabled) VERBOSE(`withoutDeleted<${db.nameAndSize}> deleted:`, untracked(() => [...deleted]))\n\tif (VERBOSE.isEnabled) {\n\t\tautorun(() => {\n\t\t\tVERBOSE(`withoutDeleted<${thread.nameAndSizeUntracked}> deleted:`, [...deleted])\n\t\t})\n\t}\n\n\treturn rollingFilter(thread, { '!en': deleted }, { name: `withoutDeleted`, extraFilterName: 'withoutDeleted' })\n}, { equals: applogThreadComparer })\n\n// export const filterStatic = computedFnDeepCompare('filterStatic', function filterStatic(\n// thread: Thread,\n// pattern: DatalogQueryPattern,\n// opts: { name?: string } = {},\n// ) {\n// VERBOSE(`filterStatic<${thread.nameAndSizeUntracked}>:`, pattern)\n// if (!Object.entries(pattern).length) throw new Error(`Pattern is empty`)\n// //TODO: deprecaate in favor of rollingFilter ?\n// return new Thread(thread, thread.applogs.filter(applog => {\n// for (const [field, patternValue] of Object.entries(pattern)) {\n// const applogValue = applog[field.startsWith('!') ? field.slice(1) : field]\n// if (!matchPartStatic(field, patternValue, applogValue))\n// return false\n// }\n// return true\n// }), `${thread.name} | ${opts.name || `filterStatic{${stringify(pattern)}}`}`)\n// }, { equals: applogThreadComparer })\n\nexport const query = computedFnDeepCompare('query', function query(\n\tthreadOrLogs: Thread | Applog[],\n\tpatternOrPatterns: DatalogQueryPattern | DatalogQueryPattern[],\n\tstartVariables: SearchContext = {},\n\topts: { debug?: boolean } = {},\n) {\n\tconst thread = threadFromMaybeArray(threadOrLogs)\n\tDEBUG(`query<${thread.nameAndSizeUntracked}>:`, patternOrPatterns)\n\tconst patterns = (Array.isArray(patternOrPatterns) ? patternOrPatterns : [patternOrPatterns]) as DatalogQueryPattern[]\n\n\tlet nodes: QueryResult | null\n\tif (patterns.length === 1) {\n\t\t// We are the first step, so start from scratch\n\t\tnodes = null\n\t} else {\n\t\t// Run the previous step(s) first (= recursion)\n\t\tconst pattersExceptLast = patterns.slice(0, -1)\n\t\t// recursively call this function to have partial queries cacheable\n\t\tnodes = query(thread, pattersExceptLast, startVariables, opts)\n\t}\n\tconst lastPattern = patterns[patterns.length - 1]\n\tconst stepResult = queryStep(thread, nodes, lastPattern, opts)\n\tVERBOSE.isDisabled || autorun(() => VERBOSE(`query result:`, toJS(stepResult)))\n\treturn stepResult\n}, {\n\tequals: queryNodesComparer,\n\targsDebugName: (thread, pattern, startVars) =>\n\t\tcreateDebugName({ caller: 'query', thread, args: startVars ? { pattern, startVars } : pattern }),\n})\n\nexport const queryStep = computedFnDeepCompare('queryStep', function queryStep(\n\tthread: Thread,\n\tnodeSet: QueryResult | null,\n\tpattern: DatalogQueryPattern,\n\t// variables: SearchContext = {},\n\topts: { debug?: boolean } = {},\n) {\n\tDEBUG(`queryStep<${thread.nameAndSizeUntracked}> with`, nodeSet?.untrackedSize ?? 'all', 'nodes, pattern:', pattern)\n\tif (!Object.entries(pattern).length) throw new Error(`Pattern is empty`)\n\n\tfunction doQuery(node: QueryNode | null) {\n\t\tconst [patternWithResolvedVars, variablesToFill] = resolveOrRemoveVariables(pattern, node?.variables ?? {})\n\t\tVERBOSE(`[queryStep.doQuery] patternWithoutVars: `, patternWithResolvedVars)\n\t\tconst applogsMatchingStatic = rollingFilter(thread, patternWithResolvedVars)\n\t\tconst varMapper = createObjMapper(variablesToFill)\n\t\tconst resultNodes = observableArrayMap(function queryStepDoStep() {\n\t\t\tconst newVarsAndTheirLog = applogsMatchingStatic.map(log => ({ log, vars: varMapper(log) }))\n\t\t\tif (VERBOSE.isEnabled) {\n\t\t\t\tVERBOSE(\n\t\t\t\t\t`[queryStep.doQuery] step node:`,\n\t\t\t\t\tnode?.variables,\n\t\t\t\t\t' =>',\n\t\t\t\t\tnewVarsAndTheirLog,\n\t\t\t\t\t'from:',\n\t\t\t\t\tuntracked(() => applogsMatchingStatic.applogs),\n\t\t\t\t)\n\t\t\t}\n\n\t\t\treturn newVarsAndTheirLog.map(({ log, vars }) => {\n\t\t\t\tconst nodeVars = Object.assign({}, node?.variables, vars)\n\t\t\t\treturn new QueryNode(\n\t\t\t\t\t// TODO: ? Make single result nodes reactive using MappedThread - only really relevant if a result had multiple logs (or different paths would lead to the same result?)\n\t\t\t\t\t// ThreadInMemory.fromArray(\n\t\t\t\t\tStaticThread.fromArray(\n\t\t\t\t\t\t[log],\n\t\t\t\t\t\tcreateDebugName({\n\t\t\t\t\t\t\tcaller: 'QueryNode',\n\t\t\t\t\t\t\tthread: applogsMatchingStatic,\n\t\t\t\t\t\t\tpattern: `${stringify(nodeVars)}@${stringify(patternWithResolvedVars)}`,\n\t\t\t\t\t\t}),\n\t\t\t\t\t\t// true,\n\t\t\t\t\t),\n\t\t\t\t\tnodeVars,\n\t\t\t\t\tnode,\n\t\t\t\t)\n\t\t\t})\n\t\t}, { name: createDebugName({ caller: 'doQuery.mapNodes', thread: applogsMatchingStatic, pattern }) })\n\t\tif (VERBOSE.isEnabled) autorun(() => VERBOSE(`[queryStep.doQuery] resultNodes:`, [...resultNodes]))\n\t\tif (opts.debug) {\n\t\t\tLOG(\n\t\t\t\t`[queryStep] step result:`,\n\t\t\t\tuntracked(() =>\n\t\t\t\t\tresultNodes.map(({ variables, logsOfThisNode: thread }) => ({\n\t\t\t\t\t\tvariables,\n\t\t\t\t\t\tthread, // : /* util.inspect( */ thread.applogs, /* , { showHidden: false, depth: null }) */\n\t\t\t\t\t}))\n\t\t\t\t),\n\t\t\t)\n\t\t}\n\t\treturn resultNodes\n\t}\n\tconst observableResultNodes = observableArrayMap(\n\t\tfunction queryStepGetResults() {\n\t\t\tDEBUG(`[queryStep] Running with ${nodeSet?.nodes?.length} input nodes:`)\n\t\t\tif (!nodeSet) {\n\t\t\t\t// first query step\n\t\t\t\treturn [...doQuery(null)] // HACK copy array bc otherwise the observableArrayMap doesn't seem to depend on the contents somehow\n\t\t\t} else {\n\t\t\t\t// subsequent query steps\n\t\t\t\treturn [...nodeSet.nodes.flatMap(doQuery)]\n\t\t\t}\n\t\t},\n\t\t{ name: createDebugName({ caller: 'queryStep', thread, pattern }) },\n\t)\n\n\tif (VERBOSE.isEnabled) autorun(() => VERBOSE(`[queryStep] observableResultNodes:`, [...observableResultNodes]))\n\treturn new QueryResult(observableResultNodes)\n}, { equals: queryNodesComparer, argsDebugName: (thread, _nodes, pattern) => createDebugName({ caller: 'queryStep', thread, pattern }) })\n\nexport const queryNot = computedFnDeepCompare('queryNot', function queryNot( // TODO: update old-style query\n\tthread: Thread,\n\tstartNodes: QueryResult,\n\tpatternOrPatterns: DatalogQueryPattern | DatalogQueryPattern[],\n\topts: { debug?: boolean } = {},\n) {\n\tlet nodes = startNodes.nodes\n\tDEBUG.force(`queryNot<${thread.nameAndSizeUntracked}> from: ${nodes.length} nodes`)\n\tconst patterns = (Array.isArray(patternOrPatterns) ? patternOrPatterns : [patternOrPatterns]) as DatalogQueryPattern[]\n\n\tfor (const pattern of patterns) {\n\t\tif (!Object.entries(patternOrPatterns).length) throw new Error(`Pattern is empty`)\n\t\tnodes = nodes.filter(function innerNodeFilter({ /* applogs, */ variables }) {\n\t\t\tconst [patternWithResolvedVars, _variablesToFill] = resolveOrRemoveVariables(pattern, variables ?? {})\n\t\t\tVERBOSE(`[queryNot] patternWithoutVars: `, patternWithResolvedVars)\n\t\t\tconst newApplogs = rollingFilter(thread, patternWithResolvedVars)\n\t\t\tVERBOSE(`[queryNot] step node:`, variables, ' =>', newApplogs.size, 'applogs')\n\t\t\tVERBOSE.isDisabled || VERBOSE(`[queryNot] step node:`, variables, ' => empty?', untracked(() => newApplogs.applogs))\n\n\t\t\tif (opts.debug) LOG(`[queryNot] node result:`, variables, '=>', newApplogs.applogs)\n\t\t\treturn newApplogs.isEmpty\n\t\t})\n\t}\n\treturn new QueryResult(nodes)\n}, { equals: queryNodesComparer, argsDebugName: (thread, nodes, pattern) => createDebugName({ caller: 'queryNot', thread, pattern }) })\n\n// export function or(queries: QueryExecutor[]) {\n// return tagged(\n// `or{${stringify(queries)} } `,\n// function orExecutor(args: QueryExecutorArguments) {\n// const { db, nodes: contexts } = args\n// VERBOSE('[or]', { queries, contexts })\n// let results = []\n// for (const query of queries) {\n// const res = query(args)\n// VERBOSE('[or] query', query, 'result =>', res)\n// results.push(...res.nodes)\n// }\n// return { contexts: results }\n// }\n// )\n// }\n\n// export type Tagged<T> = T & { tag: string }\n// export function tagged<T>(tag: string, thing: T): Tagged<T> {\n// const e = thing as (T & { tag: string })\n// e.tag = tag\n// return e\n// }\n\n//////////////////////\n// COMPOSED QUERIES //\n//////////////////////\n// createDebugName({ caller: 'useKidRelations' }, true)\nexport const filterAndMap = computedFnDeepCompare('filterAndMap', function filterAndMap<R>(\n\tthread: Thread,\n\tpattern: DatalogQueryPattern,\n\tmapper: (keyof Applog) | (Partial<{ [key in keyof Applog]: string }>) | ((applog: Applog) => R),\n) {\n\tDEBUG(`filterAndMap<${thread.nameAndSizeUntracked}>`, pattern)\n\n\tconst filtered = rollingFilter(thread, pattern)\n\tVERBOSE(`[filterAndMap] filtered:`, filtered.untrackedSize)\n\tVERBOSE.isDisabled || autorun(() => VERBOSE(`[filterAndMap] filtered:`, filtered.applogs))\n\n\tconst name = createDebugName({ thread, pattern, caller: 'filterAndMap' })\n\tconst mapped = observableArrayMap<ApplogValue | any>(() => mapThreadWith(filtered, mapper), { name }) // TODO typing:? Record<string, ApplogValue> ?\n\tVERBOSE.isDisabled || autorun(() => VERBOSE(`[filterAndMap] mapped:`, mapped))\n\treturn mapped\n}, { equals: comparer.structural, argsDebugName: (thread, pattern) => createDebugName({ caller: 'filterAndMap', thread, pattern }) })\n\nexport const queryAndMap = computedFnDeepCompare('queryAndMap', function queryAndMap<R>(\n\tthreadOrLogs: Thread | Applog[],\n\tpatternOrPatterns: Parameters<typeof query>[1],\n\tmapDef: string | (Partial<{ [key in keyof SearchContext]: string }>) | ((record: SearchContext) => R),\n\tvariables: SearchContext = {},\n) {\n\tconst thread = threadFromMaybeArray(threadOrLogs)\n\tDEBUG(`queryAndMap<${thread.nameAndSizeUntracked}>`, { patternOrPatterns, variables, map: mapDef })\n\tconst debugName = createDebugName({ thread, caller: 'queryAndMap' })\n\n\tconst queryResult = query(thread, patternOrPatterns)\n\tVERBOSE(`[queryAndMap] filtered count:`, queryResult.untrackedSize)\n\tconst mapped = observableArrayMap<ApplogValue | any>(\n\t\t() => mapQueryResultWith(queryResult, mapDef),\n\t\t{ name: debugName },\n\t)\n\tVERBOSE.isDisabled || autorun(() => VERBOSE(`[queryAndMap] result:`, toJS(mapped)))\n\treturn mapped\n}, { equals: comparer.structural, argsDebugName: (thread, pattern) => createDebugName({ caller: 'queryAndMap', thread, pattern }) })\n\nexport const queryEntity = computedFnDeepCompare('queryEntity', function queryEntity(\n\tthread: Thread,\n\tname: string,\n\tentityID: EntityID,\n\tattributes: readonly string[],\n) {\n\tDEBUG(`queryEntity<${thread.nameAndSizeUntracked}>`, entityID, name)\n\n\tconst filtered = rollingFilter(thread, { en: entityID, at: prefixAttrs(name, attributes) })\n\tVERBOSE(`queryEntity applogs:`, filtered.applogs)\n\treturn computed(() =>\n\t\tfiltered.isEmpty ? null : Object.fromEntries(\n\t\t\tfiltered.map(({ at, vl }) => [at.slice(name.length + 1), vl]),\n\t\t)\n\t)\n}, {\n\tequals: computedStructuralComparer,\n\targsDebugName: (thread, name, entityID) => createDebugName({ caller: 'queryEntity', thread, args: { name, entityID } }),\n})\n\nexport const agentsOfThread = computedFnDeepCompare('agentsOfThread', function agentsOfThread(\n\tthread: Thread,\n) {\n\tDEBUG(`agentsOfThread<${thread.nameAndSizeUntracked}>`)\n\n\tconst mapped = observable.map<string, number>()\n\tconst onEvent = action((event: ThreadEvent) => {\n\t\tfor (const log of (isInitEvent(event) ? event.init : event.added)) {\n\t\t\tconst prev = mapped.get(log.ag) ?? 0\n\t\t\tmapped.set(log.ag, prev + 1)\n\t\t}\n\t\tfor (const log of (!isInitEvent(event) && event.removed || [])) {\n\t\t\tconst prev = mapped.get(log.ag)\n\t\t\tif (!prev || prev < 1) throw ERROR(`[agentsOfThread] number is now negative`, { log, event, mapped, prev })\n\t\t\tmapped.set(log.ag, prev - 1)\n\t\t}\n\t\tLOG(`agentsOfThread<${thread.nameAndSizeUntracked}> processed event`, { event, mapped })\n\t})\n\n\tonEvent({ init: thread.applogs })\n\tconst unsubscribe = thread.subscribe(onEvent)\n\tonBecomeObserved(mapped, unsubscribe)\n\n\treturn mapped\n})\n\nexport const entityOverlap = computedFnDeepCompare('entityOverlap', function entityOverlapCount(\n\tthreadA: Thread,\n\tthreadB: Thread,\n) {\n\tLOG(`entityOverlap<${threadA.nameAndSizeUntracked}, ${threadB.nameAndSizeUntracked}>`)\n\n\treturn computed(() => {\n\t\tconst entitiesA = new Set(threadA.map(log => log.en))\n\t\tconst entitiesB = new Set(threadB.map(log => log.en))\n\t\treturn [...entitiesA].filter(en => entitiesB.has(en))\n\t})\n})\n\nexport const entityOverlapMap = function entityOverlapMap(\n\tthreadA: Thread,\n\tthreadB: Thread,\n\tthreadAName = 'incoming',\n\tthreadBName = 'current',\n) {\n\tconst useInferredVM = (en, thread: Thread) => en\n\tconst overlapping = entityOverlap(threadA, threadB).get()\n\tconst mapped = new Map()\n\toverlapping.forEach(eachEntityID => (\n\t\tmapped.set(eachEntityID, {\n\t\t\t[threadAName]: useInferredVM(eachEntityID, threadA),\n\t\t\t[threadBName]: useInferredVM(eachEntityID, threadB),\n\t\t})\n\t))\n}\n\nexport const entityOverlapCount = computedFnDeepCompare(\n\t'entityOverlapCount',\n\tfunction entityOverlapCount(threadA: Thread, threadB: Thread) {\n\t\treturn computed(() => entityOverlap(threadA, threadB).get().length)\n\t},\n)\nexport const querySingle = computedFnDeepCompare('querySingle', function querySingle(\n\tthreadOrLogs: Thread | Applog[],\n\tpatternOrPatterns: Parameters<typeof query>[1],\n\tvariables: SearchContext = {},\n) {\n\tconst result = query(threadOrLogs, patternOrPatterns, variables)\n\treturn computed(() => {\n\t\tif (result.isEmpty) return null\n\t\tif (result.size > 1) throw ERROR(`[querySingle] got`, result.size, `results:`, result)\n\t\tconst logsOfThisNode = result.nodes[0].logsOfThisNode\n\t\tif (logsOfThisNode.size != 1) throw ERROR(`[querySingle] single result, but got`, logsOfThisNode.size, `logs:`, logsOfThisNode.applogs)\n\t\treturn logsOfThisNode.applogs[0]\n\t})\n}, {\n\tequals: comparer.structural,\n\targsDebugName: (thread, pattern) => createDebugName({ caller: 'querySingle', thread, pattern }),\n})\n\nexport const querySingleAndMap = computedFnDeepCompare(\n\t'querySingleAndMap',\n\tfunction querySingleAndMap<MAP extends (keyof Applog | (Partial<{ [key in keyof Applog]: string }>))>(\n\t\tthreadOrLogs: Thread | Applog[],\n\t\tpatternOrPatterns: Parameters<typeof query>[1],\n\t\tmapDef: MAP,\n\t\tvariables: SearchContext = {},\n\t) {\n\t\tconst resultBox = querySingle(threadOrLogs, patternOrPatterns, variables)\n\t\treturn computed<ApplogValue | { [key in keyof MAP]: ApplogValue } | null>(() => {\n\t\t\tconst log = resultBox.get()\n\t\t\tif (!log) return undefined\n\t\t\tif (typeof mapDef === 'string') {\n\t\t\t\treturn log[mapDef as string]\n\t\t\t} else {\n\t\t\t\treturn createObjMapper(mapDef)(log)\n\t\t\t}\n\t\t})\n\t},\n\t{\n\t\tequals: comparer.structural,\n\t\targsDebugName: (thread, pattern) => createDebugName({ caller: 'querySingleAndMap', thread, pattern }),\n\t},\n)\n/////////////\n// HELPERS //\n/////////////\n\nexport const mapThreadWith = function filterAndMapGetterFx<R>(\n\tthread: Thread,\n\tmapDef: (keyof Applog) | (Partial<{ [key in keyof Applog]: string }>) | ((applog: Applog) => R),\n) {\n\tif (typeof mapDef === 'function') {\n\t\treturn thread.map(mapDef)\n\t} else if (typeof mapDef === 'string') {\n\t\treturn thread.map(log => log[mapDef])\n\t} else {\n\t\treturn thread.map(createObjMapper(mapDef))\n\t}\n}\nexport const mapQueryResultWith = function filterAndMapGetterFx<R>(\n\tqueryResult: QueryResult,\n\tmapDef: string | (Partial<{ [key in keyof SearchContext]: string }>) | ((record: SearchContext) => R),\n) {\n\tif (typeof mapDef === 'function') {\n\t\treturn queryResult.records.map(mapDef)\n\t} else if (typeof mapDef === 'string') {\n\t\treturn queryResult.nodes.map((node) => {\n\t\t\tif (!Object.hasOwn(node.record, mapDef)) {\n\t\t\t\tif (node.logsOfThisNode.size !== 1) {\n\t\t\t\t\tthrow ERROR(`not sure what to map (it's not a var and a result node log count of ${node.logsOfThisNode.size})`)\n\t\t\t\t}\n\t\t\t\treturn node.logsOfThisNode.firstLog[mapDef]\n\t\t\t}\n\t\t\treturn node.record[mapDef]\n\t\t})\n\t} else {\n\t\treturn queryResult.nodes.map((node) => {\n\t\t\treturn createObjMapper(mapDef)(queryResult)\n\t\t})\n\t}\n}\n/**\n * Map Applog to custom named record, e.g.:\n * { en: 'movieID', vl: 'movieName' }\n * will map the applog to { movieID: .., movieName: .. }\n */\nexport function createObjMapper<FROM extends string, TO extends string>(applogFieldMap: Partial<{ [key in FROM]: TO }>) {\n\treturn (applog: { [key in FROM]: any }) => {\n\t\treturn Object.entries(applogFieldMap).reduce((acc, [key, value]) => {\n\t\t\tacc[value as TO] = applog[key]\n\t\t\treturn acc\n\t\t}, {} as Partial<{ [key in TO]: ApplogValue }>)\n\t}\n}\n\nexport function startsWith(str: string) {\n\treturn (value) => value.startsWith(str)\n}\n\nexport function prefixAttrs(prefix: string, attrs: readonly string[]) {\n\treturn attrs.map(at => prefixAt(prefix, at))\n}\nexport function prefixAt(prefix: string, attr: string) {\n\treturn `${prefix}/${attr}`\n}\nexport function threadFromMaybeArray(threadOrLogs: Thread | Applog[]) {\n\tif (!Array.isArray(threadOrLogs)) {\n\t\treturn threadOrLogs\n\t}\n\treturn ThreadInMemory.fromArray(threadOrLogs, `threadFromArray[${threadOrLogs.length}]`, true)\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 if (Number.MAX_SAFE_INTEGER && num > Number.MAX_SAFE_INTEGER) {\n encode.bytes = 0\n throw new RangeError('Could not encode varint')\n }\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 || shift > 49) {\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","export const empty = new Uint8Array(0)\n\nexport function toHex (d: Uint8Array): string {\n return d.reduce((hex, byte) => hex + byte.toString(16).padStart(2, '0'), '')\n}\n\nexport function fromHex (hex: string): Uint8Array {\n const hexes = hex.match(/../g)\n return hexes != null ? new Uint8Array(hexes.map(b => parseInt(b, 16))) : empty\n}\n\nexport function equals (aa: Uint8Array, bb: Uint8Array): boolean {\n if (aa === bb) return true\n if (aa.byteLength !== bb.byteLength) {\n return false\n }\n\n for (let ii = 0; ii < aa.byteLength; ii++) {\n if (aa[ii] !== bb[ii]) {\n return false\n }\n }\n\n return true\n}\n\nexport function coerce (o: ArrayBufferView | ArrayBuffer | Uint8Array): Uint8Array {\n if (o instanceof Uint8Array && o.constructor.name === 'Uint8Array') return o\n if (o instanceof ArrayBuffer) return new Uint8Array(o)\n if (ArrayBuffer.isView(o)) {\n return new Uint8Array(o.buffer, o.byteOffset, o.byteLength)\n }\n throw new Error('Unknown type, must be binary type')\n}\n\nexport function isBinary (o: unknown): o is ArrayBuffer | ArrayBufferView {\n return o instanceof ArrayBuffer || ArrayBuffer.isView(o)\n}\n\nexport function fromString (str: string): Uint8Array {\n return new TextEncoder().encode(str)\n}\n\nexport function toString (b: Uint8Array): string {\n return new TextDecoder().decode(b)\n}\n","/* eslint-disable */\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.\n/**\n * @param {string} ALPHABET\n * @param {any} name\n */\nfunction base (ALPHABET, name) {\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 /**\n * @param {any[] | Iterable<number>} source\n */\n function encode (source) {\n // @ts-ignore\n if (source instanceof Uint8Array) ; 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 /**\n * @param {string | string[]} source\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 /**\n * @param {string | string[]} string\n */\n function decode (string) {\n var buffer = decodeUnsafe(string);\n if (buffer) { return buffer }\n throw new Error(`Non-${name} character`)\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nvar src = base;\n\nvar _brrp__multiformats_scope_baseX = src;\n\nexport default _brrp__multiformats_scope_baseX;\n","import { coerce } from '../bytes.js'\nimport basex from '../vendor/base-x.js'\nimport type { BaseCodec, BaseDecoder, BaseEncoder, CombobaseDecoder, Multibase, MultibaseCodec, MultibaseDecoder, MultibaseEncoder, UnibaseDecoder } from './interface.js'\n\ninterface EncodeFn { (bytes: Uint8Array): string }\ninterface DecodeFn { (text: string): Uint8Array }\n\n/**\n * Class represents both BaseEncoder and MultibaseEncoder meaning it\n * can be used to encode to multibase or base encode without multibase\n * prefix.\n */\nclass Encoder<Base extends string, Prefix extends string> implements MultibaseEncoder<Prefix>, BaseEncoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseEncode: EncodeFn\n\n constructor (name: Base, prefix: Prefix, baseEncode: EncodeFn) {\n this.name = name\n this.prefix = prefix\n this.baseEncode = baseEncode\n }\n\n encode (bytes: Uint8Array): Multibase<Prefix> {\n if (bytes instanceof Uint8Array) {\n return `${this.prefix}${this.baseEncode(bytes)}`\n } else {\n throw Error('Unknown type, must be binary type')\n }\n }\n}\n\n/**\n * Class represents both BaseDecoder and MultibaseDecoder so it could be used\n * to decode multibases (with matching prefix) or just base decode strings\n * with corresponding base encoding.\n */\nclass Decoder<Base extends string, Prefix extends string> implements MultibaseDecoder<Prefix>, UnibaseDecoder<Prefix>, BaseDecoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseDecode: DecodeFn\n private readonly prefixCodePoint: number\n\n constructor (name: Base, prefix: Prefix, baseDecode: DecodeFn) {\n this.name = name\n this.prefix = prefix\n const prefixCodePoint = prefix.codePointAt(0)\n /* c8 ignore next 3 */\n if (prefixCodePoint === undefined) {\n throw new Error('Invalid prefix character')\n }\n this.prefixCodePoint = prefixCodePoint\n this.baseDecode = baseDecode\n }\n\n decode (text: string): Uint8Array {\n if (typeof text === 'string') {\n if (text.codePointAt(0) !== this.prefixCodePoint) {\n throw Error(`Unable to decode multibase string ${JSON.stringify(text)}, ${this.name} decoder only supports inputs prefixed with ${this.prefix}`)\n }\n return this.baseDecode(text.slice(this.prefix.length))\n } else {\n throw Error('Can only multibase decode strings')\n }\n }\n\n or<OtherPrefix extends string> (decoder: UnibaseDecoder<OtherPrefix> | ComposedDecoder<OtherPrefix>): ComposedDecoder<Prefix | OtherPrefix> {\n return or(this, decoder)\n }\n}\n\ntype Decoders<Prefix extends string> = Record<Prefix, UnibaseDecoder<Prefix>>\n\nclass ComposedDecoder<Prefix extends string> implements MultibaseDecoder<Prefix>, CombobaseDecoder<Prefix> {\n readonly decoders: Decoders<Prefix>\n\n constructor (decoders: Decoders<Prefix>) {\n this.decoders = decoders\n }\n\n or <OtherPrefix extends string> (decoder: UnibaseDecoder<OtherPrefix> | ComposedDecoder<OtherPrefix>): ComposedDecoder<Prefix | OtherPrefix> {\n return or(this, decoder)\n }\n\n decode (input: string): Uint8Array {\n const prefix = input[0] as Prefix\n const decoder = this.decoders[prefix]\n if (decoder != null) {\n return decoder.decode(input)\n } else {\n throw RangeError(`Unable to decode multibase string ${JSON.stringify(input)}, only inputs prefixed with ${Object.keys(this.decoders)} are supported`)\n }\n }\n}\n\nexport function or <L extends string, R extends string> (left: UnibaseDecoder<L> | CombobaseDecoder<L>, right: UnibaseDecoder<R> | CombobaseDecoder<R>): ComposedDecoder<L | R> {\n // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n return new ComposedDecoder({\n ...(left.decoders ?? { [(left as UnibaseDecoder<L>).prefix]: left }),\n ...(right.decoders ?? { [(right as UnibaseDecoder<R>).prefix]: right })\n } as Decoders<L | R>)\n}\n\nexport class Codec<Base extends string, Prefix extends string> implements MultibaseCodec<Prefix>, MultibaseEncoder<Prefix>, MultibaseDecoder<Prefix>, BaseCodec, BaseEncoder, BaseDecoder {\n readonly name: Base\n readonly prefix: Prefix\n readonly baseEncode: EncodeFn\n readonly baseDecode: DecodeFn\n readonly encoder: Encoder<Base, Prefix>\n readonly decoder: Decoder<Base, Prefix>\n\n constructor (name: Base, prefix: Prefix, baseEncode: EncodeFn, baseDecode: DecodeFn) {\n this.name = name\n this.prefix = prefix\n this.baseEncode = baseEncode\n this.baseDecode = baseDecode\n this.encoder = new Encoder(name, prefix, baseEncode)\n this.decoder = new Decoder(name, prefix, baseDecode)\n }\n\n encode (input: Uint8Array): string {\n return this.encoder.encode(input)\n }\n\n decode (input: string): Uint8Array {\n return this.decoder.decode(input)\n }\n}\n\nexport function from <Base extends string, Prefix extends string> ({ name, prefix, encode, decode }: { name: Base, prefix: Prefix, encode: EncodeFn, decode: DecodeFn }): Codec<Base, Prefix> {\n return new Codec(name, prefix, encode, decode)\n}\n\nexport function baseX <Base extends string, Prefix extends string> ({ name, prefix, alphabet }: { name: Base, prefix: Prefix, alphabet: string }): Codec<Base, Prefix> {\n const { encode, decode } = basex(alphabet, name)\n return from({\n prefix,\n name,\n encode,\n decode: (text: string): Uint8Array => coerce(decode(text))\n })\n}\n\nfunction decode (string: string, alphabet: string, bitsPerChar: number, name: string): Uint8Array {\n // Build the character lookup table:\n const codes: Record<string, number> = {}\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(`Non-${name} character`)\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))) !== 0) {\n throw new SyntaxError('Unexpected end of data')\n }\n\n return out\n}\n\nfunction encode (data: Uint8Array, alphabet: string, bitsPerChar: number): string {\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 !== 0) {\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) !== 0) {\n out += '='\n }\n }\n\n return out\n}\n\n/**\n * RFC4648 Factory\n */\nexport function rfc4648 <Base extends string, Prefix extends string> ({ name, prefix, bitsPerChar, alphabet }: { name: Base, prefix: Prefix, bitsPerChar: number, alphabet: string }): Codec<Base, Prefix> {\n return from({\n prefix,\n name,\n encode (input: Uint8Array): string {\n return encode(input, alphabet, bitsPerChar)\n },\n decode (input: string): Uint8Array {\n return decode(input, alphabet, bitsPerChar, name)\n }\n })\n}\n","import { rfc4648 } from './base.js'\n\nexport const base32 = rfc4648({\n prefix: 'b',\n name: 'base32',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567',\n bitsPerChar: 5\n})\n\nexport const base32upper = rfc4648({\n prefix: 'B',\n name: 'base32upper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567',\n bitsPerChar: 5\n})\n\nexport const base32pad = rfc4648({\n prefix: 'c',\n name: 'base32pad',\n alphabet: 'abcdefghijklmnopqrstuvwxyz234567=',\n bitsPerChar: 5\n})\n\nexport const base32padupper = rfc4648({\n prefix: 'C',\n name: 'base32padupper',\n alphabet: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=',\n bitsPerChar: 5\n})\n\nexport const base32hex = rfc4648({\n prefix: 'v',\n name: 'base32hex',\n alphabet: '0123456789abcdefghijklmnopqrstuv',\n bitsPerChar: 5\n})\n\nexport const base32hexupper = rfc4648({\n prefix: 'V',\n name: 'base32hexupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV',\n bitsPerChar: 5\n})\n\nexport const base32hexpad = rfc4648({\n prefix: 't',\n name: 'base32hexpad',\n alphabet: '0123456789abcdefghijklmnopqrstuv=',\n bitsPerChar: 5\n})\n\nexport const base32hexpadupper = rfc4648({\n prefix: 'T',\n name: 'base32hexpadupper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUV=',\n bitsPerChar: 5\n})\n\nexport const base32z = rfc4648({\n prefix: 'h',\n name: 'base32z',\n alphabet: 'ybndrfg8ejkmcpqxot1uwisza345h769',\n bitsPerChar: 5\n})\n","import { baseX } from './base.js'\n\nexport const base36 = baseX({\n prefix: 'k',\n name: 'base36',\n alphabet: '0123456789abcdefghijklmnopqrstuvwxyz'\n})\n\nexport const base36upper = baseX({\n prefix: 'K',\n name: 'base36upper',\n alphabet: '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n})\n","import { baseX } from './base.js'\n\nexport const base58btc = baseX({\n name: 'base58btc',\n prefix: 'z',\n alphabet: '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n})\n\nexport const base58flickr = baseX({\n name: 'base58flickr',\n prefix: 'Z',\n alphabet: '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'\n})\n","/* eslint-disable */\nvar encode_1 = encode;\n\nvar MSB = 0x80\n , REST = 0x7F\n , MSBALL = ~REST\n , INT = Math.pow(2, 31);\n\n/**\n * @param {number} num\n * @param {number[]} out\n * @param {number} offset\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 // @ts-ignore\n encode.bytes = offset - oldOffset + 1;\n \n return out\n}\n\nvar decode = read;\n\nvar MSB$1 = 0x80\n , REST$1 = 0x7F;\n\n/**\n * @param {string | any[]} buf\n * @param {number} offset\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 // @ts-ignore\n read.bytes = 0;\n throw new RangeError('Could not decode varint')\n }\n b = buf[counter++];\n res += shift < 28\n ? (b & REST$1) << shift\n : (b & REST$1) * Math.pow(2, shift);\n shift += 7;\n } while (b >= MSB$1)\n\n // @ts-ignore\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\nvar length = function (/** @type {number} */ 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\nvar varint = {\n encode: encode_1\n , decode: decode\n , encodingLength: length\n};\n\nvar _brrp_varint = varint;\n\nexport default _brrp_varint;\n","import varint from './vendor/varint.js'\n\nexport function decode (data: Uint8Array, offset = 0): [number, number] {\n const code = varint.decode(data, offset)\n return [code, varint.decode.bytes]\n}\n\nexport function encodeTo (int: number, target: Uint8Array, offset = 0): Uint8Array {\n varint.encode(int, target, offset)\n return target\n}\n\nexport function encodingLength (int: number): number {\n return varint.encodingLength(int)\n}\n","import { coerce, equals as equalBytes } from '../bytes.js'\nimport * as varint from '../varint.js'\nimport type { MultihashDigest } from './interface.js'\n\n/**\n * Creates a multihash digest.\n */\nexport function create <Code extends number> (code: Code, digest: Uint8Array): Digest<Code, number> {\n const size = digest.byteLength\n const sizeOffset = varint.encodingLength(code)\n const digestOffset = sizeOffset + varint.encodingLength(size)\n\n const bytes = new Uint8Array(digestOffset + size)\n varint.encodeTo(code, bytes, 0)\n varint.encodeTo(size, bytes, sizeOffset)\n bytes.set(digest, digestOffset)\n\n return new Digest(code, size, digest, bytes)\n}\n\n/**\n * Turns bytes representation of multihash digest into an instance.\n */\nexport function decode (multihash: Uint8Array): MultihashDigest {\n const bytes = coerce(multihash)\n const [code, sizeOffset] = varint.decode(bytes)\n const [size, digestOffset] = varint.decode(bytes.subarray(sizeOffset))\n const digest = bytes.subarray(sizeOffset + digestOffset)\n\n if (digest.byteLength !== size) {\n throw new Error('Incorrect length')\n }\n\n return new Digest(code, size, digest, bytes)\n}\n\nexport function equals (a: MultihashDigest, b: unknown): b is MultihashDigest {\n if (a === b) {\n return true\n } else {\n const data = b as { code?: unknown, size?: unknown, bytes?: unknown }\n\n return (\n a.code === data.code &&\n a.size === data.size &&\n data.bytes instanceof Uint8Array &&\n equalBytes(a.bytes, data.bytes)\n )\n }\n}\n\n/**\n * Represents a multihash digest which carries information about the\n * hashing algorithm and an actual hash digest.\n */\nexport class Digest<Code extends number, Size extends number> implements MultihashDigest {\n readonly code: Code\n readonly size: Size\n readonly digest: Uint8Array\n readonly bytes: Uint8Array\n\n /**\n * Creates a multihash digest.\n */\n constructor (code: Code, size: Size, digest: Uint8Array, bytes: Uint8Array) {\n this.code = code\n this.size = size\n this.digest = digest\n this.bytes = bytes\n }\n}\n\n/**\n * Used to check that the passed multihash has the passed code\n */\nexport function hasCode <T extends number> (digest: MultihashDigest, code: T): digest is MultihashDigest<T> {\n return digest.code === code\n}\n","import { base32 } from './bases/base32.js'\nimport { base36 } from './bases/base36.js'\nimport { base58btc } from './bases/base58.js'\nimport { coerce } from './bytes.js'\nimport * as Digest from './hashes/digest.js'\nimport * as varint from './varint.js'\nimport type * as API from './link/interface.js'\n\n// This way TS will also expose all the types from module\nexport * from './link/interface.js'\n\nexport function format <T extends API.Link<unknown, number, number, API.Version>, Prefix extends string> (link: T, base?: API.MultibaseEncoder<Prefix>): API.ToString<T, Prefix> {\n const { bytes, version } = link\n switch (version) {\n case 0:\n return toStringV0(\n bytes,\n baseCache(link),\n base as API.MultibaseEncoder<'z'> ?? base58btc.encoder\n )\n default:\n return toStringV1(\n bytes,\n baseCache(link),\n (base ?? base32.encoder) as API.MultibaseEncoder<Prefix>\n )\n }\n}\n\nexport function toJSON <Link extends API.UnknownLink> (link: Link): API.LinkJSON<Link> {\n return {\n '/': format(link)\n }\n}\n\nexport function fromJSON <Link extends API.UnknownLink> (json: API.LinkJSON<Link>): CID<unknown, number, number, API.Version> {\n return CID.parse(json['/'])\n}\n\nconst cache = new WeakMap<API.UnknownLink, Map<string, string>>()\n\nfunction baseCache (cid: API.UnknownLink): Map<string, string> {\n const baseCache = cache.get(cid)\n if (baseCache == null) {\n const baseCache = new Map()\n cache.set(cid, baseCache)\n return baseCache\n }\n return baseCache\n}\n\nexport class CID<Data = unknown, Format extends number = number, Alg extends number = number, Version extends API.Version = API.Version> implements API.Link<Data, Format, Alg, Version> {\n readonly code: Format\n readonly version: Version\n readonly multihash: API.MultihashDigest<Alg>\n readonly bytes: Uint8Array\n readonly '/': Uint8Array\n\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param multihash - (Multi)hash of the of the content.\n */\n constructor (version: Version, code: Format, multihash: API.MultihashDigest<Alg>, bytes: Uint8Array) {\n this.code = code\n this.version = version\n this.multihash = multihash\n this.bytes = bytes\n\n // flag to serializers that this is a CID and\n // should be treated specially\n this['/'] = bytes\n }\n\n /**\n * Signalling `cid.asCID === cid` has been replaced with `cid['/'] === cid.bytes`\n * please either use `CID.asCID(cid)` or switch to new signalling mechanism\n *\n * @deprecated\n */\n get asCID (): this {\n return this\n }\n\n // ArrayBufferView\n get byteOffset (): number {\n return this.bytes.byteOffset\n }\n\n // ArrayBufferView\n get byteLength (): number {\n return this.bytes.byteLength\n }\n\n toV0 (): CID<Data, API.DAG_PB, API.SHA_256, 0> {\n switch (this.version) {\n case 0: {\n return this as CID<Data, API.DAG_PB, API.SHA_256, 0>\n }\n case 1: {\n const { code, multihash } = this\n\n if (code !== DAG_PB_CODE) {\n throw new Error('Cannot convert a non dag-pb CID to CIDv0')\n }\n\n // sha2-256\n if (multihash.code !== SHA_256_CODE) {\n throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0')\n }\n\n return (\n CID.createV0(\n multihash as API.MultihashDigest<API.SHA_256>\n )\n )\n }\n default: {\n throw Error(\n `Can not convert CID version ${this.version} to version 0. This is a bug please report`\n )\n }\n }\n }\n\n toV1 (): CID<Data, Format, Alg, 1> {\n switch (this.version) {\n case 0: {\n const { code, digest } = this.multihash\n const multihash = Digest.create(code, digest)\n return (\n CID.createV1(this.code, multihash)\n )\n }\n case 1: {\n return this as CID<Data, Format, Alg, 1>\n }\n default: {\n throw Error(\n `Can not convert CID version ${this.version} to version 1. This is a bug please report`\n )\n }\n }\n }\n\n equals (other: unknown): other is CID<Data, Format, Alg, Version> {\n return CID.equals(this, other)\n }\n\n static equals <Data, Format extends number, Alg extends number, Version extends API.Version>(self: API.Link<Data, Format, Alg, Version>, other: unknown): other is CID {\n const unknown = other as { code?: unknown, version?: unknown, multihash?: unknown }\n return (\n unknown != null &&\n self.code === unknown.code &&\n self.version === unknown.version &&\n Digest.equals(self.multihash, unknown.multihash)\n )\n }\n\n toString (base?: API.MultibaseEncoder<string>): string {\n return format(this, base)\n }\n\n toJSON (): API.LinkJSON<this> {\n return { '/': format(this) }\n }\n\n link (): this {\n return this\n }\n\n readonly [Symbol.toStringTag] = 'CID';\n\n // Legacy\n\n [Symbol.for('nodejs.util.inspect.custom')] (): string {\n return `CID(${this.toString()})`\n }\n\n /**\n * Takes any input `value` and returns a `CID` instance if it was\n * a `CID` otherwise returns `null`. If `value` is instanceof `CID`\n * it will return value back. If `value` is not instance of this CID\n * class, but is compatible CID it will return new instance of this\n * `CID` class. Otherwise returns null.\n *\n * This allows two different incompatible versions of CID library to\n * co-exist and interop as long as binary interface is compatible.\n */\n static asCID <Data, Format extends number, Alg extends number, Version extends API.Version, U>(input: API.Link<Data, Format, Alg, Version> | U): CID<Data, Format, Alg, Version> | null {\n if (input == null) {\n return null\n }\n\n const value = input as any\n if (value instanceof CID) {\n // If value is instance of CID then we're all set.\n return value\n } else if ((value['/'] != null && value['/'] === value.bytes) || value.asCID === value) {\n // If value isn't instance of this CID class but `this.asCID === this` or\n // `value['/'] === value.bytes` is true it is CID instance coming from a\n // different implementation (diff version or duplicate). In that case we\n // rebase it to this `CID` implementation so caller is guaranteed to get\n // instance with expected API.\n const { version, code, multihash, bytes } = value\n return new CID(\n version,\n code,\n multihash as API.MultihashDigest<Alg>,\n bytes ?? encodeCID(version, code, multihash.bytes)\n )\n } else if (value[cidSymbol] === true) {\n // If value is a CID from older implementation that used to be tagged via\n // symbol we still rebase it to the this `CID` implementation by\n // delegating that to a constructor.\n const { version, multihash, code } = value\n const digest = Digest.decode(multihash) as API.MultihashDigest<Alg>\n return CID.create(version, code, digest)\n } else {\n // Otherwise value is not a CID (or an incompatible version of it) in\n // which case we return `null`.\n return null\n }\n }\n\n /**\n * @param version - Version of the CID\n * @param code - Code of the codec content is encoded in, see https://github.com/multiformats/multicodec/blob/master/table.csv\n * @param digest - (Multi)hash of the of the content.\n */\n static create <Data, Format extends number, Alg extends number, Version extends API.Version>(version: Version, code: Format, digest: API.MultihashDigest<Alg>): CID<Data, Format, Alg, Version> {\n if (typeof code !== 'number') {\n throw new Error('String codecs are no longer supported')\n }\n\n if (!(digest.bytes instanceof Uint8Array)) {\n throw new Error('Invalid digest')\n }\n\n switch (version) {\n case 0: {\n if (code !== DAG_PB_CODE) {\n throw new Error(\n `Version 0 CID must use dag-pb (code: ${DAG_PB_CODE}) block encoding`\n )\n } else {\n return new CID(version, code, digest, digest.bytes)\n }\n }\n case 1: {\n const bytes = encodeCID(version, code, digest.bytes)\n return new CID(version, code, digest, bytes)\n }\n default: {\n throw new Error('Invalid version')\n }\n }\n }\n\n /**\n * Simplified version of `create` for CIDv0.\n */\n static createV0 <T = unknown>(digest: API.MultihashDigest<typeof SHA_256_CODE>): CID<T, typeof DAG_PB_CODE, typeof SHA_256_CODE, 0> {\n return CID.create(0, DAG_PB_CODE, digest)\n }\n\n /**\n * Simplified version of `create` for CIDv1.\n *\n * @param code - Content encoding format code.\n * @param digest - Multihash of the content.\n */\n static createV1 <Data, Code extends number, Alg extends number>(code: Code, digest: API.MultihashDigest<Alg>): CID<Data, Code, Alg, 1> {\n return CID.create(1, code, digest)\n }\n\n /**\n * Decoded a CID from its binary representation. The byte array must contain\n * only the CID with no additional bytes.\n *\n * An error will be thrown if the bytes provided do not contain a valid\n * binary representation of a CID.\n */\n static decode <Data, Code extends number, Alg extends number, Version extends API.Version>(bytes: API.ByteView<API.Link<Data, Code, Alg, Version>>): CID<Data, Code, Alg, Version> {\n const [cid, remainder] = CID.decodeFirst(bytes)\n if (remainder.length !== 0) {\n throw new Error('Incorrect length')\n }\n return cid\n }\n\n /**\n * Decoded a CID from its binary representation at the beginning of a byte\n * array.\n *\n * Returns an array with the first element containing the CID and the second\n * element containing the remainder of the original byte array. The remainder\n * will be a zero-length byte array if the provided bytes only contained a\n * binary CID representation.\n */\n static decodeFirst <T, C extends number, A extends number, V extends API.Version>(bytes: API.ByteView<API.Link<T, C, A, V>>): [CID<T, C, A, V>, Uint8Array] {\n const specs = CID.inspectBytes(bytes)\n const prefixSize = specs.size - specs.multihashSize\n const multihashBytes = coerce(\n bytes.subarray(prefixSize, prefixSize + specs.multihashSize)\n )\n if (multihashBytes.byteLength !== specs.multihashSize) {\n throw new Error('Incorrect length')\n }\n const digestBytes = multihashBytes.subarray(\n specs.multihashSize - specs.digestSize\n )\n const digest = new Digest.Digest(\n specs.multihashCode,\n specs.digestSize,\n digestBytes,\n multihashBytes\n )\n const cid =\n specs.version === 0\n ? CID.createV0(digest as API.MultihashDigest<API.SHA_256>)\n : CID.createV1(specs.codec, digest)\n return [cid as CID<T, C, A, V>, bytes.subarray(specs.size)]\n }\n\n /**\n * Inspect the initial bytes of a CID to determine its properties.\n *\n * Involves decoding up to 4 varints. Typically this will require only 4 to 6\n * bytes but for larger multicodec code values and larger multihash digest\n * lengths these varints can be quite large. It is recommended that at least\n * 10 bytes be made available in the `initialBytes` argument for a complete\n * inspection.\n */\n static inspectBytes <T, C extends number, A extends number, V extends API.Version>(initialBytes: API.ByteView<API.Link<T, C, A, V>>): { version: V, codec: C, multihashCode: A, digestSize: number, multihashSize: number, size: number } {\n let offset = 0\n const next = (): number => {\n const [i, length] = varint.decode(initialBytes.subarray(offset))\n offset += length\n return i\n }\n\n let version = next() as V\n let codec = DAG_PB_CODE as C\n if (version as number === 18) {\n // CIDv0\n version = 0 as V\n offset = 0\n } else {\n codec = next() as C\n }\n\n if (version !== 0 && version !== 1) {\n throw new RangeError(`Invalid CID version ${version}`)\n }\n\n const prefixSize = offset\n const multihashCode = next() as A // multihash code\n const digestSize = next() // multihash length\n const size = offset + digestSize\n const multihashSize = size - prefixSize\n\n return { version, codec, multihashCode, digestSize, multihashSize, size }\n }\n\n /**\n * Takes cid in a string representation and creates an instance. If `base`\n * decoder is not provided will use a default from the configuration. It will\n * throw an error if encoding of the CID is not compatible with supplied (or\n * a default decoder).\n */\n static parse <Prefix extends string, Data, Code extends number, Alg extends number, Version extends API.Version>(source: API.ToString<API.Link<Data, Code, Alg, Version>, Prefix>, base?: API.MultibaseDecoder<Prefix>): CID<Data, Code, Alg, Version> {\n const [prefix, bytes] = parseCIDtoBytes(source, base)\n\n const cid = CID.decode(bytes)\n\n if (cid.version === 0 && source[0] !== 'Q') {\n throw Error('Version 0 CID string must not include multibase prefix')\n }\n\n // Cache string representation to avoid computing it on `this.toString()`\n baseCache(cid).set(prefix, source)\n\n return cid\n }\n}\n\nfunction parseCIDtoBytes <Prefix extends string, Data, Code extends number, Alg extends number, Version extends API.Version> (source: API.ToString<API.Link<Data, Code, Alg, Version>, Prefix>, base?: API.MultibaseDecoder<Prefix>): [Prefix, API.ByteView<API.Link<Data, Code, Alg, Version>>] {\n switch (source[0]) {\n // CIDv0 is parsed differently\n case 'Q': {\n const decoder = base ?? base58btc\n return [\n base58btc.prefix as Prefix,\n decoder.decode(`${base58btc.prefix}${source}`)\n ]\n }\n case base58btc.prefix: {\n const decoder = base ?? base58btc\n return [base58btc.prefix as Prefix, decoder.decode(source)]\n }\n case base32.prefix: {\n const decoder = base ?? base32\n return [base32.prefix as Prefix, decoder.decode(source)]\n }\n case base36.prefix: {\n const decoder = base ?? base36\n return [base36.prefix as Prefix, decoder.decode(source)]\n }\n default: {\n if (base == null) {\n throw Error(\n 'To parse non base32, base36 or base58btc encoded CID multibase decoder must be provided'\n )\n }\n return [source[0] as Prefix, base.decode(source)]\n }\n }\n}\n\nfunction toStringV0 (bytes: Uint8Array, cache: Map<string, string>, base: API.MultibaseEncoder<'z'>): string {\n const { prefix } = base\n if (prefix !== base58btc.prefix) {\n throw Error(`Cannot string encode V0 in ${base.name} encoding`)\n }\n\n const cid = cache.get(prefix)\n if (cid == null) {\n const cid = base.encode(bytes).slice(1)\n cache.set(prefix, cid)\n return cid\n } else {\n return cid\n }\n}\n\nfunction toStringV1 <Prefix extends string> (bytes: Uint8Array, cache: Map<string, string>, base: API.MultibaseEncoder<Prefix>): string {\n const { prefix } = base\n const cid = cache.get(prefix)\n if (cid == null) {\n const cid = base.encode(bytes)\n cache.set(prefix, cid)\n return cid\n } else {\n return cid\n }\n}\n\nconst DAG_PB_CODE = 0x70\nconst SHA_256_CODE = 0x12\n\nfunction encodeCID (version: API.Version, code: number, multihash: Uint8Array): Uint8Array {\n const codeOffset = varint.encodingLength(version)\n const hashOffset = codeOffset + varint.encodingLength(code)\n const bytes = new Uint8Array(hashOffset + multihash.byteLength)\n varint.encodeTo(version, bytes, 0)\n varint.encodeTo(code, bytes, codeOffset)\n bytes.set(multihash, hashOffset)\n return bytes\n}\n\nconst cidSymbol = Symbol.for('@ipld/js-cid/CID')\n","import * as cborg from 'cborg'\nimport { CID } from 'multiformats/cid'\n\n// https://github.com/ipfs/go-ipfs/issues/3570#issuecomment-273931692\nconst CID_CBOR_TAG = 42\n\n/**\n * @template T\n * @typedef {import('multiformats/codecs/interface').ByteView<T>} ByteView\n */\n\n/**\n * cidEncoder will receive all Objects during encode, it needs to filter out\n * anything that's not a CID and return `null` for that so it's encoded as\n * normal.\n *\n * @param {any} obj\n * @returns {cborg.Token[]|null}\n */\nfunction cidEncoder (obj) {\n if (obj.asCID !== obj && obj['/'] !== obj.bytes) {\n return null // any other kind of object\n }\n const cid = CID.asCID(obj)\n /* c8 ignore next 4 */\n // very unlikely case, and it'll probably throw a recursion error in cborg\n if (!cid) {\n return null\n }\n const bytes = new Uint8Array(cid.bytes.byteLength + 1)\n bytes.set(cid.bytes, 1) // prefix is 0x00, for historical reasons\n return [\n new cborg.Token(cborg.Type.tag, CID_CBOR_TAG),\n new cborg.Token(cborg.Type.bytes, bytes)\n ]\n}\n\n// eslint-disable-next-line jsdoc/require-returns-check\n/**\n * Intercept all `undefined` values from an object walk and reject the entire\n * object if we find one.\n *\n * @returns {null}\n */\nfunction undefinedEncoder () {\n throw new Error('`undefined` is not supported by the IPLD Data Model and cannot be encoded')\n}\n\n/**\n * Intercept all `number` values from an object walk and reject the entire\n * object if we find something that doesn't fit the IPLD data model (NaN &\n * Infinity).\n *\n * @param {number} num\n * @returns {null}\n */\nfunction numberEncoder (num) {\n if (Number.isNaN(num)) {\n throw new Error('`NaN` is not supported by the IPLD Data Model and cannot be encoded')\n }\n if (num === Infinity || num === -Infinity) {\n throw new Error('`Infinity` and `-Infinity` is not supported by the IPLD Data Model and cannot be encoded')\n }\n return null\n}\n\nconst _encodeOptions = {\n float64: true,\n typeEncoders: {\n Object: cidEncoder,\n undefined: undefinedEncoder,\n number: numberEncoder\n }\n}\n\nexport const encodeOptions = {\n ..._encodeOptions,\n typeEncoders: {\n ..._encodeOptions.typeEncoders\n }\n}\n\n/**\n * @param {Uint8Array} bytes\n * @returns {CID}\n */\nfunction cidDecoder (bytes) {\n if (bytes[0] !== 0) {\n throw new Error('Invalid CID for CBOR tag 42; expected leading 0x00')\n }\n return CID.decode(bytes.subarray(1)) // ignore leading 0x00\n}\n\nconst _decodeOptions = {\n allowIndefinite: false,\n coerceUndefinedToNull: true,\n allowNaN: false,\n allowInfinity: false,\n allowBigInt: true, // this will lead to BigInt for ints outside of\n // safe-integer range, which may surprise users\n strict: true,\n useMaps: false,\n rejectDuplicateMapKeys: true,\n /** @type {import('cborg').TagDecoder[]} */\n tags: []\n}\n_decodeOptions.tags[CID_CBOR_TAG] = cidDecoder\n\nexport const decodeOptions = {\n ..._decodeOptions,\n tags: _decodeOptions.tags.slice()\n}\n\nexport const name = 'dag-cbor'\nexport const code = 0x71\n\n/**\n * @template T\n * @param {T} node\n * @returns {ByteView<T>}\n */\nexport const encode = (node) => cborg.encode(node, _encodeOptions)\n\n/**\n * @template T\n * @param {ByteView<T>} data\n * @returns {T}\n */\nexport const decode = (data) => cborg.decode(data, _decodeOptions)\n","import varint from 'varint'\n\nexport const CIDV0_BYTES = {\n SHA2_256: 0x12,\n LENGTH: 0x20,\n DAG_PB: 0x70\n}\n\nexport const V2_HEADER_LENGTH = /* characteristics */ 16 /* v1 offset */ + 8 /* v1 size */ + 8 /* index offset */ + 8\n\n/**\n * Decodes varint and seeks the buffer\n *\n * ```js\n * // needs bytes to be read first\n * const bytes = reader.upTo(8) // maybe async\n * ```\n *\n * @param {Uint8Array} bytes\n * @param {import('./coding').Seekable} seeker\n * @returns {number}\n */\nexport function decodeVarint (bytes, seeker) {\n if (!bytes.length) {\n throw new Error('Unexpected end of data')\n }\n const i = varint.decode(bytes)\n seeker.seek(/** @type {number} */(varint.decode.bytes))\n return i\n}\n\n/**\n * Decode v2 header\n *\n * ```js\n * // needs bytes to be read first\n * const bytes = reader.exactly(V2_HEADER_LENGTH, true) // maybe async\n * ```\n *\n * @param {Uint8Array} bytes\n * @returns {import('./coding').CarV2FixedHeader}\n */\nexport function decodeV2Header (bytes) {\n const dv = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength)\n let offset = 0\n const header = {\n version: 2,\n /** @type {[bigint, bigint]} */\n characteristics: [\n dv.getBigUint64(offset, true),\n dv.getBigUint64(offset += 8, true)\n ],\n dataOffset: Number(dv.getBigUint64(offset += 8, true)),\n dataSize: Number(dv.getBigUint64(offset += 8, true)),\n indexOffset: Number(dv.getBigUint64(offset += 8, true))\n }\n return header\n}\n\n/**\n * Checks the length of the multihash to be read afterwards\n *\n * ```js\n * // needs bytes to be read first\n * const bytes = reader.upTo(8) // maybe async\n * ```\n *\n * @param {Uint8Array} bytes\n */\nexport function getMultihashLength (bytes) {\n // | code | length | .... |\n // where both code and length are varints, so we have to decode\n // them first before we can know total length\n\n varint.decode(bytes) // code\n const codeLength = /** @type {number} */(varint.decode.bytes)\n const length = varint.decode(bytes.subarray(varint.decode.bytes))\n const lengthLength = /** @type {number} */(varint.decode.bytes)\n const mhLength = codeLength + lengthLength + length\n\n return mhLength\n}\n","/** Auto-generated with @ipld/schema@v4.2.0 at Thu Sep 14 2023 from IPLD Schema:\n *\n * # CarV1HeaderOrV2Pragma is a more relaxed form, and can parse {version:x} where\n * # roots are optional. This is typically useful for the {verison:2} CARv2\n * # pragma.\n *\n * type CarV1HeaderOrV2Pragma struct {\n * \troots optional [&Any]\n * \t# roots is _not_ optional for CarV1 but we defer that check within code to\n * \t# gracefully handle the V2 case where it's just {version:X}\n * \tversion Int\n * }\n *\n * # CarV1Header is the strict form of the header, and requires roots to be\n * # present. This is compatible with the CARv1 specification.\n *\n * # type CarV1Header struct {\n * # \troots [&Any]\n * # \tversion Int\n * # }\n *\n */\n\nconst Kinds = {\n Null: /** @returns {undefined|null} */ (/** @type {any} */ obj) => obj === null ? obj : undefined,\n Int: /** @returns {undefined|number} */ (/** @type {any} */ obj) => Number.isInteger(obj) ? obj : undefined,\n Float: /** @returns {undefined|number} */ (/** @type {any} */ obj) => typeof obj === 'number' && Number.isFinite(obj) ? obj : undefined,\n String: /** @returns {undefined|string} */ (/** @type {any} */ obj) => typeof obj === 'string' ? obj : undefined,\n Bool: /** @returns {undefined|boolean} */ (/** @type {any} */ obj) => typeof obj === 'boolean' ? obj : undefined,\n Bytes: /** @returns {undefined|Uint8Array} */ (/** @type {any} */ obj) => obj instanceof Uint8Array ? obj : undefined,\n Link: /** @returns {undefined|object} */ (/** @type {any} */ obj) => obj !== null && typeof obj === 'object' && obj.asCID === obj ? obj : undefined,\n List: /** @returns {undefined|Array<any>} */ (/** @type {any} */ obj) => Array.isArray(obj) ? obj : undefined,\n Map: /** @returns {undefined|object} */ (/** @type {any} */ obj) => obj !== null && typeof obj === 'object' && obj.asCID !== obj && !Array.isArray(obj) && !(obj instanceof Uint8Array) ? obj : undefined\n}\n/** @type {{ [k in string]: (obj:any)=>undefined|any}} */\nconst Types = {\n 'CarV1HeaderOrV2Pragma > roots (anon) > valueType (anon)': Kinds.Link,\n 'CarV1HeaderOrV2Pragma > roots (anon)': /** @returns {undefined|any} */ (/** @type {any} */ obj) => {\n if (Kinds.List(obj) === undefined) {\n return undefined\n }\n for (let i = 0; i < obj.length; i++) {\n let v = obj[i]\n v = Types['CarV1HeaderOrV2Pragma > roots (anon) > valueType (anon)'](v)\n if (v === undefined) {\n return undefined\n }\n if (v !== obj[i]) {\n const ret = obj.slice(0, i)\n for (let j = i; j < obj.length; j++) {\n let v = obj[j]\n v = Types['CarV1HeaderOrV2Pragma > roots (anon) > valueType (anon)'](v)\n if (v === undefined) {\n return undefined\n }\n ret.push(v)\n }\n return ret\n }\n }\n return obj\n },\n Int: Kinds.Int,\n CarV1HeaderOrV2Pragma: /** @returns {undefined|any} */ (/** @type {any} */ obj) => {\n if (Kinds.Map(obj) === undefined) {\n return undefined\n }\n const entries = Object.entries(obj)\n /** @type {{[k in string]: any}} */\n let ret = obj\n let requiredCount = 1\n for (let i = 0; i < entries.length; i++) {\n const [key, value] = entries[i]\n switch (key) {\n case 'roots':\n {\n const v = Types['CarV1HeaderOrV2Pragma > roots (anon)'](obj[key])\n if (v === undefined) {\n return undefined\n }\n if (v !== value || ret !== obj) {\n if (ret === obj) {\n /** @type {{[k in string]: any}} */\n ret = {}\n for (let j = 0; j < i; j++) {\n ret[entries[j][0]] = entries[j][1]\n }\n }\n ret.roots = v\n }\n }\n break\n case 'version':\n {\n requiredCount--\n const v = Types.Int(obj[key])\n if (v === undefined) {\n return undefined\n }\n if (v !== value || ret !== obj) {\n if (ret === obj) {\n /** @type {{[k in string]: any}} */\n ret = {}\n for (let j = 0; j < i; j++) {\n ret[entries[j][0]] = entries[j][1]\n }\n }\n ret.version = v\n }\n }\n break\n default:\n return undefined\n }\n }\n\n if (requiredCount > 0) {\n return undefined\n }\n return ret\n }\n}\n/** @type {{ [k in string]: (obj:any)=>undefined|any}} */\nconst Reprs = {\n 'CarV1HeaderOrV2Pragma > roots (anon) > valueType (anon)': Kinds.Link,\n 'CarV1HeaderOrV2Pragma > roots (anon)': /** @returns {undefined|any} */ (/** @type {any} */ obj) => {\n if (Kinds.List(obj) === undefined) {\n return undefined\n }\n for (let i = 0; i < obj.length; i++) {\n let v = obj[i]\n v = Reprs['CarV1HeaderOrV2Pragma > roots (anon) > valueType (anon)'](v)\n if (v === undefined) {\n return undefined\n }\n if (v !== obj[i]) {\n const ret = obj.slice(0, i)\n for (let j = i; j < obj.length; j++) {\n let v = obj[j]\n v = Reprs['CarV1HeaderOrV2Pragma > roots (anon) > valueType (anon)'](v)\n if (v === undefined) {\n return undefined\n }\n ret.push(v)\n }\n return ret\n }\n }\n return obj\n },\n Int: Kinds.Int,\n CarV1HeaderOrV2Pragma: /** @returns {undefined|any} */ (/** @type {any} */ obj) => {\n if (Kinds.Map(obj) === undefined) {\n return undefined\n }\n const entries = Object.entries(obj)\n /** @type {{[k in string]: any}} */\n let ret = obj\n let requiredCount = 1\n for (let i = 0; i < entries.length; i++) {\n const [key, value] = entries[i]\n switch (key) {\n case 'roots':\n {\n const v = Reprs['CarV1HeaderOrV2Pragma > roots (anon)'](value)\n if (v === undefined) {\n return undefined\n }\n if (v !== value || ret !== obj) {\n if (ret === obj) {\n /** @type {{[k in string]: any}} */\n ret = {}\n for (let j = 0; j < i; j++) {\n ret[entries[j][0]] = entries[j][1]\n }\n }\n ret.roots = v\n }\n }\n break\n case 'version':\n {\n requiredCount--\n const v = Reprs.Int(value)\n if (v === undefined) {\n return undefined\n }\n if (v !== value || ret !== obj) {\n if (ret === obj) {\n /** @type {{[k in string]: any}} */\n ret = {}\n for (let j = 0; j < i; j++) {\n ret[entries[j][0]] = entries[j][1]\n }\n }\n ret.version = v\n }\n }\n break\n default:\n return undefined\n }\n }\n if (requiredCount > 0) {\n return undefined\n }\n return ret\n }\n}\n\nexport const CarV1HeaderOrV2Pragma = {\n toTyped: Types.CarV1HeaderOrV2Pragma,\n toRepresentation: Reprs.CarV1HeaderOrV2Pragma\n}\n","import { makeCborEncoders, objectToTokens } from './encode.js'\nimport { quickEncodeToken } from './jump.js'\n\n/**\n * @typedef {import('../interface').EncodeOptions} EncodeOptions\n * @typedef {import('../interface').TokenTypeEncoder} TokenTypeEncoder\n * @typedef {import('../interface').TokenOrNestedTokens} TokenOrNestedTokens\n */\n\nconst cborEncoders = makeCborEncoders()\n\n/** @type {EncodeOptions} */\nconst defaultEncodeOptions = {\n float64: false,\n quickEncodeToken\n}\n\n/**\n * Calculate the byte length of the given data when encoded as CBOR with the\n * options provided.\n * This calculation will be accurate if the same options are used as when\n * performing a normal encode. Some encode options can change the encoding\n * output length.\n *\n * @param {any} data\n * @param {EncodeOptions} [options]\n * @returns {number}\n */\nexport function encodedLength (data, options) {\n options = Object.assign({}, defaultEncodeOptions, options)\n options.mapSorter = undefined // won't change the length\n const tokens = objectToTokens(data, options)\n return tokensToLength(tokens, cborEncoders, options)\n}\n\n/**\n * Calculate the byte length of the data as represented by the given tokens when\n * encoded as CBOR with the options provided.\n * This function is for advanced users and would not normally be called\n * directly. See `encodedLength()` for appropriate use.\n *\n * @param {TokenOrNestedTokens} tokens\n * @param {TokenTypeEncoder[]} [encoders]\n * @param {EncodeOptions} [options]\n */\nexport function tokensToLength (tokens, encoders = cborEncoders, options = defaultEncodeOptions) {\n if (Array.isArray(tokens)) {\n let len = 0\n for (const token of tokens) {\n len += tokensToLength(token, encoders, options)\n }\n return len\n } else {\n const encoder = encoders[tokens.type.major]\n /* c8 ignore next 3 */\n if (encoder.encodedSize === undefined || typeof encoder.encodedSize !== 'function') {\n throw new Error(`Encoder for ${tokens.type.name} does not have an encodedSize()`)\n }\n return encoder.encodedSize(tokens, options)\n }\n}\n","import * as CBOR from '@ipld/dag-cbor'\nimport { Token, Type } from 'cborg'\nimport { tokensToLength } from 'cborg/length'\nimport varint from 'varint'\n\n/**\n * @typedef {import('./api').CID} CID\n * @typedef {import('./api').Block} Block\n * @typedef {import('./api').CarBufferWriter} Writer\n * @typedef {import('./api').CarBufferWriterOptions} Options\n * @typedef {import('./coding').CarEncoder} CarEncoder\n */\n\n/**\n * A simple CAR writer that writes to a pre-allocated buffer.\n *\n * @class\n * @name CarBufferWriter\n * @implements {Writer}\n */\nclass CarBufferWriter {\n /**\n * @param {Uint8Array} bytes\n * @param {number} headerSize\n */\n constructor (bytes, headerSize) {\n /** @readonly */\n this.bytes = bytes\n this.byteOffset = headerSize\n\n /**\n * @readonly\n * @type {CID[]}\n */\n this.roots = []\n this.headerSize = headerSize\n }\n\n /**\n * Add a root to this writer, to be used to create a header when the CAR is\n * finalized with {@link CarBufferWriter.close `close()`}\n *\n * @param {CID} root\n * @param {{resize?:boolean}} [options]\n * @returns {CarBufferWriter}\n */\n addRoot (root, options) {\n addRoot(this, root, options)\n return this\n }\n\n /**\n * Write a `Block` (a `{ cid:CID, bytes:Uint8Array }` pair) to the archive.\n * Throws if there is not enough capacity.\n *\n * @param {Block} block - A `{ cid:CID, bytes:Uint8Array }` pair.\n * @returns {CarBufferWriter}\n */\n write (block) {\n addBlock(this, block)\n return this\n }\n\n /**\n * Finalize the CAR and return it as a `Uint8Array`.\n *\n * @param {object} [options]\n * @param {boolean} [options.resize]\n * @returns {Uint8Array}\n */\n close (options) {\n return close(this, options)\n }\n}\n\n/**\n * @param {CarBufferWriter} writer\n * @param {CID} root\n * @param {{resize?:boolean}} [options]\n */\nexport const addRoot = (writer, root, options = {}) => {\n const { resize = false } = options\n const { bytes, headerSize, byteOffset, roots } = writer\n writer.roots.push(root)\n const size = headerLength(writer)\n // If there is not enough space for the new root\n if (size > headerSize) {\n // Check if we root would fit if we were to resize the head.\n if (size - headerSize + byteOffset < bytes.byteLength) {\n // If resize is enabled resize head\n if (resize) {\n resizeHeader(writer, size)\n // otherwise remove head and throw an error suggesting to resize\n } else {\n roots.pop()\n throw new RangeError(`Header of size ${headerSize} has no capacity for new root ${root}.\n However there is a space in the buffer and you could call addRoot(root, { resize: root }) to resize header to make a space for this root.`)\n }\n // If head would not fit even with resize pop new root and throw error\n } else {\n roots.pop()\n throw new RangeError(`Buffer has no capacity for a new root ${root}`)\n }\n }\n}\n\n/**\n * Calculates number of bytes required for storing given block in CAR. Useful in\n * estimating size of an `ArrayBuffer` for the `CarBufferWriter`.\n *\n * @name CarBufferWriter.blockLength(Block)\n * @param {Block} block\n * @returns {number}\n */\nexport const blockLength = ({ cid, bytes }) => {\n const size = cid.bytes.byteLength + bytes.byteLength\n return varint.encodingLength(size) + size\n}\n\n/**\n * @param {CarBufferWriter} writer\n * @param {Block} block\n */\nexport const addBlock = (writer, { cid, bytes }) => {\n const byteLength = cid.bytes.byteLength + bytes.byteLength\n const size = varint.encode(byteLength)\n if (writer.byteOffset + size.length + byteLength > writer.bytes.byteLength) {\n throw new RangeError('Buffer has no capacity for this block')\n } else {\n writeBytes(writer, size)\n writeBytes(writer, cid.bytes)\n writeBytes(writer, bytes)\n }\n}\n\n/**\n * @param {CarBufferWriter} writer\n * @param {object} [options]\n * @param {boolean} [options.resize]\n */\nexport const close = (writer, options = {}) => {\n const { resize = false } = options\n const { roots, bytes, byteOffset, headerSize } = writer\n\n const headerBytes = CBOR.encode({ version: 1, roots })\n const varintBytes = varint.encode(headerBytes.length)\n\n const size = varintBytes.length + headerBytes.byteLength\n const offset = headerSize - size\n\n // If header size estimate was accurate we just write header and return\n // view into buffer.\n if (offset === 0) {\n writeHeader(writer, varintBytes, headerBytes)\n return bytes.subarray(0, byteOffset)\n // If header was overestimated and `{resize: true}` is passed resize header\n } else if (resize) {\n resizeHeader(writer, size)\n writeHeader(writer, varintBytes, headerBytes)\n return bytes.subarray(0, writer.byteOffset)\n } else {\n throw new RangeError(`Header size was overestimated.\nYou can use close({ resize: true }) to resize header`)\n }\n}\n\n/**\n * @param {CarBufferWriter} writer\n * @param {number} byteLength\n */\nexport const resizeHeader = (writer, byteLength) => {\n const { bytes, headerSize } = writer\n // Move data section to a new offset\n bytes.set(bytes.subarray(headerSize, writer.byteOffset), byteLength)\n // Update header size & byteOffset\n writer.byteOffset += byteLength - headerSize\n writer.headerSize = byteLength\n}\n\n/**\n * @param {CarBufferWriter} writer\n * @param {number[]|Uint8Array} bytes\n */\n\nconst writeBytes = (writer, bytes) => {\n writer.bytes.set(bytes, writer.byteOffset)\n writer.byteOffset += bytes.length\n}\n/**\n * @param {{bytes:Uint8Array}} writer\n * @param {number[]} varint\n * @param {Uint8Array} header\n */\nconst writeHeader = ({ bytes }, varint, header) => {\n bytes.set(varint)\n bytes.set(header, varint.length)\n}\n\nconst headerPreludeTokens = [\n new Token(Type.map, 2),\n new Token(Type.string, 'version'),\n new Token(Type.uint, 1),\n new Token(Type.string, 'roots')\n]\n\nconst CID_TAG = new Token(Type.tag, 42)\n\n/**\n * Calculates header size given the array of byteLength for roots.\n *\n * @name CarBufferWriter.calculateHeaderLength(rootLengths)\n * @param {number[]} rootLengths\n * @returns {number}\n */\nexport const calculateHeaderLength = (rootLengths) => {\n const tokens = [...headerPreludeTokens]\n tokens.push(new Token(Type.array, rootLengths.length))\n for (const rootLength of rootLengths) {\n tokens.push(CID_TAG)\n tokens.push(new Token(Type.bytes, { length: rootLength + 1 }))\n }\n const length = tokensToLength(tokens) // no options needed here because we have simple tokens\n return varint.encodingLength(length) + length\n}\n\n/**\n * Calculates header size given the array of roots.\n *\n * @name CarBufferWriter.headerLength({ roots })\n * @param {object} options\n * @param {CID[]} options.roots\n * @returns {number}\n */\nexport const headerLength = ({ roots }) =>\n calculateHeaderLength(roots.map(cid => cid.bytes.byteLength))\n\n/**\n * Estimates header size given a count of the roots and the expected byte length\n * of the root CIDs. The default length works for a standard CIDv1 with a\n * single-byte multihash code, such as SHA2-256 (i.e. the most common CIDv1).\n *\n * @name CarBufferWriter.estimateHeaderLength(rootCount[, rootByteLength])\n * @param {number} rootCount\n * @param {number} [rootByteLength]\n * @returns {number}\n */\nexport const estimateHeaderLength = (rootCount, rootByteLength = 36) =>\n calculateHeaderLength(new Array(rootCount).fill(rootByteLength))\n\n/**\n * Creates synchronous CAR writer that can be used to encode blocks into a given\n * buffer. Optionally you could pass `byteOffset` and `byteLength` to specify a\n * range inside buffer to write into. If car file is going to have `roots` you\n * need to either pass them under `options.roots` (from which header size will\n * be calculated) or provide `options.headerSize` to allocate required space\n * in the buffer. You may also provide known `roots` and `headerSize` to\n * allocate space for the roots that may not be known ahead of time.\n *\n * Note: Incorrect `headerSize` may lead to copying bytes inside a buffer\n * which will have a negative impact on performance.\n *\n * @name CarBufferWriter.createWriter(buffer[, options])\n * @param {ArrayBuffer} buffer\n * @param {object} [options]\n * @param {CID[]} [options.roots]\n * @param {number} [options.byteOffset]\n * @param {number} [options.byteLength]\n * @param {number} [options.headerSize]\n * @returns {CarBufferWriter}\n */\nexport const createWriter = (buffer, options = {}) => {\n const {\n roots = [],\n byteOffset = 0,\n byteLength = buffer.byteLength,\n headerSize = headerLength({ roots })\n } = options\n const bytes = new Uint8Array(buffer, byteOffset, byteLength)\n\n const writer = new CarBufferWriter(bytes, headerSize)\n for (const root of roots) {\n writer.addRoot(root)\n }\n\n return writer\n}\n","import { decode as decodeDagCbor } from '@ipld/dag-cbor'\nimport { CID } from 'multiformats/cid'\nimport * as Digest from 'multiformats/hashes/digest'\nimport { CIDV0_BYTES, decodeV2Header, decodeVarint, getMultihashLength, V2_HEADER_LENGTH } from './decoder-common.js'\nimport { CarV1HeaderOrV2Pragma } from './header-validator.js'\n\n/**\n * @typedef {import('./api').Block} Block\n * @typedef {import('./api').BlockHeader} BlockHeader\n * @typedef {import('./api').BlockIndex} BlockIndex\n * @typedef {import('./coding').BytesReader} BytesReader\n * @typedef {import('./coding').CarHeader} CarHeader\n * @typedef {import('./coding').CarV2Header} CarV2Header\n * @typedef {import('./coding').CarV2FixedHeader} CarV2FixedHeader\n * @typedef {import('./coding').CarDecoder} CarDecoder\n */\n\n/**\n * Reads header data from a `BytesReader`. The header may either be in the form\n * of a `CarHeader` or `CarV2Header` depending on the CAR being read.\n *\n * @name async decoder.readHeader(reader)\n * @param {BytesReader} reader\n * @param {number} [strictVersion]\n * @returns {Promise<CarHeader|CarV2Header>}\n */\nexport async function readHeader (reader, strictVersion) {\n const length = decodeVarint(await reader.upTo(8), reader)\n if (length === 0) {\n throw new Error('Invalid CAR header (zero length)')\n }\n const header = await reader.exactly(length, true)\n const block = decodeDagCbor(header)\n if (CarV1HeaderOrV2Pragma.toTyped(block) === undefined) {\n throw new Error('Invalid CAR header format')\n }\n if ((block.version !== 1 && block.version !== 2) || (strictVersion !== undefined && block.version !== strictVersion)) {\n throw new Error(`Invalid CAR version: ${block.version}${strictVersion !== undefined ? ` (expected ${strictVersion})` : ''}`)\n }\n if (block.version === 1) {\n // CarV1HeaderOrV2Pragma makes roots optional, let's make it mandatory\n if (!Array.isArray(block.roots)) {\n throw new Error('Invalid CAR header format')\n }\n return block\n }\n // version 2\n if (block.roots !== undefined) {\n throw new Error('Invalid CAR header format')\n }\n const v2Header = decodeV2Header(await reader.exactly(V2_HEADER_LENGTH, true))\n reader.seek(v2Header.dataOffset - reader.pos)\n const v1Header = await readHeader(reader, 1)\n return Object.assign(v1Header, v2Header)\n}\n\n/**\n * @param {BytesReader} reader\n * @returns {Promise<CID>}\n */\nasync function readCid (reader) {\n const first = await reader.exactly(2, false)\n if (first[0] === CIDV0_BYTES.SHA2_256 && first[1] === CIDV0_BYTES.LENGTH) {\n // cidv0 32-byte sha2-256\n const bytes = await reader.exactly(34, true)\n const multihash = Digest.decode(bytes)\n return CID.create(0, CIDV0_BYTES.DAG_PB, multihash)\n }\n\n const version = decodeVarint(await reader.upTo(8), reader)\n if (version !== 1) {\n throw new Error(`Unexpected CID version (${version})`)\n }\n const codec = decodeVarint(await reader.upTo(8), reader)\n const bytes = await reader.exactly(getMultihashLength(await reader.upTo(8)), true)\n const multihash = Digest.decode(bytes)\n return CID.create(version, codec, multihash)\n}\n\n/**\n * Reads the leading data of an individual block from CAR data from a\n * `BytesReader`. Returns a `BlockHeader` object which contains\n * `{ cid, length, blockLength }` which can be used to either index the block\n * or read the block binary data.\n *\n * @name async decoder.readBlockHead(reader)\n * @param {BytesReader} reader\n * @returns {Promise<BlockHeader>}\n */\nexport async function readBlockHead (reader) {\n // length includes a CID + Binary, where CID has a variable length\n // we have to deal with\n const start = reader.pos\n let length = decodeVarint(await reader.upTo(8), reader)\n if (length === 0) {\n throw new Error('Invalid CAR section (zero length)')\n }\n length += (reader.pos - start)\n const cid = await readCid(reader)\n const blockLength = length - Number(reader.pos - start) // subtract CID length\n\n return { cid, length, blockLength }\n}\n\n/**\n * @param {BytesReader} reader\n * @returns {Promise<Block>}\n */\nasync function readBlock (reader) {\n const { cid, blockLength } = await readBlockHead(reader)\n const bytes = await reader.exactly(blockLength, true)\n return { bytes, cid }\n}\n\n/**\n * @param {BytesReader} reader\n * @returns {Promise<BlockIndex>}\n */\nasync function readBlockIndex (reader) {\n const offset = reader.pos\n const { cid, length, blockLength } = await readBlockHead(reader)\n const index = { cid, length, blockLength, offset, blockOffset: reader.pos }\n reader.seek(index.blockLength)\n return index\n}\n\n/**\n * Creates a `CarDecoder` from a `BytesReader`. The `CarDecoder` is as async\n * interface that will consume the bytes from the `BytesReader` to yield a\n * `header()` and either `blocks()` or `blocksIndex()` data.\n *\n * @name decoder.createDecoder(reader)\n * @param {BytesReader} reader\n * @returns {CarDecoder}\n */\nexport function createDecoder (reader) {\n const headerPromise = (async () => {\n const header = await readHeader(reader)\n if (header.version === 2) {\n const v1length = reader.pos - header.dataOffset\n reader = limitReader(reader, header.dataSize - v1length)\n }\n return header\n })()\n\n return {\n header: () => headerPromise,\n\n async * blocks () {\n await headerPromise\n while ((await reader.upTo(8)).length > 0) {\n yield await readBlock(reader)\n }\n },\n\n async * blocksIndex () {\n await headerPromise\n while ((await reader.upTo(8)).length > 0) {\n yield await readBlockIndex(reader)\n }\n }\n }\n}\n\n/**\n * Creates a `BytesReader` from a `Uint8Array`.\n *\n * @name decoder.bytesReader(bytes)\n * @param {Uint8Array} bytes\n * @returns {BytesReader}\n */\nexport function bytesReader (bytes) {\n let pos = 0\n\n /** @type {BytesReader} */\n return {\n async upTo (length) {\n const out = bytes.subarray(pos, pos + Math.min(length, bytes.length - pos))\n return out\n },\n\n async exactly (length, seek = false) {\n if (length > bytes.length - pos) {\n throw new Error('Unexpected end of data')\n }\n const out = bytes.subarray(pos, pos + length)\n if (seek) {\n pos += length\n }\n return out\n },\n\n seek (length) {\n pos += length\n },\n\n get pos () {\n return pos\n }\n }\n}\n\n/**\n * @ignore\n * reusable reader for streams and files, we just need a way to read an\n * additional chunk (of some undetermined size) and a way to close the\n * reader when finished\n * @param {() => Promise<Uint8Array|null>} readChunk\n * @returns {BytesReader}\n */\nexport function chunkReader (readChunk /*, closer */) {\n let pos = 0\n let have = 0\n let offset = 0\n let currentChunk = new Uint8Array(0)\n\n const read = async (/** @type {number} */ length) => {\n have = currentChunk.length - offset\n const bufa = [currentChunk.subarray(offset)]\n while (have < length) {\n const chunk = await readChunk()\n if (chunk == null) {\n break\n }\n /* c8 ignore next 8 */\n // undo this ignore ^ when we have a fd implementation that can seek()\n if (have < 0) { // because of a seek()\n /* c8 ignore next 4 */\n // toohard to test the else\n if (chunk.length > have) {\n bufa.push(chunk.subarray(-have))\n } // else discard\n } else {\n bufa.push(chunk)\n }\n have += chunk.length\n }\n currentChunk = new Uint8Array(bufa.reduce((p, c) => p + c.length, 0))\n let off = 0\n for (const b of bufa) {\n currentChunk.set(b, off)\n off += b.length\n }\n offset = 0\n }\n\n /** @type {BytesReader} */\n return {\n async upTo (length) {\n if (currentChunk.length - offset < length) {\n await read(length)\n }\n return currentChunk.subarray(offset, offset + Math.min(currentChunk.length - offset, length))\n },\n\n async exactly (length, seek = false) {\n if (currentChunk.length - offset < length) {\n await read(length)\n }\n if (currentChunk.length - offset < length) {\n throw new Error('Unexpected end of data')\n }\n const out = currentChunk.subarray(offset, offset + length)\n if (seek) {\n pos += length\n offset += length\n }\n return out\n },\n\n seek (length) {\n pos += length\n offset += length\n },\n\n get pos () {\n return pos\n }\n }\n}\n\n/**\n * Creates a `BytesReader` from an `AsyncIterable<Uint8Array>`, which allows for\n * consumption of CAR data from a streaming source.\n *\n * @name decoder.asyncIterableReader(asyncIterable)\n * @param {AsyncIterable<Uint8Array>} asyncIterable\n * @returns {BytesReader}\n */\nexport function asyncIterableReader (asyncIterable) {\n const iterator = asyncIterable[Symbol.asyncIterator]()\n\n async function readChunk () {\n const next = await iterator.next()\n if (next.done) {\n return null\n }\n return next.value\n }\n\n return chunkReader(readChunk)\n}\n\n/**\n * Wraps a `BytesReader` in a limiting `BytesReader` which limits maximum read\n * to `byteLimit` bytes. It _does not_ update `pos` of the original\n * `BytesReader`.\n *\n * @name decoder.limitReader(reader, byteLimit)\n * @param {BytesReader} reader\n * @param {number} byteLimit\n * @returns {BytesReader}\n */\nexport function limitReader (reader, byteLimit) {\n let bytesRead = 0\n\n /** @type {BytesReader} */\n return {\n async upTo (length) {\n let bytes = await reader.upTo(length)\n if (bytes.length + bytesRead > byteLimit) {\n bytes = bytes.subarray(0, byteLimit - bytesRead)\n }\n return bytes\n },\n\n async exactly (length, seek = false) {\n const bytes = await reader.exactly(length, seek)\n if (bytes.length + bytesRead > byteLimit) {\n throw new Error('Unexpected end of data')\n }\n if (seek) {\n bytesRead += length\n }\n return bytes\n },\n\n seek (length) {\n bytesRead += length\n reader.seek(length)\n },\n\n get pos () {\n return reader.pos\n }\n }\n}\n","import { asyncIterableReader, bytesReader, createDecoder } from './decoder.js'\n\n/**\n * @typedef {import('multiformats').CID} CID\n * @typedef {import('./api').Block} Block\n * @typedef {import('./api').CarReader} CarReaderIface\n * @typedef {import('./coding').BytesReader} BytesReader\n * @typedef {import('./coding').CarHeader} CarHeader\n * @typedef {import('./coding').CarV2Header} CarV2Header\n */\n\n/**\n * Provides blockstore-like access to a CAR.\n *\n * Implements the `RootsReader` interface:\n * {@link CarReader.getRoots `getRoots()`}. And the `BlockReader` interface:\n * {@link CarReader.get `get()`}, {@link CarReader.has `has()`},\n * {@link CarReader.blocks `blocks()`} (defined as a `BlockIterator`) and\n * {@link CarReader.cids `cids()`} (defined as a `CIDIterator`).\n *\n * Load this class with either `import { CarReader } from '@ipld/car/reader'`\n * (`const { CarReader } = require('@ipld/car/reader')`). Or\n * `import { CarReader } from '@ipld/car'` (`const { CarReader } = require('@ipld/car')`).\n * The former will likely result in smaller bundle sizes where this is\n * important.\n *\n * @name CarReader\n * @class\n * @implements {CarReaderIface}\n * @property {number} version The version number of the CAR referenced by this\n * reader (should be `1` or `2`).\n */\nexport class CarReader {\n /**\n * @constructs CarReader\n * @param {CarHeader|CarV2Header} header\n * @param {Block[]} blocks\n */\n constructor (header, blocks) {\n this._header = header\n this._blocks = blocks\n this._keys = blocks.map((b) => b.cid.toString())\n }\n\n /**\n * @property\n * @memberof CarReader\n * @instance\n */\n get version () {\n return this._header.version\n }\n\n /**\n * Get the list of roots defined by the CAR referenced by this reader. May be\n * zero or more `CID`s.\n *\n * @function\n * @memberof CarReader\n * @instance\n * @async\n * @returns {Promise<CID[]>}\n */\n async getRoots () {\n return this._header.roots\n }\n\n /**\n * Check whether a given `CID` exists within the CAR referenced by this\n * reader.\n *\n * @function\n * @memberof CarReader\n * @instance\n * @async\n * @param {CID} key\n * @returns {Promise<boolean>}\n */\n async has (key) {\n return this._keys.indexOf(key.toString()) > -1\n }\n\n /**\n * Fetch a `Block` (a `{ cid:CID, bytes:Uint8Array }` pair) from the CAR\n * referenced by this reader matching the provided `CID`. In the case where\n * the provided `CID` doesn't exist within the CAR, `undefined` will be\n * returned.\n *\n * @function\n * @memberof CarReader\n * @instance\n * @async\n * @param {CID} key\n * @returns {Promise<Block | undefined>}\n */\n async get (key) {\n const index = this._keys.indexOf(key.toString())\n return index > -1 ? this._blocks[index] : undefined\n }\n\n /**\n * Returns a `BlockIterator` (`AsyncIterable<Block>`) that iterates over all\n * of the `Block`s (`{ cid:CID, bytes:Uint8Array }` pairs) contained within\n * the CAR referenced by this reader.\n *\n * @function\n * @memberof CarReader\n * @instance\n * @async\n * @generator\n * @returns {AsyncGenerator<Block>}\n */\n async * blocks () {\n for (const block of this._blocks) {\n yield block\n }\n }\n\n /**\n * Returns a `CIDIterator` (`AsyncIterable<CID>`) that iterates over all of\n * the `CID`s contained within the CAR referenced by this reader.\n *\n * @function\n * @memberof CarReader\n * @instance\n * @async\n * @generator\n * @returns {AsyncGenerator<CID>}\n */\n async * cids () {\n for (const block of this._blocks) {\n yield block.cid\n }\n }\n\n /**\n * Instantiate a {@link CarReader} from a `Uint8Array` blob. This performs a\n * decode fully in memory and maintains the decoded state in memory for full\n * access to the data via the `CarReader` API.\n *\n * @async\n * @static\n * @memberof CarReader\n * @param {Uint8Array} bytes\n * @returns {Promise<CarReader>}\n */\n static async fromBytes (bytes) {\n if (!(bytes instanceof Uint8Array)) {\n throw new TypeError('fromBytes() requires a Uint8Array')\n }\n return decodeReaderComplete(bytesReader(bytes))\n }\n\n /**\n * Instantiate a {@link CarReader} from a `AsyncIterable<Uint8Array>`, such as\n * a [modern Node.js stream](https://nodejs.org/api/stream.html#stream_streams_compatibility_with_async_generators_and_async_iterators).\n * This performs a decode fully in memory and maintains the decoded state in\n * memory for full access to the data via the `CarReader` API.\n *\n * Care should be taken for large archives; this API may not be appropriate\n * where memory is a concern or the archive is potentially larger than the\n * amount of memory that the runtime can handle.\n *\n * @async\n * @static\n * @memberof CarReader\n * @param {AsyncIterable<Uint8Array>} asyncIterable\n * @returns {Promise<CarReader>}\n */\n static async fromIterable (asyncIterable) {\n if (!asyncIterable || !(typeof asyncIterable[Symbol.asyncIterator] === 'function')) {\n throw new TypeError('fromIterable() requires an async iterable')\n }\n return decodeReaderComplete(asyncIterableReader(asyncIterable))\n }\n}\n\n/**\n * @private\n * @param {BytesReader} reader\n * @returns {Promise<CarReader>}\n */\nexport async function decodeReaderComplete (reader) {\n const decoder = createDecoder(reader)\n const header = await decoder.header()\n const blocks = []\n for await (const block of decoder.blocks()) {\n blocks.push(block)\n }\n\n return new CarReader(header, blocks)\n}\n\nexport const __browser = true\n","import { encode as dagCborEncode } from '@ipld/dag-cbor'\nimport varint from 'varint'\n\n/**\n * @typedef {import('multiformats').CID} CID\n * @typedef {import('./api').Block} Block\n * @typedef {import('./coding').CarEncoder} CarEncoder\n * @typedef {import('./coding').IteratorChannel_Writer<Uint8Array>} IteratorChannel_Writer\n */\n\n/**\n * Create a header from an array of roots.\n *\n * @param {CID[]} roots\n * @returns {Uint8Array}\n */\nexport function createHeader (roots) {\n const headerBytes = dagCborEncode({ version: 1, roots })\n const varintBytes = varint.encode(headerBytes.length)\n const header = new Uint8Array(varintBytes.length + headerBytes.length)\n header.set(varintBytes, 0)\n header.set(headerBytes, varintBytes.length)\n return header\n}\n\n/**\n * @param {IteratorChannel_Writer} writer\n * @returns {CarEncoder}\n */\nfunction createEncoder (writer) {\n // none of this is wrapped in a mutex, that needs to happen above this to\n // avoid overwrites\n\n return {\n /**\n * @param {CID[]} roots\n * @returns {Promise<void>}\n */\n async setRoots (roots) {\n const bytes = createHeader(roots)\n await writer.write(bytes)\n },\n\n /**\n * @param {Block} block\n * @returns {Promise<void>}\n */\n async writeBlock (block) {\n const { cid, bytes } = block\n await writer.write(new Uint8Array(varint.encode(cid.bytes.length + bytes.length)))\n await writer.write(cid.bytes)\n if (bytes.length) {\n // zero-length blocks are valid, but it'd be safer if we didn't write them\n await writer.write(bytes)\n }\n },\n\n /**\n * @returns {Promise<void>}\n */\n async close () {\n await writer.end()\n }\n }\n}\n\nexport { createEncoder }\n","/**\n * @template {any} T\n * @typedef {import('./coding').IteratorChannel<T>} IteratorChannel\n */\n\nfunction noop () {}\n\n/**\n * @template {any} T\n * @returns {IteratorChannel<T>}\n */\nexport function create () {\n /** @type {T[]} */\n const chunkQueue = []\n /** @type {Promise<void> | null} */\n let drainer = null\n let drainerResolver = noop\n let ended = false\n /** @type {Promise<IteratorResult<T>> | null} */\n let outWait = null\n let outWaitResolver = noop\n\n const makeDrainer = () => {\n if (!drainer) {\n drainer = new Promise((resolve) => {\n drainerResolver = () => {\n drainer = null\n drainerResolver = noop\n resolve()\n }\n })\n }\n return drainer\n }\n\n /**\n * @returns {IteratorChannel<T>}\n */\n const writer = {\n /**\n * @param {T} chunk\n * @returns {Promise<void>}\n */\n write (chunk) {\n chunkQueue.push(chunk)\n const drainer = makeDrainer()\n outWaitResolver()\n return drainer\n },\n\n async end () {\n ended = true\n const drainer = makeDrainer()\n outWaitResolver()\n await drainer\n }\n }\n\n /** @type {AsyncIterator<T>} */\n const iterator = {\n /** @returns {Promise<IteratorResult<T>>} */\n async next () {\n const chunk = chunkQueue.shift()\n if (chunk) {\n if (chunkQueue.length === 0) {\n drainerResolver()\n }\n return { done: false, value: chunk }\n }\n\n if (ended) {\n drainerResolver()\n return { done: true, value: undefined }\n }\n\n if (!outWait) {\n outWait = new Promise((resolve) => {\n outWaitResolver = () => {\n outWait = null\n outWaitResolver = noop\n return resolve(iterator.next())\n }\n })\n }\n\n return outWait\n }\n }\n\n return { writer, iterator }\n}\n","import { CID } from 'multiformats/cid'\nimport { bytesReader, readHeader } from './decoder.js'\nimport { createEncoder, createHeader } from './encoder.js'\nimport { create as iteratorChannel } from './iterator-channel.js'\n\n/**\n * @typedef {import('./api').Block} Block\n * @typedef {import('./api').BlockWriter} BlockWriter\n * @typedef {import('./api').WriterChannel} WriterChannel\n * @typedef {import('./coding').CarEncoder} CarEncoder\n * @typedef {import('./coding').IteratorChannel<Uint8Array>} IteratorChannel\n */\n\n/**\n * Provides a writer interface for the creation of CAR files.\n *\n * Creation of a `CarWriter` involves the instatiation of an input / output pair\n * in the form of a `WriterChannel`, which is a\n * `{ writer:CarWriter, out:AsyncIterable<Uint8Array> }` pair. These two\n * components form what can be thought of as a stream-like interface. The\n * `writer` component (an instantiated `CarWriter`), has methods to\n * {@link CarWriter.put `put()`} new blocks and {@link CarWriter.put `close()`}\n * the writing operation (finalising the CAR archive). The `out` component is\n * an `AsyncIterable` that yields the bytes of the archive. This can be\n * redirected to a file or other sink. In Node.js, you can use the\n * [`Readable.from()`](https://nodejs.org/api/stream.html#stream_stream_readable_from_iterable_options)\n * API to convert this to a standard Node.js stream, or it can be directly fed\n * to a\n * [`stream.pipeline()`](https://nodejs.org/api/stream.html#stream_stream_pipeline_source_transforms_destination_callback).\n *\n * The channel will provide a form of backpressure. The `Promise` from a\n * `write()` won't resolve until the resulting data is drained from the `out`\n * iterable.\n *\n * It is also possible to ignore the `Promise` from `write()` calls and allow\n * the generated data to queue in memory. This should be avoided for large CAR\n * archives of course due to the memory costs and potential for memory overflow.\n *\n * Load this class with either\n * `import { CarWriter } from '@ipld/car/writer'`\n * (`const { CarWriter } = require('@ipld/car/writer')`). Or\n * `import { CarWriter } from '@ipld/car'`\n * (`const { CarWriter } = require('@ipld/car')`). The former will likely\n * result in smaller bundle sizes where this is important.\n *\n * @name CarWriter\n * @class\n * @implements {BlockWriter}\n */\nexport class CarWriter {\n /**\n * @param {CID[]} roots\n * @param {CarEncoder} encoder\n */\n constructor (roots, encoder) {\n this._encoder = encoder\n /** @type {Promise<void>} */\n this._mutex = encoder.setRoots(roots)\n this._ended = false\n }\n\n /**\n * Write a `Block` (a `{ cid:CID, bytes:Uint8Array }` pair) to the archive.\n *\n * @function\n * @memberof CarWriter\n * @instance\n * @async\n * @param {Block} block - A `{ cid:CID, bytes:Uint8Array }` pair.\n * @returns {Promise<void>} The returned promise will only resolve once the\n * bytes this block generates are written to the `out` iterable.\n */\n async put (block) {\n if (!(block.bytes instanceof Uint8Array) || !block.cid) {\n throw new TypeError('Can only write {cid, bytes} objects')\n }\n if (this._ended) {\n throw new Error('Already closed')\n }\n const cid = CID.asCID(block.cid)\n if (!cid) {\n throw new TypeError('Can only write {cid, bytes} objects')\n }\n this._mutex = this._mutex.then(() => this._encoder.writeBlock({ cid, bytes: block.bytes }))\n return this._mutex\n }\n\n /**\n * Finalise the CAR archive and signal that the `out` iterable should end once\n * any remaining bytes are written.\n *\n * @function\n * @memberof CarWriter\n * @instance\n * @async\n * @returns {Promise<void>}\n */\n async close () {\n if (this._ended) {\n throw new Error('Already closed')\n }\n await this._mutex\n this._ended = true\n return this._encoder.close()\n }\n\n /**\n * Create a new CAR writer \"channel\" which consists of a\n * `{ writer:CarWriter, out:AsyncIterable<Uint8Array> }` pair.\n *\n * @async\n * @static\n * @memberof CarWriter\n * @param {CID[] | CID | void} roots\n * @returns {WriterChannel} The channel takes the form of\n * `{ writer:CarWriter, out:AsyncIterable<Uint8Array> }`.\n */\n static create (roots) {\n roots = toRoots(roots)\n const { encoder, iterator } = encodeWriter()\n const writer = new CarWriter(roots, encoder)\n const out = new CarWriterOut(iterator)\n return { writer, out }\n }\n\n /**\n * Create a new CAR appender \"channel\" which consists of a\n * `{ writer:CarWriter, out:AsyncIterable<Uint8Array> }` pair.\n * This appender does not consider roots and does not produce a CAR header.\n * It is designed to append blocks to an _existing_ CAR archive. It is\n * expected that `out` will be concatenated onto the end of an existing\n * archive that already has a properly formatted header.\n *\n * @async\n * @static\n * @memberof CarWriter\n * @returns {WriterChannel} The channel takes the form of\n * `{ writer:CarWriter, out:AsyncIterable<Uint8Array> }`.\n */\n static createAppender () {\n const { encoder, iterator } = encodeWriter()\n encoder.setRoots = () => Promise.resolve()\n const writer = new CarWriter([], encoder)\n const out = new CarWriterOut(iterator)\n return { writer, out }\n }\n\n /**\n * Update the list of roots in the header of an existing CAR as represented\n * in a Uint8Array.\n *\n * This operation is an _overwrite_, the total length of the CAR will not be\n * modified. A rejection will occur if the new header will not be the same\n * length as the existing header, in which case the CAR will not be modified.\n * It is the responsibility of the user to ensure that the roots being\n * replaced encode as the same length as the new roots.\n *\n * The byte array passed in an argument will be modified and also returned\n * upon successful modification.\n *\n * @async\n * @static\n * @memberof CarWriter\n * @param {Uint8Array} bytes\n * @param {CID[]} roots - A new list of roots to replace the existing list in\n * the CAR header. The new header must take up the same number of bytes as the\n * existing header, so the roots should collectively be the same byte length\n * as the existing roots.\n * @returns {Promise<Uint8Array>}\n */\n static async updateRootsInBytes (bytes, roots) {\n const reader = bytesReader(bytes)\n await readHeader(reader)\n const newHeader = createHeader(roots)\n if (Number(reader.pos) !== newHeader.length) {\n throw new Error(`updateRoots() can only overwrite a header of the same length (old header is ${reader.pos} bytes, new header is ${newHeader.length} bytes)`)\n }\n bytes.set(newHeader, 0)\n return bytes\n }\n}\n\n/**\n * @class\n * @implements {AsyncIterable<Uint8Array>}\n */\nexport class CarWriterOut {\n /**\n * @param {AsyncIterator<Uint8Array>} iterator\n */\n constructor (iterator) {\n this._iterator = iterator\n }\n\n [Symbol.asyncIterator] () {\n if (this._iterating) {\n throw new Error('Multiple iterator not supported')\n }\n this._iterating = true\n return this._iterator\n }\n}\n\nfunction encodeWriter () {\n /** @type {IteratorChannel} */\n const iw = iteratorChannel()\n const { writer, iterator } = iw\n const encoder = createEncoder(writer)\n return { encoder, iterator }\n}\n\n/**\n * @private\n * @param {CID[] | CID | void} roots\n * @returns {CID[]}\n */\nfunction toRoots (roots) {\n if (roots === undefined) {\n return []\n }\n\n if (!Array.isArray(roots)) {\n const cid = CID.asCID(roots)\n if (!cid) {\n throw new TypeError('roots must be a single CID or an array of CIDs')\n }\n return [cid]\n }\n\n const _roots = []\n for (const root of roots) {\n const _root = CID.asCID(root)\n if (!_root) {\n throw new TypeError('roots must be a single CID or an array of CIDs')\n }\n _roots.push(_root)\n }\n return _roots\n}\n\nexport const __browser = true\n","import { CarReader, CarWriter } from '@ipld/car'\nimport * as dagJson from '@ipld/dag-json'\nimport { Logger } from 'besonders-logger'\nimport { BlockView, CID } from 'multiformats'\nimport { sortApplogsByTs } from '../applog/applog-utils'\nimport { Applog, ApplogArrayMaybeEncrypted, CidString } from '../applog/datom-types'\nimport { unchunkApplogsBlock } from '../pubsub/pub-push'\nimport { PubBlockLogs, PubBlockLogsOrChunks, PubBlockRoot } from '../pubsub/pubsub-types'\nimport { areCidsEqual, containsCid } from './ipfs-utils'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\nexport type CIDForCar = CID // Exclude<Parameters<(typeof CarWriter)['create']>[0], void>\nexport type BlockForCar = Parameters<CarWriter['put']>[0]\n\nexport interface BlockStoreish {\n\tget(cid: CID): PromiseLike<Uint8Array> // (i) not using decoded version to be similar to blockstore-idb\n}\n\nexport interface DecodedCar {\n\trootCID: CID\n\t// blocks: Map<CidString, any>\n\tblockStore: BlockStoreish\n}\n\n/** Warning: unsorted & maybe encrypted */\nexport async function decodePubFromCar(car: CarReader) {\n\tconst decoded = await getBlocksOfCar(car)\n\treturn await decodePubFromBlocks(decoded)\n}\n\nexport async function decodePubFromBlocks({ rootCID, blockStore }: DecodedCar, recursionTrace: CID[] = []) {\n\tif (!rootCID || !blockStore) {\n\t\tthrow ERROR('Empty roots/blocks', { rootCID, blockStore })\n\t}\n\tconst root = (await getDecodedBlock(blockStore, rootCID)) as PubBlockRoot\n\tlet pubLogsArray: CID[]\n\tlet applogsCID: CID = null\n\tlet info: { logs: CID[] } = null\n\tVERBOSE(`[decodePubFromBlocks] root:`, rootCID.toString(), root, { blockStore })\n\tif (!root) throw ERROR('root not found in blockStore', { blockStore, rootCID }) // return { applogs: [], info: {} } // ? old HA CK why ?...\n\tif (root?.info) {\n\t\t// New(er) format\n\t\tapplogsCID = root.applogs\n\t\tconst applogsBlock = (await getDecodedBlock(blockStore, applogsCID)) as PubBlockLogsOrChunks\n\t\tpubLogsArray = await unchunkApplogsBlock(applogsBlock, blockStore)\n\t\tinfo = (await getDecodedBlock(blockStore, root.info)) as PubBlockLogs\n\t\tDEBUG(`new format - infoLogs`, info.logs.map(l => ({ [l.toString()]: l })))\n\t\t// TODO: verify signatures\n\t} else {\n\t\t// Old format\n\t\tpubLogsArray = root.applogs as any as CID[]\n\t}\n\tconst resolveLogFromCidLink = async (cidOrLink: CID) => {\n\t\tconst cid = cidOrLink // (cidOrLink as any).toV1 ? (cidOrLink as CID).toV1().toString() : cidOrLink['/'] as string\n\t\tconst applog = (await getDecodedBlock(blockStore, cid)) as Applog\n\t\tif (!applog) {\n\t\t\tERROR(`Could not find applog CID in pub blocks:`, cid.toString(), { cid, root, blockStore })\n\t\t\tthrow new Error(`Could not find applog CID in pub blocks: ${cid.toString()}`)\n\t\t}\n\t\tif ((applog.pv as any) instanceof CID) applog.pv = (applog.pv as any as CID).toV1().toString() // (i) might be string bc. https://discuss.ipfs.tech/t/pin-dag-with-open-ends/17612\n\n\t\treturn {\n\t\t\t...applog,\n\t\t\tcid: cid.toV1().toString(),\n\t\t}\n\t}\n\n\tlet applogs: ApplogArrayMaybeEncrypted\n\tapplogs = await Promise.all(pubLogsArray.map(resolveLogFromCidLink))\n\tif (root.prev) {\n\t\tif (areCidsEqual(root.prev, rootCID) || containsCid(recursionTrace, root.prev)) {\n\t\t\tthrow ERROR(`[pubFromBlocks] pub chain has a loop`, { rootCID, prev: root.prev, recursionTrace })\n\t\t}\n\t\tapplogs.push(...((await decodePubFromBlocks({ rootCID: root.prev, blockStore }, [...recursionTrace, rootCID])).applogs))\n\t}\n\tconst result = {\n\t\tcid: rootCID,\n\t\tinfo: {\n\t\t\t...info,\n\t\t\tlogs: await Promise.all(info.logs.map(resolveLogFromCidLink)),\n\t\t},\n\t\tapplogsCID,\n\t\tapplogs,\n\t}\n\tDEBUG('[decodePubFromBlocks] result:', result, { rootCID: rootCID.toString(), root, blockStore, applogs, info })\n\treturn result\n}\n\nexport async function getBlocksOfCar(car: CarReader) {\n\tconst rootsFromCar = await car.getRoots()\n\tconst roots = rootsFromCar.map(c => ((typeof c.toV1 === 'function') ? c : CID.decode(c.bytes)).toV1().toString() as CidString) // HACK\n\tconst blocks = new Map<CidString, any>()\n\tfor await (const { cid: cidFromCarblocks, bytes } of car.blocks()) {\n\t\tconst cid = (typeof cidFromCarblocks.toV1 === 'function') ? cidFromCarblocks : CID.decode(cidFromCarblocks.bytes)\n\t\tVERBOSE({ cidFromCarblocks, cid })\n\t\t// blocks.set(cid.toV1().toString(), dagJson.decode(bytes)) // HACK: tried using CID as map key, but because it's based on referential equality it's not working\n\t\tblocks.set(cid.toV1().toString(), bytes) // HACK: tried using CID as map key, but because it's based on referential equality it's not working\n\t}\n\tif (roots.length !== 1) {\n\t\tWARN('Unexpected roots count:', roots)\n\t}\n\treturn {\n\t\trootCID: CID.parse(roots[0]),\n\t\tblockStore: {\n\t\t\tget: (cid) => blocks.get(cid.toV1().toString()),\n\t\t},\n\t} satisfies DecodedCar\n}\nexport async function getDecodedBlock(blockStore: BlockStoreish, cid: CID) {\n\ttry {\n\t\tvar blob = await blockStore.get(cid)\n\t\tif (!blob) {\n\t\t\tWARN('returning null')\n\t\t\treturn null // I don't think this ever happens actually\n\t\t}\n\t} catch (err) {\n\t\tif ((err as any).message === 'Not Found') return null\n\t\tthrow err\n\t}\n\treturn dagJson.decode(blob)\n}\n\n// make out in the car... been a while but also sounds nice\nexport async function makeCarOut(roots: CIDForCar, blocks: BlockForCar[]) {\n\tconst { writer, out } = CarWriter.create(Array.isArray(roots) ? roots : [roots])\n\n\t// add the blocks to the CAR and close it\n\tVERBOSE(`Writing ${blocks.length} blocks to CAR`, { roots, blocks })\n\tblocks.forEach(b => writer.put(b))\n\twriter.close()\n\t// VERBOSE(`Wrote ${blocks.length} blocks to CAR`, writer)\n\treturn out\n} /** create a new CarWriter, with the encoded block as the root */\n\n// export async function makeCarReader(roots: CIDForCar, blocks: BlockForCar[]) {\n// \tconst out = await makeCarOut(roots, blocks)\n\n// \t// create a new CarReader we can hand to web3.storage.putCar\n// \tconst reader = await CarReader.fromIterable(out)\n// \tVERBOSE(`CAR reader`, reader)\n// \treturn reader\n// } /** create a new CarWriter, with the encoded block as the root */\n\nexport async function makeCarBlob(roots: CIDForCar, blocks: BlockForCar[]) {\n\tconst carOut = await makeCarOut(roots, blocks)\n\tconst chunks = []\n\tfor await (const chunk of carOut) {\n\t\tchunks.push(chunk)\n\t}\n\tconst blob = new Blob(chunks)\n\treturn blob\n}\nexport async function carFromBlob(blob: Blob | File): Promise<CarReader> {\n\treturn CarReader.fromBytes(new Uint8Array(await blob.arrayBuffer()))\n}\n\nexport function streamReaderToIterable(bodyReader: ReadableStreamDefaultReader<Uint8Array>): AsyncIterable<Uint8Array> {\n\treturn (async function*() {\n\t\twhile (true) {\n\t\t\tconst { done, value } = await bodyReader.read()\n\t\t\tVERBOSE(`[car] chunk`, { done, value })\n\t\t\tif (done) {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tyield value\n\t\t}\n\t})()\n}\n","import * as dagJson from '@ipld/dag-json'\nimport { Logger } from 'besonders-logger'\nimport { CID } from 'multiformats/cid'\nimport stringify from 'safe-stable-stringify'\nimport { ensureTsPvAndFinalizeApplog } from '../applog/applog-helpers'\nimport type {\n\tApplog,\n\tApplogArrayMaybeEncrypted,\n\tApplogArrayMaybeEncryptedRO,\n\tApplogArrayNoCIDMaybeEncryptedRO,\n\tApplogEnc,\n\tApplogEncNoCid,\n\tCidString,\n} from '../applog/datom-types'\nimport { BlockStoreish, DecodedCar, getDecodedBlock, makeCarBlob } from '../ipfs/car'\nimport { encodeBlockOriginal, prepareForPub } from '../ipfs/ipfs-utils'\nimport { lastWriteWins } from './../query/basic'\nimport { ApplogsOrThread, getLogsFromThread, Thread } from '../thread'\nimport { rollingFilter } from '../thread/filters'\nimport { keepTruthy } from '../utils'\nimport type { AppAgent, IPublication, PubBlockChunks, PubBlockLogs, PubBlockLogsOrChunks } from './pubsub-types'\n\nconst { WARN, LOG, DEBUG, VERBOSE, ERROR } = Logger.setup(Logger.INFO) // eslint-disable-line no-unused-vars\n\n// export const neverEncryptAttrs = [\n// \t'agent/jwkd',\n// \t'agent/appAgent',\n// \t'pub/encryptedFor',\n// \t'pub/sharedKey',\n// ]\n\n// export interface WovinPublicationInfo {\n// \tid: string\n// }\n\nexport async function preparePubForPush(\n\tagent: AppAgent,\n\tappThread: Thread,\n\tthreadToPublish: ApplogsOrThread,\n\tpublication: IPublication,\n\tprevPubCID: CID | null,\n) {\n\t// await initWasm()\n\t// const car_data = Wasm.make_car(applogs)\n\t// DEBUG('Car data:', car_data)\n\t// TODO prevent publish if there is no new info\n\tlet logsToPublish = getLogsFromThread(threadToPublish)\n\n\t// const logsFromLastPush = await getLogsFromPub(publication)\n\t// logsToPublish = logsToPublish.filter(eachLog => !logsFromLastPush.includes(eachLog.cid)) // TODO deep compare includes\n\t// const prevPushCIDs = [\n\t// \tpublication.lastCID,\n\t// \t//TODO add this one and update the publication data after push\n\t// ]\n\t// const includedLogCIDs = [\n\t// \t'full array of CIDS from all previous pushes'\n\t// ]\n\n\tDEBUG(`[preparePubForPush] Collected ${logsToPublish.length} logs :`, {\n\t\tlogsToPublish,\n\t\tthreadOrLogsCount: (threadToPublish as any).nameAndSizeUntracked || (`[${(threadToPublish as any).length}]`),\n\t})\n\n\tconst { sharedAgents, sharedKeyMap, sharedKey, pubCounter } = publication ?? {}\n\n\tconst getExistingOrNewLog = (thread: Thread, publication: IPublication, ag: string, at: string, vl) => {\n\t\tlet logInQuestion = rollingFilter(lastWriteWins(thread), { en: publication.id, at }).latestLog\n\t\tif (!logInQuestion && vl !== undefined) {\n\t\t\tlogInQuestion = ensureTsPvAndFinalizeApplog({ ag, en: publication.id, at, vl }, thread)\n\t\t}\n\t\treturn logInQuestion // can be undefined if the passed vl is undefined and the log is not found\n\t}\n\tconst pubNameLog = getExistingOrNewLog(appThread, publication, agent.ag, 'pub/name', publication.name)\n\n\t// ? using did as it is derived from the same ecdh in note3 and part of the minimal AppAgent type required here in wovin core\n\tconst pubCounterLog = getExistingOrNewLog(appThread, publication, agent.ag, 'pub/counter', `${agent.did}<::>${pubCounter}`)\n\t// ? discuss if this works to bind the counter to a specific derivation key - did is not necessarily derived from the same key by all lib users\n\n\tconst encryptApplog = async (applog: Applog, keyToUse: CryptoKey): Promise<Uint8Array> => {\n\t\tconst { log: eachLog, cid } = prepareForPub(applog) // without cid\n\t\tconst enc = new TextEncoder()\n\t\tconst stringified = stringify(eachLog)\n\t\tconst stringifiedEncodedAppLogPayload = enc.encode(stringified) // TODO: consider encodeToDagJson instead\n\t\tVERBOSE('[odd]', { eachLog, stringified, stringifiedEncodedAppLogPayload })\n\n\t\ttry {\n\t\t\t// @ts-expect-error\n\t\t\tconst encPayload = await agent.crypto?.aes.encrypt(stringifiedEncodedAppLogPayload, keyToUse, 'AES-GCM')\n\t\t\t// TODO get rid of odd down here\n\t\t\tVERBOSE('[odd] encrypted length:', stringifiedEncodedAppLogPayload.length, { encPayload })\n\t\t\treturn encPayload\n\t\t} catch (err) {\n\t\t\tthrow ERROR('FAILED TO ENC payload length:', stringifiedEncodedAppLogPayload.length, { err })\n\t\t}\n\n\t\t// const decrypted = await decryptWithAesSharedKey(encPayload, keyToUse, 'string')\n\t}\n\n\tlet maybeEncryptedApplogs: ApplogEncNoCid[] | readonly Applog[]\n\tconst encryptedApplogs = [] as { enc: Uint8Array }[]\n\tconst agentSharedKeyLogs = []\n\tif (sharedAgents) { // encrypt all Applogs\n\t\tif (!sharedKey || !sharedKeyMap) {\n\t\t\tthrow ERROR('sharedAgents but no Keys/Map', { sharedAgents, sharedKeyMap, sharedKey })\n\t\t}\n\t\tVERBOSE('encrypting', { sharedAgents, sharedKeyMap })\n\n\t\tfor (const [eachAgent, eachEncKey] of Array.from(sharedKeyMap.entries())) {\n\t\t\tVERBOSE.force('adding key', { eachAgent, eachEncKey })\n\t\t\tagentSharedKeyLogs.push({\n\t\t\t\tag: agent.ag,\n\t\t\t\ten: eachAgent,\n\t\t\t\tat: 'pub/sharedKey',\n\t\t\t\tvl: eachEncKey, // these are encrypted with the derived key from the local agent private and remote agent public keys\n\t\t\t})\n\t\t}\n\t\t// const encryptedForLogs = await insertApplogsInAppDB(agentSharedKeyLogs)\n\t\t// DEBUG(`[publish] adding agentSharedKeyLogs:`, encryptedForLogs)\n\t\tconst CIDlist: { cid: CidString; encCID?: CidString }[] = []\n\t\tconst pubCIDmap: Record<CidString, typeof CIDlist> = {}\n\t\t// TODO ensure that all needed keys are in\n\t\tfor (const eachLog of logsToPublish) {\n\t\t\tVERBOSE.force('[crypto] encrypting ', { eachLog, sharedKey })\n\t\t\t// try {\n\t\t\tconst encPayload = await encryptApplog(eachLog, sharedKey)\n\t\t\tDEBUG.force('[crypto] encrypted ', { eachLog, encPayload, sharedKey })\n\t\t\t// } catch (err) {\n\t\t\t// \t// its already traced in encryptAndTestDecrypt\n\t\t\t// \t// continue\n\t\t\t// }\n\t\t\tencryptedApplogs.push({ enc: encPayload })\n\t\t}\n\t\tmaybeEncryptedApplogs = encryptedApplogs\n\t} else {\n\t\tmaybeEncryptedApplogs = logsToPublish // publish nonEncrypted\n\t}\n\n\tDEBUG('adding all agent info and pubAtoms', {\n\t\tpublication,\n\t\tagent,\n\t\tlogsToPublish,\n\t\t// threadToPublish, - very verbose\n\t\tagentSharedKeyLogs,\n\t})\n\tconst infoLogs = [\n\t\t...rollingFilter(lastWriteWins(appThread), { // TODO: use static filter for performance\n\t\t\ten: agent.ag,\n\t\t\tat: ['agent/ecdh', 'agent/jwkd', 'agent/appAgent'],\n\t\t}).applogs,\n\t\t...(pubNameLog ? [pubNameLog] : []),\n\t\t...(pubCounterLog ? [pubCounterLog] : []),\n\t\t...agentSharedKeyLogs,\n\t]\n\tDEBUG(`[preparePubForPush] info logs:`, infoLogs)\n\tif (!infoLogs.find(({ at }) => at === 'agent/appAgent')) throw ERROR(`[preparePubForPush] appThread missing agent/appAgent log`)\n\n\tconst applogsToEncode = keepTruthy(maybeEncryptedApplogs)\n\tconst infologsToEncode = keepTruthy(infoLogs)\n\tif (!applogsToEncode.length) {\n\t\tthrow ERROR('no valid applogs', { agent, maybeEncryptedApplogs, infoLogs, applogsToEncode, infologsToEncode, prevPubCID })\n\t}\n\tif (!infologsToEncode.length) {\n\t\tthrow ERROR('no valid infologs', { agent, maybeEncryptedApplogs, infoLogs, applogsToEncode, infologsToEncode, prevPubCID })\n\t}\n\tconst encodedPub = await encodePubAsCar(agent, applogsToEncode, infologsToEncode, prevPubCID)\n\tDEBUG('inPreparePubForPush', { encodedPub })\n\treturn encodedPub\n}\n\n/**\n * @param applogs Encrypted or plain applogs\n * @returns Car file\n */\nexport async function encodePubAsCar(\n\tagent: AppAgent,\n\tapplogs: ApplogArrayNoCIDMaybeEncryptedRO,\n\tinfoLogs: readonly Applog[],\n\tprevPubCID: CID | null,\n) {\n\tDEBUG(`[encodePubAsCar] encoding`, { agent, applogs, infoLogs })\n\tconst { cids: infoLogCids, encodedApplogs: encodedInfoLogs } = await encodeApplogsAsIPLD(infoLogs)\n\tconst { cids: applogCids, encodedApplogs } = await encodeApplogsAsIPLD(applogs)\n\tconst blocks = [...encodedApplogs, ...encodedInfoLogs]\n\t// We need to wrap the array to get a CID\n\tconst infoLogsWrap = await encodeBlockOriginal({ logs: infoLogCids })\n\tblocks.push(infoLogsWrap)\n\tconst { rootCID: chunkRootCID, blocks: chunkBlocks } = await chunkApplogs(applogCids)\n\tblocks.push(...chunkBlocks)\n\tconst infoSignature = await agent.sign(infoLogsWrap.cid.bytes)\n\tconst applogsSignature = await agent.sign(chunkRootCID.bytes)\n\tconst root = {\n\t\tinfo: infoLogsWrap.cid,\n\t\tapplogs: chunkRootCID,\n\t\tinfoSignature,\n\t\tapplogsSignature,\n\t\tprev: prevPubCID,\n\t}\n\tDEBUG('[encodePubAsCar] encoding root', { root, logCids: applogCids, infoLogCids })\n\tconst encodedRoot = await encodeBlockOriginal(root)\n\tblocks.push(encodedRoot)\n\tDEBUG('[encodePubAsCar] => root', { encodedRoot })\n\n\treturn {\n\t\tcid: encodedRoot.cid,\n\t\tblob: await makeCarBlob(encodedRoot.cid, blocks), // TODO: create CarBuilder (incl .encodeAndAdd({...}))\n\t\tblocks,\n\t\tinfoLogCids,\n\t\tapplogCids,\n\t}\n}\n\n/** (i) IPFS has a block size limit of 1MB - which is about 15K CIDs */\nexport async function chunkApplogs(applogCids: CID<unknown, 297, 18, 1>[], size = 10000) {\n\tif (!applogCids.length) throw ERROR(`[chunkApplogs] called with empty array`)\n\tconst chunks = []\n\t// TODO: chunk by stable btree based on size or something like that\n\tfor (let i = 0; i < applogCids.length; i += size) {\n\t\tconst chunk = await encodeBlockOriginal({ logs: applogCids.slice(i, Math.min(i + applogCids.length, i + size)) })\n\t\tchunks.push(chunk)\n\t}\n\tif (chunks.length === 1) return { rootCID: chunks[0].cid, blocks: chunks }\n\tconst root = await encodeBlockOriginal({ chunks: chunks.map(chunk => chunk.cid) })\n\tconst blocks = [root, ...chunks]\n\tDEBUG(`[chunkApplogs] ${applogCids.length} logs chunked into ${chunks.length}`, { applogCids, root, blocks, chunks, dagJson })\n\treturn { rootCID: root.cid, blocks, chunks }\n}\nexport async function unchunkApplogsBlock(block: PubBlockLogsOrChunks, blockStore: BlockStoreish): Promise<CID[]> {\n\tif (isPubBlockChunks(block)) {\n\t\treturn (await Promise.all(\n\t\t\tblock.chunks.map(async (chunkCid) => {\n\t\t\t\tconst block = (await getDecodedBlock(blockStore, chunkCid)) as PubBlockLogs\n\t\t\t\tif (!block.logs) throw ERROR(`Weird chunk`, block)\n\t\t\t\treturn block.logs\n\t\t\t}),\n\t\t)).flat()\n\t} else {\n\t\treturn block.logs\n\t}\n}\nexport function isPubBlockChunks(block: PubBlockLogsOrChunks): block is PubBlockChunks {\n\treturn (block as any).chunks\n}\n/**\n * @param applogs Encrypted or plain applogs\n * @returns Car file\n */\nexport async function encodeApplogsAsCar(\n\tapplogs: ApplogArrayMaybeEncryptedRO,\n) {\n\tconst encoded = await encodeApplogsAsIPLD(applogs)\n\tif (!encoded) throw ERROR('invalid applogs cannot continue', { applogs, encoded })\n\tconst { cids, encodedApplogs } = encoded\n\tconst root = { applogs: cids }\n\tconst encodedRoot = await encodeBlockOriginal(root)\n\tDEBUG('[encodeApplogsAsCar] encoded root', { cids, encodedRoot })\n\n\treturn await makeCarBlob(encodedRoot.cid, [encodedRoot, ...encodedApplogs])\n}\n\nasync function encodeApplogsAsIPLD(applogs: ApplogArrayNoCIDMaybeEncryptedRO) {\n\tDEBUG.force({ applogs })\n\tconst validApplogs = applogs.filter(eachLog => !!eachLog)\n\tDEBUG.force({ validApplogs })\n\tif (!validApplogs.length) throw ERROR('no valid applogs')\n\tconst preppedLogs = validApplogs.map(log => prepareForPub(log as Applog).log)\n\tconst encodedApplogs = await Promise.all(preppedLogs.map(encodeBlockOriginal))\n\tDEBUG.force('[encodeApplogsAsIpld] encoded applogs', { preppedLogs, encodedApplogs })\n\n\tconst cids = encodedApplogs.map(b => {\n\t\tif (!b.cid) throw ERROR(`[publish] no cid for encoded log:`, b)\n\t\treturn b.cid\n\t})\n\treturn { cids, encodedApplogs }\n}\n","import { type AgentHash, type AgentString, agentToShortHash, type AppAgent, type DIDString } from '@wovin/core/pubsub'\nimport { EdDSASigner } from 'iso-signatures/signers/eddsa.js'\n\n// (i) this is more like an interface for DRY, but if it were an interface we'd have to repeat the fields\nabstract class BaseAgentFields {\n\tapp: string\n\tusername: string\n\tdevicename: string\n\tsigner: EdDSASigner\n}\n\nexport class BaseAgent extends BaseAgentFields implements AppAgent {\n\tconstructor(options: BaseAgentFields) {\n\t\tsuper()\n\t\tObject.assign(this, options)\n\t}\n\n\tget did() {\n\t\treturn this.signer.did\n\t}\n\tasync sign(data: Uint8Array): Promise<Uint8Array> {\n\t\treturn await this.signer.sign(data)\n\t}\n\tget ag() {\n\t\treturn agentToShortHash(this.agentString)\n\t}\n\tget shortDID() {\n\t\treturn this.did?.slice(-8)\n\t}\n\tget agentString() {\n\t\treturn `${this.username}.${this.shortDID}@${this.app}.${this.devicename}`\n\t}\n}\n"],"mappings":"AAAA,IAAMA,GAAa,CACf,EAAC,6FACD,EAAC,SAACC,EAAgBC,EAAgB,CAC9B,MAAA,iBAAwBD,EAAc,SAASC,EAAIC,SAAQ,EAAE,uBAajE,EAAG,yEACH,EAAG,2EACH,EAAG,sEACH,EAAG,kEACH,EAAG,qEACH,GAAI,kEACJ,GAAI,kEACJ,GAAE,qBACF,GAAE,2KACF,GAAI,8DACJ,GAAE,kKACF,GAAE,qFACF,GAAE,SAACC,EAAOC,EAAM,CACZ,MAAA,qCAA4CD,EAAK,mBAAmBC,GAExE,GAAI,qGACJ,GAAE,SAACC,EAAK,CACJ,MAAO,yDAA2DA,EAAMC,YAAYC,MAExF,GAAE,SAACF,EAAK,CACJ,MAAO,8BAAgCA,GAE3C,GAAE,SAACG,EAAa,CACZ,MAAA,+BAAsCA,EAAa,KAEvD,GAAI,qGACJ,GAAI,oDACJ,GAAE,SAACC,EAAK,CACJ,MAAO,qCAAuCA,GAElD,GAAE,SAACC,EAAUH,EAAI,CACb,MAAA,cAAqBG,EAAQ,2CAA2CH,EAAI,KAEhF,GAAI,4BACJ,GAAE,SAACG,EAAUH,EAAI,CACb,MAAA,2BAAkCG,EAASR,SAAQ,EAAE,qCAAqCK,EAAI,KAElG,GAAE,SAACE,EAAK,CACJ,MAAO,2BAA6BA,GAExC,GAAI,wBACJ,GAAI,4DACJ,GAAI,mCACJ,GAAE,SAACF,EAAMI,EAAU,CACf,MAAA,iCAAwCJ,EAAI,KAAKI,GAErD,GAAE,SAACJ,EAAI,CACH,MAAA,iCAAwCA,EAAI,mHAEhD,GAAE,SAACA,EAAI,CACH,MAAA,mBAA0BA,EAAI,oEAElC,GAAI,6IACJ,GAAI,2EACJ,GAAE,SAACK,EAAM,CACL,MAAA,2BAAmCA,EAAM,gGAAkGA,EAAM,eAErJ,GAAI,qDACJ,GAAI,6DAGFC,GAAsCd,YAE5Be,GAAIC,EAAmC,4BAAKC,EAAW,IAAAC,MAAAC,EAAA,EAAAA,EAAA,EAAA,CAAA,EAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAXH,EAAWG,EAAA,CAAA,EAAAC,UAAAD,CAAA,EAE/D,IAAIE,EAAS,OAAON,GAAU,SAAWA,EAAQF,GAAOE,CAAK,EAC7D,MAAI,OAAOM,GAAM,aAAYA,EAAIA,EAAEC,MAAM,KAAMN,CAAW,GACpD,IAAIO,MAAK,UAAWF,CAAC,CASnC,CCzFA,IAAMG,GAAa,CAAA,EAEnB,SAAgBC,IAASA,CACrB,OAAI,OAAOC,WAAe,IACfA,WAEP,OAAOC,OAAW,IACXA,OAEP,OAAOC,OAAW,IACXA,OAEP,OAAOC,KAAS,IACTA,KAEJL,EACX,CChBO,IAAMM,GAASC,OAAOD,OAChBE,GAAgBD,OAAOE,yBACvBC,GAAiBH,OAAOG,eACxBC,GAAkBJ,OAAOK,UAEzBC,GAAc,CAAA,EAC3BN,OAAOO,OAAOD,EAAW,EAElB,IAAME,GAAe,CAAA,EAC5BR,OAAOO,OAAOC,EAAY,EAO1B,IAAMC,GAAW,OAAOC,MAAU,IAC5BC,GAAoBX,OAAO7B,SAAQ,EAEzC,SAAgByC,IAAaA,CACpBH,IACD1B,GAEU,2HACqB,CAGvC,CAEA,SAAgB8B,GAA0BC,EAAW,CAClCC,EAAYC,eACvBjC,GACI,gGACI+B,CAAG,CAGnB,CAEA,SAAgBG,IAASA,CACrB,MAAO,EAAEF,EAAYG,QACzB,CAKA,SAAgBC,GAAKC,EAAY,CAC7B,IAAIC,EAAU,GACd,OAAO,UAAA,CACH,GAAIA,CAAAA,EAGJA,OAAAA,EAAU,GACFD,EAAa7B,MAAM,KAAMF,SAAS,EAElD,CAEO,IAAMiC,GAAO,UAAHA,CAAAA,EAEjB,SAAgBC,GAAWC,EAAO,CAC9B,OAAO,OAAOA,GAAO,UACzB,CAEA,SAIgBC,GAAYC,EAAU,CAClC,IAAMC,EAAI,OAAOD,EACjB,OAAQC,EAAC,CACL,IAAK,SACL,IAAK,SACL,IAAK,SACD,MAAO,GAEf,MAAO,EACX,CAEA,SAAgBC,GAASF,EAAU,CAC/B,OAAOA,IAAU,MAAQ,OAAOA,GAAU,QAC9C,CAEA,SAAgBG,GAAcH,EAAU,CACpC,GAAI,CAACE,GAASF,CAAK,EACf,MAAO,GAEX,IAAMI,EAAQ9B,OAAO+B,eAAeL,CAAK,EACzC,GAAII,GAAS,KACT,MAAO,GAEX,IAAME,EAAmBhC,OAAOiC,eAAeC,KAAKJ,EAAO,aAAa,GAAKA,EAAMvD,YACnF,OACI,OAAOyD,GAAqB,YAAcA,EAAiB7D,SAAQ,IAAOwC,EAElF,CAGA,SAAgBwB,GAAYC,EAAQ,CAChC,IAAM7D,EAAc6D,GAAK7D,YACzB,OAAKA,EAIuBA,EAAYC,OAApC,qBACwBD,EAAY8D,cAApC,oBAJO,EASf,CAEA,SAAgBC,GAAcC,EAAaC,EAAuBd,EAAU,CACxEvB,GAAeoC,EAAQC,EAAU,CAC7BC,WAAY,GACZC,SAAU,GACVC,aAAc,GACdjB,MAAAA,EACH,CACL,CAEA,SAAgBkB,GAAmBL,EAAaC,EAAuBd,EAAU,CAC7EvB,GAAeoC,EAAQC,EAAU,CAC7BC,WAAY,GACZC,SAAU,GACVC,aAAc,GACdjB,MAAAA,EACH,CACL,CAEA,SAAgBmB,GACZrE,EACAsE,EAAmC,CAEnC,IAAMN,EAAW,SAAWhE,EAC5BsE,OAAAA,EAASzC,UAAUmC,CAAQ,EAAI,GACxB,SAAUO,EAAC,CACd,OAAOnB,GAASmB,CAAC,GAAKA,EAAEP,CAAQ,IAAM,GAE9C,CAEA,SAAgBQ,GAAStE,EAAU,CAC/B,OAAOA,aAAiBuE,GAC5B,CAEA,SAAgBC,GAASxE,EAAU,CAC/B,OAAOA,aAAiByE,GAC5B,CAEA,IAAMC,GAA2B,OAAOpD,OAAOqD,sBAA0B,IAKzE,SAAgBC,GAAmBf,EAAW,CAC1C,IAAMgB,EAAOvD,OAAOuD,KAAKhB,CAAM,EAE/B,GAAI,CAACa,GACD,OAAOG,EAEX,IAAMC,EAAUxD,OAAOqD,sBAAsBd,CAAM,EACnD,OAAKiB,EAAQnF,OAGb,CAAA,EAAAoF,OAAWF,EAASC,EAAQE,OAAO,SAAAC,EAAC,CAAA,OAAIvD,GAAgBwD,qBAAqB1B,KAAKK,EAAQoB,CAAC,GAAE,EAFlFJ,CAGf,CAIO,IAAMM,GACT,OAAOC,QAAY,KAAeA,QAAQD,QACpCC,QAAQD,QACRT,GACA,SAAAhB,EAAG,CAAA,OAAIpC,OAAO+D,oBAAoB3B,CAAG,EAAEqB,OAAOzD,OAAOqD,sBAAsBjB,CAAG,CAAQ,CAAC,EAC5DpC,OAAO+D,oBAE5C,SAAgBC,GAAa9F,EAAQ,CACjC,OAAI,OAAOA,GAAQ,SACRA,EAEP,OAAOA,GAAQ,SACRA,EAAIC,SAAQ,EAEhB,IAAI8F,OAAO/F,CAAG,EAAEC,SAAQ,CACnC,CAEA,SAAgB+F,GAAYxC,EAAU,CAClC,OAAOA,IAAU,KAAO,KAAO,OAAOA,GAAU,SAAW,GAAKA,EAAQA,CAC5E,CAEA,SAAgByC,GAAQC,EAAgBC,EAAiB,CACrD,OAAOjE,GAAgB6B,eAAeC,KAAKkC,EAAQC,CAAI,CAC3D,CAGO,IAAMC,GACTtE,OAAOsE,2BACP,SAAmCF,EAAW,CAE1C,IAAMG,EAAW,CAAA,EAEjBV,OAAAA,GAAQO,CAAM,EAAEI,QAAQ,SAAAtG,EAAG,CACvBqG,EAAIrG,CAAG,EAAI+B,GAAcmE,EAAQlG,CAAG,EACvC,EACMqG,CACX;0aC1MG,IAAME,GAA0BC,OAAO,yBAAyB,EAOvE,SAAgBC,GACZC,EAAsB,CAEtB,SAASC,EAAUT,EAAQzF,EAAQ,CAC/B,GAAImG,GAAiBnG,CAAQ,EACzB,OAAOiG,EAAWG,gBAAgBX,EAAQzF,CAAQ,EAElDqG,GAAgBZ,EAAQzF,EAAUiG,CAAU,EAGpD,OAAO5E,OAAOD,OAAO8E,EAAWD,CAAU,CAC9C,CAMA,SAAgBI,GAAgB3E,EAAgBnC,EAAkB0G,EAAsB,CAQpF,GAPKT,GAAQ9D,EAAWoE,EAAuB,GAC3CnC,GAAcjC,EAAWoE,GAAuBQ,GAAA,CAAA,EAEzC5E,EAAUoE,EAAuB,CAAC,CAAA,EAI9BS,GAAWN,CAAU,GAAK,CAACT,GAAQ9D,EAAUoE,EAAuB,EAAGvG,CAAG,EAAG,CACxF,IAAMiH,EAAe9E,EAAU9B,YAAYC,KAAI,cAAcN,EAAIC,SAAQ,EACzEY,GACI,IAAIoG,EAAS,sFAC6C,EAIlEC,GAAmB/E,EAAWuE,EAAY1G,CAAG,EAGxCgH,GAAWN,CAAU,IACtBvE,EAAUoE,EAAuB,EAAEvG,CAAG,EAAI0G,EAElD,CAEA,SAASQ,GAAmB/E,EAAmBuE,EAAwB1G,EAAgB,CACnF,GAAe,CAACgH,GAAWN,CAAU,GAAKT,GAAQ9D,EAAUoE,EAAuB,EAAGvG,CAAG,EAAG,CACxF,IAAMiH,EAAe9E,EAAU9B,YAAYC,KAAI,cAAcN,EAAIC,SAAQ,EACnEkH,EAAwBhF,EAAUoE,EAAuB,EAAEvG,CAAG,EAAEoH,gBAChEC,EAA0BX,EAAWU,gBAC3CvG,GACI,kBAAkBwG,EAAuB,SAASJ,EAAS,MAAA;wCACZE,EAAqB,MAAI;;8DAEH,EAGjF,CAKA,SAAgBG,GAAyBpB,EAAM,CAC3C,OAAKD,GAAQC,EAAQK,EAAuB,GAOxCnC,GAAc8B,EAAQK,GAAuBQ,GAAA,CAAA,EAAOb,EAAOK,EAAuB,CAAC,CAAA,EAEhFL,EAAOK,EAAuB,CACzC,CAEA,SAAgBK,GAAiBW,EAAO,CACpC,OAAO,OAAOA,GAAW,UAAY,OAAOA,EAAQ,MAAW,QACnE,CAEA,SAAgBC,GACZD,EACAE,EAAiC,CAEjBA,EAAMC,SAASH,EAAQI,IAAI,GACvC9G,GAAG,6BAC8BkF,OAAOwB,EAAQjH,IAAI,EAAC,yBAC7CiH,EAAQI,KACZ,UAAA,CAGZ,KCjFaC,GAAQpB,OAAO,qBAAqB,EAOpCqB,GAAI,UAAA,CAYb,SAAAA,EAAmBC,EAAAA,CAAAA,IAAAA,SAAAA,EAAkB,QAAU/E,GAAS,GAAW,KAAhD+E,MAAAA,YAXnBC,wBAA0B,GAAK,KAC/BC,iBAAmB,GAAK,KACxBC,WAAa,IAAIhD,IAAkB,KAEnCiD,WAAa,EAAC,KACdC,gBAAkB,EAAC,KACnBC,qBAAuBC,GAAkBC,cAAa,KAQ/CC,MAAK,OAAA,KAELC,OAAM,OALM,KAAA,MAAAV,EAEnB,IAAAW,EAAAZ,EAAA1F,UAAAsG,OAAAA,EAKOC,KAAA,UAAAA,CACC,KAAKH,OACL,KAAKA,MAAMjC,QAAQ,SAAAqC,EAAQ,CAAA,OAAIA,EAAQ,KAE9CF,EAEMG,MAAA,UAAAA,CACC,KAAKJ,QACL,KAAKA,OAAOlC,QAAQ,SAAAqC,EAAQ,CAAA,OAAIA,EAAQ,KAIhDF,EAIOI,eAAA,UAAAA,CACH,OAAOA,GAAe,IAAI,GAG9BJ,EAGOK,cAAA,UAAAA,CACHC,GAAU,EACVC,GAAiB,IAAI,EACrBC,GAAQ,GACXR,EAEDxI,SAAA,UAAAA,CACI,OAAO,KAAK6H,OACfD,CAAA,EAAA,EAGQqB,GAASvE,GAA0B,OAAQkD,EAAI,EAE5D,SAAgBsB,GACZ7I,EACA8I,EACAC,EAAAA,CADAD,IAAAA,SAAAA,EAAsChG,IACtCiG,IAAAA,SAAAA,EAAwCjG,IAExC,IAAMkG,EAAO,IAAIzB,GAAKvH,CAAI,EAE1B,OAAI8I,IAA4BhG,IAC5BmG,GAAiBD,EAAMF,CAAuB,EAG9CC,IAA8BjG,IAC9BoG,GAAmBF,EAAMD,CAAyB,EAE/CC,CACX,CCvFA,SAASG,GAAiBC,EAAQC,EAAM,CACpC,OAAOD,IAAMC,CACjB,CAEA,SAASC,GAAmBF,EAAQC,EAAM,CACtC,OAAOE,GAAUH,EAAGC,CAAC,CACzB,CAEA,SAASG,GAAgBJ,EAAQC,EAAM,CACnC,OAAOE,GAAUH,EAAGC,EAAG,CAAC,CAC5B,CAEA,SAASI,GAAgBL,EAAQC,EAAM,CACnC,OAAI7H,OAAOkI,GACAlI,OAAOkI,GAAGN,EAAGC,CAAC,EAGlBD,IAAMC,EAAID,IAAM,GAAK,EAAIA,IAAM,EAAIC,EAAID,IAAMA,GAAKC,IAAMA,CACnE,CAEA,IAAaM,GAAW,CACpBC,SAAUT,GACVU,WAAYP,GACZ,QAASG,GACTK,QAASN,aCPGO,GAAaC,EAAGC,EAAGjK,EAAI,CAEnC,OAAIkK,GAAaF,CAAC,EACPA,EAIPtJ,MAAMyJ,QAAQH,CAAC,EACRI,GAAWC,MAAML,EAAG,CAAEhK,KAAAA,EAAM,EAEnCqD,GAAc2G,CAAC,EACRI,GAAWrG,OAAOiG,EAAGM,OAAW,CAAEtK,KAAAA,EAAM,EAE/CwE,GAASwF,CAAC,EACHI,GAAWG,IAAIP,EAAG,CAAEhK,KAAAA,EAAM,EAEjC0E,GAASsF,CAAC,EACHI,GAAWI,IAAIR,EAAG,CAAEhK,KAAAA,EAAM,EAEjC,OAAOgK,GAAM,YAAc,CAACS,GAAST,CAAC,GAAK,CAACU,GAAOV,CAAC,EAChDrG,GAAYqG,CAAC,EACNW,GAAKX,CAAC,EAENY,GAAW5K,EAAMgK,CAAC,EAG1BA,CACX,CAEA,SAAgBa,GAAgBb,EAAGC,EAAGjK,EAAI,CAItC,GAHuBgK,GAAM,MAGzBc,GAAmBd,CAAC,GAAKe,GAAkBf,CAAC,GAAKgB,GAAgBhB,CAAC,GAAKiB,GAAgBjB,CAAC,EACxF,OAAOA,EAEX,GAAItJ,MAAMyJ,QAAQH,CAAC,EACf,OAAOI,GAAWC,MAAML,EAAG,CAAEhK,KAAAA,EAAMkL,KAAM,GAAO,EAEpD,GAAI7H,GAAc2G,CAAC,EACf,OAAOI,GAAWrG,OAAOiG,EAAGM,OAAW,CAAEtK,KAAAA,EAAMkL,KAAM,GAAO,EAEhE,GAAI1G,GAASwF,CAAC,EACV,OAAOI,GAAWG,IAAIP,EAAG,CAAEhK,KAAAA,EAAMkL,KAAM,GAAO,EAElD,GAAIxG,GAASsF,CAAC,EACV,OAAOI,GAAWI,IAAIR,EAAG,CAAEhK,KAAAA,EAAMkL,KAAM,GAAO,EAI9C3K,GACI,mGAAmG,CAG/G,CAEA,SAAgB4K,GAAkBC,EAAS,CAEvC,OAAOA,CACX,CAEA,SAAgBC,GAAkBrB,EAAGsB,EAAQ,CAIzC,OAHepB,GAAaF,CAAC,GACzBzJ,GAAG,6DAAA,EAEHgJ,GAAUS,EAAGsB,CAAQ,EACdA,EAEJtB,CACX,CCjFA,IAAMuB,GAAW,WAUjB,SAAgBC,GAAWC,EAAsB,CAC7C,OAAOA,EAAWC,kBAAoBC,EAC1C,UCTgBC,GAAuBC,EAAcC,EAAgB,CACjE,MAAO,CACHC,gBAAiBF,EACjBG,SAAUF,EACVG,MAAAA,GACAC,QAAAA,GACAC,gBAAAA,GAER,CAEA,SAASF,GAELG,EACAC,EACAC,EACAC,EAAc,OAGd,IAAAC,EAAI,KAAKR,WAAQ,MAAbQ,EAAeC,MACf,OAAO,KAAKP,QAAQE,EAAKC,EAAKC,EAAY,EAAK,IAAM,KAAI,EAAA,EAK7D,GAAIC,IAAWH,EAAIM,QACf,OAAO,KAAKR,QAAQE,EAAKC,EAAKC,EAAY,EAAK,IAAM,KAAI,EAAA,EAK7D,GAAIK,GAASL,EAAWM,KAAK,EAGzB,MAAA,GAEJ,IAAMC,EAAmBC,GAAuBV,EAAK,KAAMC,EAAKC,EAAY,EAAK,EACjFS,OAAAA,GAAeR,EAAQF,EAAKQ,CAAgB,EAC5C,CACJ,CAEA,SAASX,GAELE,EACAC,EACAC,EACAU,EAAkB,CAElB,IAAMH,EAAmBC,GAAuBV,EAAK,KAAMC,EAAKC,CAAU,EAC1E,OAAOF,EAAIa,gBAAgBZ,EAAKQ,EAAkBG,CAAS,CAC/D,CAEA,SAASb,GAAkCe,EAAMC,EAAyB,CAElEC,GAAyBD,EAAS,CAAC,SAAU,OAAO,CAAC,EAEzD,IAAQE,EAA+BF,EAA/BE,KAAMxB,EAAyBsB,EAAzBtB,KAAMyB,EAAmBH,EAAnBG,eACdC,EAAM,KAENC,EAAgB,SAAAC,EAAC,CAAA,IAAAC,EAAAC,EAAAC,EAAAC,EAAA,OACnBC,IAAYJ,GAAAC,EAACJ,EAAIvB,WAAQ,KAAA,OAAZ2B,EAAc9B,OAAI,KAAA6B,EAAI7B,EAAMkC,SAAQ,EAAIN,GAACG,GAAAC,EAAEN,EAAIvB,WAAQ,KAAA,OAAZ6B,EAAcG,aAAU,KAAAJ,EAAI,EAAK,GAG7F,GAAIP,GAAQ,QAAS,CACjBC,EAAe,UAAA,CACXW,GAAgB,KAAMpC,EAAM0B,CAAG,EAClC,EACD,OAGJ,GAAIF,GAAQ,SAAU,CAAA,IAAAa,EAClB,OAAKvB,GAASO,CAAI,IACdA,EAAOM,EAAcN,CAAI,IAG7BgB,EAAI,KAAKlC,WAAQ,MAAbkC,EAAezB,OACfa,EAAe,UAAA,CACX,IAAMa,EAAO,KACP1B,EAAQ0B,EAAKtC,CAAI,EAAEuC,KAAKD,CAAI,EAClC1B,EAAM4B,aAAe,GACrBF,EAAKtC,CAAI,EAAIY,EAChB,EAGES,EAGXoB,GACI,iBAAiBf,EAAIxB,gBAAe,SAASwC,OAAO1C,CAAI,EAAC,YAAYwB,EAAI,MAAA;GAC/DE,EAAIxB,gBAAe,0DAAyD,CAE9F,CAEA,SAASyC,GACLpC,EAAmCqC,EAEnCpC,EAAgBqC,EAAA,KADd3C,EAAe0C,EAAf1C,gBAEAa,EAAK8B,EAAL9B,MAEc+B,GAAW/B,CAAK,GAC5B0B,GACI,iBAAiBvC,EAAe,SAASK,EAAIwC,MAAK,IAAIvC,EAAI0B,SAAQ,EAAE,MAAA;GAC1DhC,EAAe,0DAAyD,CAG9F,CAEA,SAAgBe,GACZV,EACAyC,EACAxC,EACAC,EAEAwC,EAAAA,mBAAAA,IAAAA,SAAAA,EAA2BC,EAAYD,iBAEvCN,GAAuBpC,EAAKyC,EAAYxC,EAAKC,CAAU,EACvD,IAAMM,EAAUN,EAAVM,MACN,IAAAoC,EAAIH,EAAW7C,WAAQ,MAAnBgD,EAAqBvC,MAAO,CAAA,IAAAwC,EAC5BrC,EAAQA,EAAMwB,MAAIa,EAAC7C,EAAI8C,SAAM,KAAAD,EAAI7C,EAAIM,OAAO,EAEhD,MAAO,CACHE,MAAOkB,IAAYqB,GAAAC,EACfP,EAAW7C,WAAQ,KAAA,OAAnBoD,EAAqBvD,OAAI,KAAAsD,EAAI9C,EAAI0B,SAAQ,EACzCnB,GAAKyC,GAAAC,EACLT,EAAW7C,WAAQ,KAAA,OAAnBsD,EAAqBtB,aAAU,KAAAqB,EAAI,IAEnCE,EAAAV,EAAW7C,WAAQ,MAAnBuD,EAAqB9C,OAAK+C,EAAGpD,EAAI8C,SAAM,KAAAM,EAAIpD,EAAIM,QAAU+C,MAAS,EAItEC,aAAcZ,EAAkB1C,EAAIuD,eAAiB,GAErDC,WAAY,GAGZC,SAAUf,CAAAA,EAElB,UCxIgBgB,GAAqBjE,EAAcC,EAAgB,CAC/D,MAAO,CACHC,gBAAiBF,EACjBG,SAAUF,EACVG,MAAAA,GACAC,QAAAA,GACAC,gBAAAA,GAER,CAEA,SAASF,GAELG,EACAC,EACAC,EACAC,EAAc,OAGd,GAAIA,IAAWH,EAAIM,QACf,OAAO,KAAKR,QAAQE,EAAKC,EAAKC,EAAY,EAAK,IAAM,KAAI,EAAA,EAM7D,IAAIE,EAAA,KAAKR,WAAQ,MAAbQ,EAAeC,QAAU,CAACsD,GAAQ3D,EAAIM,QAASL,CAAG,GAAK,CAAC2D,GAAO5D,EAAIM,QAAQL,CAAG,CAAC,IAC3E,KAAKH,QAAQE,EAAKC,EAAKC,EAAY,EAAK,IAAM,KAC9C,MAAA,GAGR,GAAI0D,GAAO1D,EAAWM,KAAK,EAGvB,MAAA,GAEJ,IAAMqD,EAAiBC,GAAqB9D,EAAK,KAAMC,EAAKC,EAAY,GAAO,EAAK,EACpFS,OAAAA,GAAeR,EAAQF,EAAK4D,CAAc,EAC1C,CACJ,CAEA,SAAS/D,GAELE,EACAC,EACAC,EACAU,EAAkB,OAEZiD,EAAiBC,GAAqB9D,EAAK,KAAMC,EAAKC,GAAU4B,EAAE,KAAKlC,WAAQ,KAAA,OAAbkC,EAAezB,KAAK,EAC5F,OAAOL,EAAIa,gBAAgBZ,EAAK4D,EAAgBjD,CAAS,CAC7D,CAEA,SAASb,GAAkCe,EAAMC,EAAoC,OAE7EC,GAAyBD,EAAS,CAAC,QAAQ,CAAC,EAEhD,IAAQtB,EAAyBsB,EAAzBtB,KAAMyB,EAAmBH,EAAnBG,eAEd,OAAK0C,GAAO9C,CAAI,IACZA,EAAOiD,GAAKjD,CAAI,IAGpBkD,EAAI,KAAKpE,WAAQ,MAAboE,EAAe3D,OACfa,EAAe,UAAA,CACX,IAAMa,EAAO,KACP1B,EAAQ0B,EAAKtC,CAAI,EAAEuC,KAAKD,CAAI,EAClC1B,EAAM4D,WAAa,GACnBlC,EAAKtC,CAAI,EAAIY,EAChB,EAGES,CACX,CAEA,SAASoD,GACLlE,EAAmCqC,EAEnCpC,EAAgBqC,EAAA,KADd3C,EAAe0C,EAAf1C,gBAEAa,EAAK8B,EAAL9B,MAEc+B,GAAW/B,CAAK,GAC5B0B,GACI,iBAAiBvC,EAAe,SAASK,EAAIwC,MAAK,IAAIvC,EAAI0B,SAAQ,EAAE,MAAA;GAC1DhC,EAAe,oEAAmE,CAGxG,CAEA,SAASmE,GACL9D,EACAyC,EACAxC,EACAC,EACAG,EAEAqC,EAAAA,CAAAA,IAAAA,SAAAA,EAA2BC,EAAYD,iBAEvCwB,GAAqBlE,EAAKyC,EAAYxC,EAAKC,CAAU,EACrD,IAAMM,EAAUN,EAAVM,MAKN,GAHKoD,GAAOpD,CAAK,IACbA,EAAQuD,GAAKvD,CAAK,GAElBH,EAAO,CAAA,IAAAwC,EAEPrC,EAAQA,EAAMwB,MAAIa,EAAC7C,EAAI8C,SAAM,KAAAD,EAAI7C,EAAIM,OAAO,EAE5CE,EAAMyD,WAAa,GAEvB,MAAO,CACHzD,MAAAA,EAGA8C,aAAcZ,EAAkB1C,EAAIuD,eAAiB,GAErDC,WAAY,GAGZC,SAAUf,CAAAA,EAElB,UC1HgByB,GAAyB1E,EAAcC,EAAgB,CACnE,MAAO,CACHC,gBAAiBF,EACjBG,SAAUF,EACVG,MAAAA,GACAC,QAAAA,GACAC,gBAAAA,GAER,CAEA,SAASF,GAELG,EACAC,EACAC,EAA8B,CAE9B,OAAO,KAAKJ,QAAQE,EAAKC,EAAKC,EAAY,EAAK,IAAM,KAAI,EAAA,CAC7D,CAEA,SAASJ,GAELE,EACAC,EACAC,EACAU,EAAkB,CAElBwD,OAAAA,GAAyBpE,EAAK,KAAMC,EAAKC,CAAU,EAC5CF,EAAIqE,wBACPpE,EAAGqE,GAAA,CAAA,EAEI,KAAK1E,SAAQ,CAChB2E,IAAKrE,EAAWqE,IAChBC,IAAKtE,EAAWsE,MAEpB5D,CAAS,CAEjB,CAEA,SAASb,GAAkCwE,EAAKxD,EAAoC,CAE5EC,GAAyBD,EAAS,CAAC,QAAQ,CAAC,EAEhD,IAAMI,EAAM,KACElB,EAAwBc,EAA9BtB,KAAWyB,EAAmBH,EAAnBG,eAEnBA,OAAAA,EAAe,UAAA,CACX,IAAMlB,EAAsCyE,GAAmB,IAAI,EAAEC,EAAK,EACpEhF,EAAO4E,GAAA,CAAA,EACNnD,EAAIvB,SAAQ,CACf2E,IAAAA,EACAxD,QAAS,OAEbrB,EAAQD,OAARC,EAAQD,KACCO,EAAIwC,MAAK,IAAIvC,EAAI0B,SAAQ,GAElC3B,EAAI2E,QAAQH,IAAIvE,EAAK,IAAI2E,GAAclF,CAAO,CAAC,EAClD,EAEM,UAAA,CACH,OAAO,KAAKgF,EAAK,EAAEG,wBAAwB5E,CAAG,EAEtD,CAEA,SAASmE,GACLpE,EAAmCqC,EAEnCpC,EAAgBqC,EAAA,KADd3C,EAAe0C,EAAf1C,gBAEA4E,EAAGjC,EAAHiC,IAEcA,GACZrC,GACI,iBAAiBvC,EAAe,SAASK,EAAIwC,MAAK,IAAIvC,EAAI0B,SAAQ,EAAE,MAAA;GAC1DhC,EAAe,oDAAmD,CAGxF,UC1EgBmF,GAA2BrF,EAAcC,EAAgB,CACrE,MAAO,CACHC,gBAAiBF,EACjBG,SAAUF,EACVG,MAAAA,GACAC,QAAAA,GACAC,gBAAAA,GAER,CAEA,SAASF,GAELG,EACAC,EACAC,EAA8B,CAE9B,OAAO,KAAKJ,QAAQE,EAAKC,EAAKC,EAAY,EAAK,IAAM,KAAI,EAAA,CAC7D,CAEA,SAASJ,GAELE,EACAC,EACAC,EACAU,EAAkB,SAElBmE,OAAAA,GAA2B/E,EAAK,KAAMC,EAAKC,CAAU,EAC9CF,EAAIgF,0BACP/E,EACAC,EAAWM,OAAKyE,GAAA7E,EAChB,KAAKR,WAAQ,KAAA,OAAbQ,EAAe8E,WAAQ,KAAAD,EAAIE,GAC3BvE,CAAS,CAEjB,CAEA,SAASb,GAELqF,EACArE,EAAmE,CAG/D,GAAIA,EAAQE,OAAS,QACjB,MAAMiB,GAAG,oCACgCC,OACjCpB,EAAQtB,IAAI,EACf,6BAA+B0C,OAAOpB,EAAQtB,IAAI,EAAC,GAAA,EAG5DuB,GAAyBD,EAAS,CAAC,UAAU,CAAC,EAGlD,IAAMI,EAAM,KACJF,EAAeF,EAAfE,KAAMxB,EAASsB,EAATtB,KASR4F,EAAqB,IAAIC,QAE/B,SAASC,EAAqBC,EAAQhF,EAAK,SACjCR,EAAsCyE,GAAmBe,CAAM,EAAEd,EAAK,EACtEe,EAAa,IAAIC,GACnBlF,GAAKmF,GAAApE,EACLJ,EAAIvB,WAAQ,KAAA,OAAZ2B,EAAc2D,WAAQ,KAAAS,EAAIR,GACbnF,EAAIwC,MAAK,IAAI/C,EAAKkC,SAAQ,EACvC,EAAK,EAET3B,EAAI2E,QAAQH,IAAI/E,EAAMgG,CAAU,EAChCJ,EAAmBO,IAAIJ,CAAM,EAGjC,GAAIvE,GAAQ,WACR,MAAO,CACHsD,IAAG,UAAAA,CACC,OAAKc,EAAmBQ,IAAI,IAAI,GAC5BN,EAAqB,KAAMH,EAAKb,IAAIuB,KAAK,IAAI,CAAC,EAE3C,KAAKpB,EAAK,EAAEG,wBAAwBpF,CAAI,GAEnD+E,IAAG,SAAChE,EAAK,CACL,OAAK6E,EAAmBQ,IAAI,IAAI,GAC5BN,EAAqB,KAAM/E,CAAK,EAE7B,KAAKkE,EAAK,EAAEqB,wBAAwBtG,EAAMe,CAAK,GAE1DwF,KAAI,SAACxF,EAAK,CACN,OAAK6E,EAAmBQ,IAAI,IAAI,GAC5BN,EAAqB,KAAM/E,CAAK,EAE7BA,GAMvB,CAEA,SAASuE,GACL/E,EAAmCqC,EAEnCpC,EACAC,EAA8B,KAF5BP,EAAe0C,EAAf1C,gBAIe,UAAWO,GACxBgC,GACI,iBAAiBvC,EAAe,SAASK,EAAIwC,MAAK,IAAIvC,EAAI0B,SAAQ,EAAE,MAAA;GAC1DhC,EAAe,+CAA8C,CAGnF,CC9GA,IAAMsG,GAAO,OAEAC,GAA6BC,GAAoB,EAE9D,SAAgBA,GAAqBzG,EAAgB,CACjD,MAAO,CACHC,gBAAiBsG,GACjBrG,SAAUF,EACVG,MAAAA,GACAC,QAAAA,GACAC,gBAAAA,GAER,CAEA,SAASF,GACLG,EACAC,EACAC,EACAC,EAAc,SAGd,GAAID,EAAWqE,IACX,OAAO6B,GAASvG,MAAMG,EAAKC,EAAKC,EAAYC,CAAM,EAGtD,GAAID,EAAWsE,IAAK,CAEhB,IAAMA,EAAM9C,GAAazB,EAAI0B,SAAQ,EAAIzB,EAAWsE,GAAG,EAEvD,OAAIrE,IAAWH,EAAIM,QACRN,EAAIa,gBAAgBZ,EAAK,CAC5BqD,aAAcX,EAAYD,gBAAkB1C,EAAIuD,eAAiB,GACjEiB,IAAAA,EACH,IAAM,KAAI,EAAA,GAKf7D,GAAeR,EAAQF,EAAK,CACxBqD,aAAc,GACdkB,IAAAA,EACH,EACD,GAGJ,GAAIrE,IAAWH,EAAIM,SAAW,OAAOJ,EAAWM,OAAU,WAAY,CAAA,IAAAsB,EAClE,GAAIuE,GAAYnG,EAAWM,KAAK,EAAG,CAAA,IAAAJ,EACzBkG,GAAiBlG,EAAA,KAAKR,WAAQ,MAAbQ,EAAemG,SAAWxC,GAAK1D,MAAQ0D,GAC9D,OAAOuC,EAAezG,MAAMG,EAAKC,EAAKC,EAAYC,CAAM,EAE5D,IAAMqG,GAAmB1E,EAAA,KAAKlC,WAAQ,MAAbkC,EAAeyE,SAAW3E,GAAWvB,MAAQuB,GACtE,OAAO4E,EAAiB3G,MAAMG,EAAKC,EAAKC,EAAYC,CAAM,EAK9D,IAAIsG,IAAuBzC,EAAA,KAAKpE,WAAQ,KAAA,OAAboE,EAAe0C,QAAS,GAAQjB,GAAWkB,IAAMlB,GAE5E,GAAI,OAAOvF,EAAWM,OAAU,aAAUoG,EAAI,KAAKhH,WAAQ,MAAbgH,EAAeL,SAAU,CAAA,IAAA1D,EACnE3C,EAAWM,MAAQN,EAAWM,MAAMwB,MAAIa,EAAC7C,EAAI8C,SAAM,KAAAD,EAAI7C,EAAIM,OAAO,EAEtE,OAAOmG,EAAqB5G,MAAMG,EAAKC,EAAKC,EAAYC,CAAM,CAClE,CAEA,SAASL,GACLE,EACAC,EACAC,EACAU,EAAkB,SAGlB,GAAIV,EAAWqE,IACX,OAAO6B,GAAStG,QAAQE,EAAKC,EAAKC,EAAYU,CAAS,EAG3D,GAAIV,EAAWsE,IAEX,OAAOxE,EAAIa,gBACPZ,EACA,CACIqD,aAAcX,EAAYD,gBAAkB1C,EAAIuD,eAAiB,GACjEiB,IAAK9C,GAAazB,EAAI0B,SAAQ,EAAIzB,EAAWsE,GAAG,GAEpD5D,CAAS,EAKjB,GAAI,OAAOV,EAAWM,OAAU,aAAUqG,EAAI,KAAKjH,WAAQ,MAAbiH,EAAeN,SAAU,CAAA,IAAAnD,EACnElD,EAAWM,MAAQN,EAAWM,MAAMwB,MAAIoB,EAACpD,EAAI8C,SAAM,KAAAM,EAAIpD,EAAIM,OAAO,EAEtE,IAAImG,IAAuBK,EAAA,KAAKlH,WAAQ,KAAA,OAAbkH,EAAeJ,QAAS,GAAQjB,GAAWkB,IAAMlB,GAC5E,OAAOgB,EAAqB3G,QAAQE,EAAKC,EAAKC,EAAYU,CAAS,CACvE,CAEA,SAASb,GAAkCqF,EAAMrE,EAAoC,CACjFmB,GAAG,IAAK,KAAKvC,gBAAe,iCAAA,CAChC,CC1EO,IAAMoH,GAAa,aACbC,GAAiB,iBACjBC,GAAqB,qBACrBC,GAAoB,oBAapBC,GAA0D,CACnET,KAAM,GACNjH,KAAM4D,OACN+D,iBAAkB/D,OAClBgE,MAAO,IAEXC,OAAOC,OAAOJ,EAA8B,EAE5C,SAAgBK,GAA0BC,EAAU,CAChD,OAAOA,GAASN,EACpB,CAEA,IAAMV,GAAuB3B,GAA2BiC,EAAU,EAC5DW,GAA0B5C,GAA2BkC,GAAgB,CACvE9B,SAAUyC,GACb,EACKC,GAA8B9C,GAA2BmC,GAAoB,CAC/E/B,SAAU2C,GACb,EACKC,GAA6BhD,GAA2BoC,GAAmB,CAC7EhC,SAAU6C,GACb,EACKC,GACFC,GAAkDxB,EAAoB,EAE1E,SAAgByB,GAAuBxI,EAAgC,CACnE,OAAOA,EAAQgH,OAAS,GAClBvB,GACAzF,EAAQgH,OAAS,GACjBiB,GACAQ,GAA0BzI,EAAQ0H,gBAAgB,CAC5D,CAEA,SAAgBgB,GACZ1I,EAAiC,OAEjC,OAAOA,GAAO2I,EAAG3I,EAAQ0H,mBAAgB,KAAAiB,EAAIlC,GAAqBzG,CAAO,EAAI2D,MACjF,CAEA,SAAgB8E,GAA0B1F,EAAuB,SAC7D,OAAQA,IAAyBM,GAAAH,EAAGH,EAAW7C,WAAQ,KAAA,OAAnBgD,EAAqBsC,WAAQ,KAAAnC,EAA5CoC,EACzB,CAMA,SAASmD,GAAiBC,EAAQC,EAAYC,EAAU,CAEpD,GAAIC,GAAiBF,CAAI,EACrB,OAAO/B,GAAqB1G,gBAAgBwI,EAAGC,CAAI,EAIvD,GAAIG,GAAYH,CAAI,EAAG,CACnB3G,GAAgB0G,EAAGC,EAAM/B,EAAoB,EAC7C,OAIJ,OAAImC,GAAaL,CAAC,EACPA,EAIPM,GAAcN,CAAC,EACR9C,GAAWqD,OAAOP,EAAGC,EAAMC,CAAI,EAItCM,MAAMC,QAAQT,CAAC,EACR9C,GAAWwD,MAAMV,EAAGC,CAAI,EAI/BU,GAASX,CAAC,EACH9C,GAAW0D,IAAIZ,EAAGC,CAAI,EAI7BY,GAASb,CAAC,EACH9C,GAAWjB,IAAI+D,EAAGC,CAAI,EAI7B,OAAOD,GAAM,UAAYA,IAAM,KACxBA,EAIJ9C,GAAW4D,IAAId,EAAGC,CAAI,CACjC,CACAc,GAAOhB,GAAkBN,EAA6B,EAkDtD,IAAMuB,GAA0C,CAC5CF,IAAG,SAAU7I,EAAUd,EAAiC,CACpD,IAAM8J,EAAIhC,GAA0B9H,CAAO,EAC3C,OAAO,IAAIgG,GAAgBlF,EAAO0H,GAAuBsB,CAAC,EAAGA,EAAE/J,KAAM,GAAM+J,EAAEC,MAAM,GAEvFR,MAAK,SAAUS,EAAqBhK,EAAiC,CACjE,IAAM8J,EAAIhC,GAA0B9H,CAAO,EAC3C,OACIiD,EAAYgH,aAAe,IAASH,EAAEnC,QAAU,GAC1CuC,GACAC,IACRH,EAAexB,GAAuBsB,CAAC,EAAGA,EAAE/J,IAAI,GAEtD0J,IAAG,SACCO,EACAhK,EAAiC,CAEjC,IAAM8J,EAAIhC,GAA0B9H,CAAO,EAC3C,OAAO,IAAIoK,GAAoBJ,EAAexB,GAAuBsB,CAAC,EAAGA,EAAE/J,IAAI,GAEnF+E,IAAG,SACCkF,EACAhK,EAAiC,CAEjC,IAAM8J,EAAIhC,GAA0B9H,CAAO,EAC3C,OAAO,IAAIqK,GAAiBL,EAAexB,GAAuBsB,CAAC,EAAGA,EAAE/J,IAAI,GAEhFqJ,OAAM,SACFkB,EACAC,EACAvK,EAAiC,CAEjC,OAAOwK,GAAe,UAAA,CAAA,OAClBC,GACIxH,EAAYgH,aAAe,IAASjK,GAAS2H,QAAU,GACjD5C,GAAmB,CAAA,EAAI/E,CAAO,EAC9B0K,GAA0B,CAAA,EAAI1K,CAAO,EAC3CsK,EACAC,CAAU,KAItBtD,IAAKsB,GAA0BP,EAAuB,EACtD2C,QAASpC,GAA0BL,EAA2B,EAC9DlB,KAAMsB,GACNsC,OAAQrC,GAA0BH,EAA0B,GAIrDrC,GAAiC6D,GAAOhB,GAAkBiB,EAAmB,ECnO3EgB,GAAW,WACXC,GAAkB,kBAWzBC,GAAqBtG,GAAyBoG,EAAQ,EACtDG,GAA2BvG,GAAyBqG,GAAiB,CACvEf,OAAQkB,GAASC,WACpB,EAMYxE,GAA6B,SAAkByE,EAAMrC,EAAI,CAClE,GAAIE,GAAiBF,CAAI,EAErB,OAAOiC,GAAmB1K,gBAAgB8K,EAAMrC,CAAI,EAExD,GAAIG,GAAYH,CAAI,EAEhB,OAAO3G,GAAgBgJ,EAAMrC,EAAMiC,EAAkB,EAEzD,GAAI5B,GAAcgC,CAAI,EAElB,OAAO5C,GAA0B9D,GAAyBoG,GAAUM,CAAI,CAAC,EAKpEtI,GAAWsI,CAAI,GAChB3I,GAAI,uDAAuD,EAE3DK,GAAWiG,CAAI,GACftG,GACI,sFAAsF,EAIlG,IAAM4I,EAAmCjC,GAAcL,CAAI,EAAIA,EAAO,CAAA,EACtEsC,OAAAA,EAAKvG,IAAMsG,EACXC,EAAKrL,OAALqL,EAAKrL,KAASoL,EAAKpL,MAAQ,IAEpB,IAAImF,GAAckG,CAAI,CACjC,EAEAxD,OAAOgC,OAAOlD,GAAUqE,EAAkB,EAE1CrE,GAASkE,OAASrC,GAA0ByC,EAAwB,YCnDhEK,GAAkB,EAClBC,GAAe,EACbC,IAA0BC,IAAAC,GAAGC,GAAc,UAAA,CAAA,EAAU,MAAM,IAAC,KAAA,OAA/BD,GAAiC7H,eAAY,KAAA4H,GAAI,GAG9EG,GAAwC,CAC1C7K,MAAO,SACP8C,aAAc,GACdG,SAAU,GACVD,WAAY,IAGhB,SAAgB9B,GACZ4J,EACAC,EACA3J,EACA+E,EAAY,CADZ/E,IAAAA,SAAAA,EAAsB,IAIbW,GAAWgJ,CAAE,GACdrJ,GAAI,2CAA2C,GAE/C,OAAOoJ,GAAe,UAAY,CAACA,IACnCpJ,GAAG,0CAA2CoJ,EAAU,GAAA,EAGhE,SAASE,GAAGA,CACR,OAAOC,GAAcH,EAAY1J,EAAY2J,EAAI5E,GAAO,KAAM+E,SAAS,EAE3EF,OAAAA,EAAIvJ,aAAe,GACnBuJ,EAAI7J,SAAW,UAAA,CAAA,OAAM4J,EAAG5J,SAAQ,GAC5BsJ,KACAI,GAAkB7K,MAAQ8K,EAC1B3K,GAAe6K,EAAK,OAAQH,EAAiB,GAE1CG,CACX,CAEA,SAAgBC,GACZH,EACAK,EACAJ,EACAK,EACAC,EAAiB,CAEjB,IAAMC,EAAUC,GAAaT,EAAYK,EAAoBC,EAAOC,CAAI,EACxE,GAAI,CACA,OAAON,EAAGS,MAAMJ,EAAOC,CAAI,QACtBI,EAAK,CACVH,MAAAA,EAAQI,OAASD,EACXA,UAENE,GAAWL,CAAO,EAE1B,CAcA,SAAgBC,GACZT,EACAK,EACAC,EACAC,EAAiB,CAEjB,IAAMO,EAAwBC,GAAY,GAAM,CAAC,CAACf,EAC9CgB,EAAqB,EACzB,GAAeF,EAAY,CACvBE,EAAaC,KAAKC,IAAG,EACrB,IAAMC,EAAgBZ,EAAO9C,MAAM2D,KAAKb,CAAI,EAAIc,GAChDC,GAAe,CACXC,KAAMC,GACNrN,KAAM6L,EACNxC,OAAQ8C,EACRF,UAAWe,EACd,EAEL,IAAMM,EAAkBpK,EAAYqK,mBAC9BC,EAAc,CAACtB,GAAsB,CAACoB,EAC5CG,GAAU,EACV,IAAIC,EAAyBxK,EAAYyK,kBACrCH,IACAI,GAAc,EACdF,EAAyBG,GAAuB,EAAI,GAExD,IAAMC,EAAuBC,GAAqB,EAAI,EAChD1B,EAAU,CACZ2B,aAAcR,EACdF,gBAAAA,EACAI,uBAAAA,EACAI,qBAAAA,EACAnB,WAAAA,EACAE,WAAAA,EACAoB,UAAW1C,KACX2C,gBAAiB5C,IAErBA,OAAAA,GAAkBe,EAAQ4B,UACnB5B,CACX,CAEA,SAAgBK,GAAWL,EAAuB,CAC1Cf,KAAoBe,EAAQ4B,WAC5BxL,GAAI,EAAE,EAEV6I,GAAkBe,EAAQ6B,gBAEtB7B,EAAQI,SAAW7I,SACnBV,EAAYiL,uBAAyB,IAEzCC,GAAqB/B,EAAQqB,sBAAsB,EACnDW,GAAmBhC,EAAQyB,oBAAoB,EAC/CQ,GAAQ,EACJjC,EAAQ2B,cACRO,GAAalC,EAAQiB,eAAe,EAEzBjB,EAAQM,YACnB6B,GAAa,CAAEC,KAAM3B,KAAKC,IAAG,EAAKV,EAAQQ,WAAY,EAE1D3J,EAAYiL,uBAAyB,EACzC,CAEA,SAAgBR,GAAqBA,EAA4Be,EAAa,CAC1E,IAAMC,EAAOd,GAAuBF,CAAiB,EACrD,GAAI,CACA,OAAOe,EAAI,UAEXN,GAAqBO,CAAI,EAEjC,CAEA,SAAgBd,GAAuBF,EAA0B,CAC7D,IAAMgB,EAAOzL,EAAYyK,kBACzBzK,OAAAA,EAAYyK,kBAAoBA,EACzBgB,CACX,CAEA,SAAgBP,GAAqBO,EAAa,CAC9CzL,EAAYyK,kBAAoBgB,CACpC,QChHMC,GAAS,SAAQC,GAsIlBC,OAAOC,YApIZ,IAAa9I,GACT,SAAA+I,EAAA,CAAAC,GAAAhJ,EAAA+I,CAAA,EASA,SAAA/I,EACIlF,EACO0E,EACA1C,EACPmM,EACQlF,EAAAA,cAFDjH,IAAAA,SAAAA,EAAkB,mBAAqBoM,GAAS,GACvDD,IAAS,SAATA,EAAY,IACJlF,IAAAA,SAAAA,EAA+BkB,GAAQ,SAE/CkE,EAAAJ,EAAA3I,KAAA,KAAMtD,CAAK,GAAC,KAAAqM,EALL3J,SAAAA,SACA1C,MAAAA,SAECiH,OAAAA,SAXZqF,qBAAuB,GAAKD,EAC5BE,cAAa,OAAAF,EACbG,iBAAgB,OAAAH,EAChBI,OAAM,OAAAJ,EACNK,SAAQ,OAIGL,EAAA,SAAA3J,EACA2J,EAAA,MAAArM,EAECqM,EAAA,OAAApF,EAGRoF,EAAKI,OAAS/J,EAAS1E,EAAO6C,OAAWb,CAAK,EAC/BmM,GAAatC,GAAY,GAEpC8C,GAAU,CACNtC,KAAMwB,GACNvF,OAAMsG,GAAAP,CAAA,EACNQ,eAAgB,QAChBC,gBAAiBT,EAAKrM,MACtB+M,SAAU,GAAKV,EAAKI,OACvB,EACJJ,EACJ,IAAAW,EAAA9J,EAAA+J,UAAAD,OAAAA,EAEOE,aAAA,SAAalP,EAAQ,CACzB,OAAI,KAAK0O,WAAa7L,OACX,KAAK6L,SAAS1O,CAAK,EAEvBA,GACVgP,EAEMhL,IAAA,SAAI+K,EAAW,CAClB,IAAMI,EAAW,KAAKV,OAEtB,GADAM,EAAW,KAAKK,iBAAiBL,CAAQ,EACrCA,IAAa5M,EAAYkN,UAAW,CACpC,IAAMlB,EAAYtC,GAAY,EACfsC,GACX/B,GAAe,CACXC,KAAMiD,GACNhH,OAAQ,KACRuG,eAAgB,QAChBC,gBAAiB,KAAK9M,MACtB+M,SAAAA,EACAI,SAAAA,EACH,EAEL,KAAKI,aAAaR,CAAQ,EACXZ,GACXV,GAAY,IAGvBuB,EAEOI,iBAAA,SAAiBL,EAAQ,CAE7B,GADAS,GAAoC,IAAI,EACpCC,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAqC,KAAM,CACtDrH,OAAQ,KACR+D,KAAMiD,GACNP,SAAAA,EACH,EACD,GAAI,CAACW,EACD,OAAOvN,EAAYkN,UAEvBN,EAAWW,EAAOX,SAGtBA,OAAAA,EAAW,KAAKrK,SAASqK,EAAU,KAAKN,OAAQ,KAAKzM,KAAK,EACnD,KAAKiH,OAAO,KAAKwF,OAAQM,CAAQ,EAAI5M,EAAYkN,UAAYN,GACvEC,EAEDO,aAAA,SAAaR,EAAW,CACpB,IAAMI,EAAW,KAAKV,OACtB,KAAKA,OAASM,EACd,KAAKa,cAAa,EACdC,GAAa,IAAI,GACjBC,GAAgB,KAAM,CAClBzD,KAAMiD,GACNhH,OAAQ,KACRyG,SAAAA,EACAI,SAAAA,EACH,GAERH,EAEMjL,IAAA,UAAAA,CACH,YAAKgM,eAAc,EACZ,KAAKb,aAAa,KAAKT,MAAM,GACvCO,EAEDgB,WAAA,SAAWC,EAA0C,CACjD,OAAOC,GAAoB,KAAMD,CAAO,GAC3CjB,EAEDmB,SAAA,SAASC,EAAgDC,EAAyB,CAC9E,OAAIA,GACAD,EAAS,CACLvB,eAAgB,QAChBC,gBAAiB,KAAK9M,MACtBsG,OAAQ,KACR+D,KAAMiD,GACNP,SAAU,KAAKN,OACfU,SAAUtM,OACb,EAEEyN,GAAiB,KAAMF,CAAQ,GACzCpB,EAEDuB,IAAA,UAAAA,CAEI,OAAO,KAAK9B,QACfO,EAEDwB,OAAA,UAAAA,CACI,OAAO,KAAKzM,IAAG,GAClBiL,EAED7N,SAAA,UAAAA,CACI,OAAU,KAAKa,MAAK,IAAI,KAAKyM,OAAM,KACtCO,EAEDyB,QAAA,UAAAA,CACI,OAAOzC,GAAY,KAAKjK,IAAG,CAAE,GAChCiL,EAAAlB,EAAA,EAED,UAAA,CACI,OAAO,KAAK2C,QAAO,GACtBvL,CAAA,EArIOwL,EAAI,EAwIHC,GAAoBC,GAA0B,kBAAmB1L,EAAe,KC1I7F4I,GA+QKC,OAAOC,YA5PZ,IAAa5J,GAAa,UAAA,CAqCtB,SAAAA,EAAYlF,EAAiC,MApC7C2R,mBAAqBC,GAAkBC,cAAa,KACpDC,WAA4B,CAAA,EAAE,KAC9BC,cAAgB,KAAI,KACpBC,iBAAmB,GAAK,KACxBC,wBAAmC,GAAK,KACxCC,WAAa,IAAIC,IAAkB,KACnCC,WAAa,EAAC,KACdC,OAAS,EAAC,KACVC,gBAAkB,EAAC,KACnBC,qBAAuBX,GAAkBY,YAAW,KACpDC,kBAAoB,EAAC,KACXlD,OAA0C,IAAImD,GAAgB,IAAI,EAAC,KAC7E5P,MAAK,OAAA,KACL6P,aAAY,OAAA,KACZC,aAAwB,GAAK,KAC7BC,iBAA4B,GAAK,KACjCC,WAAU,OAAA,KACVC,QAAO,OAAA,KACPC,WAAwBC,GAAUC,KAAI,KACtCC,OAAM,OAAA,KACEC,QAAO,OAAA,KACPC,kBAAiB,OAAA,KACzBC,WAAU,OAAA,KAwCHC,MAAK,OAAA,KACLC,OAAM,OA1BJxT,EAAQ6E,KACTrC,GAAI,EAAE,EAEV,KAAKsQ,WAAa9S,EAAQ6E,IAC1B,KAAK/B,MAAQ9C,EAAQD,MAAmB,iBAAmBmP,GAAS,EAChElP,EAAQ8E,MACR,KAAKiO,QAAU/Q,GACD,KAAKc,MAAQ,UACvB9C,EAAQ8E,GAAG,GAGnB,KAAKsO,QACDpT,EAAQ+J,SACN/J,EAAgByT,mBAAsBzT,EAAgB4K,OAClDK,GAASC,WACTD,GAAQ,SAClB,KAAKkI,OAASnT,EAAQqB,QACtB,KAAKgS,kBAAoBrT,EAAQ0T,iBACjC,KAAKJ,WAAa,CAAC,CAACtT,EAAQ2T,UAC/B,IAAA7D,EAAA5K,EAAA6K,UAAAD,OAAAA,EAED8D,eAAA,UAAAA,CACIC,GAAsB,IAAI,GAC7B/D,EAKMgE,KAAA,UAAAA,CACC,KAAKP,OACL,KAAKA,MAAMQ,QAAQ,SAAA7C,EAAQ,CAAA,OAAIA,EAAQ,KAE9CpB,EAEMkE,MAAA,UAAAA,CACC,KAAKR,QACL,KAAKA,OAAOO,QAAQ,SAAA7C,EAAQ,CAAA,OAAIA,EAAQ,KAIhDpB,EAIOjL,IAAA,UAAAA,CAIH,GAHI,KAAK+N,cACLpQ,GAAI,GAAI,KAAKM,MAAO,KAAKgQ,UAAU,EAGnC7P,EAAYgR,UAAY,GAExB,KAAK/B,WAAWgC,OAAS,GACzB,CAAC,KAAKZ,WAEFa,GAAc,IAAI,IAClB,KAAKC,wBAAuB,EAC5B5G,GAAU,EACV,KAAK+B,OAAS,KAAK8E,cAAc,EAAK,EACtChG,GAAQ,WAGZwC,GAAe,IAAI,EACfsD,GAAc,IAAI,EAAG,CACrB,IAAIG,EAAsBrR,EAAYsR,gBAClC,KAAKjB,YAAc,CAACgB,IACpBrR,EAAYsR,gBAAkB,MAE9B,KAAKC,gBAAe,GACpBC,GAAyB,IAAI,EAEjCxR,EAAYsR,gBAAkBD,EAGtC,IAAMI,EAAS,KAAKnF,OAEpB,GAAIoF,GAAkBD,CAAM,EACxB,MAAMA,EAAOE,MAEjB,OAAOF,GACV5E,EAEMhL,IAAA,SAAIhE,EAAQ,CACf,GAAI,KAAKiS,QAAS,CACV,KAAKF,kBACLrQ,GAAI,GAAI,KAAKM,KAAK,EAEtB,KAAK+P,iBAAmB,GACxB,GAAI,CACA,KAAKE,QAAQ3M,KAAK,KAAK+M,OAAQrS,CAAK,UAEpC,KAAK+R,iBAAmB,SAG5BrQ,GAAI,GAAI,KAAKM,KAAK,GAEzBgN,EAED0E,gBAAA,UAAAA,CAEI,IAAMvE,EAAW,KAAKV,OAChBsF,EACc,KAAKlD,qBAAuBC,GAAkBC,cAC5DhC,EAAW,KAAKwE,cAAc,EAAI,EAElCS,EACFD,GACAF,GAAkB1E,CAAQ,GAC1B0E,GAAkB9E,CAAQ,GAC1B,CAAC,KAAKuD,QAAQnD,EAAUJ,CAAQ,EAEpC,OAAIiF,IACA,KAAKvF,OAASM,EAEClD,GAAY,GACvB8C,GAAU,CACNE,eAAgB,WAChBC,gBAAiB,KAAK9M,MACtBsG,OAAQ,KAAK+J,OACbhG,KAAM,SACN8C,SAAAA,EACAJ,SAAAA,EACmB,GAIxBiF,GACVhF,EAEDuE,cAAA,SAAcU,EAAc,CACxB,KAAKnC,aAAe,GAEpB,IAAMlE,EAAOd,GAAuB,EAAK,EACrC9B,EACJ,GAAIiJ,EACAjJ,EAAMkJ,GAAqB,KAAM,KAAKlC,WAAY,KAAKK,MAAM,UAEzDlQ,EAAYgS,yBAA2B,GACvCnJ,EAAM,KAAKgH,WAAW1M,KAAK,KAAK+M,MAAM,MAEtC,IAAI,CACArH,EAAM,KAAKgH,WAAW1M,KAAK,KAAK+M,MAAM,QACjC+B,EAAG,CACRpJ,EAAM,IAAI4G,GAAgBwC,CAAC,EAIvC/G,OAAAA,GAAqBO,CAAI,EACzB,KAAKkE,aAAe,GACb9G,GACVgE,EAEDqF,SAAA,UAAAA,CACS,KAAK7B,aACN8B,GAAe,IAAI,EACnB,KAAK7F,OAAS5L,OACC,KAAKqP,aAAeC,GAAUC,MACzCmC,QAAQC,IAAG,gCACyB,KAAKxS,MAAK,2DAAA,IAIzDgN,EAEDmB,SAAA,SAASC,EAAmDC,EAAyB,YAC7EoE,EAAY,GACZC,EAA2B7R,OAC/B,OAAO8R,GAAQ,UAAA,CAEX,IAAI5F,EAAWV,EAAKtK,IAAG,EACvB,GAAI,CAAC0Q,GAAapE,EAAiB,CAC/B,IAAMuE,EAAQ/H,GAAc,EAC5BuD,EAAS,CACLvB,eAAgB,WAChBC,gBAAiBT,EAAKrM,MACtBqK,KAAMiD,GACNhH,OAAQ+F,EACRU,SAAAA,EACAI,SAAUuF,EACb,EACDlH,GAAaoH,CAAK,EAEtBH,EAAY,GACZC,EAAY3F,EACf,GACJC,EAEDsE,wBAAA,UAAAA,CAIQ,KAAKpB,aAAeC,GAAUC,MAC9BmC,QAAQC,IAAG,gCACyB,KAAKxS,MAAK,qEAAA,GAI9C,OAAO,KAAKuQ,mBAAsB,UAC5B,KAAKA,kBACLpQ,EAAY0S,2BAElBN,QAAQO,KAAI,0BACkB,KAAK9S,MAAK,qEAAA,GAG/CgN,EAED7N,SAAA,UAAAA,CACI,OAAU,KAAKa,MAAK,IAAI,KAAKgQ,WAAW7Q,SAAQ,EAAE,KACrD6N,EAEDyB,QAAA,UAAAA,CACI,OAAOzC,GAAY,KAAKjK,IAAG,CAAE,GAChCiL,EAAAlB,EAAA,EAED,UAAA,CACI,OAAO,KAAK2C,QAAO,GACtBrM,CAAA,EAAA,EAGQ2Q,GAAkBnE,GAA0B,gBAAiBxM,EAAa,ECpU3E0M,IAAZ,SAAYA,EAAiB,CAGzBA,EAAAA,EAAAA,cAAAA,EAAAA,EAAAA,gBAIAA,EAAAA,EAAAA,YAAAA,CAAAA,EAAAA,cAOAA,EAAAA,EAAAA,gBAAAA,CAAAA,EAAAA,kBAGAA,EAAAA,EAAAA,OAAAA,CAAAA,EAAAA,QACJ,GAlBYA,KAAAA,GAAiB,CAAA,EAAA,EAoB7B,IAAYqB,IAAZ,SAAYA,EAAS,CACjBA,EAAAA,EAAAA,KAAAA,CAAAA,EAAAA,OACAA,EAAAA,EAAAA,IAAAA,CAAAA,EAAAA,MACAA,EAAAA,EAAAA,MAAAA,CAAAA,EAAAA,OACJ,GAJYA,KAAAA,GAAS,CAAA,EAAA,EAgCrB,IAAaP,GACT,SAAmBkC,EAAU,MAAVA,MAAAA,OAAA,KAAA,MAAAA,CAEnB,EAGJ,SAAgBD,GAAkBO,EAAM,CACpC,OAAOA,aAAaxC,EACxB,CAaA,SAAgByB,GAAcrB,EAAuB,CACjD,OAAQA,EAAWnB,mBAAkB,CACjC,KAAKC,GAAkBY,YACnB,MAAO,GACX,KAAKZ,GAAkBC,cACvB,KAAKD,GAAkBkE,OACnB,MAAO,GACX,KAAKlE,GAAkBmE,gBAAiB,CAMpC,QAJMC,EAAsBlI,GAAqB,EAAI,EAC/CmI,EAAgBtI,GAAc,EAC9BuI,EAAMpD,EAAWhB,WACnBqE,EAAID,EAAIE,OACHC,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,IAAMC,EAAMJ,EAAIG,CAAC,EACjB,GAAIR,GAAgBS,CAAG,EAAG,CACtB,GAAIrT,EAAYgS,uBACZqB,EAAIzR,IAAG,MAEP,IAAI,CACAyR,EAAIzR,IAAG,OACC,CAERyJ,OAAAA,GAAa2H,CAAa,EAC1B7H,GAAmB4H,CAAmB,EAC/B,GAMf,GAAKlD,EAAWnB,qBAA+BC,GAAkBkE,OAC7DxH,OAAAA,GAAa2H,CAAa,EAC1B7H,GAAmB4H,CAAmB,EAC/B,IAInBO,OAAAA,GAA2BzD,CAAU,EACrCxE,GAAa2H,CAAa,EAC1B7H,GAAmB4H,CAAmB,EAC/B,IAGnB,CAEA,SAAgBQ,IAAqBA,CACjC,OAAOvT,EAAYqK,qBAAuB,IAC9C,CAEA,SAAgBgD,GAAoCmG,EAAW,CAI3D,IAAMC,EAAeD,EAAKvE,WAAWgC,KAAO,EAGxC,CAACjR,EAAYyK,oBACZgJ,GAAgBzT,EAAY0T,iBAAmB,WAEhDtB,QAAQO,KACJ,WACK3S,EAAY0T,eACP,gIACA,iSACNF,EAAK3T,KAAK,CAG1B,CAEA,SAAgB8T,GAA4B7Q,EAAuB,CAChD,CAAC9C,EAAY4T,iBAAmB5T,EAAY6T,4BACvDzB,QAAQO,KAAI,sBACc7P,EAAWjD,MAAK,0CAAA,CAGlD,CAOA,SAAgBkS,GAAwBlC,EAAyBiE,EAAY1V,EAAY,CACrF,IAAM2U,EAAsBlI,GAAqB,EAAI,EAGrDyI,GAA2BzD,CAAU,EACrCA,EAAWf,cAAgB,IAAI1I,MAAMyJ,EAAWhB,WAAWsE,OAAS,GAAG,EACvEtD,EAAWL,kBAAoB,EAC/BK,EAAWT,OAAS,EAAEpP,EAAY+T,MAClC,IAAMC,EAAehU,EAAYqK,mBACjCrK,EAAYqK,mBAAqBwF,EACjC7P,EAAYgR,UACZ,IAAIS,EACJ,GAAIzR,EAAYgS,yBAA2B,GACvCP,EAASqC,EAAE3Q,KAAK/E,CAAO,MAEvB,IAAI,CACAqT,EAASqC,EAAE3Q,KAAK/E,CAAO,QAClB6T,EAAG,CACRR,EAAS,IAAIhC,GAAgBwC,CAAC,EAGtCjS,OAAAA,EAAYgR,UACZhR,EAAYqK,mBAAqB2J,EACjCC,GAAiBpE,CAAU,EAE3BqE,GAAuCrE,CAAU,EACjD1E,GAAmB4H,CAAmB,EAC/BtB,CACX,CAEA,SAASyC,GAAuCrE,EAAuB,CAK/DA,EAAWhB,WAAWsE,SAAW,IAKjC,OAAOtD,EAAWsE,qBAAwB,UACpCtE,EAAWsE,oBACXnU,EAAYoU,6BAElBhC,QAAQO,KAAI,sBACc9C,EAAWhQ,MAAK,4DAAA,CAGlD,CAOA,SAASoU,GAAiBpE,EAAuB,CAW7C,QATMwE,EAAgBxE,EAAWhB,WAC3ByF,EAAazE,EAAWhB,WAAagB,EAAWf,cAClDyF,EAAoC5F,GAAkBY,YAKtDiF,EAAK,EACLtB,EAAIrD,EAAWL,kBACV4D,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,IAAMqB,EAAMH,EAAUlB,CAAC,EACnBqB,EAAItF,aAAe,IACnBsF,EAAItF,WAAa,EACbqF,IAAOpB,IACPkB,EAAUE,CAAE,EAAIC,GAEpBD,KAKCC,EAA2B/F,mBAAqB6F,IACjDA,EAAqCE,EAA2B/F,oBAWxE,IARA4F,EAAUnB,OAASqB,EAEnB3E,EAAWf,cAAgB,KAK3BoE,EAAImB,EAAclB,OACXD,KAAK,CACR,IAAMuB,EAAMJ,EAAcnB,CAAC,EACvBuB,EAAItF,aAAe,GACnBuF,GAAeD,EAAK5E,CAAU,EAElC4E,EAAItF,WAAa,EAMrB,KAAOqF,KAAM,CACT,IAAMC,EAAMH,EAAUE,CAAE,EACpBC,EAAItF,aAAe,IACnBsF,EAAItF,WAAa,EACjBwF,GAAYF,EAAK5E,CAAU,GAM/B0E,IAAsC5F,GAAkBY,cACxDM,EAAWnB,mBAAqB6F,EAChC1E,EAAWc,eAAc,EAEjC,CAEA,SAAgBwB,GAAetC,EAAuB,CAElD,IAAMoD,EAAMpD,EAAWhB,WACvBgB,EAAWhB,WAAa,CAAA,EAExB,QADIuE,EAAIH,EAAIE,OACLC,KACHsB,GAAezB,EAAIG,CAAC,EAAGvD,CAAU,EAGrCA,EAAWnB,mBAAqBC,GAAkBC,aACtD,CAEA,SAAgBgG,GAAaC,EAAe,CACxC,IAAMpJ,EAAOf,GAAc,EAC3B,GAAI,CACA,OAAOmK,EAAM,UAEbxJ,GAAaI,CAAI,EAEzB,CAEA,SAAgBf,IAAcA,CAC1B,IAAMe,EAAOzL,EAAYqK,mBACzBrK,OAAAA,EAAYqK,mBAAqB,KAC1BoB,CACX,CAEA,SAAgBJ,GAAaI,EAAwB,CACjDzL,EAAYqK,mBAAqBoB,CACrC,CAEA,SAAgBZ,GAAqB+I,EAAwB,CACzD,IAAMnI,EAAOzL,EAAY4T,gBACzB5T,OAAAA,EAAY4T,gBAAkBA,EACvBnI,CACX,CAEA,SAAgBN,GAAmBM,EAAa,CAC5CzL,EAAY4T,gBAAkBnI,CAClC,CAMA,SAAgB6H,GAA2BzD,EAAuB,CAC9D,GAAIA,EAAWnB,qBAAuBC,GAAkBY,YAGxDM,CAAAA,EAAWnB,mBAAqBC,GAAkBY,YAIlD,QAFM0D,EAAMpD,EAAWhB,WACnBuE,EAAIH,EAAIE,OACLC,KACHH,EAAIG,CAAC,EAAE9D,qBAAuBX,GAAkBY,YAExD,CC7TA,IAAauF,GAAW,UAAAA,CAAA,KASpBC,QAAU,EAAC,KAKXC,UAAwB,CAAA,EAAE,KAK1BC,mBAAyC,KAAI,KAO7CC,gBAAwD,KAAI,KAK5DC,MAAQ,EAAC,KAKTC,SAAW,EAAC,KAKZC,QAAkB,EAAC,KAQnBC,sBAAuC,CAAA,EAAE,KAKzCC,iBAA+B,CAAA,EAAE,KAKjCC,mBAAqB,GAAK,KAO1BC,kBAAoB,GAAK,KAMzBC,gBAAkB,GAAI,KAKtBC,eAAqC,GAAI,KAKzCC,aAA0C,CAAA,EAAE,KAK5CC,4BAAiF,CAAA,EAAE,KAKnFC,yBAA2B,GAAK,KAMhCC,2BAA6B,GAAK,KAMlCC,2BAA6B,GAAK,KAMlCC,uBAAyB,GAAK,KAM9BC,uBAAyB,GAAK,KAE9BC,WAAa,GAAI,KAIjBC,cAAgB,GAAK,KAOrBC,gBAAkB,EAAI,EAGtBC,GAAsB,GACtBC,GAAgB,GAETC,EAA4B,UAAA,CACnC,IAAIC,EAASC,GAAS,EAQtB,OAPID,EAAOE,oBAAsB,GAAK,CAACF,EAAOG,gBAC1CN,GAAsB,IAEtBG,EAAOG,eAAiBH,EAAOG,cAAc7B,UAAY,IAAID,GAAW,EAAGC,UAC3EuB,GAAsB,IAGrBA,GASMG,EAAOG,eACdH,EAAOE,qBAAuB,EACzBF,EAAOG,cAAc5B,YACtByB,EAAOG,cAAc5B,UAAY,CAAA,GAE9ByB,EAAOG,gBAEdH,EAAOE,oBAAsB,EACrBF,EAAOG,cAAgB,IAAI9B,KAdnC+B,WAAW,UAAA,CACFN,IACDO,GAAI,EAAE,GAEX,CAAC,EACG,IAAIhC,GAWnB,EAAC,EAED,SAAgBiC,IAAkBA,CAS9B,IAPIP,EAAYjB,iBAAiByB,QAC7BR,EAAYnB,SACZmB,EAAYhB,qBAEZsB,GAAI,EAAE,EAEVP,GAAgB,GACZD,GAAqB,CACrB,IAAIG,EAASC,GAAS,EAClB,EAAED,EAAOE,sBAAwB,IACjCF,EAAOG,cAAgBK,QAE3BT,EAAc,IAAI1B,GAE1B,CAEA,SAAgBoC,IAAcA,CAC1B,OAAOV,CACX,UCvKgBW,GAAaC,EAAuB,CAChD,OAAOA,EAAWC,YAAcD,EAAWC,WAAWC,KAAO,CACjE,CAEA,SAAgBC,GAAaH,EAAuB,CAChD,OAAOA,EAAWC,UACtB,CAmBA,SAAgBG,GAAYJ,EAAyBK,EAAiB,CAKlEL,EAAWC,WAAWK,IAAID,CAAI,EAC1BL,EAAWO,qBAAuBF,EAAKG,qBACvCR,EAAWO,qBAAuBF,EAAKG,mBAK/C,CAEA,SAAgBC,GAAeT,EAAyBK,EAAiB,CAIrEL,EAAWC,WAAU,OAAQI,CAAI,EAC7BL,EAAWC,WAAWC,OAAS,GAE/BQ,GAAsBV,CAAU,CAIxC,CAEA,SAAgBU,GAAsBV,EAAuB,CACrDA,EAAWW,0BAA4B,KAEvCX,EAAWW,wBAA0B,GACrCC,EAAYC,sBAAsBC,KAAKd,CAAU,EAEzD,CAOA,SAAgBe,IAAUA,CACtBH,EAAYI,SAChB,CAEA,SAAgBC,IAAQA,CACpB,GAAI,EAAEL,EAAYI,UAAY,EAAG,CAC7BE,GAAY,EAGZ,QADMC,EAAOP,EAAYC,sBAChBO,EAAI,EAAGA,EAAID,EAAKE,OAAQD,IAAK,CAClC,IAAMpB,EAAamB,EAAKC,CAAC,EACzBpB,EAAWW,wBAA0B,GACjCX,EAAWC,WAAWC,OAAS,IAC3BF,EAAWsB,mBAEXtB,EAAWsB,iBAAmB,GAC9BtB,EAAWuB,MAAK,GAEhBvB,aAAsBwB,IAGtBxB,EAAWyB,SAAQ,GAI/Bb,EAAYC,sBAAwB,CAAA,EAE5C,CAEA,SAAgBa,GAAe1B,EAAuB,CAClD2B,GAA4B3B,CAAU,EAEtC,IAAM4B,EAAahB,EAAYiB,mBAC/B,OAAID,IAAe,MAMXA,EAAWE,SAAW9B,EAAW+B,kBACjC/B,EAAW+B,gBAAkBH,EAAWE,OAExCF,EAAWI,cAAeJ,EAAWK,mBAAmB,EAAIjC,EACxD,CAACA,EAAWsB,kBAAoBV,EAAYsB,kBAC5ClC,EAAWsB,iBAAmB,GAC9BtB,EAAWmC,KAAI,IAGhBnC,EAAWsB,mBACXtB,EAAWC,WAAWC,OAAS,GAAKU,EAAYI,QAAU,GACjEN,GAAsBV,CAAU,EAG7B,GACX,CAyBA,SAAgBoC,GAAiBpC,EAAuB,CAEhDA,EAAWO,uBAAyB8B,GAAkBC,SAG1DtC,EAAWO,qBAAuB8B,GAAkBC,OAGpDtC,EAAWC,WAAWsC,QAAQ,SAAAC,EAAC,CACvBA,EAAEhC,qBAAuB6B,GAAkBI,cAC5BD,EAAEE,aAAeC,GAAUC,MACtCC,GAAaL,EAAGxC,CAAU,EAE9BwC,EAAEM,eAAc,GAEpBN,EAAEhC,mBAAqB6B,GAAkBC,OAC5C,EAEL,CAGA,SAAgBS,GAAyB/C,EAAuB,CAExDA,EAAWO,uBAAyB8B,GAAkBC,SAG1DtC,EAAWO,qBAAuB8B,GAAkBC,OAEpDtC,EAAWC,WAAWsC,QAAQ,SAAAC,EAAC,CACvBA,EAAEhC,qBAAuB6B,GAAkBW,iBAC3CR,EAAEhC,mBAAqB6B,GAAkBC,OAC1BE,EAAEE,aAAeC,GAAUC,MACtCC,GAAaL,EAAGxC,CAAU,GAG9BwC,EAAEhC,qBAAuB6B,GAAkBI,cAE3CzC,EAAWO,qBAAuB8B,GAAkBI,aAE3D,EAEL,CAGA,SAAgBQ,GAAsBjD,EAAuB,CAErDA,EAAWO,uBAAyB8B,GAAkBI,cAG1DzC,EAAWO,qBAAuB8B,GAAkBW,gBAEpDhD,EAAWC,WAAWsC,QAAQ,SAAAC,EAAC,CACvBA,EAAEhC,qBAAuB6B,GAAkBI,cAC3CD,EAAEhC,mBAAqB6B,GAAkBW,gBACzCR,EAAEM,eAAc,GAEvB,EAEL,CAEA,SAASD,GAAajB,EAAyB5B,EAAuB,CAIlE,GAHAkD,QAAQC,IAAG,iBACUvB,EAAWwB,MAAK,yCAAyCpD,EAAWoD,MAAK,GAAA,EAE1FxB,EAAWc,aAAeC,GAAUU,MAAO,CAC3C,IAAMC,EAAQ,CAAA,EACdC,GAAaC,GAAkB5B,CAAU,EAAG0B,EAAO,CAAC,EAGpD,IAAIG,SAAQ;;WAGT7B,EAAWwB,MAAK;;wDAE6BxB,EAAWwB,MAAK,0BAA0BpD,EAAWoD,MAAK;;;;GAIhHxB,aAAsBJ,GAAgBI,EAAWA,WAAW8B,SAAQ,EAAGC,QAAQ,SAAU,GAAG,EAAI,IAAE;;;;EAIlGL,EAAMM,KAAK;CAAI,EAAC;;KAAA,EAEZ,EAEN,CAEA,SAASL,GAAaM,EAAuBP,EAAiBQ,EAAa,CACvE,GAAIR,EAAMjC,QAAU,IAAM,CACtBiC,EAAMxC,KAAK,iBAAiB,EAC5B,OAEJwC,EAAMxC,KAAI,GAAI,IAAKiD,OAAOD,EAAQ,CAAC,EAAID,EAAKG,IAAI,EAC5CH,EAAKI,cACLJ,EAAKI,aAAa1B,QAAQ,SAAA2B,EAAK,CAAA,OAAIX,GAAaW,EAAOZ,EAAOQ,EAAQ,CAAC,GAE/E,KCrOaK,GAAQ,UAAA,CAajB,SAAAA,EACWf,EACCgB,EACAC,EACDC,EAAoB,CAHpBlB,IAAAA,SAAAA,EAA0B,YAAcmB,GAAS,GAAe,KAAhEnB,MAAAA,YACCgB,cAAAA,YACAC,cAAAA,YACDC,oBAAAA,YAhBXE,WAA4B,CAAA,EAAE,KAC9BxC,cAA+B,CAAA,EAAE,KACjCxB,mBAAqB6B,GAAkBoC,cAAa,KACpDC,WAAa,EAAC,KACd5C,OAAS,EAAC,KACVG,kBAAoB,EAAC,KACrB0C,YAAc,GAAK,KACnBC,aAAe,GAAK,KACpBC,gBAAkB,GAAK,KACvBC,WAAa,GAAK,KAClBpC,WAAwBC,GAAUC,KAGvB,KAAA,MAAAQ,EACC,KAAA,cAAAgB,EACA,KAAA,cAAAC,EACD,KAAA,oBAAAC,EACP,IAAAS,EAAAZ,EAAAa,UAAAD,OAAAA,EAEJjC,eAAA,UAAAA,CACI,KAAKmC,UAAS,GACjBF,EAEDE,UAAA,UAAAA,CACS,KAAKL,eACN,KAAKA,aAAe,GACpBhE,EAAYsE,iBAAiBpE,KAAK,IAAI,EACtCI,GAAY,IAEnB6D,EAEDI,YAAA,UAAAA,CACI,OAAO,KAAKP,cAGhBG,EAGAK,aAAA,UAAAA,CACI,GAAI,CAAC,KAAKT,YAAa,CACnB5D,GAAU,EACV,KAAK6D,aAAe,GACpB,IAAMS,EAAOzE,EAAYsB,gBAEzB,GADAtB,EAAYsB,gBAAkB,KAC1BoD,GAAc,IAAI,EAAG,CACrB,KAAKT,gBAAkB,GAEvB,GAAI,CACA,KAAKT,cAAa,EACH,KAAKS,iBAAmBU,GAAY,GAE/CC,GAAU,CACNxB,KAAM,KAAKZ,MACXqC,KAAM,qBACT,QAEAC,EAAG,CACR,KAAKC,6BAA6BD,CAAC,GAG3C9E,EAAYsB,gBAAkBmD,EAC9BpE,GAAQ,IAEf8D,EAEDa,MAAA,SAAMC,EAAc,CAChB,GAAI,MAAKlB,YAIT5D,CAAAA,GAAU,EACV,IAAM+E,EAASP,GAAY,EACvBQ,EACWD,IACXC,EAAYC,KAAKC,IAAG,EACpBC,GAAe,CACXlC,KAAM,KAAKZ,MACXqC,KAAM,WACT,GAEL,KAAKX,WAAa,GAClB,IAAMqB,EAAevF,EAAYsB,gBACjCtB,EAAYsB,gBAAkB,KAC9B,IAAMkE,EAASC,GAAqB,KAAMR,EAAIS,MAAS,EACvD1F,EAAYsB,gBAAkBiE,EAC9B,KAAKrB,WAAa,GAClB,KAAKD,gBAAkB,GACnB,KAAKF,aAEL4B,GAAe,IAAI,EAEnBC,GAAkBJ,CAAM,GACxB,KAAKT,6BAA6BS,EAAOK,KAAK,EAEnCX,GACXY,GAAa,CACTC,KAAMX,KAAKC,IAAG,EAAKF,EACtB,EAEL9E,GAAQ,IACX8D,EAEDY,6BAAA,SAA6BiB,EAAU,YACnC,GAAI,KAAKvC,cAAe,CACpB,KAAKA,cAAcuC,EAAO,IAAI,EAC9B,OAGJ,GAAIhG,EAAYiG,uBACZ,MAAMD,EAGV,IAAME,EAAU,sGAC4F,KAAI,IAE3GlG,EAAYmG,uBAGK7D,QAAQ8D,KAAI,8BAA+B,KAAK5D,MAAK,kDAAA,EAFvEF,QAAQ0D,MAAME,EAASF,CAAK,EAIjBrB,GAAY,GACvBC,GAAU,CACNC,KAAM,QACNzB,KAAM,KAAKZ,MACX0D,QAAAA,EACAF,MAAO,GAAKA,EACf,EAGLhG,EAAYqG,4BAA4B1E,QAAQ,SAAA2E,EAAC,CAAA,OAAIA,EAAEN,EAAOO,CAAI,KACrEpC,EAEDqC,QAAA,UAAAA,CACS,KAAKzC,cACN,KAAKA,YAAc,GACd,KAAKG,aAEN/D,GAAU,EACVwF,GAAe,IAAI,EACnBtF,GAAQ,KAGnB8D,EAEDsC,aAAA,SAAaC,EAAgC,YACnCF,EAAW,SAAXA,GAAOA,CACTG,EAAKH,QAAO,EACZE,GAAW,MAAXA,EAAaE,qBAAmB,MAAhCF,EAAaE,oBAAsB,QAASJ,CAAO,GAEvDE,OAAAA,GAAW,MAAXA,EAAaG,kBAAgB,MAA7BH,EAAaG,iBAAmB,QAASL,CAAO,EAChDA,EAAQM,EAAK,EAAI,KAEVN,GACVrC,EAEDrB,SAAA,UAAAA,CACI,MAAA,YAAmB,KAAKN,MAAK,KAChC2B,EAED4C,MAAA,SAAMC,EAAAA,CAAAA,IAAAA,SAAAA,EAA2B,IAC7BD,GAAM,KAAMC,CAAe,GAC9BzD,CAAA,EAAA,EAkBL,IAAM0D,GAA0B,IAE5BC,GAA8C,SAAAC,EAAC,CAAA,OAAIA,EAAC,CAAE,EAE1D,SAAgBC,IAAYA,CAEpBC,EAAYC,QAAU,GAAKD,EAAYE,oBAG3CL,GAAkBM,EAAkB,CACxC,CAEA,SAASA,IAAkBA,CACvBH,EAAYE,mBAAqB,GAOjC,QANME,EAAeJ,EAAYK,iBAC7BC,EAAa,EAKVF,EAAaG,OAAS,GAAG,CACxB,EAAED,IAAeV,KACjBY,QAAQC,MAEE,qDAAqDb,GAAuB,gBAAA,wDAChBQ,EAAa,CAAC,EAC5B,EAExDA,EAAaM,OAAO,CAAC,GAGzB,QADIC,EAAqBP,EAAaM,OAAO,CAAC,EACrCE,EAAI,EAAGC,EAAIF,EAAmBJ,OAAQK,EAAIC,EAAGD,IAClDD,EAAmBC,CAAC,EAAEE,aAAY,EAG1Cd,EAAYE,mBAAqB,EACrC,CAEO,IAAMa,GAAaC,GAA0B,WAAYC,EAAQ,EAExE,SAAgBC,GAAqBC,EAA2B,CAC5D,IAAMC,EAAgBvB,GACtBA,GAAoB,SAAAC,EAAC,CAAA,OAAIqB,EAAG,UAAA,CAAA,OAAMC,EAActB,CAAC,IACrD,UC7QgBuB,IAAYA,CACxB,MAAkB,CAAC,CAACrB,EAAYsB,aAAaf,MACjD,CAkBA,SAAgBgB,GAAUC,EAAe,CAIrC,GAAKxB,EAAYsB,aAAaf,OAI9B,QADMkB,EAAYzB,EAAYsB,aACrBV,EAAI,EAAGC,EAAIY,EAAUlB,OAAQK,EAAIC,EAAGD,IACzCa,EAAUb,CAAC,EAAEY,CAAK,CAE1B,CAEA,SAAgBE,GAAeF,EAAmB,CAI9C,IAAMG,EAAMC,GAAA,CAAA,EAAQJ,EAAK,CAAEE,eAAgB,KAC3CH,GAAUI,CAAM,CACpB,CAEA,IAAME,GAAsB,CAAEC,KAAM,aAAcC,aAAc,IAEhE,SAAgBA,GAAaJ,EAA0B,CAK/CJ,GADAI,EACSC,GAAA,CAAA,EAAMD,EAAM,CAAEG,KAAM,aAAcC,aAAc,KAE/CF,GAElB,CAEA,SAAgBG,GAAIC,EAAoC,CAKhDjC,OAAAA,EAAYsB,aAAaY,KAAKD,CAAQ,EAC/BE,GAAK,UAAA,CACRnC,EAAYsB,aAAetB,EAAYsB,aAAac,OAAO,SAAAvB,EAAC,CAAA,OAAIA,IAAMoB,IACzE,CAET,CCvDO,IAAMI,GAAS,SACTC,GAAe,eACfC,GAAa,aACbC,GAAmB,mBAE1BC,GAAsB,mBAEtBC,GAAmBC,GAAuBN,EAAM,EAChDO,GAAwBD,GAAuBL,GAAc,CAC/DO,MAAO,GACV,EACKC,GAAuBH,GAAuBJ,GAAY,CAC5DQ,WAAY,GACf,EACKC,GAA4BL,GAAuBH,GAAkB,CACvEO,WAAY,GACZF,MAAO,GACV,EAsBD,SAASI,GAAoBF,EAAmB,CAC5C,IAAMG,EAAsB,SAAgBC,EAAMC,EAAK,CAEnD,GAAIC,GAAWF,CAAI,EACf,OAAOG,GAAaH,EAAKI,MAAQd,GAAqBU,EAAMJ,CAAU,EAG1E,GAAIM,GAAWD,CAAI,EACf,OAAOE,GAAaH,EAAMC,EAAML,CAAU,EAG9C,GAAIS,GAAiBJ,CAAI,EACrB,OAAQL,EAAaD,GAAuBJ,IAAkBe,gBAC1DN,EACAC,CAAI,EAIZ,GAAIM,GAAYN,CAAI,EAChB,OAAOO,GAAgBR,EAAMC,EAAML,EAAaD,GAAuBJ,EAAgB,EAG3F,GAAIgB,GAAYP,CAAI,EAChB,OAAOS,GACHjB,GAAuBI,EAAaR,GAAaF,GAAQ,CACrDkB,KAAMJ,EACNJ,WAAAA,EACH,CAAC,EAKNc,GAAI,gCAAgC,GAG5C,OAAOX,CACX,CAEA,IAAaY,GAAyBb,GAAoB,EAAK,EAC/Dc,OAAOC,OAAOF,GAAQpB,EAAgB,EACtC,IAAaK,GAA6BE,GAAoB,EAAI,EAClEc,OAAOC,OAAOjB,GAAYD,EAAoB,EAE9CgB,GAAOjB,MAAQe,GAA0BhB,EAAqB,EAC9DG,GAAWF,MAAQe,GAA0BZ,EAAyB,EAEtE,SAAgBiB,GAAe9C,EAAW,CACtC,OAAO+C,GAAc/C,EAAGoC,MAAQd,GAAqB,GAAOtB,EAAI,KAAMgD,MAAS,CACnF,CAEA,SAAgBC,GAASC,EAAU,CAC/B,OAAOhB,GAAWgB,CAAK,GAAKA,EAAMC,eAAiB,EACvD,CCrEA,SAAgBC,GACZC,EACAC,EAAAA,eAAAA,IAAAA,SAAAA,EAAwBC,IAGfrB,GAAWmB,CAAI,GAChBX,GAAI,8CAA8C,EAElDO,GAASI,CAAI,GACbX,GAAI,+DAA+D,EAI3E,IAAMN,GAAIoB,GAAAC,EACNH,IAAI,KAAA,OAAJG,EAAMrB,OAAI,KAAAoB,EAAgBH,EAAajB,MAAQ,WAAasB,GAAS,EACnEC,EAAU,CAACL,EAAKM,WAAa,CAACN,EAAKO,MACrCC,EAEJ,GAAIH,EAEAG,EAAW,IAAIhE,GACXsC,EACA,UAAA,CACI,KAAK2B,MAAMC,CAAc,GAE7BV,EAAKW,QACLX,EAAKY,kBAAkB,MAExB,CACH,IAAMN,EAAYO,GAA2Bb,CAAI,EAE7Cc,EAAc,GAElBN,EAAW,IAAIhE,GACXsC,EACA,UAAA,CACSgC,IACDA,EAAc,GACdR,EAAU,UAAA,CACNQ,EAAc,GACTN,EAASO,aACVP,EAASC,MAAMC,CAAc,EAEpC,IAGTV,EAAKW,QACLX,EAAKY,kBAAkB,EAI/B,SAASF,GAAcA,CACnBX,EAAKS,CAAQ,EAGjB,OAAGQ,EAAChB,IAAI,OAAAiB,EAAJD,EAAME,SAAM,MAAZD,EAAcE,SACdX,EAASY,UAAS,EAEfZ,EAASa,cAAYC,EAACtB,IAAI,KAAA,OAAJsB,EAAMJ,MAAM,CAC7C,CAOA,IAAMK,GAAM,SAAClG,EAAS,CAAA,OAAKA,EAAC,CAAE,EAE9B,SAASwF,GAA2Bb,EAAqB,CACrD,OAAOA,EAAKM,UACNN,EAAKM,UACLN,EAAKO,MACL,SAAClF,EAAS,CAAA,OAAKmG,WAAWnG,EAAG2E,EAAKO,KAAM,GACxCgB,EACV,CAEA,SAAgBf,GACZiB,EACAC,EAKA1B,EAAAA,aAAAA,IAAAA,SAAAA,EAA6CC,KAGrC,CAACrB,GAAW6C,CAAU,GAAK,CAAC7C,GAAW8C,CAAM,IAC7CtC,GAAI,2DAA2D,EAE9DuC,GAAc3B,CAAI,GACnBZ,GAAI,iDAAiD,EAG7D,IAAMN,GAAI8C,EAAG5B,EAAKlB,OAAI,KAAA8C,EAAe,YAAcxB,GAAS,EACtDyB,EAAexC,GACjBP,EACAkB,EAAKW,QAAUmB,GAAiB9B,EAAKW,QAASe,CAAM,EAAIA,CAAM,EAE5DrB,EAAU,CAACL,EAAKM,WAAa,CAACN,EAAKO,MACnCD,EAAYO,GAA2Bb,CAAI,EAE7C+B,EAAY,GACZjB,EAAc,GACdkB,EACAC,EAEEC,EAA8BlC,EAAamC,kBAC3CC,GAASC,WACTrC,EAAKkC,QAAUE,GAAQ,QAEvBE,EAAI,IAAI9F,GACVsC,EACA,UAAA,CACQiD,GAAa1B,EACbK,EAAc,EACNI,IACRA,EAAc,GACdR,EAAWI,CAAc,IAGjCV,EAAKW,QACLX,EAAKY,kBAAkB,EAG3B,SAASF,GAAcA,CAEnB,GADAI,EAAc,GACVwB,CAAAA,EAAEvB,YAGN,KAAIwB,EAAmB,GACvBD,EAAE7B,MAAM,UAAA,CACJ,IAAM+B,EAAYC,GAAkB,GAAO,UAAA,CAAA,OAAMhB,EAAWa,CAAC,IAC7DC,EAAUR,GAAa,CAACG,EAAOF,EAAOQ,CAAS,EAC/CP,EAAWD,EACXA,EAAQQ,EACX,GAIGT,GAAa/B,EAAK0C,iBAEX,CAACX,GAAaQ,IACrBV,EAAaG,EAAOC,EAAsBK,CAAC,EAE/CP,EAAY,IAGhB,OAAGY,EAAC3C,IAAI,OAAA4C,EAAJD,EAAMzB,SAAM,MAAZ0B,EAAczB,SACdmB,EAAElB,UAAS,EAERkB,EAAEjB,cAAYwB,EAAC7C,IAAI,KAAA,OAAJ6C,EAAM3B,MAAM,CACtC,CAEA,SAASY,GAAiBgB,EAAcC,EAAM,CAC1C,OAAO,UAAA,CACH,GAAI,CACA,OAAOA,EAAOC,MAAM,KAAMC,SAAS,QAC9BC,EAAG,CACRJ,EAAaK,KAAK,KAAMD,CAAC,GAGrC,CC1LA,IAAME,GAAqB,OACrBC,GAAuB,QAiB7B,SAAgBC,GAAiB1D,EAAOjB,EAAM4E,EAAK,CAC/C,OAAOC,GAAcJ,GAAoBxD,EAAOjB,EAAM4E,CAAI,CAC9D,CAiBA,SAAgBE,GAAmB7D,EAAOjB,EAAM4E,EAAK,CACjD,OAAOC,GAAcH,GAAsBzD,EAAOjB,EAAM4E,CAAI,CAChE,CAEA,SAASC,GAAcE,EAAwB9D,EAAOjB,EAAM4E,EAAI,CAC5D,IAAMI,EACF,OAAOJ,GAAS,WAAaK,GAAQhE,EAAOjB,CAAI,EAAKiF,GAAQhE,CAAK,EAChEiE,EAAKjF,GAAW2E,CAAI,EAAIA,EAAO5E,EAC/BmF,EAAkBJ,EAAI,IAE5B,OAAIC,EAAKG,CAAY,EACjBH,EAAKG,CAAY,EAAGC,IAAIF,CAAE,EAE1BF,EAAKG,CAAY,EAAI,IAAIE,IAAY,CAACH,CAAE,CAAC,EAGtC,UAAA,CACH,IAAMI,EAAgBN,EAAKG,CAAY,EACnCG,IACAA,EAAa,OAAQJ,CAAE,EACnBI,EAAcC,OAAS,GACvB,OAAOP,EAAKG,CAAY,GAIxC,CCxEA,IAAMK,GAAQ,QACRC,GAAS,SACTC,GAAW,WAGjB,SAAgBC,GAAUC,EAgBzB,CACOA,EAAQC,qBAAuB,IAC/BA,GAAkB,EAEtB,IAAQC,EAA+BF,EAA/BE,WAAYC,EAAmBH,EAAnBG,eAYpB,GAXID,IAAe/E,SACfnE,EAAYkJ,WACRA,IAAeL,GACT,GACAK,IAAeN,GACf,GACA,OAAOQ,MAAU,KAE3BF,IAAe,gBACflJ,EAAYqJ,cAAgB,IAE5BF,IAAmBhF,OAAW,CAC9B,IAAMmF,EAAKH,IAAmBN,GAASA,GAASM,IAAmBL,GACnE9I,EAAYmJ,eAAiBG,EAC7BtJ,EAAYkH,kBAAoBoC,EAAAA,IAAO,IAAQA,IAAOT,IAEzD,CACG,2BACA,6BACA,6BACA,yBACA,iBAAiB,EACnBU,QAAQ,SAAAC,EAAG,CACLA,KAAOR,IACPhJ,EAAYwJ,CAAG,EAAI,CAAC,CAACR,EAAQQ,CAAG,GAEvC,EACDxJ,EAAYyJ,gBAAkB,CAACzJ,EAAY0J,2BAC5B1J,EAAY2J,yBAA2B,IAClDnJ,QAAQoJ,KACJ,0GAA0G,EAG9GZ,EAAQnJ,mBACRqB,GAAqB8H,EAAQnJ,iBAAiB,CAEtD,UCjDgBgK,GACZC,EACAC,EACAC,EACAhB,EAAiC,CAGzBtB,UAAUnH,OAAS,GACnBsD,GAAI,2CAA2C,EAE/C,OAAOiG,GAAW,UAClBjG,GAAI,wDAAwD,EAE5DoG,GAAgBH,CAAM,GACtBjG,GAAI,sEAAsE,EAEzEuC,GAAc2D,CAAU,GACzBlG,GAAG,kEAAA,GAEHqG,GAAaH,CAAU,GAAKG,GAAaF,CAAW,IACpDnG,GAAG,uEAAA,EAIX,IAAMsG,EAAcC,GAA0BL,CAAU,EAExDM,OAAAA,GAAe,UAAA,CACX,IAAMC,EAAsCC,GAAmBT,EAAQd,CAAO,EAAEwB,EAAK,EACrFC,GAAQN,CAAW,EAAEZ,QAAQ,SAAAC,EAAG,CAC5Bc,EAAII,QACAlB,EACAW,EAAYX,CAAU,EAErBQ,GAAqBR,KAAOQ,EAAcA,EAAYR,CAAG,EAA3C,EAAmD,EAEzE,EACJ,EAEMM,CACX,UC1CgBa,GAAkBtG,EAAYuG,EAAiB,CAC3D,OAAOC,GAAqBxC,GAAQhE,EAAOuG,CAAQ,CAAC,CACxD,CAEA,SAASC,GAAqBC,EAAkB,CAC5C,IAAMC,EAA0B,CAC5BxH,KAAMuH,EAAKE,OAEf,OAAIF,EAAKG,YAAcH,EAAKG,WAAW1K,OAAS,IAC5CwK,EAAOG,aAAeC,GAAOL,EAAKG,UAAU,EAAEG,IAAIP,EAAoB,GAEnEE,CACX,CAEA,SAAgBM,GAAgBhH,EAAYuG,EAAiB,CACzD,OAAOU,GAAmBjD,GAAQhE,EAAOuG,CAAQ,CAAC,CACtD,CAEA,SAASU,GAAmBR,EAAkB,CAC1C,IAAMC,EAAwB,CAC1BxH,KAAMuH,EAAKE,OAEf,OAAIO,GAAaT,CAAW,IACxBC,EAAOS,UAAYC,MAAMC,KAAUC,GAAab,CAAW,CAAC,EAAEM,IAASE,EAAkB,GAEtFP,CACX,CAEA,SAASI,GAAUS,EAAS,CACxB,OAAOH,MAAMC,KAAK,IAAIjD,IAAImD,CAAI,CAAC,CACnC,CCzBA,IAAIC,GAAc,EAElB,SAAgBC,IAAqBA,CACjC,KAAKC,QAAU,gBACnB,CACAD,GAAsBE,UAAYjI,OAAOkI,OAAOC,MAAMF,SAAS,EAe/D,IAAMG,GAAiBC,GAAqB,MAAM,EAC5CC,GAAsBD,GAAqB,aAAc,CAAEE,MAAO,GAAM,EAEjEC,GAAaC,OAAOC,OAC7B,SAAcC,EAAMC,EAAK,CAErB,GAAIC,GAAiBD,CAAI,EACrB,OAAOR,GAAeU,gBAAgBH,EAAMC,CAAI,EAGpD,GAAIG,GAAYH,CAAI,EAChB,OAAOI,GAAgBL,EAAMC,EAAMR,EAAc,EAGtCa,UAAUC,SAAW,GAChCC,GAAG,sDAAA,EAEP,IAAMC,EAAYT,EACZU,EAAOD,EAAUC,MAAQ,iBAGzBC,EAAM,UAAHA,CACL,IAAMC,EAAM,KACNC,EAAOP,UACPQ,EAAQ,EAAEC,GACVC,EAAMC,GAAUP,EAAI,aAAaI,EAAK,UAAWL,CAAS,EAAES,MAAMN,EAAKC,CAAI,EAC7EM,EACAC,EAAsDC,OAEpDC,EAAU,IAAIC,QAAQ,SAAUC,EAASC,EAAM,CACjD,IAAIC,EAAS,EACbP,EAAWM,EAEX,SAASE,EAAYhB,EAAQ,CACzBS,EAAiBC,OACjB,IAAIO,EACJ,GAAI,CACAA,EAAMX,GACCP,EAAI,aAAaI,EAAK,YAAYY,IACrCV,EAAIa,IAAI,EACVC,KAAKd,EAAKL,CAAG,QACVoB,EAAG,CACR,OAAON,EAAOM,CAAC,EAGnBF,EAAKD,CAAG,EAGZ,SAASI,EAAWC,EAAQ,CACxBb,EAAiBC,OACjB,IAAIO,EACJ,GAAI,CACAA,EAAMX,GACCP,EAAI,aAAaI,EAAK,YAAYY,IACrCV,EAAG,KAAO,EACZc,KAAKd,EAAKiB,CAAG,QACVF,EAAG,CACR,OAAON,EAAOM,CAAC,EAEnBF,EAAKD,CAAG,EAGZ,SAASC,EAAKD,EAAQ,CAClB,GAAIM,GAAWN,GAAKO,IAAI,EAAG,CAEvBP,EAAIO,KAAKN,EAAMJ,CAAM,EACrB,OAEJ,OAAIG,EAAIQ,KACGZ,EAAQI,EAAIS,KAAK,GAE5BjB,EAAiBG,QAAQC,QAAQI,EAAIS,KAAK,EACnCjB,EAAgBe,KAAKR,EAAaK,CAAU,GAGvDL,EAAYN,MAAS,EACxB,EAEDC,OAAAA,EAAQgB,OAASrB,GAAUP,EAAI,aAAaI,EAAK,YAAa,UAAA,CAC1D,GAAI,CACIM,GACAmB,GAAcnB,CAAc,EAGhC,IAAMT,EAAMK,EAAG,OAASK,MAAgB,EAElCmB,EAAiBjB,QAAQC,QAAQb,EAAI0B,KAAK,EAChDG,EAAeL,KAAKM,GAAMA,EAAI,EAC9BF,GAAcC,CAAc,EAE5BrB,EAAS,IAAIuB,EAAuB,QAC/BX,EAAG,CACRZ,EAASY,CAAC,GAEjB,EACMT,GAEXX,OAAAA,EAAIgC,WAAa,GACVhC,CACX,EACAlB,EAAc,EAGlBI,GAAKD,MAAQgD,GAA0BjD,EAAmB,EAE1D,SAAS4C,GAAcjB,EAAO,CACtBY,GAAWZ,EAAQgB,MAAM,GACzBhB,EAAQgB,OAAM,CAEtB,CAYA,SAAgBO,GAAOC,EAAO,CAC1B,OAAOA,GAAIC,aAAe,EAC9B,CIpJA,SAASC,GAAcC,EAAOC,EAAsB,CAChD,OAAKD,EAGDC,IAAaC,OACGC,GAAgBH,CAAK,GAAKI,GAAkBJ,CAAK,EACtDK,GACH,+GAA+G,EAGnHC,GAAmBN,CAAK,EACjBA,EAAMO,EAAK,EAAEC,QAAQC,IAAIR,CAAQ,EAErC,GAIPK,GAAmBN,CAAK,GACxB,CAAC,CAACA,EAAMO,EAAK,GACbG,GAAOV,CAAK,GACZW,GAAWX,CAAK,GAChBY,GAAgBZ,CAAK,EAnBd,EAqBf,CAEA,SAAgBa,GAAab,EAAU,CACnC,OAAec,UAAUC,SAAW,GAChCV,GAAG,uGAAA,EAIAN,GAAcC,CAAK,CAC9B,CC0IA,SAAgBgB,GAAWC,EAAW,CAClC,GAAIC,GAAmBD,CAAG,EACtB,OAAQA,EAAmCE,EAAK,EAAEC,SAAQ,EAE9DC,GAAI,EAAE,CACV,CE/KA,SAASC,GAAYC,EAAoBC,EAAQC,EAAQ,CACrDF,OAAAA,EAAIG,IAAIF,EAAKC,CAAK,EACXA,CACX,CAEA,SAASE,GAAWC,EAAQC,EAA4B,CACpD,GACID,GAAU,MACV,OAAOA,GAAW,UAClBA,aAAkBE,MAClB,CAACC,GAAaH,CAAM,EAEpB,OAAOA,EAGX,GAAII,GAAkBJ,CAAM,GAAKK,GAAgBL,CAAM,EACnD,OAAOD,GAAWC,EAAOM,IAAG,EAAIL,CAAa,EAEjD,GAAIA,EAAcM,IAAIP,CAAM,EACxB,OAAOC,EAAcK,IAAIN,CAAM,EAEnC,GAAIQ,GAAkBR,CAAM,EAAG,CAC3B,IAAMS,EAAMf,GAAMO,EAAeD,EAAQ,IAAIU,MAAMV,EAAOW,MAAM,CAAC,EACjEX,OAAAA,EAAOY,QAAQ,SAACf,EAAOgB,EAAG,CACtBJ,EAAII,CAAG,EAAId,GAAWF,EAAOI,CAAa,EAC7C,EACMQ,EAEX,GAAIK,GAAgBd,CAAM,EAAG,CACzB,IAAMS,EAAMf,GAAMO,EAAeD,EAAQ,IAAIe,GAAK,EAClDf,OAAAA,EAAOY,QAAQ,SAAAf,EAAK,CAChBY,EAAIO,IAAIjB,GAAWF,EAAOI,CAAa,CAAC,EAC3C,EACMQ,EAEX,GAAIQ,GAAgBjB,CAAM,EAAG,CACzB,IAAMS,EAAMf,GAAMO,EAAeD,EAAQ,IAAIkB,GAAK,EAClDlB,OAAAA,EAAOY,QAAQ,SAACf,EAAOD,EAAG,CACtBa,EAAIX,IAAIF,EAAKG,GAAWF,EAAOI,CAAa,CAAC,EAChD,EACMQ,MACJ,CAEH,IAAMA,EAAMf,GAAMO,EAAeD,EAAQ,CAAA,CAAE,EAC3CmB,OAAAA,GAAWnB,CAAM,EAAEY,QAAQ,SAAChB,EAAQ,CAC5BwB,GAAgBC,qBAAqBC,KAAKtB,EAAQJ,CAAG,IACrDa,EAAIb,CAAG,EAAIG,GAAWC,EAAOJ,CAAG,EAAGK,CAAa,GAEvD,EACMQ,EAEf,CAQA,SAAgBc,GAAQvB,EAAWwB,EAAa,CAC5C,OAAeA,GACXC,GAAI,iCAAiC,EAElC1B,GAAWC,EAAQ,IAAIkB,GAAK,CACvC,UCvEgBQ,IAAKA,CAIU,QAAvBC,EAAkB,GAAKC,EAAAC,UAAAlB,OAJNmB,EAAW,IAAApB,MAAAkB,CAAA,EAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAAXD,EAAWC,CAAA,EAAAF,UAAAE,CAAA,EAK5B,OAAOD,EAAKA,EAAKnB,OAAS,CAAC,GAAM,YACjCgB,EAAkBG,EAAKE,IAAG,GAE9B,IAAMC,EAAaC,GAAgBJ,CAAI,EACvC,GAAI,CAACG,EACD,OAAOR,GAAG,+IAAA,EAIVQ,EAAWE,aAAeC,GAAUC,MACpCC,QAAQC,IAAG,iBAAkBN,EAAWO,MAAK,mBAAA,EAEjDP,EAAWE,WAAaR,EAAkBS,GAAUK,MAAQL,GAAUM,GAC1E,CAEA,SAASR,GAAgBJ,EAAI,CACzB,OAAQA,EAAKnB,OAAM,CACf,IAAK,GACD,OAAOgC,EAAYC,mBACvB,IAAK,GACD,OAAOC,GAAQf,EAAK,CAAC,CAAC,EAC1B,IAAK,GACD,OAAOe,GAAQf,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAE3C,CCzBA,SAAgBgB,GAAeC,EAAiBC,EAAO,CAAPA,IAAO,SAAPA,EAAUC,QACtDC,GAAU,EACV,GAAI,CACA,OAAOH,EAAOI,MAAMH,CAAO,UAE3BI,GAAQ,EAEhB,CEHA,SAASC,GAAOC,EAAM,CAClB,OAAOA,EAAOC,EAAK,CACvB,CAIA,IAAMC,GAAsC,CACxCC,IAAG,SAACH,EAA6BI,EAAiB,CAC9C,OAAeC,EAAYC,oBACvBC,GACI,+EAA+E,EAGhFR,GAAOC,CAAM,EAAEQ,KAAKJ,CAAI,GAEnCK,IAAG,SAACT,EAA6BI,EAAiB,CAC9C,OAAOL,GAAOC,CAAM,EAAEU,KAAKN,CAAI,GAEnCO,IAAG,SAACX,EAA6BI,EAAmBQ,EAAU,OAC1D,OAAKC,GAAYT,CAAI,GAGLL,GAAOC,CAAM,EAAEc,QAAQX,IAAIC,CAAI,GAC3CG,GACI,yFAAyF,GAIjGQ,EAAOhB,GAAOC,CAAM,EAAEgB,KAAKZ,EAAMQ,EAAO,EAAI,IAAC,KAAAG,EAAI,IARtC,IAUfE,eAAc,SAACjB,EAA6BI,EAAiB,OAMzD,OAJIG,GACI,gFAAgF,EAGnFM,GAAYT,CAAI,GAIrBc,EAAOnB,GAAOC,CAAM,EAAEmB,QAAQf,EAAM,EAAI,IAAC,KAAAc,EAAI,GAHlC,IAKfE,eAAc,SACVpB,EACAI,EACAiB,EAA8B,OAG1Bd,OAAAA,GACI,oFAAoF,GAI5Fe,EAAOvB,GAAOC,CAAM,EAAEuB,gBAAgBnB,EAAMiB,CAAU,IAAC,KAAAC,EAAI,IAE/DE,QAAO,SAACxB,EAA2B,CAC/B,OAAeK,EAAYC,oBACvBC,GACI,oFAAoF,EAGrFR,GAAOC,CAAM,EAAEyB,SAAQ,GAElCC,kBAAiB,SAAC1B,EAAM,CACpB2B,GAAI,EAAE,IAId,SAAgBC,GACZ5B,EACA6B,EAAiC,SAEjCC,OAAAA,GAAa,EACb9B,EAAS+B,GAAmB/B,EAAQ6B,CAAO,GAC3CG,GAAQC,EAAAjC,EAAOC,EAAK,GAAEiC,SAAM,KAAAF,EAApBC,EAAcC,OAAW,IAAIC,MAAMnC,EAAQE,EAAgB,CACvE,UChFgBkC,GAAgBC,EAAkC,CAC9D,OAAOA,EAAcC,gBAAkBC,QAAaF,EAAcC,cAAcE,OAAS,CAC7F,CAEA,SAAgBC,GACZJ,EACAK,EAAwB,CAExB,IAAMC,EAAeN,EAAcC,gBAAkBD,EAAcC,cAAgB,CAAA,GACnFK,OAAAA,EAAaC,KAAKF,CAAO,EAClBG,GAAK,UAAA,CACR,IAAMC,EAAMH,EAAaI,QAAQL,CAAO,EACpCI,IAAQ,IACRH,EAAaK,OAAOF,EAAK,CAAC,EAEjC,CACL,CAEA,SAAgBG,GACZZ,EACAa,EAAgB,CAEhB,IAAMC,EAAQC,GAAc,EAC5B,GAAI,CAGA,QADMT,EAAY,CAAA,EAAAU,OAAQhB,EAAcC,eAAiB,CAAA,CAAE,EAClDgB,EAAI,EAAGC,EAAIZ,EAAaH,OAAQc,EAAIC,IACzCL,EAASP,EAAaW,CAAC,EAAEJ,CAAM,EAC3BA,GAAU,CAAEA,EAAeM,MAC3B7B,GAAI,EAAE,EAEN,EAACuB,GALuCI,IAK5C,CAIJ,OAAOJ,UAEPO,GAAaN,CAAK,EAE1B,UCzCgBO,GAAaC,EAAuB,CAChD,OAAOA,EAAWC,mBAAqBrB,QAAaoB,EAAWC,iBAAiBpB,OAAS,CAC7F,CAEA,SAAgBqB,GAAiBF,EAAyBjB,EAAiB,CACvE,IAAMoB,EAAYH,EAAWC,mBAAqBD,EAAWC,iBAAmB,CAAA,GAChFE,OAAAA,EAAUlB,KAAKF,CAAO,EACfG,GAAK,UAAA,CACR,IAAMC,EAAMgB,EAAUf,QAAQL,CAAO,EACjCI,IAAQ,IACRgB,EAAUd,OAAOF,EAAK,CAAC,EAE9B,CACL,CAEA,SAAgBiB,GAAmBJ,EAAyBT,EAAS,CACjE,IAAMC,EAAQC,GAAc,EACxBU,EAAYH,EAAWC,iBAC3B,GAAKE,EAGLA,CAAAA,EAAYA,EAAUE,MAAK,EAC3B,QAASV,EAAI,EAAGC,EAAIO,EAAUtB,OAAQc,EAAIC,EAAGD,IACzCQ,EAAUR,CAAC,EAAEJ,CAAM,EAEvBO,GAAaN,CAAK,EACtB,UCNgBc,GACZjE,EACAkE,EACArC,EAA+B,CAE/BsC,OAAAA,GAAe,UAAA,OACLC,EAAsCrC,GAAmB/B,EAAQ6B,CAAO,EAAE5B,EAAK,EACtEiE,GAAelE,EAAOqE,EAAuB,GACxD1C,GAAG,8HAAA,GAKP2C,EAAAJ,IAAW,OAAXA,EAAgBK,GAAyBvE,CAAM,GAG/CwB,GAAQ0C,CAAW,EAAEM,QAAQ,SAAAC,EAAG,CAAA,OAAIL,EAAIM,MAAMD,EAAKP,EAAaO,CAAG,CAAC,IACvE,EACMzE,CACX,CCbA,IAAM2E,GAAS,SACFC,GAAS,SACTC,GAAkB,IAgDzBC,GAAa,CACfC,IAAG,SAACC,EAAQC,EAAI,CACZ,IAAMC,EAAqCF,EAAOG,EAAK,EACvD,OAAIF,IAASE,GACFD,EAEPD,IAAS,SACFC,EAAIE,gBAAe,EAE1B,OAAOH,GAAS,UAAY,CAACI,MAAMJ,CAAW,EACvCC,EAAII,KAAKC,SAASN,CAAI,CAAC,EAE9BO,GAAQC,GAAiBR,CAAI,EACtBQ,GAAgBR,CAAI,EAExBD,EAAOC,CAAI,GAEtBS,IAAG,SAACV,EAAQC,EAAMU,EAAK,CACnB,IAAMT,EAAqCF,EAAOG,EAAK,EACvD,OAAIF,IAAS,UACTC,EAAIU,gBAAgBD,CAAK,EAEzB,OAAOV,GAAS,UAAYI,MAAMJ,CAAI,EACtCD,EAAOC,CAAI,EAAIU,EAGfT,EAAIW,KAAKN,SAASN,CAAI,EAAGU,CAAK,EAE3B,IAEXG,kBAAiB,UAAAA,CACbC,GAAI,EAAE,IAIDC,GAA6B,UAAA,CAYtC,SAAAA,EACIf,EACAgB,EACOC,EACAC,EAAoB,CAH3BlB,IAAI,SAAJA,EAAiB,mBAAqBmB,GAAS,GAAsB,KAE9DF,OAAAA,YACAC,YAAAA,YAbXE,MAAK,OAAA,KACIC,QAAiB,CAAA,EAAE,KAC5BC,cAAa,OAAA,KACbC,iBAAgB,OAAA,KAChBC,UAAS,OAAA,KACTC,SAAQ,OAAA,KACRC,OAAM,OAAA,KACNC,iBAAmB,EAKR,KAAA,OAAAV,EACA,KAAA,YAAAC,EAEP,KAAKE,MAAQ,IAAIQ,GAAK5B,CAAI,EAC1B,KAAKwB,UAAY,SAACK,EAAMC,EAAI,CAAA,OACxBd,EAASa,EAAMC,EAAgB9B,EAAO,MAA8B,GAC3E,IAAA+B,EAAAhB,EAAAiB,UAAAD,OAAAA,EAEDE,cAAA,SAAcvB,EAAU,CACpB,OAAI,KAAKe,WAAaS,OACX,KAAKT,SAASf,CAAK,EAEvBA,GACVqB,EAEDI,eAAA,SAAeC,EAAa,CACxB,OAAI,KAAKX,WAAaS,QAAaE,EAAOC,OAAS,EACxCD,EAAOE,IAAI,KAAKb,QAAQ,EAE5BW,GACVL,EAEDQ,WAAA,SAAWC,EAAoE,CAC3E,OAAOC,GAAmE,KAAMD,CAAO,GAC1FT,EAEDW,SAAA,SACIC,EACAC,EAAe,QAAfA,IAAe,SAAfA,EAAkB,IAEdA,GACAD,EAA4B,CACxBE,eAAgB,QAChBC,OAAQ,KAAKpB,OACbqB,gBAAiB,KAAK3B,MAAM4B,MAC5BC,KAAM,SACNC,MAAO,EACPC,MAAO,KAAK9B,QAAQ+B,MAAK,EACzBC,WAAY,KAAKhC,QAAQgB,OACzBiB,QAAS,CAAA,EACTC,aAAc,EACjB,EAEEC,GAAiB,KAAMb,CAAQ,GACzCZ,EAED5B,gBAAA,UAAAA,CACI,YAAKiB,MAAMqC,eAAc,EAClB,KAAKpC,QAAQgB,QACvBN,EAEDpB,gBAAA,SAAgB+C,EAAiB,EACzB,OAAOA,GAAc,UAAYtD,MAAMsD,CAAS,GAAKA,EAAY,IACjE5C,GAAI,iBAAmB4C,CAAS,EAEpC,IAAIC,EAAgB,KAAKtC,QAAQgB,OACjC,GAAIqB,IAAcC,KAEPD,EAAYC,EAAe,CAElC,QADMC,EAAW,IAAIC,MAAMH,EAAYC,CAAa,EAC3CG,EAAI,EAAGA,EAAIJ,EAAYC,EAAeG,IAC3CF,EAASE,CAAC,EAAI5B,OAElB,KAAK6B,iBAAiBJ,EAAe,EAAGC,CAAQ,OAEhD,KAAKG,iBAAiBL,EAAWC,EAAgBD,CAAS,GAEjE3B,EAEDiC,mBAAA,SAAmBC,EAAmBC,EAAa,CAC3CD,IAAc,KAAKtC,kBACnBb,GAAI,EAAE,EAEV,KAAKa,kBAAoBuC,EACrB,KAAKhD,aAAegD,EAAQ,GAC5BC,GAAmBF,EAAYC,EAAQ,CAAC,GAE/CnC,EAEDgC,iBAAA,SAAiBb,EAAekB,EAAsBR,EAAgB,YAClES,GAAoC,KAAKjD,KAAK,EAC9C,IAAMiB,EAAS,KAAKhB,QAAQgB,OAsB5B,GApBIa,IAAUhB,OACVgB,EAAQ,EACDA,EAAQb,EACfa,EAAQb,EACDa,EAAQ,IACfA,EAAQoB,KAAKC,IAAI,EAAGlC,EAASa,CAAK,GAGlCsB,UAAUnC,SAAW,EACrB+B,EAAc/B,EAASa,EACakB,GAAgB,KACpDA,EAAc,EAEdA,EAAcE,KAAKC,IAAI,EAAGD,KAAKG,IAAIL,EAAa/B,EAASa,CAAK,CAAC,EAG/DU,IAAa1B,SACb0B,EAAWc,IAGXC,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAuC,KAAa,CAC/D/B,OAAQ,KAAKpB,OACbuB,KAAMvD,GACNwD,MAAAA,EACAK,aAAca,EACdjB,MAAOS,EACV,EACD,GAAI,CAACgB,EACD,OAAOF,GAEXN,EAAcQ,EAAOrB,aACrBK,EAAWgB,EAAOzB,MAGtBS,EACIA,EAASvB,SAAW,EAAIuB,EAAWA,EAAStB,IAAI,SAAAwC,EAAC,CAAA,OAAIC,EAAKvD,UAAUsD,EAAG5C,MAAS,IAChF,KAAKhB,YACL,IAAM8D,EAAcpB,EAASvB,OAAS+B,EACtC,KAAKJ,mBAAmB3B,EAAQ2C,CAAW,EAE/C,IAAMC,EAAM,KAAKC,uBAAuBhC,EAAOkB,EAAaR,CAAQ,EAEpE,OAAIQ,IAAgB,GAAKR,EAASvB,SAAW,IACzC,KAAK8C,mBAAmBjC,EAAOU,EAAUqB,CAAG,EAEzC,KAAK9C,eAAe8C,CAAG,GACjClD,EAEDmD,uBAAA,SAAuBhC,EAAekB,EAAqBR,EAAe,CACtE,GAAIA,EAASvB,OAASzC,GAAiB,CAAA,IAAAwF,EACnC,OAAOA,EAAA,KAAK/D,SAAQgE,OAAMC,MAAAF,EAAA,CAAClC,EAAOkB,CAAW,EAAAmB,OAAK3B,CAAQ,CAAA,MACvD,CAEH,IAAMqB,EAAM,KAAK5D,QAAQ+B,MAAMF,EAAOA,EAAQkB,CAAW,EAErDoB,EAAW,KAAKnE,QAAQ+B,MAAMF,EAAQkB,CAAW,EAErD,KAAK/C,QAAQgB,QAAUuB,EAASvB,OAAS+B,EACzC,QAASN,EAAI,EAAGA,EAAIF,EAASvB,OAAQyB,IACjC,KAAKzC,QAAQ6B,EAAQY,CAAC,EAAIF,EAASE,CAAC,EAExC,QAASA,EAAI,EAAGA,EAAI0B,EAASnD,OAAQyB,IACjC,KAAKzC,QAAQ6B,EAAQU,EAASvB,OAASyB,CAAC,EAAI0B,EAAS1B,CAAC,EAE1D,OAAOmB,IAEdlD,EAED0D,wBAAA,SAAwBvC,EAAewC,EAAeC,EAAa,CAC/D,IAAMC,EAAY,CAAC,KAAK3E,QAAU4E,GAAY,EACxCC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACH,CACG/C,eAAgB,QAChBC,OAAQ,KAAKpB,OACbuB,KAAMtD,GACNoD,gBAAiB,KAAK3B,MAAM4B,MAC5BE,MAAAA,EACAwC,SAAAA,EACAC,SAAAA,GAEJ,KAIKC,GACXI,GAAepB,CAAO,EAE1B,KAAKxD,MAAM6E,cAAa,EACpBH,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,GAEnBpE,EAEDoD,mBAAA,SAAmBjC,EAAeC,EAAcG,EAAc,CAC1D,IAAMsC,EAAY,CAAC,KAAK3E,QAAU4E,GAAY,EACxCC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACH,CACG/C,eAAgB,QAChBC,OAAQ,KAAKpB,OACbqB,gBAAiB,KAAK3B,MAAM4B,MAC5BC,KAAMvD,GACNwD,MAAAA,EACAI,QAAAA,EACAH,MAAAA,EACAI,aAAcD,EAAQjB,OACtBgB,WAAYF,EAAMd,QAEtB,KAEKuD,GACXI,GAAepB,CAAO,EAE1B,KAAKxD,MAAM6E,cAAa,EAEpBH,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,GAEnBpE,EAED1B,KAAA,SAAK6C,EAAa,CACd,GAAI,KAAKhC,aAAegC,GAAS,KAAK7B,QAAQgB,OAAQ,CAClD+D,QAAQC,KACJ,gDACsDnD,EAAK,4BAA4B,KAAK7B,QAAQgB,OAAM,gFAC/D,EAE/C,OAEJ,YAAKjB,MAAMqC,eAAc,EAClB,KAAKxB,cAAc,KAAKZ,QAAQ6B,CAAK,CAAC,GAChDnB,EAEDnB,KAAA,SAAKsC,EAAewC,EAAa,CAC7B,IAAMtD,EAAS,KAAKf,QAKpB,GAJI,KAAKH,aAAegC,EAAQd,EAAOC,QAEnCvB,GAAI,GAAIoC,EAAOd,EAAOC,MAAM,EAE5Ba,EAAQd,EAAOC,OAAQ,CAEvBgC,GAAoC,KAAKjD,KAAK,EAC9C,IAAMuE,EAAWvD,EAAOc,CAAK,EAC7B,GAAIyB,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAuC,KAAa,CAC/D5B,KAAMtD,GACNmD,OAAQ,KAAKpB,OACbwB,MAAAA,EACAwC,SAAAA,EACH,EACD,GAAI,CAACd,EACD,OAEJc,EAAWd,EAAOc,SAEtBA,EAAW,KAAKlE,UAAUkE,EAAUC,CAAQ,EAC5C,IAAMW,EAAUZ,IAAaC,EACzBW,IACAlE,EAAOc,CAAK,EAAIwC,EAChB,KAAKD,wBAAwBvC,EAAOwC,EAAUC,CAAQ,OAEvD,CAKH,QADM/B,EAAW,IAAIC,MAAMX,EAAQ,EAAId,EAAOC,MAAM,EAC3CyB,EAAI,EAAGA,EAAIF,EAASvB,OAAS,EAAGyB,IACrCF,EAASE,CAAC,EAAI5B,OAElB0B,EAASA,EAASvB,OAAS,CAAC,EAAIqD,EAChC,KAAK3B,iBAAiB3B,EAAOC,OAAQ,EAAGuB,CAAQ,IAEvD7C,CAAA,EAAA,EAGL,SAAgBwF,GACZC,EACAxF,EACAhB,EACAyG,EAAK,QADLzG,IAAI,SAAJA,EAAiB,mBAAqBmB,GAAS,GAC/CsF,IAAK,SAALA,EAAQ,IAERC,GAAa,EACNC,GAAe,UAAA,CAClB,IAAM1G,EAAM,IAAIc,GAA8Bf,EAAMgB,EAAUyF,EAAO,EAAK,EAC1EG,GAAmB3G,EAAIoB,QAASnB,GAAOD,CAAG,EAC1C,IAAM4G,EAAQ,IAAIC,MAAM7G,EAAIoB,QAASxB,EAAU,EAC/CI,OAAAA,EAAIyB,OAASmF,EACTL,GAAiBA,EAAcnE,QAC/BpC,EAAI8D,iBAAiB,EAAG,EAAGyC,CAAa,EAErCK,EACV,CACL,CAGO,IAAIrG,GAAkB,CACzBuG,MAAK,UAAAA,CACD,OAAO,KAAK1B,OAAO,CAAC,GAGxB2B,QAAO,SAACpD,EAAe,CACnB,IAAM3D,EAAqC,KAAKC,EAAK,EACrD,OAAOD,EAAI8D,iBAAiB,EAAG9D,EAAIoB,QAAQgB,OAAQuB,CAAQ,GAI/DqD,OAAM,UAAAA,CACF,OAAO,KAAK7D,MAAK,GASrBiC,OAAM,SAACnC,EAAekB,EAAoB,4BAAKR,EAAe,IAAAC,MAAAqD,EAAA,EAAAA,EAAA,EAAA,CAAA,EAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAfvD,EAAeuD,EAAA,CAAA,EAAA3C,UAAA2C,CAAA,EAC1D,IAAMlH,EAAqC,KAAKC,EAAK,EACrD,OAAQsE,UAAUnC,OAAM,CACpB,IAAK,GACD,MAAO,CAAA,EACX,IAAK,GACD,OAAOpC,EAAI8D,iBAAiBb,CAAK,EACrC,IAAK,GACD,OAAOjD,EAAI8D,iBAAiBb,EAAOkB,CAAW,EAEtD,OAAOnE,EAAI8D,iBAAiBb,EAAOkB,EAAaR,CAAQ,GAG5DwD,gBAAe,SAAClE,EAAekB,EAAsBR,EAAgB,CACjE,OAAQ,KAAK1D,EAAK,EAAoC6D,iBAClDb,EACAkB,EACAR,CAAQ,GAIhByD,KAAI,UAAAA,CACsD,QAAhDpH,EAAqC,KAAKC,EAAK,EAACoH,EAAA9C,UAAAnC,OADlDkF,EAAY,IAAA1D,MAAAyD,CAAA,EAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAZD,EAAYC,CAAA,EAAAhD,UAAAgD,CAAA,EAEhBvH,OAAAA,EAAI8D,iBAAiB9D,EAAIoB,QAAQgB,OAAQ,EAAGkF,CAAK,EAC1CtH,EAAIoB,QAAQgB,QAGvBoF,IAAG,UAAAA,CACC,OAAO,KAAKpC,OAAOf,KAAKC,IAAI,KAAKrE,EAAK,EAAEmB,QAAQgB,OAAS,EAAG,CAAC,EAAG,CAAC,EAAE,CAAC,GAGxEqF,MAAK,UAAAA,CACD,OAAO,KAAKrC,OAAO,EAAG,CAAC,EAAE,CAAC,GAG9BsC,QAAO,UAAAA,CACmD,QAAhD1H,EAAqC,KAAKC,EAAK,EAAC0H,EAAApD,UAAAnC,OAD/CkF,EAAY,IAAA1D,MAAA+D,CAAA,EAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAZN,EAAYM,CAAA,EAAArD,UAAAqD,CAAA,EAEnB5H,OAAAA,EAAI8D,iBAAiB,EAAG,EAAGwD,CAAK,EACzBtH,EAAIoB,QAAQgB,QAGvByF,QAAO,UAAAA,CAGH,OAAIC,EAAYC,oBACZlH,GAAI,GAAI,SAAS,EAErB,KAAKkG,QAAQ,KAAK5D,MAAK,EAAG0E,QAAO,CAAE,EAC5B,MAGXG,KAAI,UAAAA,CAGIF,EAAYC,oBACZlH,GAAI,GAAI,MAAM,EAElB,IAAMoH,EAAO,KAAK9E,MAAK,EACvB8E,OAAAA,EAAKD,KAAK3C,MAAM4C,EAAM1D,SAAS,EAC/B,KAAKwC,QAAQkB,CAAI,EACV,MAGXC,OAAM,SAACzH,EAAU,CACb,IAAMT,EAAqC,KAAKC,EAAK,EAC/CkI,EAAMnI,EAAIkC,eAAelC,EAAIoB,OAAO,EAAEgH,QAAQ3H,CAAK,EACzD,OAAI0H,EAAM,IACN,KAAK/C,OAAO+C,EAAK,CAAC,EACX,IAEJ,KASfE,GAAkB,KAAMC,EAAU,EAClCD,GAAkB,SAAUC,EAAU,EACtCD,GAAkB,OAAQC,EAAU,EACpCD,GAAkB,WAAYC,EAAU,EACxCD,GAAkB,UAAWC,EAAU,EACvCD,GAAkB,OAAQC,EAAU,EACpCD,GAAkB,cAAeC,EAAU,EAC3CD,GAAkB,QAASC,EAAU,EACrCD,GAAkB,WAAYC,EAAU,EACxCD,GAAkB,iBAAkBC,EAAU,EAC9CD,GAAkB,WAAYC,EAAU,EACxCD,GAAkB,YAAaC,EAAU,EACzCD,GAAkB,OAAQC,EAAU,EAEpCD,GAAkB,QAASE,EAAW,EACtCF,GAAkB,SAAUE,EAAW,EACvCF,GAAkB,OAAQE,EAAW,EACrCF,GAAkB,YAAaE,EAAW,EAC1CF,GAAkB,WAAYE,EAAW,EACzCF,GAAkB,gBAAiBE,EAAW,EAC9CF,GAAkB,UAAWE,EAAW,EACxCF,GAAkB,UAAWE,EAAW,EACxCF,GAAkB,MAAOE,EAAW,EACpCF,GAAkB,OAAQE,EAAW,EACrCF,GAAkB,aAAcE,EAAW,EAE3CF,GAAkB,SAAUG,EAAc,EAC1CH,GAAkB,cAAeG,EAAc,EAE/C,SAASH,GAAkBI,EAAUC,EAAW,CACxC,OAAO9E,MAAM7B,UAAU0G,CAAQ,GAAM,aACrClI,GAAgBkI,CAAQ,EAAIC,EAAYD,CAAQ,EAExD,CAGA,SAASH,GAAWG,EAAQ,CACxB,OAAO,UAAA,CACH,IAAMzI,EAAqC,KAAKC,EAAK,EACrDD,EAAImB,MAAMqC,eAAc,EACxB,IAAMmF,EAAiB3I,EAAIkC,eAAelC,EAAIoB,OAAO,EACrD,OAAOuH,EAAeF,CAAQ,EAAEpD,MAAMsD,EAAgBpE,SAAS,EAEvE,CAGA,SAASgE,GAAYE,EAAQ,CACzB,OAAO,SAAUG,EAAUC,EAAO,YACxB7I,EAAqC,KAAKC,EAAK,EACrDD,EAAImB,MAAMqC,eAAc,EACxB,IAAMmF,EAAiB3I,EAAIkC,eAAelC,EAAIoB,OAAO,EACrD,OAAOuH,EAAeF,CAAQ,EAAE,SAACK,EAAS7F,EAAK,CAC3C,OAAO2F,EAASG,KAAKF,EAASC,EAAS7F,EAAO+F,CAAI,EACrD,EAET,CAGA,SAASR,GAAeC,EAAQ,CAC5B,OAAO,UAAA,YACGzI,EAAqC,KAAKC,EAAK,EACrDD,EAAImB,MAAMqC,eAAc,EACxB,IAAMmF,EAAiB3I,EAAIkC,eAAelC,EAAIoB,OAAO,EAE/CwH,EAAWrE,UAAU,CAAC,EAC5BA,iBAAU,CAAC,EAAI,SAAC0E,EAAaC,EAAcjG,EAAK,CAC5C,OAAO2F,EAASK,EAAaC,EAAcjG,EAAOkG,CAAI,GAEnDR,EAAeF,CAAQ,EAAEpD,MAAMsD,EAAgBpE,SAAS,EAEvE,CAEA,IAAM6E,GAAkCC,GACpC,gCACAvI,EAA6B,EAGjC,SAAgBwI,GAAkBC,EAAK,CACnC,OAAOC,GAASD,CAAK,GAAKH,GAAgCG,EAAMtJ,EAAK,CAAC,CAC1E,WCzgBMwJ,GAAsB,CAAA,EAEfC,GAAM,MACNC,GAAS,SAStBC,GAgPKC,OAAOC,SAAQC,GAuIXF,OAAOG,YAtXhB,IAAaC,GAAa,UAAA,CAWtB,SAAAA,EACIC,EACO3I,EACAwB,EAAAA,YADAxB,IAAAA,SAAAA,EAA0B4I,IAC1BpH,IAAAA,SAAAA,EAAkB,iBAAmB7B,GAAS,GAAoB,KADlEK,UAAAA,YACAwB,MAAAA,YAXV9C,EAAK,EAAIwJ,GAAmB,KAC7BW,MAAK,OAAA,KACLC,QAAO,OAAA,KACPC,UAAS,OAAA,KACTjJ,cAAa,OAAA,KACbC,iBAAgB,OAAA,KAChBE,SAAQ,OAIG,KAAA,UAAAD,EACA,KAAA,MAAAwB,EAEFwH,GAAWC,GAAG,GACf3J,GAAI,EAAE,EAEV6F,GAAe,UAAA,CACX5B,EAAKwF,UAAYG,GAAwB3F,EAAK/B,MAAK,SAAkC,EACrF+B,EAAKsF,MAAQ,IAAII,IACjB1F,EAAKuF,QAAU,IAAIG,IACfN,GACApF,EAAK4F,MAAMR,CAAW,EAE7B,EACJ,IAAApI,EAAAmI,EAAAlI,UAAAD,OAAAA,EAEO6I,KAAA,SAAKC,EAAM,CACf,OAAO,KAAKR,MAAMS,IAAID,CAAG,GAC5B9I,EAED+I,IAAA,SAAID,EAAM,YACN,GAAI,CAAC9C,EAAYC,mBACb,OAAO,KAAK4C,KAAKC,CAAG,EAGxB,IAAIE,EAAQ,KAAKT,QAAQxK,IAAI+K,CAAG,EAChC,GAAI,CAACE,EAAO,CACR,IAAMC,EAAYD,EAAQ,IAAIE,GAC1B,KAAKL,KAAKC,CAAG,EACbK,GACa,KAAKlI,MAAK,IAAImI,GAAaN,CAAG,EAAC,IAC5C,EAAK,EAET,KAAKP,QAAQ7J,IAAIoK,EAAKG,CAAQ,EAC9BI,GAAmBJ,EAAU,UAAA,CAAA,OAAM/B,EAAKqB,QAAO,OAAQO,CAAG,IAG9D,OAAOE,EAAMjL,IAAG,GACnBiC,EAEDtB,IAAA,SAAIoK,EAAQnK,EAAQ,CAChB,IAAM2K,EAAS,KAAKT,KAAKC,CAAG,EAC5B,GAAIlG,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAsC,KAAM,CACvD5B,KAAMoI,EAAS1L,GAASgK,GACxB7G,OAAQ,KACR4C,SAAUhF,EACVV,KAAM6K,EACT,EACD,GAAI,CAACjG,EACD,OAAO,KAEXlE,EAAQkE,EAAOc,SAEnB,OAAI2F,EACA,KAAKC,aAAaT,EAAKnK,CAAK,EAE5B,KAAK6K,UAAUV,EAAKnK,CAAK,EAEtB,MACVqB,EAAA,OAED,SAAO8I,EAAM,YAET,GADAxG,GAAoC,KAAKkG,SAAS,EAC9C5F,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAsC,KAAM,CACvD5B,KAAM2G,GACN9G,OAAQ,KACR9C,KAAM6K,EACT,EACD,GAAI,CAACjG,EACD,MAAO,GAGf,GAAI,KAAKgG,KAAKC,CAAG,EAAG,CAChB,IAAMjF,EAAYC,GAAY,EACxBC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACJ,CACI/C,eAAgB,MAChBE,gBAAiB,KAAKC,MACtBC,KAAM2G,GACN9G,OAAQ,KACR6C,SAAgB,KAAK0E,MAAMvK,IAAI+K,CAAG,EAAGW,OACrCxL,KAAM6K,GAEV,KAEV,OAAejF,GACXI,GAAepB,CAAuB,EAE1C6G,GAAY,UAAA,OACRrC,EAAKmB,UAAUtE,cAAa,GAC5ByF,EAAAtC,EAAKkB,QAAQxK,IAAI+K,CAAG,IAAC,MAArBa,EAAuBC,aAAa,EAAK,EACzC,IAAMC,EAAaxC,EAAKiB,MAAMvK,IAAI+K,CAAG,EACrCe,EAAWD,aAAazJ,MAAgB,EACxCkH,EAAKiB,MAAK,OAAQQ,CAAG,EACxB,EACG/E,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,EAET,GAEX,MAAO,IACVpE,EAEOuJ,aAAA,SAAaT,EAAQnF,EAAuB,CAChD,IAAMkG,EAAa,KAAKvB,MAAMvK,IAAI+K,CAAG,EAErC,GADAnF,EAAYkG,EAAmBC,iBAAiBnG,CAAQ,EACpDA,IAAaqC,EAAY+D,UAAW,CACpC,IAAMlG,EAAYC,GAAY,EACxBC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACJ,CACI/C,eAAgB,MAChBE,gBAAiB,KAAKC,MACtBC,KAAMtD,GACNmD,OAAQ,KACR6C,SAAWiG,EAAmBJ,OAC9BxL,KAAM6K,EACNnF,SAAAA,GAEJ,KACKE,GACXI,GAAepB,CAAuB,EAE1CgH,EAAWD,aAAajG,CAAa,EACjCI,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,IAGvBpE,EAEOwJ,UAAA,SAAUV,EAAQnF,EAAW,YACjCrB,GAAoC,KAAKkG,SAAS,EAClDkB,GAAY,UAAA,OACFG,EAAa,IAAIX,GACnBvF,EACAqG,EAAKvK,UACQuK,EAAK/I,MAAK,IAAImI,GAAaN,CAAG,EAC3C,EAAK,EAETkB,EAAK1B,MAAM5J,IAAIoK,EAAKe,CAAU,EAC9BlG,EAAYkG,EAAmBJ,QAC/BQ,EAAAD,EAAKzB,QAAQxK,IAAI+K,CAAG,IAAC,MAArBmB,EAAuBL,aAAa,EAAI,EACxCI,EAAKxB,UAAUtE,cAAa,EAC/B,EACD,IAAML,EAAYC,GAAY,EACxBC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACJ,CACI/C,eAAgB,MAChBE,gBAAiB,KAAKC,MACtBC,KAAM0G,GACN7G,OAAQ,KACR9C,KAAM6K,EACNnF,SAAAA,GAEJ,KACKE,GACXI,GAAepB,CAAuB,EAEtCkB,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,GAEnBpE,EAEDjC,IAAA,SAAI+K,EAAM,CACN,OAAI,KAAKC,IAAID,CAAG,EACL,KAAK5I,cAAc,KAAKoI,MAAMvK,IAAI+K,CAAG,EAAG/K,IAAG,CAAE,EAEjD,KAAKmC,cAAcC,MAAS,GACtCH,EAEOE,cAAA,SAAuCvB,EAAQ,CACnD,OAAI,KAAKe,WAAaS,OACX,KAAKT,SAASf,CAAK,EAEvBA,GACVqB,EAEDkK,KAAA,UAAAA,CACI,YAAK1B,UAAU9G,eAAc,EACtB,KAAK4G,MAAM4B,KAAI,GACzBlK,EAEDK,OAAA,UAAAA,CACI,IAAM8J,EAAO,KACPD,EAAO,KAAKA,KAAI,EACtB,OAAOE,GAAa,CAChBC,KAAI,UAAAA,CACA,IAAAC,EAAwBJ,EAAKG,KAAI,EAAzBE,EAAID,EAAJC,KAAM5L,EAAK2L,EAAL3L,MACd,MAAO,CACH4L,KAAAA,EACA5L,MAAO4L,EAAQpK,OAAoBgK,EAAKpM,IAAIY,CAAK,IAG5D,GACJqB,EAEDwK,QAAA,UAAAA,CACI,IAAML,EAAO,KACPD,EAAO,KAAKA,KAAI,EACtB,OAAOE,GAAa,CAChBC,KAAI,UAAAA,CACA,IAAAI,EAAwBP,EAAKG,KAAI,EAAzBE,EAAIE,EAAJF,KAAM5L,EAAK8L,EAAL9L,MACd,MAAO,CACH4L,KAAAA,EACA5L,MAAO4L,EAAQpK,OAAqB,CAACxB,EAAOwL,EAAKpM,IAAIY,CAAK,CAAE,IAGvE,GACJqB,EAAA8H,EAAA,EAED,UAAA,CACI,OAAO,KAAK0C,QAAO,GACtBxK,EAED0K,QAAA,SAAQ5D,EAAyDC,EAAQ,CACrE,QAAA4D,EAAAC,GAA2B,IAAI,EAAAC,EAAA,EAAAA,EAAAF,EAAA,GAAAJ,MAAE,CAAA,IAAAO,EAAAD,EAAAlM,MAArBmK,EAAGgC,EAAA,CAAA,EAAEnM,EAAKmM,EAAA,CAAA,EAClBhE,EAASG,KAAKF,EAASpI,EAAOmK,EAAK,IAAI,IAI/C9I,EACA4I,MAAA,SAAMmC,EAAyC,YAC3C,OAAIC,GAAgBD,CAAK,IACrBA,EAAQ,IAAIrC,IAAIqC,CAAK,GAEzBrB,GAAY,UAAA,CACJuB,GAAcF,CAAK,EACnBG,GAAmBH,CAAK,EAAEL,QAAQ,SAAC5B,EAAQ,CAAA,OACvCqC,EAAKzM,IAAIoK,EAAWiC,EAAuBjC,CAAG,CAAC,IAE5ChH,MAAMsJ,QAAQL,CAAK,EAC1BA,EAAML,QAAQ,SAAAW,EAAA,CAAA,IAAEvC,EAAGuC,EAAA,CAAA,EAAE1M,EAAK0M,EAAA,CAAA,EAAA,OAAMF,EAAKzM,IAAIoK,EAAKnK,CAAK,IAC5C2M,GAASP,CAAK,GACjBA,EAAMQ,cAAgB7C,KACtB3J,GAAI,GAAIgM,CAAK,EAEjBA,EAAML,QAAQ,SAAC/L,EAAOmK,EAAG,CAAA,OAAKqC,EAAKzM,IAAIoK,EAAKnK,CAAK,KAC1CoM,GAAU,MACjBhM,GAAI,GAAIgM,CAAK,EAEpB,EACM,MACV/K,EAEDgF,MAAA,UAAAA,YACI0E,GAAY,UAAA,CACR8B,GAAU,UAAA,CACN,QAAAC,EAAAb,GAAkBc,EAAKxB,KAAI,CAAE,EAAAyB,EAAA,EAAAA,EAAAF,EAAA,GAAAlB,MAAE,CAAA,IAApBzB,EAAG6C,EAAAhN,MACV+M,EAAI,OAAQ5C,CAAG,GAEtB,EACJ,GACJ9I,EAEDiF,QAAA,SAAQ5E,EAAyC,YAO7CqJ,OAAAA,GAAY,UAAA,CASR,QAPMkC,EAAiBC,GAAaxL,CAAM,EACpCyL,EAAc,IAAIpD,IAEpBqD,EAA0B,GAI9BC,EAAApB,GAAkBqB,EAAK3D,MAAM4B,KAAI,CAAE,EAAAgC,EAAA,EAAAA,EAAAF,EAAA,GAAAzB,MAAE,CAAA,IAA1BzB,EAAGoD,EAAAvN,MAGV,GAAI,CAACiN,EAAe7C,IAAID,CAAG,EAAG,CAC1B,IAAMqD,EAAUF,EAAI,OAAQnD,CAAG,EAE/B,GAAIqD,EAEAJ,EAA0B,OACvB,CAEH,IAAMpN,EAAQsN,EAAK3D,MAAMvK,IAAI+K,CAAG,EAChCgD,EAAYpN,IAAIoK,EAAKnK,CAAK,IAKtC,QAAAyN,EAAAxB,GAA2BgB,EAAepB,QAAO,CAAE,EAAA6B,EAAA,EAAAA,EAAAD,EAAA,GAAA7B,MAAE,CAAA,IAAA+B,EAAAD,EAAA1N,MAAzCmK,EAAGwD,EAAA,CAAA,EAAE3N,EAAK2N,EAAA,CAAA,EAEZC,EAAaN,EAAK3D,MAAMS,IAAID,CAAG,EAIrC,GAFAmD,EAAKvN,IAAIoK,EAAKnK,CAAK,EAEfsN,EAAK3D,MAAMS,IAAID,CAAG,EAAG,CAIrB,IAAMnK,EAAQsN,EAAK3D,MAAMvK,IAAI+K,CAAG,EAChCgD,EAAYpN,IAAIoK,EAAKnK,CAAK,EAErB4N,IAEDR,EAA0B,KAKtC,GAAI,CAACA,EACD,GAAIE,EAAK3D,MAAMkE,OAASV,EAAYU,KAEhCP,EAAKzD,UAAUtE,cAAa,MAM5B,SAJMuI,EAAQR,EAAK3D,MAAM4B,KAAI,EACvBwC,EAAQZ,EAAY5B,KAAI,EAC1ByC,EAAQF,EAAMpC,KAAI,EAClBuC,EAAQF,EAAMrC,KAAI,EACf,CAACsC,EAAMpC,MAAM,CAChB,GAAIoC,EAAMhO,QAAUiO,EAAMjO,MAAO,CAC7BsN,EAAKzD,UAAUtE,cAAa,EAC5B,MAEJyI,EAAQF,EAAMpC,KAAI,EAClBuC,EAAQF,EAAMrC,KAAI,EAK9B4B,EAAK3D,MAAQwD,EAChB,EACM,MACV9L,EAOD6M,SAAA,UAAAA,CACI,MAAO,0BACV7M,EAEDkF,OAAA,UAAAA,CACI,OAAOpD,MAAMgL,KAAK,IAAI,GAO1B9M,EAKAW,SAAA,SAASC,EAAkDC,EAAyB,CAChF,OAAeA,IAAoB,IAC/B9B,GAAI,0EAA0E,EAE3E0C,GAAiB,KAAMb,CAAQ,GACzCZ,EAEDQ,WAAA,SAAWC,EAA2C,CAClD,OAAOC,GAAoB,KAAMD,CAAO,GAC3CsM,GAAA5E,EAAA,CAAA,CAAAW,IAAA,OAAA/K,IA/BD,UAAAA,CACI,YAAKyK,UAAU9G,eAAc,EACtB,KAAK4G,MAAMkE,QACrB1D,IAAAb,GAAAlK,IAUD,UAAAA,CACI,MAAO,UACVoK,CAAA,EAAA,EAoBM6C,GAAkBzD,GAA0B,gBAAiBY,EAAa,EAIrF,SAAS0D,GAAamB,EAAkB,CACpC,GAAI1B,GAAS0B,CAAa,GAAKhC,GAAgBgC,CAAa,EACxD,OAAOA,KACAlL,MAAMsJ,QAAQ4B,CAAa,EAClC,OAAO,IAAItE,IAAIsE,CAAa,KACrB/B,GAAc+B,CAAa,EAAG,CACrC,IAAMzM,EAAM,IAAImI,IAChB,QAAWI,KAAOkE,EACdzM,EAAI7B,IAAIoK,EAAKkE,EAAclE,CAAG,CAAC,EAEnC,OAAOvI,MAEP,QAAOxB,GAAI,GAAIiO,CAAa,CAEpC,WCxdMC,GAAsB,CAAA,EAAEnF,GA2PzBC,OAAOC,SAAQC,GAIXF,OAAOG,YA/NhB,IAAagF,GAAa,UAAA,CAStB,SAAAA,EACI9E,EACAnJ,EACOgC,EAAAA,YADPhC,IAAAA,SAAAA,EAAyBoJ,IAClBpH,IAAAA,SAAAA,EAAkB,iBAAmB7B,GAAS,GAAoB,KAAlE6B,MAAAA,YAXV9C,EAAK,EAAI8O,GAAmB,KACrB3E,MAAkB,IAAI6E,IAAK,KACnC9N,MAAK,OAAA,KACLG,iBAAgB,OAAA,KAChBD,cAAa,OAAA,KACbG,SAAQ,OAAA,KACRD,UAAS,OAKE,KAAA,MAAAwB,EAEFwH,GAAW0E,GAAG,GACfpO,GAAI,EAAE,EAEV,KAAKU,UAAY,SAACK,EAAMC,EAAI,CAAA,OAAKd,EAASa,EAAMC,EAAMkB,CAAK,GAC3D2D,GAAe,UAAA,CACX5B,EAAK3D,MAAQsJ,GAAW3F,EAAK/B,KAAK,EAC9BmH,GACApF,EAAKiC,QAAQmD,CAAW,EAE/B,EACJ,IAAApI,EAAAkN,EAAAjN,UAAAD,OAAAA,EAEOE,cAAA,SAAuCvB,EAAQ,CACnD,OAAI,KAAKe,WAAaS,OACX,KAAKT,SAASf,CAAK,EAEvBA,GACVqB,EAEDgF,MAAA,UAAAA,YACI0E,GAAY,UAAA,CACR8B,GAAU,UAAA,CACN,QAAAb,EAAAC,GAAoB1D,EAAKoB,MAAMjI,OAAM,CAAE,EAAAwK,EAAA,EAAAA,EAAAF,EAAA,GAAAJ,MAAE,CAAA,IAA9B5L,EAAKkM,EAAAlM,MACZuI,EAAI,OAAQvI,CAAK,GAExB,EACJ,GACJqB,EAED0K,QAAA,SAAQ0C,EAAwDrG,EAAa,CACzE,QAAA0E,EAAAb,GAAoB,IAAI,EAAAe,EAAA,EAAAA,EAAAF,EAAA,GAAAlB,MAAE,CAAA,IAAf5L,EAAKgN,EAAAhN,MACZyO,EAAWnG,KAAKF,EAASpI,EAAOA,EAAO,IAAI,IAElDqB,EAODqN,IAAA,SAAI1O,EAAQ,YAER,GADA2D,GAAoC,KAAKjD,KAAK,EAC1CuD,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD5B,KAAM0G,GACN7G,OAAQ,KACR4C,SAAUhF,EACb,EACD,GAAI,CAACkE,EACD,OAAO,KAKf,GAAI,CAAC,KAAKkG,IAAIpK,CAAK,EAAG,CAClB+K,GAAY,UAAA,CACRrC,EAAKiB,MAAM+E,IAAIhG,EAAK5H,UAAUd,EAAOwB,MAAS,CAAC,EAC/CkH,EAAKhI,MAAM6E,cAAa,EAC3B,EACD,IAAML,EAAuBC,GAAY,EACnCC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACc,CACd/C,eAAgB,MAChBE,gBAAiB,KAAKC,MACtBC,KAAM0G,GACN7G,OAAQ,KACR4C,SAAUhF,GAEd,KACNkF,GACAI,GAAepB,CAAO,EAEtBkB,GACAI,GAAgB,KAAMtB,CAAM,EAE5BgB,GACAO,GAAY,EAIpB,OAAO,MACVpE,EAAA,OAED,SAAOrB,EAAQ,YACX,GAAIiE,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD5B,KAAM2G,GACN9G,OAAQ,KACR6C,SAAUjF,EACb,EACD,GAAI,CAACkE,EACD,MAAO,GAGf,GAAI,KAAKkG,IAAIpK,CAAK,EAAG,CACjB,IAAMkF,EAAuBC,GAAY,EACnCC,EAASC,GAAa,IAAI,EAC1BnB,EACFkB,GAAUF,EACc,CACd/C,eAAgB,MAChBE,gBAAiB,KAAKC,MACtBC,KAAM2G,GACN9G,OAAQ,KACR6C,SAAUjF,GAEd,KAEV,OAAIkF,GACAI,GAAepB,CAAO,EAE1B6G,GAAY,UAAA,CACRM,EAAK3K,MAAM6E,cAAa,EACxB8F,EAAK1B,MAAK,OAAQ3J,CAAK,EAC1B,EACGoF,GACAI,GAAgB,KAAMtB,CAAM,EAE5BgB,GACAO,GAAY,EAET,GAEX,MAAO,IACVpE,EAED+I,IAAA,SAAIpK,EAAQ,CACR,YAAKU,MAAMqC,eAAc,EAClB,KAAK4G,MAAMS,IAAI,KAAK7I,cAAcvB,CAAK,CAAC,GAClDqB,EAEDwK,QAAA,UAAAA,CACI,IAAI8C,EAAY,EACVpD,EAAOpI,MAAMgL,KAAK,KAAK5C,KAAI,CAAE,EAC7B7J,EAASyB,MAAMgL,KAAK,KAAKzM,OAAM,CAAE,EACvC,OAAO+J,GAAqB,CACxBC,KAAI,UAAAA,CACA,IAAMlJ,EAAQmM,EACdA,OAAAA,GAAa,EACNnM,EAAQd,EAAOC,OAChB,CAAE3B,MAAO,CAACuL,EAAK/I,CAAK,EAAGd,EAAOc,CAAK,CAAC,EAAGoJ,KAAM,IAC7C,CAAEA,KAAM,KAEd,GACXvK,EAEDkK,KAAA,UAAAA,CACI,OAAO,KAAK7J,OAAM,GACrBL,EAEDK,OAAA,UAAAA,CACI,KAAKhB,MAAMqC,eAAc,EACzB,IAAMyI,EAAO,KACTmD,EAAY,EACVC,EAAmBzL,MAAMgL,KAAK,KAAKxE,MAAMjI,OAAM,CAAE,EACvD,OAAO+J,GAAgB,CACnBC,KAAI,UAAAA,CACA,OAAOiD,EAAYC,EAAiBjN,OAC9B,CAAE3B,MAAOwL,EAAKjK,cAAcqN,EAAiBD,GAAW,CAAC,EAAG/C,KAAM,IAClE,CAAEA,KAAM,KAEd,GACXvK,EAEDiF,QAAA,SAAQ8F,EAAwD,YAC5D,OAAIyC,GAAgBzC,CAAK,IACrBA,EAAQ,IAAIoC,IAAIpC,CAAK,GAGzBrB,GAAY,UAAA,CACJ5H,MAAMsJ,QAAQL,CAAK,GACnBI,EAAKnG,MAAK,EACV+F,EAAML,QAAQ,SAAA/L,EAAK,CAAA,OAAIwM,EAAKkC,IAAI1O,CAAK,KAC9B8O,GAAS1C,CAAK,GACrBI,EAAKnG,MAAK,EACV+F,EAAML,QAAQ,SAAA/L,EAAK,CAAA,OAAIwM,EAAKkC,IAAI1O,CAAK,KAC9BoM,GAAU,MACjBhM,GAAI,8BAAgCgM,CAAK,EAEhD,EAEM,MACV/K,EACDW,SAAA,SAASC,EAA+CC,EAAyB,CAE7E,OAAeA,IAAoB,IAC/B9B,GAAI,0EAA0E,EAE3E0C,GAAiB,KAAMb,CAAQ,GACzCZ,EAEDQ,WAAA,SAAWC,EAAwC,CAC/C,OAAOC,GAAoB,KAAMD,CAAO,GAC3CT,EAEDkF,OAAA,UAAAA,CACI,OAAOpD,MAAMgL,KAAK,IAAI,GACzB9M,EAED6M,SAAA,UAAAA,CACI,MAAO,0BACV7M,EAAA8H,EAAA,EAED,UAAA,CACI,OAAO,KAAKzH,OAAM,GACrB0M,GAAAG,EAAA,CAAA,CAAApE,IAAA,OAAA/K,IA5KD,UAAAA,CACI,YAAKsB,MAAMqC,eAAc,EAClB,KAAK4G,MAAMkE,QACrB1D,IAAAb,GAAAlK,IA2KD,UAAAA,CACI,MAAO,UACVmP,CAAA,EAAA,EAIMM,GAAkBjG,GAA0B,gBAAiB2F,EAAa,EClP/EQ,GAAkBC,OAAOC,OAAO,IAAI,EAoCpCC,GAAS,SAEFC,GAA8B,UAAA,CAWvC,SAAAA,EACWC,EACAzO,EACA2B,EAEA+M,EAAAA,CAHA1O,IAAAA,SAAAA,EAAU,IAAIoJ,KAGdsF,IAAAA,SAAAA,EAAiCC,IAAc,KAJ/CF,QAAAA,YACAzO,QAAAA,YACA2B,MAAAA,YAEA+M,mBAAAA,YAbXxF,UAAS,OAAA,KACThJ,iBAAgB,OAAA,KAChBD,cAAa,OAAA,KACbI,OAAM,OAAA,KACNuO,eAAc,OAAA,KACdC,oBAAmB,OAAA,KACXC,aAAY,OAGT,KAAA,QAAAL,EACA,KAAA,QAAAzO,EACA,KAAA,MAAA2B,EAEA,KAAA,mBAAA+M,EAEP,KAAKxF,UAAY,IAAI3I,GAAkB,KAAKoB,MAAK,OAAiC,EAElF,KAAKiN,eAAiBjD,GAAc,KAAK8C,OAAO,EAChCM,GAAa,KAAKL,kBAAkB,GAChDjP,GAAG,4CAAA,EAIH,KAAKoP,oBAAsB,CAAA,EAElC,IAAAnO,EAAA8N,EAAA7N,UAAAD,OAAAA,EAEDsO,wBAAA,SAAwBxF,EAAgB,CACpC,OAAO,KAAKxJ,QAAQvB,IAAI+K,CAAG,EAAG/K,IAAG,GACpCiC,EAEDuO,wBAAA,SAAwBzF,EAAkBnF,EAAQ,CAC9C,IAAMkG,EAAa,KAAKvK,QAAQvB,IAAI+K,CAAG,EACvC,GAAIe,aAAsB2E,GACtB3E,OAAAA,EAAWnL,IAAIiF,CAAQ,EAChB,GAIX,GAAIf,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD5B,KAAMtD,GACNmD,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B9P,KAAM6K,EACNnF,SAAAA,EACH,EACD,GAAI,CAACd,EACD,OAAO,KAEXc,EAAYd,EAAec,SAK/B,GAHAA,EAAYkG,EAAmBC,iBAAiBnG,CAAQ,EAGpDA,IAAaqC,EAAY+D,UAAW,CACpC,IAAMhG,EAASC,GAAa,IAAI,EAC1BH,EAAuBC,GAAY,EACnCjB,EACFkB,GAAUF,EACJ,CACI3C,KAAMtD,GACNkD,eAAgB,SAChBE,gBAAiB,KAAKC,MACtBF,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5BnK,SAAWiG,EAAmBJ,OAC9BxL,KAAM6K,EACNnF,SAAAA,GAEJ,KAEKE,GACXI,GAAepB,CAAO,EAExBgH,EAAoCD,aAAajG,CAAQ,EACvDI,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,EAGpB,MAAO,IACVpE,EAED1B,KAAA,SAAKwK,EAAgB,CACjB,OAAI9C,EAAYC,oBAAsB,CAACzH,GAAQ,KAAKuP,QAASjF,CAAG,GAE5D,KAAKD,KAAKC,CAAG,EAEV,KAAKiF,QAAQjF,CAAG,GAG3B9I,EAOAnB,KAAA,SAAKiK,EAAkBnK,EAAY8P,EAAAA,CAE/B,OAF+BA,IAAAA,SAAAA,EAAqB,IAEhDjQ,GAAQ,KAAKuP,QAASjF,CAAG,EAErB,KAAKxJ,QAAQyJ,IAAID,CAAG,EAEb,KAAKyF,wBAAwBzF,EAAKnK,CAAK,EACvC8P,EAEAC,QAAQhQ,IAAI,KAAKqP,QAASjF,EAAKnK,CAAK,GAG3C,KAAKoP,QAAQjF,CAAG,EAAInK,EACb,IAIJ,KAAKgQ,QACR7F,EACA,CAAEnK,MAAAA,EAAOiQ,WAAY,GAAMC,SAAU,GAAMC,aAAc,IACzD,KAAKd,mBACLS,CAAS,GAKrBzO,EACA6I,KAAA,SAAKC,EAAgB,CACjB,GAAI,CAAC9C,EAAYC,mBAEb,OAAO6C,KAAO,KAAKiF,QAEvB,KAAKK,eAAL,KAAKA,aAAiB,IAAI1F,KAC1B,IAAIM,EAAQ,KAAKoF,aAAarQ,IAAI+K,CAAG,EACrC,OAAKE,IACDA,EAAQ,IAAIE,GACRJ,KAAO,KAAKiF,QACZ5E,GACa,KAAKlI,MAAK,IAAImI,GAAaN,CAAG,EAAC,IAC5C,EAAK,EAET,KAAKsF,aAAa1P,IAAIoK,EAAKE,CAAK,GAE7BA,EAAMjL,IAAG,GAGpBiC,EAIA+O,MAAA,SAAMjG,EAAkBkG,EAAgC,CAIpD,GAHIA,IAAe,KACfA,EAAa,KAAKhB,oBAElBgB,IAAe,GAInB,IADAC,GAAgB,KAAMD,EAAYlG,CAAG,EACjC,EAAEA,KAAO,KAAKiF,SAAU,CAAA,IAAAmB,EAMxB,IAAAA,EAAI,KAAKnB,QAAQoB,EAAuB,IAAC,MAArCD,EAAwCpG,CAAG,EAC3C,OAEA/J,GAAI,EAAGiQ,EAAWI,gBAAoB,KAAKnO,MAAK,IAAI6H,EAAI+D,SAAQ,CAAE,EAI1E,QADIwC,EAAS,KAAKtB,QACXsB,GAAUA,IAAWC,IAAiB,CACzC,IAAMC,EAAaC,GAAcH,EAAQvG,CAAG,EAC5C,GAAIyG,EAAY,CACZ,IAAME,EAAUT,EAAWD,MAAM,KAAMjG,EAAKyG,EAAYF,CAAM,EAC9D,GAAII,IAAO,EACP,OAEJ,GAAIA,IAAO,EACP,MAGRJ,EAAS1B,OAAO+B,eAAeL,CAAM,EAEzCM,GAAwB,KAAMX,EAAYlG,CAAG,IAGjD9I,EAOA2O,QAAA,SACI7F,EACAyG,EACAP,EACAP,EAAAA,CAKA,GALAA,IAAAA,SAAAA,EAAqB,IAEjBO,IAAe,KACfA,EAAa,KAAKhB,oBAElBgB,IAAe,GACf,OAAO,KAAKY,gBAAgB9G,EAAKyG,EAAYd,CAAS,EAE1DQ,GAAgB,KAAMD,EAAYlG,CAAG,EACrC,IAAM2G,EAAUT,EAAWL,QAAQ,KAAM7F,EAAKyG,EAAYd,CAAS,EACnE,OAAIgB,GACAE,GAAwB,KAAMX,EAAYlG,CAAG,EAE1C2G,GAGXzP,EAMA4P,gBAAA,SACI9G,EACAyG,EACAd,EAAAA,CAAAA,IAAAA,SAAAA,EAAqB,IAErBnM,GAAoC,KAAKkG,SAAS,EAClD,GAAI,CACAqH,GAAU,EAGV,IAAMC,EAAgB,KAAKC,QAAQjH,CAAG,EACtC,GAAI,CAACgH,EAED,OAAOA,EAIX,GAAIlN,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD/B,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B9P,KAAM6K,EACN5H,KAAM0G,GACNjE,SAAU4L,EAAW5Q,MACxB,EACD,GAAI,CAACkE,EACD,OAAO,KAEX,IAAQc,EAAad,EAAbc,SACJ4L,EAAW5Q,QAAUgF,IACrB4L,EAAUS,GAAA,CAAA,EACHT,EAAU,CACb5Q,MAAOgF,KAMnB,GAAI8K,GACA,GAAI,CAACC,QAAQuB,eAAe,KAAKlC,QAASjF,EAAKyG,CAAU,EACrD,MAAO,QAGXU,GAAe,KAAKlC,QAASjF,EAAKyG,CAAU,EAIhD,KAAKW,wBAAwBpH,EAAKyG,EAAW5Q,KAAK,UAElDwR,GAAQ,EAEZ,MAAO,IAGXnQ,EACAoQ,0BAAA,SACItH,EACAnK,EACAM,EACAwP,EAAAA,CAAAA,IAAAA,SAAAA,EAAqB,IAErBnM,GAAoC,KAAKkG,SAAS,EAClD,GAAI,CACAqH,GAAU,EAGV,IAAMC,EAAgB,KAAKC,QAAQjH,CAAG,EACtC,GAAI,CAACgH,EAED,OAAOA,EAIX,GAAIlN,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD/B,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B9P,KAAM6K,EACN5H,KAAM0G,GACNjE,SAAUhF,EACb,EACD,GAAI,CAACkE,EACD,OAAO,KAEXlE,EAASkE,EAAec,SAG5B,IAAM0M,EAAmBC,GAAkCxH,CAAG,EACxDyG,EAAa,CACfT,aAAc9I,EAAYuK,gBAAkB,KAAKrC,eAAiB,GAClEU,WAAY,GACZ7Q,IAAKsS,EAAiBtS,IACtBW,IAAK2R,EAAiB3R,KAI1B,GAAI+P,GACA,GAAI,CAACC,QAAQuB,eAAe,KAAKlC,QAASjF,EAAKyG,CAAU,EACrD,MAAO,QAGXU,GAAe,KAAKlC,QAASjF,EAAKyG,CAAU,EAGhD,IAAM1F,EAAa,IAAIX,GACnBvK,EACAM,EACa,KAAKgC,MAAK,IAAI6H,EAAI+D,SAAQ,EACvC,EAAK,EAGT,KAAKvN,QAAQZ,IAAIoK,EAAKe,CAAU,EAGhC,KAAKqG,wBAAwBpH,EAAKe,EAAWJ,MAAM,UAEnD0G,GAAQ,EAEZ,MAAO,IAGXnQ,EACAwQ,wBAAA,SACI1H,EACA2H,EACAhC,EAAAA,CAAAA,IAAAA,SAAAA,EAAqB,IAErBnM,GAAoC,KAAKkG,SAAS,EAClD,GAAI,CACAqH,GAAU,EAGV,IAAMC,EAAgB,KAAKC,QAAQjH,CAAG,EACtC,GAAI,CAACgH,EAED,OAAOA,EAIX,GAAIlN,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD/B,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B9P,KAAM6K,EACN5H,KAAM0G,GACNjE,SAAUxD,OACb,EACD,GAAI,CAAC0C,EACD,OAAO,KAGf4N,EAAQxS,OAARwS,EAAQxS,KAAsB,KAAKgD,MAAK,IAAI6H,EAAI+D,SAAQ,GACxD4D,EAAQC,QAAU,KAAK/Q,QAAU,KAAKoO,QACtC,IAAMsC,EAAmBC,GAAkCxH,CAAG,EACxDyG,EAAa,CACfT,aAAc9I,EAAYuK,gBAAkB,KAAKrC,eAAiB,GAClEU,WAAY,GACZ7Q,IAAKsS,EAAiBtS,IACtBW,IAAK2R,EAAiB3R,KAI1B,GAAI+P,GACA,GAAI,CAACC,QAAQuB,eAAe,KAAKlC,QAASjF,EAAKyG,CAAU,EACrD,MAAO,QAGXU,GAAe,KAAKlC,QAASjF,EAAKyG,CAAU,EAGhD,KAAKjQ,QAAQZ,IAAIoK,EAAK,IAAI0F,GAAciC,CAAO,CAAC,EAGhD,KAAKP,wBAAwBpH,EAAK3I,MAAS,UAE3CgQ,GAAQ,EAEZ,MAAO,IAGXnQ,EAMA+P,QAAA,SAAQjH,EAAkB2F,EAAAA,CAGtB,GAHsBA,IAAAA,SAAAA,EAAqB,IAC3CnM,GAAoC,KAAKkG,SAAS,EAE9C,CAAChK,GAAQ,KAAKuP,QAASjF,CAAG,EAC1B,MAAO,GAIX,GAAIlG,GAAgB,IAAI,EAAG,CACvB,IAAMC,EAASC,GAAmC,KAAM,CACpD/B,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B9P,KAAM6K,EACN5H,KAAM2M,GACT,EAED,GAAI,CAAChL,EACD,OAAO,KAKf,GAAI,CAAA,IAAA8N,EAAAC,EACAf,GAAU,EACV,IAAM9L,EAASC,GAAa,IAAI,EAC1BH,EAAuBC,GAAY,EACnC+F,EAAa,KAAKvK,QAAQvB,IAAI+K,CAAG,EAEnCnK,EAAQwB,OAEZ,GAAI,CAAC0J,IAAe9F,GAAUF,GAAY,CAAA,IAAAgN,EACtClS,GAAKkS,EAAGrB,GAAc,KAAKzB,QAASjF,CAAG,IAAC,KAAA,OAAhC+H,EAAkClS,MAG9C,GAAI8P,GACA,GAAI,CAACC,QAAQoC,eAAe,KAAK/C,QAASjF,CAAG,EACzC,MAAO,QAGX,OAAO,KAAKiF,QAAQjF,CAAG,EAwB3B,GApBI,OAAO,KAAKqF,oBAAqBrF,CAAG,EAGpCe,IACA,KAAKvK,QAAO,OAAQwJ,CAAG,EAEnBe,aAAsBX,KACtBvK,EAAQkL,EAAWJ,QAGvBsH,GAAiBlH,CAAU,GAG/B,KAAKrB,UAAUtE,cAAa,GAI5ByM,EAAA,KAAKvC,eAAY,OAAAwC,EAAjBD,EAAmB5S,IAAI+K,CAAG,IAAC,MAA3B8H,EAA6BlS,IAAIoK,KAAO,KAAKiF,OAAO,EAGhDhK,GAAUF,EAAW,CACrB,IAAMhB,EAA2B,CAC7B3B,KAAM2M,GACN/M,eAAgB,SAChBC,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B/M,gBAAiB,KAAKC,MACtB2C,SAAUjF,EACVV,KAAM6K,GAEKjF,GACXI,GAAepB,CAAO,EAEtBkB,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,WAIpB+L,GAAQ,EAEZ,MAAO,IAGXnQ,EAKAW,SAAA,SAASmG,EAA+CjG,EAAyB,CAC7E,OAAeA,IAAoB,IAC/B9B,GAAI,iFAAiF,EAElF0C,GAAiB,KAAMqF,CAAQ,GACzC9G,EAEDQ,WAAA,SAAWC,EAAO,CACd,OAAOC,GAAoB,KAAMD,CAAO,GAC3CT,EAEDkQ,wBAAA,SAAwBpH,EAAkBnK,EAAU,SAC1CoF,EAASC,GAAa,IAAI,EAC1BH,EAAuBC,GAAY,EACzC,GAAIC,GAAUF,EAAW,CACrB,IAAMhB,EACFkB,GAAUF,EACH,CACG3C,KAAM0G,GACN9G,eAAgB,SAChBE,gBAAiB,KAAKC,MACtBF,OAAQ,KAAKpB,QAAU,KAAKoO,QAC5B9P,KAAM6K,EACNnF,SAAUhF,GAEd,KAEKkF,GACXI,GAAepB,CAAO,EAEtBkB,GACAI,GAAgB,KAAMtB,CAAM,EAEjBgB,GACXO,GAAY,GAIpB4M,EAAA,KAAK5C,eAAY,OAAA6C,EAAjBD,EAAmBjT,IAAI+K,CAAG,IAAC,MAA3BmI,EAA6BvS,IAAI,EAAI,EAGrC,KAAK8J,UAAUtE,cAAa,GAC/BlE,EAEDkR,SAAA,UAAAA,CACI,YAAK1I,UAAU9G,eAAc,EACtByP,GAAQ,KAAKpD,OAAO,GAC9B/N,EAEDoR,MAAA,UAAAA,CAOI,YAAK5I,UAAU9G,eAAc,EACtBiM,OAAOzD,KAAK,KAAK6D,OAAO,GAClCD,CAAA,EAAA,EAOL,SAAgBuD,GACZrT,EACAyS,EAAiC,OAMjC,GAJeA,GAAWa,GAAmBtT,CAAM,GAC/Ce,GAAG,2DAAA,EAGHP,GAAQR,EAAQG,EAAK,EACrB,OAAiBoT,GAAkBvT,CAAM,YAAa8P,IAClD/O,GACI,mBAAmByS,GAAaxT,CAAM,EAAC;;qCAEK,EAG7CA,EAGK2P,OAAO8D,aAAazT,CAAM,GACtCe,GAAI,oEAAoE,EAG5E,IAAMd,GAAIyT,EACNjB,GAASxS,OAAI,KAAAyT,GAGHzG,GAAcjN,CAAM,EAAI,mBAAqBA,EAAOuN,YAAYtN,MACpE,IAAImB,GAAS,EAGjBlB,EAAM,IAAI4P,GACZ9P,EACA,IAAI0K,IACJiJ,OAAO1T,CAAI,EACX2T,GAAyBnB,CAAO,CAAC,EAGrCoB,OAAAA,GAAc7T,EAAQG,GAAOD,CAAG,EAEzBF,CACX,CAEA,IAAM8T,GAAmCvK,GACrC,iCACAuG,EAA8B,EAGlC,SAASwC,GAAkCxH,EAAG,CAC1C,OACI4E,GAAgB5E,CAAG,IAClB4E,GAAgB5E,CAAG,EAAI,CACpB/K,IAAG,UAAAA,CACC,OAAO,KAAKI,EAAK,EAAEmQ,wBAAwBxF,CAAG,GAElDpK,IAAG,SAACC,EAAK,CACL,OAAO,KAAKR,EAAK,EAAEoQ,wBAAwBzF,EAAKnK,CAAK,IAIrE,CAEA,SAAgB2S,GAAmB7J,EAAU,CACzC,OAAIC,GAASD,CAAK,EACPqK,GAAkCrK,EAActJ,EAAK,CAAC,EAE1D,EACX,CAEA,SAAgBwR,GACZzR,EACA8Q,EACAlG,EAAgB,OAGZ5K,EAAIiQ,oBAAqBrF,CAAG,EAAIkG,GAGpC+C,EAAO7T,EAAI6P,QAAQoB,EAAuB,IAAC,MAA3C,OAAO4C,EAAuCjJ,CAAG,CACrD,CAEA,SAASmG,GACL/Q,EACA8Q,EACAlG,EAAgB,CAuChB,GApCgBuF,GAAaW,CAAU,GACnCjQ,GAAG,oBAAqBb,EAAI+C,MAAK,IAAI6H,EAAI+D,SAAQ,EAAE,wBAAA,EAmCxC,CAACmF,GAAWhD,CAAU,GAAKxQ,GAAQN,EAAIiQ,oBAAsBrF,CAAG,EAAG,CAC9E,IAAMmJ,EAAe/T,EAAI+C,MAAK,IAAI6H,EAAI+D,SAAQ,EACxCqF,EAAwBhU,EAAIiQ,oBAAqBrF,CAAG,EAAEsG,gBACtD+C,EAA0BnD,EAAWI,gBAC3CrQ,GACI,iBAAiBoT,EAAuB,SAASF,EAAS,MAAA;uCACZC,EAAqB,MAAI;;8DAEF,EAGjF,CClwBA,IAAME,GAAUC,GAA2B,CAAC,EAEtCC,GAAuC,UAAA,CACzC,IAAIvP,EAAI,GACFwP,EAAI,CAAA,EACV5E,cAAOsC,eAAesC,EAAG,IAAK,CAC1B7T,IAAK,UAAAA,CACDqE,EAAI,IAEX,EACD4K,OAAOC,OAAO2E,CAAC,EAAE,CAAG,EAAI,EACjBxP,IAAM,EACjB,EAAC,EAOGyP,GAA+B,EAG7BC,GAAS,UAAAA,CAAAA,EACf,SAASC,GAAQC,EAAMC,EAAK,CACpBjF,OAAOkF,eACPlF,OAAOkF,eAAeF,EAAK1S,UAAW2S,CAAK,EACpCD,EAAK1S,UAAU6S,YAAc3S,OACpCwS,EAAK1S,UAAU6S,UAAYF,EAE3BD,EAAK1S,UAAY2S,CAEzB,CACAF,GAAQD,GAAW3Q,MAAM7B,SAAS,EAMlC,IAAa8S,GAAyB,SAAAC,EAAA/K,EAAAH,EAAA,CAAAmL,GAAAF,EAAAC,CAAA,EAClC,SAAAD,EACItO,EACAxF,EACAhB,EACAyG,EAAK,cADLzG,IAAI,SAAJA,EAAiB,mBAAqBmB,GAAS,GAC/CsF,IAAK,SAALA,EAAQ,IAER1B,EAAAgQ,EAAA/L,KAAA,IAAA,GAAO,KACPrC,GAAe,UAAA,CACX,IAAM1G,EAAM,IAAIc,GAA8Bf,EAAMgB,EAAUyF,EAAO,EAAI,EACzExG,EAAIyB,OAAMuT,GAAAlQ,CAAA,EACV6B,GAAkBqO,GAAAlQ,CAAA,EAAO7E,GAAOD,CAAG,EAE/BuG,GAAiBA,EAAcnE,QAE/B0C,EAAKqC,gBAAgB,EAAG,EAAGZ,CAAa,EAGxC6N,IAGA3E,OAAOsC,eAAciD,GAAAlQ,CAAA,EAAO,IAAKoP,EAAO,EAE/C,EAACpP,EACL,IAAAhD,EAAA+S,EAAA9S,UAAAD,OAAAA,EAEDwD,OAAA,UAAAA,CACM,KAAKrF,EAAK,EAAoCkB,MAAMqC,eAAc,EAAE,QAAAyD,EAAA1C,UAAAnC,OADhE6S,EAAa,IAAArR,MAAAqD,CAAA,EAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAb+N,EAAa/N,CAAA,EAAA3C,UAAA2C,CAAA,EAEnB,OAAOtD,MAAM7B,UAAUuD,OAAOD,MACzB,KAAalC,MAAK,EAEnB8R,EAAO5S,IAAI,SAAA6S,EAAC,CAAA,OAAK5L,GAAkB4L,CAAC,EAAIA,EAAE/R,MAAK,EAAK+R,EAAE,CAAC,GAE9DpT,EAAA8H,CAAA,EAcD,UAAA,CACI,IAAMqC,EAAO,KACTmD,EAAY,EAChB,OAAOlD,GAAa,CAChBC,KAAI,UAAAA,CACA,OAAOiD,EAAYnD,EAAK7J,OAClB,CAAE3B,MAAOwL,EAAKmD,GAAW,EAAG/C,KAAM,IAClC,CAAEA,KAAM,GAAM5L,MAAOwB,SAElC,GACJ4M,GAAAgG,EAAA,CAAA,CAAAjK,IAAA,SAAA/K,IAtBD,UAAAA,CACI,OAAQ,KAAKI,EAAK,EAAoCC,gBAAe,GACxEM,IAED,SAAWiD,EAAiB,CACtB,KAAKxD,EAAK,EAAoCS,gBAAgB+C,CAAS,KAC5EmH,IAAAb,EAAAlK,IAED,UAAAA,CACI,MAAO,YACVgV,CAAA,EA7CyCN,GA2CrC1K,OAAOG,YAIXH,OAAOC,QAAQ,EAapB2F,OAAOnD,QAAQ/L,EAAe,EAAEiM,QAAQ,SAAAW,EAAA,KAAEgI,EAAIhI,EAAA,CAAA,EAAEiI,EAAEjI,EAAA,CAAA,EAC1CgI,IAAS,UACTxB,GAAckB,GAAsB9S,UAAWoT,EAAMC,CAAE,CAE/D,CAAC,EAED,SAASjB,GAA2BlR,EAAa,CAC7C,MAAO,CACHyN,WAAY,GACZE,aAAc,GACd/Q,IAAK,UAAAA,CACD,OAAO,KAAKI,EAAK,EAAEG,KAAK6C,CAAK,GAEjCzC,IAAK,SAAUC,EAAK,CAChB,KAAKR,EAAK,EAAEU,KAAKsC,EAAOxC,CAAK,GAGzC,CAEA,SAAS4U,GAAsBpS,EAAa,CACxC8O,GAAe8C,GAAsB9S,UAAW,GAAKkB,EAAOkR,GAA2BlR,CAAK,CAAC,CACjG,CAEA,SAAgBiB,GAAmBI,EAAW,CAC1C,GAAIA,EAAMgQ,GAA8B,CACpC,QAASrR,EAAQqR,GAA8BrR,EAAQqB,EAAM,IAAKrB,IAC9DoS,GAAsBpS,CAAK,EAE/BqR,GAA+BhQ,EAEvC,CAEAJ,GAAmB,GAAI,EAEvB,SAAgBoR,GACZ/O,EACAxF,EACAhB,EAAa,CAEb,OAAO,IAAI8U,GAAsBtO,EAAexF,EAAUhB,CAAI,CAClE,UCrIgBwV,GAAQhM,EAAYiM,EAAsB,CACtD,GAAI,OAAOjM,GAAU,UAAYA,IAAU,KAAM,CAC7C,GAAID,GAAkBC,CAAK,EACvB,OAAIiM,IAAavT,QACbpB,GAAI,EAAE,EAEF0I,EAActJ,EAAK,EAAEkB,MAEjC,GAAImO,GAAgB/F,CAAK,EACrB,OAAOA,EAAMpI,MAEjB,GAAI2L,GAAgBvD,CAAK,EAAG,CACxB,GAAIiM,IAAavT,OACb,OAAOsH,EAAMe,UAEjB,IAAMqB,EAAapC,EAAMa,MAAMvK,IAAI2V,CAAQ,GAAKjM,EAAMc,QAAQxK,IAAI2V,CAAQ,EAC1E,OAAK7J,GACD9K,GAAI,GAAI2U,EAAUlC,GAAa/J,CAAK,CAAC,EAElCoC,EAKX,GAAIyH,GAAmB7J,CAAK,EAAG,CAC3B,GAAI,CAACiM,EACD,OAAO3U,GAAI,EAAE,EAEjB,IAAM8K,EAAcpC,EAActJ,EAAK,EAAEmB,QAAQvB,IAAI2V,CAAQ,EAC7D,OAAK7J,GACD9K,GAAI,GAAI2U,EAAUlC,GAAa/J,CAAK,CAAC,EAElCoC,EAEX,GAAI8J,GAAOlM,CAAK,GAAKmM,GAAgBnM,CAAK,GAAKoM,GAAWpM,CAAK,EAC3D,OAAOA,UAEJgB,GAAWhB,CAAK,GACnBoM,GAAWpM,EAAMtJ,EAAK,CAAC,EAEvB,OAAOsJ,EAAMtJ,EAAK,EAG1BY,GAAI,EAAE,CACV,CAEA,SAAgBwS,GAAkB9J,EAAYiM,EAAiB,CAI3D,GAHKjM,GACD1I,GAAI,EAAE,EAEN2U,IAAavT,OACb,OAAOoR,GAAkBkC,GAAQhM,EAAOiM,CAAQ,CAAC,EAKrD,GAHIC,GAAOlM,CAAK,GAAKmM,GAAgBnM,CAAK,GAAKoM,GAAWpM,CAAK,GAG3DuD,GAAgBvD,CAAK,GAAK+F,GAAgB/F,CAAK,EAC/C,OAAOA,EAEX,GAAIA,EAAMtJ,EAAK,EACX,OAAOsJ,EAAMtJ,EAAK,EAEtBY,GAAI,GAAI0I,CAAK,CACjB,CAEA,SAAgB+J,GAAa/J,EAAYiM,EAAiB,CACtD,IAAII,EACJ,GAAIJ,IAAavT,OACb2T,EAAQL,GAAQhM,EAAOiM,CAAQ,UACxBK,GAAStM,CAAK,EACrB,OAAOA,EAAMxJ,KACNqT,GAAmB7J,CAAK,GAAKuD,GAAgBvD,CAAK,GAAK+F,GAAgB/F,CAAK,EACnFqM,EAAQvC,GAAkB9J,CAAK,EAG/BqM,EAAQL,GAAQhM,CAAK,EAEzB,OAAOqM,EAAM7S,KACjB,CAQA,SAAgB2D,GAAkBoP,EAAW,CACzC,IAAMC,EAAaC,GAAc,EAC3BC,EAAoBC,GAAuB,EAAI,EACrDvE,GAAU,EACV,GAAI,CACA,OAAOmE,EAAE,UAET7D,GAAQ,EACRkE,GAAqBF,CAAiB,EACtCG,GAAaL,CAAU,EAE/B,CC1GA,IAAMpH,GAAWyC,GAAgBzC,SAEjC,SAAgB0H,GAAUnB,EAAQoB,EAAQC,EAAAA,QAAAA,IAAAA,SAAAA,EAAgB,IAC/CC,GAAGtB,EAAGoB,EAAGC,CAAK,CACzB,CAIA,SAASC,GAAGtB,EAAQoB,EAAQC,EAAeE,EAAgBC,EAAc,CAGrE,GAAIxB,IAAMoB,EACN,OAAOpB,IAAM,GAAK,EAAIA,IAAM,EAAIoB,EAGpC,GAAIpB,GAAK,MAAQoB,GAAK,KAClB,MAAO,GAGX,GAAIpB,IAAMA,EACN,OAAOoB,IAAMA,EAGjB,IAAMtT,EAAO,OAAOkS,EACpB,GAAIlS,IAAS,YAAcA,IAAS,UAAY,OAAOsT,GAAK,SACxD,MAAO,GAIX,IAAMK,EAAYhI,GAAS5F,KAAKmM,CAAC,EACjC,GAAIyB,IAAchI,GAAS5F,KAAKuN,CAAC,EAC7B,MAAO,GAEX,OAAQK,EAAS,CAEb,IAAK,kBAEL,IAAK,kBAGD,MAAO,GAAKzB,GAAM,GAAKoB,EAC3B,IAAK,kBAGD,MAAI,CAACpB,GAAM,CAACA,EACD,CAACoB,GAAM,CAACA,EAGZ,CAACpB,GAAM,EAAI,EAAI,CAACA,IAAM,EAAIoB,EAAI,CAACpB,GAAM,CAACoB,EACjD,IAAK,gBACL,IAAK,mBAID,MAAO,CAACpB,GAAM,CAACoB,EACnB,IAAK,kBACD,OACI,OAAOzM,OAAW,KAAeA,OAAO+M,QAAQ7N,KAAKmM,CAAC,IAAMrL,OAAO+M,QAAQ7N,KAAKuN,CAAC,EAEzF,IAAK,eACL,IAAK,eAGGC,GAAS,GACTA,IAEJ,MAGRrB,EAAI2B,GAAO3B,CAAC,EACZoB,EAAIO,GAAOP,CAAC,EAEZ,IAAMQ,EAAYH,IAAc,iBAChC,GAAI,CAACG,EAAW,CACZ,GAAI,OAAO5B,GAAK,UAAY,OAAOoB,GAAK,SACpC,MAAO,GAKX,IAAMS,EAAQ7B,EAAE7H,YACZ2J,EAAQV,EAAEjJ,YACd,GACI0J,IAAUC,GACV,EACIzM,GAAWwM,CAAK,GAChBA,aAAiBA,GACjBxM,GAAWyM,CAAK,GAChBA,aAAiBA,IAErB,gBAAiB9B,GACjB,gBAAiBoB,EAEjB,MAAO,GAIf,GAAIC,IAAU,EACV,MAAO,GACAA,EAAQ,IACfA,EAAQ,IAQZE,EAASA,GAAU,CAAA,EACnBC,EAASA,GAAU,CAAA,EAEnB,QADItU,EAASqU,EAAOrU,OACbA,KAGH,GAAIqU,EAAOrU,CAAM,IAAM8S,EACnB,OAAOwB,EAAOtU,CAAM,IAAMkU,EASlC,GAJAG,EAAOrP,KAAK8N,CAAC,EACbwB,EAAOtP,KAAKkP,CAAC,EAGTQ,EAAW,CAGX,GADA1U,EAAS8S,EAAE9S,OACPA,IAAWkU,EAAElU,OACb,MAAO,GAGX,KAAOA,KACH,GAAI,CAACoU,GAAGtB,EAAE9S,CAAM,EAAGkU,EAAElU,CAAM,EAAGmU,EAAQ,EAAGE,EAAQC,CAAM,EACnD,MAAO,OAGZ,CAEH,IAAM1K,EAAOyD,OAAOzD,KAAKkJ,CAAC,EACtBtK,EAGJ,GAFAxI,EAAS4J,EAAK5J,OAEVqN,OAAOzD,KAAKsK,CAAC,EAAElU,SAAWA,EAC1B,MAAO,GAEX,KAAOA,KAGH,GADAwI,EAAMoB,EAAK5J,CAAM,EACb,EAAE9B,GAAQgW,EAAG1L,CAAG,GAAK4L,GAAGtB,EAAEtK,CAAG,EAAG0L,EAAE1L,CAAG,EAAG2L,EAAQ,EAAGE,EAAQC,CAAM,GACjE,MAAO,GAKnBD,OAAAA,EAAOjP,IAAG,EACVkP,EAAOlP,IAAG,EACH,EACX,CAEA,SAASqP,GAAO3B,EAAM,CAClB,OAAI5L,GAAkB4L,CAAC,EACZA,EAAE/R,MAAK,EAEdiK,GAAS8H,CAAC,GAAKpI,GAAgBoI,CAAC,GAGhC3F,GAAS2F,CAAC,GAAK5F,GAAgB4F,CAAC,EACzBtR,MAAMgL,KAAKsG,EAAE5I,QAAO,CAAE,EAE1B4I,CACX,UCtLgBhJ,GAAgBpC,EAAqB,CACjDA,OAAAA,EAASD,OAAOC,QAAQ,EAAImN,GACrBnN,CACX,CAEA,SAASmN,IAAOA,CACZ,OAAO,IACX,UC8BgB9G,GAAa5G,EAAU,CACnC,OAEIA,aAAiBkG,QACjB,OAAOlG,EAAM2H,iBAAoB,UACjC3G,GAAWhB,EAAMsH,KAAK,GACtBtG,GAAWhB,EAAMkH,OAAO,CAEhC,CC1BC,CAAC,SAAU,MAAO,KAAK,EAAEjE,QAAQ,SAAA0K,EAAC,CAC/B,IAAIC,EAAIC,GAAS,EACb,OAAOD,EAAED,CAAC,EAAM,KAChBrW,GAAG,yBAA0BqW,EAAC,iCAAA,CAEtC,CAAC,EA0HG,OAAOG,+BAAkC,UAEzCA,8BAA8BC,WAAW,CACrCC,IAAAA,GACAC,OAAQ,CACJlE,aAAAA,IAEJrT,MAAAA,GACH,EC1JL,IAAIwX,GAAW,OAAO,OAClBC,GAAY,OAAO,eACnBC,GAAmB,OAAO,yBAC1BC,GAAoB,OAAO,oBAC3BC,GAAe,OAAO,eACtBC,GAAe,OAAO,UAAU,eAChCC,GAAa,CAACC,EAAIC,IAAQ,UAAqB,CACjD,OAAOA,MAAWD,EAAGJ,GAAkBI,CAAE,EAAE,CAAC,CAAC,IAAIC,EAAM,CAAE,QAAS,CAAC,CAAE,GAAG,QAASA,CAAG,EAAGA,EAAI,OAC7F,EACIC,GAAW,CAACC,EAAQC,IAAQ,CAC9B,QAASC,KAAQD,EACfV,GAAUS,EAAQE,EAAM,CAAE,IAAKD,EAAIC,CAAI,EAAG,WAAY,EAAK,CAAC,CAChE,EACIC,GAAc,CAACC,EAAIC,EAAMC,EAAQC,IAAS,CAC5C,GAAIF,GAAQ,OAAOA,GAAS,UAAY,OAAOA,GAAS,WACtD,QAASG,KAAOf,GAAkBY,CAAI,EAChC,CAACV,GAAa,KAAKS,EAAII,CAAG,GAAKA,IAAQF,GACzCf,GAAUa,EAAII,EAAK,CAAE,IAAK,IAAMH,EAAKG,CAAG,EAAG,WAAY,EAAED,EAAOf,GAAiBa,EAAMG,CAAG,IAAMD,EAAK,UAAW,CAAC,EAEvH,OAAOH,CACT,EACIK,GAAU,CAACX,EAAKY,EAAYV,KAAYA,EAASF,GAAO,KAAOR,GAASI,GAAaI,CAAG,CAAC,EAAI,CAAC,EAAGK,GAKnGO,GAAc,CAACZ,GAAO,CAACA,EAAI,WAAaP,GAAUS,EAAQ,UAAW,CAAE,MAAOF,EAAK,WAAY,EAAK,CAAC,EAAIE,EACzGF,CACF,GC5BA,IAAAa,GAAAC,GAAA,CAAA,kGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,KAAOA,EAAQ,SAAWA,EAAQ,sBAAwBA,EAAQ,gBAAkBA,EAAQ,YAAcA,EAAQ,iBAAmBA,EAAQ,uBAAyBA,EAAQ,uBAAyBA,EAAQ,yBAA2BA,EAAQ,yBAA2BA,EAAQ,8BAAgCA,EAAQ,sBAAwBA,EAAQ,2BAA6BA,EAAQ,sBAAwBA,EAAQ,2BAA6BA,EAAQ,wBAA0BA,EAAQ,uBAAyBA,EAAQ,4BAA8BA,EAAQ,cAAgBA,EAAQ,iBAAmBA,EAAQ,sBAAwBA,EAAQ,YAAcA,EAAQ,UAAYA,EAAQ,UAAYA,EAAQ,gBAAkBA,EAAQ,UAAYA,EAAQ,YAAcA,EAAQ,kBAAoBA,EAAQ,iBAAmBA,EAAQ,iBAAmBA,EAAQ,UAAYA,EAAQ,0BAA4BA,EAAQ,WAAaA,EAAQ,eAAiBA,EAAQ,aAAeA,EAAQ,aAAeA,EAAQ,mBAAqBA,EAAQ,mBAAqBA,EAAQ,oBAAsBA,EAAQ,cAAgBA,EAAQ,cAAgBA,EAAQ,eAAiBA,EAAQ,KAAOA,EAAQ,KAAOA,EAAQ,SAAWA,EAAQ,SAAWA,EAAQ,UAAY,OAIpuCA,EAAQ,UAAY,OAAO,IAAI,mBAAmB,EAClDA,EAAQ,SAAW,OAAO,IAAI,kBAAkB,EAChDA,EAAQ,SAAW,OAAO,IAAI,kBAAkB,EAChDA,EAAQ,KAAO,OAAO,IAAI,cAAc,EACxCA,EAAQ,KAAO,OAAO,IAAI,cAAc,EAIxCA,EAAQ,eAAiB,eACzBA,EAAQ,cAAgB,kBACxBA,EAAQ,cAAgB,OACxBA,EAAQ,oBAAsB,IAAIA,EAAQ,cAAc,IACxDA,EAAQ,mBAAqB,IAAIA,EAAQ,aAAa,IACtDA,EAAQ,mBAAqB,IAAIA,EAAQ,aAAa,IAEtD,IAAIC,GACH,SAAUA,EAAc,CACrB,IAAMC,EAAM,IAAI,IAEhB,SAASC,GAAU,CACf,OAAO,IAAI,IAAID,CAAG,CACtB,CACAD,EAAa,QAAUE,EAEvB,SAASC,GAAQ,CACb,OAAOF,EAAI,MAAM,CACrB,CACAD,EAAa,MAAQG,EAErB,SAASC,EAAOC,EAAM,CAClB,OAAOJ,EAAI,OAAOI,CAAI,CAC1B,CACAL,EAAa,OAASI,EAEtB,SAASE,EAAID,EAAM,CACf,OAAOJ,EAAI,IAAII,CAAI,CACvB,CACAL,EAAa,IAAMM,EAEnB,SAASC,EAAIF,EAAMG,EAAM,CACrBP,EAAI,IAAII,EAAMG,CAAI,CACtB,CACAR,EAAa,IAAMO,EAEnB,SAASE,EAAIJ,EAAM,CACf,OAAOJ,EAAI,IAAII,CAAI,CACvB,CACAL,EAAa,IAAMS,CACvB,GAAGT,IAAiBD,EAAQ,aAAeC,EAAe,CAAC,EAAE,EAI7D,IAAMU,EAAN,cAA2B,KAAM,CAC7B,YAAYC,EAAS,CACjB,MAAMA,CAAO,CACjB,CACJ,EACAZ,EAAQ,aAAeW,EAEvB,IAAIE,GACH,SAAUA,EAAgB,CACvB,IAAMX,EAAM,IAAI,IAEhB,SAASC,GAAU,CACf,OAAO,IAAI,IAAID,CAAG,CACtB,CACAW,EAAe,QAAUV,EAEzB,SAASC,GAAQ,CACb,OAAOF,EAAI,MAAM,CACrB,CACAW,EAAe,MAAQT,EAEvB,SAASC,EAAOS,EAAQ,CACpB,OAAOZ,EAAI,OAAOY,CAAM,CAC5B,CACAD,EAAe,OAASR,EAExB,SAASE,EAAIO,EAAQ,CACjB,OAAOZ,EAAI,IAAIY,CAAM,CACzB,CACAD,EAAe,IAAMN,EAErB,SAASC,EAAIM,EAAQL,EAAM,CACvBP,EAAI,IAAIY,EAAQL,CAAI,CACxB,CACAI,EAAe,IAAML,EAErB,SAASE,EAAII,EAAQ,CACjB,OAAOZ,EAAI,IAAIY,CAAM,CACzB,CACAD,EAAe,IAAMH,CACzB,GAAGG,IAAmBb,EAAQ,eAAiBa,EAAiB,CAAC,EAAE,EAKnE,IAAIE,GACH,SAAUA,EAAY,CAEnB,SAASC,EAAQC,EAAO,CACpB,OAAO,MAAM,QAAQA,CAAK,CAC9B,CACAF,EAAW,QAAUC,EAErB,SAASE,EAASD,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACAF,EAAW,SAAWG,EAEtB,SAASC,EAAUF,EAAO,CACtB,OAAO,OAAOA,GAAU,SAC5B,CACAF,EAAW,UAAYI,EAEvB,SAASC,EAAOH,EAAO,CACnB,OAAOA,aAAiB,WAAW,IACvC,CACAF,EAAW,OAASK,EAEpB,SAASC,EAAOJ,EAAO,CACnB,OAAOA,IAAU,IACrB,CACAF,EAAW,OAASM,EAEpB,SAASC,EAASL,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACAF,EAAW,SAAWO,EAEtB,SAASC,EAASN,EAAO,CACrB,OAAO,OAAOA,GAAU,UAAYA,IAAU,IAClD,CACAF,EAAW,SAAWQ,EAEtB,SAASC,EAASP,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACAF,EAAW,SAAWS,EAEtB,SAASC,EAAaR,EAAO,CACzB,OAAOA,aAAiB,WAAW,UACvC,CACAF,EAAW,aAAeU,EAE1B,SAASC,EAAYT,EAAO,CACxB,OAAOA,IAAU,MACrB,CACAF,EAAW,YAAcW,CAC7B,GAAGX,IAAef,EAAQ,WAAae,EAAa,CAAC,EAAE,EAIvD,IAAMY,EAAN,cAAwChB,CAAa,CACrD,EACAX,EAAQ,0BAA4B2B,EAEpC,IAAIC,GACH,SAAUA,EAAW,CAClB,SAASC,EAAUZ,EAAO,CACtB,GAAI,CACA,WAAI,OAAOA,CAAK,EACT,EACX,MACM,CACF,MAAO,EACX,CACJ,CACA,SAASa,EAAuBb,EAAO,CACnC,GAAI,CAACF,EAAW,SAASE,CAAK,EAC1B,MAAO,GACX,QAASc,GAAI,EAAGA,GAAId,EAAM,OAAQc,KAAK,CACnC,IAAMC,GAAOf,EAAM,WAAWc,EAAC,EAC/B,GAAKC,IAAQ,GAAKA,IAAQ,IAAOA,KAAS,IAAMA,KAAS,IACrD,MAAO,EAEf,CACA,MAAO,EACX,CACA,SAASC,EAAuBhB,EAAO,CACnC,OAAOiB,EAAkBjB,CAAK,GAAKkB,GAAQlB,CAAK,CACpD,CACA,SAASmB,EAAiBnB,EAAO,CAC7B,OAAOF,EAAW,YAAYE,CAAK,GAAKF,EAAW,SAASE,CAAK,CACrE,CACA,SAASoB,EAAiBpB,EAAO,CAC7B,OAAOF,EAAW,YAAYE,CAAK,GAAKF,EAAW,SAASE,CAAK,CACrE,CACA,SAASiB,EAAkBjB,EAAO,CAC9B,OAAOF,EAAW,YAAYE,CAAK,GAAKF,EAAW,UAAUE,CAAK,CACtE,CACA,SAASqB,EAAiBrB,EAAO,CAC7B,OAAOF,EAAW,YAAYE,CAAK,GAAKF,EAAW,SAASE,CAAK,CACrE,CACA,SAASsB,EAAkBtB,EAAO,CAC9B,OAAOF,EAAW,YAAYE,CAAK,GAAMF,EAAW,SAASE,CAAK,GAAKa,EAAuBb,CAAK,GAAKY,EAAUZ,CAAK,CAC3H,CACA,SAASuB,EAAiBvB,EAAO,CAC7B,OAAOF,EAAW,YAAYE,CAAK,GAAMF,EAAW,SAASE,CAAK,GAAKa,EAAuBb,CAAK,CACvG,CACA,SAASwB,EAAiBxB,EAAO,CAC7B,OAAOF,EAAW,YAAYE,CAAK,GAAKkB,GAAQlB,CAAK,CACzD,CAKA,SAASyB,EAAKC,EAAQ,CAElB,OAAQC,GAAQD,EAAQ,KAAK,GACzBL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,KAAOc,EAEjB,SAASG,EAAOF,EAAQ,CACpB,OAAQC,GAAQD,EAAQ,OAAO,GAC3BA,EAAO,OAAS,SAChBL,EAAiBK,EAAO,GAAG,GAC3BR,GAAQQ,EAAO,KAAK,GACpBN,EAAiBM,EAAO,QAAQ,GAChCN,EAAiBM,EAAO,QAAQ,GAChCT,EAAkBS,EAAO,WAAW,GACpCF,EAAiBE,EAAO,QAAQ,GAChCN,EAAiBM,EAAO,WAAW,GACnCN,EAAiBM,EAAO,WAAW,CAC3C,CACAf,EAAU,OAASiB,EAEnB,SAASC,EAAeH,EAAQ,CAE5B,OAAQC,GAAQD,EAAQ,eAAe,GACnCA,EAAO,OAAS,iBAChBL,EAAiBK,EAAO,GAAG,GAC3BR,GAAQQ,EAAO,KAAK,CAC5B,CACAf,EAAU,eAAiBkB,EAE3B,SAASC,EAAQJ,EAAQ,CAErB,OAAQC,GAAQD,EAAQ,QAAQ,GAC5BA,EAAO,OAAS,UAChBL,EAAiBK,EAAO,GAAG,GAC3BP,EAAiBO,EAAO,gBAAgB,GACxCP,EAAiBO,EAAO,gBAAgB,GACxCP,EAAiBO,EAAO,OAAO,GAC/BP,EAAiBO,EAAO,OAAO,GAC/BP,EAAiBO,EAAO,UAAU,CAC1C,CACAf,EAAU,QAAUmB,EAEpB,SAASC,GAASL,EAAQ,CAEtB,OAAQC,GAAQD,EAAQ,SAAS,GAC7BA,EAAO,OAAS,WAChBL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,SAAWoB,GAErB,SAASC,GAAaN,EAAQ,CAE1B,OAAQC,GAAQD,EAAQ,aAAa,GACjCA,EAAO,OAAS,eAChBL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,QAAQ4B,EAAO,UAAU,GACpCA,EAAO,WAAW,MAAMA,IAAUR,GAAQQ,EAAM,CAAC,GACjDR,GAAQQ,EAAO,OAAO,CAC9B,CACAf,EAAU,aAAeqB,GAEzB,SAASC,GAAMP,EAAQ,CACnB,OAAQC,GAAQD,EAAQ,MAAM,GAC1BA,EAAO,OAAS,QAChBL,EAAiBK,EAAO,GAAG,GAC3BN,EAAiBM,EAAO,yBAAyB,GACjDN,EAAiBM,EAAO,yBAAyB,GACjDN,EAAiBM,EAAO,gBAAgB,GACxCN,EAAiBM,EAAO,gBAAgB,GACxCN,EAAiBM,EAAO,mBAAmB,CACnD,CACAf,EAAU,MAAQsB,GAElB,SAASC,GAAUR,EAAQ,CAEvB,OAAQC,GAAQD,EAAQ,UAAU,GAC9BA,EAAO,OAAS,YAChBL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,QAAQ4B,EAAO,UAAU,GACpCA,EAAO,WAAW,MAAMA,IAAUR,GAAQQ,EAAM,CAAC,GACjDR,GAAQQ,EAAO,OAAO,CAC9B,CACAf,EAAU,UAAYuB,GAEtB,SAASC,GAAST,EAAQ,CACtB,OAAQC,GAAQD,EAAQ,SAAS,GAC7BA,EAAO,OAAS,WAChBL,EAAiBK,EAAO,GAAG,GAC3BN,EAAiBM,EAAO,gBAAgB,GACxCN,EAAiBM,EAAO,gBAAgB,GACxCN,EAAiBM,EAAO,OAAO,GAC/BN,EAAiBM,EAAO,OAAO,GAC/BN,EAAiBM,EAAO,UAAU,CAC1C,CACAf,EAAU,SAAWwB,GAErB,SAASC,GAAWV,EAAQ,CAExB,OAAQC,GAAQD,EAAQ,WAAW,GAC9B,EAAA5B,EAAW,SAAS4B,EAAO,IAAI,GAAKA,EAAO,OAAS,WACrD5B,EAAW,QAAQ4B,EAAO,KAAK,GAC/BA,EAAO,MAAM,MAAMA,IAAUR,GAAQQ,EAAM,GAAK,CAACW,GAAWX,EAAM,CAAC,GACnEL,EAAiBK,EAAO,IAAI,IAC3BT,EAAkBS,EAAO,qBAAqB,GAAKF,EAAiBE,EAAO,qBAAqB,IACjGL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,WAAayB,GAEvB,SAASE,GAAUZ,EAAQ,CAEvB,OAAQC,GAAQD,EAAQ,UAAU,GAC9BA,EAAO,OAAS,YAChBL,EAAiBK,EAAO,GAAG,GAC3BR,GAAQQ,EAAO,KAAK,CAC5B,CACAf,EAAU,UAAY2B,GAEtB,SAASX,GAAQD,EAAQrC,GAAM,CAC3B,OAAOkD,GAAMb,CAAM,GAAKA,EAAO3C,EAAQ,IAAI,IAAMM,EACrD,CACAsB,EAAU,QAAUgB,GAEpB,SAASY,GAAMb,EAAQ,CACnB,OAAO5B,EAAW,SAAS4B,CAAM,GAAK3C,EAAQ,QAAQ2C,GAAU5B,EAAW,SAAS4B,EAAO3C,EAAQ,IAAI,CAAC,CAC5G,CACA4B,EAAU,MAAQ4B,GAElB,SAASC,GAAed,EAAQ,CAC5B,OAAOe,EAASf,CAAM,GAAK5B,EAAW,SAAS4B,EAAO,KAAK,CAC/D,CACAf,EAAU,eAAiB6B,GAE3B,SAASE,EAAehB,EAAQ,CAC5B,OAAOe,EAASf,CAAM,GAAK5B,EAAW,SAAS4B,EAAO,KAAK,CAC/D,CACAf,EAAU,eAAiB+B,EAE3B,SAASC,GAAgBjB,EAAQ,CAC7B,OAAOe,EAASf,CAAM,GAAK5B,EAAW,UAAU4B,EAAO,KAAK,CAChE,CACAf,EAAU,gBAAkBgC,GAE5B,SAASF,EAASf,EAAQ,CAEtB,OAAQC,GAAQD,EAAQ,SAAS,GAC7BL,EAAiBK,EAAO,GAAG,IAAM5B,EAAW,UAAU4B,EAAO,KAAK,GAClE5B,EAAW,SAAS4B,EAAO,KAAK,GAChC5B,EAAW,SAAS4B,EAAO,KAAK,EACxC,CACAf,EAAU,SAAW8B,EAErB,SAASG,GAAOlB,EAAQ,CAEpB,OAAQC,GAAQD,EAAQ,OAAO,GAC3B5B,EAAW,SAAS4B,EAAO,GAAG,GAC9B,OAAO,oBAAoBA,EAAO,GAAG,EAAE,SAAW,CAC1D,CACAf,EAAU,OAASiC,GAEnB,SAASC,GAAKnB,EAAQ,CAElB,OAAQC,GAAQD,EAAQ,KAAK,GACzBR,GAAQQ,EAAO,GAAG,CAC1B,CACAf,EAAU,KAAOkC,GAEjB,SAASC,GAAMpB,EAAQ,CAEnB,OAAQC,GAAQD,EAAQ,MAAM,GAC1BA,EAAO,OAAS,QAChBL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,MAAQmC,GAElB,SAASC,GAAQrB,EAAQ,CACrB,OAAQC,GAAQD,EAAQ,QAAQ,GAC5BA,EAAO,OAAS,UAChBL,EAAiBK,EAAO,GAAG,GAC3BN,EAAiBM,EAAO,gBAAgB,GACxCN,EAAiBM,EAAO,gBAAgB,GACxCN,EAAiBM,EAAO,OAAO,GAC/BN,EAAiBM,EAAO,OAAO,GAC/BN,EAAiBM,EAAO,UAAU,CAC1C,CACAf,EAAU,QAAUoC,GAEpB,SAASC,GAAQtB,EAAQ,CAErB,OAAQC,GAAQD,EAAQ,QAAQ,GAC5BA,EAAO,OAAS,UAChBL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,SAAS4B,EAAO,UAAU,GACrCV,EAAuBU,EAAO,oBAAoB,GAClDN,EAAiBM,EAAO,aAAa,GACrCN,EAAiBM,EAAO,aAAa,GACrC,OAAO,QAAQA,EAAO,UAAU,EAAE,MAAM,CAAC,CAACuB,GAAKvB,EAAM,IAAMb,EAAuBoC,EAAG,GAAK/B,GAAQQ,EAAM,CAAC,CACjH,CACAf,EAAU,QAAUqC,GAEpB,SAASE,GAASxB,EAAQ,CAEtB,OAAQC,GAAQD,EAAQ,SAAS,GAC7BA,EAAO,OAAS,WAChBL,EAAiBK,EAAO,GAAG,GAC3BR,GAAQQ,EAAO,IAAI,CAC3B,CACAf,EAAU,SAAWuC,GAErB,SAASC,GAAQzB,EAAQ,CAErB,OAAQC,GAAQD,EAAQ,QAAQ,GAC5BA,EAAO,OAAS,UAChBL,EAAiBK,EAAO,GAAG,GAC3BV,EAAuBU,EAAO,oBAAoB,GAClD5B,EAAW,SAAS4B,EAAO,iBAAiB,IAC1CA,IAAW,CACT,IAAM0B,GAAO,OAAO,oBAAoB1B,GAAO,iBAAiB,EAChE,OAAQ0B,GAAK,SAAW,GACpBxC,EAAUwC,GAAK,CAAC,CAAC,GACjBtD,EAAW,SAAS4B,GAAO,iBAAiB,GAC5CR,GAAQQ,GAAO,kBAAkB0B,GAAK,CAAC,CAAC,CAAC,CACjD,GAAG1B,CAAM,CACjB,CACAf,EAAU,QAAUwC,GAEpB,SAASE,GAAW3B,EAAQ,CACxB,OAAO5B,EAAW,SAAS4B,CAAM,GAAK3C,EAAQ,QAAQ2C,GAAUA,EAAO3C,EAAQ,IAAI,IAAM,WAC7F,CACA4B,EAAU,WAAa0C,GAEvB,SAASC,GAAK5B,EAAQ,CAElB,OAAQC,GAAQD,EAAQ,KAAK,GACzBL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,SAAS4B,EAAO,IAAI,CACvC,CACAf,EAAU,KAAO2C,GAEjB,SAASC,GAAQ7B,EAAQ,CAErB,OAAQC,GAAQD,EAAQ,QAAQ,GAC5BA,EAAO,OAAS,UAChBL,EAAiBK,EAAO,GAAG,GAC3BN,EAAiBM,EAAO,SAAS,GACjCN,EAAiBM,EAAO,SAAS,GACjCJ,EAAkBI,EAAO,OAAO,GAChCH,EAAiBG,EAAO,MAAM,CACtC,CACAf,EAAU,QAAU4C,GAEpB,SAASC,GAAQ9B,EAAQ,CAErB,OAAQC,GAAQD,EAAQ,QAAQ,GAC5BA,EAAO,OAAS,UAChBL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,QAAU6C,GAEpB,SAASC,GAAiB/B,EAAQ,CAE9B,OAAQC,GAAQD,EAAQ,iBAAiB,GACrCA,EAAO,OAAS,UAChB5B,EAAW,SAAS4B,EAAO,OAAO,GAClCA,EAAO,QAAQ,CAAC,IAAM,KACtBA,EAAO,QAAQA,EAAO,QAAQ,OAAS,CAAC,IAAM,GACtD,CACAf,EAAU,iBAAmB8C,GAE7B,SAASC,GAAMhC,EAAQ,CAEnB,OAAQC,GAAQD,EAAQ,MAAM,GAC1BL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,SAAS4B,EAAO,IAAI,CACvC,CACAf,EAAU,MAAQ+C,GAElB,SAASrB,GAAWX,EAAQ,CACxB,OAAO5B,EAAW,SAAS4B,CAAM,GAAK3C,EAAQ,aAAa2C,CAC/D,CACAf,EAAU,WAAa0B,GAEvB,SAASsB,GAAOjC,EAAQ,CAEpB,OAAQC,GAAQD,EAAQ,OAAO,GAC3BA,EAAO,OAAS,SAChBL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,SAAS4B,EAAO,QAAQ,GACnC5B,EAAW,SAAS4B,EAAO,QAAQ,GACnCA,EAAO,WAAaA,EAAO,WAE3B5B,EAAW,YAAY4B,EAAO,KAAK,GAC/B5B,EAAW,YAAY4B,EAAO,eAAe,GAC7CA,EAAO,WAAa,GAAO5B,EAAW,QAAQ4B,EAAO,KAAK,GAC1DA,EAAO,MAAM,MAAMA,IAAUR,GAAQQ,EAAM,CAAC,EACxD,CACAf,EAAU,OAASgD,GAEnB,SAASC,GAAWlC,EAAQ,CAExB,OAAQC,GAAQD,EAAQ,WAAW,GAC/BA,EAAO,OAAS,aAChBL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,WAAaiD,GAEvB,SAASC,GAAcnC,EAAQ,CAC3B,OAAOoC,GAAOpC,CAAM,GAAKA,EAAO,MAAM,MAAOA,IAAWc,GAAed,EAAM,GAAKgB,EAAehB,EAAM,CAAC,CAC5G,CACAf,EAAU,cAAgBkD,GAE1B,SAASC,GAAOpC,EAAQ,CAEpB,OAAQC,GAAQD,EAAQ,OAAO,GAC3BL,EAAiBK,EAAO,GAAG,GAC3B5B,EAAW,SAAS4B,CAAM,GAC1B5B,EAAW,QAAQ4B,EAAO,KAAK,GAC/BA,EAAO,MAAM,MAAMA,IAAUR,GAAQQ,EAAM,CAAC,CACpD,CACAf,EAAU,OAASmD,GAEnB,SAASC,GAAYrC,EAAQ,CAEzB,OAAQC,GAAQD,EAAQ,YAAY,GAChCA,EAAO,OAAS,cAChBL,EAAiBK,EAAO,GAAG,GAC3BN,EAAiBM,EAAO,aAAa,GACrCN,EAAiBM,EAAO,aAAa,CAC7C,CACAf,EAAU,YAAcoD,GAExB,SAASC,GAAStC,EAAQ,CAEtB,OAAQC,GAAQD,EAAQ,SAAS,GAC7BL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,SAAWqD,GAErB,SAASC,GAAQvC,EAAQ,CACrB,OAAOC,GAAQD,EAAQ,QAAQ,CACnC,CACAf,EAAU,QAAUsD,GAEpB,SAASC,GAAMxC,EAAQ,CAEnB,OAAQC,GAAQD,EAAQ,MAAM,GAC1BA,EAAO,OAAS,QAChBL,EAAiBK,EAAO,GAAG,CACnC,CACAf,EAAU,MAAQuD,GAElB,SAASC,GAAUzC,EAAQ,CACvB,OAAO5B,EAAW,SAAS4B,CAAM,GAAKA,EAAO3C,EAAQ,QAAQ,IAAM,UACvE,CACA4B,EAAU,UAAYwD,GAEtB,SAASC,GAAU1C,EAAQ,CACvB,OAAO5B,EAAW,SAAS4B,CAAM,GAAKA,EAAO3C,EAAQ,QAAQ,IAAM,UACvE,CACA4B,EAAU,UAAYyD,GAEtB,SAASlD,GAAQQ,EAAQ,CAErB,OAAQ5B,EAAW,SAAS4B,CAAM,IAAOD,EAAKC,CAAM,GAChDE,EAAOF,CAAM,GACbK,GAASL,CAAM,GACfI,EAAQJ,CAAM,GACdG,EAAeH,CAAM,GACrBM,GAAaN,CAAM,GACnBO,GAAMP,CAAM,GACZQ,GAAUR,CAAM,GAChBS,GAAST,CAAM,GACfU,GAAWV,CAAM,GACjBY,GAAUZ,CAAM,GAChBe,EAASf,CAAM,GACfkB,GAAOlB,CAAM,GACbmB,GAAKnB,CAAM,GACXoB,GAAMpB,CAAM,GACZqB,GAAQrB,CAAM,GACdsB,GAAQtB,CAAM,GACdwB,GAASxB,CAAM,GACfyB,GAAQzB,CAAM,GACd4B,GAAK5B,CAAM,GACX6B,GAAQ7B,CAAM,GACd8B,GAAQ9B,CAAM,GACd+B,GAAiB/B,CAAM,GACvBgC,GAAMhC,CAAM,GACZiC,GAAOjC,CAAM,GACbkC,GAAWlC,CAAM,GACjBoC,GAAOpC,CAAM,GACbqC,GAAYrC,CAAM,GAClBsC,GAAStC,CAAM,GACfuC,GAAQvC,CAAM,GACdwC,GAAMxC,CAAM,GACXa,GAAMb,CAAM,GAAK1C,EAAa,IAAI0C,EAAO3C,EAAQ,IAAI,CAAC,EAC/D,CACA4B,EAAU,QAAUO,EACxB,GAAGP,IAAc5B,EAAQ,UAAY4B,EAAY,CAAC,EAAE,EAKpD,IAAI0D,GACH,SAAUA,EAAkB,CACzB,SAASC,EAAM5C,EAAQ,CACnB,OAAOA,EAAO3C,EAAQ,IAAI,IAAM,YAC1B2C,EAAO,MAAM,MAAOA,GAAW4C,EAAM5C,CAAM,CAAC,EAC5CA,EAAO3C,EAAQ,IAAI,IAAM,QACrB2C,EAAO,MAAM,KAAMA,GAAW4C,EAAM5C,CAAM,CAAC,EAC3CA,EAAO3C,EAAQ,IAAI,IAAM,YACrB,GACA2C,EAAO3C,EAAQ,IAAI,IAAM,MACrB,CAACuF,EAAM5C,EAAO,GAAG,EACjB,EACtB,CACA2C,EAAiB,MAAQC,CAC7B,GAAGD,IAAqBtF,EAAQ,iBAAmBsF,EAAmB,CAAC,EAAE,EAIzE,IAAME,EAAN,cAA+B7E,CAAa,CAC5C,EACAX,EAAQ,iBAAmBwF,EAC3B,IAAIC,GACH,SAAUA,EAAmB,CAC1BA,EAAkBA,EAAkB,MAAW,CAAC,EAAI,QACpDA,EAAkBA,EAAkB,KAAU,CAAC,EAAI,OACnDA,EAAkBA,EAAkB,MAAW,CAAC,EAAI,OACxD,GAAGA,IAAsBzF,EAAQ,kBAAoByF,EAAoB,CAAC,EAAE,EAC5E,IAAIC,GACH,SAAUA,EAAa,CAIpB,SAASC,EAAkBC,EAAQ,CAC/B,OAAOA,IAAWH,EAAkB,MAAQG,EAASH,EAAkB,IAC3E,CAIA,SAASI,EAAMjF,EAAS,CACpB,MAAM,IAAI4E,EAAiB5E,CAAO,CACtC,CAIA,SAASkF,EAAkBC,EAAO,CAE9B,OAAQnE,EAAU,OAAOmE,CAAK,GAC1BnE,EAAU,WAAWmE,CAAK,GAC1BnE,EAAU,OAAOmE,CAAK,GACtBnE,EAAU,SAASmE,CAAK,GACxBnE,EAAU,KAAKmE,CAAK,CAC5B,CACA,SAASC,EAAgBC,EAAMF,EAAO,CAElC,OAAQnE,EAAU,OAAOmE,CAAK,EAAIG,GAAYD,EAAMF,CAAK,EACrDnE,EAAU,WAAWmE,CAAK,EAAII,GAAgBF,EAAMF,CAAK,EACrDnE,EAAU,OAAOmE,CAAK,EAAIK,GAAYH,EAAMF,CAAK,EAC7CnE,EAAU,SAASmE,CAAK,EAAIM,GAAcJ,EAAMF,CAAK,EACjDnE,EAAU,KAAKmE,CAAK,EAAIO,EAAUL,EAAMF,CAAK,EACzCF,EAAM,iBAAiB,CAC/C,CAIA,SAASS,EAAUL,EAAMF,EAAO,CAC5B,OAAON,EAAkB,IAC7B,CACA,SAAS/C,EAAKuD,EAAMF,EAAO,CAEvB,OAAQnE,EAAU,WAAWmE,CAAK,EAAII,GAAgBF,EAAMF,CAAK,EAC5DnE,EAAU,OAAOmE,CAAK,GAAKA,EAAM,MAAM,KAAMpD,IAAWf,EAAU,KAAKe,EAAM,GAAKf,EAAU,SAASe,EAAM,CAAC,EAAK8C,EAAkB,KAChI7D,EAAU,OAAOmE,CAAK,EAAIN,EAAkB,MACxC7D,EAAU,SAASmE,CAAK,GACpBnE,EAAU,KAAKmE,CAAK,EADIN,EAAkB,KAEtCA,EAAkB,KAC1C,CAIA,SAASc,EAAYN,EAAMF,EAAO,CAE9B,OAAQnE,EAAU,SAASqE,CAAI,EAAIR,EAAkB,MACjD7D,EAAU,KAAKqE,CAAI,EAAIR,EAAkB,MACrC7D,EAAU,OAAOqE,CAAI,EAAIR,EAAkB,KACvCA,EAAkB,KAClC,CACA,SAAS5C,EAAOoD,EAAMF,EAAO,CAEzB,OAAQnE,EAAU,QAAQmE,CAAK,GAAKS,GAAkBT,CAAK,EAAIN,EAAkB,KAC7EK,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EACjDnE,EAAU,OAAOmE,CAAK,EACnBJ,EAAkBc,GAAMR,EAAK,MAAOF,EAAM,KAAK,CAAC,EADzBN,EAAkB,KAEzD,CAIA,SAAS3C,EAAemD,EAAMF,EAAO,CAEjC,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EACzDnE,EAAU,eAAemE,CAAK,EAC3BJ,EAAkBc,GAAMR,EAAK,MAAOF,EAAM,KAAK,CAAC,EADjBN,EAAkB,KAE7D,CAIA,SAAS1C,EAAQkD,EAAMF,EAAO,CAE1B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIN,EAAkB,KACzCA,EAAkB,KACtC,CAIA,SAASmB,EAAcX,EAAMF,EAAO,CAChC,OAAOnE,EAAU,SAASqE,CAAI,GAAKlF,EAAW,UAAUkF,EAAK,KAAK,GAA6BrE,EAAU,SAASqE,CAAI,EAAhDR,EAAkB,KAA2DA,EAAkB,KACzK,CACA,SAASzC,EAASiD,EAAMF,EAAO,CAE3B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,SAASmE,CAAK,EAAIN,EAAkB,KAC1CA,EAAkB,KACtC,CAIA,SAASxC,EAAagD,EAAMF,EAAO,CAE/B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC9CnE,EAAU,aAAamE,CAAK,EACzBE,EAAK,WAAW,OAASF,EAAM,WAAW,OAASN,EAAkB,MAC/DQ,EAAK,WAAW,MAAM,CAACtD,GAAQkE,KAAUlB,EAAkBc,GAAMV,EAAM,WAAWc,EAAK,EAAGlE,EAAM,CAAC,IAAM8C,EAAkB,IAAI,EAC3HE,EAAkBc,GAAMR,EAAK,QAASF,EAAM,OAAO,CAAC,EAD4EN,EAAkB,MAF7HA,EAAkB,KAI/D,CAIA,SAASvC,EAAM+C,EAAMF,EAAO,CAExB,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,MAAMmE,CAAK,EAAIN,EAAkB,KACvCA,EAAkB,KACtC,CAIA,SAAStC,GAAU8C,EAAMF,EAAO,CAE5B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC9CnE,EAAU,UAAUmE,CAAK,EACtBE,EAAK,WAAW,OAASF,EAAM,WAAW,OAASN,EAAkB,MAC/DQ,EAAK,WAAW,MAAM,CAACtD,GAAQkE,KAAUlB,EAAkBc,GAAMV,EAAM,WAAWc,EAAK,EAAGlE,EAAM,CAAC,IAAM8C,EAAkB,IAAI,EAC3HE,EAAkBc,GAAMR,EAAK,QAASF,EAAM,OAAO,CAAC,EAD4EN,EAAkB,MAFhIA,EAAkB,KAI5D,CAIA,SAASqB,GAAcb,EAAMF,EAAO,CAEhC,OAAQnE,EAAU,SAASqE,CAAI,GAAKlF,EAAW,SAASkF,EAAK,KAAK,GAC9DrE,EAAU,QAAQqE,CAAI,GAAKrE,EAAU,SAASqE,CAAI,EADgBR,EAAkB,KAEhFA,EAAkB,KAC9B,CACA,SAASrC,GAAS6C,EAAMF,EAAO,CAE3B,OAAQnE,EAAU,SAASmE,CAAK,GAAKnE,EAAU,QAAQmE,CAAK,EAAIN,EAAkB,KAC9EK,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAClDnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CN,EAAkB,KACtC,CAIA,SAASU,GAAgBF,EAAMF,EAAO,CAElC,OAAOA,EAAM,MAAM,MAAOpD,IAAW8D,GAAMR,EAAMtD,EAAM,IAAM8C,EAAkB,IAAI,EAC7EA,EAAkB,KAClBA,EAAkB,KAC5B,CACA,SAASpC,GAAW4C,EAAMF,EAAO,CAE7B,OAAOE,EAAK,MAAM,KAAMtD,IAAW8D,GAAM9D,GAAQoD,CAAK,IAAMN,EAAkB,IAAI,EAC5EA,EAAkB,KAClBA,EAAkB,KAC5B,CAIA,SAASlC,GAAU0C,EAAMF,EAAO,CAE5B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EACzDnE,EAAU,UAAUmE,CAAK,EACtBJ,EAAkBc,GAAMR,EAAK,MAAOF,EAAM,KAAK,CAAC,EADtBN,EAAkB,KAExD,CAIA,SAAS/B,GAASuC,EAAMF,EAAO,CAE3B,OAAQnE,EAAU,SAASmE,CAAK,GAAKA,EAAM,QAAUE,EAAK,MAAQR,EAAkB,KAChFK,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAClDnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIgB,GAAad,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIiB,EAAaf,EAAMF,CAAK,EAC/CnE,EAAU,SAASmE,CAAK,EAAIe,GAAcb,EAAMF,CAAK,EACjDnE,EAAU,SAASmE,CAAK,EAAIa,EAAcX,EAAMF,CAAK,EACjDN,EAAkB,KACtD,CAIA,SAASS,GAAYD,EAAMF,EAAO,CAC9B,OAAON,EAAkB,KAC7B,CACA,SAAS5B,GAAOoC,EAAMF,EAAO,CACzB,OAAON,EAAkB,IAC7B,CAIA,SAASwB,GAAWtE,EAAQ,CACxB,GAAI,CAACuE,EAASC,EAAK,EAAI,CAACxE,EAAQ,CAAC,EACjC,KACSf,EAAU,KAAKsF,CAAO,GAE3BA,EAAUA,EAAQ,IAClBC,IAAS,EAEb,OAAOA,GAAQ,IAAM,EAAID,EAAUlH,EAAQ,KAAK,QAAQ,CAC5D,CACA,SAAS8D,EAAKmC,EAAMF,EAAO,CAKvB,OAAQnE,EAAU,KAAKqE,CAAI,EAAIQ,GAAMQ,GAAWhB,CAAI,EAAGF,CAAK,EACxDnE,EAAU,KAAKmE,CAAK,EAAIU,GAAMR,EAAMgB,GAAWlB,CAAK,CAAC,EACjDF,EAAM,6BAA6B,CAC/C,CAIA,SAAS9B,GAAMkC,EAAMF,EAAO,CAExB,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,MAAMmE,CAAK,EAAIN,EAAkB,KACvCA,EAAkB,KACtC,CAIA,SAASuB,EAAaf,EAAMF,EAAO,CAE/B,OAAQnE,EAAU,eAAeqE,CAAI,GACjCrE,EAAU,QAAQqE,CAAI,GAAKrE,EAAU,SAASqE,CAAI,EADbR,EAAkB,KAEnDA,EAAkB,KAC9B,CACA,SAASzB,GAAQiC,EAAMF,EAAO,CAE1B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,SAASmE,CAAK,GAAKnE,EAAU,QAAQmE,CAAK,EAAIN,EAAkB,KACtEA,EAAkB,KACtC,CAIA,SAAS2B,GAAsBzE,EAAQ0E,EAAO,CAC1C,OAAO,OAAO,oBAAoB1E,EAAO,UAAU,EAAE,SAAW0E,CACpE,CACA,SAASC,GAAmB3E,EAAQ,CAChC,OAAO6D,GAAkB7D,CAAM,CACnC,CACA,SAAS4E,GAAmB5E,EAAQ,CAEhC,OAAOyE,GAAsBzE,EAAQ,CAAC,GAAMyE,GAAsBzE,EAAQ,CAAC,GAAK,gBAAiBA,EAAO,YAAcf,EAAU,OAAOe,EAAO,WAAW,WAAW,GAAKA,EAAO,WAAW,YAAY,MAAM,SAAW,IAAOf,EAAU,QAAQe,EAAO,WAAW,YAAY,MAAM,CAAC,CAAC,GACnRf,EAAU,WAAWe,EAAO,WAAW,YAAY,MAAM,CAAC,CAAC,GAAOf,EAAU,QAAQe,EAAO,WAAW,YAAY,MAAM,CAAC,CAAC,GAC1Hf,EAAU,WAAWe,EAAO,WAAW,YAAY,MAAM,CAAC,CAAC,EACnE,CACA,SAAS6E,GAAmB7E,EAAQ,CAChC,OAAOyE,GAAsBzE,EAAQ,CAAC,CAC1C,CACA,SAAS8E,GAAoB9E,EAAQ,CACjC,OAAOyE,GAAsBzE,EAAQ,CAAC,CAC1C,CACA,SAAS+E,GAAmB/E,EAAQ,CAChC,OAAOyE,GAAsBzE,EAAQ,CAAC,CAC1C,CACA,SAASgF,GAAiBhF,EAAQ,CAC9B,OAAOyE,GAAsBzE,EAAQ,CAAC,CAC1C,CACA,SAASiF,GAAuBjF,EAAQ,CACpC,OAAO6D,GAAkB7D,CAAM,CACnC,CACA,SAASkF,GAAqBlF,EAAQ,CAClC,IAAMmF,EAAS9H,EAAQ,KAAK,OAAO,EACnC,OAAOoH,GAAsBzE,EAAQ,CAAC,GAAMyE,GAAsBzE,EAAQ,CAAC,GAAK,WAAYA,EAAO,YAAcgD,EAAkBc,GAAM9D,EAAO,WAAW,OAAWmF,CAAM,CAAC,IAAMrC,EAAkB,IACzM,CACA,SAASsC,GAAwBpF,EAAQ,CACrC,OAAOyE,GAAsBzE,EAAQ,CAAC,CAC1C,CACA,SAAS6D,GAAkB7D,EAAQ,CAC/B,IAAMmF,EAAS9H,EAAQ,KAAK,OAAO,EACnC,OAAOoH,GAAsBzE,EAAQ,CAAC,GAAMyE,GAAsBzE,EAAQ,CAAC,GAAK,WAAYA,EAAO,YAAcgD,EAAkBc,GAAM9D,EAAO,WAAW,OAAWmF,CAAM,CAAC,IAAMrC,EAAkB,IACzM,CACA,SAASuC,GAAoBrF,EAAQ,CACjC,IAAMsF,EAAOjI,EAAQ,KAAK,SAAS,CAACA,EAAQ,KAAK,IAAI,CAAC,EAAGA,EAAQ,KAAK,IAAI,CAAC,EAC3E,OAAOoH,GAAsBzE,EAAQ,CAAC,GAAMyE,GAAsBzE,EAAQ,CAAC,GAAK,SAAUA,EAAO,YAAcgD,EAAkBc,GAAM9D,EAAO,WAAW,KAASsF,CAAI,CAAC,IAAMxC,EAAkB,IACnM,CAIA,SAASyC,GAASjC,EAAMF,EAAO,CAE3B,OAAQU,GAAMR,EAAMF,CAAK,IAAMN,EAAkB,OAC7C7D,EAAU,UAAUqE,CAAI,GAAK,CAACrE,EAAU,UAAUmE,CAAK,EADFN,EAAkB,MAEnEA,EAAkB,IAC9B,CACA,SAASiB,GAAaT,EAAMF,EAAO,CAE/B,OAAQnE,EAAU,SAASqE,CAAI,EAAIR,EAAkB,MACjD7D,EAAU,KAAKqE,CAAI,EAAIR,EAAkB,MAAS7D,EAAU,OAAOqE,CAAI,GAClErE,EAAU,eAAeqE,CAAI,GAAKqB,GAAmBvB,CAAK,GAC1DnE,EAAU,eAAeqE,CAAI,GAAKuB,GAAmBzB,CAAK,GAC1DnE,EAAU,gBAAgBqE,CAAI,GAAKwB,GAAoB1B,CAAK,GAC5DnE,EAAU,QAAQqE,CAAI,GAAKsB,GAAmBxB,CAAK,GACnDnE,EAAU,QAAQqE,CAAI,GAAKyB,GAAmB3B,CAAK,GACnDnE,EAAU,QAAQqE,CAAI,GAAKqB,GAAmBvB,CAAK,GACnDnE,EAAU,QAAQqE,CAAI,GAAKsB,GAAmBxB,CAAK,GACnDnE,EAAU,QAAQqE,CAAI,GAAKuB,GAAmBzB,CAAK,GACnDnE,EAAU,SAASqE,CAAI,GAAKuB,GAAmBzB,CAAK,GACpDnE,EAAU,SAASqE,CAAI,GAAKwB,GAAoB1B,CAAK,GACrDnE,EAAU,YAAYqE,CAAI,GAAK2B,GAAuB7B,CAAK,GAC3DnE,EAAU,MAAMqE,CAAI,GAAK0B,GAAiB5B,CAAK,GAC/CnE,EAAU,aAAaqE,CAAI,GAAK8B,GAAwBhC,CAAK,GAC7DnE,EAAU,UAAUqE,CAAI,GAAK4B,GAAqB9B,CAAK,EAAMN,EAAkB,KAC/E7D,EAAU,QAAQqE,CAAI,GAAKrE,EAAU,QAAQuG,GAAUlC,CAAI,CAAC,EAGlDF,EAAM/F,EAAQ,IAAI,IAAM,SAAWyF,EAAkB,KAAOA,EAAkB,MAEpF7D,EAAU,QAAQqE,CAAI,GAAKrE,EAAU,QAAQuG,GAAUlC,CAAI,CAAC,EAClDmB,GAAsBrB,EAAO,CAAC,EAC/BN,EAAkB,KAClBA,EAAkB,MAExBA,EAAkB,KACtC,CACA,SAASxB,GAAQgC,EAAMF,EAAO,CAE1B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC9CnE,EAAU,QAAQmE,CAAK,GACnB,IAAM,CACH,QAAW7B,MAAO,OAAO,oBAAoB6B,EAAM,UAAU,EAAG,CAC5D,GAAI,EAAE7B,MAAO+B,EAAK,aAAe,CAACrE,EAAU,UAAUmE,EAAM,WAAW7B,EAAG,CAAC,EACvE,OAAOuB,EAAkB,MAE7B,GAAI7D,EAAU,UAAUmE,EAAM,WAAW7B,EAAG,CAAC,EACzC,OAAOuB,EAAkB,KAE7B,GAAIyC,GAASjC,EAAK,WAAW/B,EAAG,EAAG6B,EAAM,WAAW7B,EAAG,CAAC,IAAMuB,EAAkB,MAC5E,OAAOA,EAAkB,KAEjC,CACA,OAAOA,EAAkB,IAC7B,GAAG,EAdqBA,EAAkB,KAe1D,CAIA,SAAStB,GAAS8B,EAAMF,EAAO,CAE3B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,GAAKiC,GAAoBjC,CAAK,EAAIN,EAAkB,KACtE7D,EAAU,SAASmE,CAAK,EACrBJ,EAAkBc,GAAMR,EAAK,KAAMF,EAAM,IAAI,CAAC,EADrBN,EAAkB,KAE3D,CAIA,SAAS0C,GAAUxF,EAAQ,CAEvB,OAAQ3C,EAAQ,sBAAsB2C,EAAO,kBAAoB3C,EAAQ,KAAK,OAAO,EACjFA,EAAQ,sBAAsB2C,EAAO,kBAAoB3C,EAAQ,KAAK,OAAO,EACzE6F,EAAM,4BAA4B,CAC9C,CACA,SAASuC,GAAYzF,EAAQ,CAEzB,OAAQ3C,EAAQ,sBAAsB2C,EAAO,kBAAoBA,EAAO,kBAAkB3C,EAAQ,kBAAkB,EAChHA,EAAQ,sBAAsB2C,EAAO,kBAAoBA,EAAO,kBAAkB3C,EAAQ,kBAAkB,EACxG6F,EAAM,mCAAmC,CACrD,CACA,SAASc,GAAaV,EAAMF,EAAO,CAC/B,GAAM,CAACsC,GAAKC,EAAK,EAAI,CAACH,GAAUpC,CAAK,EAAGqC,GAAYrC,CAAK,CAAC,EAE1D,OAASnE,EAAU,eAAeqE,CAAI,GAAKrE,EAAU,QAAQyG,EAAG,GAAK1C,EAAkBc,GAAMR,EAAMqC,EAAK,CAAC,IAAM7C,EAAkB,KAAQA,EAAkB,KACvJ7D,EAAU,YAAYqE,CAAI,GAAKrE,EAAU,QAAQyG,EAAG,GAChDzG,EAAU,QAAQqE,CAAI,GAAKrE,EAAU,QAAQyG,EAAG,GAC5CzG,EAAU,OAAOqE,CAAI,GAAKrE,EAAU,QAAQyG,EAAG,EAFC5B,GAAMR,EAAMqC,EAAK,EAG7D1G,EAAU,QAAQqE,CAAI,GAAK,IAAM,CAC7B,QAAW/B,MAAO,OAAO,oBAAoB+B,EAAK,UAAU,EACxD,GAAIiC,GAASI,GAAOrC,EAAK,WAAW/B,EAAG,CAAC,IAAMuB,EAAkB,MAC5D,OAAOA,EAAkB,MAGjC,OAAOA,EAAkB,IAC7B,GAAG,EACCA,EAAkB,KAC1C,CACA,SAASrB,GAAQ6B,EAAMF,EAAO,CAE1B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC9CnE,EAAU,QAAQmE,CAAK,EACpBU,GAAM2B,GAAYnC,CAAI,EAAGmC,GAAYrC,CAAK,CAAC,EADnBN,EAAkB,KAE1D,CAIA,SAASsB,GAAad,EAAMF,EAAO,CAE/B,OAAQnE,EAAU,SAASqE,CAAI,GAAKlF,EAAW,SAASkF,EAAK,KAAK,GAC9DrE,EAAU,QAAQqE,CAAI,EAD4CR,EAAkB,KAEhFA,EAAkB,KAC9B,CACA,SAASjB,GAAQyB,EAAMF,EAAO,CAE1B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIN,EAAkB,KACzCA,EAAkB,KACtC,CAIA,SAAShB,GAAQwB,EAAMF,EAAO,CAE1B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIN,EAAkB,KACzCA,EAAkB,KACtC,CAIA,SAASf,GAAiBuB,EAAMF,EAAO,CAKnC,OAAQnE,EAAU,iBAAiBqE,CAAI,EAAIQ,GAAM8B,EAAwB,QAAQtC,CAAI,EAAGF,CAAK,EACzFnE,EAAU,iBAAiBmE,CAAK,EAAIU,GAAMR,EAAMsC,EAAwB,QAAQxC,CAAK,CAAC,EAClFF,EAAM,yCAAyC,CAC3D,CAIA,SAAS2C,EAAevC,EAAMF,EAAO,CAEjC,OAAQnE,EAAU,OAAOmE,CAAK,GAC1BE,EAAK,QAAU,QACfA,EAAK,MAAM,MAAOtD,IAAW8D,GAAM9D,GAAQoD,EAAM,KAAK,IAAMN,EAAkB,IAAI,CAC1F,CACA,SAASgD,GAAYxC,EAAMF,EAAO,CAE9B,OAAQnE,EAAU,OAAOqE,CAAI,EAAIR,EAAkB,KAC/C7D,EAAU,SAASqE,CAAI,EAAIR,EAAkB,MACzC7D,EAAU,KAAKqE,CAAI,EAAIR,EAAkB,MACrCA,EAAkB,KAClC,CACA,SAASb,GAAOqB,EAAMF,EAAO,CAEzB,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,GAAKS,GAAkBT,CAAK,GAC/CnE,EAAU,OAAOmE,CAAK,GAAKyC,EAAevC,EAAMF,CAAK,EADFN,EAAkB,KAEhE7D,EAAU,OAAOmE,CAAK,EAClBhF,EAAW,YAAYkF,EAAK,KAAK,GAAK,CAAClF,EAAW,YAAYgF,EAAM,KAAK,GAAO,CAAChF,EAAW,YAAYkF,EAAK,KAAK,GAAKlF,EAAW,YAAYgF,EAAM,KAAK,EAAKN,EAAkB,MAC5K1E,EAAW,YAAYkF,EAAK,KAAK,GAAK,CAAClF,EAAW,YAAYgF,EAAM,KAAK,GACtEE,EAAK,MAAM,MAAM,CAACtD,GAAQkE,KAAUJ,GAAM9D,GAAQoD,EAAM,MAAMc,EAAK,CAAC,IAAMpB,EAAkB,IAAI,EADrBA,EAAkB,KAEzFA,EAAkB,MAJPA,EAAkB,KAK7D,CAIA,SAAST,GAAYiB,EAAMF,EAAO,CAE9B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,YAAYmE,CAAK,EAAIN,EAAkB,KAC7CA,EAAkB,KACtC,CAIA,SAASZ,GAAWoB,EAAMF,EAAO,CAE7B,OAAQD,EAAkBC,CAAK,EAAIC,EAAgBC,EAAMF,CAAK,EAC1DnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIY,GAAaV,EAAMF,CAAK,EAC/CnE,EAAU,MAAMmE,CAAK,EAAI2C,GAAUzC,EAAMF,CAAK,EAC1CnE,EAAU,WAAWmE,CAAK,EAAIN,EAAkB,KAC5CA,EAAkB,KAC1C,CAIA,SAASW,GAAYH,EAAMF,EAAO,CAE9B,OAAOA,EAAM,MAAM,KAAMpD,IAAW8D,GAAMR,EAAMtD,EAAM,IAAM8C,EAAkB,IAAI,EAC5EA,EAAkB,KAClBA,EAAkB,KAC5B,CACA,SAASV,GAAOkB,EAAMF,EAAO,CAEzB,OAAOE,EAAK,MAAM,MAAOtD,IAAW8D,GAAM9D,GAAQoD,CAAK,IAAMN,EAAkB,IAAI,EAC7EA,EAAkB,KAClBA,EAAkB,KAC5B,CAIA,SAASY,GAAcJ,EAAMF,EAAO,CAChC,OAAON,EAAkB,IAC7B,CACA,SAASR,GAASgB,EAAMF,EAAO,CAE3B,OAAQnE,EAAU,OAAOmE,CAAK,EAAIG,GAAYD,EAAMF,CAAK,EACrDnE,EAAU,WAAWmE,CAAK,EAAII,GAAgBF,EAAMF,CAAK,EACrDnE,EAAU,OAAOmE,CAAK,EAAIK,GAAYH,EAAMF,CAAK,EAC7CnE,EAAU,KAAKmE,CAAK,EAAIO,EAAUL,EAAMF,CAAK,EACzCnE,EAAU,QAAQmE,CAAK,EAAIgB,GAAad,EAAMF,CAAK,EAC/CnE,EAAU,QAAQmE,CAAK,EAAIiB,EAAaf,EAAMF,CAAK,EAC/CnE,EAAU,SAASmE,CAAK,EAAIe,GAAcb,EAAMF,CAAK,EACjDnE,EAAU,SAASmE,CAAK,EAAIa,EAAcX,EAAMF,CAAK,EACjDnE,EAAU,OAAOmE,CAAK,EAAIQ,EAAYN,EAAMF,CAAK,EAC7CnE,EAAU,OAAOmE,CAAK,EAAI0C,GAAYxC,EAAMF,CAAK,EAC7CnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,SAASmE,CAAK,EAAIN,EAAkB,KAC1CA,EAAkB,KACtE,CAIA,SAASiD,GAAUzC,EAAMF,EAAO,CAE5B,OAAOnE,EAAU,WAAWqE,CAAI,GAC5BrE,EAAU,WAAWqE,CAAI,EADOR,EAAkB,KAE9CA,EAAkB,KAC9B,CACA,SAASN,GAAMc,EAAMF,EAAO,CAExB,OAAOnE,EAAU,WAAWmE,CAAK,EAAII,GAAgBF,EAAMF,CAAK,EAC5DnE,EAAU,OAAOmE,CAAK,EAAIK,GAAYH,EAAMF,CAAK,EAC7CnE,EAAU,SAASmE,CAAK,EAAIM,GAAcJ,EAAMF,CAAK,EACjDnE,EAAU,KAAKmE,CAAK,EAAIO,EAAUL,EAAMF,CAAK,EACzCnE,EAAU,QAAQmE,CAAK,EAAIW,GAAaT,EAAMF,CAAK,EAC/CnE,EAAU,MAAMmE,CAAK,EAAIN,EAAkB,KACvCA,EAAkB,KAC9C,CACA,SAASgB,GAAMR,EAAMF,EAAO,CAExB,OAECnE,EAAU,iBAAiBqE,CAAI,GAAKrE,EAAU,iBAAiBmE,CAAK,EAAKrB,GAAiBuB,EAAMF,CAAK,EACjGnE,EAAU,KAAKqE,CAAI,GAAKrE,EAAU,KAAKmE,CAAK,EAAKjC,EAAKmC,EAAMF,CAAK,EAE9DnE,EAAU,KAAKqE,CAAI,EAAIvD,EAAKuD,EAAMF,CAAK,EACnCnE,EAAU,OAAOqE,CAAI,EAAIpD,EAAOoD,EAAMF,CAAK,EACvCnE,EAAU,QAAQqE,CAAI,EAAIlD,EAAQkD,EAAMF,CAAK,EACzCnE,EAAU,SAASqE,CAAI,EAAIjD,EAASiD,EAAMF,CAAK,EAC3CnE,EAAU,eAAeqE,CAAI,EAAInD,EAAemD,EAAMF,CAAK,EACvDnE,EAAU,aAAaqE,CAAI,EAAIhD,EAAagD,EAAMF,CAAK,EACnDnE,EAAU,MAAMqE,CAAI,EAAI/C,EAAM+C,EAAMF,CAAK,EACrCnE,EAAU,UAAUqE,CAAI,EAAI9C,GAAU8C,EAAMF,CAAK,EAC7CnE,EAAU,SAASqE,CAAI,EAAI7C,GAAS6C,EAAMF,CAAK,EAC3CnE,EAAU,WAAWqE,CAAI,EAAI5C,GAAW4C,EAAMF,CAAK,EAC/CnE,EAAU,UAAUqE,CAAI,EAAI1C,GAAU0C,EAAMF,CAAK,EAC7CnE,EAAU,SAASqE,CAAI,EAAIvC,GAASuC,EAAMF,CAAK,EAC3CnE,EAAU,OAAOqE,CAAI,EAAIpC,GAAOoC,EAAMF,CAAK,EACvCnE,EAAU,MAAMqE,CAAI,EAAIlC,GAAMkC,EAAMF,CAAK,EACrCnE,EAAU,QAAQqE,CAAI,EAAIjC,GAAQiC,EAAMF,CAAK,EACzCnE,EAAU,QAAQqE,CAAI,EAAIhC,GAAQgC,EAAMF,CAAK,EACzCnE,EAAU,QAAQqE,CAAI,EAAI7B,GAAQ6B,EAAMF,CAAK,EACzCnE,EAAU,QAAQqE,CAAI,EAAIzB,GAAQyB,EAAMF,CAAK,EACzCnE,EAAU,QAAQqE,CAAI,EAAIxB,GAAQwB,EAAMF,CAAK,EACzCnE,EAAU,OAAOqE,CAAI,EAAIrB,GAAOqB,EAAMF,CAAK,EACvCnE,EAAU,SAASqE,CAAI,EAAI9B,GAAS8B,EAAMF,CAAK,EAC3CnE,EAAU,YAAYqE,CAAI,EAAIjB,GAAYiB,EAAMF,CAAK,EACjDnE,EAAU,WAAWqE,CAAI,EAAIpB,GAAWoB,EAAMF,CAAK,EAC/CnE,EAAU,OAAOqE,CAAI,EAAIlB,GAAOkB,EAAMF,CAAK,EACvCnE,EAAU,SAASqE,CAAI,EAAIhB,GAASgB,EAAMF,CAAK,EAC3CnE,EAAU,MAAMqE,CAAI,EAAId,GAAMc,EAAMF,CAAK,EACrCF,EAAM,8BAA8BI,EAAKjG,EAAQ,IAAI,CAAC,GAAG,CAC7K,CACA,SAAS2I,GAAQ1C,EAAMF,EAAO,CAC1B,OAAOU,GAAMR,EAAMF,CAAK,CAC5B,CACAL,EAAY,QAAUiD,EAC1B,GAAGjD,IAAgB1F,EAAQ,YAAc0F,EAAc,CAAC,EAAE,EAK1D,IAAIkD,GACH,SAAUA,EAAW,CAClB,SAASC,EAAU5H,EAAO,CACtB,OAAOA,EAAM,IAAKA,GAAUwF,EAAMxF,CAAK,CAAC,CAC5C,CACA,SAAS6H,EAAS7H,EAAO,CACrB,OAAO,IAAI,KAAKA,EAAM,QAAQ,CAAC,CACnC,CACA,SAAS8H,EAAe9H,EAAO,CAC3B,OAAO,IAAI,WAAWA,CAAK,CAC/B,CACA,SAAS+H,EAAW/H,EAAO,CACvB,IAAMgI,EAAmB,OAAO,oBAAoBhI,CAAK,EAAE,OAAO,CAACiI,EAAKhF,KAAS,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAGuC,EAAMxF,EAAMiD,CAAG,CAAC,CAAE,GAAI,CAAC,CAAC,EACpHiF,EAAgB,OAAO,sBAAsBlI,CAAK,EAAE,OAAO,CAACiI,EAAKhF,KAAS,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAGuC,EAAMxF,EAAMiD,CAAG,CAAC,CAAE,GAAI,CAAC,CAAC,EACzH,MAAO,CAAE,GAAG+E,EAAkB,GAAGE,CAAc,CACnD,CACA,SAAS1C,EAAMxF,EAAO,CAElB,OAAQF,EAAW,QAAQE,CAAK,EAAI4H,EAAU5H,CAAK,EAC/CF,EAAW,OAAOE,CAAK,EAAI6H,EAAS7H,CAAK,EACrCF,EAAW,aAAaE,CAAK,EAAI8H,EAAe9H,CAAK,EACjDF,EAAW,SAASE,CAAK,EAAI+H,EAAW/H,CAAK,EACzCA,CACpB,CAEA,SAASmI,EAAKC,EAAS,CACnB,OAAOA,EAAQ,IAAK1G,GAAW2G,EAAK3G,CAAM,CAAC,CAC/C,CACAiG,EAAU,KAAOQ,EAEjB,SAASE,EAAK3G,EAAQ4G,EAAU,CAAC,EAAG,CAChC,MAAO,CAAE,GAAG9C,EAAM9D,CAAM,EAAG,GAAG4G,CAAQ,CAC1C,CACAX,EAAU,KAAOU,CACrB,GAAGV,IAAc5I,EAAQ,UAAY4I,EAAY,CAAC,EAAE,EAIpD,IAAIY,GACH,SAAUA,EAAiB,CACxB,SAASC,EAAe9G,EAAQ,CAC5B,OAAOA,EAAO,IAAKA,GAAW,CAC1B,GAAM,CAAE,CAAC3C,EAAQ,QAAQ,EAAG0J,GAAG,GAAGC,EAAM,EAAIf,EAAU,KAAKjG,CAAM,EACjE,OAAOgH,EACX,CAAC,CACL,CACA,SAASC,EAAoBjH,EAAQ,CACjC,OAAOA,EAAO,MAAOA,GAAWf,EAAU,UAAUe,CAAM,CAAC,CAC/D,CACA,SAASkH,EAAgBlH,EAAQ,CAC7B,OAAOA,EAAO,KAAMA,GAAWf,EAAU,UAAUe,CAAM,CAAC,CAC9D,CACA,SAASmH,EAAiBnH,EAAQ,CAC9B,OAAOiH,EAAoBjH,EAAO,KAAK,EAAI3C,EAAQ,KAAK,SAASA,EAAQ,KAAK,UAAUyJ,EAAe9G,EAAO,KAAK,CAAC,CAAC,EAAIA,CAC7H,CACA,SAASoH,EAAapH,EAAQ,CAC1B,OAAOkH,EAAgBlH,EAAO,KAAK,EAAI3C,EAAQ,KAAK,SAASA,EAAQ,KAAK,MAAMyJ,EAAe9G,EAAO,KAAK,CAAC,CAAC,EAAIA,CACrH,CACA,SAASqH,EAAgBrH,EAAQ,CAE7B,OAAOA,EAAO3C,EAAQ,IAAI,IAAM,YAAc8J,EAAiBnH,CAAM,EACjEA,EAAO3C,EAAQ,IAAI,IAAM,QAAU+J,EAAapH,CAAM,EAClDA,CACZ,CACA,SAASU,EAAWV,EAAQuB,EAAK,CAC7B,IAAM+F,GAAWtH,EAAO,MAAM,OAAO,CAACuG,GAAKvG,KAAW,CAClD,IAAMuH,GAAUzD,EAAM9D,GAAQuB,CAAG,EACjC,OAAOgG,GAAQlK,EAAQ,IAAI,IAAM,QAAUkJ,GAAM,CAAC,GAAGA,GAAKgB,EAAO,CACrE,EAAG,CAAC,CAAC,EACL,OAAOF,EAAgBhK,EAAQ,KAAK,UAAUiK,EAAQ,CAAC,CAC3D,CACA,SAASlF,EAAOpC,EAAQuB,EAAK,CACzB,IAAM+F,GAAWtH,EAAO,MAAM,IAAKA,IAAW8D,EAAM9D,GAAQuB,CAAG,CAAC,EAChE,OAAO8F,EAAgBhK,EAAQ,KAAK,MAAMiK,EAAQ,CAAC,CACvD,CACA,SAAShG,EAAQtB,EAAQuB,EAAK,CAC1B,IAAMiG,GAAWxH,EAAO,WAAWuB,CAAG,EACtC,OAAOnD,EAAW,YAAYoJ,EAAQ,EAAInK,EAAQ,KAAK,MAAM,EAAIA,EAAQ,KAAK,MAAM,CAACmK,EAAQ,CAAC,CAClG,CACA,SAASvF,EAAOjC,EAAQuB,EAAK,CACzB,IAAMkG,GAAQzH,EAAO,MACrB,GAAI5B,EAAW,YAAYqJ,EAAK,EAC5B,OAAOpK,EAAQ,KAAK,MAAM,EAC9B,IAAMqK,GAAUD,GAAMlG,CAAG,EACzB,OAAInD,EAAW,YAAYsJ,EAAO,EACvBrK,EAAQ,KAAK,MAAM,EACvBqK,EACX,CACA,SAAS5D,EAAM9D,EAAQuB,EAAK,CAExB,OAAOvB,EAAO3C,EAAQ,IAAI,IAAM,YAAcqD,EAAWV,EAAQuB,CAAG,EAChEvB,EAAO3C,EAAQ,IAAI,IAAM,QAAU+E,EAAOpC,EAAQuB,CAAG,EACjDvB,EAAO3C,EAAQ,IAAI,IAAM,SAAWiE,EAAQtB,EAAQuB,CAAG,EACnDvB,EAAO3C,EAAQ,IAAI,IAAM,QAAU4E,EAAOjC,EAAQuB,CAAG,EACjDlE,EAAQ,KAAK,MAAM,CACvC,CACA,SAASsK,EAAQ3H,EAAQ0B,EAAMkF,GAAU,CAAC,EAAG,CACzC,IAAMU,GAAW5F,EAAK,IAAKH,IAAQuC,EAAM9D,EAAQuB,GAAI,SAAS,CAAC,CAAC,EAChE,OAAO8F,EAAgBhK,EAAQ,KAAK,MAAMiK,GAAUV,EAAO,CAAC,CAChE,CACAC,EAAgB,QAAUc,CAC9B,GAAGd,IAAoBxJ,EAAQ,gBAAkBwJ,EAAkB,CAAC,EAAE,EAItE,IAAIe,GACH,SAAUA,EAAW,CAClB,SAASC,EAAavJ,EAAO,CACzB,GAAM,CAACwJ,EAAOC,CAAI,EAAI,CAACzJ,EAAM,MAAM,EAAG,CAAC,EAAGA,EAAM,MAAM,CAAC,CAAC,EACxD,MAAO,GAAGwJ,EAAM,YAAY,CAAC,GAAGC,CAAI,EACxC,CACA,SAASC,EAAW1J,EAAO,CACvB,GAAM,CAACwJ,EAAOC,CAAI,EAAI,CAACzJ,EAAM,MAAM,EAAG,CAAC,EAAGA,EAAM,MAAM,CAAC,CAAC,EACxD,MAAO,GAAGwJ,EAAM,YAAY,CAAC,GAAGC,CAAI,EACxC,CACA,SAASE,EAAU3J,EAAO,CACtB,OAAOA,EAAM,YAAY,CAC7B,CACA,SAAS4J,EAAU5J,EAAO,CACtB,OAAOA,EAAM,YAAY,CAC7B,CACA,SAAS6J,EAAyBnI,EAAQoI,EAAM,CAG5C,IAAMC,EAAaC,EAAsB,WAAWtI,EAAO,OAAO,EAElE,GAAI,CADWuI,EAAsB,MAAMF,CAAU,EAEjD,MAAO,CAAE,GAAGrI,EAAQ,QAASwI,EAAiBxI,EAAO,QAASoI,CAAI,CAAE,EAExE,IAAMK,GADU,CAAC,GAAGC,EAAyB,SAASL,CAAU,CAAC,EACxC,IAAK/J,IAAUjB,EAAQ,KAAK,QAAQiB,EAAK,CAAC,EAC7DqK,GAASC,EAAcH,GAAUL,CAAI,EACrCS,GAAQxL,EAAQ,KAAK,MAAMsL,EAAM,EACvC,OAAOtL,EAAQ,KAAK,gBAAgB,CAACwL,EAAK,CAAC,CAC/C,CACA,SAASL,EAAiBlK,EAAO8J,EAAM,CAEnC,OAAO,OAAO9J,GAAU,SAAY8J,IAAS,eAAiBP,EAAavJ,CAAK,EAC5E8J,IAAS,aAAeJ,EAAW1J,CAAK,EACpC8J,IAAS,YAAcH,EAAU3J,CAAK,EAClC8J,IAAS,YAAcF,EAAU5J,CAAK,EAClCA,EAASA,EAAM,SAAS,CAC5C,CACA,SAASsK,EAAc5I,EAAQoI,EAAM,CACjC,GAAIpI,EAAO,SAAW,EAClB,MAAO,CAAC,EACZ,GAAM,CAAC8I,EAAG,GAAGC,CAAC,EAAI/I,EAClB,MAAO,CAACgJ,EAAIF,EAAGV,CAAI,EAAG,GAAGQ,EAAcG,EAAGX,CAAI,CAAC,CACnD,CACA,SAAStE,EAAM9D,EAAQoI,EAAM,CAEzB,OAAOnJ,EAAU,iBAAiBe,CAAM,EAAImI,EAAyBnI,EAAQoI,CAAI,EAC7EnJ,EAAU,OAAOe,CAAM,EAAI3C,EAAQ,KAAK,MAAMuL,EAAc5I,EAAO,MAAOoI,CAAI,CAAC,EAC3EnJ,EAAU,SAASe,CAAM,EAAI3C,EAAQ,KAAK,QAAQmL,EAAiBxI,EAAO,MAAOoI,CAAI,CAAC,EAClFpI,CAChB,CAEA,SAASgJ,EAAIhJ,EAAQoI,EAAM,CACvB,OAAOtE,EAAM9D,EAAQoI,CAAI,CAC7B,CACAR,EAAU,IAAMoB,CACpB,GAAGpB,IAAcvK,EAAQ,UAAYuK,EAAY,CAAC,EAAE,EAIpD,IAAIqB,GACH,SAAUA,EAAW,CAClB,SAASvI,EAAWV,EAAQkJ,EAAU,CAElC,OAAO7L,EAAQ,KAAK,UAAU2C,EAAO,MAAM,IAAKmJ,GAAUrF,EAAMqF,EAAOD,CAAQ,CAAC,EAAG,CAAE,GAAGlJ,CAAO,CAAC,CACpG,CACA,SAASoC,EAAOpC,EAAQkJ,EAAU,CAE9B,OAAO7L,EAAQ,KAAK,MAAM2C,EAAO,MAAM,IAAKmJ,GAAUrF,EAAMqF,EAAOD,CAAQ,CAAC,EAAG,CAAE,GAAGlJ,CAAO,CAAC,CAChG,CACA,SAASsB,EAAQtB,EAAQkJ,EAAU,CAC/B,OAAOA,EAASlJ,CAAM,CAC1B,CACA,SAAS8D,EAAM9D,EAAQkJ,EAAU,CAM7B,OAAQlJ,EAAO3C,EAAQ,IAAI,IAAM,YAAcqD,EAAWV,EAAQkJ,CAAQ,EACtElJ,EAAO3C,EAAQ,IAAI,IAAM,QAAU+E,EAAOpC,EAAQkJ,CAAQ,EACtDlJ,EAAO3C,EAAQ,IAAI,IAAM,SAAWiE,EAAQtB,EAAQkJ,CAAQ,EACxDlJ,CAChB,CACA,SAASgJ,EAAIhJ,EAAQkJ,EAAUtC,EAAS,CACpC,MAAO,CAAE,GAAG9C,EAAMmC,EAAU,KAAKjG,CAAM,EAAGkJ,CAAQ,EAAG,GAAGtC,CAAQ,CACpE,CACAqC,EAAU,IAAMD,CACpB,GAAGC,IAAc5L,EAAQ,UAAY4L,EAAY,CAAC,EAAE,EACpD,IAAIG,GACH,SAAUA,EAAa,CACpB,SAASC,EAAc9H,EAAK,CACxB,OAAOA,EAAI,CAAC,IAAM,KAAOA,EAAIA,EAAI,OAAS,CAAC,IAAM,IAAMA,EAAI,MAAM,EAAGA,EAAI,OAAS,CAAC,EAAIA,CAC1F,CACA,SAASb,EAAWV,EAAQ4G,EAAS,CACjC,OAAO5G,EAAO,MAAM,OAAO,CAACuG,EAAKvG,IAAW,CAAC,GAAGuG,EAAK,GAAGzC,EAAM9D,EAAQ4G,CAAO,CAAC,EAAG,CAAC,CAAC,CACvF,CACA,SAASxE,EAAOpC,EAAQ4G,EAAS,CAC7B,IAAM0C,EAAOtJ,EAAO,MAAM,IAAKmJ,GAAUrF,EAAMqF,EAAOvC,CAAO,CAAC,EAC9D,MAAO,CAAC,GAAG0C,EAAK,OAAO,CAACC,EAAKC,IAAUA,EAAM,IAAKjI,GAAS+H,EAAK,MAAOH,IAAUA,GAAM,SAAS5H,CAAG,CAAC,EAAIgI,EAAI,IAAIhI,CAAG,EAAIgI,CAAI,EAAE,CAAC,EAAG,IAAI,GAAK,CAAC,CAC/I,CACA,SAASjI,EAAQtB,EAAQ4G,EAAS,CAC9B,OAAO,OAAO,oBAAoB5G,EAAO,UAAU,CACvD,CACA,SAASyB,EAAQzB,EAAQ4G,EAAS,CAC9B,OAAOA,EAAQ,gBAAkB,OAAO,oBAAoB5G,EAAO,iBAAiB,EAAI,CAAC,CAC7F,CACA,SAAS8D,EAAM9D,EAAQ4G,EAAS,CAE5B,OAAQ3H,EAAU,WAAWe,CAAM,EAAIU,EAAWV,EAAQ4G,CAAO,EAC7D3H,EAAU,OAAOe,CAAM,EAAIoC,EAAOpC,EAAQ4G,CAAO,EAC7C3H,EAAU,QAAQe,CAAM,EAAIsB,EAAQtB,EAAQ4G,CAAO,EAC/C3H,EAAU,QAAQe,CAAM,EAAIyB,EAAQzB,EAAQ4G,CAAO,EAC/C,CAAC,CACrB,CAEA,SAAS6C,EAAYzJ,EAAQ4G,EAAS,CAClC,MAAO,CAAC,GAAG,IAAI,IAAI9C,EAAM9D,EAAQ4G,CAAO,CAAC,CAAC,CAC9C,CACAwC,EAAY,YAAcK,EAE1B,SAASC,EAAe1J,EAAQ,CAG5B,MAAO,KAFMyJ,EAAYzJ,EAAQ,CAAE,gBAAiB,EAAK,CAAC,EACrC,IAAKuB,GAAQ,IAAI8H,EAAc9H,CAAG,CAAC,GAAG,EACvC,KAAK,GAAG,CAAC,IACjC,CACA6H,EAAY,eAAiBM,CACjC,GAAGN,IAAgB/L,EAAQ,YAAc+L,EAAc,CAAC,EAAE,EAI1D,IAAMO,EAAN,cAAoC3L,CAAa,CACjD,EACAX,EAAQ,sBAAwBsM,EAChC,IAAIC,GACH,SAAUA,EAAkB,CAEzB,SAASjC,EAAQ3H,EAAQ,CAErB,OAAO,MAAM,QAAQA,CAAM,EAAIA,EAC3Bf,EAAU,cAAce,CAAM,EAAIA,EAAO,MAAM,IAAKA,GAAWA,EAAO,MAAM,SAAS,CAAC,EAClFf,EAAU,SAASe,CAAM,EAAI,CAACA,EAAO,KAAK,EACtCf,EAAU,iBAAiBe,CAAM,GAAK,IAAM,CACxC,IAAMqI,EAAaC,EAAsB,WAAWtI,EAAO,OAAO,EAClE,GAAI,CAACuI,EAAsB,MAAMF,CAAU,EACvC,MAAM,IAAIsB,EAAsB,uDAAuD,EAC3F,MAAO,CAAC,GAAGjB,EAAyB,SAASL,CAAU,CAAC,CAC5D,GAAG,EAAI,CAAC,CACxB,CACAuB,EAAiB,QAAUjC,CAC/B,GAAGiC,IAAqBvM,EAAQ,iBAAmBuM,EAAmB,CAAC,EAAE,EAIzE,IAAIC,GACH,SAAUA,EAAe,CACtB,SAAUzH,EAAOyG,EAAO,CACpB,QAAW7I,KAAU6I,EAAM,MACnB7I,EAAO3C,EAAQ,IAAI,IAAM,QACzB,MAAO+E,EAAOpC,CAAM,EAGpB,MAAMA,CAGlB,CAEA,SAAS2H,EAAQkB,EAAO,CACpB,OAAOxL,EAAQ,KAAK,MAAM,CAAC,GAAG+E,EAAOyG,CAAK,CAAC,EAAG,CAAE,GAAGA,CAAM,CAAC,CAC9D,CACAgB,EAAc,QAAUlC,CAC5B,GAAGkC,IAAkBxM,EAAQ,cAAgBwM,EAAgB,CAAC,EAAE,EAIhE,IAAMC,EAAN,cAA0C9L,CAAa,CACvD,EACAX,EAAQ,4BAA8ByM,EACtC,IAAIC,GACH,SAAUA,EAAwB,CAC/B,SAAS7G,EAAMjF,EAAS,CACpB,MAAM,IAAI6L,EAA4B7L,CAAO,CACjD,CACA,SAAS+L,EAAO1L,EAAO,CACnB,OAAOA,EAAM,QAAQ,sBAAuB,MAAM,CACtD,CACA,SAASwF,EAAM9D,EAAQuG,EAAK,CAExB,OAAQtH,EAAU,iBAAiBe,CAAM,EAAIA,EAAO,QAAQ,MAAM,EAAGA,EAAO,QAAQ,OAAS,CAAC,EAC1Ff,EAAU,OAAOe,CAAM,EAAI,IAAIA,EAAO,MAAM,IAAKA,GAAW8D,EAAM9D,EAAQuG,CAAG,CAAC,EAAE,KAAK,GAAG,CAAC,IACrFtH,EAAU,QAAQe,CAAM,EAAI,GAAGuG,CAAG,GAAGlJ,EAAQ,aAAa,GACtD4B,EAAU,SAASe,CAAM,EAAI,GAAGuG,CAAG,GAAGlJ,EAAQ,aAAa,GACvD4B,EAAU,QAAQe,CAAM,EAAI,GAAGuG,CAAG,GAAGlJ,EAAQ,aAAa,GACtD4B,EAAU,QAAQe,CAAM,EAAI,GAAGuG,CAAG,GAAGlJ,EAAQ,aAAa,GACtD4B,EAAU,SAASe,CAAM,EAAI,GAAGuG,CAAG,GAAGyD,EAAOhK,EAAO,MAAM,SAAS,CAAC,CAAC,GACjEf,EAAU,SAASe,CAAM,EAAI,GAAGuG,CAAG,GAAGlJ,EAAQ,cAAc,GACxD6F,EAAM,oBAAoBlD,EAAO3C,EAAQ,IAAI,CAAC,GAAG,CACrF,CACA,SAAS4M,EAAOC,EAAO,CACnB,MAAO,IAAIA,EAAM,IAAKlK,GAAW8D,EAAM9D,EAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAChE,CACA+J,EAAuB,OAASE,CACpC,GAAGF,IAA2B1M,EAAQ,uBAAyB0M,EAAyB,CAAC,EAAE,EAI3F,IAAInE,GACH,SAAUA,EAAyB,CAEhC,SAAS+B,EAAQwC,EAAU,CACvB,IAAM9B,EAAaC,EAAsB,WAAW6B,EAAS,OAAO,EACpE,GAAI,CAAC5B,EAAsB,MAAMF,CAAU,EACvC,OAAOhL,EAAQ,KAAK,OAAO,EAC/B,IAAMoL,EAAW,CAAC,GAAGC,EAAyB,SAASL,CAAU,CAAC,EAAE,IAAK/J,GAAUjB,EAAQ,KAAK,QAAQiB,CAAK,CAAC,EAC9G,OAAOjB,EAAQ,KAAK,MAAMoL,CAAQ,CACtC,CACA7C,EAAwB,QAAU+B,CACtC,GAAG/B,IAA4BvI,EAAQ,wBAA0BuI,EAA0B,CAAC,EAAE,EAI9F,IAAMwE,EAAN,cAAyCpM,CAAa,CACtD,EACAX,EAAQ,2BAA6B+M,EACrC,IAAI9B,GACH,SAAUA,EAAuB,CAC9B,SAAS+B,EAAaC,EAASpG,EAAOqG,GAAM,CACxC,OAAOD,EAAQpG,CAAK,IAAMqG,IAAQD,EAAQ,WAAWpG,EAAQ,CAAC,IAAM,EACxE,CACA,SAASsG,EAAYF,EAASpG,EAAO,CACjC,OAAOmG,EAAaC,EAASpG,EAAO,GAAG,CAC3C,CACA,SAASuG,EAAaH,EAASpG,EAAO,CAClC,OAAOmG,EAAaC,EAASpG,EAAO,GAAG,CAC3C,CACA,SAASwG,EAAYJ,EAASpG,EAAO,CACjC,OAAOmG,EAAaC,EAASpG,EAAO,GAAG,CAC3C,CACA,SAASyG,EAAQL,EAAS,CACtB,GAAI,EAAEE,EAAYF,EAAS,CAAC,GAAKG,EAAaH,EAASA,EAAQ,OAAS,CAAC,GACrE,MAAO,GACX,IAAI5F,EAAQ,EACZ,QAASR,GAAQ,EAAGA,GAAQoG,EAAQ,OAAQpG,KAKxC,GAJIsG,EAAYF,EAASpG,EAAK,IAC1BQ,GAAS,GACT+F,EAAaH,EAASpG,EAAK,IAC3BQ,GAAS,GACTA,IAAU,GAAKR,KAAUoG,EAAQ,OAAS,EAC1C,MAAO,GAEf,MAAO,EACX,CACA,SAASM,EAAQN,EAAS,CACtB,OAAOA,EAAQ,MAAM,EAAGA,EAAQ,OAAS,CAAC,CAC9C,CACA,SAASO,EAAeP,EAAS,CAC7B,IAAI5F,EAAQ,EACZ,QAASR,GAAQ,EAAGA,GAAQoG,EAAQ,OAAQpG,KAKxC,GAJIsG,EAAYF,EAASpG,EAAK,IAC1BQ,GAAS,GACT+F,EAAaH,EAASpG,EAAK,IAC3BQ,GAAS,GACTgG,EAAYJ,EAASpG,EAAK,GAAKQ,IAAU,EACzC,MAAO,GAEf,MAAO,EACX,CACA,SAASoG,EAAgBR,EAAS,CAC9B,QAASpG,EAAQ,EAAGA,EAAQoG,EAAQ,OAAQpG,IACxC,GAAIsG,EAAYF,EAASpG,CAAK,EAC1B,MAAO,GAEf,MAAO,EACX,CACA,SAAS6G,EAAGT,EAAS,CACjB,GAAI,CAAC5F,EAAOsG,EAAK,EAAI,CAAC,EAAG,CAAC,EACpBC,GAAc,CAAC,EACrB,QAAS/G,GAAQ,EAAGA,GAAQoG,EAAQ,OAAQpG,KAKxC,GAJIsG,EAAYF,EAASpG,EAAK,IAC1BQ,GAAS,GACT+F,EAAaH,EAASpG,EAAK,IAC3BQ,GAAS,GACTgG,EAAYJ,EAASpG,EAAK,GAAKQ,IAAU,EAAG,CAC5C,IAAMwG,GAAQZ,EAAQ,MAAMU,GAAO9G,EAAK,EACpCgH,GAAM,OAAS,GACfD,GAAY,KAAKE,EAAMD,EAAK,CAAC,EACjCF,GAAQ9G,GAAQ,CACpB,CAEJ,IAAMgH,GAAQZ,EAAQ,MAAMU,EAAK,EAGjC,OAFIE,GAAM,OAAS,GACfD,GAAY,KAAKE,EAAMD,EAAK,CAAC,EAC7BD,GAAY,SAAW,EAChB,CAAE,KAAM,QAAS,MAAO,EAAG,EAClCA,GAAY,SAAW,EAChBA,GAAY,CAAC,EACjB,CAAE,KAAM,KAAM,KAAMA,EAAY,CAC3C,CACA,SAASG,EAAId,EAAS,CAClB,SAASe,EAAM/M,GAAO4F,GAAO,CACzB,GAAI,CAACsG,EAAYlM,GAAO4F,EAAK,EACzB,MAAM,IAAIkG,EAA2B,wDAAwD,EACjG,IAAI1F,GAAQ,EACZ,QAAS4G,GAAOpH,GAAOoH,GAAOhN,GAAM,OAAQgN,KAKxC,GAJId,EAAYlM,GAAOgN,EAAI,IACvB5G,IAAS,GACT+F,EAAanM,GAAOgN,EAAI,IACxB5G,IAAS,GACTA,KAAU,EACV,MAAO,CAACR,GAAOoH,EAAI,EAE3B,MAAM,IAAIlB,EAA2B,4DAA4D,CACrG,CACA,SAASmB,GAAMjB,GAASpG,GAAO,CAC3B,QAASoH,GAAOpH,GAAOoH,GAAOhB,GAAQ,OAAQgB,KAC1C,GAAId,EAAYF,GAASgB,EAAI,EACzB,MAAO,CAACpH,GAAOoH,EAAI,EAE3B,MAAO,CAACpH,GAAOoG,GAAQ,MAAM,CACjC,CACA,IAAMW,GAAc,CAAC,EACrB,QAAS/G,GAAQ,EAAGA,GAAQoG,EAAQ,OAAQpG,KACxC,GAAIsG,EAAYF,EAASpG,EAAK,EAAG,CAC7B,GAAM,CAAC8G,GAAOQ,EAAG,EAAIH,EAAMf,EAASpG,EAAK,EACnCgH,GAAQZ,EAAQ,MAAMU,GAAOQ,GAAM,CAAC,EAC1CP,GAAY,KAAKE,EAAMD,EAAK,CAAC,EAC7BhH,GAAQsH,EACZ,KACK,CACD,GAAM,CAACR,GAAOQ,EAAG,EAAID,GAAMjB,EAASpG,EAAK,EACnCgH,GAAQZ,EAAQ,MAAMU,GAAOQ,EAAG,EAClCN,GAAM,OAAS,GACfD,GAAY,KAAKE,EAAMD,EAAK,CAAC,EACjChH,GAAQsH,GAAM,CAClB,CAGJ,OAAQP,GAAY,SAAW,EAAK,CAAE,KAAM,QAAS,MAAO,EAAG,EAC1DA,GAAY,SAAW,EAAKA,GAAY,CAAC,EACtC,CAAE,KAAM,MAAO,KAAMA,EAAY,CAC7C,CAEA,SAASE,EAAMb,EAAS,CAEpB,OAAOK,EAAQL,CAAO,EAAIa,EAAMP,EAAQN,CAAO,CAAC,EAC5CO,EAAeP,CAAO,EAAIS,EAAGT,CAAO,EAChCQ,EAAgBR,CAAO,EAAIc,EAAId,CAAO,EAClC,CAAE,KAAM,QAAS,MAAOA,CAAQ,CAChD,CACAhC,EAAsB,MAAQ6C,EAE9B,SAASM,EAAWnB,EAAS,CACzB,OAAOa,EAAMb,EAAQ,MAAM,EAAGA,EAAQ,OAAS,CAAC,CAAC,CACrD,CACAhC,EAAsB,WAAamD,CACvC,GAAGnD,IAA0BjL,EAAQ,sBAAwBiL,EAAwB,CAAC,EAAE,EAIxF,IAAMoD,GAAN,cAAyC1N,CAAa,CACtD,EACAX,EAAQ,2BAA6BqO,GACrC,IAAInD,GACH,SAAUA,EAAuB,CAC9B,SAASrF,EAAMjF,EAAS,CACpB,MAAM,IAAIyN,GAA2BzN,CAAO,CAChD,CACA,SAASU,EAAS0J,EAAY,CAE1B,OAAQA,EAAW,OAAS,MACxBA,EAAW,KAAK,SAAW,GAC3BA,EAAW,KAAK,CAAC,EAAE,OAAS,SAC5BA,EAAW,KAAK,CAAC,EAAE,QAAU,KAC7BA,EAAW,KAAK,CAAC,EAAE,OAAS,SAC5BA,EAAW,KAAK,CAAC,EAAE,QAAU,aACrC,CACA,SAAS7J,EAAU6J,EAAY,CAE3B,OAAQA,EAAW,OAAS,MACxBA,EAAW,KAAK,SAAW,GAC3BA,EAAW,KAAK,CAAC,EAAE,OAAS,SAC5BA,EAAW,KAAK,CAAC,EAAE,QAAU,QAC7BA,EAAW,KAAK,CAAC,EAAE,OAAS,SAC5BA,EAAW,KAAK,CAAC,EAAE,QAAU,OACrC,CACA,SAASxJ,EAASwJ,EAAY,CAC1B,OAAOA,EAAW,OAAS,SAAWA,EAAW,QAAU,IAC/D,CACA,SAASzF,EAAMyF,EAAY,CAEvB,OAAO7J,EAAU6J,CAAU,EAAI,GAC3B1J,EAAS0J,CAAU,GAAKxJ,EAASwJ,CAAU,EAAI,GAC1CA,EAAW,OAAS,MAASA,EAAW,KAAK,MAAOsD,GAAS/I,EAAM+I,CAAI,CAAC,EACpEtD,EAAW,OAAS,KAAQA,EAAW,KAAK,MAAOsD,GAAS/I,EAAM+I,CAAI,CAAC,EACnEtD,EAAW,OAAS,QAAW,GAC5BnF,EAAM,yBAAyB,CACvD,CACAqF,EAAsB,MAAQ3F,CAClC,GAAG2F,IAA0BlL,EAAQ,sBAAwBkL,EAAwB,CAAC,EAAE,EAIxF,IAAMqD,EAAN,cAA4C5N,CAAa,CACzD,EACAX,EAAQ,8BAAgCuO,EACxC,IAAIlD,GACH,SAAUA,EAA0B,CACjC,SAAUmD,EAAOC,EAAQ,CACrB,GAAIA,EAAO,SAAW,EAClB,OAAO,MAAOA,EAAO,CAAC,EAC1B,QAAWxI,KAAQwI,EAAO,CAAC,EACvB,QAAW1I,KAASyI,EAAOC,EAAO,MAAM,CAAC,CAAC,EACtC,KAAM,GAAGxI,CAAI,GAAGF,CAAK,EAGjC,CACA,SAAUgI,EAAI/C,EAAY,CACtB,OAAO,MAAOwD,EAAOxD,EAAW,KAAK,IAAKsD,GAAS,CAAC,GAAGI,EAASJ,CAAI,CAAC,CAAC,CAAC,CAC3E,CACA,SAAUZ,EAAG1C,EAAY,CACrB,QAAWsD,KAAQtD,EAAW,KAC1B,MAAO0D,EAASJ,CAAI,CAC5B,CACA,SAAUK,EAAM3D,EAAY,CACxB,OAAO,MAAMA,EAAW,KAC5B,CACA,SAAU0D,EAAS1D,EAAY,CAE3B,OAAQA,EAAW,OAAS,MAAQ,MAAO+C,EAAI/C,CAAU,EACrDA,EAAW,OAAS,KAAO,MAAO0C,EAAG1C,CAAU,EAC3CA,EAAW,OAAS,QAAU,MAAO2D,EAAM3D,CAAU,GAChD,IAAM,CAAE,MAAM,IAAIuD,EAA8B,oBAAoB,CAAG,GAAG,CAC3F,CACAlD,EAAyB,SAAWqD,CACxC,GAAGrD,IAA6BrL,EAAQ,yBAA2BqL,EAA2B,CAAC,EAAE,EAIjG,IAAIuD,IACH,SAAUA,EAA0B,CACjC,SAAUC,EAAW/B,EAAU,CAC3B,IAAMgC,EAAOhC,EAAS,KAAK,EAAE,QAAQ,OAAQ,EAAE,EAE/C,OAAQgC,IAAS,UAAY,MAAM9O,EAAQ,KAAK,QAAQ,EACpD8O,IAAS,SAAW,MAAM9O,EAAQ,KAAK,OAAO,EAC1C8O,IAAS,SAAW,MAAM9O,EAAQ,KAAK,OAAO,EAC1C8O,IAAS,SAAW,MAAM9O,EAAQ,KAAK,OAAO,EAC1C,MAAO,IAAM,CACT,IAAMoL,EAAW0D,EAAK,MAAM,GAAG,EAAE,IAAKC,GAAY/O,EAAQ,KAAK,QAAQ+O,EAAQ,KAAK,CAAC,CAAC,EACtF,OAAQ3D,EAAS,SAAW,EAAIpL,EAAQ,KAAK,MAAM,EAC/CoL,EAAS,SAAW,EAAIA,EAAS,CAAC,EAC9BpL,EAAQ,KAAK,MAAMoL,CAAQ,CACvC,GAAG,CACvB,CACA,SAAU4D,EAAclC,EAAU,CAC9B,GAAIA,EAAS,CAAC,IAAM,IAAK,CACrB,IAAMrB,EAAIzL,EAAQ,KAAK,QAAQ,GAAG,EAC5B0L,EAAIuD,EAAanC,EAAS,MAAM,CAAC,CAAC,EACxC,OAAO,MAAO,CAACrB,EAAG,GAAGC,CAAC,CAC1B,CACA,QAAS3J,EAAI,EAAGA,EAAI+K,EAAS,OAAQ/K,IACjC,GAAI+K,EAAS/K,CAAC,IAAM,IAAK,CACrB,IAAM0J,EAAIoD,EAAW/B,EAAS,MAAM,EAAG/K,CAAC,CAAC,EACnC2J,EAAIuD,EAAanC,EAAS,MAAM/K,EAAI,CAAC,CAAC,EAC5C,OAAO,MAAO,CAAC,GAAG0J,EAAG,GAAGC,CAAC,CAC7B,CAEJ,MAAM1L,EAAQ,KAAK,QAAQ8M,CAAQ,CACvC,CACA,SAAUmC,EAAanC,EAAU,CAC7B,QAAS/K,EAAI,EAAGA,EAAI+K,EAAS,OAAQ/K,IACjC,GAAI+K,EAAS/K,CAAC,IAAM,IAAK,CACrB,IAAM0J,EAAIzL,EAAQ,KAAK,QAAQ8M,EAAS,MAAM,EAAG/K,CAAC,CAAC,EAC7C2J,EAAIsD,EAAclC,EAAS,MAAM/K,CAAC,CAAC,EACzC,OAAO,MAAO,CAAC0J,EAAG,GAAGC,CAAC,CAC1B,CAEJ,MAAM1L,EAAQ,KAAK,QAAQ8M,CAAQ,CACvC,CACA,SAASgB,EAAMoB,EAAc,CACzB,MAAO,CAAC,GAAGD,EAAaC,CAAY,CAAC,CACzC,CACAN,EAAyB,MAAQd,CACrC,GAAGc,KAA6B5O,EAAQ,yBAA2B4O,GAA2B,CAAC,EAAE,EAIjG,IAAMO,GAAN,KAA6B,CACzB,YAAYxM,EAAQ,CAChB,KAAK,OAASA,CAClB,CACA,OAAOyM,EAAQ,CACX,OAAO,IAAIC,EAAuB,KAAK,OAAQD,CAAM,CACzD,CACJ,EACApP,EAAQ,uBAAyBmP,GACjC,IAAME,EAAN,KAA6B,CACzB,YAAY1M,EAAQyM,EAAQ,CACxB,KAAK,OAASzM,EACd,KAAK,OAASyM,CAClB,CACA,OAAOE,EAAQ,CACX,IAAM3M,EAASiG,EAAU,KAAK,KAAK,MAAM,EAEzC,OAAQhH,EAAU,WAAWe,CAAM,GAAK,IAAM,CAG1C,IAAM4M,EAAQ,CAAE,OAFAtO,GAAU0B,EAAO3C,EAAQ,SAAS,EAAE,OAAOsP,EAAOrO,CAAK,CAAC,EAExC,OADhBA,GAAU,KAAK,OAAO0B,EAAO3C,EAAQ,SAAS,EAAE,OAAOiB,CAAK,CAAC,CAC9B,EAC/C,MAAO,CAAE,GAAG0B,EAAQ,CAAC3C,EAAQ,SAAS,EAAGuP,CAAM,CACnD,GAAG,GAAK,IAAM,CACV,IAAMA,EAAQ,CAAE,OAAQ,KAAK,OAAQ,OAAQD,CAAO,EACpD,MAAO,CAAE,GAAG3M,EAAQ,CAAC3C,EAAQ,SAAS,EAAGuP,CAAM,CACnD,GAAG,CACP,CACJ,EACAvP,EAAQ,uBAAyBqP,EAIjC,IAAIG,EAAc,EAIZC,GAAN,cAA+B9O,CAAa,CAC5C,EACAX,EAAQ,iBAAmByP,GAC3B,IAAMC,EAAN,KAAkB,CAEd,OAAO/M,EAAQ,CACX,OAAOA,CACX,CAEA,MAAM/B,EAAS,CACX,MAAM,IAAI6O,GAAiB7O,CAAO,CACtC,CAEA,QAAQ+O,EAAQtL,EAAM,CAClB,OAAOA,EAAK,OAAO,CAAC6E,EAAKhF,IAAQ,CAC7B,GAAM,CAAE,CAACA,CAAG,EAAGwF,EAAG,GAAGgB,CAAK,EAAIxB,EAC9B,OAAOwB,CACX,EAAGiF,CAAM,CACb,CAEA,OAAOhN,EAAQ,CACX,OAAO,KAAK,MAAM,KAAK,UAAUA,CAAM,CAAC,CAC5C,CACJ,EACA3C,EAAQ,YAAc0P,EAItB,IAAME,EAAN,cAA8BF,CAAY,CAKtC,iBAAiB/M,EAAQ,CACrB,OAAO,KAAK,SAAS,KAAK,SAASA,CAAM,CAAC,CAC9C,CAEA,SAASA,EAAQ,CACb,MAAO,CAAE,GAAGiG,EAAU,KAAKjG,CAAM,EAAG,CAAC3C,EAAQ,QAAQ,EAAG,UAAW,CACvE,CAEA,SAAS2C,EAAQ,CACb,MAAO,CAAE,GAAGiG,EAAU,KAAKjG,CAAM,EAAG,CAAC3C,EAAQ,QAAQ,EAAG,UAAW,CACvE,CAKA,IAAIuJ,EAAU,CAAC,EAAG,CACd,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,KAAM,CAAC,CAC5D,CAEA,MAAM2C,EAAQ4G,EAAU,CAAC,EAAG,CACxB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,QAAS,KAAM,QAAS,MAAO4I,EAAU,KAAKjG,CAAM,CAAE,CAAC,CAC5G,CAEA,QAAQ4G,EAAU,CAAC,EAAG,CAClB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,UAAW,KAAM,SAAU,CAAC,CACjF,CAEA,WAAW2C,EAAQ4G,EAAU,CAAC,EAAG,CAC7B,MAAO,CAAE,GAAGgB,EAAU,IAAI3B,EAAU,KAAKjG,CAAM,EAAG,YAAY,EAAG,GAAG4G,CAAQ,CAChF,CAEA,UAAUsG,EAAStG,EAAS,CACxB,IAAMuG,EAAY9P,EAAQ,KAAK,UAAU6P,EAAS,CAAC,CAAC,EAE9CE,EADOhE,EAAY,YAAY+D,EAAW,CAAE,gBAAiB,EAAM,CAAC,EAClD,OAAO,CAAC5G,EAAKhF,KAAS,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAGlE,EAAQ,KAAK,MAAM8P,EAAW,CAAC5L,CAAG,CAAC,CAAE,GAAI,CAAC,CAAC,EAC1G,OAAOlE,EAAQ,KAAK,OAAO+P,EAAYxG,CAAO,CAClD,CAEA,KAAKyG,EAAMzG,EAAU,CAAC,EAAG,CACrB,GAAIxI,EAAW,YAAYiP,CAAI,EAC3B,OAAO,KAAK,MAAM,yBAAyB,EAE/C,IAAMC,EAAU,OAAO,oBAAoBD,CAAI,EAAE,OAAQ9L,GAAQ,MAAMA,CAAG,CAAC,EAAE,IAAKA,GAAQ8L,EAAK9L,CAAG,CAAC,EAE7FgM,EADU,CAAC,GAAG,IAAI,IAAID,CAAO,CAAC,EACd,IAAKhP,GAAUjB,EAAQ,KAAK,QAAQiB,CAAK,CAAC,EAChE,OAAO,KAAK,MAAMiP,EAAO,CAAE,GAAG3G,EAAS,CAACvJ,EAAQ,IAAI,EAAG,MAAO,CAAC,CACnE,CAEA,QAAQiG,EAAMF,EAAOoK,EAAUC,EAAW7G,EAAU,CAAC,EAAG,CACpD,OAAQ7D,EAAY,QAAQO,EAAMF,CAAK,EAAG,CACtC,KAAKN,EAAkB,MACnB,OAAO,KAAK,MAAM,CAACmD,EAAU,KAAKuH,EAAU5G,CAAO,EAAGX,EAAU,KAAKwH,EAAW7G,CAAO,CAAC,CAAC,EAC7F,KAAK9D,EAAkB,KACnB,OAAOmD,EAAU,KAAKuH,EAAU5G,CAAO,EAC3C,KAAK9D,EAAkB,MACnB,OAAOmD,EAAU,KAAKwH,EAAW7G,CAAO,CAChD,CACJ,CAEA,QAAQ8G,EAAWC,EAAiB/G,EAAU,CAAC,EAAG,CAE9C,OAAQ3H,EAAU,iBAAiByO,CAAS,EAAI,KAAK,QAAQ9H,EAAwB,QAAQ8H,CAAS,EAAGC,EAAiB/G,CAAO,EAC7H3H,EAAU,iBAAiB0O,CAAe,EAAI,KAAK,QAAQD,EAAW9H,EAAwB,QAAQ+H,CAAe,EAAG/G,CAAO,EAC3H3H,EAAU,OAAOyO,CAAS,GAAK,IAAM,CACjC,IAAME,EAAWF,EAAU,MAAM,OAAQvE,GAAUpG,EAAY,QAAQoG,EAAOwE,CAAe,IAAM7K,EAAkB,KAAK,EAC1H,OAAQ8K,EAAS,SAAW,EAAI3H,EAAU,KAAK2H,EAAS,CAAC,EAAGhH,CAAO,EAAI,KAAK,MAAMgH,EAAUhH,CAAO,CACvG,GAAG,EACC7D,EAAY,QAAQ2K,EAAWC,CAAe,IAAM7K,EAAkB,MAAQ,KAAK,MAAM8D,CAAO,EAC5FX,EAAU,KAAKyH,EAAW9G,CAAO,CACrD,CAEA,QAAQiH,EAAMhF,EAAOjC,EAAU,CAAC,EAAG,CAE/B,OAAQ3H,EAAU,iBAAiB4O,CAAI,EAAI,KAAK,QAAQjI,EAAwB,QAAQiI,CAAI,EAAGhF,EAAOjC,CAAO,EACzG3H,EAAU,iBAAiB4J,CAAK,EAAI,KAAK,QAAQgF,EAAMjI,EAAwB,QAAQiD,CAAK,EAAGjC,CAAO,EAClG3H,EAAU,OAAO4O,CAAI,GAAK,IAAM,CAC5B,IAAMD,EAAWC,EAAK,MAAM,OAAQ1E,GAAUpG,EAAY,QAAQoG,EAAON,CAAK,IAAM/F,EAAkB,KAAK,EAC3G,OAAQ8K,EAAS,SAAW,EAAI3H,EAAU,KAAK2H,EAAS,CAAC,EAAGhH,CAAO,EAAI,KAAK,MAAMgH,EAAUhH,CAAO,CACvG,GAAG,EACC7D,EAAY,QAAQ8K,EAAMhF,CAAK,IAAM/F,EAAkB,MAAQmD,EAAU,KAAK4H,EAAMjH,CAAO,EACvF,KAAK,MAAMA,CAAO,CACtC,CAEA,MAAM5G,EAAQ8N,EAAYlH,EAAU,CAAC,EAAG,CAEpC,OAAQ3H,EAAU,OAAOe,CAAM,GAAKf,EAAU,QAAQ6O,CAAU,EACrD7H,EAAU,KAAKjG,EAAO,MAAO4G,CAAO,EAE3C3H,EAAU,OAAOe,CAAM,GAAKf,EAAU,QAAQ6O,CAAU,GAAK,IAAM,CAE/D,IAAMC,GADQ3P,EAAW,YAAY4B,EAAO,KAAK,EAAI,CAAC,EAAIA,EAAO,OAC5C,IAAKA,GAAWiG,EAAU,KAAKjG,CAAM,CAAC,EAC3D,OAAO,KAAK,MAAM+N,EAAQnH,CAAO,CACrC,GAAG,GAAK,IAAM,CACV,IAAMlF,EAAOkI,EAAiB,QAAQkE,CAAU,EAC1C9G,EAAQf,EAAU,KAAKjG,CAAM,EACnC,OAAO6G,EAAgB,QAAQG,EAAOtF,EAAMkF,CAAO,CACvD,GAAG,CACX,CAEA,QAAQA,EAAU,CAAC,EAAG,CAClB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,UAAW,KAAM,SAAU,CAAC,CACjF,CAEA,UAAU2Q,EAAOpH,EAAU,CAAC,EAAG,CAC3B,GAAIoH,EAAM,SAAW,EACjB,OAAO3Q,EAAQ,KAAK,MAAM,EAC9B,GAAI2Q,EAAM,SAAW,EACjB,OAAO/H,EAAU,KAAK+H,EAAM,CAAC,EAAGpH,CAAO,EACvCoH,EAAM,KAAMhO,GAAWf,EAAU,WAAWe,CAAM,CAAC,GACnD,KAAK,MAAM,kCAAkC,EACjD,IAAMkN,EAAUc,EAAM,MAAOhO,GAAWf,EAAU,QAAQe,CAAM,CAAC,EAC3D+N,EAAS9H,EAAU,KAAK+H,CAAK,EAE7BC,EAA8BhP,EAAU,QAAQ2H,EAAQ,qBAAqB,EAC7E,CAAE,sBAAuBX,EAAU,KAAKW,EAAQ,qBAAqB,CAAE,EACvE,CAAC,EACP,OAAOA,EAAQ,wBAA0B,IAAS3H,EAAU,QAAQ2H,EAAQ,qBAAqB,GAAKsG,EAChG,KAAK,OAAO,CAAE,GAAGtG,EAAS,GAAGqH,EAA6B,CAAC5Q,EAAQ,IAAI,EAAG,YAAa,KAAM,SAAU,MAAO0Q,CAAO,CAAC,EACtH,KAAK,OAAO,CAAE,GAAGnH,EAAS,GAAGqH,EAA6B,CAAC5Q,EAAQ,IAAI,EAAG,YAAa,MAAO0Q,CAAO,CAAC,CAChH,CAEA,MAAM/N,EAAQ4G,EAAU,CAAC,EAAG,CAExB,OAAQ3H,EAAU,QAAQe,CAAM,GAAK,IAAM,CACvC,IAAMsK,EAAU,OAAO,oBAAoBtK,EAAO,iBAAiB,EAAE,CAAC,EACtE,OAAQsK,IAAYjN,EAAQ,mBAAqB,KAAK,OAAOuJ,CAAO,EAChE0D,IAAYjN,EAAQ,mBAAqB,KAAK,OAAOuJ,CAAO,EACxD,KAAK,MAAM,oDAAoD,CAC3E,GAAG,EACC3H,EAAU,OAAOe,CAAM,GAAK,IAAM,CAE9B,IAAMyI,GADQrK,EAAW,YAAY4B,EAAO,KAAK,EAAI,CAAC,EAAIA,EAAO,OAC1C,IAAI,CAAC+G,EAAG7C,IAAU7G,EAAQ,KAAK,QAAQ6G,EAAM,SAAS,CAAC,CAAC,EAC/E,OAAO,KAAK,MAAMuE,EAAU7B,CAAO,CACvC,GAAG,EACC3H,EAAU,OAAOe,CAAM,EACZ,KAAK,OAAO4G,CAAO,GACtB,IAAM,CACV,IAAMlF,EAAO0H,EAAY,YAAYpJ,EAAQ,CAAE,gBAAiB,EAAM,CAAC,EACvE,GAAI0B,EAAK,SAAW,EAChB,OAAO,KAAK,MAAMkF,CAAO,EAC7B,IAAM6B,EAAW/G,EAAK,IAAKH,GAAQ,KAAK,QAAQA,CAAG,CAAC,EACpD,OAAO,KAAK,MAAMkH,EAAU7B,CAAO,CACvC,GAAG,CACf,CAEA,QAAQtI,EAAOsI,EAAU,CAAC,EAAG,CACzB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,UAAW,MAAOiB,EAAO,KAAM,OAAOA,CAAM,CAAC,CAClG,CAEA,UAAU0B,EAAQ4G,EAAU,CAAC,EAAG,CAC5B,MAAO,CAAE,GAAGgB,EAAU,IAAI3B,EAAU,KAAKjG,CAAM,EAAG,WAAW,EAAG,GAAG4G,CAAQ,CAC/E,CAEA,MAAMA,EAAU,CAAC,EAAG,CAChB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,QAAS,IAAK,CAAC,CAAE,CAAC,CACvE,CAEA,IAAI2C,EAAQ4G,EAAS,CACjB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,MAAO,IAAK4I,EAAU,KAAKjG,CAAM,CAAE,CAAC,CACzF,CAEA,KAAK4G,EAAU,CAAC,EAAG,CACf,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,OAAQ,KAAM,MAAO,CAAC,CAC3E,CAEA,OAAOuJ,EAAU,CAAC,EAAG,CACjB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,QAAS,CAAC,CAC/E,CAEA,OAAO+P,EAAYxG,EAAU,CAAC,EAAG,CAC7B,IAAMsH,EAAe,OAAO,oBAAoBd,CAAU,EACpDe,EAAeD,EAAa,OAAQ3M,GAAQtC,EAAU,UAAUmO,EAAW7L,CAAG,CAAC,CAAC,EAChF6M,EAAeF,EAAa,OAAQG,GAAS,CAACF,EAAa,SAASE,CAAI,CAAC,EACzEC,EAA6BrP,EAAU,QAAQ2H,EAAQ,oBAAoB,EAAI,CAAE,qBAAsBX,EAAU,KAAKW,EAAQ,oBAAoB,CAAE,EAAI,CAAC,EACzJN,EAAmB4H,EAAa,OAAO,CAAC3H,EAAKhF,KAAS,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAG0E,EAAU,KAAKmH,EAAW7L,CAAG,CAAC,CAAE,GAAI,CAAC,CAAC,EACnH,OAAO6M,EAAa,OAAS,EACvB,KAAK,OAAO,CAAE,GAAGxH,EAAS,GAAG0H,EAA4B,CAACjR,EAAQ,IAAI,EAAG,SAAU,KAAM,SAAU,WAAYiJ,EAAkB,SAAU8H,CAAa,CAAC,EACzJ,KAAK,OAAO,CAAE,GAAGxH,EAAS,GAAG0H,EAA4B,CAACjR,EAAQ,IAAI,EAAG,SAAU,KAAM,SAAU,WAAYiJ,CAAiB,CAAC,CAC3I,CAEA,KAAKtG,EAAQ8N,EAAYlH,EAAU,CAAC,EAAG,CACnC,IAAMlF,EAAOkI,EAAiB,QAAQkE,CAAU,EAEhD,OAAO7E,EAAU,IAAI,KAAK,QAAQhD,EAAU,KAAKjG,CAAM,EAAG,CAAC,MAAO3C,EAAQ,SAAS,CAAC,EAAIkR,GAAW,CAC3FnQ,EAAW,QAAQmQ,EAAO,QAAQ,IAClCA,EAAO,SAAWA,EAAO,SAAS,OAAQhN,GAAQ,CAACG,EAAK,SAASH,CAAG,CAAC,EACjEgN,EAAO,SAAS,SAAW,GAC3B,OAAOA,EAAO,UAEtB,QAAWhN,KAAO,OAAO,oBAAoBgN,EAAO,UAAU,EACtD7M,EAAK,SAASH,CAAG,GACjB,OAAOgN,EAAO,WAAWhN,CAAG,EAEpC,OAAO,KAAK,OAAOgN,CAAM,CAC7B,EAAG3H,CAAO,CACd,CAEA,QAAQ5G,EAAQ4G,EAAU,CAAC,EAAG,CAE1B,OAAOqC,EAAU,IAAI,KAAK,QAAQhD,EAAU,KAAKjG,CAAM,EAAG,CAAC,MAAO3C,EAAQ,SAAS,CAAC,EAAIkR,GAAW,CAC/F,IAAMnB,EAAa,OAAO,oBAAoBmB,EAAO,UAAU,EAAE,OAAO,CAAChI,EAAKhF,KACnE,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAG,KAAK,SAASgN,EAAO,WAAWhN,CAAG,CAAC,CAAE,GAC/D,CAAC,CAAC,EACL,OAAO,KAAK,OAAO6L,EAAY,KAAK,QAAQmB,EAAQ,CAAC,UAAU,CAAC,CAA0D,CAC9H,EAAG3H,CAAO,CACd,CAEA,KAAK5G,EAAQ8N,EAAYlH,EAAU,CAAC,EAAG,CACnC,IAAMlF,EAAOkI,EAAiB,QAAQkE,CAAU,EAEhD,OAAO7E,EAAU,IAAI,KAAK,QAAQhD,EAAU,KAAKjG,CAAM,EAAG,CAAC,MAAO3C,EAAQ,SAAS,CAAC,EAAIkR,GAAW,CAC3FnQ,EAAW,QAAQmQ,EAAO,QAAQ,IAClCA,EAAO,SAAWA,EAAO,SAAS,OAAQhN,GAAQG,EAAK,SAASH,CAAG,CAAC,EAChEgN,EAAO,SAAS,SAAW,GAC3B,OAAOA,EAAO,UAEtB,QAAWhN,KAAO,OAAO,oBAAoBgN,EAAO,UAAU,EACrD7M,EAAK,SAASH,CAAG,GAClB,OAAOgN,EAAO,WAAWhN,CAAG,EAEpC,OAAO,KAAK,OAAOgN,CAAM,CAC7B,EAAG3H,CAAO,CACd,CAEA,OAAOrF,EAAKvB,EAAQ4G,EAAU,CAAC,EAAG,CAE9B,OAAQ3H,EAAU,iBAAiBsC,CAAG,GAAK,IAAM,CAC7C,IAAM8G,EAAaC,EAAsB,WAAW/G,EAAI,OAAO,EAE/D,OAAOgH,EAAsB,MAAMF,CAAU,EACtC,KAAK,OAAO,CAAC,GAAGK,EAAyB,SAASL,CAAU,CAAC,EAAE,OAAO,CAAC9B,EAAKhF,KAAS,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAG0E,EAAU,KAAKjG,CAAM,CAAE,GAAI,CAAC,CAAC,EAAG4G,CAAO,EAC9I,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,SAAU,kBAAmB,CAAE,CAACkE,EAAI,OAAO,EAAG0E,EAAU,KAAKjG,CAAM,CAAE,CAAE,CAAC,CAC5I,GAAG,EACCf,EAAU,OAAOsC,CAAG,GAAK,IAAM,CAC3B,IAAMsH,EAAQgB,EAAc,QAAQtI,CAAG,EACvC,GAAItC,EAAU,cAAc4J,CAAK,EAAG,CAChC,IAAMuE,EAAavE,EAAM,MAAM,OAAO,CAACtC,EAAK6F,KAAa,CAAE,GAAG7F,EAAK,CAAC6F,EAAQ,KAAK,EAAGnG,EAAU,KAAKjG,CAAM,CAAE,GAAI,CAAC,CAAC,EACjH,OAAO,KAAK,OAAOoN,EAAY,CAAE,GAAGxG,EAAS,CAACvJ,EAAQ,IAAI,EAAG,QAAS,CAAC,CAC3E,MAEI,KAAK,MAAM,qDAAqD,CACxE,GAAG,EACC4B,EAAU,SAASsC,CAAG,EAEVnD,EAAW,SAASmD,EAAI,KAAK,GAAKnD,EAAW,SAASmD,EAAI,KAAK,EACjE,KAAK,OAAO,CAAE,CAACA,EAAI,KAAK,EAAG0E,EAAU,KAAKjG,CAAM,CAAE,EAAG4G,CAAO,EAC5D,KAAK,MAAM,4DAA4D,EAE7E3H,EAAU,SAASsC,CAAG,GAAKtC,EAAU,QAAQsC,CAAG,EACrC,KAAK,OAAO,CAAE,GAAGqF,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,SAAU,kBAAmB,CAAE,CAACA,EAAQ,kBAAkB,EAAG4I,EAAU,KAAKjG,CAAM,CAAE,CAAE,CAAC,EAExJf,EAAU,QAAQsC,CAAG,GAAK,IAAM,CAC5B,IAAM+I,EAAUlM,EAAW,YAAYmD,EAAI,OAAO,EAAIlE,EAAQ,mBAAqBkE,EAAI,QACvF,OAAO,KAAK,OAAO,CAAE,GAAGqF,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,SAAU,kBAAmB,CAAE,CAACiN,CAAO,EAAGrE,EAAU,KAAKjG,CAAM,CAAE,CAAE,CAAC,CACzI,GAAG,EACC,KAAK,MAAM,CACnC,CAEA,UAAUkJ,EAAUtC,EAAU,CAAC,EAAG,CAC1BxI,EAAW,YAAYwI,EAAQ,GAAG,IAClCA,EAAQ,IAAM,IAAIiG,GAAa,IACnC,IAAM2B,EAAWtF,EAAS,CAAE,CAAC7L,EAAQ,IAAI,EAAG,OAAQ,KAAM,GAAGuJ,EAAQ,GAAG,EAAG,CAAC,EAC5E,OAAA4H,EAAS,IAAM5H,EAAQ,IAChB,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,YAAa,GAAGmR,CAAS,CAAC,CAC/E,CAEA,IAAIV,EAAYlH,EAAU,CAAC,EAAG,CAC1B,OAAIxI,EAAW,SAAS0P,CAAU,EACvB,KAAK,OAAO,CAAE,GAAGlH,EAAS,CAACvJ,EAAQ,IAAI,EAAG,MAAO,KAAMyQ,CAAW,CAAC,GAC1E1P,EAAW,YAAY0P,EAAW,GAAG,GACrC,KAAK,MAAM,2CAA2C,EACnD,KAAK,OAAO,CAAE,GAAGlH,EAAS,CAACvJ,EAAQ,IAAI,EAAG,MAAO,KAAMyQ,EAAW,GAAI,CAAC,EAClF,CAEA,SAAS9N,EAAQ4G,EAAU,CAAC,EAAG,CAE3B,OAAOqC,EAAU,IAAI,KAAK,QAAQhD,EAAU,KAAKjG,CAAM,EAAG,CAAC,MAAO3C,EAAQ,SAAS,CAAC,EAAIkR,GAAW,CAC/F,IAAMnB,EAAa,OAAO,oBAAoBmB,EAAO,UAAU,EAAE,OAAO,CAAChI,EAAKhF,KACnE,CAAE,GAAGgF,EAAK,CAAChF,CAAG,EAAG,KAAK,QAAQgN,EAAO,WAAWhN,CAAG,EAAG,CAAClE,EAAQ,QAAQ,CAAC,CAAE,GAClF,CAAC,CAAC,EACL,OAAO,KAAK,OAAO+P,EAAYmB,CAAgE,CACnG,EAAG3H,CAAO,CACd,CAEA,KAAK5G,EAAQ,CACT,OAAQf,EAAU,OAAOe,CAAM,GAAK,CAAC5B,EAAW,YAAY4B,EAAO,KAAK,EAAIiG,EAAU,KAAKjG,EAAO,KAAK,EAAIf,EAAU,WAAWe,CAAM,EAAIiG,EAAU,KAAKjG,EAAO,KAAK,EAAIf,EAAU,OAAOe,CAAM,EAAIiG,EAAU,KAAKjG,EAAO,KAAK,EAAI,CAAC,CACxO,CAEA,OAAO4G,EAAU,CAAC,EAAG,CACjB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,QAAS,CAAC,CAC/E,CAEA,gBAAgByQ,EAAYlH,EAAU,CAAC,EAAG,CAEtC,IAAM0D,EAAUlM,EAAW,SAAS0P,CAAU,EACxC/D,EAAuB,OAAOkC,GAAyB,MAAM6B,CAAU,CAAC,EACxE/D,EAAuB,OAAO+D,CAAU,EAC9C,OAAO,KAAK,OAAO,CAAE,GAAGlH,EAAS,CAACvJ,EAAQ,IAAI,EAAG,kBAAmB,KAAM,SAAU,QAAAiN,CAAQ,CAAC,CACjG,CAEA,UAAUtK,EAAQ,CACd,OAAO,IAAIwM,GAAuBxM,CAAM,CAC5C,CAEA,MAAMyH,EAAOb,EAAU,CAAC,EAAG,CACvB,GAAM,CAAC6H,EAAiBC,EAAUC,CAAQ,EAAI,CAAC,GAAOlH,EAAM,OAAQA,EAAM,MAAM,EAC1EmH,EAAc3I,EAAU,KAAKwB,CAAK,EAElCzH,EAAUyH,EAAM,OAAS,EAC3B,CAAE,GAAGb,EAAS,CAACvJ,EAAQ,IAAI,EAAG,QAAS,KAAM,QAAS,MAAOuR,EAAa,gBAAAH,EAAiB,SAAAC,EAAU,SAAAC,CAAS,EAC9G,CAAE,GAAG/H,EAAS,CAACvJ,EAAQ,IAAI,EAAG,QAAS,KAAM,QAAS,SAAAqR,EAAU,SAAAC,CAAS,EAC7E,OAAO,KAAK,OAAO3O,CAAM,CAC7B,CAEA,aAAaA,EAAQ4G,EAAU,CAAC,EAAG,CAC/B,MAAO,CAAE,GAAGgB,EAAU,IAAI3B,EAAU,KAAKjG,CAAM,EAAG,cAAc,EAAG,GAAG4G,CAAQ,CAClF,CAEA,MAAMiC,EAAOjC,EAAU,CAAC,EAAG,CAEvB,OAAO3H,EAAU,iBAAiB4J,CAAK,EACjCjD,EAAwB,QAAQiD,CAAK,GACpC,IAAM,CACL,IAAM0E,EAAQ1E,EACd,GAAI0E,EAAM,SAAW,EACjB,OAAO,KAAK,MAAM3G,CAAO,EAC7B,GAAI2G,EAAM,SAAW,EACjB,OAAO,KAAK,OAAOtH,EAAU,KAAKsH,EAAM,CAAC,EAAG3G,CAAO,CAAC,EACxD,IAAMiI,EAAc5I,EAAU,KAAKsH,CAAK,EACxC,OAAO,KAAK,OAAO,CAAE,GAAG3G,EAAS,CAACvJ,EAAQ,IAAI,EAAG,QAAS,MAAOwR,CAAY,CAAC,CAClF,GAAG,CACX,CAEA,QAAQjI,EAAU,CAAC,EAAG,CAClB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,CAAC,CAChE,CAEA,OAAOuJ,EAAU,CAAC,EAAG,CACjB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAGuJ,EAAQvJ,EAAQ,IAAI,GAAK,QAAS,CAAC,CACxF,CAEA,UAAU2C,EAAQ4G,EAAU,CAAC,EAAG,CAC5B,MAAO,CAAE,GAAGgB,EAAU,IAAI3B,EAAU,KAAKjG,CAAM,EAAG,WAAW,EAAG,GAAG4G,CAAQ,CAC/E,CACJ,EACAvJ,EAAQ,gBAAkB4P,EAI1B,IAAM6B,GAAN,cAAoC7B,CAAgB,CAEhD,cAAcxF,EAAOb,EAAU,CAAC,EAAG,CAC/B,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,gBAAiB,KAAM,gBAAiB,MAAO4I,EAAU,KAAKwB,CAAK,CAAE,CAAC,CAC3H,CAEA,QAAQzH,EAAQ4G,EAAU,CAAC,EAAG,CAE1B,IAAMmI,EAAUhH,GAASA,EAAK,OAAS,GAAK,IAAM,CAC9C,GAAM,CAACe,EAAG,GAAGC,CAAC,EAAIhB,EAClB,MAAO,CAAC,KAAK,QAAQe,CAAC,EAAG,GAAGiG,EAAOhG,CAAC,CAAC,CACzC,GAAG,EAAIhB,EAEP,OAAQ9I,EAAU,WAAWe,CAAM,EAAI3C,EAAQ,KAAK,UAAU0R,EAAO/O,EAAO,KAAK,CAAC,EAC9Ef,EAAU,OAAOe,CAAM,EAAI3C,EAAQ,KAAK,MAAM0R,EAAO/O,EAAO,KAAK,CAAC,EAC9Df,EAAU,SAASe,CAAM,EAAI,KAAK,QAAQA,EAAO,IAAI,EACjDiG,EAAU,KAAKjG,EAAQ4G,CAAO,CAC9C,CAEA,OAAOA,EAAU,CAAC,EAAG,CACjB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,QAAS,CAAC,CAC/E,CAEA,sBAAsB2C,EAAQ4G,EAAU,CAAC,EAAG,CACxC,OAAO,KAAK,MAAM,CAAC,GAAG5G,EAAO,UAAU,EAAG,CAAE,GAAG4G,CAAQ,CAAC,CAC5D,CAEA,YAAYoI,EAAYC,EAASrI,EAAS,CACtC,GAAM,CAACsI,EAAkBC,CAAa,EAAI,CAAClJ,EAAU,KAAK+I,CAAU,EAAG/I,EAAU,KAAKgJ,CAAO,CAAC,EAC9F,OAAO,KAAK,OAAO,CAAE,GAAGrI,EAAS,CAACvJ,EAAQ,IAAI,EAAG,cAAe,KAAM,cAAe,WAAY6R,EAAkB,QAASC,CAAc,CAAC,CAC/I,CAEA,KAAKvI,EAAU,CAAC,EAAG,CACf,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,OAAQ,KAAM,MAAO,CAAC,CAC3E,CAEA,SAAS2R,EAAYC,EAASrI,EAAS,CACnC,GAAM,CAACsI,EAAkBC,CAAa,EAAI,CAAClJ,EAAU,KAAK+I,CAAU,EAAG/I,EAAU,KAAKgJ,CAAO,CAAC,EAC9F,OAAO,KAAK,OAAO,CAAE,GAAGrI,EAAS,CAACvJ,EAAQ,IAAI,EAAG,WAAY,KAAM,WAAY,WAAY6R,EAAkB,QAASC,CAAc,CAAC,CACzI,CAEA,aAAanP,EAAQ4G,EAAU,CAAC,EAAG,CAC/B,OAAOX,EAAU,KAAKjG,EAAO,QAAS4G,CAAO,CACjD,CAEA,SAASa,EAAOb,EAAU,CAAC,EAAG,CAC1B,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,WAAY,KAAM,WAAY,MAAO4I,EAAU,KAAKwB,CAAK,CAAE,CAAC,CACjH,CAEA,WAAWzH,EAAQ4G,EAAU,CAAC,EAAG,CAC7B,OAAO,KAAK,MAAM5G,EAAO,WAAY,CAAE,GAAG4G,CAAQ,CAAC,CACvD,CAEA,QAAQyG,EAAMzG,EAAU,CAAC,EAAG,CACxB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,UAAW,KAAM,UAAW,KAAM4I,EAAU,KAAKoH,CAAI,CAAE,CAAC,CAC7G,CAEA,OAAOS,EAAYlH,EAAU,CAAC,EAAG,CAC7B,IAAM0D,EAAUlM,EAAW,SAAS0P,CAAU,EAAIA,EAAaA,EAAW,OAC1E,OAAO,KAAK,OAAO,CAAE,GAAGlH,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,SAAU,QAAAiN,CAAQ,CAAC,CACxF,CAIA,MAAM8E,EAAOxI,EAAU,CAAC,EAAG,CACvB,OAAO,KAAK,OAAOwI,EAAOxI,CAAO,CACrC,CAEA,WAAW5G,EAAQ4G,EAAU,CAAC,EAAG,CAC7B,OAAOX,EAAU,KAAKjG,EAAO,QAAS4G,CAAO,CACjD,CAEA,OAAOA,EAAS,CACZ,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,SAAU,KAAM,QAAS,CAAC,CAC/E,CAEA,UAAUuJ,EAAU,CAAC,EAAG,CACpB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,YAAa,KAAM,WAAY,CAAC,CACrF,CAEA,WAAWuJ,EAAU,CAAC,EAAG,CACrB,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,aAAc,KAAM,YAAa,CAAC,CACvF,CAEA,KAAKuJ,EAAU,CAAC,EAAG,CACf,OAAO,KAAK,OAAO,CAAE,GAAGA,EAAS,CAACvJ,EAAQ,IAAI,EAAG,OAAQ,KAAM,MAAO,CAAC,CAC3E,CACJ,EACAA,EAAQ,sBAAwByR,GAEhCzR,EAAQ,SAAW,IAAI4P,EAEvB5P,EAAQ,KAAO,IAAIyR,EAAsB,CAAA,CAAA,EC3zEzCO,GAA0BC,GAAAnS,GAAA,EAAA,CAAA,EAQpB,CAAE,OAAQoS,GAAU,SAAUC,GAAY,QAASC,GAAW,OAAQC,GAAU,OAAQC,EAAS,EAAIN,GAAAO,KAC9FC,GAAuBN,GAAS,KAAKF,GAAAO,IAAC,EACtCE,GAAuBH,GAAS,KAAKN,GAAAO,IAAC,EACtCG,GAAuBL,GAAS,KAAKL,GAAAO,IAAC,EACtCI,GAAyBR,GAAW,KAAKH,GAAAO,IAAC,EAC1CK,GAAyBR,GAAU,KAAKJ,GAAAO,IAAC,EAEzCM,GAAmCL,GAAI,EACvCM,GAAmCL,GAAI,EACvCM,GAAqCH,GAAK,EAuChD,SAASI,GAAiBC,EAA6C,CAC7E,OAAI,MAAM,QAAQA,CAAW,EAAUA,EAC3B,CAACA,CAAW,CACzB,CC3DA,IAAAC,GAAAC,GAAA,CAAA,8FAAAC,EAAA,CAAA,aAEA,OAAO,eAAeA,EAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAED,IAAIC,EAAU,OAAO,QAAW,YAAc,OAAO,OAAO,UAAa,SAAW,SAAUC,EAAK,CAAE,OAAO,OAAOA,CAAK,EAAI,SAAUA,EAAK,CAAE,OAAOA,GAAO,OAAO,QAAW,YAAcA,EAAI,cAAgB,QAAUA,IAAQ,OAAO,UAAY,SAAW,OAAOA,CAAK,EAEvQC,EAAY,OAAO,OAAW,KAAe,OAAO,OAAO,SAAa,IAExEC,EAAS,OAAO,QAAY,KAAe,QAAQ,UAAY,MAAQ,QAAQ,SAAS,MAAQ,KAEhGC,GAAe,OAAO,KAAS,IAAc,YAAcJ,EAAQ,IAAI,KAAO,UAAY,KAAK,aAAe,KAAK,YAAY,OAAS,6BAMxIK,EAAU,OAAO,OAAW,KAAe,OAAO,OAAS,UAAY,OAAO,UAAc,MAAgB,UAAU,UAAU,SAAS,SAAS,GAAK,UAAU,UAAU,SAAS,OAAO,GAE3LC,EAAS,OAAO,KAAS,KAAe,OAAO,KAAK,QAAY,KAAe,OAAO,KAAK,QAAQ,KAAS,IAEhHP,EAAQ,UAAYG,EACpBH,EAAQ,YAAcK,EACtBL,EAAQ,OAASI,EACjBJ,EAAQ,QAAUM,EAClBN,EAAQ,OAASO,CAAA,CAAA,CAAA,EC1BjBC,GAAAT,GAAA,CAAA,gHAAAC,EAAAS,EAAA,CAAA,aAEAA,EAAO,QAAU,SAAUC,EAAMC,EAAM,CAC9BA,IAAMA,EAAO,CAAC,GACf,OAAOA,GAAS,aAAYA,EAAO,CAAE,IAAKA,CAAK,GACnD,IAAIC,EAAU,OAAOD,EAAK,QAAW,UAAaA,EAAK,OAAS,GAE5DE,EAAMF,EAAK,KAAQ,SAAUG,EAAG,CAChC,OAAO,SAAUC,EAAM,CACnB,OAAO,SAAUC,EAAGC,EAAG,CACnB,IAAIC,EAAO,CAAE,IAAKF,EAAG,MAAOD,EAAKC,CAAC,CAAE,EAChCG,EAAO,CAAE,IAAKF,EAAG,MAAOF,EAAKE,CAAC,CAAE,EACpC,OAAOH,EAAEI,EAAMC,CAAI,CACvB,CACJ,CACJ,EAAGR,EAAK,GAAG,EAEPS,EAAO,CAAC,EACZ,OAAQ,SAASC,EAAWN,EAAM,CAK9B,GAJIA,GAAQA,EAAK,QAAU,OAAOA,EAAK,QAAW,aAC9CA,EAAOA,EAAK,OAAO,GAGnBA,IAAS,OACb,IAAI,OAAOA,GAAQ,SAAU,OAAO,SAASA,CAAI,EAAI,GAAKA,EAAO,OACjE,GAAI,OAAOA,GAAS,SAAU,OAAO,KAAK,UAAUA,CAAI,EAExD,IAAIO,EAAGC,EACP,GAAI,MAAM,QAAQR,CAAI,EAAG,CAErB,IADAQ,EAAM,IACDD,EAAI,EAAGA,EAAIP,EAAK,OAAQO,IACrBA,IAAGC,GAAO,KACdA,GAAOF,EAAUN,EAAKO,CAAC,CAAC,GAAK,OAEjC,OAAOC,EAAM,GACjB,CAEA,GAAIR,IAAS,KAAM,MAAO,OAE1B,GAAIK,EAAK,QAAQL,CAAI,IAAM,GAAI,CAC3B,GAAIH,EAAQ,OAAO,KAAK,UAAU,WAAW,EAC7C,MAAM,IAAI,UAAU,uCAAuC,CAC/D,CAEA,IAAIY,EAAYJ,EAAK,KAAKL,CAAI,EAAI,EAC9BU,EAAO,OAAO,KAAKV,CAAI,EAAE,KAAKF,GAAOA,EAAIE,CAAI,CAAC,EAElD,IADAQ,EAAM,GACDD,EAAI,EAAGA,EAAIG,EAAK,OAAQH,IAAK,CAC9B,IAAII,EAAMD,EAAKH,CAAC,EACZK,EAAQN,EAAUN,EAAKW,CAAG,CAAC,EAE1BC,IACDJ,IAAKA,GAAO,KAChBA,GAAO,KAAK,UAAUG,CAAG,EAAI,IAAMC,EACvC,CACA,OAAAP,EAAK,OAAOI,EAAW,CAAC,EACjB,IAAMD,EAAM,IACvB,EAAGb,CAAI,CACX,CAAA,CAAA,CAAA,EC1DAkB,GAAA7B,GAAA,CAAA,sGAAAC,EAAAS,EAAA,CAAA,aAEA,GAAM,CAAE,eAAAoB,CAAe,EAAI,OAAO,UAE5BR,EAAYS,EAAU,EAG5BT,EAAU,UAAYS,EAEtBT,EAAU,UAAYA,EAGtBA,EAAU,QAAUA,EAGpBrB,EAAQ,UAAYqB,EAEpBrB,EAAQ,UAAY8B,EAEpBrB,EAAO,QAAUY,EAGjB,IAAMU,EAA2B,oHAIjC,SAASC,EAAWC,EAAK,CAEvB,OAAIA,EAAI,OAAS,KAAQ,CAACF,EAAyB,KAAKE,CAAG,EAClD,IAAIA,CAAG,IAET,KAAK,UAAUA,CAAG,CAC3B,CAEA,SAASC,EAAYC,EAAO,CAG1B,GAAIA,EAAM,OAAS,IACjB,OAAOA,EAAM,KAAK,EAEpB,QAASb,EAAI,EAAGA,EAAIa,EAAM,OAAQb,IAAK,CACrC,IAAMc,EAAeD,EAAMb,CAAC,EACxBe,EAAWf,EACf,KAAOe,IAAa,GAAKF,EAAME,EAAW,CAAC,EAAID,GAC7CD,EAAME,CAAQ,EAAIF,EAAME,EAAW,CAAC,EACpCA,IAEFF,EAAME,CAAQ,EAAID,CACpB,CACA,OAAOD,CACT,CAEA,IAAMG,EACJ,OAAO,yBACL,OAAO,eACL,OAAO,eACL,IAAI,SACN,CACF,EACA,OAAO,WACT,EAAE,IAEJ,SAASC,EAAyBZ,EAAO,CACvC,OAAOW,EAAwC,KAAKX,CAAK,IAAM,QAAaA,EAAM,SAAW,CAC/F,CAEA,SAASa,EAAqBL,EAAOM,EAAWC,EAAgB,CAC1DP,EAAM,OAASO,IACjBA,EAAiBP,EAAM,QAEzB,IAAMQ,EAAaF,IAAc,IAAM,GAAK,IACxCG,EAAM,OAAOD,CAAU,GAAGR,EAAM,CAAC,CAAC,GACtC,QAASb,EAAI,EAAGA,EAAIoB,EAAgBpB,IAClCsB,GAAO,GAAGH,CAAS,IAAInB,CAAC,KAAKqB,CAAU,GAAGR,EAAMb,CAAC,CAAC,GAEpD,OAAOsB,CACT,CAEA,SAASC,EAAwBC,EAAS,CACxC,GAAIjB,EAAe,KAAKiB,EAAS,eAAe,EAAG,CACjD,IAAMC,EAAgBD,EAAQ,cAC9B,GAAI,OAAOC,GAAkB,SAC3B,MAAO,IAAIA,CAAa,IAE1B,GAAIA,GAAiB,KACnB,OAAOA,EAET,GAAIA,IAAkB,OAASA,IAAkB,UAC/C,MAAO,CACL,UAAY,CACV,MAAM,IAAI,UAAU,uCAAuC,CAC7D,CACF,EAEF,MAAM,IAAI,UAAU,oFAAoF,CAC1G,CACA,MAAO,cACT,CAEA,SAASC,EAAkBF,EAASpB,EAAK,CACvC,IAAIC,EACJ,GAAIE,EAAe,KAAKiB,EAASpB,CAAG,IAClCC,EAAQmB,EAAQpB,CAAG,EACf,OAAOC,GAAU,WACnB,MAAM,IAAI,UAAU,QAAQD,CAAG,oCAAoC,EAGvE,OAAOC,IAAU,OAAY,GAAOA,CACtC,CAEA,SAASsB,EAA0BH,EAASpB,EAAK,CAC/C,IAAIC,EACJ,GAAIE,EAAe,KAAKiB,EAASpB,CAAG,EAAG,CAErC,GADAC,EAAQmB,EAAQpB,CAAG,EACf,OAAOC,GAAU,SACnB,MAAM,IAAI,UAAU,QAAQD,CAAG,mCAAmC,EAEpE,GAAI,CAAC,OAAO,UAAUC,CAAK,EACzB,MAAM,IAAI,UAAU,QAAQD,CAAG,+BAA+B,EAEhE,GAAIC,EAAQ,EACV,MAAM,IAAI,WAAW,QAAQD,CAAG,yBAAyB,CAE7D,CACA,OAAOC,IAAU,OAAY,IAAWA,CAC1C,CAEA,SAASuB,EAAcC,EAAQ,CAC7B,OAAIA,IAAW,EACN,SAEF,GAAGA,CAAM,QAClB,CAEA,SAASC,EAAsBC,EAAe,CAC5C,IAAMC,EAAc,IAAI,IACxB,QAAW3B,KAAS0B,GACd,OAAO1B,GAAU,UAAY,OAAOA,GAAU,WAChD2B,EAAY,IAAI,OAAO3B,CAAK,CAAC,EAGjC,OAAO2B,CACT,CAEA,SAASC,EAAiBT,EAAS,CACjC,GAAIjB,EAAe,KAAKiB,EAAS,QAAQ,EAAG,CAC1C,IAAMnB,EAAQmB,EAAQ,OACtB,GAAI,OAAOnB,GAAU,UACnB,MAAM,IAAI,UAAU,+CAA+C,EAErE,GAAIA,EACF,OAAQA,GAAU,CAChB,IAAI6B,EAAU,uDAAuD,OAAO7B,CAAK,GACjF,MAAI,OAAOA,GAAU,aAAY6B,GAAW,KAAK7B,EAAM,SAAS,CAAC,KAC3D,IAAI,MAAM6B,CAAO,CACzB,CAEJ,CACF,CAEA,SAAS1B,EAAWgB,EAAS,CAC3BA,EAAU,CAAE,GAAGA,CAAQ,EACvB,IAAMW,EAAOF,EAAgBT,CAAO,EAChCW,IACEX,EAAQ,SAAW,SACrBA,EAAQ,OAAS,IAEb,kBAAmBA,IACvBA,EAAQ,cAAgB,QAG5B,IAAMC,EAAgBF,EAAuBC,CAAO,EAC9CY,EAASV,EAAiBF,EAAS,QAAQ,EAC3Ca,EAAgBX,EAAiBF,EAAS,eAAe,EACzDc,EAAeX,EAAyBH,EAAS,cAAc,EAC/DJ,EAAiBO,EAAyBH,EAAS,gBAAgB,EAEzE,SAASe,GAAqBnC,GAAKoC,EAAQC,EAAOC,GAAUC,EAAQC,EAAa,CAC/E,IAAIvC,GAAQmC,EAAOpC,EAAG,EAOtB,OALI,OAAOC,IAAU,UAAYA,KAAU,MAAQ,OAAOA,GAAM,QAAW,aACzEA,GAAQA,GAAM,OAAOD,EAAG,GAE1BC,GAAQqC,GAAS,KAAKF,EAAQpC,GAAKC,EAAK,EAEhC,OAAOA,GAAO,CACpB,IAAK,SACH,OAAOK,EAAUL,EAAK,EACxB,IAAK,SAAU,CACb,GAAIA,KAAU,KACZ,MAAO,OAET,GAAIoC,EAAM,QAAQpC,EAAK,IAAM,GAC3B,OAAOoB,EAGT,IAAIH,EAAM,GACNuB,EAAO,IACLC,EAAsBF,EAE5B,GAAI,MAAM,QAAQvC,EAAK,EAAG,CACxB,GAAIA,GAAM,SAAW,EACnB,MAAO,KAET,GAAIiC,EAAeG,EAAM,OAAS,EAChC,MAAO,YAETA,EAAM,KAAKpC,EAAK,EACZsC,IAAW,KACbC,GAAeD,EACfrB,GAAO;EAAKsB,CAAW,GACvBC,EAAO;EAAMD,CAAW,IAE1B,IAAMG,EAA2B,KAAK,IAAI1C,GAAM,OAAQe,CAAc,EAClEpB,EAAI,EACR,KAAOA,EAAI+C,EAA2B,EAAG/C,IAAK,CAC5C,IAAMgD,EAAMT,GAAoB,OAAOvC,CAAC,EAAGK,GAAOoC,EAAOC,GAAUC,EAAQC,CAAW,EACtFtB,GAAO0B,IAAQ,OAAYA,EAAM,OACjC1B,GAAOuB,CACT,CACA,IAAMG,EAAMT,GAAoB,OAAOvC,CAAC,EAAGK,GAAOoC,EAAOC,GAAUC,EAAQC,CAAW,EAEtF,GADAtB,GAAO0B,IAAQ,OAAYA,EAAM,OAC7B3C,GAAM,OAAS,EAAIe,EAAgB,CACrC,IAAM6B,EAAc5C,GAAM,OAASe,EAAiB,EACpDE,GAAO,GAAGuB,CAAI,QAAQjB,EAAaqB,CAAW,CAAC,mBACjD,CACA,OAAIN,IAAW,KACbrB,GAAO;EAAKwB,CAAmB,IAEjCL,EAAM,IAAI,EACH,IAAInB,CAAG,GAChB,CAEA,IAAInB,EAAO,OAAO,KAAKE,EAAK,EACtB6C,EAAY/C,EAAK,OACvB,GAAI+C,IAAc,EAChB,MAAO,KAET,GAAIZ,EAAeG,EAAM,OAAS,EAChC,MAAO,aAET,IAAIpB,EAAa,GACbF,EAAY,GACZwB,IAAW,KACbC,GAAeD,EACfE,EAAO;EAAMD,CAAW,GACxBvB,EAAa,KAEf,IAAM8B,EAA+B,KAAK,IAAID,EAAW9B,CAAc,EACnEiB,GAAiB,CAACpB,EAAwBZ,EAAK,IACjDF,EAAOS,EAAWT,CAAI,GAExBsC,EAAM,KAAKpC,EAAK,EAChB,QAASL,EAAI,EAAGA,EAAImD,EAA8BnD,IAAK,CACrD,IAAMI,EAAMD,EAAKH,CAAC,EACZgD,EAAMT,GAAoBnC,EAAKC,GAAOoC,EAAOC,GAAUC,EAAQC,CAAW,EAC5EI,IAAQ,SACV1B,GAAO,GAAGH,CAAS,GAAGT,EAAUN,CAAG,CAAC,IAAIiB,CAAU,GAAG2B,CAAG,GACxD7B,EAAY0B,EAEhB,CACA,GAAIK,EAAY9B,EAAgB,CAC9B,IAAM6B,EAAcC,EAAY9B,EAChCE,GAAO,GAAGH,CAAS,SAASE,CAAU,IAAIO,EAAaqB,CAAW,CAAC,oBACnE9B,EAAY0B,CACd,CACA,OAAIF,IAAW,IAAMxB,EAAU,OAAS,IACtCG,EAAM;EAAKsB,CAAW,GAAGtB,CAAG;EAAKwB,CAAmB,IAEtDL,EAAM,IAAI,EACH,IAAInB,CAAG,GAChB,CACA,IAAK,SACH,OAAO,SAASjB,EAAK,EAAI,OAAOA,EAAK,EAAI8B,EAAOA,EAAK9B,EAAK,EAAI,OAChE,IAAK,UACH,OAAOA,KAAU,GAAO,OAAS,QACnC,IAAK,YACH,OACF,IAAK,SACH,GAAI+B,EACF,OAAO,OAAO/B,EAAK,EAGvB,QACE,OAAO8B,EAAOA,EAAK9B,EAAK,EAAI,MAChC,CACF,CAEA,SAAS+C,EAAwBhD,GAAKC,EAAOoC,EAAOC,GAAUC,EAAQC,EAAa,CAKjF,OAJI,OAAOvC,GAAU,UAAYA,IAAU,MAAQ,OAAOA,EAAM,QAAW,aACzEA,EAAQA,EAAM,OAAOD,EAAG,GAGlB,OAAOC,EAAO,CACpB,IAAK,SACH,OAAOK,EAAUL,CAAK,EACxB,IAAK,SAAU,CACb,GAAIA,IAAU,KACZ,MAAO,OAET,GAAIoC,EAAM,QAAQpC,CAAK,IAAM,GAC3B,OAAOoB,EAGT,IAAMqB,GAAsBF,EACxBtB,EAAM,GACNuB,EAAO,IAEX,GAAI,MAAM,QAAQxC,CAAK,EAAG,CACxB,GAAIA,EAAM,SAAW,EACnB,MAAO,KAET,GAAIiC,EAAeG,EAAM,OAAS,EAChC,MAAO,YAETA,EAAM,KAAKpC,CAAK,EACZsC,IAAW,KACbC,GAAeD,EACfrB,GAAO;EAAKsB,CAAW,GACvBC,EAAO;EAAMD,CAAW,IAE1B,IAAMG,EAA2B,KAAK,IAAI1C,EAAM,OAAQe,CAAc,EAClEpB,EAAI,EACR,KAAOA,EAAI+C,EAA2B,EAAG/C,IAAK,CAC5C,IAAMgD,EAAMI,EAAuB,OAAOpD,CAAC,EAAGK,EAAML,CAAC,EAAGyC,EAAOC,GAAUC,EAAQC,CAAW,EAC5FtB,GAAO0B,IAAQ,OAAYA,EAAM,OACjC1B,GAAOuB,CACT,CACA,IAAMG,EAAMI,EAAuB,OAAOpD,CAAC,EAAGK,EAAML,CAAC,EAAGyC,EAAOC,GAAUC,EAAQC,CAAW,EAE5F,GADAtB,GAAO0B,IAAQ,OAAYA,EAAM,OAC7B3C,EAAM,OAAS,EAAIe,EAAgB,CACrC,IAAM6B,EAAc5C,EAAM,OAASe,EAAiB,EACpDE,GAAO,GAAGuB,CAAI,QAAQjB,EAAaqB,CAAW,CAAC,mBACjD,CACA,OAAIN,IAAW,KACbrB,GAAO;EAAKwB,EAAmB,IAEjCL,EAAM,IAAI,EACH,IAAInB,CAAG,GAChB,CACAmB,EAAM,KAAKpC,CAAK,EAChB,IAAIgB,EAAa,GACbsB,IAAW,KACbC,GAAeD,EACfE,EAAO;EAAMD,CAAW,GACxBvB,EAAa,KAEf,IAAIF,EAAY,GAChB,QAAWf,KAAOsC,GAAU,CAC1B,IAAMM,EAAMI,EAAuBhD,EAAKC,EAAMD,CAAG,EAAGqC,EAAOC,GAAUC,EAAQC,CAAW,EACpFI,IAAQ,SACV1B,GAAO,GAAGH,CAAS,GAAGT,EAAUN,CAAG,CAAC,IAAIiB,CAAU,GAAG2B,CAAG,GACxD7B,EAAY0B,EAEhB,CACA,OAAIF,IAAW,IAAMxB,EAAU,OAAS,IACtCG,EAAM;EAAKsB,CAAW,GAAGtB,CAAG;EAAKwB,EAAmB,IAEtDL,EAAM,IAAI,EACH,IAAInB,CAAG,GAChB,CACA,IAAK,SACH,OAAO,SAASjB,CAAK,EAAI,OAAOA,CAAK,EAAI8B,EAAOA,EAAK9B,CAAK,EAAI,OAChE,IAAK,UACH,OAAOA,IAAU,GAAO,OAAS,QACnC,IAAK,YACH,OACF,IAAK,SACH,GAAI+B,EACF,OAAO,OAAO/B,CAAK,EAGvB,QACE,OAAO8B,EAAOA,EAAK9B,CAAK,EAAI,MAChC,CACF,CAEA,SAASgD,EAAiBjD,GAAKC,EAAOoC,EAAOE,GAAQC,EAAa,CAChE,OAAQ,OAAOvC,EAAO,CACpB,IAAK,SACH,OAAOK,EAAUL,CAAK,EACxB,IAAK,SAAU,CACb,GAAIA,IAAU,KACZ,MAAO,OAET,GAAI,OAAOA,EAAM,QAAW,WAAY,CAGtC,GAFAA,EAAQA,EAAM,OAAOD,EAAG,EAEpB,OAAOC,GAAU,SACnB,OAAOgD,EAAgBjD,GAAKC,EAAOoC,EAAOE,GAAQC,CAAW,EAE/D,GAAIvC,IAAU,KACZ,MAAO,MAEX,CACA,GAAIoC,EAAM,QAAQpC,CAAK,IAAM,GAC3B,OAAOoB,EAET,IAAMqB,EAAsBF,EAE5B,GAAI,MAAM,QAAQvC,CAAK,EAAG,CACxB,GAAIA,EAAM,SAAW,EACnB,MAAO,KAET,GAAIiC,EAAeG,EAAM,OAAS,EAChC,MAAO,YAETA,EAAM,KAAKpC,CAAK,EAChBuC,GAAeD,GACf,IAAIrB,EAAM;EAAKsB,CAAW,GACpBC,EAAO;EAAMD,CAAW,GACxBG,EAA2B,KAAK,IAAI1C,EAAM,OAAQe,CAAc,EAClEpB,EAAI,EACR,KAAOA,EAAI+C,EAA2B,EAAG/C,IAAK,CAC5C,IAAMgD,EAAMK,EAAgB,OAAOrD,CAAC,EAAGK,EAAML,CAAC,EAAGyC,EAAOE,GAAQC,CAAW,EAC3EtB,GAAO0B,IAAQ,OAAYA,EAAM,OACjC1B,GAAOuB,CACT,CACA,IAAMG,EAAMK,EAAgB,OAAOrD,CAAC,EAAGK,EAAML,CAAC,EAAGyC,EAAOE,GAAQC,CAAW,EAE3E,GADAtB,GAAO0B,IAAQ,OAAYA,EAAM,OAC7B3C,EAAM,OAAS,EAAIe,EAAgB,CACrC,IAAM6B,EAAc5C,EAAM,OAASe,EAAiB,EACpDE,GAAO,GAAGuB,CAAI,QAAQjB,EAAaqB,CAAW,CAAC,mBACjD,CACA3B,OAAAA,GAAO;EAAKwB,CAAmB,GAC/BL,EAAM,IAAI,EACH,IAAInB,CAAG,GAChB,CAEA,IAAInB,GAAO,OAAO,KAAKE,CAAK,EACtB6C,EAAY/C,GAAK,OACvB,GAAI+C,IAAc,EAChB,MAAO,KAET,GAAIZ,EAAeG,EAAM,OAAS,EAChC,MAAO,aAETG,GAAeD,GACf,IAAME,EAAO;EAAMD,CAAW,GAC1BtB,EAAM,GACNH,EAAY,GACZgC,EAA+B,KAAK,IAAID,EAAW9B,CAAc,EACjEH,EAAwBZ,CAAK,IAC/BiB,GAAOJ,EAAoBb,EAAOwC,EAAMzB,CAAc,EACtDjB,GAAOA,GAAK,MAAME,EAAM,MAAM,EAC9B8C,GAAgC9C,EAAM,OACtCc,EAAY0B,GAEVR,IACFlC,GAAOS,EAAWT,EAAI,GAExBsC,EAAM,KAAKpC,CAAK,EAChB,QAASL,EAAI,EAAGA,EAAImD,EAA8BnD,IAAK,CACrD,IAAMI,EAAMD,GAAKH,CAAC,EACZgD,EAAMK,EAAgBjD,EAAKC,EAAMD,CAAG,EAAGqC,EAAOE,GAAQC,CAAW,EACnEI,IAAQ,SACV1B,GAAO,GAAGH,CAAS,GAAGT,EAAUN,CAAG,CAAC,KAAK4C,CAAG,GAC5C7B,EAAY0B,EAEhB,CACA,GAAIK,EAAY9B,EAAgB,CAC9B,IAAM6B,EAAcC,EAAY9B,EAChCE,GAAO,GAAGH,CAAS,WAAWS,EAAaqB,CAAW,CAAC,oBACvD9B,EAAY0B,CACd,CACA,OAAI1B,IAAc,KAChBG,EAAM;EAAKsB,CAAW,GAAGtB,CAAG;EAAKwB,CAAmB,IAEtDL,EAAM,IAAI,EACH,IAAInB,CAAG,GAChB,CACA,IAAK,SACH,OAAO,SAASjB,CAAK,EAAI,OAAOA,CAAK,EAAI8B,EAAOA,EAAK9B,CAAK,EAAI,OAChE,IAAK,UACH,OAAOA,IAAU,GAAO,OAAS,QACnC,IAAK,YACH,OACF,IAAK,SACH,GAAI+B,EACF,OAAO,OAAO/B,CAAK,EAGvB,QACE,OAAO8B,EAAOA,EAAK9B,CAAK,EAAI,MAChC,CACF,CAEA,SAASiD,EAAiBlD,GAAKC,EAAOoC,EAAO,CAC3C,OAAQ,OAAOpC,EAAO,CACpB,IAAK,SACH,OAAOK,EAAUL,CAAK,EACxB,IAAK,SAAU,CACb,GAAIA,IAAU,KACZ,MAAO,OAET,GAAI,OAAOA,EAAM,QAAW,WAAY,CAGtC,GAFAA,EAAQA,EAAM,OAAOD,EAAG,EAEpB,OAAOC,GAAU,SACnB,OAAOiD,EAAgBlD,GAAKC,EAAOoC,CAAK,EAE1C,GAAIpC,IAAU,KACZ,MAAO,MAEX,CACA,GAAIoC,EAAM,QAAQpC,CAAK,IAAM,GAC3B,OAAOoB,EAGT,IAAIH,GAAM,GAEV,GAAI,MAAM,QAAQjB,CAAK,EAAG,CACxB,GAAIA,EAAM,SAAW,EACnB,MAAO,KAET,GAAIiC,EAAeG,EAAM,OAAS,EAChC,MAAO,YAETA,EAAM,KAAKpC,CAAK,EAChB,IAAM0C,EAA2B,KAAK,IAAI1C,EAAM,OAAQe,CAAc,EAClEpB,EAAI,EACR,KAAOA,EAAI+C,EAA2B,EAAG/C,IAAK,CAC5C,IAAMgD,EAAMM,EAAgB,OAAOtD,CAAC,EAAGK,EAAML,CAAC,EAAGyC,CAAK,EACtDnB,IAAO0B,IAAQ,OAAYA,EAAM,OACjC1B,IAAO,GACT,CACA,IAAM0B,EAAMM,EAAgB,OAAOtD,CAAC,EAAGK,EAAML,CAAC,EAAGyC,CAAK,EAEtD,GADAnB,IAAO0B,IAAQ,OAAYA,EAAM,OAC7B3C,EAAM,OAAS,EAAIe,EAAgB,CACrC,IAAM6B,EAAc5C,EAAM,OAASe,EAAiB,EACpDE,IAAO,SAASM,EAAaqB,CAAW,CAAC,mBAC3C,CACA,OAAAR,EAAM,IAAI,EACH,IAAInB,EAAG,GAChB,CAEA,IAAInB,EAAO,OAAO,KAAKE,CAAK,EACtB6C,EAAY/C,EAAK,OACvB,GAAI+C,IAAc,EAChB,MAAO,KAET,GAAIZ,EAAeG,EAAM,OAAS,EAChC,MAAO,aAET,IAAItB,GAAY,GACZgC,EAA+B,KAAK,IAAID,EAAW9B,CAAc,EACjEH,EAAwBZ,CAAK,IAC/BiB,IAAOJ,EAAoBb,EAAO,IAAKe,CAAc,EACrDjB,EAAOA,EAAK,MAAME,EAAM,MAAM,EAC9B8C,GAAgC9C,EAAM,OACtCc,GAAY,KAEVkB,IACFlC,EAAOS,EAAWT,CAAI,GAExBsC,EAAM,KAAKpC,CAAK,EAChB,QAASL,EAAI,EAAGA,EAAImD,EAA8BnD,IAAK,CACrD,IAAMI,EAAMD,EAAKH,CAAC,EACZgD,EAAMM,EAAgBlD,EAAKC,EAAMD,CAAG,EAAGqC,CAAK,EAC9CO,IAAQ,SACV1B,IAAO,GAAGH,EAAS,GAAGT,EAAUN,CAAG,CAAC,IAAI4C,CAAG,GAC3C7B,GAAY,IAEhB,CACA,GAAI+B,EAAY9B,EAAgB,CAC9B,IAAM6B,EAAcC,EAAY9B,EAChCE,IAAO,GAAGH,EAAS,UAAUS,EAAaqB,CAAW,CAAC,mBACxD,CACA,OAAAR,EAAM,IAAI,EACH,IAAInB,EAAG,GAChB,CACA,IAAK,SACH,OAAO,SAASjB,CAAK,EAAI,OAAOA,CAAK,EAAI8B,EAAOA,EAAK9B,CAAK,EAAI,OAChE,IAAK,UACH,OAAOA,IAAU,GAAO,OAAS,QACnC,IAAK,YACH,OACF,IAAK,SACH,GAAI+B,EACF,OAAO,OAAO/B,CAAK,EAGvB,QACE,OAAO8B,EAAOA,EAAK9B,CAAK,EAAI,MAChC,CACF,CAEA,SAASN,GAAWM,GAAOqC,EAAUa,EAAO,CAC1C,GAAI,UAAU,OAAS,EAAG,CACxB,IAAIZ,GAAS,GAMb,GALI,OAAOY,GAAU,SACnBZ,GAAS,IAAI,OAAO,KAAK,IAAIY,EAAO,EAAE,CAAC,EAC9B,OAAOA,GAAU,WAC1BZ,GAASY,EAAM,MAAM,EAAG,EAAE,GAExBb,GAAY,KAAM,CACpB,GAAI,OAAOA,GAAa,WACtB,OAAOH,GAAoB,GAAI,CAAE,GAAIlC,EAAM,EAAG,CAAC,EAAGqC,EAAUC,GAAQ,EAAE,EAExE,GAAI,MAAM,QAAQD,CAAQ,EACxB,OAAOU,EAAuB,GAAI/C,GAAO,CAAC,EAAGyB,EAAqBY,CAAQ,EAAGC,GAAQ,EAAE,CAE3F,CACA,GAAIA,GAAO,SAAW,EACpB,OAAOU,EAAgB,GAAIhD,GAAO,CAAC,EAAGsC,GAAQ,EAAE,CAEpD,CACA,OAAOW,EAAgB,GAAIjD,GAAO,CAAC,CAAC,CACtC,CAEA,OAAON,EACT,CAAA,CAAA,CAAA,ECnmBAyD,GAAA/E,GAAA,CAAA,sGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,YAAcA,EAAQ,SAAWA,EAAQ,WAAaA,EAAQ,SAAWA,EAAQ,SAAWA,EAAQ,UAAYA,EAAQ,SAAWA,EAAQ,UAAYA,EAAQ,OAASA,EAAQ,YAAcA,EAAQ,QAAUA,EAAQ,SAAWA,EAAQ,cAAgBA,EAAQ,eAAiBA,EAAQ,OAASA,EAAQ,aAAeA,EAAQ,UAAYA,EAAQ,aAAeA,EAAQ,WAAaA,EAAQ,gBAAkB,OAK9Z,SAAS+E,EAAgBpD,EAAO,CAC5B,OAAOqD,EAASrD,CAAK,GAAK,OAAO,iBAAiBA,CACtD,CACA3B,EAAQ,gBAAkB+E,EAE1B,SAASE,EAAWtD,EAAO,CACvB,OAAOqD,EAASrD,CAAK,GAAK,OAAO,YAAYA,CACjD,CACA3B,EAAQ,WAAaiF,EAKrB,SAASC,EAAavD,EAAO,CACzB,OAAO,YAAY,OAAOA,CAAK,CACnC,CACA3B,EAAQ,aAAekF,EAEvB,SAASC,EAAUxD,EAAO,CACtB,OAAOA,aAAiB,OAC5B,CACA3B,EAAQ,UAAYmF,EAEpB,SAASC,EAAazD,EAAO,CACzB,OAAOA,aAAiB,UAC5B,CACA3B,EAAQ,aAAeoF,EAEvB,SAASC,EAAO1D,EAAO,CACnB,OAAOA,aAAiB,MAAQ,OAAO,SAASA,EAAM,QAAQ,CAAC,CACnE,CACA3B,EAAQ,OAASqF,EAKjB,SAASC,EAAe3D,EAAOD,EAAK,CAChC,OAAOA,KAAOC,CAClB,CACA3B,EAAQ,eAAiBsF,EAEzB,SAASC,EAAc5D,EAAO,CAC1B,OAAOqD,EAASrD,CAAK,GAAK6D,EAAW7D,EAAM,WAAW,GAAKA,EAAM,YAAY,OAAS,QAC1F,CACA3B,EAAQ,cAAgBuF,EAExB,SAASP,EAASrD,EAAO,CACrB,OAAOA,IAAU,MAAQ,OAAOA,GAAU,QAC9C,CACA3B,EAAQ,SAAWgF,EAEnB,SAASS,EAAQ9D,EAAO,CACpB,OAAO,MAAM,QAAQA,CAAK,GAAK,CAAC,YAAY,OAAOA,CAAK,CAC5D,CACA3B,EAAQ,QAAUyF,EAElB,SAASC,EAAY/D,EAAO,CACxB,OAAOA,IAAU,MACrB,CACA3B,EAAQ,YAAc0F,EAEtB,SAASC,EAAOhE,EAAO,CACnB,OAAOA,IAAU,IACrB,CACA3B,EAAQ,OAAS2F,EAEjB,SAASC,EAAUjE,EAAO,CACtB,OAAO,OAAOA,GAAU,SAC5B,CACA3B,EAAQ,UAAY4F,EAEpB,SAASC,EAASlE,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACA3B,EAAQ,SAAW6F,EAEnB,SAASC,EAAUnE,EAAO,CACtB,OAAOkE,EAASlE,CAAK,GAAK,OAAO,UAAUA,CAAK,CACpD,CACA3B,EAAQ,UAAY8F,EAEpB,SAASC,EAASpE,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACA3B,EAAQ,SAAW+F,EAEnB,SAASC,EAASrE,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACA3B,EAAQ,SAAWgG,EAEnB,SAASR,EAAW7D,EAAO,CACvB,OAAO,OAAOA,GAAU,UAC5B,CACA3B,EAAQ,WAAawF,EAErB,SAASS,EAAStE,EAAO,CACrB,OAAO,OAAOA,GAAU,QAC5B,CACA3B,EAAQ,SAAWiG,EAEnB,SAASC,EAAYvE,EAAO,CAExB,OAAQoE,EAASpE,CAAK,GAClBiE,EAAUjE,CAAK,GACfgE,EAAOhE,CAAK,GACZkE,EAASlE,CAAK,GACdqE,EAASrE,CAAK,GACdsE,EAAStE,CAAK,GACd+D,EAAY/D,CAAK,CACzB,CACA3B,EAAQ,YAAckG,CAAA,CAAA,CAAA,ECjJtBC,GAAApG,GAAA,CAAA,wGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,qBAAuBA,EAAQ,iBAAmBA,EAAQ,wBAA0BA,EAAQ,WAAaA,EAAQ,0BAA4BA,EAAQ,4BAA8B,OAC3L,IAAMoG,EAAUtB,GAAA,EACVuB,EAAWC,GAAA,EACXC,EAAQC,GAAA,EAIRC,EAAN,cAA0CF,EAAM,YAAa,CACzD,YAAYG,EAAM,CACd,MAAM,wBAAwBA,CAAI,YAAY,CAClD,CACJ,EACA1G,EAAQ,4BAA8ByG,EACtC,IAAME,EAAN,cAAwCJ,EAAM,YAAa,CACvD,YAAYG,EAAM,CACd,MAAM,4BAA4BA,CAAI,YAAY,CACtD,CACJ,EACA1G,EAAQ,0BAA4B2G,EAKpC,IAAIC,GACH,SAAUA,EAAY,CAEnB,SAASC,EAAKH,EAAMI,EAAO,CACvB,GAAIP,EAAM,aAAa,IAAIG,CAAI,EAC3B,MAAM,IAAID,EAA4BC,CAAI,EAC9C,OAAAH,EAAM,aAAa,IAAIG,EAAMI,CAAK,EAC3B,CAAChE,EAAU,CAAC,IAAMyD,EAAM,KAAK,OAAO,CAAE,GAAGzD,EAAS,CAACyD,EAAM,IAAI,EAAGG,CAAK,CAAC,CACjF,CACAE,EAAW,KAAOC,EAElB,SAASE,EAAOC,EAAQF,EAAO,CAC3B,GAAIP,EAAM,eAAe,IAAIS,CAAM,EAC/B,MAAM,IAAIL,EAA0BK,CAAM,EAC9C,OAAAT,EAAM,eAAe,IAAIS,EAAQF,CAAK,EAC/BE,CACX,CACAJ,EAAW,OAASG,CACxB,GAAGH,IAAe5G,EAAQ,WAAa4G,EAAa,CAAC,EAAE,EAKvD,IAAIK,GACH,SAAUA,EAAyB,CAChC,IAAIC,EAAuBC,EAE3B,SAASC,GAAQ,CACbF,EAAuBC,CAC3B,CACAF,EAAwB,MAAQG,EAEhC,SAASC,EAAIC,EAAU,CACnBJ,EAAuBI,CAC3B,CACAL,EAAwB,IAAMI,EAE9B,SAASE,GAAM,CACX,OAAOL,CACX,CACAD,EAAwB,IAAMM,CAClC,GAAGN,IAA4BjH,EAAQ,wBAA0BiH,EAA0B,CAAC,EAAE,EAK9F,IAAIO,GACH,SAAUA,EAAkB,CAEzBA,EAAiB,2BAA6B,GAE9CA,EAAiB,iBAAmB,GAEpCA,EAAiB,SAAW,GAE5BA,EAAiB,cAAgB,GAEjC,SAASC,EAAwB9F,EAAOD,EAAK,CACzC,OAAO8F,EAAiB,2BAA6B9F,KAAOC,EAAQA,EAAMD,CAAG,IAAM,MACvF,CACA8F,EAAiB,wBAA0BC,EAE3C,SAASC,EAAa/F,EAAO,CACzB,IAAMgG,KAAevB,EAAQ,UAAUzE,CAAK,EAC5C,OAAO6F,EAAiB,iBAAmBG,EAAWA,GAAY,IAAKvB,EAAQ,SAASzE,CAAK,CACjG,CACA6F,EAAiB,aAAeE,EAEhC,SAASE,EAAajG,EAAO,CACzB,OAAO+F,EAAa/F,CAAK,GAAK,EAAEA,aAAiB,OAAS,EAAEA,aAAiB,WACjF,CACA6F,EAAiB,aAAeI,EAEhC,SAASC,EAAalG,EAAO,CACzB,IAAMmG,KAAe1B,EAAQ,UAAUzE,CAAK,EAC5C,OAAO6F,EAAiB,SAAWM,EAAWA,GAAY,OAAO,SAASnG,CAAK,CACnF,CACA6F,EAAiB,aAAeK,EAEhC,SAASE,EAAWpG,EAAO,CACvB,IAAMqG,KAAkB5B,EAAQ,aAAazE,CAAK,EAClD,OAAO6F,EAAiB,cAAgBQ,GAAerG,IAAU,KAAOqG,CAC5E,CACAR,EAAiB,WAAaO,CAClC,GAAGP,IAAqBxH,EAAQ,iBAAmBwH,EAAmB,CAAC,EAAE,EAKzE,SAASL,EAAqBc,EAAQC,EAAW,CAC7C,OAAQA,EAAW,CACf,KAAK7B,EAAS,eAAe,cACzB,MAAO,wDACX,KAAKA,EAAS,eAAe,iBACzB,MAAO,0CAA0C4B,EAAO,WAAW,mBACvE,KAAK5B,EAAS,eAAe,iBACzB,MAAO,sCAAsC4B,EAAO,WAAW,mBACnE,KAAK5B,EAAS,eAAe,cACzB,MAAO,gDAAgD4B,EAAO,QAAQ,GAC1E,KAAK5B,EAAS,eAAe,cACzB,MAAO,mDAAmD4B,EAAO,QAAQ,GAC7E,KAAK5B,EAAS,eAAe,iBACzB,MAAO,uCACX,KAAKA,EAAS,eAAe,MACzB,MAAO,iBACX,KAAKA,EAAS,eAAe,cACzB,MAAO,yBACX,KAAKA,EAAS,eAAe,uBACzB,MAAO,mCAAmC4B,EAAO,gBAAgB,GACrE,KAAK5B,EAAS,eAAe,uBACzB,MAAO,sCAAsC4B,EAAO,gBAAgB,GACxE,KAAK5B,EAAS,eAAe,cACzB,MAAO,0CAA0C4B,EAAO,OAAO,GACnE,KAAK5B,EAAS,eAAe,cACzB,MAAO,6CAA6C4B,EAAO,OAAO,GACtE,KAAK5B,EAAS,eAAe,iBACzB,MAAO,uCAAuC4B,EAAO,UAAU,GACnE,KAAK5B,EAAS,eAAe,OACzB,MAAO,kBACX,KAAKA,EAAS,eAAe,QACzB,MAAO,mBACX,KAAKA,EAAS,eAAe,8BACzB,MAAO,8CAA8C4B,EAAO,yBAAyB,GACzF,KAAK5B,EAAS,eAAe,8BACzB,MAAO,2CAA2C4B,EAAO,yBAAyB,GACtF,KAAK5B,EAAS,eAAe,qBACzB,MAAO,qDAAqD4B,EAAO,gBAAgB,GACvF,KAAK5B,EAAS,eAAe,qBACzB,MAAO,kDAAkD4B,EAAO,gBAAgB,GACpF,KAAK5B,EAAS,eAAe,wBACzB,MAAO,+CAA+C4B,EAAO,mBAAmB,GACpF,KAAK5B,EAAS,eAAe,KACzB,MAAO,gBACX,KAAKA,EAAS,eAAe,SACzB,MAAO,oBACX,KAAKA,EAAS,eAAe,wBACzB,MAAO,oCAAoC4B,EAAO,gBAAgB,GACtE,KAAK5B,EAAS,eAAe,wBACzB,MAAO,uCAAuC4B,EAAO,gBAAgB,GACzE,KAAK5B,EAAS,eAAe,eACzB,MAAO,2CAA2C4B,EAAO,OAAO,GACpE,KAAK5B,EAAS,eAAe,eACzB,MAAO,8CAA8C4B,EAAO,OAAO,GACvE,KAAK5B,EAAS,eAAe,kBACzB,MAAO,wCAAwC4B,EAAO,UAAU,GACpE,KAAK5B,EAAS,eAAe,QACzB,MAAO,mBACX,KAAKA,EAAS,eAAe,+BACzB,MAAO,sBACX,KAAKA,EAAS,eAAe,UACzB,MAAO,+BACX,KAAKA,EAAS,eAAe,SACzB,MAAO,oBACX,KAAKA,EAAS,eAAe,QACzB,MAAO,YAAY,OAAO4B,EAAO,OAAU,SAAW,IAAIA,EAAO,KAAK,IAAMA,EAAO,KAAK,GAC5F,KAAK5B,EAAS,eAAe,MACzB,MAAO,QACX,KAAKA,EAAS,eAAe,IACzB,MAAO,yBACX,KAAKA,EAAS,eAAe,KACzB,MAAO,gBACX,KAAKA,EAAS,eAAe,uBACzB,MAAO,mCAAmC4B,EAAO,gBAAgB,GACrE,KAAK5B,EAAS,eAAe,uBACzB,MAAO,sCAAsC4B,EAAO,gBAAgB,GACxE,KAAK5B,EAAS,eAAe,cACzB,MAAO,0CAA0C4B,EAAO,OAAO,GACnE,KAAK5B,EAAS,eAAe,cACzB,MAAO,6CAA6C4B,EAAO,OAAO,GACtE,KAAK5B,EAAS,eAAe,iBACzB,MAAO,uCAAuC4B,EAAO,UAAU,GACnE,KAAK5B,EAAS,eAAe,OACzB,MAAO,kBACX,KAAKA,EAAS,eAAe,OACzB,MAAO,kBACX,KAAKA,EAAS,eAAe,2BACzB,MAAO,sBACX,KAAKA,EAAS,eAAe,oBACzB,MAAO,wCAAwC4B,EAAO,aAAa,cACvE,KAAK5B,EAAS,eAAe,oBACzB,MAAO,oCAAoC4B,EAAO,aAAa,cACnE,KAAK5B,EAAS,eAAe,uBACzB,MAAO,oBACX,KAAKA,EAAS,eAAe,QACzB,MAAO,mBACX,KAAKA,EAAS,eAAe,oBACzB,MAAO,mBAAmB4B,EAAO,MAAM,IAC3C,KAAK5B,EAAS,eAAe,aACzB,MAAO,6BAA6B4B,EAAO,MAAM,WACrD,KAAK5B,EAAS,eAAe,gBACzB,MAAO,2CAA2C4B,EAAO,SAAS,GACtE,KAAK5B,EAAS,eAAe,gBACzB,MAAO,8CAA8C4B,EAAO,SAAS,GACzE,KAAK5B,EAAS,eAAe,cACzB,MAAO,6BAA6B4B,EAAO,OAAO,IACtD,KAAK5B,EAAS,eAAe,OACzB,MAAO,kBACX,KAAKA,EAAS,eAAe,OACzB,MAAO,kBACX,KAAKA,EAAS,eAAe,YACzB,MAAO,0BAA0B4B,EAAO,UAAY,CAAC,YACzD,KAAK5B,EAAS,eAAe,MACzB,MAAO,iBACX,KAAKA,EAAS,eAAe,wBACzB,MAAO,yCAAyC4B,EAAO,aAAa,GACxE,KAAK5B,EAAS,eAAe,wBACzB,MAAO,4CAA4C4B,EAAO,aAAa,GAC3E,KAAK5B,EAAS,eAAe,WACzB,MAAO,sBACX,KAAKA,EAAS,eAAe,UACzB,MAAO,qBACX,KAAKA,EAAS,eAAe,MACzB,MAAO,uBACX,KAAKA,EAAS,eAAe,KACzB,MAAO,gBACX,KAAKA,EAAS,eAAe,KACzB,MAAO,kBAAkB4B,EAAO1B,EAAM,IAAI,CAAC,IAC/C,QACI,MAAO,oBACf,CACJ,CACAvG,EAAQ,qBAAuBmH,CAAA,CAAA,CAAA,ECjR/BgB,GAAApI,GAAA,CAAA,sGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,MAAQA,EAAQ,qBAAuB,OAC/C,IAAMoI,EAAY5B,GAAA,EACZ6B,EAAN,cAAmCD,EAAU,YAAa,CACtD,YAAYH,EAAQ,CAChB,MAAM,0CAA0CA,EAAO,GAAG,GAAG,EAC7D,KAAK,OAASA,CAClB,CACJ,EACAjI,EAAQ,qBAAuBqI,EAE/B,SAASC,EAAML,EAAQM,EAAY,CAC/B,IAAMC,EAAQD,EAAW,UAAWE,GAAWA,EAAO,MAAQR,EAAO,IAAI,EACzE,GAAIO,IAAU,GACV,MAAM,IAAIH,EAAqBJ,CAAM,EACzC,OAAOM,EAAWC,CAAK,CAC3B,CACAxI,EAAQ,MAAQsI,CAAA,CAAA,CAAA,EC7ChBI,GAAA3I,GAAA,CAAA,qGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,KAAOA,EAAQ,WAAaA,EAAQ,eAAiB,OAC7D,IAAMoG,EAAUtB,GAAA,EAIV6D,EAAN,cAA6B,KAAM,CAC/B,YAAYhH,EAAO,CACf,MAAM,sBAAsB,EAC5B,KAAK,MAAQA,CACjB,CACJ,EACA3B,EAAQ,eAAiB2I,EAIzB,IAAIC,GACH,SAAUA,EAAY,CACnBA,EAAWA,EAAW,UAAe,CAAC,EAAI,YAC1CA,EAAWA,EAAW,KAAU,CAAC,EAAI,OACrCA,EAAWA,EAAW,QAAa,CAAC,EAAI,UACxCA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,MAAW,CAAC,EAAI,QACtCA,EAAWA,EAAW,KAAU,CAAC,EAAI,OACrCA,EAAWA,EAAW,WAAgB,CAAC,EAAI,aAC3CA,EAAWA,EAAW,OAAY,CAAC,EAAI,SACvCA,EAAWA,EAAW,OAAY,EAAE,EAAI,QAC5C,GAAGA,IAAe5I,EAAQ,WAAa4I,EAAa,CAAC,EAAE,EAIvD,IAAIC,EAAc,OAAO,sBAAsB,EACzC,CAACC,EAAOC,CAAI,EAAI,CAAC,OAAO,eAAe,EAAG,OAAO,GAAG,GAAK,OAAO,IAAI,CAAC,EACrEC,EAAQ,MAAM,KAAK,CAAE,OAAQ,GAAI,CAAC,EAAE,IAAI,CAACC,EAAG3H,IAAM,OAAOA,CAAC,CAAC,EAC3D4H,EAAM,IAAI,aAAa,CAAC,EACxBC,EAAQ,IAAI,SAASD,EAAI,MAAM,EAC/BE,EAAS,IAAI,WAAWF,EAAI,MAAM,EAIxC,SAAUG,EAAc1H,EAAO,CAC3B,IAAM2H,EAAY3H,IAAU,EAAI,EAAI,KAAK,KAAK,KAAK,MAAM,KAAK,KAAKA,CAAK,EAAI,CAAC,EAAI,CAAC,EAClF,QAASL,GAAI,EAAGA,GAAIgI,EAAWhI,KAC3B,MAAOK,GAAU,GAAK2H,EAAY,EAAIhI,IAAO,GAErD,CAIA,SAASiI,EAAU5H,EAAO,CACtB6H,GAAQZ,EAAW,KAAK,EACxB,QAAWa,KAAQ9H,EACf+H,EAAMD,CAAI,CAElB,CACA,SAASE,EAAYhI,EAAO,CACxB6H,GAAQZ,EAAW,OAAO,EAC1BY,GAAQ7H,EAAQ,EAAI,CAAC,CACzB,CACA,SAASiI,EAAWjI,EAAO,CACvB6H,GAAQZ,EAAW,MAAM,EACzBO,EAAM,YAAY,EAAGxH,CAAK,EAC1B,QAAWkI,KAAQT,EACfI,GAAQK,CAAI,CAEpB,CACA,SAASC,EAASnI,EAAO,CACrB6H,GAAQZ,EAAW,IAAI,EACvBc,EAAM/H,EAAM,QAAQ,CAAC,CACzB,CACA,SAASoI,EAASpI,EAAO,CACrB6H,GAAQZ,EAAW,IAAI,CAC3B,CACA,SAASoB,EAAWrI,EAAO,CACvB6H,GAAQZ,EAAW,MAAM,EACzBO,EAAM,WAAW,EAAGxH,CAAK,EACzB,QAAWkI,KAAQT,EACfI,GAAQK,CAAI,CAEpB,CACA,SAASI,EAAWtI,EAAO,CACvB6H,GAAQZ,EAAW,MAAM,EACzB,QAAWlH,KAAO,WAAW,OAAO,KAAKC,CAAK,EAAE,KAAK,EACjD+H,EAAMhI,CAAG,EACTgI,EAAM/H,EAAMD,CAAG,CAAC,CAExB,CACA,SAASwI,EAAWvI,EAAO,CACvB6H,GAAQZ,EAAW,MAAM,EACzB,QAAStH,EAAI,EAAGA,EAAIK,EAAM,OAAQL,IAC9B,QAAWuI,MAAQR,EAAc1H,EAAM,WAAWL,CAAC,CAAC,EAChDkI,GAAQK,EAAI,CAGxB,CACA,SAASM,EAAWxI,EAAO,CACvB6H,GAAQZ,EAAW,MAAM,EACzBc,EAAM/H,EAAM,WAAW,CAC3B,CACA,SAASyI,EAAezI,EAAO,CAC3B6H,GAAQZ,EAAW,UAAU,EAC7B,QAAStH,EAAI,EAAGA,EAAIK,EAAM,OAAQL,IAC9BkI,GAAQ7H,EAAML,CAAC,CAAC,CAExB,CACA,SAAS+I,EAAc1I,EAAO,CAC1B,OAAO6H,GAAQZ,EAAW,SAAS,CACvC,CACA,SAASc,EAAM/H,EAAO,CAClB,MAAQyE,EAAQ,SAASzE,CAAK,EAC1B,OAAO4H,EAAU5H,CAAK,EAC1B,MAAQyE,EAAQ,WAAWzE,CAAK,EAC5B,OAAOgI,EAAYhI,CAAK,EAC5B,MAAQyE,EAAQ,UAAUzE,CAAK,EAC3B,OAAOiI,EAAWjI,CAAK,EAC3B,MAAQyE,EAAQ,QAAQzE,CAAK,EACzB,OAAOmI,EAASnI,CAAK,EACzB,MAAQyE,EAAQ,QAAQzE,CAAK,EACzB,OAAOoI,EAASpI,CAAK,EACzB,MAAQyE,EAAQ,UAAUzE,CAAK,EAC3B,OAAOqI,EAAWrI,CAAK,EAC3B,MAAQyE,EAAQ,eAAezE,CAAK,EAChC,OAAOsI,EAAWtI,CAAK,EAC3B,MAAQyE,EAAQ,UAAUzE,CAAK,EAC3B,OAAOuI,EAAWvI,CAAK,EAC3B,MAAQyE,EAAQ,UAAUzE,CAAK,EAC3B,OAAOwI,EAAWxI,CAAK,EAC3B,MAAQyE,EAAQ,cAAczE,CAAK,EAC/B,OAAOyI,EAAezI,CAAK,EAC/B,MAAQyE,EAAQ,aAAazE,CAAK,EAC9B,OAAO0I,EAAc1I,CAAK,EAC9B,MAAM,IAAIgH,EAAehH,CAAK,CAClC,CACA,SAAS6H,GAAQK,EAAM,CACnBhB,EAAcA,EAAcG,EAAMa,CAAI,EACtChB,EAAeA,EAAcC,EAASC,CAC1C,CAKA,SAASuB,EAAK3I,EAAO,CACjB,OAAAkH,EAAc,OAAO,sBAAsB,EAC3Ca,EAAM/H,CAAK,EACJkH,CACX,CACA7I,EAAQ,KAAOsK,CAAA,CAAA,CAAA,EChLfhE,GAAAvG,GAAA,CAAA,wGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,OAASA,EAAQ,mBAAqBA,EAAQ,UAAYA,EAAQ,4BAA8BA,EAAQ,eAAiB,OACjI,IAAMoG,EAAUtB,GAAA,EACVyF,EAAWpE,GAAA,EACXqE,EAAUrC,GAAA,EACVsC,EAAS/B,GAAA,EACTnC,EAAQC,GAAA,EAIVkE,GACH,SAAUA,EAAgB,CACvBA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,iBAAsB,CAAC,EAAI,mBACzDA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,iBAAsB,CAAC,EAAI,mBACzDA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,iBAAsB,CAAC,EAAI,mBACzDA,EAAeA,EAAe,MAAW,CAAC,EAAI,QAC9CA,EAAeA,EAAe,cAAmB,CAAC,EAAI,gBACtDA,EAAeA,EAAe,uBAA4B,CAAC,EAAI,yBAC/DA,EAAeA,EAAe,uBAA4B,CAAC,EAAI,yBAC/DA,EAAeA,EAAe,cAAmB,EAAE,EAAI,gBACvDA,EAAeA,EAAe,cAAmB,EAAE,EAAI,gBACvDA,EAAeA,EAAe,iBAAsB,EAAE,EAAI,mBAC1DA,EAAeA,EAAe,OAAY,EAAE,EAAI,SAChDA,EAAeA,EAAe,QAAa,EAAE,EAAI,UACjDA,EAAeA,EAAe,8BAAmC,EAAE,EAAI,gCACvEA,EAAeA,EAAe,8BAAmC,EAAE,EAAI,gCACvEA,EAAeA,EAAe,qBAA0B,EAAE,EAAI,uBAC9DA,EAAeA,EAAe,qBAA0B,EAAE,EAAI,uBAC9DA,EAAeA,EAAe,wBAA6B,EAAE,EAAI,0BACjEA,EAAeA,EAAe,KAAU,EAAE,EAAI,OAC9CA,EAAeA,EAAe,SAAc,EAAE,EAAI,WAClDA,EAAeA,EAAe,wBAA6B,EAAE,EAAI,0BACjEA,EAAeA,EAAe,wBAA6B,EAAE,EAAI,0BACjEA,EAAeA,EAAe,eAAoB,EAAE,EAAI,iBACxDA,EAAeA,EAAe,eAAoB,EAAE,EAAI,iBACxDA,EAAeA,EAAe,kBAAuB,EAAE,EAAI,oBAC3DA,EAAeA,EAAe,QAAa,EAAE,EAAI,UACjDA,EAAeA,EAAe,+BAAoC,EAAE,EAAI,iCACxEA,EAAeA,EAAe,UAAe,EAAE,EAAI,YACnDA,EAAeA,EAAe,SAAc,EAAE,EAAI,WAClDA,EAAeA,EAAe,KAAU,EAAE,EAAI,OAC9CA,EAAeA,EAAe,QAAa,EAAE,EAAI,UACjDA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,IAAS,EAAE,EAAI,MAC7CA,EAAeA,EAAe,KAAU,EAAE,EAAI,OAC9CA,EAAeA,EAAe,uBAA4B,EAAE,EAAI,yBAChEA,EAAeA,EAAe,uBAA4B,EAAE,EAAI,yBAChEA,EAAeA,EAAe,cAAmB,EAAE,EAAI,gBACvDA,EAAeA,EAAe,cAAmB,EAAE,EAAI,gBACvDA,EAAeA,EAAe,iBAAsB,EAAE,EAAI,mBAC1DA,EAAeA,EAAe,OAAY,EAAE,EAAI,SAChDA,EAAeA,EAAe,2BAAgC,EAAE,EAAI,6BACpEA,EAAeA,EAAe,oBAAyB,EAAE,EAAI,sBAC7DA,EAAeA,EAAe,oBAAyB,EAAE,EAAI,sBAC7DA,EAAeA,EAAe,uBAA4B,EAAE,EAAI,yBAChEA,EAAeA,EAAe,OAAY,EAAE,EAAI,SAChDA,EAAeA,EAAe,QAAa,EAAE,EAAI,UACjDA,EAAeA,EAAe,oBAAyB,EAAE,EAAI,sBAC7DA,EAAeA,EAAe,aAAkB,EAAE,EAAI,eACtDA,EAAeA,EAAe,gBAAqB,EAAE,EAAI,kBACzDA,EAAeA,EAAe,gBAAqB,EAAE,EAAI,kBACzDA,EAAeA,EAAe,cAAmB,EAAE,EAAI,gBACvDA,EAAeA,EAAe,OAAY,EAAE,EAAI,SAChDA,EAAeA,EAAe,OAAY,EAAE,EAAI,SAChDA,EAAeA,EAAe,YAAiB,EAAE,EAAI,cACrDA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,wBAA6B,EAAE,EAAI,0BACjEA,EAAeA,EAAe,wBAA6B,EAAE,EAAI,0BACjEA,EAAeA,EAAe,WAAgB,EAAE,EAAI,aACpDA,EAAeA,EAAe,UAAe,EAAE,EAAI,YACnDA,EAAeA,EAAe,MAAW,EAAE,EAAI,QAC/CA,EAAeA,EAAe,KAAU,EAAE,EAAI,MAClD,GAAGA,IAAmB1K,EAAQ,eAAiB0K,EAAiB,CAAC,EAAE,EAInE,IAAMC,EAAN,cAA0CpE,EAAM,YAAa,CACzD,YAAY0B,EAAQ,CAChB,MAAM,cAAc,EACpB,KAAK,OAASA,CAClB,CACJ,EACAjI,EAAQ,4BAA8B2K,EAItC,SAASC,EAAUlJ,EAAK,CACpB,OAAOA,EAAI,QAAQ,KAAM,IAAI,EAAE,QAAQ,MAAO,IAAI,CACtD,CACA1B,EAAQ,UAAY4K,EAIpB,SAASC,EAAUlJ,EAAO,CACtB,OAAOA,IAAU,MACrB,CAIA,IAAMmJ,EAAN,KAAyB,CACrB,YAAYC,EAAU,CAClB,KAAK,SAAWA,CACpB,CACA,CAAC,OAAO,QAAQ,GAAI,CAChB,OAAO,KAAK,QAChB,CAEA,OAAQ,CACJ,IAAMC,EAAO,KAAK,SAAS,KAAK,EAChC,OAAOA,EAAK,KAAO,OAAYA,EAAK,KACxC,CACJ,EACAhL,EAAQ,mBAAqB8K,EAI7B,SAASG,EAAOC,EAAMjD,EAAQkD,EAAMxJ,EAAO,CACvC,MAAO,CAAE,KAAAuJ,EAAM,OAAAjD,EAAQ,KAAAkD,EAAM,MAAAxJ,EAAO,QAAS4I,EAAS,wBAAwB,IAAI,EAAEtC,EAAQiD,CAAI,CAAE,CACtG,CAIA,SAAUE,EAAKnD,EAAQM,EAAY4C,EAAMxJ,EAAO,CAAE,CAClD,SAAU0J,EAAOpD,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC9C,GAAI,IAAKyE,EAAQ,SAASzE,CAAK,EAC3B,OAAO,MAAMsJ,EAAOP,EAAe,MAAOzC,EAAQkD,EAAMxJ,CAAK,EAE7DkJ,EAAU5C,EAAO,QAAQ,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,YACvD,MAAMgD,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,GAE9DkJ,EAAU5C,EAAO,QAAQ,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,YACvD,MAAMgD,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,GAElE,QAASL,GAAI,EAAGA,GAAIK,EAAM,OAAQL,KAC9B,MAAOoI,EAAMzB,EAAO,MAAOM,EAAY,GAAG4C,CAAI,IAAI7J,EAAC,GAAIK,EAAML,EAAC,CAAC,EAenE,GAZI2G,EAAO,cAAgB,IAAQ,CAAG,UAAY,CAAE,IAAMqD,GAAM,IAAI,IAAO,QAAWC,MAAW5J,EAAO,CACpG,IAAM6J,MAAaf,EAAO,MAAMc,EAAO,EACvC,GAAID,GAAI,IAAIE,EAAM,EACd,MAAO,GAGPF,GAAI,IAAIE,EAAM,CAEtB,CAAE,MAAO,EAAM,EAAG,IACd,MAAMP,EAAOP,EAAe,iBAAkBzC,EAAQkD,EAAMxJ,CAAK,GAGjE,EAAEkJ,EAAU5C,EAAO,QAAQ,GAAK4C,EAAU5C,EAAO,WAAW,GAAK4C,EAAU5C,EAAO,WAAW,GAC7F,OAEJ,IAAMwD,EAAiBZ,EAAU5C,EAAO,QAAQ,EAAIA,EAAO,SAAW1B,EAAM,KAAK,MAAM,EACjFmF,EAAgB/J,EAAM,OAAO,CAACgK,GAAKhK,GAAO6G,KAAWkB,EAAM+B,EAAgBlD,EAAY,GAAG4C,CAAI,GAAG3C,EAAK,GAAI7G,EAAK,EAAE,KAAK,EAAE,OAAS,GAAOgK,GAAM,EAAIA,GAAM,CAAC,EAC3JD,IAAkB,IAClB,MAAMT,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,MAE1DyE,EAAQ,UAAU6B,EAAO,WAAW,GAAKyD,EAAgBzD,EAAO,cACpE,MAAMgD,EAAOP,EAAe,iBAAkBzC,EAAQkD,EAAMxJ,CAAK,MAE7DyE,EAAQ,UAAU6B,EAAO,WAAW,GAAKyD,EAAgBzD,EAAO,cACpE,MAAMgD,EAAOP,EAAe,iBAAkBzC,EAAQkD,EAAMxJ,CAAK,EAEzE,CACA,SAAUiK,EAAe3D,EAAQM,EAAY4C,EAAMxJ,EAAO,IAC7CyE,EAAQ,iBAAiBzE,CAAK,IACnC,MAAMsJ,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,EACtE,CACA,SAAUkK,EAAQ5D,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC/C,GAAI,IAAKyE,EAAQ,UAAUzE,CAAK,EAC5B,OAAO,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EAC9DkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,oBACvD,MAAMgD,EAAOP,EAAe,uBAAwBzC,EAAQkD,EAAMxJ,CAAK,GAEvEkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,oBACvD,MAAMgD,EAAOP,EAAe,uBAAwBzC,EAAQkD,EAAMxJ,CAAK,GAEvEkJ,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,WAC/C,MAAMgD,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,GAE9DkJ,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,WAC/C,MAAMgD,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,GAE9DkJ,EAAU5C,EAAO,UAAU,GAAOtG,EAAQsG,EAAO,aAAe,OAAO,CAAC,IACxE,MAAMgD,EAAOP,EAAe,iBAAkBzC,EAAQkD,EAAMxJ,CAAK,EAEzE,CACA,SAAUmK,EAAS7D,EAAQM,EAAY4C,EAAMxJ,EAAO,IACvCyE,EAAQ,WAAWzE,CAAK,IAC7B,MAAMsJ,EAAOP,EAAe,QAASzC,EAAQkD,EAAMxJ,CAAK,EAChE,CACA,SAAUoK,EAAa9D,EAAQM,EAAY4C,EAAMxJ,EAAO,CACpD,MAAO+H,EAAMzB,EAAO,QAASM,EAAY4C,EAAMxJ,EAAM,SAAS,CAClE,CACA,SAAUqK,EAAM/D,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC7C,GAAI,IAAKyE,EAAQ,QAAQzE,CAAK,EAC1B,OAAO,MAAMsJ,EAAOP,EAAe,KAAMzC,EAAQkD,EAAMxJ,CAAK,EAC5DkJ,EAAU5C,EAAO,yBAAyB,GAAK,EAAEtG,EAAM,QAAQ,EAAIsG,EAAO,6BAC1E,MAAMgD,EAAOP,EAAe,8BAA+BzC,EAAQkD,EAAMxJ,CAAK,GAE9EkJ,EAAU5C,EAAO,yBAAyB,GAAK,EAAEtG,EAAM,QAAQ,EAAIsG,EAAO,6BAC1E,MAAMgD,EAAOP,EAAe,8BAA+BzC,EAAQkD,EAAMxJ,CAAK,GAE9EkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAM,QAAQ,GAAKsG,EAAO,oBAClE,MAAMgD,EAAOP,EAAe,qBAAsBzC,EAAQkD,EAAMxJ,CAAK,GAErEkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAM,QAAQ,GAAKsG,EAAO,oBAClE,MAAMgD,EAAOP,EAAe,qBAAsBzC,EAAQkD,EAAMxJ,CAAK,GAErEkJ,EAAU5C,EAAO,mBAAmB,GAAOtG,EAAM,QAAQ,EAAIsG,EAAO,sBAAwB,IAC5F,MAAMgD,EAAOP,EAAe,wBAAyBzC,EAAQkD,EAAMxJ,CAAK,EAEhF,CACA,SAAUsK,EAAUhE,EAAQM,EAAY4C,EAAMxJ,EAAO,IACxCyE,EAAQ,YAAYzE,CAAK,IAC9B,MAAMsJ,EAAOP,EAAe,SAAUzC,EAAQkD,EAAMxJ,CAAK,EACjE,CACA,SAAUuK,EAASjE,EAAQM,EAAY4C,EAAMxJ,EAAO,CAChD,GAAI,IAAKyE,EAAQ,WAAWzE,CAAK,EAC7B,OAAO,MAAMsJ,EAAOP,EAAe,QAASzC,EAAQkD,EAAMxJ,CAAK,EAC/DkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,oBACvD,MAAMgD,EAAOP,EAAe,wBAAyBzC,EAAQkD,EAAMxJ,CAAK,GAExEkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,oBACvD,MAAMgD,EAAOP,EAAe,wBAAyBzC,EAAQkD,EAAMxJ,CAAK,GAExEkJ,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,WAC/C,MAAMgD,EAAOP,EAAe,eAAgBzC,EAAQkD,EAAMxJ,CAAK,GAE/DkJ,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,WAC/C,MAAMgD,EAAOP,EAAe,eAAgBzC,EAAQkD,EAAMxJ,CAAK,GAE/DkJ,EAAU5C,EAAO,UAAU,GAAOtG,EAAQsG,EAAO,aAAe,IAChE,MAAMgD,EAAOP,EAAe,kBAAmBzC,EAAQkD,EAAMxJ,CAAK,EAE1E,CACA,SAAUwK,EAAWlE,EAAQM,EAAY4C,EAAMxJ,EAAO,CAClD,QAAWyK,KAASnE,EAAO,MAAO,CAC9B,IAAM+C,EAAOtB,EAAM0C,EAAO7D,EAAY4C,EAAMxJ,CAAK,EAAE,KAAK,EACnDqJ,EAAK,OACN,MAAMC,EAAOP,EAAe,UAAWzC,EAAQkD,EAAMxJ,CAAK,EAC1D,MAAMqJ,EAAK,MAEnB,CACA,GAAI/C,EAAO,wBAA0B,GAAO,CACxC,IAAMoE,EAAW,IAAI,OAAO9F,EAAM,YAAY,eAAe0B,CAAM,CAAC,EACpE,QAAWqE,KAAY,OAAO,oBAAoB3K,CAAK,EAC9C0K,EAAS,KAAKC,CAAQ,IACvB,MAAMrB,EAAOP,EAAe,+BAAgCzC,EAAQ,GAAGkD,CAAI,IAAImB,CAAQ,GAAI3K,CAAK,EAG5G,CACA,GAAI,OAAOsG,EAAO,uBAA0B,SAAU,CAClD,IAAMoE,EAAW,IAAI,OAAO9F,EAAM,YAAY,eAAe0B,CAAM,CAAC,EACpE,QAAWqE,KAAY,OAAO,oBAAoB3K,CAAK,EACnD,GAAI,CAAC0K,EAAS,KAAKC,CAAQ,EAAG,CAC1B,IAAMtB,GAAOtB,EAAMzB,EAAO,sBAAuBM,EAAY,GAAG4C,CAAI,IAAImB,CAAQ,GAAI3K,EAAM2K,CAAQ,CAAC,EAAE,KAAK,EACrGtB,GAAK,OACN,MAAMA,GAAK,MACnB,CAER,CACJ,CACA,SAAUuB,EAAUtE,EAAQM,EAAY4C,EAAMxJ,EAAO,IACxCyE,EAAQ,YAAYzE,CAAK,IAC9B,MAAMsJ,EAAOP,EAAe,SAAUzC,EAAQkD,EAAMxJ,CAAK,EACjE,CACA,SAAU6K,EAASvE,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC1CA,IAAUsG,EAAO,QACnB,MAAMgD,EAAOP,EAAe,QAASzC,EAAQkD,EAAMxJ,CAAK,EAChE,CACA,SAAU8K,GAAOxE,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC9C,MAAMsJ,EAAOP,EAAe,MAAOzC,EAAQkD,EAAMxJ,CAAK,CAC1D,CACA,SAAU+K,EAAKzE,EAAQM,EAAY4C,EAAMxJ,EAAO,CACxC+H,EAAMzB,EAAO,IAAKM,EAAY4C,EAAMxJ,CAAK,EAAE,KAAK,EAAE,OAAS,KAC3D,MAAMsJ,EAAOP,EAAe,IAAKzC,EAAQkD,EAAMxJ,CAAK,EAC5D,CACA,SAAUgL,EAAM1E,EAAQM,EAAY4C,EAAMxJ,EAAO,IACpCyE,EAAQ,QAAQzE,CAAK,IAC1B,MAAMsJ,EAAOP,EAAe,KAAMzC,EAAQkD,EAAMxJ,CAAK,EAC7D,CACA,SAAUiL,EAAQ3E,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC/C,GAAI,CAAC4I,EAAS,iBAAiB,aAAa5I,CAAK,EAC7C,OAAO,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EAC9DkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,oBACvD,MAAMgD,EAAOP,EAAe,uBAAwBzC,EAAQkD,EAAMxJ,CAAK,GAEvEkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,oBACvD,MAAMgD,EAAOP,EAAe,uBAAwBzC,EAAQkD,EAAMxJ,CAAK,GAEvEkJ,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,WAC/C,MAAMgD,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,GAE9DkJ,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,WAC/C,MAAMgD,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,GAE9DkJ,EAAU5C,EAAO,UAAU,GAAOtG,EAAQsG,EAAO,aAAe,IAChE,MAAMgD,EAAOP,EAAe,iBAAkBzC,EAAQkD,EAAMxJ,CAAK,EAEzE,CACA,SAAUkL,GAAQ5E,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC/C,GAAI,CAAC4I,EAAS,iBAAiB,aAAa5I,CAAK,EAC7C,OAAO,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EAC9DkJ,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,iBACxF,MAAMgD,EAAOP,EAAe,oBAAqBzC,EAAQkD,EAAMxJ,CAAK,GAEpEkJ,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,iBACxF,MAAMgD,EAAOP,EAAe,oBAAqBzC,EAAQkD,EAAMxJ,CAAK,GAExE,IAAMmL,EAAe,MAAM,QAAQ7E,EAAO,QAAQ,EAAIA,EAAO,SAAW,CAAC,EACnE8E,EAAY,OAAO,oBAAoB9E,EAAO,UAAU,EACxD+E,GAAc,OAAO,oBAAoBrL,CAAK,EACpD,QAAWsL,MAAeH,EAClBE,GAAY,SAASC,EAAW,IAEpC,MAAMhC,EAAOP,EAAe,uBAAwBzC,EAAO,WAAWgF,EAAW,EAAG,GAAG9B,CAAI,IAAIP,EAAUqC,EAAW,CAAC,GAAI,MAAS,GAEtI,GAAIhF,EAAO,uBAAyB,GAChC,QAAWqE,MAAYU,GACdD,EAAU,SAAST,EAAQ,IAC5B,MAAMrB,EAAOP,EAAe,2BAA4BzC,EAAQ,GAAGkD,CAAI,IAAIP,EAAU0B,EAAQ,CAAC,GAAI3K,EAAM2K,EAAQ,CAAC,GAI7H,GAAI,OAAOrE,EAAO,sBAAyB,SACvC,QAAWqE,MAAYU,GACfD,EAAU,SAAST,EAAQ,IAE/B,MAAO5C,EAAMzB,EAAO,qBAAsBM,EAAY,GAAG4C,CAAI,IAAIP,EAAU0B,EAAQ,CAAC,GAAI3K,EAAM2K,EAAQ,CAAC,GAG/G,QAAWY,MAAYH,EAAW,CAC9B,IAAMI,GAAWlF,EAAO,WAAWiF,EAAQ,EACvCjF,EAAO,UAAYA,EAAO,SAAS,SAASiF,EAAQ,GACpD,MAAOxD,EAAMyD,GAAU5E,EAAY,GAAG4C,CAAI,IAAIP,EAAUsC,EAAQ,CAAC,GAAIvL,EAAMuL,EAAQ,CAAC,EAChF3G,EAAM,iBAAiB,MAAM0B,CAAM,GAAK,EAAEiF,MAAYvL,KACtD,MAAMsJ,EAAOP,EAAe,uBAAwByC,GAAU,GAAGhC,CAAI,IAAIP,EAAUsC,EAAQ,CAAC,GAAI,MAAS,IAIzG3C,EAAS,iBAAiB,wBAAwB5I,EAAOuL,EAAQ,IACjE,MAAOxD,EAAMyD,GAAU5E,EAAY,GAAG4C,CAAI,IAAIP,EAAUsC,EAAQ,CAAC,GAAIvL,EAAMuL,EAAQ,CAAC,EAGhG,CACJ,CACA,SAAUE,GAASnF,EAAQM,EAAY4C,EAAMxJ,EAAO,IACvCyE,EAAQ,WAAWzE,CAAK,IAC7B,MAAMsJ,EAAOP,EAAe,QAASzC,EAAQkD,EAAMxJ,CAAK,EAChE,CACA,SAAU0L,EAAQpF,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC/C,GAAI,CAAC4I,EAAS,iBAAiB,aAAa5I,CAAK,EAC7C,OAAO,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EAC9DkJ,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,iBACxF,MAAMgD,EAAOP,EAAe,oBAAqBzC,EAAQkD,EAAMxJ,CAAK,GAEpEkJ,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,iBACxF,MAAMgD,EAAOP,EAAe,oBAAqBzC,EAAQkD,EAAMxJ,CAAK,GAExE,GAAM,CAAC2L,EAAYC,CAAa,EAAI,OAAO,QAAQtF,EAAO,iBAAiB,EAAE,CAAC,EACxEuF,GAAQ,IAAI,OAAOF,CAAU,EACnC,OAAW,CAACG,GAAaC,EAAa,IAAK,OAAO,QAAQ/L,CAAK,EACvD6L,GAAM,KAAKC,EAAW,IACtB,MAAO/D,EAAM6D,EAAehF,EAAY,GAAG4C,CAAI,IAAIP,EAAU6C,EAAW,CAAC,GAAIC,EAAa,GAElG,GAAI,OAAOzF,EAAO,sBAAyB,SACvC,OAAW,CAACwF,GAAaC,EAAa,IAAK,OAAO,QAAQ/L,CAAK,EACtD6L,GAAM,KAAKC,EAAW,IACvB,MAAO/D,EAAMzB,EAAO,qBAAsBM,EAAY,GAAG4C,CAAI,IAAIP,EAAU6C,EAAW,CAAC,GAAIC,EAAa,GAGpH,GAAIzF,EAAO,uBAAyB,IAChC,OAAW,CAACwF,GAAaC,EAAa,IAAK,OAAO,QAAQ/L,CAAK,EAC3D,GAAI,CAAA6L,GAAM,KAAKC,EAAW,EAE1B,OAAO,MAAMxC,EAAOP,EAAe,2BAA4BzC,EAAQ,GAAGkD,CAAI,IAAIP,EAAU6C,EAAW,CAAC,GAAIC,EAAa,EAGrI,CACA,SAAUC,EAAK1F,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC5C,MAAO+H,KAAUc,EAAQ,OAAOvC,EAAQM,CAAU,EAAGA,EAAY4C,EAAMxJ,CAAK,CAChF,CACA,SAAUiM,GAAQ3F,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC/C,GAAI,IAAKyE,EAAQ,UAAUzE,CAAK,EAC5B,OAAO,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EAC9DkJ,EAAU5C,EAAO,SAAS,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,aACxD,MAAMgD,EAAOP,EAAe,gBAAiBzC,EAAQkD,EAAMxJ,CAAK,GAEhEkJ,EAAU5C,EAAO,SAAS,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,aACxD,MAAMgD,EAAOP,EAAe,gBAAiBzC,EAAQkD,EAAMxJ,CAAK,MAE5DyE,EAAQ,UAAU6B,EAAO,OAAO,IACtB,IAAI,OAAOA,EAAO,OAAO,EAC5B,KAAKtG,CAAK,IACjB,MAAMsJ,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,OAG9DyE,EAAQ,UAAU6B,EAAO,MAAM,IAC9B1B,EAAM,eAAe,IAAI0B,EAAO,MAAM,EAIxB1B,EAAM,eAAe,IAAI0B,EAAO,MAAM,EACzCtG,CAAK,IACb,MAAMsJ,EAAOP,EAAe,aAAczC,EAAQkD,EAAMxJ,CAAK,GALjE,MAAMsJ,EAAOP,EAAe,oBAAqBzC,EAAQkD,EAAMxJ,CAAK,EAShF,CACA,SAAUkM,EAAQ5F,EAAQM,EAAY4C,EAAMxJ,EAAO,IACtCyE,EAAQ,UAAUzE,CAAK,IAC5B,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EAC/D,CACA,SAAUmM,EAAiB7F,EAAQM,EAAY4C,EAAMxJ,EAAO,CACxD,GAAI,IAAKyE,EAAQ,UAAUzE,CAAK,EAC5B,OAAO,MAAMsJ,EAAOP,EAAe,OAAQzC,EAAQkD,EAAMxJ,CAAK,EACpD,IAAI,OAAOsG,EAAO,OAAO,EAC5B,KAAKtG,CAAK,IACjB,MAAMsJ,EAAOP,EAAe,cAAezC,EAAQkD,EAAMxJ,CAAK,EAEtE,CACA,SAAUoM,GAAM9F,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC7C,MAAO+H,KAAUc,EAAQ,OAAOvC,EAAQM,CAAU,EAAGA,EAAY4C,EAAMxJ,CAAK,CAChF,CACA,SAAUqM,EAAO/F,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC9C,GAAI,IAAKyE,EAAQ,SAASzE,CAAK,EAC3B,OAAO,MAAMsJ,EAAOP,EAAe,MAAOzC,EAAQkD,EAAMxJ,CAAK,EACjE,GAAIsG,EAAO,QAAU,QAAetG,EAAM,SAAW,EACjD,OAAO,MAAMsJ,EAAOP,EAAe,YAAazC,EAAQkD,EAAMxJ,CAAK,EAEvE,GAAMA,EAAM,SAAWsG,EAAO,SAC1B,OAAO,MAAMgD,EAAOP,EAAe,YAAazC,EAAQkD,EAAMxJ,CAAK,EAEvE,GAAKsG,EAAO,MAGZ,QAAS3G,EAAI,EAAGA,EAAI2G,EAAO,MAAM,OAAQ3G,IACrC,MAAOoI,EAAMzB,EAAO,MAAM3G,CAAC,EAAGiH,EAAY,GAAG4C,CAAI,IAAI7J,CAAC,GAAIK,EAAML,CAAC,CAAC,CAE1E,CACA,SAAU2M,EAAWhG,EAAQM,EAAY4C,EAAMxJ,EAAO,IACzCyE,EAAQ,aAAazE,CAAK,IAC/B,MAAMsJ,EAAOP,EAAe,UAAWzC,EAAQkD,EAAMxJ,CAAK,EAClE,CACA,SAAUuM,EAAOjG,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC9C,IAAIwM,EAAQ,EACZ,QAAWC,KAAanG,EAAO,MAAO,CAClC,IAAMoG,GAAS,CAAC,GAAG3E,EAAM0E,EAAW7F,EAAY4C,EAAMxJ,CAAK,CAAC,EAC5D,GAAI0M,GAAO,SAAW,EAClB,OACJF,GAASE,GAAO,MACpB,CACIF,EAAQ,IACR,MAAMlD,EAAOP,EAAe,MAAOzC,EAAQkD,EAAMxJ,CAAK,EAE9D,CACA,SAAU2M,EAAYrG,EAAQM,EAAY4C,EAAMxJ,EAAO,CACnD,GAAI,IAAKyE,EAAQ,cAAczE,CAAK,EAChC,OAAO,MAAMsJ,EAAOP,EAAe,WAAYzC,EAAQkD,EAAMxJ,CAAK,EAClEkJ,EAAU5C,EAAO,aAAa,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,iBAC5D,MAAMgD,EAAOP,EAAe,wBAAyBzC,EAAQkD,EAAMxJ,CAAK,GAExEkJ,EAAU5C,EAAO,aAAa,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,iBAC5D,MAAMgD,EAAOP,EAAe,wBAAyBzC,EAAQkD,EAAMxJ,CAAK,EAEhF,CACA,SAAU4M,EAAStG,EAAQM,EAAY4C,EAAMxJ,EAAO,CAAE,CACtD,SAAU6M,EAAMvG,EAAQM,EAAY4C,EAAMxJ,EAAO,CACxC4I,EAAS,iBAAiB,WAAW5I,CAAK,IAC3C,MAAMsJ,EAAOP,EAAe,KAAMzC,EAAQkD,EAAMxJ,CAAK,EAC7D,CACA,SAAU8M,EAAMxG,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC/B4E,EAAM,aAAa,IAAI0B,EAAO1B,EAAM,IAAI,CAAC,EAC5C0B,EAAQtG,CAAK,IACpB,MAAMsJ,EAAOP,EAAe,KAAMzC,EAAQkD,EAAMxJ,CAAK,EAC7D,CACA,SAAU+H,EAAMzB,EAAQM,EAAY4C,EAAMxJ,EAAO,CAC7C,IAAM+M,EAAc7D,EAAU5C,EAAO,GAAG,EAAI,CAAC,GAAGM,EAAYN,CAAM,EAAIM,EAChEoG,EAAU1G,EAChB,OAAQ0G,EAAQpI,EAAM,IAAI,EAAG,CACzB,IAAK,MACD,OAAO,MAAO6E,EAAKuD,EAASD,EAAavD,EAAMxJ,CAAK,EACxD,IAAK,QACD,OAAO,MAAO0J,EAAOsD,EAASD,EAAavD,EAAMxJ,CAAK,EAC1D,IAAK,gBACD,OAAO,MAAOiK,EAAe+C,EAASD,EAAavD,EAAMxJ,CAAK,EAClE,IAAK,SACD,OAAO,MAAOkK,EAAQ8C,EAASD,EAAavD,EAAMxJ,CAAK,EAC3D,IAAK,UACD,OAAO,MAAOmK,EAAS6C,EAASD,EAAavD,EAAMxJ,CAAK,EAC5D,IAAK,cACD,OAAO,MAAOoK,EAAa4C,EAASD,EAAavD,EAAMxJ,CAAK,EAChE,IAAK,OACD,OAAO,MAAOqK,EAAM2C,EAASD,EAAavD,EAAMxJ,CAAK,EACzD,IAAK,WACD,OAAO,MAAOsK,EAAU0C,EAASD,EAAavD,EAAMxJ,CAAK,EAC7D,IAAK,UACD,OAAO,MAAOuK,EAASyC,EAASD,EAAavD,EAAMxJ,CAAK,EAC5D,IAAK,YACD,OAAO,MAAOwK,EAAWwC,EAASD,EAAavD,EAAMxJ,CAAK,EAC9D,IAAK,WACD,OAAO,MAAO4K,EAAUoC,EAASD,EAAavD,EAAMxJ,CAAK,EAC7D,IAAK,UACD,OAAO,MAAO6K,EAASmC,EAASD,EAAavD,EAAMxJ,CAAK,EAC5D,IAAK,QACD,OAAO,MAAO8K,GAAOkC,EAASD,EAAavD,EAAMxJ,CAAK,EAC1D,IAAK,MACD,OAAO,MAAO+K,EAAKiC,EAASD,EAAavD,EAAMxJ,CAAK,EACxD,IAAK,OACD,OAAO,MAAOgL,EAAMgC,EAASD,EAAavD,EAAMxJ,CAAK,EACzD,IAAK,SACD,OAAO,MAAOiL,EAAQ+B,EAASD,EAAavD,EAAMxJ,CAAK,EAC3D,IAAK,SACD,OAAO,MAAOkL,GAAQ8B,EAASD,EAAavD,EAAMxJ,CAAK,EAC3D,IAAK,UACD,OAAO,MAAOyL,GAASuB,EAASD,EAAavD,EAAMxJ,CAAK,EAC5D,IAAK,SACD,OAAO,MAAO0L,EAAQsB,EAASD,EAAavD,EAAMxJ,CAAK,EAC3D,IAAK,MACD,OAAO,MAAOgM,EAAKgB,EAASD,EAAavD,EAAMxJ,CAAK,EACxD,IAAK,SACD,OAAO,MAAOiM,GAAQe,EAASD,EAAavD,EAAMxJ,CAAK,EAC3D,IAAK,SACD,OAAO,MAAOkM,EAAQc,EAASD,EAAavD,EAAMxJ,CAAK,EAC3D,IAAK,kBACD,OAAO,MAAOmM,EAAiBa,EAASD,EAAavD,EAAMxJ,CAAK,EACpE,IAAK,OACD,OAAO,MAAOoM,GAAMY,EAASD,EAAavD,EAAMxJ,CAAK,EACzD,IAAK,QACD,OAAO,MAAOqM,EAAOW,EAASD,EAAavD,EAAMxJ,CAAK,EAC1D,IAAK,YACD,OAAO,MAAOsM,EAAWU,EAASD,EAAavD,EAAMxJ,CAAK,EAC9D,IAAK,QACD,OAAO,MAAOuM,EAAOS,EAASD,EAAavD,EAAMxJ,CAAK,EAC1D,IAAK,aACD,OAAO,MAAO2M,EAAYK,EAASD,EAAavD,EAAMxJ,CAAK,EAC/D,IAAK,UACD,OAAO,MAAO4M,EAASI,EAASD,EAAavD,EAAMxJ,CAAK,EAC5D,IAAK,OACD,OAAO,MAAO6M,EAAMG,EAASD,EAAavD,EAAMxJ,CAAK,EACzD,QACI,GAAI,CAAC4E,EAAM,aAAa,IAAIoI,EAAQpI,EAAM,IAAI,CAAC,EAC3C,MAAM,IAAIoE,EAA4B1C,CAAM,EAChD,OAAO,MAAOwG,EAAME,EAASD,EAAavD,EAAMxJ,CAAK,CAC7D,CACJ,CAEA,SAASiN,KAAUC,EAAM,CACrB,IAAM9D,EAAW8D,EAAK,SAAW,EAAInF,EAAMmF,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAG,GAAIA,EAAK,CAAC,CAAC,EAAInF,EAAMmF,EAAK,CAAC,EAAG,CAAC,EAAG,GAAIA,EAAK,CAAC,CAAC,EAC1G,OAAO,IAAI/D,EAAmBC,CAAQ,CAC1C,CACA/K,EAAQ,OAAS4O,CAAA,CAAA,CAAA,ECvkBjBtI,GAAAvG,GAAA,CAAA,uGAAAC,EAAA,CAAA,aA4BA,IAAI8O,EAAmB9O,GAAQA,EAAK,kBAAqB,OAAO,OAAU,SAAS+O,EAAGC,EAAGC,EAAGC,EAAI,CACxFA,IAAO,SAAWA,EAAKD,GAC3B,IAAIE,EAAO,OAAO,yBAAyBH,EAAGC,CAAC,GAC3C,CAACE,IAAS,QAASA,EAAO,CAACH,EAAE,WAAaG,EAAK,UAAYA,EAAK,iBAClEA,EAAO,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,OAAOH,EAAEC,CAAC,CAAG,CAAE,GAE9D,OAAO,eAAeF,EAAGG,EAAIC,CAAI,CACrC,EAAM,SAASJ,EAAGC,EAAGC,EAAGC,EAAI,CACpBA,IAAO,SAAWA,EAAKD,GAC3BF,EAAEG,CAAE,EAAIF,EAAEC,CAAC,CACf,GACIG,EAAgBpP,GAAQA,EAAK,cAAiB,SAASgP,EAAGhP,EAAS,CACnE,QAASqP,KAAKL,EAAOK,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAKrP,EAASqP,CAAC,GAAGP,EAAgB9O,EAASgP,EAAGK,CAAC,CAC5H,EACA,OAAO,eAAerP,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DoP,EAAa9I,GAAA,EAAqBtG,CAAO,CAAA,CAAA,CAAA,EC3CzCmG,GAAApG,GAAA,CAAA,uGAAAC,EAAA,CAAA,aA4BA,IAAI8O,EAAmB9O,GAAQA,EAAK,kBAAqB,OAAO,OAAU,SAAS+O,EAAGC,EAAGC,EAAGC,EAAI,CACxFA,IAAO,SAAWA,EAAKD,GAC3B,IAAIE,EAAO,OAAO,yBAAyBH,EAAGC,CAAC,GAC3C,CAACE,IAAS,QAASA,EAAO,CAACH,EAAE,WAAaG,EAAK,UAAYA,EAAK,iBAClEA,EAAO,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,OAAOH,EAAEC,CAAC,CAAG,CAAE,GAE9D,OAAO,eAAeF,EAAGG,EAAIC,CAAI,CACrC,EAAM,SAASJ,EAAGC,EAAGC,EAAGC,EAAI,CACpBA,IAAO,SAAWA,EAAKD,GAC3BF,EAAEG,CAAE,EAAIF,EAAEC,CAAC,CACf,GACIG,EAAgBpP,GAAQA,EAAK,cAAiB,SAASgP,EAAGhP,EAAS,CACnE,QAASqP,KAAKL,EAAOK,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAKrP,EAASqP,CAAC,GAAGP,EAAgB9O,EAASgP,EAAGK,CAAC,CAC5H,EACA,OAAO,eAAerP,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,eAAiB,OACzB,IAAIqG,EAAWC,GAAA,EACf,OAAO,eAAetG,EAAS,iBAAkB,CAAE,WAAY,GAAM,IAAK,UAAY,CAAE,OAAOqG,EAAS,cAAgB,CAAE,CAAC,EAC3H+I,EAAajJ,GAAA,EAAqBnG,CAAO,CAAA,CAAA,CAAA,EC9CzCsP,GAAAvP,GAAA,CAAA,sGAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,MAAQA,EAAQ,2BAA6B,OACrD,IAAMoG,EAAUtB,GAAA,EACVyK,EAAUC,GAAA,EACVhF,EAAUrC,GAAA,EACVsC,EAAS/B,GAAA,EACTnC,EAAQC,GAAA,EAIRiJ,EAAN,cAAyClJ,EAAM,YAAa,CACxD,YAAY0B,EAAQ,CAChB,MAAM,cAAc,EACpB,KAAK,OAASA,CAClB,CACJ,EACAjI,EAAQ,2BAA6ByP,EAIrC,SAASC,EAAezH,EAAQ,CAC5B,OAAOA,EAAO1B,EAAM,IAAI,IAAM,OAAS0B,EAAO1B,EAAM,IAAI,IAAM,SAClE,CAIA,SAASsE,EAAUlJ,EAAO,CACtB,OAAOA,IAAU,MACrB,CAIA,SAASyJ,EAAKnD,EAAQM,EAAY5G,EAAO,CACrC,MAAO,EACX,CACA,SAAS0J,EAAOpD,EAAQM,EAAY5G,EAAO,CAavC,GAZI,IAAKyE,EAAQ,SAASzE,CAAK,GAE3BkJ,EAAU5C,EAAO,QAAQ,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,WAGvD4C,EAAU5C,EAAO,QAAQ,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,WAGvD,CAACtG,EAAM,MAAOA,GAAU+H,EAAMzB,EAAO,MAAOM,EAAY5G,CAAK,CAAC,GAI9DsG,EAAO,cAAgB,IAAQ,CAAG,UAAY,CAAE,IAAMqD,EAAM,IAAI,IAAO,QAAWC,KAAW5J,EAAO,CACpG,IAAM6J,KAAaf,EAAO,MAAMc,CAAO,EACvC,GAAID,EAAI,IAAIE,CAAM,EACd,MAAO,GAGPF,EAAI,IAAIE,CAAM,CAEtB,CAAE,MAAO,EAAM,EAAG,EACd,MAAO,GAGX,GAAI,EAAEX,EAAU5C,EAAO,QAAQ,MAAS7B,EAAQ,UAAU6B,EAAO,WAAW,MAAS7B,EAAQ,UAAU6B,EAAO,WAAW,GACrH,MAAO,GAEX,IAAMwD,EAAiBZ,EAAU5C,EAAO,QAAQ,EAAIA,EAAO,SAAW1B,EAAM,KAAK,MAAM,EACjFmF,EAAgB/J,EAAM,OAAO,CAACgK,EAAKhK,IAAW+H,EAAM+B,EAAgBlD,EAAY5G,CAAK,EAAIgK,EAAM,EAAIA,EAAM,CAAC,EAOhH,MANI,EAAAD,IAAkB,MAGdtF,EAAQ,UAAU6B,EAAO,WAAW,GAAKyD,EAAgBzD,EAAO,gBAGhE7B,EAAQ,UAAU6B,EAAO,WAAW,GAAKyD,EAAgBzD,EAAO,YAI5E,CACA,SAAS2D,EAAe3D,EAAQM,EAAY5G,EAAO,CAC/C,SAAWyE,EAAQ,iBAAiBzE,CAAK,CAC7C,CACA,SAASkK,EAAQ5D,EAAQM,EAAY5G,EAAO,CAexC,MAdI,MAAKyE,EAAQ,UAAUzE,CAAK,GAE5BkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,mBAGvD4C,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,mBAGvD4C,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,UAG/C4C,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,UAG/C4C,EAAU5C,EAAO,UAAU,GAAOtG,EAAQsG,EAAO,aAAe,OAAO,CAAC,EAIhF,CACA,SAAS6D,EAAS7D,EAAQM,EAAY5G,EAAO,CACzC,SAAWyE,EAAQ,WAAWzE,CAAK,CACvC,CACA,SAASoK,EAAa9D,EAAQM,EAAY5G,EAAO,CAC7C,OAAO+H,EAAMzB,EAAO,QAASM,EAAY5G,EAAM,SAAS,CAC5D,CACA,SAASqK,EAAM/D,EAAQM,EAAY5G,EAAO,CAetC,MAdI,MAAKyE,EAAQ,QAAQzE,CAAK,GAE1BkJ,EAAU5C,EAAO,yBAAyB,GAAK,EAAEtG,EAAM,QAAQ,EAAIsG,EAAO,4BAG1E4C,EAAU5C,EAAO,yBAAyB,GAAK,EAAEtG,EAAM,QAAQ,EAAIsG,EAAO,4BAG1E4C,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAM,QAAQ,GAAKsG,EAAO,mBAGlE4C,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAM,QAAQ,GAAKsG,EAAO,mBAGlE4C,EAAU5C,EAAO,mBAAmB,GAAOtG,EAAM,QAAQ,EAAIsG,EAAO,sBAAwB,EAIpG,CACA,SAASgE,EAAUhE,EAAQM,EAAY5G,EAAO,CAC1C,SAAWyE,EAAQ,YAAYzE,CAAK,CACxC,CACA,SAASuK,EAASjE,EAAQM,EAAY5G,EAAO,CAgBzC,MAfI,MAAKyE,EAAQ,WAAWzE,CAAK,GAG7BkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,mBAGvD4C,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,mBAGvD4C,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,UAG/C4C,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,UAG/C4C,EAAU5C,EAAO,UAAU,GAAOtG,EAAQsG,EAAO,aAAe,EAIxE,CACA,SAASkE,EAAWlE,EAAQM,EAAY5G,EAAO,CAC3C,IAAMgO,EAAS1H,EAAO,MAAM,MAAOA,GAAWyB,EAAMzB,EAAQM,EAAY5G,CAAK,CAAC,EAC9E,GAAIsG,EAAO,wBAA0B,GAAO,CACxC,IAAM2H,EAAa,IAAI,OAAOrJ,EAAM,YAAY,eAAe0B,CAAM,CAAC,EAChE4H,EAAS,OAAO,oBAAoBlO,CAAK,EAAE,MAAOD,GAAQkO,EAAW,KAAKlO,CAAG,CAAC,EACpF,OAAOiO,GAAUE,CACrB,SACStJ,EAAM,UAAU,QAAQ0B,EAAO,qBAAqB,EAAG,CAC5D,IAAMoE,EAAW,IAAI,OAAO9F,EAAM,YAAY,eAAe0B,CAAM,CAAC,EAC9D4H,EAAS,OAAO,oBAAoBlO,CAAK,EAAE,MAAOD,GAAQ2K,EAAS,KAAK3K,CAAG,GAAKgI,EAAMzB,EAAO,sBAAuBM,EAAY5G,EAAMD,CAAG,CAAC,CAAC,EACjJ,OAAOiO,GAAUE,CACrB,KAEI,QAAOF,CAEf,CACA,SAASpD,EAAUtE,EAAQM,EAAY5G,EAAO,CAC1C,SAAWyE,EAAQ,YAAYzE,CAAK,CACxC,CACA,SAAS6K,EAASvE,EAAQM,EAAY5G,EAAO,CACzC,OAAOA,IAAUsG,EAAO,KAC5B,CACA,SAASwE,EAAOxE,EAAQM,EAAY5G,EAAO,CACvC,MAAO,EACX,CACA,SAAS+K,EAAKzE,EAAQM,EAAY5G,EAAO,CACrC,MAAO,CAAC+H,EAAMzB,EAAO,IAAKM,EAAY5G,CAAK,CAC/C,CACA,SAASgL,EAAM1E,EAAQM,EAAY5G,EAAO,CACtC,SAAWyE,EAAQ,QAAQzE,CAAK,CACpC,CACA,SAASiL,GAAQ3E,EAAQM,EAAY5G,EAAO,CAexC,MAdI,GAAC4N,EAAQ,iBAAiB,aAAa5N,CAAK,GAE5CkJ,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,mBAGvD4C,EAAU5C,EAAO,gBAAgB,GAAK,EAAEtG,EAAQsG,EAAO,mBAGvD4C,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,UAG/C4C,EAAU5C,EAAO,OAAO,GAAK,EAAEtG,GAASsG,EAAO,UAG/C4C,EAAU5C,EAAO,UAAU,GAAOtG,EAAQsG,EAAO,aAAe,EAIxE,CACA,SAAS4E,EAAQ5E,EAAQM,EAAY5G,EAAO,CAMxC,GALI,CAAC4N,EAAQ,iBAAiB,aAAa5N,CAAK,GAE5CkJ,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,gBAGxF4C,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,eACxF,MAAO,GAEX,IAAM8E,EAAY,OAAO,oBAAoB9E,EAAO,UAAU,EAC9D,QAAWiF,KAAYH,EAAW,CAC9B,IAAMI,EAAWlF,EAAO,WAAWiF,CAAQ,EAC3C,GAAIjF,EAAO,UAAYA,EAAO,SAAS,SAASiF,CAAQ,GAIpD,GAHI,CAACxD,EAAMyD,EAAU5E,EAAY5G,EAAMuL,CAAQ,CAAC,IAG3C3G,EAAM,iBAAiB,MAAM4G,CAAQ,GAAKuC,EAAevC,CAAQ,IAAM,EAAED,KAAYvL,GACtF,MAAO,WAIP4N,EAAQ,iBAAiB,wBAAwB5N,EAAOuL,CAAQ,GAAK,CAACxD,EAAMyD,EAAU5E,EAAY5G,EAAMuL,CAAQ,CAAC,EACjH,MAAO,EAGnB,CACA,GAAIjF,EAAO,uBAAyB,GAAO,CACvC,IAAM6H,EAAY,OAAO,oBAAoBnO,CAAK,EAElD,OAAIsG,EAAO,UAAYA,EAAO,SAAS,SAAW8E,EAAU,QAAU+C,EAAU,SAAW/C,EAAU,OAC1F,GAGA+C,EAAU,MAAOxD,GAAaS,EAAU,SAAST,CAAQ,CAAC,CAEzE,KAAA,QACS,OAAOrE,EAAO,sBAAyB,SAC1B,OAAO,oBAAoBtG,CAAK,EACjC,MAAOD,GAAQqL,EAAU,SAASrL,CAAG,GAAKgI,EAAMzB,EAAO,qBAAsBM,EAAY5G,EAAMD,CAAG,CAAC,CAAC,EAG9G,EAEf,CACA,SAAS0L,EAASnF,EAAQM,EAAY5G,EAAO,CACzC,SAAWyE,EAAQ,WAAWzE,CAAK,CACvC,CACA,SAAS0L,EAAQpF,EAAQM,EAAY5G,EAAO,CAOxC,GANI,CAAC4N,EAAQ,iBAAiB,aAAa5N,CAAK,GAG5CkJ,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,gBAGxF4C,EAAU5C,EAAO,aAAa,GAAK,EAAE,OAAO,oBAAoBtG,CAAK,EAAE,QAAUsG,EAAO,eACxF,MAAO,GAEX,GAAM,CAACqF,EAAYC,CAAa,EAAI,OAAO,QAAQtF,EAAO,iBAAiB,EAAE,CAAC,EACxEuF,EAAQ,IAAI,OAAOF,CAAU,EAE7BqC,EAAS,OAAO,QAAQhO,CAAK,EAAE,MAAM,CAAC,CAACD,GAAKC,EAAK,IAC3C6L,EAAM,KAAK9L,EAAG,EAAKgI,EAAM6D,EAAehF,EAAY5G,EAAK,EAAI,EACxE,EAEKkO,EAAS,OAAO5H,EAAO,sBAAyB,SAAW,OAAO,QAAQtG,CAAK,EAAE,MAAM,CAAC,CAACD,GAAKC,EAAK,IAC5F6L,EAAM,KAAK9L,EAAG,EAA6D,GAAxDgI,EAAMzB,EAAO,qBAAsBM,EAAY5G,EAAK,CACnF,EAAI,GACCoO,EAAS9H,EAAO,uBAAyB,GACzC,OAAO,oBAAoBtG,CAAK,EAAE,MAAOD,IAChC8L,EAAM,KAAK9L,EAAG,CACxB,EACC,GACN,OAAOiO,GAAUE,GAAUE,CAC/B,CACA,SAASpC,GAAK1F,EAAQM,EAAY5G,EAAO,CACrC,OAAO+H,KAAUc,EAAQ,OAAOvC,EAAQM,CAAU,EAAGA,EAAY5G,CAAK,CAC1E,CACA,SAASiM,GAAQ3F,EAAQM,EAAY5G,EAAO,CAYxC,MAXI,IAAKyE,EAAQ,UAAUzE,CAAK,GAG5BkJ,EAAU5C,EAAO,SAAS,GACtB,EAAEtG,EAAM,QAAUsG,EAAO,YAG7B4C,EAAU5C,EAAO,SAAS,GACtB,EAAEtG,EAAM,QAAUsG,EAAO,YAG7B4C,EAAU5C,EAAO,OAAO,GAEpB,CADU,IAAI,OAAOA,EAAO,OAAO,EAC5B,KAAKtG,CAAK,EACV,GAEXkJ,EAAU5C,EAAO,MAAM,EAClB1B,EAAM,eAAe,IAAI0B,EAAO,MAAM,EAE9B1B,EAAM,eAAe,IAAI0B,EAAO,MAAM,EACvCtG,CAAK,EAFN,GAIR,EACX,CACA,SAASkM,EAAQ5F,EAAQM,EAAY5G,EAAO,CACxC,SAAWyE,EAAQ,UAAUzE,CAAK,CACtC,CACA,SAASmM,EAAiB7F,EAAQM,EAAY5G,EAAO,CACjD,SAAWyE,EAAQ,UAAUzE,CAAK,GAAK,IAAI,OAAOsG,EAAO,OAAO,EAAE,KAAKtG,CAAK,CAChF,CACA,SAASoM,GAAM9F,EAAQM,EAAY5G,EAAO,CACtC,OAAO+H,KAAUc,EAAQ,OAAOvC,EAAQM,CAAU,EAAGA,EAAY5G,CAAK,CAC1E,CACA,SAASqM,EAAO/F,EAAQM,EAAY5G,EAAO,CAOvC,GANI,IAAKyE,EAAQ,SAASzE,CAAK,GAG3BsG,EAAO,QAAU,QAAetG,EAAM,SAAW,GAG/CA,EAAM,SAAWsG,EAAO,SAC1B,MAAO,GAEX,GAAI,CAACA,EAAO,MACR,MAAO,GAEX,QAAS3G,EAAI,EAAGA,EAAI2G,EAAO,MAAM,OAAQ3G,IACrC,GAAI,CAACoI,EAAMzB,EAAO,MAAM3G,CAAC,EAAGiH,EAAY5G,EAAML,CAAC,CAAC,EAC5C,MAAO,GAEf,MAAO,EACX,CACA,SAAS2M,EAAWhG,EAAQM,EAAY5G,EAAO,CAC3C,SAAWyE,EAAQ,aAAazE,CAAK,CACzC,CACA,SAASuM,GAAOjG,EAAQM,EAAY5G,EAAO,CACvC,OAAOsG,EAAO,MAAM,KAAMmE,GAAU1C,EAAM0C,EAAO7D,EAAY5G,CAAK,CAAC,CACvE,CACA,SAAS2M,EAAYrG,EAAQM,EAAY5G,EAAO,CAO5C,MANI,MAAKyE,EAAQ,cAAczE,CAAK,GAGhCkJ,EAAU5C,EAAO,aAAa,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,gBAG5D4C,EAAU5C,EAAO,aAAa,GAAK,EAAEtG,EAAM,QAAUsG,EAAO,eAIpE,CACA,SAASsG,EAAStG,EAAQM,EAAY5G,EAAO,CACzC,MAAO,EACX,CACA,SAAS6M,EAAMvG,EAAQM,EAAY5G,EAAO,CACtC,OAAO4N,EAAQ,iBAAiB,WAAW5N,CAAK,CACpD,CACA,SAAS8M,EAAMxG,EAAQM,EAAY5G,EAAO,CACtC,OAAK4E,EAAM,aAAa,IAAI0B,EAAO1B,EAAM,IAAI,CAAC,EAEjCA,EAAM,aAAa,IAAI0B,EAAO1B,EAAM,IAAI,CAAC,EAC1C0B,EAAQtG,CAAK,EAFd,EAGf,CACA,SAAS+H,EAAMzB,EAAQM,EAAY5G,EAAO,CACtC,IAAM+M,EAAc7D,EAAU5C,EAAO,GAAG,EAAI,CAAC,GAAGM,EAAYN,CAAM,EAAIM,EAChEoG,EAAU1G,EAChB,OAAQ0G,EAAQpI,EAAM,IAAI,EAAG,CACzB,IAAK,MACD,OAAO6E,EAAKuD,EAASD,EAAa/M,CAAK,EAC3C,IAAK,QACD,OAAO0J,EAAOsD,EAASD,EAAa/M,CAAK,EAC7C,IAAK,gBACD,OAAOiK,EAAe+C,EAASD,EAAa/M,CAAK,EACrD,IAAK,SACD,OAAOkK,EAAQ8C,EAASD,EAAa/M,CAAK,EAC9C,IAAK,UACD,OAAOmK,EAAS6C,EAASD,EAAa/M,CAAK,EAC/C,IAAK,cACD,OAAOoK,EAAa4C,EAASD,EAAa/M,CAAK,EACnD,IAAK,OACD,OAAOqK,EAAM2C,EAASD,EAAa/M,CAAK,EAC5C,IAAK,WACD,OAAOsK,EAAU0C,EAASD,EAAa/M,CAAK,EAChD,IAAK,UACD,OAAOuK,EAASyC,EAASD,EAAa/M,CAAK,EAC/C,IAAK,YACD,OAAOwK,EAAWwC,EAASD,EAAa/M,CAAK,EACjD,IAAK,WACD,OAAO4K,EAAUoC,EAASD,EAAa/M,CAAK,EAChD,IAAK,UACD,OAAO6K,EAASmC,EAASD,EAAa/M,CAAK,EAC/C,IAAK,QACD,OAAO8K,EAAOkC,EAASD,EAAa/M,CAAK,EAC7C,IAAK,MACD,OAAO+K,EAAKiC,EAASD,EAAa/M,CAAK,EAC3C,IAAK,OACD,OAAOgL,EAAMgC,EAASD,EAAa/M,CAAK,EAC5C,IAAK,SACD,OAAOiL,GAAQ+B,EAASD,EAAa/M,CAAK,EAC9C,IAAK,SACD,OAAOkL,EAAQ8B,EAASD,EAAa/M,CAAK,EAC9C,IAAK,UACD,OAAOyL,EAASuB,EAASD,EAAa/M,CAAK,EAC/C,IAAK,SACD,OAAO0L,EAAQsB,EAASD,EAAa/M,CAAK,EAC9C,IAAK,MACD,OAAOgM,GAAKgB,EAASD,EAAa/M,CAAK,EAC3C,IAAK,SACD,OAAOiM,GAAQe,EAASD,EAAa/M,CAAK,EAC9C,IAAK,SACD,OAAOkM,EAAQc,EAASD,EAAa/M,CAAK,EAC9C,IAAK,kBACD,OAAOmM,EAAiBa,EAASD,EAAa/M,CAAK,EACvD,IAAK,OACD,OAAOoM,GAAMY,EAASD,EAAa/M,CAAK,EAC5C,IAAK,QACD,OAAOqM,EAAOW,EAASD,EAAa/M,CAAK,EAC7C,IAAK,YACD,OAAOsM,EAAWU,EAASD,EAAa/M,CAAK,EACjD,IAAK,QACD,OAAOuM,GAAOS,EAASD,EAAa/M,CAAK,EAC7C,IAAK,aACD,OAAO2M,EAAYK,EAASD,EAAa/M,CAAK,EAClD,IAAK,UACD,OAAO4M,EAASI,EAASD,EAAa/M,CAAK,EAC/C,IAAK,OACD,OAAO6M,EAAMG,EAASD,EAAa/M,CAAK,EAC5C,QACI,GAAI,CAAC4E,EAAM,aAAa,IAAIoI,EAAQpI,EAAM,IAAI,CAAC,EAC3C,MAAM,IAAIkJ,EAA2Bd,CAAO,EAChD,OAAOF,EAAME,EAASD,EAAa/M,CAAK,CAChD,CACJ,CAEA,SAASqO,KAASnB,EAAM,CACpB,OAAOA,EAAK,SAAW,EAAInF,EAAMmF,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAAInF,EAAMmF,EAAK,CAAC,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,CAC5F,CACA7O,EAAQ,MAAQgQ,CAAA,CAAA,CAAA,EC9chBC,GAAAlQ,GAAA,CAAA,0GAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,gBAAkBA,EAAQ,gBAAkBA,EAAQ,aAAeA,EAAQ,qBAAuBA,EAAQ,qBAAuBA,EAAQ,0BAA4BA,EAAQ,0BAA4B,OACjN,IAAMoG,EAAUtB,GAAA,EACV0F,EAAUrC,GAAA,EACV+H,EAAUZ,GAAA,EACV/I,EAAQC,GAAA,EAIR2J,EAAN,cAAwC5J,EAAM,YAAa,CACvD,YAAY0B,EAAQtG,EAAOyO,EAAO,CAC9B,MAAM,uCAAuC,EAC7C,KAAK,OAASnI,EACd,KAAK,MAAQtG,EACb,KAAK,MAAQyO,CACjB,CACJ,EACApQ,EAAQ,0BAA4BmQ,EACpC,IAAME,EAAN,cAAwC9J,EAAM,YAAa,CACvD,YAAY0B,EAAQtG,EAAOyO,EAAO,CAC9B,MAAM,uCAAuC,EAC7C,KAAK,OAASnI,EACd,KAAK,MAAQtG,EACb,KAAK,MAAQyO,CACjB,CACJ,EACApQ,EAAQ,0BAA4BqQ,EACpC,IAAMC,EAAN,cAAmC/J,EAAM,YAAa,CAClD,YAAY0B,EAAQtG,EAAOyO,EAAO,CAC9B,MAAM,GAAGA,aAAiB,MAAQA,EAAM,QAAU,eAAe,EAAE,EACnE,KAAK,OAASnI,EACd,KAAK,MAAQtG,CACjB,CACJ,EACA3B,EAAQ,qBAAuBsQ,EAC/B,IAAMC,EAAN,cAAmChK,EAAM,YAAa,CAClD,YAAY0B,EAAQtG,EAAOyO,EAAO,CAC9B,MAAM,GAAGA,aAAiB,MAAQA,EAAM,QAAU,eAAe,EAAE,EACnE,KAAK,OAASnI,EACd,KAAK,MAAQtG,CACjB,CACJ,EACA3B,EAAQ,qBAAuBuQ,EAK/B,IAAIC,GACH,SAAUA,EAAc,CACrB,SAASnF,EAAOpD,EAAQM,EAAY,CAChC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,MAAOM,CAAU,CAC/E,CACA,SAASqD,EAAe3D,EAAQM,EAAY,CACxC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,MAAOM,CAAU,CAC/E,CACA,SAASwD,EAAa9D,EAAQM,EAAY,CACtC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,QAASM,CAAU,GAAKN,EAAO,WAAW,KAAMA,IAAWyB,EAAMzB,GAAQM,CAAU,CAAC,CAClJ,CACA,SAAS0D,EAAUhE,EAAQM,EAAY,CACnC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,QAASM,CAAU,GAAKN,EAAO,WAAW,KAAMA,IAAWyB,EAAMzB,GAAQM,CAAU,CAAC,CAClJ,CACA,SAAS4D,EAAWlE,EAAQM,EAAY,CACpC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAK1B,EAAM,UAAU,WAAW0B,EAAO,qBAAqB,GAAKA,EAAO,MAAM,KAAMA,IAAWyB,EAAMzB,GAAQM,CAAU,CAAC,CACpK,CACA,SAASgE,EAAUtE,EAAQM,EAAY,CACnC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,MAAOM,CAAU,CAC/E,CACA,SAASmE,EAAKzE,EAAQM,EAAY,CAC9B,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,IAAKM,CAAU,CAC7E,CACA,SAASsE,EAAQ5E,EAAQM,EAAY,CAEjC,OAAQhC,EAAM,UAAU,WAAW0B,CAAM,GAAK,OAAO,OAAOA,EAAO,UAAU,EAAE,KAAMA,IAAWyB,EAAMzB,GAAQM,CAAU,CAAC,GAAKhC,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,GAAKyB,EAAMzB,EAAO,qBAAsBM,CAAU,CACvO,CACA,SAAS6E,EAASnF,EAAQM,EAAY,CAClC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMzB,EAAO,KAAMM,CAAU,CAC9E,CACA,SAAS8E,EAAQpF,EAAQM,EAAY,CACjC,IAAMkI,GAAU,OAAO,oBAAoBxI,EAAO,iBAAiB,EAAE,CAAC,EAChEkF,EAAWlF,EAAO,kBAAkBwI,EAAO,EACjD,OAAOlK,EAAM,UAAU,WAAW0B,CAAM,GAAKyB,EAAMyD,EAAU5E,CAAU,GAAMhC,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,GAAK1B,EAAM,UAAU,WAAW0B,EAAO,oBAAoB,CAC/L,CACA,SAAS0F,EAAK1F,EAAQM,EAAY,CAC9B,OAAIhC,EAAM,UAAU,WAAW0B,CAAM,EAC1B,GACJyB,KAAUc,EAAQ,OAAOvC,EAAQM,CAAU,EAAGA,CAAU,CACnE,CACA,SAASwF,GAAM9F,EAAQM,EAAY,CAC/B,OAAIhC,EAAM,UAAU,WAAW0B,CAAM,EAC1B,GACJyB,KAAUc,EAAQ,OAAOvC,EAAQM,CAAU,EAAGA,CAAU,CACnE,CACA,SAASyF,EAAO/F,EAAQM,EAAY,CAChC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAM,IAAK7B,EAAQ,aAAa6B,EAAO,KAAK,GAAKA,EAAO,MAAM,KAAMA,IAAWyB,EAAMzB,GAAQM,CAAU,CAAC,CACpJ,CACA,SAAS2F,EAAOjG,EAAQM,EAAY,CAChC,OAAOhC,EAAM,UAAU,WAAW0B,CAAM,GAAKA,EAAO,MAAM,KAAMA,IAAWyB,EAAMzB,GAAQM,CAAU,CAAC,CACxG,CACA,SAASmB,EAAMzB,EAAQM,EAAY,CAC/B,IAAMmG,MAAkBtI,EAAQ,UAAU6B,EAAO,GAAG,EAAI,CAAC,GAAGM,EAAYN,CAAM,EAAIM,EAC5EoG,EAAU1G,EAChB,GAAIA,EAAO,KAAOyI,GAAQ,IAAIzI,EAAO,GAAG,EACpC,MAAO,GAGX,OAFIA,EAAO,KACPyI,GAAQ,IAAIzI,EAAO,GAAG,EAClBA,EAAO1B,EAAM,IAAI,EAAG,CACxB,IAAK,QACD,OAAO8E,EAAOsD,EAASD,EAAW,EACtC,IAAK,gBACD,OAAO9C,EAAe+C,EAASD,EAAW,EAC9C,IAAK,cACD,OAAO3C,EAAa4C,EAASD,EAAW,EAC5C,IAAK,WACD,OAAOzC,EAAU0C,EAASD,EAAW,EACzC,IAAK,YACD,OAAOvC,EAAWwC,EAASD,EAAW,EAC1C,IAAK,WACD,OAAOnC,EAAUoC,EAASD,EAAW,EACzC,IAAK,MACD,OAAOhC,EAAKiC,EAASD,EAAW,EACpC,IAAK,SACD,OAAO7B,EAAQ8B,EAASD,EAAW,EACvC,IAAK,UACD,OAAOtB,EAASuB,EAASD,EAAW,EACxC,IAAK,SACD,OAAOrB,EAAQsB,EAASD,EAAW,EACvC,IAAK,MACD,OAAOf,EAAKgB,EAASD,EAAW,EACpC,IAAK,OACD,OAAOX,GAAMY,EAASD,EAAW,EACrC,IAAK,QACD,OAAOV,EAAOW,EAASD,EAAW,EACtC,IAAK,QACD,OAAOR,EAAOS,EAASD,EAAW,EACtC,QACI,OAAOnI,EAAM,UAAU,WAAW0B,CAAM,CAChD,CACJ,CACA,IAAMyI,GAAU,IAAI,IAEpB,SAASC,GAAI1I,EAAQM,EAAY,CAC7B,OAAAmI,GAAQ,MAAM,EACPhH,EAAMzB,EAAQM,CAAU,CACnC,CACAiI,EAAa,IAAMG,EACvB,GAAGH,IAAiBxQ,EAAQ,aAAewQ,EAAe,CAAC,EAAE,EAK7D,IAAII,GACH,SAAUA,EAAiB,CACxB,SAASC,EAAQ5I,EAAQtG,EAAO,CAC5B,GAAI,CACA,OAAO4E,EAAM,UAAU,WAAW0B,CAAM,EAAIA,EAAO1B,EAAM,SAAS,EAAE,OAAO5E,CAAK,EAAIA,CACxF,OACOyO,EAAO,CACV,MAAM,IAAIE,EAAqBrI,EAAQtG,EAAOyO,CAAK,CACvD,CACJ,CAEA,SAAS/E,EAAOpD,EAAQM,EAAY5G,EAAO,CACvC,SAAYyE,EAAQ,SAASzE,CAAK,EAC5BkP,EAAQ5I,EAAQtG,EAAM,IAAKA,IAAU+H,EAAMzB,EAAO,MAAOM,EAAY5G,EAAK,CAAC,CAAC,EAC5EkP,EAAQ5I,EAAQtG,CAAK,CAC/B,CAEA,SAASwK,EAAWlE,EAAQM,EAAY5G,EAAO,CAC3C,GAAI,IAAKyE,EAAQ,eAAezE,CAAK,MAASyE,EAAQ,aAAazE,CAAK,EACpE,OAAOkP,EAAQ5I,EAAQtG,CAAK,EAChC,IAAMoL,GAAYxG,EAAM,YAAY,YAAY0B,EAAQ,CAAE,gBAAiB,EAAM,CAAC,EAC5E6I,GAAkB/D,GAAU,OAAO,CAACpL,EAAOD,IACrCA,KAAOC,EACT,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGgI,EAAMnD,EAAM,gBAAgB,QAAQ0B,EAAQ,CAACvG,CAAG,CAAC,EAAG6G,EAAY5G,EAAMD,CAAG,CAAC,CAAE,EAC/FC,EACPA,CAAK,EACR,GAAI,CAAC4E,EAAM,UAAU,WAAW0B,EAAO,qBAAqB,EACxD,OAAO4I,EAAQ5I,EAAQ6I,EAAe,EAE1C,IAAM9D,EAAc,OAAO,oBAAoB8D,EAAe,EACxDC,EAAwB9I,EAAO,sBAC/B+I,GAAoBhE,EAAY,OAAO,CAACrL,EAAOD,IACzCqL,GAAU,SAASrL,CAAG,EAExBC,EADA,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGmP,EAAQE,EAAuBpP,EAAMD,CAAG,CAAC,CAAE,EAErEoP,EAAe,EAClB,OAAOD,EAAQ5I,EAAQ+I,EAAiB,CAC5C,CACA,SAAStE,EAAKzE,EAAQM,EAAY5G,EAAO,CACrC,OAAOkP,EAAQ5I,EAAQyB,EAAMzB,EAAO,IAAKM,EAAY5G,CAAK,CAAC,CAC/D,CAEA,SAASkL,EAAQ5E,EAAQM,EAAY5G,EAAO,CACxC,GAAI,IAAKyE,EAAQ,eAAezE,CAAK,EACjC,OAAOkP,EAAQ5I,EAAQtG,CAAK,EAChC,IAAMoL,GAAYxG,EAAM,YAAY,YAAY0B,EAAQ,CAAE,gBAAiB,EAAM,CAAC,EAC5E6I,GAAkB/D,GAAU,OAAO,CAACpL,EAAOD,IACrCA,KAAOC,EACT,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGgI,EAAMzB,EAAO,WAAWvG,CAAG,EAAG6G,EAAY5G,EAAMD,CAAG,CAAC,CAAE,EACzEC,EACPA,CAAK,EACR,GAAI,CAAC4E,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,EACpD,OAAO4I,EAAQ5I,EAAQ6I,EAAe,EAE1C,IAAM9D,EAAc,OAAO,oBAAoB8D,EAAe,EACxDG,EAAuBhJ,EAAO,qBAC9B+I,GAAoBhE,EAAY,OAAO,CAACrL,EAAOD,IACzCqL,GAAU,SAASrL,CAAG,EAExBC,EADA,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGmP,EAAQI,EAAsBtP,EAAMD,CAAG,CAAC,CAAE,EAEpEoP,EAAe,EAClB,OAAOD,EAAQ5I,EAAQ+I,EAAiB,CAC5C,CAEA,SAAS3D,EAAQpF,EAAQM,EAAY5G,EAAO,CACxC,GAAI,IAAKyE,EAAQ,eAAezE,CAAK,EACjC,OAAOkP,EAAQ5I,EAAQtG,CAAK,EAChC,IAAM8O,GAAU,OAAO,oBAAoBxI,EAAO,iBAAiB,EAAE,CAAC,EAChE8E,GAAY,IAAI,OAAO0D,EAAO,EAC9BK,EAAkB,OAAO,oBAAoBnP,CAAK,EAAE,OAAO,CAACA,EAAOD,KAC9DqL,GAAU,KAAKrL,EAAG,EACnB,CAAE,GAAGC,EAAO,CAACD,EAAG,EAAGgI,EAAMzB,EAAO,kBAAkBwI,EAAO,EAAGlI,EAAY5G,EAAMD,EAAG,CAAC,CAAE,EACpFC,EACPA,CAAK,EACR,GAAI,CAAC4E,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,EACpD,OAAO4I,EAAQ5I,EAAQ6I,CAAe,EAE1C,IAAM9D,EAAc,OAAO,oBAAoB8D,CAAe,EACxDG,GAAuBhJ,EAAO,qBAC9B+I,EAAoBhE,EAAY,OAAO,CAACrL,EAAOD,KACzCqL,GAAU,KAAKrL,EAAG,EAEpBC,EADA,CAAE,GAAGA,EAAO,CAACD,EAAG,EAAGmP,EAAQI,GAAsBtP,EAAMD,EAAG,CAAC,CAAE,EAEpEoP,CAAe,EAClB,OAAOD,EAAQ5I,EAAQ+I,CAAiB,CAC5C,CACA,SAASrD,EAAK1F,EAAQM,EAAY5G,EAAO,CACrC,IAAM8G,MAAa+B,EAAQ,OAAOvC,EAAQM,CAAU,EACpD,OAAOsI,EAAQ5I,EAAQyB,EAAMjB,GAAQF,EAAY5G,CAAK,CAAC,CAC3D,CACA,SAASoM,EAAM9F,EAAQM,EAAY5G,EAAO,CACtC,IAAM8G,MAAa+B,EAAQ,OAAOvC,EAAQM,CAAU,EACpD,OAAOsI,EAAQ5I,EAAQyB,EAAMjB,GAAQF,EAAY5G,CAAK,CAAC,CAC3D,CAEA,SAASqM,EAAO/F,EAAQM,EAAY5G,EAAO,CACvC,SAAYyE,EAAQ,SAASzE,CAAK,MAASyE,EAAQ,SAAS6B,EAAO,KAAK,EAClE4I,EAAQ5I,EAAQA,EAAO,MAAM,IAAI,CAACA,GAAQO,KAAUkB,EAAMzB,GAAQM,EAAY5G,EAAM6G,EAAK,CAAC,CAAC,CAAC,EAC5FqI,EAAQ5I,EAAQtG,CAAK,CAC/B,CACA,SAASuM,EAAOjG,EAAQM,EAAY5G,EAAO,CACvC,IAAMuP,GAAYL,EAAQ5I,EAAQtG,CAAK,EACvC,QAAWyM,MAAanG,EAAO,MAC3B,MAASiI,EAAQ,OAAO9B,GAAW7F,EAAY2I,EAAS,EAExD,OAAOxH,EAAM0E,GAAW7F,EAAY2I,EAAS,EAEjD,OAAOA,EACX,CACA,SAASxH,EAAMzB,EAAQM,EAAY5G,EAAO,CACtC,IAAM+M,GAAc,OAAOzG,EAAO,KAAQ,SAAW,CAAC,GAAGM,EAAYN,CAAM,EAAIM,EACzEoG,GAAU1G,EAChB,OAAQA,EAAO1B,EAAM,IAAI,EAAG,CACxB,IAAK,QACD,OAAO8E,EAAOsD,GAASD,GAAa/M,CAAK,EAC7C,IAAK,YACD,OAAOwK,EAAWwC,GAASD,GAAa/M,CAAK,EACjD,IAAK,MACD,OAAO+K,EAAKiC,GAASD,GAAa/M,CAAK,EAC3C,IAAK,SACD,OAAOkL,EAAQ8B,GAASD,GAAa/M,CAAK,EAC9C,IAAK,SACD,OAAO0L,EAAQsB,GAASD,GAAa/M,CAAK,EAC9C,IAAK,MACD,OAAOgM,EAAKgB,GAASD,GAAa/M,CAAK,EAC3C,IAAK,SACD,OAAOkP,EAAQlC,GAAShN,CAAK,EACjC,IAAK,OACD,OAAOoM,EAAMY,GAASD,GAAa/M,CAAK,EAC5C,IAAK,QACD,OAAOqM,EAAOW,GAASD,GAAa/M,CAAK,EAC7C,IAAK,QACD,OAAOuM,EAAOS,GAASD,GAAa/M,CAAK,EAC7C,QACI,OAAOkP,EAAQlC,GAAShN,CAAK,CACrC,CACJ,CACA,SAASwP,GAAOlJ,EAAQM,EAAY5G,EAAO,CACvC,OAAO+H,EAAMzB,EAAQM,EAAY5G,CAAK,CAC1C,CACAiP,EAAgB,OAASO,EAC7B,GAAGP,IAAoB5Q,EAAQ,gBAAkB4Q,EAAkB,CAAC,EAAE,EAKtE,IAAIQ,GACH,SAAUA,EAAiB,CACxB,SAASP,EAAQ5I,EAAQtG,EAAO,CAC5B,GAAI,CACA,OAAO4E,EAAM,UAAU,WAAW0B,CAAM,EAAIA,EAAO1B,EAAM,SAAS,EAAE,OAAO5E,CAAK,EAAIA,CACxF,OACOyO,EAAO,CACV,MAAM,IAAIG,EAAqBtI,EAAQtG,EAAOyO,CAAK,CACvD,CACJ,CAEA,SAAS/E,EAAOpD,EAAQM,EAAY5G,EAAO,CACvC,IAAMuP,GAAYL,EAAQ5I,EAAQtG,CAAK,EACvC,SAAWyE,EAAQ,SAAS8K,EAAS,EAC/BA,GAAU,IAAKvP,IAAU+H,EAAMzB,EAAO,MAAOM,EAAY5G,EAAK,CAAC,EAC/DuP,EACV,CAEA,SAAS/E,EAAWlE,EAAQM,EAAY5G,EAAO,CAC3C,IAAMuP,GAAYL,EAAQ5I,EAAQtG,CAAK,EACvC,GAAI,IAAKyE,EAAQ,eAAezE,CAAK,MAASyE,EAAQ,aAAazE,CAAK,EACpE,OAAOuP,GACX,IAAMnE,GAAYxG,EAAM,YAAY,YAAY0B,EAAQ,CAAE,gBAAiB,EAAM,CAAC,EAC5E6I,EAAkB/D,GAAU,OAAO,CAACpL,EAAOD,IACtCA,KAAOwP,GACR,CAAE,GAAGvP,EAAO,CAACD,CAAG,EAAGgI,EAAMnD,EAAM,gBAAgB,QAAQ0B,EAAQ,CAACvG,CAAG,CAAC,EAAG6G,EAAY5G,EAAMD,CAAG,CAAC,CAAE,EAC/FC,EACPuP,EAAS,EACZ,GAAI,CAAC3K,EAAM,UAAU,WAAW0B,EAAO,qBAAqB,EACxD,OAAO4I,EAAQ5I,EAAQ6I,CAAe,EAE1C,IAAM9D,EAAc,OAAO,oBAAoB8D,CAAe,EACxDC,GAAwB9I,EAAO,sBACrC,OAAO+E,EAAY,OAAO,CAACrL,EAAOD,IACtBqL,GAAU,SAASrL,CAAG,EAExBC,EADA,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGmP,EAAQE,GAAuBpP,EAAMD,CAAG,CAAC,CAAE,EAErEoP,CAAe,CACtB,CACA,SAASpE,EAAKzE,EAAQM,EAAY5G,EAAO,CACrC,OAAOkP,EAAQ5I,EAAO,IAAK4I,EAAQ5I,EAAQtG,CAAK,CAAC,CACrD,CAEA,SAASkL,EAAQ5E,EAAQM,EAAY5G,EAAO,CACxC,IAAMuP,GAAYL,EAAQ5I,EAAQtG,CAAK,EACvC,GAAI,IAAKyE,EAAQ,eAAezE,CAAK,EACjC,OAAOuP,GACX,IAAMnE,GAAYxG,EAAM,YAAY,YAAY0B,EAAQ,CAAE,gBAAiB,EAAM,CAAC,EAC5E6I,EAAkB/D,GAAU,OAAO,CAACpL,EAAOD,IACtCA,KAAOC,EACR,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGgI,EAAMzB,EAAO,WAAWvG,CAAG,EAAG6G,EAAY5G,EAAMD,CAAG,CAAC,CAAE,EACzEC,EACPuP,EAAS,EACZ,GAAI,CAAC3K,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,EACpD,OAAO6I,EAEX,IAAM9D,EAAc,OAAO,oBAAoB8D,CAAe,EACxDG,GAAuBhJ,EAAO,qBACpC,OAAO+E,EAAY,OAAO,CAACrL,EAAOD,IACtBqL,GAAU,SAASrL,CAAG,EAExBC,EADA,CAAE,GAAGA,EAAO,CAACD,CAAG,EAAGmP,EAAQI,GAAsBtP,EAAMD,CAAG,CAAC,CAAE,EAEpEoP,CAAe,CACtB,CAEA,SAASzD,EAAQpF,EAAQM,EAAY5G,EAAO,CACxC,IAAMuP,GAAYL,EAAQ5I,EAAQtG,CAAK,EACvC,GAAI,IAAKyE,EAAQ,eAAezE,CAAK,EACjC,OAAOuP,GACX,IAAMT,GAAU,OAAO,oBAAoBxI,EAAO,iBAAiB,EAAE,CAAC,EAChE8E,EAAY,IAAI,OAAO0D,EAAO,EAC9BK,EAAkB,OAAO,oBAAoBnP,CAAK,EAAE,OAAO,CAACA,EAAOD,KAC9DqL,EAAU,KAAKrL,EAAG,EACnB,CAAE,GAAGC,EAAO,CAACD,EAAG,EAAGgI,EAAMzB,EAAO,kBAAkBwI,EAAO,EAAGlI,EAAY5G,EAAMD,EAAG,CAAC,CAAE,EACpFC,EACPuP,EAAS,EACZ,GAAI,CAAC3K,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,EACpD,OAAO4I,EAAQ5I,EAAQ6I,CAAe,EAE1C,IAAM9D,GAAc,OAAO,oBAAoB8D,CAAe,EACxDG,EAAuBhJ,EAAO,qBACpC,OAAO+E,GAAY,OAAO,CAACrL,EAAOD,KACtBqL,EAAU,KAAKrL,EAAG,EAEpBC,EADA,CAAE,GAAGA,EAAO,CAACD,EAAG,EAAGmP,EAAQI,EAAsBtP,EAAMD,EAAG,CAAC,CAAE,EAEpEoP,CAAe,CACtB,CACA,SAASnD,EAAK1F,EAAQM,EAAY5G,EAAO,CACrC,IAAM8G,MAAa+B,EAAQ,OAAOvC,EAAQM,CAAU,EAC9C8I,GAAW3H,EAAMjB,GAAQF,EAAY5G,CAAK,EAChD,OAAOkP,EAAQ5I,EAAQoJ,EAAQ,CACnC,CACA,SAAStD,EAAM9F,EAAQM,EAAY5G,EAAO,CACtC,IAAM8G,MAAa+B,EAAQ,OAAOvC,EAAQM,CAAU,EAC9C8I,GAAW3H,EAAMjB,GAAQF,EAAY5G,CAAK,EAChD,OAAOkP,EAAQ5I,EAAQoJ,EAAQ,CACnC,CACA,SAASrD,EAAO/F,EAAQM,EAAY5G,EAAO,CACvC,IAAM2P,GAAST,EAAQ5I,EAAQtG,CAAK,EACpC,SAAWyE,EAAQ,SAAS6B,EAAO,KAAK,EAAIA,EAAO,MAAM,IAAI,CAACA,GAAQO,IAAUkB,EAAMzB,GAAQM,EAAY+I,GAAO9I,CAAK,CAAC,CAAC,EAAI,CAAC,CACjI,CACA,SAAS0F,EAAOjG,EAAQM,EAAY5G,EAAO,CAEvC,QAAWyM,MAAanG,EAAO,MAAO,CAClC,GAAI,IAAKiI,EAAQ,OAAO9B,GAAW7F,EAAY5G,CAAK,EAChD,SACJ,IAAM2P,GAAS5H,EAAM0E,GAAW7F,EAAY5G,CAAK,EACjD,OAAOkP,EAAQ5I,EAAQqJ,EAAM,CACjC,CAEA,QAAWlD,MAAanG,EAAO,MAAO,CAClC,IAAMqJ,GAAS5H,EAAM0E,GAAW7F,EAAY5G,CAAK,EACjD,MAASuO,EAAQ,OAAOjI,EAAQM,EAAY+I,EAAM,EAElD,OAAOT,EAAQ5I,EAAQqJ,EAAM,CACjC,CACA,OAAOT,EAAQ5I,EAAQtG,CAAK,CAChC,CACA,SAAS+H,EAAMzB,EAAQM,EAAY5G,EAAO,CACtC,IAAM+M,GAAc,OAAOzG,EAAO,KAAQ,SAAW,CAAC,GAAGM,EAAYN,CAAM,EAAIM,EACzEoG,GAAU1G,EAChB,OAAQA,EAAO1B,EAAM,IAAI,EAAG,CACxB,IAAK,QACD,OAAO8E,EAAOsD,GAASD,GAAa/M,CAAK,EAC7C,IAAK,YACD,OAAOwK,EAAWwC,GAASD,GAAa/M,CAAK,EACjD,IAAK,MACD,OAAO+K,EAAKiC,GAASD,GAAa/M,CAAK,EAC3C,IAAK,SACD,OAAOkL,EAAQ8B,GAASD,GAAa/M,CAAK,EAC9C,IAAK,SACD,OAAO0L,EAAQsB,GAASD,GAAa/M,CAAK,EAC9C,IAAK,MACD,OAAOgM,EAAKgB,GAASD,GAAa/M,CAAK,EAC3C,IAAK,OACD,OAAOoM,EAAMY,GAASD,GAAa/M,CAAK,EAC5C,IAAK,QACD,OAAOqM,EAAOW,GAASD,GAAa/M,CAAK,EAC7C,IAAK,QACD,OAAOuM,EAAOS,GAASD,GAAa/M,CAAK,EAC7C,QACI,OAAOkP,EAAQlC,GAAShN,CAAK,CACrC,CACJ,CACA,SAAS4P,GAAOtJ,EAAQM,EAAY5G,EAAO,CACvC,OAAO+H,EAAMzB,EAAQM,EAAY5G,CAAK,CAC1C,CACAyP,EAAgB,OAASG,EAC7B,GAAGH,IAAoBpR,EAAQ,gBAAkBoR,EAAkB,CAAC,EAAE,CAAA,CAAA,CAAA,ECxdtEI,GAAAzR,GAAA,CAAA,4GAAAC,EAAA,CAAA,aA4BA,OAAO,eAAeA,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,aAAeA,EAAQ,OAASA,EAAQ,2BAA6BA,EAAQ,6BAA+BA,EAAQ,UAAY,OACxI,IAAMyR,EAAcxB,GAAA,EACd7J,EAAUtB,GAAA,EACVuB,EAAWC,GAAA,EACXiJ,EAAUC,GAAA,EACVhF,EAAUrC,GAAA,EACVsC,EAAS/B,GAAA,EACTnC,EAAQC,GAAA,EAIRkL,EAAN,KAAgB,CACZ,YAAYzJ,EAAQM,EAAYoJ,EAAWC,EAAM,CAC7C,KAAK,OAAS3J,EACd,KAAK,WAAaM,EAClB,KAAK,UAAYoJ,EACjB,KAAK,KAAOC,EACZ,KAAK,aAAeH,EAAY,aAAa,IAAIxJ,EAAQM,CAAU,CACvE,CAEA,MAAO,CACH,OAAO,KAAK,IAChB,CAEA,OAAO5G,EAAO,CACV,SAAW0E,EAAS,QAAQ,KAAK,OAAQ,KAAK,WAAY1E,CAAK,CACnE,CAEA,MAAMA,EAAO,CACT,OAAO,KAAK,UAAUA,CAAK,CAC/B,CAEA,OAAOA,EAAO,CACV,GAAI,CAAC,KAAK,UAAUA,CAAK,EACrB,MAAM,IAAI8P,EAAY,0BAA0B,KAAK,OAAQ9P,EAAO,KAAK,OAAOA,CAAK,EAAE,MAAM,CAAC,EAClG,OAAO,KAAK,aAAe8P,EAAY,gBAAgB,OAAO,KAAK,OAAQ,KAAK,WAAY9P,CAAK,EAAIA,CACzG,CAEA,OAAOA,EAAO,CACV,IAAMkQ,EAAU,KAAK,aAAeJ,EAAY,gBAAgB,OAAO,KAAK,OAAQ,KAAK,WAAY9P,CAAK,EAAIA,EAC9G,GAAI,CAAC,KAAK,UAAUkQ,CAAO,EACvB,MAAM,IAAIJ,EAAY,0BAA0B,KAAK,OAAQ9P,EAAO,KAAK,OAAOA,CAAK,EAAE,MAAM,CAAC,EAClG,OAAOkQ,CACX,CACJ,EACA7R,EAAQ,UAAY0R,EAIpB,IAAII,GACH,SAAUA,EAAW,CAClB,SAASC,EAAWH,EAAM,CACtB,OAAOA,IAAS,EACpB,CACAE,EAAU,WAAaC,EACvB,SAASC,EAAaJ,EAAM,CACxB,OAAOA,IAAS,EACpB,CACAE,EAAU,aAAeE,EACzB,SAASC,EAAQL,EAAM,CACnB,OAAQA,GAAQ,IAAMA,GAAQ,IAAQA,GAAQ,IAAMA,GAAQ,GAChE,CACAE,EAAU,QAAUG,EACpB,SAASC,EAAUN,EAAM,CACrB,OAAOA,GAAQ,IAAMA,GAAQ,EACjC,CACAE,EAAU,UAAYI,CAC1B,GAAGJ,IAAcA,EAAY,CAAC,EAAE,EAIhC,IAAIK,GACH,SAAUA,EAAkB,CACzB,SAASC,EAAwBzQ,EAAO,CACpC,OAAIA,EAAM,SAAW,EACV,GACJmQ,EAAU,UAAUnQ,EAAM,WAAW,CAAC,CAAC,CAClD,CACA,SAAS0Q,EAAW1Q,EAAO,CACvB,GAAIyQ,EAAwBzQ,CAAK,EAC7B,MAAO,GACX,QAASL,EAAI,EAAGA,EAAIK,EAAM,OAAQL,IAAK,CACnC,IAAMsQ,GAAOjQ,EAAM,WAAWL,CAAC,EAE/B,GAAI,EADUwQ,EAAU,QAAQF,EAAI,GAAKE,EAAU,UAAUF,EAAI,GAAKE,EAAU,WAAWF,EAAI,GAAKE,EAAU,aAAaF,EAAI,GAE3H,MAAO,EACf,CACA,MAAO,EACX,CACA,SAASU,EAAa5Q,EAAK,CACvB,OAAOA,EAAI,QAAQ,KAAM,KAAK,CAClC,CACA,SAAS6P,EAAOgB,EAAQ7Q,EAAK,CACzB,OAAO2Q,EAAW3Q,CAAG,EAAI,GAAG6Q,CAAM,IAAI7Q,CAAG,GAAK,GAAG6Q,CAAM,KAAKD,EAAa5Q,CAAG,CAAC,IACjF,CACAyQ,EAAiB,OAASZ,CAC9B,GAAGY,IAAqBA,EAAmB,CAAC,EAAE,EAI9C,IAAIK,GACH,SAAUA,EAAY,CACnB,SAASjB,EAAOkB,EAAK,CACjB,IAAMC,EAAS,CAAC,EAChB,QAASpR,EAAI,EAAGA,EAAImR,EAAI,OAAQnR,IAAK,CACjC,IAAMsQ,EAAOa,EAAI,WAAWnR,CAAC,EACzBwQ,EAAU,UAAUF,CAAI,GAAKE,EAAU,QAAQF,CAAI,EACnDc,EAAO,KAAKD,EAAI,OAAOnR,CAAC,CAAC,EAGzBoR,EAAO,KAAK,IAAId,CAAI,GAAG,CAE/B,CACA,OAAOc,EAAO,KAAK,EAAE,EAAE,QAAQ,MAAO,GAAG,CAC7C,CACAF,EAAW,OAASjB,CACxB,GAAGiB,IAAeA,EAAa,CAAC,EAAE,EAIlC,IAAIG,GACH,SAAUA,EAAe,CACtB,SAASC,EAAOC,EAAS,CACrB,OAAOA,EAAQ,QAAQ,KAAM,KAAK,CACtC,CACAF,EAAc,OAASC,CAC3B,GAAGD,IAAkBA,EAAgB,CAAC,EAAE,EAIxC,IAAMG,EAAN,cAA2CvM,EAAM,YAAa,CAC1D,YAAY0B,EAAQ,CAChB,MAAM,cAAc,EACpB,KAAK,OAASA,CAClB,CACJ,EACAjI,EAAQ,6BAA+B8S,EACvC,IAAMC,EAAN,cAAyCxM,EAAM,YAAa,CACxD,YAAY0B,EAAQ,CAChB,MAAM,iEAAiE,EACvE,KAAK,OAASA,CAClB,CACJ,EACAjI,EAAQ,2BAA6B+S,EAIrC,IAAIC,GACH,SAAUA,EAAQ,CACf,SAASvL,EAAwB9F,EAAOD,GAAKuR,EAAY,CACrD,OAAO1D,EAAQ,iBAAiB,2BAA6B,KAAK7N,EAAG,QAAQC,CAAK,MAAMsR,CAAU,WAAa,IAAId,EAAiB,OAAOxQ,EAAOD,EAAG,CAAC,oBAAoBuR,CAAU,UACxL,CACAD,EAAO,wBAA0BvL,EACjC,SAASC,EAAa/F,EAAO,CACzB,OAAQ4N,EAAQ,iBAAiB,iBAAuG,WAAW5N,CAAK,oBAAoBA,CAAK,aAA7H,WAAWA,CAAK,oBAAoBA,CAAK,+BAA+BA,CAAK,IACrI,CACAqR,EAAO,aAAetL,EACtB,SAASE,EAAajG,EAAO,CACzB,OAAQ4N,EAAQ,iBAAiB,iBAE3B,WAAW5N,CAAK,oBAAoBA,CAAK,kBAAkBA,CAAK,0BAA0BA,CAAK,2BAD/F,WAAWA,CAAK,oBAAoBA,CAAK,+BAA+BA,CAAK,UAAUA,CAAK,0BAA0BA,CAAK,0BAErI,CACAqR,EAAO,aAAepL,EACtB,SAASC,EAAalG,EAAO,CACzB,OAAQ4N,EAAQ,iBAAiB,SAA2E,UAAU5N,CAAK,gBAA/E,WAAWA,CAAK,oCAAoCA,CAAK,IACzG,CACAqR,EAAO,aAAenL,EACtB,SAASE,EAAWpG,EAAO,CACvB,OAAO4N,EAAQ,iBAAiB,cAAgB,IAAI5N,CAAK,qBAAqBA,CAAK,aAAe,GAAGA,CAAK,gBAC9G,CACAqR,EAAO,WAAajL,CACxB,GAAGiL,IAAWhT,EAAQ,OAASgT,EAAS,CAAC,EAAE,EAE3C,IAAIE,GACH,SAAUA,EAAc,CAIrB,SAASxD,EAAezH,EAAQ,CAC5B,OAAOA,EAAO1B,EAAM,IAAI,IAAM,OAAS0B,EAAO1B,EAAM,IAAI,IAAM,SAClE,CAIA,SAAU6E,EAAKnD,EAAQM,GAAY5G,EAAO,CACtC,KAAM,MACV,CACA,SAAU0J,EAAOpD,EAAQM,GAAY5G,EAAO,CACxC,KAAM,iBAAiBA,CAAK,IAC5B,GAAM,CAACwR,GAAWC,EAAW,EAAI,CAACC,GAAgB,QAAS,KAAK,EAAGA,GAAgB,MAAO,QAAQ,CAAC,KAC3FjN,EAAQ,UAAU6B,EAAO,QAAQ,IACrC,KAAM,GAAGtG,CAAK,cAAcsG,EAAO,QAAQ,OACvC7B,EAAQ,UAAU6B,EAAO,QAAQ,IACrC,KAAM,GAAGtG,CAAK,cAAcsG,EAAO,QAAQ,IAC/C,IAAMqL,GAAoBC,GAAiBtL,EAAO,MAAOM,GAAY,OAAO,EAE5E,GADA,KAAM,GAAG5G,CAAK,WAAWwR,EAAS,QAAQG,EAAiB,IACvD/M,EAAM,UAAU,QAAQ0B,EAAO,QAAQ,MAAS7B,EAAQ,UAAU6B,EAAO,WAAW,MAAS7B,EAAQ,UAAU6B,EAAO,WAAW,EAAG,CACpI,IAAMwD,GAAiBlF,EAAM,UAAU,QAAQ0B,EAAO,QAAQ,EAAIA,EAAO,SAAW1B,EAAM,KAAK,MAAM,EAC/FiN,GAAkBD,GAAiB9H,GAAgBlD,GAAY,OAAO,EACtEkL,MAAuBrN,EAAQ,UAAU6B,EAAO,WAAW,EAAI,CAAC,aAAaA,EAAO,WAAW,GAAG,EAAI,CAAC,EACvGyL,MAAuBtN,EAAQ,UAAU6B,EAAO,WAAW,EAAI,CAAC,aAAaA,EAAO,WAAW,GAAG,EAAI,CAAC,EACvG0L,GAAa,+BAA+BP,EAAW,KAAKD,EAAS,QAAQK,EAAe,uBAC5F1M,GAAQ,CAAC,cAAe,GAAG2M,GAAkB,GAAGC,EAAgB,EAAE,KAAK,MAAM,EACnF,KAAM,KAAKP,EAAS,UAAUQ,EAAU,YAAY7M,EAAK,MAAMnF,CAAK,GACxE,CACIsG,EAAO,cAAgB,KAGvB,KAAM,KAAKkL,EAAS,6KAAqBxR,CAAK,IAEtD,CACA,SAAUiK,EAAe3D,EAAQM,GAAY5G,EAAO,CAChD,KAAM,yDAAyDA,CAAK,GACxE,CACA,SAAUkK,EAAQ5D,EAAQM,GAAY5G,EAAO,CACzC,KAAM,WAAWA,CAAK,oBACdyE,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,aAAasG,EAAO,gBAAgB,QAC9C7B,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,aAAasG,EAAO,gBAAgB,QAC9C7B,EAAQ,UAAU6B,EAAO,OAAO,IACpC,KAAM,GAAGtG,CAAK,cAAcsG,EAAO,OAAO,QACtC7B,EAAQ,UAAU6B,EAAO,OAAO,IACpC,KAAM,GAAGtG,CAAK,cAAcsG,EAAO,OAAO,QACtC7B,EAAQ,UAAU6B,EAAO,UAAU,IACvC,KAAM,IAAItG,CAAK,aAAasG,EAAO,UAAU,WACrD,CACA,SAAU6D,EAAS7D,EAAQM,GAAY5G,EAAO,CAC1C,KAAM,WAAWA,CAAK,iBAC1B,CACA,SAAUoK,GAAa9D,EAAQM,GAAY5G,EAAO,CAC9C,MAAO+H,EAAMzB,EAAO,QAASM,GAAY,GAAG5G,CAAK,YAAY,CACjE,CACA,SAAUqK,EAAM/D,EAAQM,GAAY5G,EAAO,CACvC,KAAM,IAAIA,CAAK,wCAAwCA,CAAK,iBACpDyE,EAAQ,UAAU6B,EAAO,yBAAyB,IACtD,KAAM,GAAGtG,CAAK,gBAAgBsG,EAAO,yBAAyB,OAC1D7B,EAAQ,UAAU6B,EAAO,yBAAyB,IACtD,KAAM,GAAGtG,CAAK,gBAAgBsG,EAAO,yBAAyB,OAC1D7B,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,iBAAiBsG,EAAO,gBAAgB,OAClD7B,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,iBAAiBsG,EAAO,gBAAgB,OAClD7B,EAAQ,UAAU6B,EAAO,mBAAmB,IAChD,KAAM,IAAItG,CAAK,gBAAgBsG,EAAO,mBAAmB,UACjE,CACA,SAAUgE,EAAUhE,EAAQM,GAAY5G,EAAO,CAC3C,KAAM,WAAWA,CAAK,kBAC1B,CACA,SAAUuK,EAASjE,EAAQM,GAAY5G,EAAO,CAC1C,KAAM,WAAWA,CAAK,qCAAqCA,CAAK,QACxDyE,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,MAAMsG,EAAO,gBAAgB,OACvC7B,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,MAAMsG,EAAO,gBAAgB,OACvC7B,EAAQ,UAAU6B,EAAO,OAAO,IACpC,KAAM,GAAGtG,CAAK,OAAOsG,EAAO,OAAO,OAC/B7B,EAAQ,UAAU6B,EAAO,OAAO,IACpC,KAAM,GAAGtG,CAAK,OAAOsG,EAAO,OAAO,OAC/B7B,EAAQ,UAAU6B,EAAO,UAAU,IACvC,KAAM,IAAItG,CAAK,MAAMsG,EAAO,UAAU,UAC9C,CACA,SAAUkE,GAAWlE,EAAQM,GAAY5G,EAAO,CAC5C,IAAMgO,GAAS1H,EAAO,MAAM,IAAKA,IAAWsL,GAAiBtL,GAAQM,GAAY5G,CAAK,CAAC,EAAE,KAAK,MAAM,EACpG,GAAIsG,EAAO,wBAA0B,GAAO,CACxC,IAAMoE,GAAWuH,GAAe,GAAG,IAAI,OAAOrN,EAAM,YAAY,eAAe0B,CAAM,CAAC,CAAC,GAAG,EACpF4H,GAAS,8BAA8BlO,CAAK,kBAAkB0K,EAAQ,cAC5E,KAAM,IAAIsD,EAAM,OAAOE,EAAM,GACjC,SACStJ,EAAM,UAAU,QAAQ0B,EAAO,qBAAqB,EAAG,CAC5D,IAAMoE,GAAWuH,GAAe,GAAG,IAAI,OAAOrN,EAAM,YAAY,eAAe0B,CAAM,CAAC,CAAC,GAAG,EACpF4H,GAAS,8BAA8BlO,CAAK,kBAAkB0K,EAAQ,iBAAiBkH,GAAiBtL,EAAO,sBAAuBM,GAAY,GAAG5G,CAAK,OAAO,CAAC,IACxK,KAAM,IAAIgO,EAAM,OAAOE,EAAM,GACjC,MAEI,KAAM,IAAIF,EAAM,GAExB,CACA,SAAUpD,GAAUtE,EAAQM,GAAY5G,EAAO,CAC3C,KAAM,oDAAoDA,CAAK,GACnE,CACA,SAAU6K,EAASvE,EAAQM,GAAY5G,EAAO,CACtC,OAAOsG,EAAO,OAAU,UAAY,OAAOA,EAAO,OAAU,UAC5D,KAAM,IAAItG,CAAK,QAAQsG,EAAO,KAAK,IAGnC,KAAM,IAAItG,CAAK,SAASgR,EAAc,OAAO1K,EAAO,KAAK,CAAC,IAElE,CACA,SAAUwE,EAAOxE,EAAQM,GAAY5G,EAAO,CACxC,KAAM,OACV,CACA,SAAU+K,GAAKzE,EAAQM,GAAY5G,EAAO,CAEtC,KAAM,KADa4R,GAAiBtL,EAAO,IAAKM,GAAY5G,CAAK,CAC5C,GACzB,CACA,SAAUgL,EAAM1E,EAAQM,GAAY5G,EAAO,CACvC,KAAM,IAAIA,CAAK,YACnB,CACA,SAAUiL,EAAQ3E,EAAQM,GAAY5G,EAAO,CACzC,MAAMqR,EAAO,aAAarR,CAAK,KACvByE,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,MAAMsG,EAAO,gBAAgB,OACvC7B,EAAQ,UAAU6B,EAAO,gBAAgB,IAC7C,KAAM,GAAGtG,CAAK,MAAMsG,EAAO,gBAAgB,OACvC7B,EAAQ,UAAU6B,EAAO,OAAO,IACpC,KAAM,GAAGtG,CAAK,OAAOsG,EAAO,OAAO,OAC/B7B,EAAQ,UAAU6B,EAAO,OAAO,IACpC,KAAM,GAAGtG,CAAK,OAAOsG,EAAO,OAAO,OAC/B7B,EAAQ,UAAU6B,EAAO,UAAU,IACvC,KAAM,IAAItG,CAAK,MAAMsG,EAAO,UAAU,UAC9C,CACA,SAAU4E,GAAQ5E,EAAQM,GAAY5G,EAAO,CACzC,MAAMqR,EAAO,aAAarR,CAAK,KACvByE,EAAQ,UAAU6B,EAAO,aAAa,IAC1C,KAAM,8BAA8BtG,CAAK,eAAesG,EAAO,aAAa,OACxE7B,EAAQ,UAAU6B,EAAO,aAAa,IAC1C,KAAM,8BAA8BtG,CAAK,eAAesG,EAAO,aAAa,IAChF,IAAM8E,GAAY,OAAO,oBAAoB9E,EAAO,UAAU,EAC9D,QAAWiF,MAAYH,GAAW,CAC9B,IAAM8G,GAAmB1B,EAAiB,OAAOxQ,EAAOuL,EAAQ,EAC1DC,GAAWlF,EAAO,WAAWiF,EAAQ,EAC3C,GAAIjF,EAAO,UAAYA,EAAO,SAAS,SAASiF,EAAQ,EACpD,MAAOxD,EAAMyD,GAAU5E,GAAYsL,EAAgB,GAC/CtN,EAAM,iBAAiB,MAAM4G,EAAQ,GAAKuC,EAAevC,EAAQ,KACjE,KAAM,KAAKD,EAAQ,QAAQvL,CAAK,SAEnC,CACD,IAAMsR,GAAaM,GAAiBpG,GAAU5E,GAAYsL,EAAgB,EAC1E,MAAMb,EAAO,wBAAwBrR,EAAOuL,GAAU+F,EAAU,CACpE,CACJ,CACA,GAAIhL,EAAO,uBAAyB,GAChC,GAAIA,EAAO,UAAYA,EAAO,SAAS,SAAW8E,GAAU,OACxD,KAAM,8BAA8BpL,CAAK,gBAAgBoL,GAAU,MAAM,OAExE,CACD,IAAMtL,GAAO,IAAIsL,GAAU,IAAKrL,IAAQ,IAAIA,EAAG,GAAG,EAAE,KAAK,IAAI,CAAC,IAC9D,KAAM,8BAA8BC,CAAK,kBAAkBF,EAAI,iBACnE,CAEJ,GAAI,OAAOwG,EAAO,sBAAyB,SAAU,CACjD,IAAMgL,GAAaM,GAAiBtL,EAAO,qBAAsBM,GAAY,GAAG5G,CAAK,OAAO,EACtFF,GAAO,IAAIsL,GAAU,IAAKrL,IAAQ,IAAIA,EAAG,GAAG,EAAE,KAAK,IAAI,CAAC,IAC9D,KAAM,+BAA+BC,CAAK,kBAAkBF,EAAI,qBAAqBwR,EAAU,IACnG,CACJ,CACA,SAAU7F,EAASnF,EAAQM,GAAY5G,EAAO,CAC1C,KAAM,wCAAwCA,CAAK,uBACvD,CACA,SAAU0L,EAAQpF,EAAQM,GAAY5G,EAAO,CACzC,MAAMqR,EAAO,aAAarR,CAAK,KACvByE,EAAQ,UAAU6B,EAAO,aAAa,IAC1C,KAAM,8BAA8BtG,CAAK,eAAesG,EAAO,aAAa,OACxE7B,EAAQ,UAAU6B,EAAO,aAAa,IAC1C,KAAM,8BAA8BtG,CAAK,eAAesG,EAAO,aAAa,IAChF,GAAM,CAACqF,GAAYC,EAAa,EAAI,OAAO,QAAQtF,EAAO,iBAAiB,EAAE,CAAC,EACxE6L,GAAWF,GAAe,GAAG,IAAI,OAAOtG,EAAU,CAAC,EAAE,EACrDqC,GAAS4D,GAAiBhG,GAAehF,GAAY,OAAO,EAC5DsH,GAAStJ,EAAM,UAAU,QAAQ0B,EAAO,oBAAoB,EAAIsL,GAAiBtL,EAAO,qBAAsBM,GAAY5G,CAAK,EAAIsG,EAAO,uBAAyB,GAAQ,QAAU,OACrLgL,GAAa,IAAIa,EAAQ,gBAAgBnE,EAAM,MAAME,EAAM,IACjE,KAAM,mBAAmBlO,CAAK,6BAA6BsR,EAAU,IACzE,CACA,SAAUtF,EAAK1F,EAAQM,GAAY5G,EAAO,CACtC,IAAM8G,MAAa+B,EAAQ,OAAOvC,EAAQM,EAAU,EAGpD,GAAIwL,GAAM,UAAU,IAAI9L,EAAO,IAAI,EAC/B,OAAO,KAAM,GAAG+L,GAAmB/L,EAAO,IAAI,CAAC,IAAItG,CAAK,IAC5D,MAAO+H,EAAMjB,GAAQF,GAAY5G,CAAK,CAC1C,CACA,SAAUiM,EAAQ3F,EAAQM,GAAY5G,EAAO,CACzC,KAAM,WAAWA,CAAK,oBACdyE,EAAQ,UAAU6B,EAAO,SAAS,IACtC,KAAM,GAAGtG,CAAK,cAAcsG,EAAO,SAAS,OACxC7B,EAAQ,UAAU6B,EAAO,SAAS,IACtC,KAAM,GAAGtG,CAAK,cAAcsG,EAAO,SAAS,IAC5CA,EAAO,UAAY,SAEnB,KAAM,GADW2L,GAAe,GAAG,IAAI,OAAO3L,EAAO,OAAO,CAAC,GAAG,CAC/C,SAAStG,CAAK,KAE/BsG,EAAO,SAAW,SAClB,KAAM,WAAWA,EAAO,MAAM,MAAMtG,CAAK,IAEjD,CACA,SAAUkM,EAAQ5F,EAAQM,GAAY5G,EAAO,CACzC,KAAM,WAAWA,CAAK,gBAC1B,CACA,SAAUmM,EAAiB7F,EAAQM,GAAY5G,EAAO,CAClD,KAAM,WAAWA,CAAK,iBAEtB,KAAM,GADWiS,GAAe,GAAG,IAAI,OAAO3L,EAAO,OAAO,CAAC,GAAG,CAC/C,SAAStG,CAAK,GACnC,CACA,SAAUoM,EAAM9F,EAAQM,GAAY5G,EAAO,CAEvC,KAAM,GAAGqS,GAAmB/L,EAAO,IAAI,CAAC,IAAItG,CAAK,GACrD,CACA,SAAUqM,EAAO/F,EAAQM,GAAY5G,EAAO,CAExC,GADA,KAAM,iBAAiBA,CAAK,IACxBsG,EAAO,QAAU,OACjB,OAAO,KAAM,GAAGtG,CAAK,gBACzB,KAAM,IAAIA,CAAK,eAAesG,EAAO,QAAQ,IAC7C,QAAS3G,GAAI,EAAGA,GAAI2G,EAAO,MAAM,OAAQ3G,KAErC,KAAM,GADaiS,GAAiBtL,EAAO,MAAM3G,EAAC,EAAGiH,GAAY,GAAG5G,CAAK,IAAIL,EAAC,GAAG,CAC9D,EAE3B,CACA,SAAU2M,EAAWhG,EAAQM,GAAY5G,EAAO,CAC5C,KAAM,GAAGA,CAAK,gBAClB,CACA,SAAUuM,EAAOjG,EAAQM,GAAY5G,EAAO,CAExC,KAAM,IADcsG,EAAO,MAAM,IAAKA,IAAWsL,GAAiBtL,GAAQM,GAAY5G,CAAK,CAAC,EACtE,KAAK,MAAM,CAAC,GACtC,CACA,SAAU2M,EAAYrG,EAAQM,GAAY5G,EAAO,CAC7C,KAAM,GAAGA,CAAK,4BACNyE,EAAQ,UAAU6B,EAAO,aAAa,IAC1C,KAAM,IAAItG,CAAK,cAAcsG,EAAO,aAAa,QAC7C7B,EAAQ,UAAU6B,EAAO,aAAa,IAC1C,KAAM,IAAItG,CAAK,cAAcsG,EAAO,aAAa,IACzD,CACA,SAAUsG,EAAStG,EAAQM,GAAY5G,EAAO,CAC1C,KAAM,MACV,CACA,SAAU6M,EAAMvG,EAAQM,GAAY5G,EAAO,CACvC,MAAMqR,EAAO,WAAWrR,CAAK,CACjC,CACA,SAAU8M,EAAMxG,EAAQM,GAAY5G,EAAO,CACvC,IAAMsS,GAAWF,GAAM,UAAU,KACjCA,GAAM,UAAU,IAAIE,GAAUhM,CAAM,EACpC,KAAM,SAASA,EAAO1B,EAAM,IAAI,CAAC,MAAM0N,EAAQ,KAAKtS,CAAK,GAC7D,CACA,SAAU+H,EAAMzB,EAAQM,GAAY5G,EAAOuS,GAAc,GAAM,CAC3D,IAAMxF,MAAkBtI,EAAQ,UAAU6B,EAAO,GAAG,EAAI,CAAC,GAAGM,GAAYN,CAAM,EAAIM,GAC5EoG,GAAU1G,EAIhB,GAAIiM,OAAmB9N,EAAQ,UAAU6B,EAAO,GAAG,EAAG,CAClD,IAAMkM,GAAeH,GAAmB/L,EAAO,GAAG,EAClD,GAAI8L,GAAM,UAAU,IAAII,EAAY,EAChC,OAAO,KAAM,GAAGA,EAAY,IAAIxS,CAAK,IAEpC,CACD,IAAMyS,GAAeC,GAAeF,GAAclM,EAAQM,GAAY,QAAS,EAAK,EACpF,OAAAwL,GAAM,UAAU,IAAII,GAAcC,EAAY,EACvC,KAAM,GAAGD,EAAY,IAAIxS,CAAK,GACzC,CACJ,CACA,OAAQgN,GAAQpI,EAAM,IAAI,EAAG,CACzB,IAAK,MACD,OAAO,MAAO6E,EAAKuD,GAASD,GAAa/M,CAAK,EAClD,IAAK,QACD,OAAO,MAAO0J,EAAOsD,GAASD,GAAa/M,CAAK,EACpD,IAAK,gBACD,OAAO,MAAOiK,EAAe+C,GAASD,GAAa/M,CAAK,EAC5D,IAAK,SACD,OAAO,MAAOkK,EAAQ8C,GAASD,GAAa/M,CAAK,EACrD,IAAK,UACD,OAAO,MAAOmK,EAAS6C,GAASD,GAAa/M,CAAK,EACtD,IAAK,cACD,OAAO,MAAOoK,GAAa4C,GAASD,GAAa/M,CAAK,EAC1D,IAAK,OACD,OAAO,MAAOqK,EAAM2C,GAASD,GAAa/M,CAAK,EACnD,IAAK,WACD,OAAO,MAAOsK,EAAU0C,GAASD,GAAa/M,CAAK,EACvD,IAAK,UACD,OAAO,MAAOuK,EAASyC,GAASD,GAAa/M,CAAK,EACtD,IAAK,YACD,OAAO,MAAOwK,GAAWwC,GAASD,GAAa/M,CAAK,EACxD,IAAK,WACD,OAAO,MAAO4K,GAAUoC,GAASD,GAAa/M,CAAK,EACvD,IAAK,UACD,OAAO,MAAO6K,EAASmC,GAASD,GAAa/M,CAAK,EACtD,IAAK,QACD,OAAO,MAAO8K,EAAOkC,GAASD,GAAa/M,CAAK,EACpD,IAAK,MACD,OAAO,MAAO+K,GAAKiC,GAASD,GAAa/M,CAAK,EAClD,IAAK,OACD,OAAO,MAAOgL,EAAMgC,GAASD,GAAa/M,CAAK,EACnD,IAAK,SACD,OAAO,MAAOiL,EAAQ+B,GAASD,GAAa/M,CAAK,EACrD,IAAK,SACD,OAAO,MAAOkL,GAAQ8B,GAASD,GAAa/M,CAAK,EACrD,IAAK,UACD,OAAO,MAAOyL,EAASuB,GAASD,GAAa/M,CAAK,EACtD,IAAK,SACD,OAAO,MAAO0L,EAAQsB,GAASD,GAAa/M,CAAK,EACrD,IAAK,MACD,OAAO,MAAOgM,EAAKgB,GAASD,GAAa/M,CAAK,EAClD,IAAK,SACD,OAAO,MAAOiM,EAAQe,GAASD,GAAa/M,CAAK,EACrD,IAAK,SACD,OAAO,MAAOkM,EAAQc,GAASD,GAAa/M,CAAK,EACrD,IAAK,kBACD,OAAO,MAAOmM,EAAiBa,GAASD,GAAa/M,CAAK,EAC9D,IAAK,OACD,OAAO,MAAOoM,EAAMY,GAASD,GAAa/M,CAAK,EACnD,IAAK,QACD,OAAO,MAAOqM,EAAOW,GAASD,GAAa/M,CAAK,EACpD,IAAK,YACD,OAAO,MAAOsM,EAAWU,GAASD,GAAa/M,CAAK,EACxD,IAAK,QACD,OAAO,MAAOuM,EAAOS,GAASD,GAAa/M,CAAK,EACpD,IAAK,aACD,OAAO,MAAO2M,EAAYK,GAASD,GAAa/M,CAAK,EACzD,IAAK,UACD,OAAO,MAAO4M,EAASI,GAASD,GAAa/M,CAAK,EACtD,IAAK,OACD,OAAO,MAAO6M,EAAMG,GAASD,GAAa/M,CAAK,EACnD,QACI,GAAI,CAAC4E,EAAM,aAAa,IAAIoI,GAAQpI,EAAM,IAAI,CAAC,EAC3C,MAAM,IAAIuM,EAA6B7K,CAAM,EACjD,OAAO,MAAOwG,EAAME,GAASD,GAAa/M,CAAK,CACvD,CACJ,CAKA,IAAMoS,GAAQ,CACV,SAAU,aACV,UAAW,IAAI,IACf,UAAW,IAAI,IACf,UAAW,IAAI,GACnB,EAIA,SAASR,GAAiBtL,EAAQM,GAAY5G,EAAOuS,GAAc,GAAM,CACrE,MAAO,IAAI,CAAC,GAAGxK,EAAMzB,EAAQM,GAAY5G,EAAOuS,EAAW,CAAC,EAAE,KAAK,MAAM,CAAC,GAC9E,CACA,SAASF,GAAmBvB,EAAK,CAC7B,MAAO,SAASD,EAAW,OAAOC,CAAG,CAAC,EAC1C,CACA,SAASmB,GAAeX,EAAY,CAChC,IAAMqB,GAAe,SAASP,GAAM,UAAU,IAAI,GAClD,OAAAA,GAAM,UAAU,IAAIO,GAAc,SAASA,EAAY,MAAMrB,CAAU,EAAE,EAClEqB,EACX,CACA,SAASD,GAAeE,EAAMtM,GAAQM,EAAY5G,GAAOuS,GAAc,GAAM,CACzE,GAAM,CAACM,GAASC,EAAG,EAAI,CAAC;EAAOC,IAAW,GAAG,SAASA,GAAQ,GAAG,CAAC,EAC5DvB,GAAYE,GAAgB,QAAS,KAAK,EAC1CsB,GAAUC,GAAc,SAAS,EACjC3B,GAAa,CAAC,GAAGvJ,EAAMzB,GAAQM,EAAY5G,GAAOuS,EAAW,CAAC,EAAE,IAAKjB,IAAe,GAAGwB,GAAI,CAAC,CAAC,GAAGxB,EAAU,EAAE,EAAE,KAAK,MAAMuB,EAAO,EAAE,EACxI,MAAO,YAAYD,CAAI,IAAIpB,EAAS,IAAIwB,EAAO,KAAKH,EAAO,GAAGC,GAAI,CAAC,CAAC,WAAWD,EAAO,GAAGvB,EAAU,GAAGuB,EAAO,GAAGC,GAAI,CAAC,CAAC;EAC1H,CACA,SAASpB,GAAgBkB,EAAMrJ,GAAM,CACjC,IAAM2J,EAAad,GAAM,WAAa,aAAe,KAAK7I,EAAI,GAAK,GACnE,MAAO,GAAGqJ,CAAI,GAAGM,CAAU,EAC/B,CACA,SAASD,GAAc1J,EAAM,CACzB,OAAO6I,GAAM,WAAa,aAAe,KAAK7I,CAAI,GAAK,EAC3D,CAIA,SAAS4J,GAAM7M,EAAQM,GAAYzF,EAAS,CACxC,IAAMsR,GAAeC,GAAe,QAASpM,EAAQM,GAAY,OAAO,EAClE4K,GAAYE,GAAgB,QAAS,KAAK,EAC1CsB,GAAUC,GAAc,SAAS,EACjCG,GAAY,CAAC,GAAGhB,GAAM,UAAU,OAAO,CAAC,EACxCiB,GAAY,CAAC,GAAGjB,GAAM,UAAU,OAAO,CAAC,EAExCkB,MAAoB7O,EAAQ,UAAU6B,EAAO,GAAG,EAChD,yBAAyBkL,EAAS,IAAIwB,EAAO;WAAgBX,GAAmB/L,EAAO,GAAG,CAAC;GAC3F,UAAUmM,EAAY,GAC5B,MAAO,CAAC,GAAGY,GAAW,GAAGD,GAAWE,EAAa,EAAE,KAAK;CAAI,CAChE,CAEA,SAASC,MAAQrG,EAAM,CACnB,IAAMsG,GAAW,CAAE,SAAU,YAAa,EAEpC,CAAClN,EAAQM,GAAYzF,EAAO,EAAK+L,EAAK,SAAW,MAASzI,EAAQ,SAASyI,EAAK,CAAC,CAAC,EAAI,CAACA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGsG,EAAQ,EACnHtG,EAAK,SAAW,GAAK,IAAKzI,EAAQ,SAASyI,EAAK,CAAC,CAAC,EAAI,CAACA,EAAK,CAAC,EAAG,CAAC,EAAGA,EAAK,CAAC,CAAC,EACvEA,EAAK,SAAW,EAAI,CAACA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAC1CA,EAAK,SAAW,EAAI,CAACA,EAAK,CAAC,EAAG,CAAC,EAAGsG,EAAQ,EACtC,CAAC,KAAM,CAAC,EAAGA,EAAQ,EAMnC,GAJApB,GAAM,SAAWjR,GAAQ,SACzBiR,GAAM,UAAU,MAAM,EACtBA,GAAM,UAAU,MAAM,EACtBA,GAAM,UAAU,MAAM,EAClB,CAACxN,EAAM,UAAU,QAAQ0B,CAAM,EAC/B,MAAM,IAAI8K,EAA2B9K,CAAM,EAC/C,QAAWA,MAAUM,GACjB,GAAI,CAAChC,EAAM,UAAU,QAAQ0B,EAAM,EAC/B,MAAM,IAAI8K,EAA2B9K,EAAM,EACnD,OAAO6M,GAAM7M,EAAQM,GAAYzF,EAAO,CAC5C,CACAoQ,EAAa,KAAOgC,GAEpB,SAASE,GAAQnN,EAAQM,GAAa,CAAC,EAAG,CACtC,IAAM8M,EAAgBH,GAAKjN,EAAQM,GAAY,CAAE,SAAU,YAAa,CAAC,EACnE+M,GAAmB,WAAW,SAAS,OAAQ,SAAU,OAAQD,CAAa,EAC9EE,GAAY,IAAI,IAAIxB,GAAM,SAAS,EACzC,SAASyB,GAAqB9O,GAAMuN,GAAUtS,GAAO,CACjD,GAAI,CAAC4E,EAAM,aAAa,IAAIG,EAAI,GAAK,CAAC6O,GAAU,IAAItB,EAAQ,EACxD,MAAO,GACX,IAAMtC,GAAYpL,EAAM,aAAa,IAAIG,EAAI,EACvCuB,GAASsN,GAAU,IAAItB,EAAQ,EACrC,OAAOtC,GAAU1J,GAAQtG,EAAK,CAClC,CACA,SAAS8T,GAAuBzO,GAAQrF,GAAO,CAC3C,OAAK4E,EAAM,eAAe,IAAIS,EAAM,EAElBT,EAAM,eAAe,IAAIS,EAAM,EAChCrF,EAAK,EAFX,EAGf,CACA,SAAS+T,GAAa/T,GAAO,CACzB,SAAW8I,EAAO,MAAM9I,EAAK,CACjC,CACA,IAAMsT,GAAgBK,GAAiBE,GAAsBC,GAAwBC,EAAY,EACjG,OAAO,IAAIhE,EAAUzJ,EAAQM,GAAY0M,GAAeI,CAAa,CACzE,CACAnC,EAAa,QAAUkC,EAC3B,GAAGlC,IAAiBlT,EAAQ,aAAekT,EAAe,CAAC,EAAE,CAAA,CAAA,CAAA,ECroB7D1B,GAAAzR,GAAA,CAAA,yGAAAC,EAAA,CAAA,aA4BA,IAAI8O,EAAmB9O,GAAQA,EAAK,kBAAqB,OAAO,OAAU,SAAS+O,EAAGC,EAAGC,EAAGC,EAAI,CACxFA,IAAO,SAAWA,EAAKD,GAC3B,IAAIE,EAAO,OAAO,yBAAyBH,EAAGC,CAAC,GAC3C,CAACE,IAAS,QAASA,EAAO,CAACH,EAAE,WAAaG,EAAK,UAAYA,EAAK,iBAClEA,EAAO,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,OAAOH,EAAEC,CAAC,CAAG,CAAE,GAE9D,OAAO,eAAeF,EAAGG,EAAIC,CAAI,CACrC,EAAM,SAASJ,EAAGC,EAAGC,EAAGC,EAAI,CACpBA,IAAO,SAAWA,EAAKD,GAC3BF,EAAEG,CAAE,EAAIF,EAAEC,CAAC,CACf,GACIG,EAAgBpP,GAAQA,EAAK,cAAiB,SAASgP,EAAGhP,EAAS,CACnE,QAASqP,KAAKL,EAAOK,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAKrP,EAASqP,CAAC,GAAGP,EAAgB9O,EAASgP,EAAGK,CAAC,CAC5H,EACA,OAAO,eAAerP,EAAS,aAAc,CAAE,MAAO,EAAK,CAAC,EAC5DA,EAAQ,mBAAqBA,EAAQ,eAAiB,OACtD,IAAIuP,EAAUoG,GAAA,EACd,OAAO,eAAe3V,EAAS,iBAAkB,CAAE,WAAY,GAAM,IAAK,UAAY,CAAE,OAAOuP,EAAQ,cAAgB,CAAE,CAAC,EAC1H,OAAO,eAAevP,EAAS,qBAAsB,CAAE,WAAY,GAAM,IAAK,UAAY,CAAE,OAAOuP,EAAQ,kBAAoB,CAAE,CAAC,EAClIH,EAAaoC,GAAA,EAAuBxR,CAAO,CAAA,CAAA,CAAA,EC/C3C4V,GAAkCC,GAAA/V,GAAA,EAAA,CAAA,EAClCgW,GAAsBD,GAAArV,GAAA,EAAA,CAAA,EAQlBuV,GAAsB,GACtBC,GAA6B,GAC7B5V,GAAAA,SAEE,SAAS,KAAK,qBAAoB2V,GAAsB,SAAS,KAAK,qBAAuB,QAC7F,SAAS,KAAK,qBAAoBC,GAA6B,SAAS,KAAK,qBAAuB,SAEnG,IAAIC,GAAuB,CAChC,OAAQ,OACR,KAAMF,GACN,MAAOC,GACP,iBAAkB,GAClB,oBAAqB,GACrB,qBAAsB,CAAC,EACvB,yBAA0B,GAI1B,wBAAyB,GACzB,IAAK,EACP,EAIaE,GAAmB,CAShC,EAoBaC,GAAN,KAAiB,CACtB,WAAa,EACb,UAAY,EACZ,KAAO,GACP,MAAQ,GACR,YAAYC,EAAoBC,EAAmBC,EAAeC,EAAgB,CAChF,OAAO,OAAO,KAAM,CAAE,WAAAH,EAAY,UAAAC,EAAW,KAAAC,EAAM,MAAAC,CAAM,CAAC,CAC5D,CAEA,UAAW,CACT,IAAMC,EAAiB,KAAK,WAAa,KACnCJ,EAAaI,EAAc,QAAQA,EAAgB,EAAI,EAAI,CAAC,EAC5DH,EACF,KAAK,UAAY,IACf,GAAG,KAAK,UAAU,QAAQ,CAAC,CAAC,GAAG,SAAS,EAAG,GAAG,EAC9C,GAAG,IAAI,KAAK,UAAY,MAAO,QAAQ,KAAK,UAAY,IAAQ,EAAI,CAAC,CAAC,GAAG,SAAS,EAAG,GAAG,CAAC,IAC/F,MAAO,IAAI,CAAC,KAAK,KAAOD,EAAa,KAAM,KAAK,MAAQC,EAAY,IAAI,EACrE,OAAOI,GAAKA,GAAG,IAAI,EACnB,KAAK,GAAG,CAAC,GACd,CACF,EAEaC,GAAN,KAAY,CACjB,YAAYC,EAAeC,EAAgB,CACzC,OAAO,OAAO,KAAM,CAAE,MAAAD,EAAO,OAAAC,CAAO,CAAC,CACvC,CACF,EACIC,GAAoB,GAEXC,GAAN,MAAMC,EAAO,CAClB,OAAO,MAAQ,EACf,OAAO,KAAO,EACd,OAAO,KAAO,EACd,OAAO,IAAM,EACb,OAAO,MAAQ,EACf,OAAO,QAAU,GAEjB,OAAO,SAAW,EAClB,OAAO,QAAU,EAoBjB,OAAO,MAAMC,EAA4BD,GAAO,KAAME,EAAiB,CAAC,EAAG,CACzEA,EAAS,OAAO,OAAO,CAAC,EAAGhB,GAAuBgB,CAAM,EACpDD,EAAQ,IAAI,QAAQ,MAAM,eAAgB,CAAE,OAAAC,CAAO,CAAC,EAExD,IAAMC,EAAkB,KAAK,QAAQ,QAAQ,MAAO,CAAE,GAAGD,EAAQ,IAAKA,EAAO,gBAAiB,CAAC,EACzFE,EAAO,IAAItI,IAAgB,CAE3B,OAAO,OAAW,KAAe,QAAQ,wBAC3CqI,EAAgB,GAAGrI,CAAI,CAC3B,EACAsI,EAAK,WAAa,GAClBA,EAAK,UAAY,GACjB,IAAMC,EAAiB,KAAK,QAAQ,QAAQ,eAAgBH,CAAM,EAE5DI,EAAc,CAACC,EAAkBC,IAA8E,CAEnH,SAASC,KACJ3I,EAC0E,CAC7E,IAAM4I,EAAiB5I,EAAKA,EAAK,OAAS,CAAC,EAE3C,OAAI4I,IAA2BN,EACtBM,EAAe,GAExBL,EAAe,GAAGvI,EAAK,MAAM,EAAG,EAAE,CAAC,GAEd,SAAY,CAC/B,GAAI,CACF,IAAM6I,EAASD,EAAe,EAC9B,OAAOC,aAAkB,QAAU,MAAMA,EAASA,CACpD,QAAA,CACE,QAAQ,SAAS,CACnB,CACF,GAEoB,EACtB,CAEA,IAAMC,EAAW,OAAO,OACtBJ,EAAK,KAAK,CAAC,CAAC,EACZ,CACE,UAAWD,EACX,WAAY,CAACA,EACb,MAAAE,EACA,MAAOD,CACT,CACF,EACA,OAAID,EACKK,EAEA,OAAO,OACZR,EAAK,KAAK,CAAC,CAAC,EACZ,CACE,UAAWG,EACX,WAAY,CAACA,EACb,MAAAE,EACA,MAAOG,CACT,CACF,CAEJ,EAEMC,EAAQP,EAAYL,GAASD,GAAO,MAAO,KAAK,QAAQ,QAAQ,MAAOE,CAAM,CAAC,EAOpF,MAAO,CACL,MAPY,IAAIY,KAChBD,EAAM,GAAGC,CAAM,EACR,IAAI,SAAMxW,GAAAA,SAAUwW,CAAM,CAAC,GAMlC,KAAMR,EAAYL,GAASD,GAAO,KAAM,KAAK,QAAQ,QAAQ,KAAME,CAAM,CAAC,EAC1E,IAAKI,EAAYL,GAASD,GAAO,KAAM,KAAK,QAAQ,QAAQ,IAAKE,CAAM,CAAC,EACxE,MAAOI,EAAYL,GAASD,GAAO,MAAO,KAAK,QAAQ,QAAQ,IAAK,CAAE,GAAGE,EAAQ,IAAKA,EAAO,gBAAiB,CAAC,CAAC,EAChH,QAASI,EAAYL,GAASD,GAAO,QAAS,KAAK,QAAQ,QAAQ,MAAO,CAAE,GAAGE,EAAQ,IAAKA,EAAO,gBAAiB,CAAC,CAAC,CACxH,CACF,CAEA,OAAO,QAAQa,EAAoBb,EAAgB,CACjD,GAAK7W,GAAAA,OAgCH,OAAO0X,EAAQ,KAAK,OAAO,EAhChB,CAYX,IAAMC,EAAY,CAAC,EAEnB,GAAId,EAAO,MAAQA,EAAO,MAAO,CAG/B,IAAM5H,EAFWlP,GAAAA,WAAa,UAAU,UAAU,SAAS,QAAQ,EAG/D,CAAC,GAAI4W,GAAO,QAAQ,CAAC,CAACE,EAAO,KAAM,CAAC,CAACA,EAAO,KAAK,CAAC,EAClD,CAAC,EACLc,EAAU,KAAK,GAAG1I,CAAC,CACrB,CACA,OAAI4H,EAAO,SACLJ,GACFkB,EAAU,KAAK,IAAIrB,GAAM,MAAOO,EAAO,MAAM,CAAC,EAC3Cc,EAAU,KAAKd,EAAO,MAAM,GAG5Ba,EAAQ,KAAK,QAAS,GAAGC,CAAS,CAC3C,CAKF,CAOA,OAAO,QAAQzB,EAAeC,EAAgByB,EAAiB,EAAoC,CACjG,GAAI,CAAC,YAAY,IACf,OACF,IAAMC,EAAM,YAAY,IAAI,EACvBlB,GAAO,WACVA,GAAO,SAAWkB,EAClBlB,GAAO,QAAUkB,GAEnB,IAAM5I,EAAI,IAAI8G,GAAW8B,EAAMlB,GAAO,SAAUkB,EAAMlB,GAAO,QAAST,EAAMC,CAAK,EACjF,OAAAQ,GAAO,QAAUkB,EACVD,EAAiB3I,EAAE,SAAS,EAAIA,CACzC,CAGA,OAAO,mBAAmBtL,EAAgC,CACxD,IAAImU,EAAe,GACnB,QAAWC,KAAQpU,EAAM,MAAM;CAAI,EAAG,CACpC,IAAMqU,EAAUD,EAAK,MAAM,eAAe,EAC1C,GAAIC,EAAS,CACX,GAAIF,EAGF,OACEE,EAAQ,CAAC,EACN,KAAK,EAKL,QAAQ,UAAW,EAAE,EAG5BF,EAAe,EACjB,CACF,CACF,CACF,EAEI/X,GAAAA,YAIF,OAAO,mBAAqB,OAAO,oBAAsB,CAAC,EAG1D,OAAO,mBAAmB,KACxB,CAEE,OAASD,GAAa,CACpB,GAAIgW,IAAoBA,GAAiB,QACvC,QAAWmC,KAAanC,GACtB,GAAImC,EAAU,MAAMnY,CAAG,EACrB,MAAO,CAAC,OAAQ,CAAC,EAAGmY,EAAU,OAAOnY,CAAG,CAAC,EAG/C,OAAO,IACT,EACA,QAAS,IAAM,EACjB,EACA,CAQE,OAASA,GAAa,CACpB,GAAI,EAAEA,aAAeiW,IACnB,OAAO,KACJU,KACHA,GAAoB,IACtB,IAAMxH,EAAIyH,GAAO,QAAQ5W,EAAI,KAAMA,EAAI,KAAK,EAC5C,MAAO,CACL,OACA,CAAE,MAAO,iCAAkC,EAC3CmP,GAAG,SAAS,CAEd,CACF,EACA,QAAS,IAAM,EACjB,EACA,CAEE,OAASnP,GACDA,aAAewW,IAEhBG,KACHA,GAAoB,IACf,CAAC,OAAQ,CAAE,MAAO,mCAA6D,EAAG3W,EAAI,MAAM,GAH1F,KAKX,QAAS,IAAM,EACjB,CACF,GC7UF,IAAAoY,GAAsBzC,GAAAjU,GAAA,EAAA,CAAA,EAETE,GAAYwW,GAAAC,QAAU,UAG5BC,GAAQF,GAAAC,QC8BTE,GAAa,IACb,CAAE,KAAAC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,EAExDC,GAAeC,GAAW,IAAI,EAG3CnX,GAAU,CACT,eAAgB,QAKjB,CAAC,EAED,GACC,CAAC,IAAI,KAAM,CACV,GACD,EAAE,EAAE,eAAe,KAAK,EACvB,MAAM,IAAI,MAAM,wCAAwC,EAEnD,IAAMoX,GAAkB,CAAC,CAAE,OAAAC,EAAQ,OAAAC,EAAQ,QAAA3I,EAAS,KAAA5B,CAAK,IAMxDwK,GAAU,KAChBxK,EAAOA,GAAQ4B,EACH,GAAI,CAAC,MAAM,QAAQ2I,CAAM,GAAKA,GAAQ,KAAQA,EAAO,KAAO,MAAQ,EAAE,GAC5ED,GAAU,SAAS,GACnBtK,EAAO,IAAI,OAAOA,GAAS,SAAWA,EAAO2J,GAAU3J,CAAI,CAAC,IAAM,EAAE,GAE1E,EAMK,SAASyK,GAA8BC,EAAsBC,EAAsB,CACzF,OAAOC,GAAU,IAAMC,GAAS,WAAWH,EAAE,IAAI,EAAGC,EAAE,IAAI,CAAC,CAAC,CAC7D,CACO,SAASG,GAAqBJ,EAAWC,EAAW,CAC1D,OAAOE,GAAS,QAAQH,EAAE,QAASC,EAAE,OAAO,CAC7C,CACO,SAASI,GAAmBL,EAAgBC,EAAgB,CAClE,GAAID,EAAE,OAASC,EAAE,KAAM,MAAO,GAC9B,QAASK,EAAI,EAAGA,EAAIN,EAAE,KAAMM,IAAK,CAChC,IAAMC,EAAQP,EAAE,MAAMM,CAAC,EACjBE,EAAQP,EAAE,MAAMK,CAAC,EAEvB,GADIG,GAAQ,WAAWA,GAAQ,qBAAsBH,EAAGC,EAAOC,CAAK,EAChE,CAACL,GAAS,WAAWI,EAAM,UAAWC,EAAM,SAAS,EACxD,OAAIC,GAAQ,WAAWA,GAAQ,qCAAsCH,EAAGC,EAAOC,CAAK,EAC7E,GAGR,GAAI,CAACJ,GAAqBG,EAAM,eAAgBC,EAAM,cAAc,EACnE,OAAIC,GAAQ,WAAWA,GAAQ,+CAAgDH,EAAGC,EAAOC,CAAK,EACvF,EAET,CACA,OAAIC,GAAQ,WAAWA,GAAQ,8BAA+B,CAAE,EAAAT,EAAG,EAAAC,CAAE,CAAC,EAC/D,EACR,CAEA,IAAIS,GAAuB,EACpB,SAASC,GAAsBC,EAAwB,CAAE,KAAAC,EAAM,OAAAC,CAAO,EAGzE,CAAC,EAAG,CACP,IAAMC,EAAY,sBAAsB,EAAEL,EAAoB,IAAIG,CAAI,IAClEJ,GAAQ,WAAWA,GAAQ,IAAIM,CAAS,WAAY,CAAE,OAAQH,EAAG,KAAM,GAAAA,EAAI,KAAAC,EAAM,OAAAC,CAAO,CAAC,EAE7F,IAAIE,EAEEC,EAAiBC,GACtBN,EACCO,GAAU,CACLH,EAGCd,GAAU,KAAOY,GAAUX,GAAS,YAAYa,EAAeG,CAAK,CAAC,EAIrEC,GAAM,WAAWA,GAAM,IAAIL,CAAS,mBAAoB,CAAE,aAAcI,EAAO,cAAAH,CAAc,CAAC,GAHlGA,EAAc,QAAQG,CAAK,EACvBC,GAAM,WAAWA,GAAM,IAAIL,CAAS,YAAa,CAAE,aAAcI,EAAO,cAAAH,CAAc,CAAC,GAJ5FA,EAAgBK,GAAW,MAAMF,EAA8B,CAAE,KAAM,GAAO,KAAAN,EAAM,OAAAC,CAAO,CAAC,CAS9F,EACA,CAAE,KAAMC,CAAU,CACnB,EAEA,GAAIA,EAAU,SAAS,UAAU,EAAG,CACnC,IAAIO,EAAYC,GAAQP,CAAa,EACrCI,GAAM,IAAIL,CAAS,SAAU,CAAE,eAAAE,EAAgB,UAAAK,EAAW,cAAAN,EAAe,UAAWQ,GAAgBR,CAAa,CAAE,CAAC,EACpHS,GAAY,IAAMC,GAAa,IAAIJ,CAAS,CAAC,CAC9C,CACA,OAAIb,GAAQ,WACXkB,GAAiBX,EAAe,IAAM,CACrCP,GAAQ,IAAIM,CAAS,aAAcS,GAAgBR,CAAa,EAAG,CAAE,UAAAM,EAAW,cAAAN,CAAc,CAAC,CAChG,CAAC,EAG+BY,GAAmBZ,EAAe,IAAM,CACpEP,GAAQ,WAAWA,GAAQ,IAAIM,CAAS,WAAW,EAEnDO,GAAWG,GAAY,IAAMC,GAAa,OAAOJ,CAAS,CAAC,EAC/DL,EAAe,CAChB,CAAC,EACMD,CACR,CAEA,IAAIa,GAAqB,EAElB,SAASC,GAAoBlB,EAAwB,CAAE,KAAAC,CAAK,EAG/D,CAAC,EAAG,CACP,IAAME,EAAY,oBAAoB,EAAEc,EAAkB,IAAIhB,CAAI,IAC9DJ,GAAQ,WAAWA,GAAQ,IAAIM,CAAS,WAAY,CAAE,OAAQH,EAAG,KAAM,GAAAA,EAAI,KAAAC,CAAK,CAAC,EAErF,IAAIkB,EAEEd,EAAiBC,GACtBN,EACCO,GAAU,CACV,GAAI,CAACY,EACJA,EAAgBV,GAAW,IAAIF,EAA8B,CAAE,KAAM,GAAO,KAAAN,CAAK,CAAC,MAC5E,CACN,GAAM,CAAE,QAAAmB,EAAS,MAAAC,CAAM,EAAI/B,GAAU,IAAM,CAC1C,IAAMgC,EAAS,IAAI,IAAIH,EAAc,OAAO,CAAC,EACvCE,EAAQ,IAAI,IAClB,QAAWE,KAAQhB,EAEdY,EAAc,IAAII,CAAI,GACrB1B,GAAQ,WAAWA,GAAQ,IAAIM,CAAS,cAAeoB,EAAM,CAAE,aAAchB,EAAO,cAAAY,CAAc,CAAC,EACvGG,EAAO,OAAOC,CAAI,GAElBF,EAAM,IAAIE,CAAI,EAGhB,OAAIf,GAAM,WAAWA,GAAM,IAAIL,CAAS,aAAc,CAAE,OAAAmB,EAAQ,MAAAD,EAAO,aAAcd,EAAO,cAAAY,CAAc,CAAC,EACpG,CACN,MAAAE,EACA,QAASC,CACV,CACD,CAAC,EACD,QAAWE,KAAOJ,EAASD,EAAc,OAAOK,CAAG,EACnD,QAAWC,KAAOJ,EAAOF,EAAc,IAAIM,CAAG,CAC/C,CACD,EACA,CAAE,KAAMtB,CAAU,CACnB,EAEA,GAAIA,EAAU,SAAS,UAAU,EAAG,CACnC,IAAIO,EAAYC,GAAQQ,CAAa,EACjCX,GAAM,WACTA,GAAM,IAAIL,CAAS,SAAU,CAAE,eAAAE,EAAgB,UAAAK,EAAW,cAAAS,EAAe,UAAWP,GAAgBO,CAAa,CAAE,CAAC,EAErHN,GAAY,IAAMC,GAAa,IAAIJ,CAAS,CAAC,CAC9C,CACA,OAAIb,GAAQ,WACXkB,GAAiBI,EAAe,IAAM,CACrCtB,GAAQ,IAAIM,CAAS,aAAcS,GAAgBO,CAAa,EAAG,CAAE,UAAAT,EAAW,cAAAS,CAAc,CAAC,CAChG,CAAC,EAG+BH,GAAmBG,EAAe,IAAM,CACpEtB,GAAQ,WAAWA,GAAQ,IAAIM,CAAS,WAAW,EAEnDO,GAAWG,GAAY,IAAMC,GAAa,OAAOJ,CAAS,CAAC,EAC/DL,EAAe,CAChB,CAAC,EACMc,CACR,CAwFO,SAASO,GACfC,EAEAC,EAAqB,KACrB,CAAE,KAAAC,CAAK,EAAuB,CAAC,EAC9B,CACGC,GAAM,WAAWA,GAAM,qCAAsC,CAAE,OAAQH,EAAG,KAAM,GAAAA,EAAI,KAAAE,CAAK,CAAC,EAC9F,IAAME,EAAY,GAAGF,CAAI,cAErBG,EACEC,EAAW,IAAIC,GAASH,EAAW,YAA+BI,EAAM,CACzEL,GAAM,WAAWA,GAAM,IAAIC,CAAS,wBAAyBI,CAAI,EACrEC,EAAY,CAIb,CAAC,EACD,SAASA,GAAc,CACtBH,EAAS,MAAM,UAAiC,CAC/C,IAAII,EAAQC,IAAc,YAAY,IAAI,EACtCR,GAAM,WAAWA,GAAM,IAAIC,CAAS,iBAAkB,CAAE,KAAMF,GAAQF,EAAG,KAAM,GAAAA,CAAG,CAAC,EACvFK,EAASL,EAAG,EACRG,GAAM,WAAWA,GAAM,IAAIC,CAAS,mBAAoBC,CAAM,EAElEO,GAAY,IAAM,CACjBX,IAASI,CAAM,CAChB,CAAC,EACGM,IAAc,YAAY,IAAI,EAAID,EAAQC,IAC7CE,GAAK,IAAIT,CAAS,UAAU,YAAY,IAAI,EAAIM,CAAK,IAAI,CAE3D,CAAC,CACF,CAEA,OAAAD,EAAY,EACRN,GAAM,WAAWA,GAAM,IAAIC,CAAS,qBAAsB,CAAE,SAAAE,EAAU,OAAAD,EAAQ,KAAMS,GAAkBR,CAAQ,CAAE,CAAC,EA4BrG,IAAM,CACjBS,GAAQ,WAAWA,GAAQ,IAAIX,CAAS,WAAW,EAEvD,WAAW,IAAME,EAAS,QAAQ,CAAC,CACpC,CAED,CA0CO,SAASU,GACfd,EACAF,EACAiB,EAAiH,GAC7G,CACJ,GAAIC,GAASlB,CAAE,EAAG,MAAM,IAAI,MAAM,oDAAoD,EAEtF,IAAImB,EAAa,GACb,EAAI,EACFC,EAAO,OAAOH,GAAuB,UACxC,CAAE,UAAWA,CAAmB,EAChCA,EACGI,EAAM,IAAI,IAEhB,OAAO,YAAuBb,EAAoC,CACjE,IAAIc,EACEC,EAAgBC,GAAU,IAAMhB,CAAI,EACpCJ,EAAY,yBAAyBF,GAAQF,EAAG,IAAI,IAAI,EAAE,CAAC,IAAIoB,EAAK,cAAgB,IAAIA,EAAK,cAAc,GAAGZ,CAAI,CAAC,IAAM,EAAE,GAEjI,OAAS,CAACiB,EAAcC,CAAW,IAAKL,EAAI,QAAQ,EACnD,GAAIM,GAAS,WAAWF,EAAcF,CAAa,EAAG,CACrDD,EAAWI,EACX,KACD,CAGD,GAAIJ,EAAU,CACb,IAAMM,EAAeN,EAAS,IAAI,EAClC,OAAIP,GAAQ,WAAWA,GAAQ,IAAIX,CAAS,cAAe,CAAE,cAAAmB,EAAe,aAAAK,CAAa,CAAC,EACnFA,CACR,CAGA,GAAI,CAACR,EAAK,WAAa,CAACS,GAAuB,EAC9C,MAAI,CAACV,GAAcW,GAAgB,EAAE,2BACpC,QAAQ,KACP,mGACD,EACAX,EAAa,IAEPnB,EAAG,MAAM,KAAMQ,CAAI,EAIvBO,GAAQ,WAAWA,GAAQ,IAAIX,CAAS,oBAAqB,CAAE,cAAAmB,CAAc,CAAC,EAClF,IAAIQ,EACEL,EAAcM,GACnB,KACKjB,GAAQ,WAAWA,GAAQ,IAAIX,CAAS,kBAAmBoB,GAAU,KAAO,CAAE,KAAAhB,CAAK,EAAE,EAAGR,CAAE,EAC1Fe,GAAQ,WAAWkB,GAAM,EACrBF,EAAc/B,EAAG,MAAM,KAAMQ,CAAI,GAE1C,CACC,GAAGY,EACH,KAAMhB,CACP,CACD,EAKA,GAJIW,GAAQ,WAAWA,GAAQ,IAAIX,CAAS,SAAUU,GAAkBY,CAAW,EAAG,CAAE,cAAAH,CAAc,CAAC,EACvGF,EAAI,IAAIE,EAAeG,CAAW,EAG9B,CAACN,EAAK,UAAW,CACpB,IAAMc,EAAuBC,GAAmBT,EAAa,IAAM,CAC9DX,GAAQ,WAAWA,GAAQ,IAAIX,CAAS,YAAasB,CAAW,EACpEQ,EAAqB,EACrBb,EAAI,OAAOE,CAAa,EACpBH,EAAK,WAAWA,EAAK,UAAUW,EAAa,GAAGvB,CAAI,EACvDuB,EAAc,MACf,CAAC,CACF,CAEA,OAAOL,EAAY,IAAI,CACxB,CACD,CAEO,SAASU,GAAmBC,EAAuB,CACzD,IAAIC,EAAQ,EACRjC,EAAS,GACTkC,EAAoB,EAExB,QAAS,EAAI,EAAG,EAAIF,EAAM,OAAQ,IAAK,CACtC,IAAMG,EAAOH,EAAM,CAAC,EAEhBG,IAAS,IACZnC,GAAUmC,EAAO;EAAO,IAAK,OAAO,EAAEF,CAAK,EACjCE,IAAS,IACnBnC,GAAU;EAAO,IAAK,OAAO,EAAEiC,CAAK,EAAIE,EAC9BA,IAAS,KAAOD,IAAsB,EAChDlC,GAAUmC,EAAO;EAAO,IAAK,OAAOF,CAAK,EAC/BE,IAAS,KAAOD,IAAsB,GAChDA,IACAlC,GAAUmC,EAAO;EAAO,IAAK,OAAOF,EAAQ,CAAC,GACnCE,IAAS,KAAOD,IAAsB,GAChDA,IACAlC,GAAU;EAAO,IAAK,OAAOiC,CAAK,EAAIE,GAC5BA,IAAS,KAAOD,EAAoB,GAC9CA,IACAlC,GAAUmC,IACAA,IAAS,KAAOD,EAAoB,GAC9CA,IACAlC,GAAUmC,EAIZ,CAEA,OAAOnC,CACR,CCrfA,GAAM,CAAE,KAAAoC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,KAAM,CAAE,OAAQ,UAAW,CAAC,EAGtF,SAASC,GAAYC,EAA0D,CACrF,OAAQA,EAAc,OAAS,MAChC,CAIO,IAAeC,GAAf,KAAsB,CAK5B,YACUC,EACTC,EACAC,EACUC,EAAqB,CAAC,EAChCC,EAAqC,CAAC,EACrC,CALQ,KAAA,KAAAJ,EAGC,KAAA,SAAAG,EAGV,KAAK,QAAUF,IAAY,KAAO,KAAOI,GAAcJ,CAAO,EAC9D,KAAK,QAAUC,EACXI,GAAU,IAAM,KAAK,SAAS,SAAW,CAAC,GAC7Cf,GAAK,+BAAgCS,CAAI,EAErCI,EAAK,gBACTG,GAAe,KAAM,CAGpB,YAAaC,GACb,aAAcA,GACd,OAAQC,GACR,KAAMD,GACN,QAASA,GACT,SAAUA,GACV,UAAWA,EACZ,EAAG,CAAE,KAAM,UAAUR,CAAI,GAAI,CAAC,CAEhC,CA7BS,QACA,QACC,aAAiD,CAAC,EA6B5D,IAAI,UAAW,CACd,OAAI,KAAK,QAAQ,SAAW,EAAU,GAC/B,KAAK,QAAQ,CAAC,EAAE,QACxB,CAEO,OAAOU,EAA6C,CAC1D,GAAI,KAAK,SAAU,MAAMf,GAAM,gDAAiD,KAAK,oBAAoB,EACzG,GAAI,CAAC,KAAK,QAAS,MAAMA,GAAM,mEAAoE,KAAK,oBAAoB,EAC5H,GAAI,KAAK,SAAS,SAAW,EAAG,MAAMA,GAAM,4DAA6D,KAAK,oBAAoB,EAClI,OAAO,KAAK,QAAQ,CAAC,EAAE,OAAOe,CAAe,CAC9C,CACO,UAAUA,EAAoC,CACpD,GAAI,KAAK,SAAU,MAAMf,GAAM,mDAAoD,KAAK,oBAAoB,EAC5G,GAAI,CAAC,KAAK,QAAS,MAAMA,GAAM,sEAAuE,KAAK,oBAAoB,EAC/H,GAAI,KAAK,SAAS,SAAW,EAAG,MAAMA,GAAM,+DAAgE,KAAK,oBAAoB,EACrI,OAAO,KAAK,QAAQ,CAAC,EAAE,UAAUe,CAAe,CACjD,CAEA,UAAUC,EAAwC,CACjD,YAAK,aAAa,KAAKA,CAAQ,EACxB,KAAK,YAAY,KAAK,KAAMA,CAAQ,CAC5C,CAEA,YAAYA,EAAwC,CACnD,IAAMC,EAAQ,KAAK,aAAa,QAAQD,CAAQ,EAC5CC,IAAU,GACb,KAAK,aAAa,OAAOA,EAAO,CAAC,EAC3BrB,GAAK,sCAAuCoB,CAAQ,CAC5D,CAEU,kBAAkBb,EAAoB,CAC/CL,GAAM,YAAY,KAAK,IAAI,cAAe,KAAK,aAAa,OAAQ,iBAAkB,CAAE,GAAGK,EAAO,KAAM,KAAK,YAAa,CAAC,EAC3H,QAAWe,KAAc,KAAK,aAC7BA,EAAWf,CAAK,CAElB,CAEA,IAAI,SAA8E,CAEjF,OAAO,KAAK,QACb,CACA,IAAI,aAAoC,CACvC,OAAO,KAAK,SAAS,IAAIgB,GAAKA,EAAE,GAAG,CACpC,CAEO,IAAOC,EAA2B,CAExC,OAAO,KAAK,QAAQ,IAAIA,CAAE,CAC3B,CACA,IAAW,UAAW,CACrB,OAAO,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO,CAC/C,CACA,IAAW,WAAY,CACtB,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,OAAO,CAC3C,CAEA,IAAI,UAAW,CACd,OAAO,KAAK,QAAQ,CAAC,CACtB,CACA,IAAI,WAAY,CACf,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAS,CAAC,CAC5C,CACO,UAAUC,EAAgBC,EAAgB,CAChD,GAAIA,EACH,OAAO,KAAK,QAAQ,SAASD,CAAM,EAEnC,GAAI,CAACA,EAAO,IAAK,MAAMrB,GAAM,mCAAoCqB,CAAM,EACvE,OAAO,KAAK,aAAaA,EAAO,GAAG,CAUrC,CACO,aAAaE,EAAsB,CACzC,OAAO,KAAK,YAAY,SAASA,EAAI,SAAS,CAAC,CAChD,CACA,IAAI,cAAe,CAClB,OAAO,IAAI,IAAI,KAAK,QAAQ,IAAIC,GAAO,CAACA,EAAI,IAAKA,CAAG,CAAC,CAAC,CACvD,CACO,UAAUD,EAAsB,CACtC,OAAO,KAAK,aAAa,IAAIA,EAAI,SAAS,CAAC,CAI5C,CAEO,oBAAoBF,EAAyB,CAEnD,OAAO,KAAK,QAAQ,KAAKI,GACxBA,EAAS,KAAOJ,EAAO,IACpBI,EAAS,KAAOJ,EAAO,IACvBI,EAAS,KAAOJ,EAAO,IACvBI,EAAS,KAAOJ,EAAO,EAC1B,CACF,CAEA,IAAI,SAAU,CACb,OAAO,KAAK,OAAS,CACtB,CACA,IAAI,MAAO,CACV,OAAO,KAAK,QAAQ,MACrB,CACA,IAAI,QAAS,CACZ,OAAO,KAAK,QAAQ,MACrB,CACA,IAAI,eAAgB,CACnB,OAAOV,GAAU,IAAM,KAAK,IAAI,CACjC,CACA,IAAI,sBAAuB,CAC1B,OAAOA,GAAU,IAAM,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG,CACrD,CACA,IAAI,YAAa,CAChB,OAAOe,GAAmB,KAAK,IAAI,CACpC,CACA,IAAI,YAAa,CAChB,MAAO,CAAC,CAAC,KAAK,SAAS,MACxB,CACD,EAIO,IAAMC,GAAN,MAAMC,WAAqBC,EAAO,CACxC,OAAO,UAAUC,EAAmBC,EAAe,CAClD,OAAO,IAAIH,GAAaG,GAAQ,SAAU,KAAM,CAAC,EAAGD,CAAO,CAC5D,CACA,YACCC,EACAC,EACAC,EACAC,EACC,CACD,MAAMH,EAAMC,EAASC,EAASC,EAAU,CAAE,eAAgB,EAAK,CAAC,CACjE,CAEA,IAAI,UAAW,CACd,MAAO,EACR,CACD,ECnMAC,GAAA,CAAA,EAAAC,GAAAD,GAAA,CAAA,KAAA,IAAAE,GAAA,OAAA,IAAAC,GAAA,OAAA,IAAAC,GAAA,OAAA,IAAAC,GAAA,KAAA,IAAAT,GAAA,MAAA,IAAAU,GAAA,UAAA,IAAAD,EAAA,CAAA,ECKA,IAAME,GAAU,CACd,SACA,SACA,SACA,QACF,EAEMC,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,gBACF,EAMO,SAASC,GAAIC,EAAO,CACzB,GAAIA,IAAU,KACZ,MAAO,OAET,GAAIA,IAAU,OACZ,MAAO,YAET,GAAIA,IAAU,IAAQA,IAAU,GAC9B,MAAO,UAET,IAAMC,EAAS,OAAOD,EACtB,GAAIH,GAAQ,SAASI,CAAM,EACzB,OAAOA,EAIT,GAAIA,IAAW,WACb,MAAO,WAET,GAAI,MAAM,QAAQD,CAAK,EACrB,MAAO,QAET,GAAIE,GAASF,CAAK,EAChB,MAAO,SAET,IAAMG,EAAaC,GAAcJ,CAAK,EACtC,OAAIG,GAIG,QACT,CAMA,SAASD,GAAUF,EAAO,CACxB,OAAOA,GAASA,EAAM,aAAeA,EAAM,YAAY,UAAYA,EAAM,YAAY,SAAS,KAAK,KAAMA,CAAK,CAChH,CAMA,SAASI,GAAeJ,EAAO,CAC7B,IAAMK,EAAiB,OAAO,UAAU,SAAS,KAAKL,CAAK,EAAE,MAAM,EAAG,EAAE,EACxE,GAAIF,GAAgB,SAASO,CAAc,EACzC,OAAOA,CAIX,CCzGA,IAAMC,EAAN,KAAW,CAMT,YAAaC,EAAOrB,EAAMsB,EAAU,CAClC,KAAK,MAAQD,EACb,KAAK,aAAeA,GAAS,EAC7B,KAAK,KAAOrB,EACZ,KAAK,SAAWsB,CAClB,CAGA,UAAY,CACV,MAAO,QAAQ,KAAK,KAAK,KAAK,KAAK,IAAI,EACzC,CAMA,QAASC,EAAK,CAEZ,OAAO,KAAK,MAAQA,EAAI,MAAQ,GAAK,KAAK,MAAQA,EAAI,MAAQ,EAAI,CACpE,CACF,EAGAH,EAAK,KAAO,IAAIA,EAAK,EAAG,OAAQ,EAAI,EACpCA,EAAK,OAAS,IAAIA,EAAK,EAAG,SAAU,EAAI,EACxCA,EAAK,MAAQ,IAAIA,EAAK,EAAG,QAAS,EAAI,EACtCA,EAAK,OAAS,IAAIA,EAAK,EAAG,SAAU,EAAI,EACxCA,EAAK,MAAQ,IAAIA,EAAK,EAAG,QAAS,EAAK,EACvCA,EAAK,IAAM,IAAIA,EAAK,EAAG,MAAO,EAAK,EACnCA,EAAK,IAAM,IAAIA,EAAK,EAAG,MAAO,EAAK,EACnCA,EAAK,MAAQ,IAAIA,EAAK,EAAG,QAAS,EAAI,EACtCA,EAAK,MAAQ,IAAIA,EAAK,EAAG,QAAS,EAAI,EACtCA,EAAK,KAAO,IAAIA,EAAK,EAAG,OAAQ,EAAI,EACpCA,EAAK,KAAO,IAAIA,EAAK,EAAG,OAAQ,EAAI,EACpCA,EAAK,UAAY,IAAIA,EAAK,EAAG,YAAa,EAAI,EAC9CA,EAAK,MAAQ,IAAIA,EAAK,EAAG,QAAS,EAAI,EAGtC,IAAMI,EAAN,KAAY,CAMV,YAAaC,EAAMX,EAAOY,EAAe,CACvC,KAAK,KAAOD,EACZ,KAAK,MAAQX,EACb,KAAK,cAAgBY,EAErB,KAAK,aAAe,OAEpB,KAAK,UAAY,MACnB,CAGA,UAAY,CACV,MAAO,SAAS,KAAK,IAAI,KAAK,KAAK,KAAK,EAC1C,CACF,EC5DaC,GAAY,WAAW,SAElC,CAAC,WAAW,QAAQ,SAEpB,WAAW,QAEX,OAAO,WAAW,OAAO,UAAa,WAElCC,GAAc,IAAI,YAClBC,GAAc,IAAI,YAMxB,SAASb,GAAUc,EAAK,CAEtB,OAAOH,IAAa,WAAW,OAAO,SAASG,CAAG,CACpD,CAMO,SAASC,GAAOD,EAAK,CAE1B,OAAMA,aAAe,WAGdd,GAASc,CAAG,EAAI,IAAI,WAAWA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAAIA,EAF3E,WAAW,KAAKA,CAAG,CAG9B,CAEO,IAAME,GAAWL,GAOpB,CAACM,EAAOC,EAAOC,IACNA,EAAMD,EAAQ,GAGnB,WAAW,OAAO,KAAKD,EAAM,SAASC,EAAOC,CAAG,CAAC,EAAE,SAAS,MAAM,EAChEC,GAAUH,EAAOC,EAAOC,CAAG,EASjC,CAACF,EAAOC,EAAOC,IACNA,EAAMD,EAAQ,GACjBN,GAAY,OAAOK,EAAM,SAASC,EAAOC,CAAG,CAAC,EAC7CC,GAAUH,EAAOC,EAAOC,CAAG,EAGxBE,GAAaV,GAKrBW,GACQA,EAAO,OAAS,GAGrB,WAAW,OAAO,KAAKA,CAAM,EAC3BC,GAAYD,CAAM,EAOvBA,GACQA,EAAO,OAAS,GAAKT,GAAY,OAAOS,CAAM,EAAIC,GAAYD,CAAM,EAY1E,IAAME,GAAQC,GAOjB,CAACC,EAAOC,EAAOC,IACTC,GAASH,CAAK,EACT,IAAI,WAAWA,EAAM,SAASC,EAAOC,CAAG,CAAC,EAE3CF,EAAM,MAAMC,EAAOC,CAAG,EAS/B,CAACF,EAAOC,EAAOC,IACNF,EAAM,MAAMC,EAAOC,CAAG,EAGtBE,GAASL,GAOlB,CAACM,EAAQC,KAGPD,EAASA,EAAO,IAAKE,GAAMA,aAAa,WACpCA,EAKF,WAAW,OAAO,KAAKA,CAAC,CAAC,EAEpBC,GAAM,WAAW,OAAO,OAAOH,EAAQC,CAAM,CAAC,GASvD,CAACD,EAAQC,IAAW,CAClB,IAAMG,EAAM,IAAI,WAAWH,CAAM,EAC7BI,EAAM,EACV,QAASC,KAAKN,EACRK,EAAMC,EAAE,OAASF,EAAI,SAEvBE,EAAIA,EAAE,SAAS,EAAGF,EAAI,OAASC,CAAG,GAEpCD,EAAI,IAAIE,EAAGD,CAAG,EACdA,GAAOC,EAAE,OAEX,OAAOF,CACT,EAESG,GAAQb,GAMhBc,GAGQ,WAAW,OAAO,YAAYA,CAAI,EAQ1CA,GACQ,IAAI,WAAWA,CAAI,EAqFzB,SAASC,GAASC,EAAIC,EAAI,CAE/B,GAAIb,GAASY,CAAE,GAAKZ,GAASa,CAAE,EAG7B,OAAOD,EAAG,QAAQC,CAAE,EAEtB,QAASC,EAAI,EAAGA,EAAIF,EAAG,OAAQE,IAC7B,GAAIF,EAAGE,CAAC,IAAMD,EAAGC,CAAC,EAGlB,OAAOF,EAAGE,CAAC,EAAID,EAAGC,CAAC,EAAI,GAAK,EAE9B,MAAO,EACT,CASA,SAASC,GAAaC,EAAK,CACzB,IAAMV,EAAM,CAAC,EACTW,EAAI,EACR,QAASH,EAAI,EAAGA,EAAIE,EAAI,OAAQF,IAAK,CACnC,IAAIV,EAAIY,EAAI,WAAWF,CAAC,EACpBV,EAAI,IACNE,EAAIW,GAAG,EAAIb,EACFA,EAAI,MACbE,EAAIW,GAAG,EAAKb,GAAK,EAAK,IACtBE,EAAIW,GAAG,EAAKb,EAAI,GAAM,MAEpBA,EAAI,SAAY,OAAYU,EAAI,EAAKE,EAAI,SACzCA,EAAI,WAAWF,EAAI,CAAC,EAAI,SAAY,OAEtCV,EAAI,QAAYA,EAAI,OAAW,KAAOY,EAAI,WAAW,EAAEF,CAAC,EAAI,MAC5DR,EAAIW,GAAG,EAAKb,GAAK,GAAM,IACvBE,EAAIW,GAAG,EAAMb,GAAK,GAAM,GAAM,IAC9BE,EAAIW,GAAG,EAAMb,GAAK,EAAK,GAAM,IAC7BE,EAAIW,GAAG,EAAKb,EAAI,GAAM,MAEtBE,EAAIW,GAAG,EAAKb,GAAK,GAAM,IACvBE,EAAIW,GAAG,EAAMb,GAAK,EAAK,GAAM,IAC7BE,EAAIW,GAAG,EAAKb,EAAI,GAAM,IAE1B,CACA,OAAOE,CACT,CAWA,SAASY,GAAWC,EAAKC,EAAQrB,EAAK,CACpC,IAAMsB,EAAM,CAAC,EAEb,KAAOD,EAASrB,GAAK,CACnB,IAAMuB,EAAYH,EAAIC,CAAM,EACxBG,EAAY,KACZC,EAAoBF,EAAY,IAAQ,EAAKA,EAAY,IAAQ,EAAKA,EAAY,IAAQ,EAAI,EAElG,GAAIF,EAASI,GAAoBzB,EAAK,CACpC,IAAI0B,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,EAAkB,CACxB,IAAK,GACCF,EAAY,MACdC,EAAYD,GAEd,MACF,IAAK,GACHG,EAAaN,EAAIC,EAAS,CAAC,GACtBK,EAAa,OAAU,MAC1BG,GAAiBN,EAAY,KAAS,EAAOG,EAAa,GACtDG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,IAAK,GACHH,EAAaN,EAAIC,EAAS,CAAC,EAC3BM,EAAYP,EAAIC,EAAS,CAAC,GACrBK,EAAa,OAAU,MAASC,EAAY,OAAU,MACzDE,GAAiBN,EAAY,KAAQ,IAAOG,EAAa,KAAS,EAAOC,EAAY,GAEjFE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,IAAK,GACHH,EAAaN,EAAIC,EAAS,CAAC,EAC3BM,EAAYP,EAAIC,EAAS,CAAC,EAC1BO,EAAaR,EAAIC,EAAS,CAAC,GACtBK,EAAa,OAAU,MAASC,EAAY,OAAU,MAASC,EAAa,OAAU,MACzFC,GAAiBN,EAAY,KAAQ,IAAQG,EAAa,KAAS,IAAOC,EAAY,KAAS,EAAOC,EAAa,GAC/GC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,GAGpB,CACF,CAGIL,IAAc,MAGhBA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbF,EAAI,KAAKE,IAAc,GAAK,KAAQ,KAAM,EAC1CA,EAAY,MAASA,EAAY,MAGnCF,EAAI,KAAKE,CAAS,EAClBH,GAAUI,CACZ,CAEA,OAAOK,GAAsBR,CAAG,CAClC,CAKA,IAAMS,GAAuB,KAMtB,SAASD,GAAuBE,EAAY,CACjD,IAAMC,EAAMD,EAAW,OACvB,GAAIC,GAAOF,GACT,OAAO,OAAO,aAAa,MAAM,OAAQC,CAAU,EAIrD,IAAIV,EAAM,GACNP,EAAI,EACR,KAAOA,EAAIkB,GACTX,GAAO,OAAO,aAAa,MACzB,OACAU,EAAW,MAAMjB,EAAGA,GAAKgB,EAAoB,CAC/C,EAEF,OAAOT,CACT,CCxYA,IAAMY,GAAmB,IAEZC,GAAN,KAAS,CAId,YAAaC,EAAYF,GAAkB,CACzC,KAAK,UAAYE,EAEjB,KAAK,OAAS,EAEd,KAAK,UAAY,GAEjB,KAAK,OAAS,CAAC,EAGf,KAAK,gBAAkB,IACzB,CAEA,OAAS,CACP,KAAK,OAAS,EACd,KAAK,UAAY,GACb,KAAK,OAAO,SACd,KAAK,OAAS,CAAC,GAEb,KAAK,kBAAoB,OAC3B,KAAK,OAAO,KAAK,KAAK,eAAe,EACrC,KAAK,UAAY,KAAK,gBAAgB,OAAS,EAEnD,CAKA,KAAMtC,EAAO,CACX,IAAIuC,EAAW,KAAK,OAAO,KAAK,OAAO,OAAS,CAAC,EAEjD,GADe,KAAK,OAASvC,EAAM,QACrB,KAAK,UAAY,EAAG,CAEhC,IAAMwC,EAAWD,EAAS,QAAU,KAAK,UAAY,KAAK,QAAU,EAEpEA,EAAS,IAAIvC,EAAOwC,CAAQ,CAC9B,KAAO,CAEL,GAAID,EAAU,CAEZ,IAAMC,EAAWD,EAAS,QAAU,KAAK,UAAY,KAAK,QAAU,EAChEC,EAAWD,EAAS,SAEtB,KAAK,OAAO,KAAK,OAAO,OAAS,CAAC,EAAIA,EAAS,SAAS,EAAGC,CAAQ,EACnE,KAAK,UAAY,KAAK,OAAS,EAEnC,CACIxC,EAAM,OAAS,IAAMA,EAAM,OAAS,KAAK,WAE3CuC,EAAW3B,GAAM,KAAK,SAAS,EAC/B,KAAK,OAAO,KAAK2B,CAAQ,EACzB,KAAK,WAAaA,EAAS,OACvB,KAAK,kBAAoB,OAC3B,KAAK,gBAAkBA,GAGzBA,EAAS,IAAIvC,EAAO,CAAC,IAGrB,KAAK,OAAO,KAAKA,CAAK,EACtB,KAAK,WAAaA,EAAM,OAE5B,CACA,KAAK,QAAUA,EAAM,MACvB,CAMA,QAASyC,EAAQ,GAAO,CACtB,IAAIC,EACJ,GAAI,KAAK,OAAO,SAAW,EAAG,CAC5B,IAAMC,EAAQ,KAAK,OAAO,CAAC,EACvBF,GAAS,KAAK,OAASE,EAAM,OAAS,GAGxCD,EAAO,KAAK,SAAWC,EAAM,OAASA,EAAQA,EAAM,SAAS,EAAG,KAAK,MAAM,EAC3E,KAAK,gBAAkB,KACvB,KAAK,OAAS,CAAC,GAGfD,EAAO5C,GAAM6C,EAAO,EAAG,KAAK,MAAM,CAEtC,MAEED,EAAOtC,GAAO,KAAK,OAAQ,KAAK,MAAM,EAExC,OAAIqC,GACF,KAAK,MAAM,EAENC,CACT,CACF,EC3HME,GAAkB,qBAClBC,GAAkB,qBAElBC,GAAuB,CAAC,EAC9BA,GAAqB,EAAE,EAAI,EAC3BA,GAAqB,EAAE,EAAI,EAC3BA,GAAqB,EAAE,EAAI,EAC3BA,GAAqB,EAAE,EAAI,EAC3BA,GAAqB,EAAE,EAAI,EAO3B,SAASC,GAAkBC,EAAMC,EAAKC,EAAM,CAC1C,GAAIF,EAAK,OAASC,EAAMC,EACtB,MAAM,IAAI,MAAM,GAAGN,EAAe,2BAA2B,CAEjE,CCdO,IAAMO,GAAiB,CAAC,GAAI,IAAK,MAAO,WAAY,OAAO,sBAAsB,CAAC,EAalF,SAASC,GAAWJ,EAAMzB,EAAQ8B,EAAS,CAChDN,GAAiBC,EAAMzB,EAAQ,CAAC,EAChC,IAAM+B,EAAQN,EAAKzB,CAAM,EACzB,GAAI8B,EAAQ,SAAW,IAAQC,EAAQH,GAAe,CAAC,EACrD,MAAM,IAAI,MAAM,GAAGP,EAAe,+DAA+D,EAEnG,OAAOU,CACT,CAQO,SAASC,GAAYP,EAAMzB,EAAQ8B,EAAS,CACjDN,GAAiBC,EAAMzB,EAAQ,CAAC,EAChC,IAAM+B,EAASN,EAAKzB,CAAM,GAAK,EAAKyB,EAAKzB,EAAS,CAAC,EACnD,GAAI8B,EAAQ,SAAW,IAAQC,EAAQH,GAAe,CAAC,EACrD,MAAM,IAAI,MAAM,GAAGP,EAAe,+DAA+D,EAEnG,OAAOU,CACT,CAQO,SAASE,GAAYR,EAAMzB,EAAQ8B,EAAS,CACjDN,GAAiBC,EAAMzB,EAAQ,CAAC,EAChC,IAAM+B,EAASN,EAAKzB,CAAM,EAAI,UAA2ByB,EAAKzB,EAAS,CAAC,GAAK,KAAOyB,EAAKzB,EAAS,CAAC,GAAK,GAAKyB,EAAKzB,EAAS,CAAC,EAC5H,GAAI8B,EAAQ,SAAW,IAAQC,EAAQH,GAAe,CAAC,EACrD,MAAM,IAAI,MAAM,GAAGP,EAAe,+DAA+D,EAEnG,OAAOU,CACT,CAQO,SAASG,GAAYT,EAAMzB,EAAQ8B,EAAS,CAEjDN,GAAiBC,EAAMzB,EAAQ,CAAC,EAChC,IAAMmC,EAAMV,EAAKzB,CAAM,EAAI,UAA2ByB,EAAKzB,EAAS,CAAC,GAAK,KAAOyB,EAAKzB,EAAS,CAAC,GAAK,GAAKyB,EAAKzB,EAAS,CAAC,EACnHoC,EAAMX,EAAKzB,EAAS,CAAC,EAAI,UAA2ByB,EAAKzB,EAAS,CAAC,GAAK,KAAOyB,EAAKzB,EAAS,CAAC,GAAK,GAAKyB,EAAKzB,EAAS,CAAC,EACvH+B,GAAS,OAAOI,CAAE,GAAK,OAAO,EAAE,GAAK,OAAOC,CAAE,EACpD,GAAIN,EAAQ,SAAW,IAAQC,EAAQH,GAAe,CAAC,EACrD,MAAM,IAAI,MAAM,GAAGP,EAAe,+DAA+D,EAEnG,GAAIU,GAAS,OAAO,iBAClB,OAAO,OAAOA,CAAK,EAErB,GAAID,EAAQ,cAAgB,GAC1B,OAAOC,EAET,MAAM,IAAI,MAAM,GAAGV,EAAe,+DAA+D,CACnG,CAgBO,SAASgB,GAAaZ,EAAMC,EAAKY,EAAQR,EAAS,CACvD,OAAO,IAAIS,EAAMC,EAAK,KAAMX,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CAClE,CASO,SAASW,GAAchB,EAAMC,EAAKY,EAAQR,EAAS,CACxD,OAAO,IAAIS,EAAMC,EAAK,KAAMR,GAAWP,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACnE,CASO,SAASY,GAAcjB,EAAMC,EAAKY,EAAQR,EAAS,CACxD,OAAO,IAAIS,EAAMC,EAAK,KAAMP,GAAWR,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACnE,CASO,SAASa,GAAclB,EAAMC,EAAKY,EAAQR,EAAS,CACxD,OAAO,IAAIS,EAAMC,EAAK,KAAMN,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACnE,CAMO,SAASc,GAAY7C,EAAK8C,EAAO,CACtC,OAAOC,GAAgB/C,EAAK,EAAG8C,EAAM,KAAK,CAC5C,CAOO,SAASC,GAAiB/C,EAAKgD,EAAOC,EAAM,CACjD,GAAIA,EAAOpB,GAAe,CAAC,EAAG,CAC5B,IAAMqB,EAAQ,OAAOD,CAAI,EAEzBjD,EAAI,KAAK,CAACgD,EAAQE,CAAK,CAAC,CAC1B,SAAWD,EAAOpB,GAAe,CAAC,EAAG,CACnC,IAAMqB,EAAQ,OAAOD,CAAI,EAEzBjD,EAAI,KAAK,CAACgD,EAAQ,GAAIE,CAAK,CAAC,CAC9B,SAAWD,EAAOpB,GAAe,CAAC,EAAG,CACnC,IAAMqB,EAAQ,OAAOD,CAAI,EAEzBjD,EAAI,KAAK,CAACgD,EAAQ,GAAIE,IAAU,EAAGA,EAAQ,GAAI,CAAC,CAClD,SAAWD,EAAOpB,GAAe,CAAC,EAAG,CACnC,IAAMqB,EAAQ,OAAOD,CAAI,EAEzBjD,EAAI,KAAK,CAACgD,EAAQ,GAAKE,IAAU,GAAM,IAAOA,IAAU,GAAM,IAAOA,IAAU,EAAK,IAAMA,EAAQ,GAAI,CAAC,CACzG,KAAO,CACL,IAAMC,EAAQ,OAAOF,CAAI,EACzB,GAAIE,EAAQtB,GAAe,CAAC,EAAG,CAE7B,IAAMuB,EAAM,CAACJ,EAAQ,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAExCX,EAAK,OAAOc,EAAQ,OAAO,UAAU,CAAC,EACtCf,EAAK,OAAOe,GAAS,OAAO,EAAE,EAAI,OAAO,UAAU,CAAC,EACxDC,EAAI,CAAC,EAAIf,EAAK,IACdA,EAAKA,GAAM,EACXe,EAAI,CAAC,EAAIf,EAAK,IACdA,EAAKA,GAAM,EACXe,EAAI,CAAC,EAAIf,EAAK,IACdA,EAAKA,GAAM,EACXe,EAAI,CAAC,EAAIf,EAAK,IACde,EAAI,CAAC,EAAIhB,EAAK,IACdA,EAAKA,GAAM,EACXgB,EAAI,CAAC,EAAIhB,EAAK,IACdA,EAAKA,GAAM,EACXgB,EAAI,CAAC,EAAIhB,EAAK,IACdA,EAAKA,GAAM,EACXgB,EAAI,CAAC,EAAIhB,EAAK,IACdpC,EAAI,KAAKoD,CAAG,CACd,KACE,OAAM,IAAI,MAAM,GAAG9B,EAAe,iDAAiD,CAEvF,CACF,CAMAuB,GAAW,YAAc,SAAsBC,EAAO,CACpD,OAAOC,GAAgB,YAAYD,EAAM,KAAK,CAChD,EAMAC,GAAgB,YAAc,SAAsBE,EAAM,CACxD,OAAIA,EAAOpB,GAAe,CAAC,EAClB,EAELoB,EAAOpB,GAAe,CAAC,EAClB,EAELoB,EAAOpB,GAAe,CAAC,EAClB,EAELoB,EAAOpB,GAAe,CAAC,EAClB,EAEF,CACT,EAOAgB,GAAW,cAAgB,SAAwBQ,EAAMC,EAAM,CAC7D,OAAOD,EAAK,MAAQC,EAAK,MAAQ,GAAKD,EAAK,MAAQC,EAAK,MAAQ,EAAyB,CAC3F,EChNO,SAASC,GAAe7B,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAO,IAAIS,EAAMC,EAAK,OAAQ,GAAUX,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CAC9E,CASO,SAASyB,GAAgB9B,EAAMC,EAAKY,EAAQR,EAAS,CAC1D,OAAO,IAAIS,EAAMC,EAAK,OAAQ,GAAUR,GAAWP,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CAC/E,CASO,SAAS0B,GAAgB/B,EAAMC,EAAKY,EAAQR,EAAS,CAC1D,OAAO,IAAIS,EAAMC,EAAK,OAAQ,GAAUP,GAAWR,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CAC/E,CAEA,IAAM2B,GAAQ,OAAO,EAAE,EACjBC,GAAQ,OAAO,CAAC,EASf,SAASC,GAAgBlC,EAAMC,EAAKY,EAAQR,EAAS,CAC1D,IAAM8B,EAAW1B,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAClD,GAAI,OAAO8B,GAAQ,SAAU,CAC3B,IAAM7B,EAAQ,GAAK6B,EACnB,GAAI7B,GAAS,OAAO,iBAClB,OAAO,IAAIQ,EAAMC,EAAK,OAAQT,EAAO,CAAC,CAE1C,CACA,GAAID,EAAQ,cAAgB,GAC1B,MAAM,IAAI,MAAM,GAAGT,EAAe,+DAA+D,EAEnG,OAAO,IAAIkB,EAAMC,EAAK,OAAQiB,GAAQ,OAAOG,CAAG,EAAG,CAAC,CACtD,CAMO,SAASC,GAAc9D,EAAK8C,EAAO,CACxC,IAAMiB,EAASjB,EAAM,MACfkB,EAAY,OAAOD,GAAW,SAAYA,EAASL,GAAQC,GAAUI,EAAS,GAAK,EACpFhB,GAAgB/C,EAAK8C,EAAM,KAAK,aAAckB,CAAQ,CAC7D,CAMAF,GAAa,YAAc,SAAsBhB,EAAO,CACtD,IAAMiB,EAASjB,EAAM,MACfkB,EAAY,OAAOD,GAAW,SAAYA,EAASL,GAAQC,GAAUI,EAAS,GAAK,EAGzF,OAAIC,EAAgBnC,GAAe,CAAC,EAC3B,EAELmC,EAAgBnC,GAAe,CAAC,EAC3B,EAELmC,EAAgBnC,GAAe,CAAC,EAC3B,EAELmC,EAAgBnC,GAAe,CAAC,EAC3B,EAEF,CACT,EAOAiC,GAAa,cAAgB,SAAwBT,EAAMC,EAAM,CAE/D,OAAOD,EAAK,MAAQC,EAAK,MAAQ,EAAID,EAAK,MAAQC,EAAK,MAAQ,GAA0B,CAC3F,EC7FA,SAASW,GAASvC,EAAMC,EAAKuC,EAAQlF,EAAQ,CAC3CyC,GAAiBC,EAAMC,EAAKuC,EAASlF,CAAM,EAC3C,IAAMgB,EAAMxB,GAAMkD,EAAMC,EAAMuC,EAAQvC,EAAMuC,EAASlF,CAAM,EAC3D,OAAO,IAAIwD,EAAMC,EAAK,MAAOzC,EAAKkE,EAASlF,CAAM,CACnD,CASO,SAASmF,GAAoBzC,EAAMC,EAAKyC,EAAOC,EAAU,CAC9D,OAAOJ,GAAQvC,EAAMC,EAAK,EAAGyC,CAAK,CACpC,CASO,SAASE,GAAc5C,EAAMC,EAAKY,EAAQR,EAAS,CACxD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQG,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACrE,CASO,SAASwC,GAAe7C,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQM,GAAWP,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACtE,CASO,SAASyC,GAAe9C,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQO,GAAWR,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACtE,CAUO,SAAS0C,GAAe/C,EAAMC,EAAKY,EAAQR,EAAS,CACzD,IAAM2C,EAASvC,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAChD,GAAI,OAAO2C,GAAM,SACf,MAAM,IAAI,MAAM,GAAGpD,EAAe,6CAA6C,EAEjF,OAAO2C,GAAQvC,EAAMC,EAAK,EAAG+C,CAAC,CAChC,CAQA,SAASC,GAAY7B,EAAO,CAC1B,OAAIA,EAAM,eAAiB,SACzBA,EAAM,aAAeA,EAAM,OAASL,EAAK,OAASmC,GAAW9B,EAAM,KAAK,EAAIA,EAAM,OAG7EA,EAAM,YACf,CAMO,SAAS+B,GAAa7E,EAAK8C,EAAO,CACvC,IAAMpE,EAAQiG,GAAW7B,CAAK,EACzBC,GAAgB/C,EAAK8C,EAAM,KAAK,aAAcpE,EAAM,MAAM,EAC/DsB,EAAI,KAAKtB,CAAK,CAChB,CAMAmG,GAAY,YAAc,SAAsB/B,EAAO,CACrD,IAAMpE,EAAQiG,GAAW7B,CAAK,EAC9B,OAAYC,GAAgB,YAAYrE,EAAM,MAAM,EAAIA,EAAM,MAChE,EAOAmG,GAAY,cAAgB,SAAwBxB,EAAMC,EAAM,CAC9D,OAAOwB,GAAaH,GAAWtB,CAAI,EAAGsB,GAAWrB,CAAI,CAAC,CACxD,EAOO,SAASwB,GAAcrF,EAAIC,EAAI,CACpC,OAAOD,EAAG,OAASC,EAAG,OAAS,GAAKD,EAAG,OAASC,EAAG,OAAS,EAAIF,GAAQC,EAAIC,CAAE,CAChF,CCjHA,SAASuE,GAASvC,EAAMC,EAAKuC,EAAQlF,EAAQ+C,EAAS,CACpD,IAAMgD,EAAYb,EAASlF,EAC3ByC,GAAiBC,EAAMC,EAAKoD,CAAS,EACrC,IAAMC,EAAM,IAAIxC,EAAMC,EAAK,OAAQwC,GAASvD,EAAMC,EAAMuC,EAAQvC,EAAMoD,CAAS,EAAGA,CAAS,EAC3F,OAAIhD,EAAQ,oBAAsB,KAChCiD,EAAI,UAAYxG,GAAMkD,EAAMC,EAAMuC,EAAQvC,EAAMoD,CAAS,GAEpDC,CACT,CASO,SAASE,GAAqBxD,EAAMC,EAAKyC,EAAOrC,EAAS,CAC9D,OAAOkC,GAAQvC,EAAMC,EAAK,EAAGyC,EAAOrC,CAAO,CAC7C,CASO,SAASoD,GAAezD,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQG,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,EAAGA,CAAO,CAC9E,CASO,SAASqD,GAAgB1D,EAAMC,EAAKY,EAAQR,EAAS,CAC1D,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQM,GAAWP,EAAMC,EAAM,EAAGI,CAAO,EAAGA,CAAO,CAC/E,CASO,SAASsD,GAAgB3D,EAAMC,EAAKY,EAAQR,EAAS,CAC1D,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQO,GAAWR,EAAMC,EAAM,EAAGI,CAAO,EAAGA,CAAO,CAC/E,CAUO,SAASuD,GAAgB5D,EAAMC,EAAKY,EAAQR,EAAS,CAC1D,IAAM2C,EAASvC,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAChD,GAAI,OAAO2C,GAAM,SACf,MAAM,IAAI,MAAM,GAAGpD,EAAe,8CAA8C,EAElF,OAAO2C,GAAQvC,EAAMC,EAAK,EAAG+C,EAAG3C,CAAO,CACzC,CAEO,IAAMwD,GAAeV,GCzE5B,SAASZ,GAASuB,EAAOC,EAAMvB,EAAQlF,EAAQ,CAC7C,OAAO,IAAIwD,EAAMC,EAAK,MAAOzD,EAAQkF,CAAM,CAC7C,CASO,SAASwB,GAAoBhE,EAAMC,EAAKyC,EAAOC,EAAU,CAC9D,OAAOJ,GAAQvC,EAAMC,EAAK,EAAGyC,CAAK,CACpC,CASO,SAASuB,GAAcjE,EAAMC,EAAKY,EAAQR,EAAS,CACxD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQG,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACrE,CASO,SAAS6D,GAAelE,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQM,GAAWP,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACtE,CASO,SAAS8D,GAAenE,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQO,GAAWR,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACtE,CAUO,SAAS+D,GAAepE,EAAMC,EAAKY,EAAQR,EAAS,CACzD,IAAM2C,EAASvC,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAChD,GAAI,OAAO2C,GAAM,SACf,MAAM,IAAI,MAAM,GAAGpD,EAAe,6CAA6C,EAEjF,OAAO2C,GAAQvC,EAAMC,EAAK,EAAG+C,CAAC,CAChC,CASO,SAASqB,GAAuBrE,EAAMC,EAAKY,EAAQR,EAAS,CACjE,GAAIA,EAAQ,kBAAoB,GAC9B,MAAM,IAAI,MAAM,GAAGT,EAAe,sCAAsC,EAE1E,OAAO2C,GAAQvC,EAAMC,EAAK,EAAG,GAAQ,CACvC,CAMO,SAASqE,GAAahG,EAAK8C,EAAO,CAClCC,GAAgB/C,EAAKyC,EAAK,MAAM,aAAcK,EAAM,KAAK,CAChE,CAIAkD,GAAY,cAAqBnD,GAAW,cAM5CmD,GAAY,YAAc,SAAsBlD,EAAO,CACrD,OAAYC,GAAgB,YAAYD,EAAM,KAAK,CACrD,EChGA,SAASmB,GAASuB,EAAOC,EAAMvB,EAAQlF,EAAQ,CAC7C,OAAO,IAAIwD,EAAMC,EAAK,IAAKzD,EAAQkF,CAAM,CAC3C,CASO,SAAS+B,GAAkBvE,EAAMC,EAAKyC,EAAOC,EAAU,CAC5D,OAAOJ,GAAQvC,EAAMC,EAAK,EAAGyC,CAAK,CACpC,CASO,SAAS8B,GAAYxE,EAAMC,EAAKY,EAAQR,EAAS,CACtD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQG,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACrE,CASO,SAASoE,GAAazE,EAAMC,EAAKY,EAAQR,EAAS,CACvD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQM,GAAWP,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACtE,CASO,SAASqE,GAAa1E,EAAMC,EAAKY,EAAQR,EAAS,CACvD,OAAOkC,GAAQvC,EAAMC,EAAK,EAAQO,GAAWR,EAAMC,EAAM,EAAGI,CAAO,CAAC,CACtE,CAUO,SAASsE,GAAa3E,EAAMC,EAAKY,EAAQR,EAAS,CACvD,IAAM2C,EAASvC,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAChD,GAAI,OAAO2C,GAAM,SACf,MAAM,IAAI,MAAM,GAAGpD,EAAe,2CAA2C,EAE/E,OAAO2C,GAAQvC,EAAMC,EAAK,EAAG+C,CAAC,CAChC,CASO,SAAS4B,GAAqB5E,EAAMC,EAAKY,EAAQR,EAAS,CAC/D,GAAIA,EAAQ,kBAAoB,GAC9B,MAAM,IAAI,MAAM,GAAGT,EAAe,sCAAsC,EAE1E,OAAO2C,GAAQvC,EAAMC,EAAK,EAAG,GAAQ,CACvC,CAMO,SAAS4E,GAAWvG,EAAK8C,EAAO,CAChCC,GAAgB/C,EAAKyC,EAAK,IAAI,aAAcK,EAAM,KAAK,CAC9D,CAIAyD,GAAU,cAAqB1D,GAAW,cAM1C0D,GAAU,YAAc,SAAsBzD,EAAO,CACnD,OAAYC,GAAgB,YAAYD,EAAM,KAAK,CACrD,ECjGO,SAAS0D,GAAkBhB,EAAOC,EAAMrB,EAAOC,EAAU,CAC9D,OAAO,IAAI7B,EAAMC,EAAK,IAAK2B,EAAO,CAAC,CACrC,CASO,SAASqC,GAAY/E,EAAMC,EAAKY,EAAQR,EAAS,CACtD,OAAO,IAAIS,EAAMC,EAAK,IAAUX,GAAUJ,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACtE,CASO,SAAS2E,GAAahF,EAAMC,EAAKY,EAAQR,EAAS,CACvD,OAAO,IAAIS,EAAMC,EAAK,IAAUR,GAAWP,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACvE,CASO,SAAS4E,GAAajF,EAAMC,EAAKY,EAAQR,EAAS,CACvD,OAAO,IAAIS,EAAMC,EAAK,IAAUP,GAAWR,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACvE,CASO,SAAS6E,GAAalF,EAAMC,EAAKY,EAAQR,EAAS,CACvD,OAAO,IAAIS,EAAMC,EAAK,IAAUN,GAAWT,EAAMC,EAAM,EAAGI,CAAO,EAAG,CAAC,CACvE,CAMO,SAAS8E,GAAW7G,EAAK8C,EAAO,CAChCC,GAAgB/C,EAAKyC,EAAK,IAAI,aAAcK,EAAM,KAAK,CAC9D,CAEA+D,GAAU,cAAqBhE,GAAW,cAM1CgE,GAAU,YAAc,SAAsB/D,EAAO,CACnD,OAAYC,GAAgB,YAAYD,EAAM,KAAK,CACrD,EClEA,IAAMgE,GAAc,GACdC,GAAa,GACbC,GAAa,GACbC,GAAkB,GASjB,SAASC,GAAiB1B,EAAOC,EAAMlD,EAAQR,EAAS,CAC7D,GAAIA,EAAQ,iBAAmB,GAC7B,MAAM,IAAI,MAAM,GAAGT,EAAe,qCAAqC,EACzE,OAAWS,EAAQ,wBAA0B,GACpC,IAAIS,EAAMC,EAAK,KAAM,KAAM,CAAC,EAE9B,IAAID,EAAMC,EAAK,UAAW,OAAW,CAAC,CAC/C,CASO,SAAS0E,GAAa3B,EAAOC,EAAMlD,EAAQR,EAAS,CACzD,GAAIA,EAAQ,kBAAoB,GAC9B,MAAM,IAAI,MAAM,GAAGT,EAAe,sCAAsC,EAE1E,OAAO,IAAIkB,EAAMC,EAAK,MAAO,OAAW,CAAC,CAC3C,CAQA,SAAS2E,GAAapF,EAAOtD,EAAOqD,EAAS,CAC3C,GAAIA,EAAS,CACX,GAAIA,EAAQ,WAAa,IAAS,OAAO,MAAMC,CAAK,EAClD,MAAM,IAAI,MAAM,GAAGV,EAAe,+BAA+B,EAEnE,GAAIS,EAAQ,gBAAkB,KAAUC,IAAU,KAAYA,IAAU,MACtE,MAAM,IAAI,MAAM,GAAGV,EAAe,oCAAoC,CAE1E,CACA,OAAO,IAAIkB,EAAMC,EAAK,MAAOT,EAAOtD,CAAK,CAC3C,CASO,SAAS2I,GAAe3F,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOqF,GAAYE,GAAY5F,EAAMC,EAAM,CAAC,EAAG,EAAGI,CAAO,CAC3D,CASO,SAASwF,GAAe7F,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOqF,GAAYI,GAAY9F,EAAMC,EAAM,CAAC,EAAG,EAAGI,CAAO,CAC3D,CASO,SAAS0F,GAAe/F,EAAMC,EAAKY,EAAQR,EAAS,CACzD,OAAOqF,GAAYM,GAAYhG,EAAMC,EAAM,CAAC,EAAG,EAAGI,CAAO,CAC3D,CAOO,SAAS4F,GAAa3H,EAAK8C,EAAOf,EAAS,CAChD,IAAM6F,EAAQ9E,EAAM,MAEpB,GAAI8E,IAAU,GACZ5H,EAAI,KAAK,CAACyC,EAAK,MAAM,aAAeqE,EAAW,CAAC,UACvCc,IAAU,GACnB5H,EAAI,KAAK,CAACyC,EAAK,MAAM,aAAesE,EAAU,CAAC,UACtCa,IAAU,KACnB5H,EAAI,KAAK,CAACyC,EAAK,MAAM,aAAeuE,EAAU,CAAC,UACtCY,IAAU,OACnB5H,EAAI,KAAK,CAACyC,EAAK,MAAM,aAAewE,EAAe,CAAC,MAC/C,CACL,IAAIY,EACAC,EAAU,IACV,CAAC/F,GAAWA,EAAQ,UAAY,MAClCgG,GAAcH,CAAK,EACnBC,EAAUP,GAAYU,GAAM,CAAC,EACzBJ,IAAUC,GAAW,OAAO,MAAMD,CAAK,GACzCI,GAAK,CAAC,EAAI,IACVhI,EAAI,KAAKgI,GAAK,MAAM,EAAG,CAAC,CAAC,EACzBF,EAAU,KAEVG,GAAcL,CAAK,EACnBC,EAAUL,GAAYQ,GAAM,CAAC,EACzBJ,IAAUC,IACZG,GAAK,CAAC,EAAI,IACVhI,EAAI,KAAKgI,GAAK,MAAM,EAAG,CAAC,CAAC,EACzBF,EAAU,MAIXA,IACHI,GAAcN,CAAK,EACnBC,EAAUH,GAAYM,GAAM,CAAC,EAC7BA,GAAK,CAAC,EAAI,IACVhI,EAAI,KAAKgI,GAAK,MAAM,EAAG,CAAC,CAAC,EAE7B,CACF,CAOAL,GAAY,YAAc,SAAsB7E,EAAOf,EAAS,CAC9D,IAAM6F,EAAQ9E,EAAM,MAEpB,GAAI8E,IAAU,IAASA,IAAU,IAAQA,IAAU,MAAQA,IAAU,OACnE,MAAO,GAGT,GAAI,CAAC7F,GAAWA,EAAQ,UAAY,GAAM,CACxCgG,GAAcH,CAAK,EACnB,IAAIC,EAAUP,GAAYU,GAAM,CAAC,EACjC,GAAIJ,IAAUC,GAAW,OAAO,MAAMD,CAAK,EACzC,MAAO,GAIT,GAFAK,GAAcL,CAAK,EACnBC,EAAUL,GAAYQ,GAAM,CAAC,EACzBJ,IAAUC,EACZ,MAAO,EAEX,CACA,MAAO,EACT,EAEA,IAAMM,GAAS,IAAI,YAAY,CAAC,EAC1BC,GAAW,IAAI,SAASD,GAAQ,CAAC,EACjCH,GAAO,IAAI,WAAWG,GAAQ,CAAC,EAKrC,SAASJ,GAAeM,EAAK,CAC3B,GAAIA,IAAQ,IACVD,GAAS,UAAU,EAAG,MAAQ,EAAK,UAC1BC,IAAQ,KACjBD,GAAS,UAAU,EAAG,MAAQ,EAAK,UAC1B,OAAO,MAAMC,CAAG,EACzBD,GAAS,UAAU,EAAG,MAAQ,EAAK,MAC9B,CACLA,GAAS,WAAW,EAAGC,CAAG,EAC1B,IAAMC,EAASF,GAAS,UAAU,CAAC,EAC7BG,GAAYD,EAAS,aAAe,GACpCE,EAAWF,EAAS,QAG1B,GAAIC,IAAa,IAEfH,GAAS,UAAU,EAAG,MAAQ,EAAK,UAC1BG,IAAa,EAEtBH,GAAS,UAAU,GAAKC,EAAM,aAAe,GAAOG,GAAY,GAAK,EAAK,MACrE,CAEL,IAAMC,EAAkBF,EAAW,IAG/BE,EAAkB,IAKpBL,GAAS,UAAU,EAAG,CAAC,EACdK,EAAkB,IAI3BL,GAAS,UAAU,GAAKE,EAAS,aAAe,GAAsB,GAAM,GAAKG,EAAmB,EAAK,EAEzGL,GAAS,UAAU,GAAKE,EAAS,aAAe,GAAQG,EAAkB,IAAO,GAAOD,GAAY,GAAK,EAAK,CAElH,CACF,CACF,CAOA,SAASlB,GAAaU,EAAMrG,EAAK,CAC/B,GAAIqG,EAAK,OAASrG,EAAM,EACtB,MAAM,IAAI,MAAM,GAAGL,EAAe,8BAA8B,EAGlE,IAAMoH,GAAQV,EAAKrG,CAAG,GAAK,GAAKqG,EAAKrG,EAAM,CAAC,EAC5C,GAAI+G,IAAS,MACX,MAAO,KAET,GAAIA,IAAS,MACX,MAAO,KAET,GAAIA,IAAS,MACX,MAAO,KAET,IAAMC,EAAOD,GAAQ,GAAM,GACrBE,EAAOF,EAAO,KAChBG,EACJ,OAAIF,IAAQ,EACVE,EAAMD,EAAQ,GAAK,IACVD,IAAQ,GACjBE,GAAOD,EAAO,MAAS,IAAMD,EAAM,IAInCE,EAAMD,IAAS,EAAI,IAAW,IAExBF,EAAO,MAAU,CAACG,EAAMA,CAClC,CAKA,SAASZ,GAAeI,EAAK,CAC3BD,GAAS,WAAW,EAAGC,EAAK,EAAK,CACnC,CAOA,SAASb,GAAaQ,EAAMrG,EAAK,CAC/B,GAAIqG,EAAK,OAASrG,EAAM,EACtB,MAAM,IAAI,MAAM,GAAGL,EAAe,8BAA8B,EAElE,IAAMrB,GAAU+H,EAAK,YAAc,GAAKrG,EACxC,OAAO,IAAI,SAASqG,EAAK,OAAQ/H,EAAQ,CAAC,EAAE,WAAW,EAAG,EAAK,CACjE,CAKA,SAASiI,GAAeG,EAAK,CAC3BD,GAAS,WAAW,EAAGC,EAAK,EAAK,CACnC,CAOA,SAASX,GAAaM,EAAMrG,EAAK,CAC/B,GAAIqG,EAAK,OAASrG,EAAM,EACtB,MAAM,IAAI,MAAM,GAAGL,EAAe,8BAA8B,EAElE,IAAMrB,GAAU+H,EAAK,YAAc,GAAKrG,EACxC,OAAO,IAAI,SAASqG,EAAK,OAAQ/H,EAAQ,CAAC,EAAE,WAAW,EAAG,EAAK,CACjE,CAOA0H,GAAY,cAAgB9E,GAAW,cCxRvC,SAASiG,GAAcpH,EAAMC,EAAKyC,EAAO,CACvC,MAAM,IAAI,MAAM,GAAG9C,EAAe,+BAA+B8C,CAAK,eAAe1C,EAAKC,CAAG,IAAM,CAAC,EAAE,CACxG,CAMA,SAASoH,GAASC,EAAK,CACrB,MAAO,IAAM,CAAE,MAAM,IAAI,MAAM,GAAG1H,EAAe,IAAI0H,CAAG,EAAE,CAAE,CAC9D,CAGO,IAAMC,GAAO,CAAC,EAGrB,QAAStJ,EAAI,EAAGA,GAAK,GAAMA,IACzBsJ,GAAKtJ,CAAC,EAAImJ,GAEZG,GAAK,EAAI,EAAS3G,GAClB2G,GAAK,EAAI,EAASvG,GAClBuG,GAAK,EAAI,EAAStG,GAClBsG,GAAK,EAAI,EAASrG,GAClBqG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GAEb,QAASnJ,EAAI,GAAMA,GAAK,GAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAImJ,GAEZG,GAAK,EAAI,EAAW1F,GACpB0F,GAAK,EAAI,EAAWzF,GACpByF,GAAK,EAAI,EAAWxF,GACpBwF,GAAK,EAAI,EAAWrF,GACpBqF,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GAEb,QAASnJ,EAAI,GAAMA,GAAK,GAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAUwE,GAElB8E,GAAK,EAAI,EAAU3E,GACnB2E,GAAK,EAAI,EAAU1E,GACnB0E,GAAK,EAAI,EAAUzE,GACnByE,GAAK,EAAI,EAAUxE,GACnBwE,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIH,GACbG,GAAK,EAAI,EAAIF,GAAQ,mDAAmD,EAExE,QAASpJ,EAAI,GAAMA,GAAK,IAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAWuF,GAEnB+D,GAAK,GAAI,EAAW9D,GACpB8D,GAAK,GAAI,EAAW7D,GACpB6D,GAAK,GAAI,EAAW5D,GACpB4D,GAAK,GAAI,EAAW3D,GACpB2D,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIF,GAAQ,mDAAmD,EAExE,QAASpJ,EAAI,IAAMA,GAAK,IAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAU+F,GAElBuD,GAAK,GAAI,EAAUtD,GACnBsD,GAAK,GAAI,EAAUrD,GACnBqD,GAAK,GAAI,EAAUpD,GACnBoD,GAAK,GAAI,EAAUnD,GACnBmD,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAUlD,GAEnB,QAASpG,EAAI,IAAMA,GAAK,IAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAQsG,GAEhBgD,GAAK,GAAI,EAAQ/C,GACjB+C,GAAK,GAAI,EAAQ9C,GACjB8C,GAAK,GAAI,EAAQ7C,GACjB6C,GAAK,GAAI,EAAQ5C,GACjB4C,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAQ3C,GAEjB,QAAS3G,EAAI,IAAMA,GAAK,IAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAQ6G,GAEhByC,GAAK,GAAI,EAAQxC,GACjBwC,GAAK,GAAI,EAAQvC,GACjBuC,GAAK,GAAI,EAAQtC,GACjBsC,GAAK,GAAI,EAAQrC,GACjBqC,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GAEb,QAASnJ,EAAI,IAAMA,GAAK,IAAMA,IAC5BsJ,GAAKtJ,CAAC,EAAIoJ,GAAQ,iCAAiC,EAErDE,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAU/B,GACnB+B,GAAK,GAAI,EAAIF,GAAQ,iCAAiC,EACtDE,GAAK,GAAI,EAAU5B,GACnB4B,GAAK,GAAI,EAAU1B,GACnB0B,GAAK,GAAI,EAAUxB,GACnBwB,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAIH,GACbG,GAAK,GAAI,EAAU9B,GAGZ,IAAM+B,GAAQ,CAAC,EAEtB,QAASvJ,EAAI,EAAGA,EAAI,GAAIA,IACtBuJ,GAAMvJ,CAAC,EAAI,IAAI6C,EAAMC,EAAK,KAAM9C,EAAG,CAAC,EAGtC,QAASA,EAAI,GAAIA,GAAK,IAAKA,IACzBuJ,GAAM,GAAKvJ,CAAC,EAAI,IAAI6C,EAAMC,EAAK,OAAQ9C,EAAG,CAAC,EAG7CuJ,GAAM,EAAI,EAAI,IAAI1G,EAAMC,EAAK,MAAO,IAAI,WAAW,CAAC,EAAG,CAAC,EAExDyG,GAAM,EAAI,EAAI,IAAI1G,EAAMC,EAAK,OAAQ,GAAI,CAAC,EAE1CyG,GAAM,GAAI,EAAI,IAAI1G,EAAMC,EAAK,MAAO,EAAG,CAAC,EAExCyG,GAAM,GAAI,EAAI,IAAI1G,EAAMC,EAAK,IAAK,EAAG,CAAC,EAEtCyG,GAAM,GAAI,EAAI,IAAI1G,EAAMC,EAAK,MAAO,GAAO,CAAC,EAE5CyG,GAAM,GAAI,EAAI,IAAI1G,EAAMC,EAAK,KAAM,GAAM,CAAC,EAE1CyG,GAAM,GAAI,EAAI,IAAI1G,EAAMC,EAAK,KAAM,KAAM,CAAC,EC/HnC,SAAS0G,IAAoB,CAClC,IAAMC,EAAW,CAAC,EAClB,OAAAA,EAASC,EAAK,KAAK,KAAK,EAAIC,GAC5BF,EAASC,EAAK,OAAO,KAAK,EAAIE,GAC9BH,EAASC,EAAK,MAAM,KAAK,EAAIG,GAC7BJ,EAASC,EAAK,OAAO,KAAK,EAAII,GAC9BL,EAASC,EAAK,MAAM,KAAK,EAAIK,GAC7BN,EAASC,EAAK,IAAI,KAAK,EAAIM,GAC3BP,EAASC,EAAK,IAAI,KAAK,EAAIO,GAC3BR,EAASC,EAAK,MAAM,KAAK,EAAIQ,GACtBT,CACT,CAEA,IAAMU,GAAeX,GAAiB,EAEhCY,GAAM,IAAIC,GAGVC,GAAN,MAAMC,EAAI,CAKR,YAAaC,EAAKC,EAAQ,CACxB,KAAK,IAAMD,EACX,KAAK,OAASC,CAChB,CAMA,SAAUD,EAAK,CAEb,IAAIE,EAAI,KACR,EACE,IAAIA,EAAE,MAAQF,EACZ,MAAO,SAEFE,EAAIA,EAAE,QACf,MAAO,EACT,CAOA,OAAO,YAAaC,EAAOH,EAAK,CAC9B,GAAIG,GAASA,EAAM,SAASH,CAAG,EAC7B,MAAM,IAAI,MAAM,GAAGI,EAAe,sCAAsC,EAE1E,OAAO,IAAIL,GAAIC,EAAKG,CAAK,CAC3B,CACF,EAEME,GAAe,CACnB,KAAM,IAAIC,EAAMpB,EAAK,KAAM,IAAI,EAC/B,UAAW,IAAIoB,EAAMpB,EAAK,UAAW,MAAS,EAC9C,KAAM,IAAIoB,EAAMpB,EAAK,KAAM,EAAI,EAC/B,MAAO,IAAIoB,EAAMpB,EAAK,MAAO,EAAK,EAClC,WAAY,IAAIoB,EAAMpB,EAAK,MAAO,CAAC,EACnC,SAAU,IAAIoB,EAAMpB,EAAK,IAAK,CAAC,CACjC,EAGMqB,GAAe,CAQnB,OAAQP,EAAKQ,EAAMC,EAAUC,EAAW,CACtC,MAAI,CAAC,OAAO,UAAUV,CAAG,GAAK,CAAC,OAAO,cAAcA,CAAG,EAC9C,IAAIM,EAAMpB,EAAK,MAAOc,CAAG,EACvBA,GAAO,EACT,IAAIM,EAAMpB,EAAK,KAAMc,CAAG,EAExB,IAAIM,EAAMpB,EAAK,OAAQc,CAAG,CAErC,EASA,OAAQA,EAAKQ,EAAMC,EAAUC,EAAW,CACtC,OAAIV,GAAO,OAAO,CAAC,EACV,IAAIM,EAAMpB,EAAK,KAAMc,CAAG,EAExB,IAAIM,EAAMpB,EAAK,OAAQc,CAAG,CAErC,EASA,WAAYA,EAAKQ,EAAMC,EAAUC,EAAW,CAC1C,OAAO,IAAIJ,EAAMpB,EAAK,MAAOc,CAAG,CAClC,EASA,OAAQA,EAAKQ,EAAMC,EAAUC,EAAW,CACtC,OAAO,IAAIJ,EAAMpB,EAAK,OAAQc,CAAG,CACnC,EASA,QAASA,EAAKQ,EAAMC,EAAUC,EAAW,CACvC,OAAOV,EAAMK,GAAa,KAAOA,GAAa,KAChD,EASA,KAAMM,EAAMH,EAAMC,EAAUC,EAAW,CACrC,OAAOL,GAAa,IACtB,EASA,UAAWM,EAAMH,EAAMC,EAAUC,EAAW,CAC1C,OAAOL,GAAa,SACtB,EASA,YAAaL,EAAKQ,EAAMC,EAAUC,EAAW,CAC3C,OAAO,IAAIJ,EAAMpB,EAAK,MAAO,IAAI,WAAWc,CAAG,CAAC,CAClD,EASA,SAAUA,EAAKQ,EAAMC,EAAUC,EAAW,CACxC,OAAO,IAAIJ,EAAMpB,EAAK,MAAO,IAAI,WAAWc,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,CAAC,CACzF,EASA,MAAOA,EAAKQ,EAAMI,EAASC,EAAU,CACnC,GAAI,CAACb,EAAI,OACP,OAAIY,EAAQ,iBAAmB,GACtB,CAACP,GAAa,WAAY,IAAIC,EAAMpB,EAAK,KAAK,CAAC,EAEjDmB,GAAa,WAEtBQ,EAAWf,GAAI,YAAYe,EAAUb,CAAG,EACxC,IAAMc,EAAU,CAAC,EACbC,EAAI,EACR,QAAWC,KAAKhB,EACdc,EAAQC,GAAG,EAAIE,GAAeD,EAAGJ,EAASC,CAAQ,EAEpD,OAAID,EAAQ,eACH,CAAC,IAAIN,EAAMpB,EAAK,MAAOc,EAAI,MAAM,EAAGc,EAAS,IAAIR,EAAMpB,EAAK,KAAK,CAAC,EAEpE,CAAC,IAAIoB,EAAMpB,EAAK,MAAOc,EAAI,MAAM,EAAGc,CAAO,CACpD,EASA,OAAQd,EAAKkB,EAAKN,EAASC,EAAU,CAEnC,IAAMM,EAAQD,IAAQ,SAEhBE,EAAOD,EAAQnB,EAAI,KAAK,EAAI,OAAO,KAAKA,CAAG,EAC3CqB,EAASF,EAAQnB,EAAI,KAAOoB,EAAK,OACvC,GAAI,CAACC,EACH,OAAIT,EAAQ,iBAAmB,GACtB,CAACP,GAAa,SAAU,IAAIC,EAAMpB,EAAK,KAAK,CAAC,EAE/CmB,GAAa,SAEtBQ,EAAWf,GAAI,YAAYe,EAAUb,CAAG,EAExC,IAAMc,EAAU,CAAC,EACbC,EAAI,EACR,QAAWO,KAAOF,EAChBN,EAAQC,GAAG,EAAI,CACbE,GAAeK,EAAKV,EAASC,CAAQ,EACrCI,GAAeE,EAAQnB,EAAI,IAAIsB,CAAG,EAAItB,EAAIsB,CAAG,EAAGV,EAASC,CAAQ,CACnE,EAGF,OADAU,GAAeT,EAASF,CAAO,EAC3BA,EAAQ,eACH,CAAC,IAAIN,EAAMpB,EAAK,IAAKmC,CAAM,EAAGP,EAAS,IAAIR,EAAMpB,EAAK,KAAK,CAAC,EAE9D,CAAC,IAAIoB,EAAMpB,EAAK,IAAKmC,CAAM,EAAGP,CAAO,CAC9C,CACF,EAEAP,GAAa,IAAMA,GAAa,OAChCA,GAAa,OAASA,GAAa,WACnC,QAAWW,IAAO,iFAAiF,MAAM,GAAG,EAC1GX,GAAa,GAAGW,CAAG,OAAO,EAAIX,GAAa,SAS7C,SAASU,GAAgBjB,EAAKY,EAAU,CAAC,EAAGC,EAAU,CACpD,IAAMK,EAAMM,GAAGxB,CAAG,EACZyB,EAAqBb,GAAWA,EAAQ,cAAmDA,EAAQ,aAAaM,CAAG,GAAMX,GAAaW,CAAG,EAC/I,GAAI,OAAOO,GAAsB,WAAY,CAC3C,IAAMC,EAASD,EAAkBzB,EAAKkB,EAAKN,EAASC,CAAQ,EAC5D,GAAIa,GAAU,KACZ,OAAOA,CAEX,CACA,IAAMC,EAAcpB,GAAaW,CAAG,EACpC,GAAI,CAACS,EACH,MAAM,IAAI,MAAM,GAAGvB,EAAe,sBAAsBc,CAAG,EAAE,EAE/D,OAAOS,EAAY3B,EAAKkB,EAAKN,EAASC,CAAQ,CAChD,CAyEA,SAASU,GAAgBT,EAASF,EAAS,CACrCA,EAAQ,WACVE,EAAQ,KAAKF,EAAQ,SAAS,CAElC,CAqCA,SAASgB,GAAiBC,EAAKC,EAAQC,EAAUC,EAAS,CACxD,GAAI,MAAM,QAAQF,CAAM,EACtB,QAAWG,KAASH,EAClBF,GAAgBC,EAAKI,EAAOF,EAAUC,CAAO,OAG/CD,EAASD,EAAO,KAAK,KAAK,EAAED,EAAKC,EAAQE,CAAO,CAEpD,CAQA,SAASE,GAAcC,EAAMJ,EAAUC,EAAS,CAC9C,IAAMF,EAASM,GAAeD,EAAMH,CAAO,EAC3C,GAAI,CAAC,MAAM,QAAQF,CAAM,GAAKE,EAAQ,iBAAkB,CACtD,IAAMK,EAAaL,EAAQ,iBAAiBF,CAAM,EAClD,GAAIO,EACF,OAAOA,EAET,IAAMC,EAAUP,EAASD,EAAO,KAAK,KAAK,EAC1C,GAAIQ,EAAQ,YAAa,CACvB,IAAMC,EAAOD,EAAQ,YAAYR,EAAQE,CAAO,EAC1CH,EAAM,IAAIW,GAAGD,CAAI,EAIvB,GAHAD,EAAQT,EAAKC,EAAQE,CAAO,EAGxBH,EAAI,OAAO,SAAW,EACxB,MAAM,IAAI,MAAM,+CAA+CC,CAAM,YAAY,EAEnF,OAAOW,GAAMZ,EAAI,OAAO,CAAC,CAAC,CAC5B,CACF,CACA,OAAAA,GAAI,MAAM,EACVD,GAAgBC,GAAKC,EAAQC,EAAUC,CAAO,EACvCH,GAAI,QAAQ,EAAI,CACzB,CCzbA,IAAMa,GAAuB,CAC3B,OAAQ,GACR,gBAAiB,GACjB,eAAgB,GAChB,YAAa,EACf,EAKMC,GAAN,KAAgB,CAKd,YAAaC,EAAMC,EAAU,CAAC,EAAG,CAC/B,KAAK,KAAO,EACZ,KAAK,KAAOD,EACZ,KAAK,QAAUC,CACjB,CAEA,KAAO,CACL,OAAO,KAAK,IACd,CAEA,MAAQ,CACN,OAAO,KAAK,MAAQ,KAAK,KAAK,MAChC,CAEA,MAAQ,CACN,IAAMC,EAAM,KAAK,KAAK,KAAK,IAAI,EAC3BC,EAAQC,GAAMF,CAAG,EACrB,GAAIC,IAAU,OAAW,CACvB,IAAME,EAAUC,GAAKJ,CAAG,EAGxB,GAAI,CAACG,EACH,MAAM,IAAI,MAAM,GAAGE,EAAe,8BAA8BL,IAAQ,CAAC,YAAYA,EAAI,SAAS,EAAE,EAAE,SAAS,EAAG,GAAG,CAAC,GAAG,EAE3H,IAAMM,EAAQN,EAAM,GACpBC,EAAQE,EAAQ,KAAK,KAAM,KAAK,KAAMG,EAAO,KAAK,OAAO,CAC3D,CAEA,YAAK,MAAQL,EAAM,cACZA,CACT,CACF,EAEMM,GAAO,OAAO,IAAI,MAAM,EACxBC,GAAQ,OAAO,IAAI,OAAO,EAQhC,SAASC,GAAcR,EAAOS,EAAWX,EAAS,CAChD,IAAMY,EAAM,CAAC,EACb,QAAS,EAAI,EAAG,EAAIV,EAAM,MAAO,IAAK,CACpC,IAAMW,EAAQC,GAAeH,EAAWX,CAAO,EAC/C,GAAIa,IAAUJ,GAAO,CACnB,GAAIP,EAAM,QAAU,IAElB,MAEF,MAAM,IAAI,MAAM,GAAGI,EAAe,yCAAyC,CAC7E,CACA,GAAIO,IAAUL,GACZ,MAAM,IAAI,MAAM,GAAGF,EAAe,4CAA4C,CAAC,cAAcJ,EAAM,KAAK,GAAG,EAE7GU,EAAI,CAAC,EAAIC,CACX,CACA,OAAOD,CACT,CAQA,SAASG,GAAYb,EAAOS,EAAWX,EAAS,CAC9C,IAAMgB,EAAUhB,EAAQ,UAAY,GAC9BiB,EAAMD,EAAU,OAAY,CAAC,EAC7BE,EAAIF,EAAU,IAAI,IAAQ,OAChC,QAASG,EAAI,EAAGA,EAAIjB,EAAM,MAAOiB,IAAK,CACpC,IAAMC,EAAMN,GAAeH,EAAWX,CAAO,EAC7C,GAAIoB,IAAQX,GAAO,CACjB,GAAIP,EAAM,QAAU,IAElB,MAEF,MAAM,IAAI,MAAM,GAAGI,EAAe,uCAAuC,CAC3E,CACA,GAAIc,IAAQZ,GACV,MAAM,IAAI,MAAM,GAAGF,EAAe,0CAA0Ca,CAAC,uBAAuBjB,EAAM,KAAK,GAAG,EAEpH,GAAIc,IAAY,IAAQ,OAAOI,GAAQ,SACrC,MAAM,IAAI,MAAM,GAAGd,EAAe,uCAAuC,OAAOc,CAAG,GAAG,EAExF,GAAIpB,EAAQ,yBAA2B,KAEhCgB,GAAWE,EAAE,IAAIE,CAAG,GAAO,CAACJ,GAAYI,KAAOH,GAClD,MAAM,IAAI,MAAM,GAAGX,EAAe,0BAA0Bc,CAAG,GAAG,EAGtE,IAAMP,EAAQC,GAAeH,EAAWX,CAAO,EAC/C,GAAIa,IAAUL,GACZ,MAAM,IAAI,MAAM,GAAGF,EAAe,0CAA0Ca,CAAC,yBAAyBjB,EAAM,KAAK,GAAG,EAElHc,EAEFE,EAAE,IAAIE,EAAKP,CAAK,EAGhBI,EAAIG,CAAG,EAAIP,CAEf,CAEA,OAAOG,EAAUE,EAAID,CACvB,CAOA,SAASH,GAAgBH,EAAWX,EAAS,CAG3C,GAAIW,EAAU,KAAK,EACjB,OAAOH,GAGT,IAAMN,EAAQS,EAAU,KAAK,EAE7B,GAAIT,EAAM,OAASmB,EAAK,MACtB,OAAOZ,GAGT,GAAIP,EAAM,KAAK,SACb,OAAOA,EAAM,MAGf,GAAIA,EAAM,OAASmB,EAAK,MACtB,OAAOX,GAAaR,EAAOS,EAAWX,CAAO,EAG/C,GAAIE,EAAM,OAASmB,EAAK,IACtB,OAAON,GAAWb,EAAOS,EAAWX,CAAO,EAG7C,GAAIE,EAAM,OAASmB,EAAK,IAAK,CAC3B,GAAIrB,EAAQ,MAAQ,OAAOA,EAAQ,KAAKE,EAAM,KAAK,GAAM,WAAY,CACnE,IAAMoB,EAASR,GAAeH,EAAWX,CAAO,EAChD,OAAOA,EAAQ,KAAKE,EAAM,KAAK,EAAEoB,CAAM,CACzC,CACA,MAAM,IAAI,MAAM,GAAGhB,EAAe,uBAAuBJ,EAAM,KAAK,GAAG,CACzE,CAEA,MAAM,IAAI,MAAM,aAAa,CAC/B,CAOA,SAASqB,GAAaxB,EAAMC,EAAS,CACnC,GAAI,EAAED,aAAgB,YACpB,MAAM,IAAI,MAAM,GAAGO,EAAe,sCAAsC,EAE1EN,EAAU,OAAO,OAAO,CAAC,EAAGH,GAAsBG,CAAO,EACzD,IAAMW,EAAYX,EAAQ,WAAa,IAAIF,GAAUC,EAAMC,CAAO,EAC5DwB,EAAUV,GAAeH,EAAWX,CAAO,EACjD,GAAIwB,IAAYhB,GACd,MAAM,IAAI,MAAM,GAAGF,EAAe,qCAAqC,EAEzE,GAAIkB,IAAYf,GACd,MAAM,IAAI,MAAM,GAAGH,EAAe,uBAAuB,EAE3D,MAAO,CAACkB,EAASzB,EAAK,SAASY,EAAU,IAAI,CAAC,CAAC,CACjD,CAOA,SAASc,GAAQ1B,EAAMC,EAAS,CAC9B,GAAM,CAACwB,EAASE,CAAS,EAAIH,GAAYxB,EAAMC,CAAO,EACtD,GAAI0B,EAAU,OAAS,EACrB,MAAM,IAAI,MAAM,GAAGpB,EAAe,0CAA0C,EAE9E,OAAOkB,CACT,CCnMA,IAAMG,GAAN,cAA0B,KAAM,CAC9B,aAAe,CACb,MAAM,EAEN,KAAK,YAAc,CAAC,CACtB,CAKA,OAAQC,EAAK,CACX,IAAMC,EAAS,KAAK,YAAY,KAAK,YAAY,OAAS,CAAC,EACvDA,IACEA,EAAO,OAASR,EAAK,QACvBQ,EAAO,WACHA,EAAO,WAAa,GACtBD,EAAI,KAAK,CAAC,EAAE,CAAC,GAGbC,EAAO,OAASR,EAAK,MACvBQ,EAAO,WACHA,EAAO,WAAa,IAClBA,EAAO,SAAW,IAAM,EAC1BD,EAAI,KAAK,CAAC,EAAE,CAAC,EAEbA,EAAI,KAAK,CAAC,EAAE,CAAC,IAKvB,CAMA,CAACP,EAAK,KAAK,KAAK,EAAGO,EAAK1B,EAAO,CAC7B,KAAK,OAAO0B,CAAG,EACf,IAAME,EAAK,OAAO5B,EAAM,KAAK,EACvB6B,EAAM,CAAC,EACb,QAAS,EAAI,EAAG,EAAID,EAAG,OAAQ,IAC7BC,EAAI,CAAC,EAAID,EAAG,WAAW,CAAC,EAE1BF,EAAI,KAAKG,CAAG,CACd,CAMA,CAACV,EAAK,OAAO,KAAK,EAAGO,EAAK1B,EAAO,CAE/B,KAAKmB,EAAK,KAAK,KAAK,EAAEO,EAAK1B,CAAK,CAClC,CAMA,CAACmB,EAAK,MAAM,KAAK,EAAGW,EAAMC,EAAQ,CAChC,MAAM,IAAI,MAAM,GAAGC,EAAe,+BAA+B,CACnE,CAMA,CAACb,EAAK,OAAO,KAAK,EAAGO,EAAK1B,EAAO,CAC/B,KAAK,OAAO0B,CAAG,EAIf,IAAMO,EAAOC,GAAW,KAAK,UAAUlC,EAAM,KAAK,CAAC,EACnD0B,EAAI,KAAKO,EAAK,OAAS,GAAKE,GAAMF,CAAI,EAAIA,CAAI,CAChD,CAMA,CAACd,EAAK,MAAM,KAAK,EAAGO,EAAKK,EAAQ,CAC/B,KAAK,OAAOL,CAAG,EACf,KAAK,YAAY,KAAK,CAAE,KAAMP,EAAK,MAAO,SAAU,CAAE,CAAC,EACvDO,EAAI,KAAK,CAAC,EAAE,CAAC,CACf,CAMA,CAACP,EAAK,IAAI,KAAK,EAAGO,EAAKK,EAAQ,CAC7B,KAAK,OAAOL,CAAG,EACf,KAAK,YAAY,KAAK,CAAE,KAAMP,EAAK,IAAK,SAAU,CAAE,CAAC,EACrDO,EAAI,KAAK,CAAC,GAAG,CAAC,CAChB,CAMA,CAACP,EAAK,IAAI,KAAK,EAAGW,EAAMC,EAAQ,CAAC,CAMjC,CAACZ,EAAK,MAAM,KAAK,EAAGO,EAAK1B,EAAO,CAC9B,GAAIA,EAAM,KAAK,OAAS,QAAS,CAC/B,IAAM2B,EAAS,KAAK,YAAY,IAAI,EACpC,GAAIA,EAAQ,CACV,GAAIA,EAAO,OAASR,EAAK,MACvBO,EAAI,KAAK,CAAC,EAAE,CAAC,UACJC,EAAO,OAASR,EAAK,IAC9BO,EAAI,KAAK,CAAC,GAAG,CAAC,MAGd,OAAM,IAAI,MAAM,oDAAoD,EAEtE,MACF,CAEA,MAAM,IAAI,MAAM,2CAA2C,CAC7D,CACA,GAAI1B,EAAM,QAAU,OAClB,MAAM,IAAI,MAAM,GAAGgC,EAAe,8BAA8B,EAIlE,GADA,KAAK,OAAON,CAAG,EACX1B,EAAM,KAAK,OAAS,OAAQ,CAC9B0B,EAAI,KAAK,CAAC,IAAK,IAAK,IAAK,GAAG,CAAC,EAC7B,MACF,SAAW1B,EAAM,KAAK,OAAS,QAAS,CACtC0B,EAAI,KAAK,CAAC,IAAK,GAAI,IAAK,IAAK,GAAG,CAAC,EACjC,MACF,SAAW1B,EAAM,KAAK,OAAS,OAAQ,CACrC0B,EAAI,KAAK,CAAC,IAAK,IAAK,IAAK,GAAG,CAAC,EAC7B,MACF,CAGA,IAAME,EAAK,OAAO5B,EAAM,KAAK,EACvB6B,EAAM,CAAC,EACTO,EAAK,GACT,QAASnB,EAAI,EAAGA,EAAIW,EAAG,OAAQX,IAC7BY,EAAIZ,CAAC,EAAIW,EAAG,WAAWX,CAAC,EACpB,CAACmB,IAAOP,EAAIZ,CAAC,IAAM,IAAMY,EAAIZ,CAAC,IAAM,KAAOY,EAAIZ,CAAC,IAAM,MACxDmB,EAAK,IAGJA,IACHP,EAAI,KAAK,EAAE,EACXA,EAAI,KAAK,EAAE,GAEbH,EAAI,KAAKG,CAAG,CACd,CACF,EAiHA,SAASQ,GAAWC,EAAIC,EAAI,CAC1B,GAAI,MAAM,QAAQD,EAAG,CAAC,CAAC,GAAK,MAAM,QAAQC,EAAG,CAAC,CAAC,EAC7C,MAAM,IAAI,MAAM,GAAGP,EAAe,qCAAqC,EAEzE,IAAMQ,EAAYF,EAAG,CAAC,EAChBG,EAAYF,EAAG,CAAC,EACtB,GAAIC,EAAU,OAASrB,EAAK,QAAUsB,EAAU,OAAStB,EAAK,OAC5D,MAAM,IAAI,MAAM,GAAGa,EAAe,wCAAwC,EAE5E,GAAIQ,EAAYC,EACd,MAAO,GAET,GAAID,EAAYC,EACd,MAAO,GAGT,MAAM,IAAI,MAAM,GAAGT,EAAe,uDAAuD,CAC3F,CAEA,IAAMU,GAAuB,CAAE,eAAgB,GAAM,UAAAL,EAAU,EAO/D,SAASM,GAAQ9C,EAAMC,EAAS,CAC9B,OAAAA,EAAU,OAAO,OAAO,CAAC,EAAG4C,GAAsB5C,CAAO,EAClD8C,GAAa/C,EAAM,IAAI4B,GAAe3B,CAAO,CACtD,CCvSA,IAAM+C,GAAN,KAAgB,CAKd,YAAahD,EAAMC,EAAU,CAAC,EAAG,CAC/B,KAAK,KAAO,EACZ,KAAK,KAAOD,EACZ,KAAK,QAAUC,EAEf,KAAK,UAAY,CAAC,OAAO,EACzB,KAAK,UAAY,EACnB,CAEA,KAAO,CACL,OAAO,KAAK,IACd,CAKA,MAAQ,CACN,OAAO,KAAK,MAAQ,KAAK,KAAK,MAChC,CAKA,IAAM,CACJ,OAAO,KAAK,KAAK,KAAK,IAAI,CAC5B,CAKA,aAAe,CACb,OAAO,KAAK,UAAU,KAAK,UAAU,OAAS,CAAC,CACjD,CAEA,gBAAkB,CAChB,IAAIgD,EAAI,KAAK,GAAG,EAEhB,KAAOA,IAAM,IAAgBA,IAAM,GAAgBA,IAAM,IAAiBA,IAAM,IAC9EA,EAAI,KAAK,KAAK,EAAE,KAAK,IAAI,CAE7B,CAKA,OAAQC,EAAK,CACX,GAAI,KAAK,KAAK,OAAS,KAAK,KAAOA,EAAI,OACrC,MAAM,IAAI,MAAM,GAAG3C,EAAe,wCAAwC,KAAK,IAAI,EAAE,EAEvF,QAASa,EAAI,EAAGA,EAAI8B,EAAI,OAAQ9B,IAC9B,GAAI,KAAK,KAAK,KAAK,MAAM,IAAM8B,EAAI9B,CAAC,EAClC,MAAM,IAAI,MAAM,GAAGb,EAAe,iCAAiC,KAAK,IAAI,uBAAuB,OAAO,aAAa,GAAG2C,CAAG,CAAC,GAAG,CAGvI,CAEA,aAAe,CACb,IAAMC,EAAW,KAAK,KAClBC,EAAW,GACXC,EAAQ,GAKNC,EAAWC,GAAU,CACzB,KAAO,CAAC,KAAK,KAAK,GAAG,CACnB,IAAMC,EAAK,KAAK,GAAG,EACnB,GAAID,EAAM,SAASC,CAAE,EACnB,KAAK,WAEL,MAEJ,CACF,EAOA,GAJI,KAAK,GAAG,IAAM,KAChBJ,EAAW,GACX,KAAK,QAEH,KAAK,GAAG,IAAM,GAEhB,GADA,KAAK,OACD,KAAK,GAAG,IAAM,GAChB,KAAK,OACLC,EAAQ,OAER,QAAO,IAAII,EAAMnC,EAAK,KAAM,EAAG,KAAK,KAAO6B,CAAQ,EAIvD,GADAG,EAAQ,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,CAAC,EAC5CF,GAAY,KAAK,OAASD,EAAW,EACvC,MAAM,IAAI,MAAM,GAAG5C,EAAe,iCAAiC,KAAK,IAAI,EAAE,EAEhF,GAAI,CAAC,KAAK,KAAK,GAAK,KAAK,GAAG,IAAM,GAAI,CACpC,GAAI8C,EACF,MAAM,IAAI,MAAM,GAAG9C,EAAe,iCAAiC,KAAK,IAAI,EAAE,EAEhF8C,EAAQ,GACR,KAAK,OACLC,EAAQ,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,CAAC,CAClD,CACI,CAAC,KAAK,KAAK,IAAM,KAAK,GAAG,IAAM,KAAO,KAAK,GAAG,IAAM,MACtDD,EAAQ,GACR,KAAK,OACD,CAAC,KAAK,KAAK,IAAM,KAAK,GAAG,IAAM,IAAM,KAAK,GAAG,IAAM,KACrD,KAAK,OAEPC,EAAQ,CAAC,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,CAAC,GAGlD,IAAMI,EAAS,OAAO,aAAa,MAAM,KAAM,KAAK,KAAK,SAASP,EAAU,KAAK,IAAI,CAAC,EAChFQ,EAAM,WAAWD,CAAM,EAC7B,OAAIL,EACK,IAAII,EAAMnC,EAAK,MAAOqC,EAAK,KAAK,KAAOR,CAAQ,EAEpD,KAAK,QAAQ,cAAgB,IAAQ,OAAO,cAAcQ,CAAG,EACxD,IAAIF,EAAME,GAAO,EAAIrC,EAAK,KAAOA,EAAK,OAAQqC,EAAK,KAAK,KAAOR,CAAQ,EAEzE,IAAIM,EAAME,GAAO,EAAIrC,EAAK,KAAOA,EAAK,OAAQ,OAAOoC,CAAM,EAAG,KAAK,KAAOP,CAAQ,CAC3F,CAKA,aAAe,CAEb,GAAI,KAAK,GAAG,IAAM,GAEhB,MAAM,IAAI,MAAM,GAAG5C,EAAe,qCAAqC,KAAK,IAAI,yBAAyB,EAE3G,KAAK,OAIL,QAAS,EAAI,KAAK,KAAMqD,EAAI,EAAG,EAAI,KAAK,KAAK,QAAUA,EAAI,MAAS,IAAKA,IAAK,CAC5E,IAAMJ,EAAK,KAAK,KAAK,CAAC,EACtB,GAAIA,IAAO,IAAMA,EAAK,IAAMA,GAAM,IAChC,MAEF,GAAIA,IAAO,GAAI,CAEb,IAAMN,EAAM,OAAO,aAAa,MAAM,KAAM,KAAK,KAAK,SAAS,KAAK,KAAM,CAAC,CAAC,EAC5E,YAAK,KAAO,EAAI,EACT,IAAIO,EAAMnC,EAAK,OAAQ4B,EAAKU,CAAC,CACtC,CACF,CAEA,IAAMT,EAAW,KAAK,KAChBI,EAAQ,CAAC,EAETM,EAAS,IAAM,CACnB,GAAI,KAAK,KAAO,GAAK,KAAK,KAAK,OAC7B,MAAM,IAAI,MAAM,GAAGtD,EAAe,0DAA0D,KAAK,IAAI,EAAE,EAEzG,IAAIuD,EAAK,EACT,QAAS1C,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAIoC,EAAK,KAAK,GAAG,EACjB,GAAIA,GAAM,IAAMA,GAAM,GACpBA,GAAM,WACGA,GAAM,IAAMA,GAAM,IAC3BA,EAAKA,EAAK,GAAK,WACNA,GAAM,IAAMA,GAAM,GAC3BA,EAAKA,EAAK,GAAK,OAEf,OAAM,IAAI,MAAM,GAAGjD,EAAe,oDAAoD,KAAK,IAAI,EAAE,EAEnGuD,EAAKA,EAAK,GAAKN,EACf,KAAK,MACP,CACA,OAAOM,CACT,EAGMC,EAAe,IAAM,CACzB,IAAMC,EAAY,KAAK,GAAG,EACtBC,EAAY,KAEZC,EAAoBF,EAAY,IAAQ,EAAKA,EAAY,IAAQ,EAAKA,EAAY,IAAQ,EAAI,EAElG,GAAI,KAAK,KAAOE,EAAmB,KAAK,KAAK,OAC3C,MAAM,IAAI,MAAM,GAAG3D,EAAe,4CAA4C,KAAK,IAAI,EAAE,EAG3F,IAAI4D,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,EAAkB,CAGxB,IAAK,GACCF,EAAY,MACdC,EAAYD,GAEd,MACF,IAAK,GACHG,EAAa,KAAK,KAAK,KAAK,KAAO,CAAC,GAC/BA,EAAa,OAAU,MAC1BG,GAAiBN,EAAY,KAAS,EAAOG,EAAa,GACtDG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,IAAK,GACHH,EAAa,KAAK,KAAK,KAAK,KAAO,CAAC,EACpCC,EAAY,KAAK,KAAK,KAAK,KAAO,CAAC,GAC9BD,EAAa,OAAU,MAASC,EAAY,OAAU,MACzDE,GAAiBN,EAAY,KAAQ,IAAOG,EAAa,KAAS,EAAOC,EAAY,GAEjFE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,IAAK,GACHH,EAAa,KAAK,KAAK,KAAK,KAAO,CAAC,EACpCC,EAAY,KAAK,KAAK,KAAK,KAAO,CAAC,EACnCC,EAAa,KAAK,KAAK,KAAK,KAAO,CAAC,GAC/BF,EAAa,OAAU,MAASC,EAAY,OAAU,MAASC,EAAa,OAAU,MACzFC,GAAiBN,EAAY,KAAQ,IAAQG,EAAa,KAAS,IAAOC,EAAY,KAAS,EAAOC,EAAa,GAC/GC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,GAGpB,CAGIL,IAAc,MAGhBA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbV,EAAM,KAAKU,IAAc,GAAK,KAAQ,KAAM,EAC5CA,EAAY,MAASA,EAAY,MAGnCV,EAAM,KAAKU,CAAS,EACpB,KAAK,MAAQC,CACf,EAIA,KAAO,CAAC,KAAK,KAAK,GAAG,CACnB,IAAMV,EAAK,KAAK,GAAG,EACfe,EACJ,OAAQf,EAAI,CACV,IAAK,IAEH,GADA,KAAK,OACD,KAAK,KAAK,EACZ,MAAM,IAAI,MAAM,GAAGjD,EAAe,8CAA8C,KAAK,IAAI,EAAE,EAI7F,OAFAgE,EAAM,KAAK,GAAG,EACd,KAAK,OACGA,EAAK,CACX,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACHhB,EAAM,KAAKgB,CAAG,EACd,MACF,IAAK,IACHhB,EAAM,KAAK,CAAC,EACZ,MACF,IAAK,KACHA,EAAM,KAAK,CAAC,EACZ,MACF,IAAK,KACHA,EAAM,KAAK,EAAE,EACb,MACF,IAAK,KACHA,EAAM,KAAK,EAAE,EACb,MACF,IAAK,KACHA,EAAM,KAAK,EAAE,EACb,MACF,IAAK,KACHA,EAAM,KAAKM,EAAO,CAAC,EACnB,MACF,QACE,MAAM,IAAI,MAAM,GAAGtD,EAAe,mDAAmD,KAAK,IAAI,EAAE,CACpG,CACA,MACF,IAAK,IACH,YAAK,OACE,IAAIkD,EAAMnC,EAAK,OAAQkD,GAAsBjB,CAAK,EAAG,KAAK,KAAOJ,CAAQ,EAClF,QACE,GAAIK,EAAK,GACP,MAAM,IAAI,MAAM,GAAGjD,EAAe,0CAA0C,KAAK,IAAI,EAAE,EAC9EiD,EAAK,KACdD,EAAM,KAAKC,CAAE,EACb,KAAK,QAELO,EAAa,CAEnB,CACF,CAEA,MAAM,IAAI,MAAM,GAAGxD,EAAe,yCAAyC,KAAK,IAAI,EAAE,CACxF,CAKA,YAAc,CACZ,OAAQ,KAAK,GAAG,EAAG,CACjB,IAAK,KACH,YAAK,UAAU,KAAK,WAAW,EAC/B,KAAK,OACE,IAAIkD,EAAMnC,EAAK,IAAK,IAAU,CAAC,EACxC,IAAK,IACH,YAAK,UAAU,KAAK,aAAa,EACjC,KAAK,OACE,IAAImC,EAAMnC,EAAK,MAAO,IAAU,CAAC,EAC1C,IAAK,IACH,OAAO,KAAK,YAAY,EAE1B,IAAK,KACH,YAAK,OAAO,CAAC,IAAK,IAAK,IAAK,GAAG,CAAC,EACzB,IAAImC,EAAMnC,EAAK,KAAM,KAAM,CAAC,EACrC,IAAK,KACH,YAAK,OAAO,CAAC,IAAK,GAAI,IAAK,IAAK,GAAG,CAAC,EAC7B,IAAImC,EAAMnC,EAAK,MAAO,GAAO,CAAC,EACvC,IAAK,KACH,YAAK,OAAO,CAAC,IAAK,IAAK,IAAK,GAAG,CAAC,EACzB,IAAImC,EAAMnC,EAAK,KAAM,GAAM,CAAC,EACrC,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACH,OAAO,KAAK,YAAY,EAC1B,QACE,MAAM,IAAI,MAAM,GAAGf,EAAe,qCAAqC,KAAK,IAAI,EAAE,CACtF,CACF,CAKA,MAAQ,CAEN,OADA,KAAK,eAAe,EACZ,KAAK,YAAY,EAAG,CAC1B,IAAK,QACH,YAAK,UAAU,IAAI,EACZ,KAAK,WAAW,EACzB,IAAK,cAAe,CAElB,GADA,KAAK,UAAU,IAAI,EACf,KAAK,GAAG,IAAM,GAChB,YAAK,OACL,KAAK,eAAe,EACb,IAAIkD,EAAMnC,EAAK,MAAO,OAAW,CAAC,EAE3C,GAAI,KAAK,GAAG,IAAM,GAChB,MAAM,IAAI,MAAM,GAAGf,EAAe,qCAAqC,KAAK,IAAI,8CAA8C,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,GAAG,EAEjK,YAAK,OACL,KAAK,UAAU,KAAK,aAAa,EACjC,KAAK,eAAe,EACb,KAAK,WAAW,CACzB,CACA,IAAK,cAEH,OADA,KAAK,UAAU,IAAI,EACf,KAAK,GAAG,IAAM,IAChB,KAAK,OACL,KAAK,eAAe,EACb,IAAIkD,EAAMnC,EAAK,MAAO,OAAW,CAAC,IAE3C,KAAK,UAAU,KAAK,aAAa,EACjC,KAAK,eAAe,EACb,KAAK,WAAW,GAGzB,IAAK,UACH,GAAI,KAAK,GAAG,IAAM,IAChB,YAAK,UAAU,IAAI,EACnB,KAAK,OACL,KAAK,eAAe,EACb,IAAImC,EAAMnC,EAAK,MAAO,OAAW,CAAC,EAE3C,GAAI,KAAK,GAAG,IAAM,GAChB,MAAM,IAAI,MAAM,GAAGf,EAAe,qCAAqC,KAAK,IAAI,+CAA+C,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,GAAG,EAElK,KAAK,OACL,KAAK,eAAe,EACtB,IAAK,YAAa,CAEhB,GADA,KAAK,UAAU,IAAI,EACf,KAAK,GAAG,IAAM,IAChB,YAAK,OACL,KAAK,eAAe,EACb,IAAIkD,EAAMnC,EAAK,MAAO,OAAW,CAAC,EAE3C,IAAMnB,EAAQ,KAAK,YAAY,EAE/B,GADA,KAAK,eAAe,EAChB,KAAK,GAAG,IAAM,GAChB,MAAM,IAAI,MAAM,GAAGI,EAAe,qCAAqC,KAAK,IAAI,sDAAsD,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,GAAG,EAEzK,YAAK,OACL,KAAK,UAAU,KAAK,WAAW,EACxBJ,CACT,CACA,IAAK,YACH,YAAK,UAAU,IAAI,EACnB,KAAK,UAAU,KAAK,SAAS,EAC7B,KAAK,eAAe,EACb,KAAK,WAAW,EAGzB,QACE,MAAM,IAAI,MAAM,GAAGI,EAAe,uCAAuC,KAAK,IAAI,yBAAyB,CAC/G,CACF,CACF,EAOA,SAASmB,GAAQ1B,EAAMC,EAAS,CAC9B,OAAAA,EAAU,OAAO,OAAO,CAAE,UAAW,IAAI+C,GAAUhD,EAAMC,CAAO,CAAE,EAAGA,CAAO,EACrEyB,GAAQ1B,EAAMC,CAAO,CAC9B,CC/bO,IAAMwE,GAAQ,IAAI,WAAW,CAAC,EAW/B,SAAUC,GAAQC,EAAgBC,EAAc,CACpD,GAAID,IAAOC,EAAI,MAAO,GACtB,GAAID,EAAG,aAAeC,EAAG,WACvB,MAAO,GAGT,QAASC,EAAK,EAAGA,EAAKF,EAAG,WAAYE,IACnC,GAAIF,EAAGE,CAAE,IAAMD,EAAGC,CAAE,EAClB,MAAO,GAIX,MAAO,EACT,CAEM,SAAUC,GAAQC,EAA6C,CACnE,GAAIA,aAAa,YAAcA,EAAE,YAAY,OAAS,aAAc,OAAOA,EAC3E,GAAIA,aAAa,YAAa,OAAO,IAAI,WAAWA,CAAC,EACrD,GAAI,YAAY,OAAOA,CAAC,EACtB,OAAO,IAAI,WAAWA,EAAE,OAAQA,EAAE,WAAYA,EAAE,UAAU,EAE5D,MAAM,IAAI,MAAM,mCAAmC,CACrD,CCvBA,SAASC,GAAMC,EAAUC,EAAI,CAC3B,GAAID,EAAS,QAAU,IAAO,MAAM,IAAI,UAAU,mBAAmB,EAErE,QADIE,EAAW,IAAI,WAAW,GAAG,EACxBC,EAAI,EAAGA,EAAID,EAAS,OAAQC,IACnCD,EAASC,CAAC,EAAI,IAEhB,QAAS,EAAI,EAAG,EAAIH,EAAS,OAAQ,IAAK,CACxC,IAAII,EAAIJ,EAAS,OAAO,CAAC,EACrBK,EAAKD,EAAE,WAAW,CAAC,EACvB,GAAIF,EAASG,CAAE,IAAM,IAAO,MAAM,IAAI,UAAUD,EAAI,eAAe,EACnEF,EAASG,CAAE,EAAI,CACjB,CACA,IAAIC,EAAON,EAAS,OAChBO,EAASP,EAAS,OAAO,CAAC,EAC1BQ,EAAS,KAAK,IAAIF,CAAI,EAAI,KAAK,IAAI,GAAG,EACtCG,EAAU,KAAK,IAAI,GAAG,EAAI,KAAK,IAAIH,CAAI,EAI3C,SAASzC,EAAQ6C,EAAM,CAOrB,GALIA,aAAkB,aAAuB,YAAY,OAAOA,CAAM,EACpEA,EAAS,IAAI,WAAWA,EAAO,OAAQA,EAAO,WAAYA,EAAO,UAAU,EAClE,MAAM,QAAQA,CAAM,IAC7BA,EAAS,WAAW,KAAKA,CAAM,IAE7B,EAAEA,aAAkB,YAAe,MAAM,IAAI,UAAU,qBAAqB,EAChF,GAAIA,EAAO,SAAW,EAAK,MAAO,GAMlC,QAJIC,EAAS,EACTC,EAAS,EACTC,EAAS,EACTC,EAAOJ,EAAO,OACXG,IAAWC,GAAQJ,EAAOG,CAAM,IAAM,GAC3CA,IACAF,IAMF,QAHII,GAASD,EAAOD,GAAUJ,EAAU,IAAO,EAC3CO,EAAM,IAAI,WAAWD,CAAI,EAEtBF,IAAWC,GAAM,CAItB,QAHIG,EAAQP,EAAOG,CAAM,EAErB1E,EAAI,EACC+E,EAAMH,EAAO,GAAIE,IAAU,GAAK9E,EAAIyE,IAAYM,IAAQ,GAAKA,IAAO/E,IAC3E8E,GAAU,IAAMD,EAAIE,CAAG,IAAO,EAC9BF,EAAIE,CAAG,EAAKD,EAAQX,IAAU,EAC9BW,EAASA,EAAQX,IAAU,EAE7B,GAAIW,IAAU,EAAK,MAAM,IAAI,MAAM,gBAAgB,EACnDL,EAASzE,EACT0E,GACF,CAGA,QADIM,GAAMJ,EAAOH,EACVO,KAAQJ,GAAQC,EAAIG,EAAG,IAAM,GAClCA,KAIF,QADIlD,EAAMsC,EAAO,OAAOI,CAAM,EACvBQ,GAAMJ,EAAM,EAAEI,GAAOlD,GAAO+B,EAAS,OAAOgB,EAAIG,EAAG,CAAC,EAC3D,OAAOlD,CACT,CAIA,SAASmD,EAAcV,EAAM,CAC3B,GAAI,OAAOA,GAAW,SAAY,MAAM,IAAI,UAAU,iBAAiB,EACvE,GAAIA,EAAO,SAAW,EAAK,OAAO,IAAI,WACtC,IAAIW,EAAM,EAEV,GAAIX,EAAOW,CAAG,IAAM,IAIpB,SAFIV,EAAS,EACTC,EAAS,EACNF,EAAOW,CAAG,IAAMd,GACrBI,IACAU,IAMF,QAHIN,GAAUL,EAAO,OAASW,GAAOb,EAAU,IAAO,EAClDc,EAAO,IAAI,WAAWP,CAAI,EAEvBL,EAAOW,CAAG,GAAG,CAElB,IAAIJ,EAAQf,EAASQ,EAAO,WAAWW,CAAG,CAAC,EAE3C,GAAIJ,IAAU,IAAO,OAErB,QADI9E,EAAI,EACCoF,EAAMR,EAAO,GAAIE,IAAU,GAAK9E,EAAIyE,IAAYW,IAAQ,GAAKA,IAAOpF,IAC3E8E,GAAUX,EAAOgB,EAAKC,CAAG,IAAO,EAChCD,EAAKC,CAAG,EAAKN,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAIA,IAAU,EAAK,MAAM,IAAI,MAAM,gBAAgB,EACnDL,EAASzE,EACTkF,GACF,CAEA,GAAIX,EAAOW,CAAG,IAAM,IAGpB,SADIG,EAAMT,EAAOH,EACVY,IAAQT,GAAQO,EAAKE,CAAG,IAAM,GACnCA,IAIF,QAFIC,GAAM,IAAI,WAAWd,GAAUI,EAAOS,EAAI,EAC1CrB,EAAIQ,EACDa,IAAQT,GACbU,GAAItB,GAAG,EAAImB,EAAKE,GAAK,EAEvB,OAAOC,IACT,CAIA,SAAShF,EAAQiF,EAAM,CACrB,IAAIC,EAASP,EAAaM,CAAM,EAChC,GAAIC,EAAU,OAAOA,EACrB,MAAM,IAAI,MAAM,OAAO1B,CAAI,YAAY,CACzC,CACA,MAAO,CACL,OAAQpC,EACR,aAAAuD,EACA,OAAQ3E,EAEZ,CACA,IAAImF,GAAM7B,GAEN8B,GAAkCD,GAEtCE,GAAeD,GCjITE,GAAN,KAAa,CACF,KACA,OACA,WAET,YAAa9B,EAAY+B,EAAgBC,EAAoB,CAC3D,KAAK,KAAOhC,EACZ,KAAK,OAAS+B,EACd,KAAK,WAAaC,CACpB,CAEA,OAAQC,EAAiB,CACvB,GAAIA,aAAiB,WACnB,MAAO,GAAG,KAAK,MAAM,GAAG,KAAK,WAAWA,CAAK,CAAC,GAE9C,MAAM,MAAM,mCAAmC,CAEnD,GAQIC,GAAN,KAAa,CACF,KACA,OACA,WACQ,gBAEjB,YAAalC,EAAY+B,EAAgBI,EAAoB,CAI3D,GAHA,KAAK,KAAOnC,EACZ,KAAK,OAAS+B,EAEVA,EAAO,YAAY,CAAC,IAAM,OAC5B,MAAM,IAAI,MAAM,0BAA0B,EAE5C,KAAK,gBAAkBA,EAAO,YAAY,CAAC,EAC3C,KAAK,WAAaI,CACpB,CAEA,OAAQC,EAAY,CAClB,GAAI,OAAOA,GAAS,SAAU,CAC5B,GAAIA,EAAK,YAAY,CAAC,IAAM,KAAK,gBAC/B,MAAM,MAAM,qCAAqC,KAAK,UAAUA,CAAI,CAAC,KAAK,KAAK,IAAI,+CAA+C,KAAK,MAAM,EAAE,EAEjJ,OAAO,KAAK,WAAWA,EAAK,MAAM,KAAK,OAAO,MAAM,CAAC,CACvD,KACE,OAAM,MAAM,mCAAmC,CAEnD,CAEA,GAAgCjH,EAAmE,CACjG,OAAOkH,GAAG,KAAMlH,CAAO,CACzB,GAKImH,GAAN,KAAqB,CACV,SAET,YAAaC,EAA0B,CACrC,KAAK,SAAWA,CAClB,CAEA,GAAiCpH,EAAmE,CAClG,OAAOkH,GAAG,KAAMlH,CAAO,CACzB,CAEA,OAAQqH,EAAa,CACnB,IAAMT,EAASS,EAAM,CAAC,EAChBrH,EAAU,KAAK,SAAS4G,CAAM,EACpC,GAAI5G,GAAW,KACb,OAAOA,EAAQ,OAAOqH,CAAK,EAE3B,MAAM,WAAW,qCAAqC,KAAK,UAAUA,CAAK,CAAC,+BAA+B,OAAO,KAAK,KAAK,QAAQ,CAAC,gBAAgB,CAExJ,GAGI,SAAUH,GAAyCI,EAA+CC,EAA8C,CAEpJ,OAAO,IAAIJ,GAAgB,CACzB,GAAIG,EAAK,UAAY,CAAE,CAAEA,EAA2B,MAAM,EAAGA,CAAI,EACjE,GAAIC,EAAM,UAAY,CAAE,CAAEA,EAA4B,MAAM,EAAGA,CAAK,EAClD,CACtB,CAEM,IAAOC,GAAP,KAAY,CACP,KACA,OACA,WACA,WACA,QACA,QAET,YAAa3C,EAAY+B,EAAgBC,EAAsBG,EAAoB,CACjF,KAAK,KAAOnC,EACZ,KAAK,OAAS+B,EACd,KAAK,WAAaC,EAClB,KAAK,WAAaG,EAClB,KAAK,QAAU,IAAIL,GAAQ9B,EAAM+B,EAAQC,CAAU,EACnD,KAAK,QAAU,IAAIE,GAAQlC,EAAM+B,EAAQI,CAAU,CACrD,CAEA,OAAQK,EAAiB,CACvB,OAAO,KAAK,QAAQ,OAAOA,CAAK,CAClC,CAEA,OAAQA,EAAa,CACnB,OAAO,KAAK,QAAQ,OAAOA,CAAK,CAClC,GAGI,SAAUI,GAAmD,CAAE,KAAA5C,EAAM,OAAA+B,EAAQ,OAAAnE,EAAQ,OAAApB,CAAM,EAAsE,CACrK,OAAO,IAAImG,GAAM3C,EAAM+B,EAAQnE,EAAQpB,CAAM,CAC/C,CAEM,SAAUqG,GAAoD,CAAE,KAAA7C,EAAM,OAAA+B,EAAQ,SAAAe,CAAQ,EAAoD,CAC9I,GAAM,CAAE,OAAAlF,EAAQ,OAAApB,CAAM,EAAKqF,GAAMiB,EAAU9C,CAAI,EAC/C,OAAO4C,GAAK,CACV,OAAAb,EACA,KAAA/B,EACA,OAAApC,EACA,OAASwE,GAA6BxC,GAAOpD,EAAO4F,CAAI,CAAC,EAC1D,CACH,CAEA,SAAS5F,GAAQiF,EAAgBqB,EAAkBC,EAAqB/C,EAAY,CAElF,IAAMgD,EAAgC,CAAA,EACtC,QAAS9G,EAAI,EAAGA,EAAI4G,EAAS,OAAQ,EAAE5G,EACrC8G,EAAMF,EAAS5G,CAAC,CAAC,EAAIA,EAIvB,IAAI+G,EAAMxB,EAAO,OACjB,KAAOA,EAAOwB,EAAM,CAAC,IAAM,KACzB,EAAEA,EAIJ,IAAMC,EAAM,IAAI,WAAYD,EAAMF,EAAc,EAAK,CAAC,EAGlDI,EAAO,EACPzB,EAAS,EACT0B,EAAU,EACd,QAASlH,EAAI,EAAGA,EAAI+G,EAAK,EAAE/G,EAAG,CAE5B,IAAMN,EAAQoH,EAAMvB,EAAOvF,CAAC,CAAC,EAC7B,GAAIN,IAAU,OACZ,MAAM,IAAI,YAAY,OAAOoE,CAAI,YAAY,EAI/C0B,EAAUA,GAAUqB,EAAenH,EACnCuH,GAAQJ,EAGJI,GAAQ,IACVA,GAAQ,EACRD,EAAIE,GAAS,EAAI,IAAQ1B,GAAUyB,EAEvC,CAGA,GAAIA,GAAQJ,GAAgB,IAAQrB,GAAW,EAAIyB,EACjD,MAAM,IAAI,YAAY,wBAAwB,EAGhD,OAAOD,CACT,CAEA,SAAStF,GAAQ9C,EAAkBgI,EAAkBC,EAAmB,CACtE,IAAMM,EAAMP,EAASA,EAAS,OAAS,CAAC,IAAM,IACxCQ,GAAQ,GAAKP,GAAe,EAC9BG,EAAM,GAENC,EAAO,EACPzB,EAAS,EACb,QAASxF,EAAI,EAAGA,EAAIpB,EAAK,OAAQ,EAAEoB,EAMjC,IAJAwF,EAAUA,GAAU,EAAK5G,EAAKoB,CAAC,EAC/BiH,GAAQ,EAGDA,EAAOJ,GACZI,GAAQJ,EACRG,GAAOJ,EAASQ,EAAQ5B,GAAUyB,CAAK,EAU3C,GALIA,IAAS,IACXD,GAAOJ,EAASQ,EAAQ5B,GAAWqB,EAAcI,CAAM,GAIrDE,EACF,KAASH,EAAI,OAASH,EAAe,GACnCG,GAAO,IAIX,OAAOA,CACT,CAKM,SAAUK,GAAsD,CAAE,KAAAvD,EAAM,OAAA+B,EAAQ,YAAAgB,EAAa,SAAAD,CAAQ,EAAyE,CAClL,OAAOF,GAAK,CACV,OAAAb,EACA,KAAA/B,EACA,OAAQwC,EAAiB,CACvB,OAAO5E,GAAO4E,EAAOM,EAAUC,CAAW,CAC5C,EACA,OAAQP,EAAa,CACnB,OAAOhG,GAAOgG,EAAOM,EAAUC,EAAa/C,CAAI,CAClD,EACD,CACH,CC1OO,IAAMwD,GAASD,GAAQ,CAC5B,OAAQ,IACR,KAAM,SACN,SAAU,mCACV,YAAa,EACd,EAEYE,GAAcF,GAAQ,CACjC,OAAQ,IACR,KAAM,cACN,SAAU,mCACV,YAAa,EACd,EAEYG,GAAYH,GAAQ,CAC/B,OAAQ,IACR,KAAM,YACN,SAAU,oCACV,YAAa,EACd,EAEYI,GAAiBJ,GAAQ,CACpC,OAAQ,IACR,KAAM,iBACN,SAAU,oCACV,YAAa,EACd,EAEYK,GAAYL,GAAQ,CAC/B,OAAQ,IACR,KAAM,YACN,SAAU,mCACV,YAAa,EACd,EAEYM,GAAiBN,GAAQ,CACpC,OAAQ,IACR,KAAM,iBACN,SAAU,mCACV,YAAa,EACd,EAEYO,GAAeP,GAAQ,CAClC,OAAQ,IACR,KAAM,eACN,SAAU,oCACV,YAAa,EACd,EAEYQ,GAAoBR,GAAQ,CACvC,OAAQ,IACR,KAAM,oBACN,SAAU,oCACV,YAAa,EACd,EAEYS,GAAUT,GAAQ,CAC7B,OAAQ,IACR,KAAM,UACN,SAAU,mCACV,YAAa,EACd,EC7DYU,GAAYpB,GAAM,CAC7B,KAAM,YACN,OAAQ,IACR,SAAU,6DACX,EAEYqB,GAAerB,GAAM,CAChC,KAAM,eACN,OAAQ,IACR,SAAU,6DACX,ECZDsB,GAAA,CAAA,gDAAA3H,GAAA,OAAA,IAAAgD,KCCA,IAAI4E,GAAWxG,GAEXyG,GAAM,IACNC,GAAO,IACPC,GAAS,CAACD,GACVE,GAAM,KAAK,IAAI,EAAG,EAAE,EAOxB,SAAS5G,GAAOa,EAAKyE,EAAKuB,EAAM,CAC9BvB,EAAMA,GAAO,CAAA,EACbuB,EAASA,GAAU,EAGnB,QAFIC,EAAYD,EAEVhG,GAAO+F,IACXtB,EAAIuB,GAAQ,EAAKhG,EAAM,IAAQ4F,GAC/B5F,GAAO,IAET,KAAMA,EAAM8F,IACVrB,EAAIuB,GAAQ,EAAKhG,EAAM,IAAQ4F,GAC/B5F,KAAS,EAEX,OAAAyE,EAAIuB,CAAM,EAAIhG,EAAM,EAGpBb,GAAO,MAAQ6G,EAASC,EAAY,EAE7BxB,CACT,CAEA,IAAI1G,GAASmI,GAETC,GAAQ,IACRC,GAAS,IAMb,SAASF,GAAKhI,EAAK8H,EAAM,CACvB,IAAIK,EAAS,EACTL,EAASA,GAAU,EACnBM,EAAS,EACTC,EAAUP,EACVQ,EACAvG,EAAI/B,EAAI,OAEZ,EAAG,CACD,GAAIqI,GAAWtG,EAEb,MAAAiG,GAAK,MAAQ,EACP,IAAI,WAAW,yBAAyB,EAEhDM,EAAItI,EAAIqI,GAAS,EACjBF,GAAOC,EAAQ,IACVE,EAAIJ,KAAWE,GACfE,EAAIJ,IAAU,KAAK,IAAI,EAAGE,CAAK,EACpCA,GAAS,CACX,OAASE,GAAKL,IAGd,OAAAD,GAAK,MAAQK,EAAUP,EAEhBK,CACT,CAEA,IAAII,GAAK,KAAK,IAAI,EAAI,CAAC,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EAEnB/E,GAAS,SAAgC/E,EAAK,CAChD,OACEA,EAAQsJ,GAAK,EACbtJ,EAAQuJ,GAAK,EACbvJ,EAAQwJ,GAAK,EACbxJ,EAAQyJ,GAAK,EACbzJ,EAAQ0J,GAAK,EACb1J,EAAQ2J,GAAK,EACb3J,EAAQ4J,GAAK,EACb5J,EAAQ6J,GAAK,EACb7J,EAAQ8J,GAAK,EACA,EAEjB,EAEIC,GAAS,CACT,OAAQvB,GACR,OAAQ5H,GACR,eAAgBmE,IAGhBiF,GAAeD,GAEnBE,GAAeD,GCrGT,SAAUpJ,GAAQ1B,EAAkB2J,EAAS,EAAC,CAElD,MAAO,CADMoB,GAAO,OAAO/K,EAAM2J,CAAM,EACzBoB,GAAO,OAAO,KAAK,CACnC,CAEM,SAAUC,GAAUC,EAAaC,EAAoBvB,EAAS,EAAC,CACnE,OAAAoB,GAAO,OAAOE,EAAKC,EAAQvB,CAAM,EAC1BuB,CACT,CAEM,SAAUC,GAAgBF,EAAW,CACzC,OAAOF,GAAO,eAAeE,CAAG,CAClC,CFPM,SAAUG,GAA8BC,EAAYC,EAAkB,CAC1E,IAAMtF,EAAOsF,EAAO,WACdC,EAAoBJ,GAAeE,CAAI,EACvCG,EAAeD,EAAoBJ,GAAenF,CAAI,EAEtDmB,EAAQ,IAAI,WAAWqE,EAAexF,CAAI,EACzC,OAAAgF,GAASK,EAAMlE,EAAO,CAAC,EACvB6D,GAAShF,EAAMmB,EAAOoE,CAAU,EACvCpE,EAAM,IAAImE,EAAQE,CAAY,EAEvB,IAAIC,GAAOJ,EAAMrF,EAAMsF,EAAQnE,CAAK,CAC7C,CAKM,SAAUzF,GAAQgK,EAAqB,CAC3C,IAAMvE,EAAQrC,GAAO4G,CAAS,EACxB,CAACL,EAAME,CAAU,EAAW7J,GAAOyF,CAAK,EACxC,CAACnB,EAAMwF,CAAY,EAAW9J,GAAOyF,EAAM,SAASoE,CAAU,CAAC,EAC/DD,EAASnE,EAAM,SAASoE,EAAaC,CAAY,EAEvD,GAAIF,EAAO,aAAetF,EACxB,MAAM,IAAI,MAAM,kBAAkB,EAGpC,OAAO,IAAIyF,GAAOJ,EAAMrF,EAAMsF,EAAQnE,CAAK,CAC7C,CAEM,SAAUzC,GAAQiH,EAAoBxB,EAAU,CACpD,GAAIwB,IAAMxB,EACR,MAAO,GACF,CACL,IAAMnK,EAAOmK,EAEb,OACEwB,EAAE,OAAS3L,EAAK,MAChB2L,EAAE,OAAS3L,EAAK,MAChBA,EAAK,iBAAiB,YACtB0E,GAAWiH,EAAE,MAAO3L,EAAK,KAAK,CAElC,CACF,CAMM,IAAOyL,GAAP,KAAa,CACR,KACA,KACA,OACA,MAKT,YAAaJ,EAAYrF,EAAYsF,EAAoBnE,EAAiB,CACxE,KAAK,KAAOkE,EACZ,KAAK,KAAOrF,EACZ,KAAK,OAASsF,EACd,KAAK,MAAQnE,CACf,GG3DI,SAAUyE,GAA0FC,EAAS7G,EAAmC,CACpJ,GAAM,CAAE,MAAAmC,EAAO,QAAA2E,CAAO,EAAKD,EAC3B,OAAQC,EAAS,CACf,IAAK,GACH,OAAOC,GACL5E,EACA6E,GAAUH,CAAI,EACd7G,GAAqCmE,GAAU,OAAO,EAE1D,QACE,OAAO8C,GACL9E,EACA6E,GAAUH,CAAI,EACb7G,GAAQ0D,GAAO,OAAwC,CAE9D,CACF,CAYA,IAAMwD,GAAQ,IAAI,QAElB,SAASF,GAAWG,EAAoB,CACtC,IAAMH,EAAYE,GAAM,IAAIC,CAAG,EAC/B,GAAIH,GAAa,KAAM,CACrB,IAAMA,EAAY,IAAI,IACtB,OAAAE,GAAM,IAAIC,EAAKH,CAAS,EACjBA,CACT,CACA,OAAOA,CACT,CAEM,IAAOI,GAAP,MAAOC,EAAG,CACL,KACA,QACA,UACA,MACA,IAOT,YAAaP,EAAkBT,EAAcK,EAAqCvE,EAAiB,CACjG,KAAK,KAAOkE,EACZ,KAAK,QAAUS,EACf,KAAK,UAAYJ,EACjB,KAAK,MAAQvE,EAIb,KAAK,GAAG,EAAIA,CACd,CAQA,IAAI,OAAK,CACP,OAAO,IACT,CAGA,IAAI,YAAU,CACZ,OAAO,KAAK,MAAM,UACpB,CAGA,IAAI,YAAU,CACZ,OAAO,KAAK,MAAM,UACpB,CAEA,MAAI,CACF,OAAQ,KAAK,QAAS,CACpB,IAAK,GACH,OAAO,KAET,IAAK,GAAG,CACN,GAAM,CAAE,KAAAkE,EAAM,UAAAK,CAAS,EAAK,KAE5B,GAAIL,IAASiB,GACX,MAAM,IAAI,MAAM,0CAA0C,EAI5D,GAAIZ,EAAU,OAASa,GACrB,MAAM,IAAI,MAAM,oDAAoD,EAGtE,OACEF,GAAI,SACFX,CAA6C,CAGnD,CACA,QACE,MAAM,MACJ,+BAA+B,KAAK,OAAO,4CAA4C,CAG7F,CACF,CAEA,MAAI,CACF,OAAQ,KAAK,QAAS,CACpB,IAAK,GAAG,CACN,GAAM,CAAE,KAAAL,EAAM,OAAAC,CAAM,EAAK,KAAK,UACxBI,EAAmBN,GAAOC,EAAMC,CAAM,EAC5C,OACEe,GAAI,SAAS,KAAK,KAAMX,CAAS,CAErC,CACA,IAAK,GACH,OAAO,KAET,QACE,MAAM,MACJ,+BAA+B,KAAK,OAAO,4CAA4C,CAG7F,CACF,CAEA,OAAQc,EAAc,CACpB,OAAOH,GAAI,OAAO,KAAMG,CAAK,CAC/B,CAEA,OAAO,OAAsFC,EAA4CD,EAAc,CACrJ,IAAME,EAAUF,EAChB,OACEE,GAAW,MACXD,EAAK,OAASC,EAAQ,MACtBD,EAAK,UAAYC,EAAQ,SAClBhI,GAAO+H,EAAK,UAAWC,EAAQ,SAAS,CAEnD,CAEA,SAAU1H,EAAmC,CAC3C,OAAO4G,GAAO,KAAM5G,CAAI,CAC1B,CAEA,QAAM,CACJ,MAAO,CAAE,IAAK4G,GAAO,IAAI,CAAC,CAC5B,CAEA,MAAI,CACF,OAAO,IACT,CAES,CAAC,OAAO,WAAW,EAAI,MAIhC,CAAC,OAAO,IAAI,4BAA4B,CAAC,GAAC,CACxC,MAAO,OAAO,KAAK,SAAQ,CAAE,GAC/B,CAYA,OAAO,MAAwFlE,EAA+C,CAC5I,GAAIA,GAAS,KACX,OAAO,KAGT,IAAM5G,EAAQ4G,EACd,GAAI5G,aAAiBuL,GAEnB,OAAOvL,EACT,GAAYA,EAAM,GAAG,GAAK,MAAQA,EAAM,GAAG,IAAMA,EAAM,OAAUA,EAAM,QAAUA,EAAO,CAMtF,GAAM,CAAE,QAAAgL,EAAS,KAAAT,EAAM,UAAAK,EAAW,MAAAvE,CAAK,EAAKrG,EAC5C,OAAO,IAAIuL,GACTP,EACAT,EACAK,EACAvE,GAASwF,GAAUb,EAAST,EAAMK,EAAU,KAAK,CAAC,CAEtD,SAAW5K,EAAM8L,EAAS,IAAM,GAAM,CAIpC,GAAM,CAAE,QAAAd,EAAS,UAAAJ,EAAW,KAAAL,CAAI,EAAKvK,EAC/BwK,EAAgB5J,GAAOgK,CAAS,EACtC,OAAOW,GAAI,OAAOP,EAAST,EAAMC,CAAM,CACzC,KAGE,QAAO,IAEX,CAOA,OAAO,OAAsFQ,EAAkBT,EAAcC,EAAgC,CAC3J,GAAI,OAAOD,GAAS,SAClB,MAAM,IAAI,MAAM,uCAAuC,EAGzD,GAAI,EAAEC,EAAO,iBAAiB,YAC5B,MAAM,IAAI,MAAM,gBAAgB,EAGlC,OAAQQ,EAAS,CACf,IAAK,GAAG,CACN,GAAIT,IAASiB,GACX,MAAM,IAAI,MACR,wCAAwCA,EAAW,kBAAkB,EAGvE,OAAO,IAAID,GAAIP,EAAST,EAAMC,EAAQA,EAAO,KAAK,CAEtD,CACA,IAAK,GAAG,CACN,IAAMnE,EAAQwF,GAAUb,EAAST,EAAMC,EAAO,KAAK,EACnD,OAAO,IAAIe,GAAIP,EAAST,EAAMC,EAAQnE,CAAK,CAC7C,CACA,QACE,MAAM,IAAI,MAAM,iBAAiB,CAErC,CACF,CAKA,OAAO,SAAuBmE,EAAgD,CAC5E,OAAOe,GAAI,OAAO,EAAGC,GAAahB,CAAM,CAC1C,CAQA,OAAO,SAAyDD,EAAYC,EAAgC,CAC1G,OAAOe,GAAI,OAAO,EAAGhB,EAAMC,CAAM,CACnC,CASA,OAAO,OAAoFnE,EAAuD,CAChJ,GAAM,CAACgF,EAAKxK,CAAS,EAAI0K,GAAI,YAAYlF,CAAK,EAC9C,GAAIxF,EAAU,SAAW,EACvB,MAAM,IAAI,MAAM,kBAAkB,EAEpC,OAAOwK,CACT,CAWA,OAAO,YAA2EhF,EAAyC,CACzH,IAAM0F,EAAQR,GAAI,aAAalF,CAAK,EAC9B2F,EAAaD,EAAM,KAAOA,EAAM,cAChCE,EAAiBjI,GACrBqC,EAAM,SAAS2F,EAAYA,EAAaD,EAAM,aAAa,CAAC,EAE9D,GAAIE,EAAe,aAAeF,EAAM,cACtC,MAAM,IAAI,MAAM,kBAAkB,EAEpC,IAAMG,EAAcD,EAAe,SACjCF,EAAM,cAAgBA,EAAM,UAAU,EAElCvB,EAAS,IAAWG,GACxBoB,EAAM,cACNA,EAAM,WACNG,EACAD,CAAc,EAMhB,MAAO,CAHLF,EAAM,UAAY,EACdR,GAAI,SAASf,CAA0C,EACvDe,GAAI,SAASQ,EAAM,MAAOvB,CAAM,EACNnE,EAAM,SAAS0F,EAAM,IAAI,CAAC,CAC5D,CAWA,OAAO,aAA4EI,EAAgD,CACjI,IAAItD,EAAS,EACPuD,EAAO,IAAa,CACxB,GAAM,CAAC9L,EAAGyE,CAAM,EAAWnE,GAAOuL,EAAa,SAAStD,CAAM,CAAC,EAC/D,OAAAA,GAAU9D,EACHzE,CACT,EAEI0K,EAAUoB,EAAI,EACdC,EAAQb,GASZ,GARIR,IAAsB,IAExBA,EAAU,EACVnC,EAAS,GAETwD,EAAQD,EAAI,EAGVpB,IAAY,GAAKA,IAAY,EAC/B,MAAM,IAAI,WAAW,uBAAuBA,CAAO,EAAE,EAGvD,IAAMgB,EAAanD,EACbyD,EAAgBF,EAAI,EACpBG,EAAaH,EAAI,EACjBlH,EAAO2D,EAAS0D,EAChBC,EAAgBtH,EAAO8G,EAE7B,MAAO,CAAE,QAAAhB,EAAS,MAAAqB,EAAO,cAAAC,EAAe,WAAAC,EAAY,cAAAC,EAAe,KAAAtH,CAAI,CACzE,CAQA,OAAO,MAA0GL,EAAkEX,EAAmC,CACpN,GAAM,CAACiC,EAAQE,CAAK,EAAIoG,GAAgB5H,EAAQX,CAAI,EAE9CmH,EAAME,GAAI,OAAOlF,CAAK,EAE5B,GAAIgF,EAAI,UAAY,GAAKxG,EAAO,CAAC,IAAM,IACrC,MAAM,MAAM,wDAAwD,EAItE,OAAAqG,GAAUG,CAAG,EAAE,IAAIlF,EAAQtB,CAAM,EAE1BwG,CACT,GAGF,SAASoB,GAAqH5H,EAAkEX,EAAmC,CACjO,OAAQW,EAAO,CAAC,EAAG,CAEjB,IAAK,IAAK,CACR,IAAMtF,EAAU2E,GAAQmE,GACxB,MAAO,CACLA,GAAU,OACV9I,EAAQ,OAAO,GAAG8I,GAAU,MAAM,GAAGxD,CAAM,EAAE,EAEjD,CACA,KAAKwD,GAAU,OAAQ,CACrB,IAAM9I,EAAU2E,GAAQmE,GACxB,MAAO,CAACA,GAAU,OAAkB9I,EAAQ,OAAOsF,CAAM,CAAC,CAC5D,CACA,KAAK+C,GAAO,OAAQ,CAClB,IAAMrI,EAAU2E,GAAQ0D,GACxB,MAAO,CAACA,GAAO,OAAkBrI,EAAQ,OAAOsF,CAAM,CAAC,CACzD,CACA,QAAS,CACP,GAAIX,GAAQ,KACV,MAAM,MACJ,iFAAiF,EAGrF,MAAO,CAACW,EAAO,CAAC,EAAaX,EAAK,OAAOW,CAAM,CAAC,CAClD,CACF,CACF,CAEA,SAASoG,GAAY5E,EAAmB+E,EAA4BlH,EAA+B,CACjG,GAAM,CAAE,OAAAiC,CAAM,EAAKjC,EACnB,GAAIiC,IAAWkC,GAAU,OACvB,MAAM,MAAM,8BAA8BnE,EAAK,IAAI,WAAW,EAGhE,IAAMmH,EAAMD,EAAM,IAAIjF,CAAM,EAC5B,GAAIkF,GAAO,KAAM,CACf,IAAMA,EAAMnH,EAAK,OAAOmC,CAAK,EAAE,MAAM,CAAC,EACtC+E,OAAAA,EAAM,IAAIjF,EAAQkF,CAAG,EACdA,CACT,KACE,QAAOA,CAEX,CAEA,SAASF,GAAoC9E,EAAmB+E,EAA4BlH,EAAkC,CAC5H,GAAM,CAAE,OAAAiC,CAAM,EAAKjC,EACbmH,EAAMD,EAAM,IAAIjF,CAAM,EAC5B,GAAIkF,GAAO,KAAM,CACf,IAAMA,EAAMnH,EAAK,OAAOmC,CAAK,EAC7B+E,OAAAA,EAAM,IAAIjF,EAAQkF,CAAG,EACdA,CACT,KACE,QAAOA,CAEX,CAEA,IAAMG,GAAc,IACdC,GAAe,GAErB,SAASI,GAAWb,EAAsBT,EAAcK,EAAqB,CAC3E,IAAM8B,EAAoBrC,GAAeW,CAAO,EAC1C2B,EAAaD,EAAoBrC,GAAeE,CAAI,EACpDlE,EAAQ,IAAI,WAAWsG,EAAa/B,EAAU,UAAU,EACvD,OAAAV,GAASc,EAAS3E,EAAO,CAAC,EAC1B6D,GAASK,EAAMlE,EAAOqG,CAAU,EACvCrG,EAAM,IAAIuE,EAAW+B,CAAU,EACxBtG,CACT,CAEA,IAAMyF,GAAY,OAAO,IAAI,kBAAkB,ECnczC,SAAU9E,GAAiD,CAAE,KAAA5C,EAAM,KAAAmG,EAAM,OAAAvI,CAAM,EAA4E,CAC/J,OAAO,IAAI4K,GAAOxI,EAAMmG,EAAMvI,CAAM,CACtC,CAMM,IAAO4K,GAAP,KAAa,CACR,KACA,KACA,OAET,YAAaxI,EAAYmG,EAAYvI,EAAgD,CACnF,KAAK,KAAOoC,EACZ,KAAK,KAAOmG,EACZ,KAAK,OAASvI,CAChB,CAEA,OAAQ4E,EAAiB,CACvB,GAAIA,aAAiB,WAAY,CAC/B,IAAMiG,EAAS,KAAK,OAAOjG,CAAK,EAChC,OAAOiG,aAAkB,WACdvC,GAAO,KAAK,KAAMuC,CAAM,EAE/BA,EAAO,KAAKrC,GAAiBF,GAAO,KAAK,KAAME,CAAM,CAAC,CAC5D,KACE,OAAM,MAAM,mCAAmC,CAGnD,GCjCWsC,GAASnF,GAAQ,CAC5B,OAAQ,IACR,KAAM,SACN,SAAU,mEACV,YAAa,EACd,EAEYoF,GAAYpF,GAAQ,CAC/B,OAAQ,IACR,KAAM,YACN,SAAU,oEACV,YAAa,EACd,EAEYqF,GAAYrF,GAAQ,CAC/B,OAAQ,IACR,KAAM,YACN,SAAU,mEACV,YAAa,EACd,EAEYsF,GAAetF,GAAQ,CAClC,OAAQ,IACR,KAAM,eACN,SAAU,oEACV,YAAa,EACd,E7BDD,SAASuF,GAAY9M,EAAK,CACxB,GAAIA,EAAI,QAAUA,GAAOA,EAAI,GAAG,IAAMA,EAAI,MACxC,OAAO,KAET,IAAMiL,EAAMC,GAAI,MAAMlL,CAAG,EAGzB,GAAI,CAACiL,EACH,OAAO,KAET,IAAM8B,EAAY9B,EAAI,SAAS,EAE/B,MAAO,CACL,IAAI1I,EAAMnC,EAAK,IAAK,IAAU,CAAC,EAC/B,IAAImC,EAAMnC,EAAK,OAAQ,IAAK,CAAC,EAC7B,IAAImC,EAAMnC,EAAK,OAAQ2M,EAAWA,EAAU,MAAM,EAClD,IAAIxK,EAAMnC,EAAK,MAAO,OAAW,CAAC,CACpC,CACF,CAUA,SAAS4M,GAAc/G,EAAO,CAC5B,IAAMgH,EAAcP,GAAO,OAAOzG,CAAK,EAAE,MAAM,CAAC,EAChD,MAAO,CACL,IAAI1D,EAAMnC,EAAK,IAAK,IAAU,CAAC,EAC/B,IAAImC,EAAMnC,EAAK,OAAQ,IAAK,CAAC,EAC7B,IAAImC,EAAMnC,EAAK,IAAK,IAAU,CAAC,EAC/B,IAAImC,EAAMnC,EAAK,OAAQ,QAAS,CAAC,EACjC,IAAImC,EAAMnC,EAAK,OAAQ6M,EAAaA,EAAY,MAAM,EACtD,IAAI1K,EAAMnC,EAAK,MAAO,OAAW,CAAC,EAClC,IAAImC,EAAMnC,EAAK,MAAO,OAAW,CAAC,CACpC,CACF,CASA,SAAS8M,GAAgBlN,EAAK,CAC5B,OAAOgN,GAAa,IAAI,WAAWhN,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,CAAC,CAChF,CAQA,SAASmN,GAAgBC,EAAI,CAC3B,OAAOJ,GAAa,IAAI,WAAWI,CAAE,CAAC,CACxC,CASA,SAASC,IAAoB,CAC3B,MAAM,IAAI,MAAM,2EAA2E,CAC7F,CAUA,SAASC,GAAe7K,EAAK,CAC3B,GAAI,OAAO,MAAMA,CAAG,EAClB,MAAM,IAAI,MAAM,qEAAqE,EAEvF,GAAIA,IAAQ,KAAYA,IAAQ,KAC9B,MAAM,IAAI,MAAM,0FAA0F,EAE5G,OAAO,IACT,CAEA,IAAM8K,GAAgB,CACpB,aAAc,CACZ,OAAQT,GACR,OAAQE,GACR,WAAYA,GACZ,UAAWE,GACX,YAAaA,GACb,WAAYA,GACZ,YAAaA,GACb,WAAYA,GACZ,aAAcA,GACd,aAAcA,GACd,kBAAmBA,GACnB,cAAeA,GACf,eAAgBA,GAChB,SAAUA,GACV,YAAaC,GACb,UAAWE,GACX,OAAQC,EACV,CACF,EAKME,GAAN,cAAyC1L,EAAU,CAKjD,YAAahD,EAAMC,EAAS,CAC1B,MAAMD,EAAMC,CAAO,EAEnB,KAAK,YAAc,CAAC,CACtB,CAKA,MAAQ,CACN,OAAO,KAAK,YAAY,SAAW,GAAK,MAAM,KAAK,CACrD,CAKA,OAAS,CACP,OAAI,KAAK,YAAY,OAAS,EAErB,KAAK,YAAY,IAAI,EAEvB,MAAM,KAAK,CACpB,CAOA,MAAQ,CACN,IAAME,EAAQ,KAAK,MAAM,EAEzB,GAAIA,EAAM,OAASmB,EAAK,IAAK,CAC3B,IAAMqN,EAAW,KAAK,MAAM,EAC5B,GAAIA,EAAS,OAASrN,EAAK,QAAUqN,EAAS,QAAU,IAAK,CAC3D,IAAMC,EAAa,KAAK,MAAM,EAC9B,GAAIA,EAAW,OAAStN,EAAK,OAAQ,CAEnC,GADmB,KAAK,MAAM,EACf,OAASA,EAAK,MAC3B,MAAM,IAAI,MAAM,0BAA0B,EAE5C,YAAK,YAAY,KAAKsN,CAAU,EACzB,IAAInL,EAAMnC,EAAK,IAAK,GAAI,CAAC,CAClC,CACA,GAAIsN,EAAW,OAAStN,EAAK,IAAK,CAChC,IAAMuN,EAAgB,KAAK,MAAM,EACjC,GAAIA,EAAc,OAASvN,EAAK,QAAUuN,EAAc,QAAU,QAAS,CACzE,IAAMC,EAAkB,KAAK,MAAM,EACnC,GAAIA,EAAgB,OAASxN,EAAK,OAAQ,CACxC,QAASF,EAAI,EAAGA,EAAI,EAAGA,IAErB,GADmB,KAAK,MAAM,EACf,OAASE,EAAK,MAC3B,MAAM,IAAI,MAAM,4BAA4B,EAGhD,IAAM6F,EAAQyG,GAAO,OAAO,IAAIkB,EAAgB,KAAK,EAAE,EACvD,OAAO,IAAIrL,EAAMnC,EAAK,MAAO6F,EAAO2H,EAAgB,MAAM,MAAM,CAClE,CACA,KAAK,YAAY,KAAKA,CAAe,CACvC,CACA,KAAK,YAAY,KAAKD,CAAa,CACrC,CACA,KAAK,YAAY,KAAKD,CAAU,CAClC,CACA,KAAK,YAAY,KAAKD,CAAQ,CAChC,CACA,OAAOxO,CACT,CACF,EAEM4O,GAAgB,CACpB,gBAAiB,GACjB,eAAgB,GAChB,SAAU,GACV,cAAe,GACf,YAAa,GAEb,OAAQ,GACR,QAAS,GACT,uBAAwB,GAExB,KAAM,CAAC,CACT,EAIAA,GAAc,KAAK,EAAE,EAAI3C,GAAI,MAEtB,IAAMlH,GAAO,WACPmG,GAAO,IAOPvI,GAAUkM,GAAmBlM,GAAOkM,EAAMP,EAAa,EAOvD/M,GAAU1B,GAAS,CAE9B,IAAMC,EAAU,OAAO,OAAO8O,GAAe,CAAE,UAAW,IAAIL,GAAiB1O,EAAM+O,EAAa,CAAE,CAAC,EACrG,OAAiBrN,GAAO1B,EAAMC,CAAO,CACvC,EAOa2L,GAAUoD,GAASC,GAAY,OAAOnM,GAAOkM,CAAI,CAAC,EAEzDC,GAAc,IAAI,YAOXC,GAASlP,GAAS0B,GAAOyN,GAAY,OAAOnP,CAAI,CAAC,EACxDmP,GAAc,IAAI,Y8BvQxB,SAASC,GAAQzD,EAAU,CACzB,OACEA,aAAa,YACZA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YAElE,CAEA,SAASxE,GAAMgD,KAA8BkF,EAAiB,CAC5D,GAAI,CAACD,GAAQjF,CAAC,EAAG,MAAM,IAAI,MAAM,qBAAqB,EACtD,GAAIkF,EAAQ,OAAS,GAAK,CAACA,EAAQ,SAASlF,EAAE,MAAM,EAClD,MAAM,IAAI,MAAM,iCAAiCkF,CAAO,mBAAmBlF,EAAE,MAAM,EAAE,CACzF,CAeA,SAASmF,GAAOC,EAAeC,EAAgB,GAAI,CACjD,GAAID,EAAS,UAAW,MAAM,IAAI,MAAM,kCAAkC,EAC1E,GAAIC,GAAiBD,EAAS,SAAU,MAAM,IAAI,MAAM,uCAAuC,CACjG,CACA,SAASE,GAAOrH,EAAUmH,EAAa,CACrCpI,GAAMiB,CAAG,EACT,IAAMsH,EAAMH,EAAS,UACrB,GAAInH,EAAI,OAASsH,EACf,MAAM,IAAI,MAAM,yDAAyDA,CAAG,EAAE,CAElF,CC1BA,SAASN,GAAQzD,EAAU,CACzB,OACEA,aAAa,YACZA,GAAK,MAAQ,OAAOA,GAAM,UAAYA,EAAE,YAAY,OAAS,YAElE,CAGO,IAAMgE,GAAc9O,GACzB,IAAI,SAASA,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAU,EAG5C+O,GAAO,CAACC,EAAc5F,IAAmB4F,GAAS,GAAK5F,EAAW4F,IAAS5F,EAM3E6F,GAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,IAAM,GAChF,GAAI,CAACA,GAAM,MAAM,IAAI,MAAM,6CAA6C,EA0ElE,SAAUC,GAAY7M,EAAW,CACrC,GAAI,OAAOA,GAAQ,SAAU,MAAM,IAAI,MAAM,oCAAoC,OAAOA,CAAG,EAAE,EAC7F,OAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAOA,CAAG,CAAC,CACrD,CAQM,SAAU8M,GAAQhQ,EAAW,CAEjC,GADI,OAAOA,GAAS,WAAUA,EAAO+P,GAAY/P,CAAI,GACjD,CAACoP,GAAQpP,CAAI,EAAG,MAAM,IAAI,MAAM,4BAA4B,OAAOA,CAAI,EAAE,EAC7E,OAAOA,CACT,CAsBM,IAAgBiQ,GAAhB,KAAoB,CAsBxB,OAAK,CACH,OAAO,KAAK,WAAU,CACxB,GAcIC,GAAQ,CAAA,EAAG,SAcX,SAAUC,GAAmCC,EAAuB,CACxE,IAAMC,EAASC,GAA2BF,EAAQ,EAAG,OAAOJ,GAAQM,CAAG,CAAC,EAAE,OAAM,EAC1EC,EAAMH,EAAQ,EACpB,OAAAC,EAAM,UAAYE,EAAI,UACtBF,EAAM,SAAWE,EAAI,SACrBF,EAAM,OAAS,IAAMD,EAAQ,EACtBC,CACT,CC5MA,SAASG,GAAaC,EAAgBC,EAAoB5P,EAAegP,EAAa,CACpF,GAAI,OAAOW,EAAK,cAAiB,WAAY,OAAOA,EAAK,aAAaC,EAAY5P,EAAOgP,CAAI,EAC7F,IAAMa,EAAO,OAAO,EAAE,EAChBC,EAAW,OAAO,UAAU,EAC5BC,EAAK,OAAQ/P,GAAS6P,EAAQC,CAAQ,EACtCE,EAAK,OAAOhQ,EAAQ8P,CAAQ,EAC5BG,EAAIjB,EAAO,EAAI,EACflM,EAAIkM,EAAO,EAAI,EACrBW,EAAK,UAAUC,EAAaK,EAAGF,EAAIf,CAAI,EACvCW,EAAK,UAAUC,EAAa9M,EAAGkN,EAAIhB,CAAI,CACzC,CAGM,IAAgBkB,GAAhB,cAAgDf,EAAO,CAc3D,YACWgB,EACFC,EACEC,EACArB,EAAa,CAEtB,MAAK,EALI,KAAA,SAAAmB,EACF,KAAA,UAAAC,EACE,KAAA,UAAAC,EACA,KAAA,KAAArB,EATD,KAAA,SAAW,GACX,KAAA,OAAS,EACT,KAAA,IAAM,EACN,KAAA,UAAY,GASpB,KAAK,OAAS,IAAI,WAAWmB,CAAQ,EACrC,KAAK,KAAOtB,GAAW,KAAK,MAAM,CACpC,CACA,OAAO3P,EAAW,CAChBsP,GAAO,IAAI,EACX,GAAM,CAAE,KAAAmB,EAAM,OAAA7J,EAAQ,SAAAqK,CAAQ,EAAK,KACnCjR,EAAOgQ,GAAQhQ,CAAI,EACnB,IAAMoR,EAAMpR,EAAK,OACjB,QAASqR,EAAM,EAAGA,EAAMD,GAAO,CAC7B,IAAME,EAAO,KAAK,IAAIL,EAAW,KAAK,IAAKG,EAAMC,CAAG,EAEpD,GAAIC,IAASL,EAAU,CACrB,IAAMM,EAAW5B,GAAW3P,CAAI,EAChC,KAAOiR,GAAYG,EAAMC,EAAKA,GAAOJ,EAAU,KAAK,QAAQM,EAAUF,CAAG,EACzE,QACF,CACAzK,EAAO,IAAI5G,EAAK,SAASqR,EAAKA,EAAMC,CAAI,EAAG,KAAK,GAAG,EACnD,KAAK,KAAOA,EACZD,GAAOC,EACH,KAAK,MAAQL,IACf,KAAK,QAAQR,EAAM,CAAC,EACpB,KAAK,IAAM,EAEf,CACA,YAAK,QAAUzQ,EAAK,OACpB,KAAK,WAAU,EACR,IACT,CACA,WAAWoI,EAAe,CACxBkH,GAAO,IAAI,EACXG,GAAOrH,EAAK,IAAI,EAChB,KAAK,SAAW,GAIhB,GAAM,CAAE,OAAAxB,EAAQ,KAAA6J,EAAM,SAAAQ,EAAU,KAAAnB,CAAI,EAAK,KACrC,CAAE,IAAAuB,CAAG,EAAK,KAEdzK,EAAOyK,GAAK,EAAI,IAChB,KAAK,OAAO,SAASA,CAAG,EAAE,KAAK,CAAC,EAE5B,KAAK,UAAYJ,EAAWI,IAC9B,KAAK,QAAQZ,EAAM,CAAC,EACpBY,EAAM,GAGR,QAASjQ,EAAIiQ,EAAKjQ,EAAI6P,EAAU7P,IAAKwF,EAAOxF,CAAC,EAAI,EAIjDoP,GAAaC,EAAMQ,EAAW,EAAG,OAAO,KAAK,OAAS,CAAC,EAAGnB,CAAI,EAC9D,KAAK,QAAQW,EAAM,CAAC,EACpB,IAAMe,EAAQ7B,GAAWvH,CAAG,EACtBgJ,EAAM,KAAK,UAEjB,GAAIA,EAAM,EAAG,MAAM,IAAI,MAAM,6CAA6C,EAC1E,IAAMK,EAASL,EAAM,EACfM,EAAQ,KAAK,IAAG,EACtB,GAAID,EAASC,EAAM,OAAQ,MAAM,IAAI,MAAM,oCAAoC,EAC/E,QAAStQ,EAAI,EAAGA,EAAIqQ,EAAQrQ,IAAKoQ,EAAM,UAAU,EAAIpQ,EAAGsQ,EAAMtQ,CAAC,EAAG0O,CAAI,CACxE,CACA,QAAM,CACJ,GAAM,CAAE,OAAAlJ,EAAQ,UAAAsK,CAAS,EAAK,KAC9B,KAAK,WAAWtK,CAAM,EACtB,IAAMoD,EAAMpD,EAAO,MAAM,EAAGsK,CAAS,EACrC,YAAK,QAAO,EACLlH,CACT,CACA,WAAW2H,EAAM,CACfA,IAAAA,EAAO,IAAK,KAAK,aACjBA,EAAG,IAAI,GAAG,KAAK,IAAG,CAAE,EACpB,GAAM,CAAE,SAAAV,EAAU,OAAArK,EAAQ,OAAAf,EAAQ,SAAA+L,EAAU,UAAAC,EAAW,IAAAR,CAAG,EAAK,KAC/D,OAAAM,EAAG,OAAS9L,EACZ8L,EAAG,IAAMN,EACTM,EAAG,SAAWC,EACdD,EAAG,UAAYE,EACXhM,EAASoL,GAAUU,EAAG,OAAO,IAAI/K,CAAM,EACpC+K,CACT,GC7GIG,GAAM,CAACnG,EAAWxB,EAAWlH,IAAe0I,EAAIxB,EAAM,CAACwB,EAAI1I,EAE3D8O,GAAM,CAACpG,EAAWxB,EAAWlH,IAAe0I,EAAIxB,EAAMwB,EAAI1I,EAAMkH,EAAIlH,EAKpE+O,GAA0B,IAAI,YAAY,CAC9C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACrF,EAIKC,GAAoB,IAAI,YAAY,CACxC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WACrF,EAIKC,GAA2B,IAAI,YAAY,EAAE,EAC7CC,GAAN,cAAqBnB,EAAY,CAY/B,aAAA,CACE,MAAM,GAAI,GAAI,EAAG,EAAK,EAVxB,KAAA,EAAIiB,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,EACZ,KAAA,EAAIA,GAAG,CAAC,EAAI,CAIZ,CACU,KAAG,CACX,GAAM,CAAE,EAAAG,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACnC,MAAO,CAACP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CAChC,CAEU,IACRP,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAWC,EAAS,CAEtF,KAAK,EAAIP,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,EACb,KAAK,EAAIC,EAAI,CACf,CACU,QAAQlC,EAAgB9G,EAAc,CAE9C,QAASvI,EAAI,EAAGA,EAAI,GAAIA,IAAKuI,GAAU,EAAGuI,GAAS9Q,CAAC,EAAIqP,EAAK,UAAU9G,EAAQ,EAAK,EACpF,QAASvI,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMwR,EAAMV,GAAS9Q,EAAI,EAAE,EACrByR,EAAKX,GAAS9Q,EAAI,CAAC,EACnB0R,EAAKlD,GAAKgD,EAAK,CAAC,EAAIhD,GAAKgD,EAAK,EAAE,EAAKA,IAAQ,EAC7CG,EAAKnD,GAAKiD,EAAI,EAAE,EAAIjD,GAAKiD,EAAI,EAAE,EAAKA,IAAO,GACjDX,GAAS9Q,CAAC,EAAK2R,EAAKb,GAAS9Q,EAAI,CAAC,EAAI0R,EAAKZ,GAAS9Q,EAAI,EAAE,EAAK,CACjE,CAEA,GAAI,CAAE,EAAAgR,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,EAAG,EAAAC,CAAC,EAAK,KACjC,QAASvR,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,IAAM4R,EAASpD,GAAK4C,EAAG,CAAC,EAAI5C,GAAK4C,EAAG,EAAE,EAAI5C,GAAK4C,EAAG,EAAE,EAC9CS,EAAMN,EAAIK,EAASlB,GAAIU,EAAGC,EAAGC,CAAC,EAAIV,GAAS5Q,CAAC,EAAI8Q,GAAS9Q,CAAC,EAAK,EAE/D8R,GADStD,GAAKwC,EAAG,CAAC,EAAIxC,GAAKwC,EAAG,EAAE,EAAIxC,GAAKwC,EAAG,EAAE,GAC/BL,GAAIK,EAAGC,EAAGC,CAAC,EAAK,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIU,EAAM,EACfV,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKa,EAAKC,EAAM,CAClB,CAEAd,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnBC,EAAKA,EAAI,KAAK,EAAK,EACnB,KAAK,IAAIP,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,CAAC,CACjC,CACU,YAAU,CAClBT,GAAS,KAAK,CAAC,CACjB,CACA,SAAO,CACL,KAAK,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC/B,KAAK,OAAO,KAAK,CAAC,CACpB,GAsBWiB,GAAyBhD,GAAgB,IAAM,IAAIgC,EAAQ,EEjIxE,IAAAiB,GAAsDC,GAAAC,GAAA,EAAA,CAAA,EACtDC,GAA6BF,GAAAG,GAAA,EAAA,CAAA,EAIhBC,GAA+BC,GAAcN,GAAA,KAAK,MAAM,CAACM,EAAQN,GAAA,KAAK,KAAK,CAAC,CAAC,EAI1F,IAAMO,GAAQ,iCACRC,GAAc,sBAIpBC,GAAA,eAAe,IAAI,WAAaC,GAAU,CAAC,CAACA,EAAM,MAAMF,EAAW,GAAK,CAAC,CAACE,EAAM,MAAMH,EAAK,CAAC,EACrF,IAAMI,GAAWF,GAAA,KAAK,OAAO,EA4CvBG,GAAqBC,GAAyCA,GAAiB,eAAe,WAoD3GJ,GAAA,eAAe,IAAI,MAAQC,GAAU,CAAC,CAACA,EAAM,MAAMH,EAAK,CAAC,EAClD,IAAMO,GAAQL,GAAA,KAAK,OAAO,CAAE,OAAQ,KAAM,CAAC,EAG5CM,GAAQ,yBACdN,GAAA,eAAe,IAAI,MAAQC,GAAU,CAAC,CAACA,EAAM,MAAMK,EAAK,CAAC,EAClD,IAAMC,GAAMP,GAAA,KAAK,OAAO,CAAE,OAAQ,KAAM,CAAC,EAGnCQ,GAAgBR,GAAA,KAAK,OAAO,CACxC,GAAIE,GACJ,GAAIF,GAAA,KAAK,OAAO,EAChB,GAAIS,GAAST,GAAA,KAAK,MAAM,CAACA,GAAA,KAAK,OAAO,EAAGA,GAAA,KAAK,QAAQ,EAAGA,GAAA,KAAK,OAAO,CAAC,CAAC,CAAC,EACvE,GAAIA,GAAA,KAAK,OAAO,EAChB,GAAIA,GAAA,KAAK,OAAO,EAChB,GAAIS,GAASJ,EAAK,CACnB,CAAC,EAGYK,GAAiBC,GAAA,aAAa,QAAQH,EAAa,EAEzD,IAAMI,GAAqBC,GAAe,MAAM,KAAKA,EAAc,EAE7DC,GAAWC,GAAA,KAAK,UAAU,CACtCA,GAAA,KAAK,OAAO,CACX,IAAKC,EACN,CAAC,EACDC,EACD,CAAC,EAGYC,GAAYC,GAAA,aAAa,QAAQL,EAAQ,EACzCM,GAAuBC,GAAa,MAAM,KAAKH,GAAU,OAAOG,CAAG,CAAC,EACpEC,GAAgBJ,GAAU,MAAM,KAAKA,EAAS,EChJ9CK,GAASC,GAAM,CAC1B,OAAQ,IACR,KAAM,SACN,SAAU,uCACX,EAEYC,GAAcD,GAAM,CAC/B,OAAQ,IACR,KAAM,cACN,SAAU,uCACX,ECRD,SAASE,GAAKC,EAAyB,CACrC,MAAO,OAAMC,GAAQ,IAAI,WAAW,MAAM,OAAO,OAAO,OAAOD,EAAMC,CAAI,CAAC,CAC5E,CAEO,IAAMC,GAASC,GAAK,CACzB,KAAM,WACN,KAAM,GACN,OAAQJ,GAAI,SAAS,EACtB,EAEYK,GAASD,GAAK,CACzB,KAAM,WACN,KAAM,GACN,OAAQJ,GAAI,SAAS,EACtB,ECLK,CAAE,KAAAM,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,EAI9D,SAASC,GAAcC,EAAuBC,EAAoB,CAAC,KAAK,EAAG,CACjF,GAAI,CAACD,EAAK,MAAME,GAAM,YAAaF,CAAG,EACtC,IAAIG,EAAOH,EAAe,IAC1B,GAAII,GAAkBJ,CAAG,EACxB,OAAKG,IAAKA,EAAME,GAAWC,GAAYN,CAAqB,EAAE,KAAK,EAAE,SAAS,GAC9EO,GAAK,yCAAyC,EACvC,CAAE,IAAAP,EAAK,IAAAG,CAAI,EAEnB,IAAMK,EAAa,CAAC,EACpB,OAAS,CAACC,EAAKC,CAAG,IAAK,OAAO,QAAQV,CAAG,EACpCU,IAAQ,SACXH,GAAK,OAAOE,CAAG,yDAA0DT,CAAG,EAC5EU,EAAM,MAEFT,EAAQ,SAASQ,CAAG,EAGxBE,GAAQ,oBAAqB,CAAE,IAAAF,EAAK,IAAAC,CAAI,CAAC,EAFzCF,EAAWC,CAAG,EAAIC,EAKpB,MAAO,CAAE,IAAKF,EAAsB,IAAAL,CAAI,CACzC,CAEO,SAASS,GAAsBZ,EAAkB,CACvD,OAAOK,GAAWQ,GAAab,CAAG,EAAE,KAAK,CAC1C,CACO,SAASa,GAAab,EAA+E,CAC3G,OAAOM,GAAYP,GAAcC,CAAG,GAAG,GAAG,CAC3C,CAEO,SAASK,GAAWS,EAA8B,CAExD,IAAMC,EAAOC,GAAOF,CAAK,EACnBG,EAASC,GAAO,OAAOF,GAAa,KAAMD,CAAI,EAC9CZ,EAAMgB,GAAI,OAAO,EAAWC,GAAMH,CAAM,EAC9CN,OAAAA,GAAQ,eAAgB,CAAE,MAAAG,EAAO,KAAAC,EAAM,OAAAE,EAAQ,IAAAd,CAAI,CAAC,EAC7CA,CACR,CAEO,SAASG,GAAYe,EAA6D,CACxFC,GAAM,gBAAiBD,CAAU,EACjC,IAAME,EAAmBC,GAAOH,CAAU,EAC1C,MAAO,CAAE,MAAOE,EAAU,IAAKlB,GAAWkB,CAAQ,CAAE,CACrD,CC5BO,SAASE,GAAOC,EAAU,CAC/B,IAAMC,EAAS,OAAO,UAAU,SAAS,KAAKD,CAAQ,EAGtD,OACEA,aAAoB,MACnB,OAAOA,GAAa,UAAYC,IAAW,gBAGrC,IAAID,EAAS,YAAY,CAACA,CAAQ,EAEzC,OAAOA,GAAa,UACpBC,IAAW,mBACX,OAAOD,GAAa,UACpBC,IAAW,kBAGJ,IAAI,KAAKD,CAAQ,EAGjB,IAAI,KAAK,GAAG,CAEvB,CChCO,SAASE,GAASC,EAAMC,EAAe,CAC5C,IAAMC,EAAQN,GAAOI,CAAI,EACnBG,EAAiBP,GAAOK,CAAa,EAC3C,MAAO,CAACC,EAAQ,CAACC,CACnB,CCzBA,IAAIC,GAAa,OAAO,QAAU,UAAY,QAAU,OAAO,SAAW,QAAU,OAE7EC,GAAQD,GCAXE,GAAW,OAAO,MAAQ,UAAY,MAAQ,KAAK,SAAW,QAAU,KAGxEC,GAAOF,IAAcC,IAAY,SAAS,aAAa,EAAE,EAEtDE,GAAQD,GCLXE,GAASD,GAAK,OAEXE,GAAQD,GCFXE,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAO7BE,GAAuBF,GAAY,SAGnCG,GAAiBJ,GAASA,GAAO,YAAc,OASnD,SAASK,GAAUC,EAAO,CACxB,IAAIC,EAAQL,GAAe,KAAKI,EAAOF,EAAc,EACjDI,EAAMF,EAAMF,EAAc,EAE9B,GAAI,CACFE,EAAMF,EAAc,EAAI,OACxB,IAAIK,EAAW,EACjB,MAAY,CAAC,CAEb,IAAIC,EAASP,GAAqB,KAAKG,CAAK,EAC5C,OAAIG,IACEF,EACFD,EAAMF,EAAc,EAAII,EAExB,OAAOF,EAAMF,EAAc,GAGxBM,CACT,CAEA,IAAOC,GAAQN,GC5CXJ,GAAc,OAAO,UAOrBE,GAAuBF,GAAY,SASvC,SAASW,GAAeN,EAAO,CAC7B,OAAOH,GAAqB,KAAKG,CAAK,CACxC,CAEA,IAAOO,GAAQD,GChBXE,GAAU,gBACVC,GAAe,qBAGfX,GAAiBJ,GAASA,GAAO,YAAc,OASnD,SAASgB,GAAWV,EAAO,CACzB,OAAIA,GAAS,KACJA,IAAU,OAAYS,GAAeD,GAEtCV,IAAkBA,MAAkB,OAAOE,CAAK,EACpDK,GAAUL,CAAK,EACfO,GAAeP,CAAK,CAC1B,CAEA,IAAOW,GAAQD,GCHf,SAASE,GAAaZ,EAAO,CAC3B,OAAOA,GAAS,MAAQ,OAAOA,GAAS,QAC1C,CAEA,IAAOa,GAAQD,GCxBXE,GAAY,kBAmBhB,SAASC,GAASf,EAAO,CACvB,OAAO,OAAOA,GAAS,UACpBa,GAAab,CAAK,GAAKW,GAAWX,CAAK,GAAKc,EACjD,CAEA,IAAOE,GAAQD,GCnBf,SAASE,GAASC,EAAOC,EAAU,CAKjC,QAJIC,EAAQ,GACRC,EAASH,GAAS,KAAO,EAAIA,EAAM,OACnCd,EAAS,MAAMiB,CAAM,EAElB,EAAED,EAAQC,GACfjB,EAAOgB,CAAK,EAAID,EAASD,EAAME,CAAK,EAAGA,EAAOF,CAAK,EAErD,OAAOd,CACT,CAEA,IAAOkB,GAAQL,GCGXM,GAAU,MAAM,QAEbC,GAAQD,GCnBXE,GAAW,IAGXC,GAAchC,GAASA,GAAO,UAAY,OAC1CiC,GAAiBD,GAAcA,GAAY,SAAW,OAU1D,SAASE,GAAa5B,EAAO,CAE3B,GAAI,OAAOA,GAAS,SAClB,OAAOA,EAET,GAAIwB,GAAQxB,CAAK,EAEf,OAAOsB,GAAStB,EAAO4B,EAAY,EAAI,GAEzC,GAAIZ,GAAShB,CAAK,EAChB,OAAO2B,GAAiBA,GAAe,KAAK3B,CAAK,EAAI,GAEvD,IAAII,EAAUJ,EAAQ,GACtB,OAAQI,GAAU,KAAQ,EAAIJ,GAAU,CAACyB,GAAY,KAAOrB,CAC9D,CAEA,IAAOyB,GAAQD,GCnCXE,GAAe,KAUnB,SAASC,GAAgBC,EAAQ,CAG/B,QAFIZ,EAAQY,EAAO,OAEZZ,KAAWU,GAAa,KAAKE,EAAO,OAAOZ,CAAK,CAAC,GAAG,CAC3D,OAAOA,CACT,CAEA,IAAOa,GAAQF,GCfXG,GAAc,OASlB,SAASC,GAASH,EAAQ,CACxB,OAAOA,GACHA,EAAO,MAAM,EAAGC,GAAgBD,CAAM,EAAI,CAAC,EAAE,QAAQE,GAAa,EAAE,CAE1E,CAEA,IAAOE,GAAQD,GCOf,SAASE,GAASrC,EAAO,CACvB,IAAIsC,EAAO,OAAOtC,EAClB,OAAOA,GAAS,OAASsC,GAAQ,UAAYA,GAAQ,WACvD,CAEA,IAAOC,GAAQF,GCzBXG,GAAM,IAGNC,GAAa,qBAGbC,GAAa,aAGbC,GAAY,cAGZC,GAAe,SAyBnB,SAASC,GAAS7C,EAAO,CACvB,GAAI,OAAOA,GAAS,SAClB,OAAOA,EAET,GAAIgB,GAAShB,CAAK,EAChB,OAAOwC,GAET,GAAID,GAASvC,CAAK,EAAG,CACnB,IAAI8C,EAAQ,OAAO9C,EAAM,SAAW,WAAaA,EAAM,QAAQ,EAAIA,EACnEA,EAAQuC,GAASO,CAAK,EAAKA,EAAQ,GAAMA,CAC3C,CACA,GAAI,OAAO9C,GAAS,SAClB,OAAOA,IAAU,EAAIA,EAAQ,CAACA,EAEhCA,EAAQoC,GAASpC,CAAK,EACtB,IAAI+C,EAAWL,GAAW,KAAK1C,CAAK,EACpC,OAAQ+C,GAAYJ,GAAU,KAAK3C,CAAK,EACpC4C,GAAa5C,EAAM,MAAM,CAAC,EAAG+C,EAAW,EAAI,CAAC,EAC5CN,GAAW,KAAKzC,CAAK,EAAIwC,GAAM,CAACxC,CACvC,CAEA,IAAOgD,GAAQH,GC5DXpB,GAAW,IACXwB,GAAc,sBAyBlB,SAASC,GAASlD,EAAO,CACvB,GAAI,CAACA,EACH,OAAOA,IAAU,EAAIA,EAAQ,EAG/B,GADAA,EAAQgD,GAAShD,CAAK,EAClBA,IAAUyB,IAAYzB,IAAU,CAACyB,GAAU,CAC7C,IAAI0B,EAAQnD,EAAQ,EAAI,GAAK,EAC7B,OAAOmD,EAAOF,EAChB,CACA,OAAOjD,IAAUA,EAAQA,EAAQ,CACnC,CAEA,IAAOoD,GAAQF,GCbf,SAASG,GAAUrD,EAAO,CACxB,IAAII,EAASgD,GAASpD,CAAK,EACvBsD,EAAYlD,EAAS,EAEzB,OAAOA,IAAWA,EAAUkD,EAAYlD,EAASkD,EAAYlD,EAAU,CACzE,CAEA,IAAOmD,GAAQF,GCnBf,SAASG,GAASxD,EAAO,CACvB,OAAOA,CACT,CAEA,IAAOyD,GAAQD,GChBXE,GAAW,yBACXC,GAAU,oBACVC,GAAS,6BACTC,GAAW,iBAmBf,SAASC,GAAW9D,EAAO,CACzB,GAAI,CAACuC,GAASvC,CAAK,EACjB,MAAO,GAIT,IAAIE,EAAMS,GAAWX,CAAK,EAC1B,OAAOE,GAAOyD,IAAWzD,GAAO0D,IAAU1D,GAAOwD,IAAYxD,GAAO2D,EACtE,CAEA,IAAOE,GAAQD,GCjCXE,GAAaxE,GAAK,oBAAoB,EAEnCyE,GAAQD,GCFXE,GAAc,UAAW,CAC3B,IAAIC,EAAM,SAAS,KAAKF,IAAcA,GAAW,MAAQA,GAAW,KAAK,UAAY,EAAE,EACvF,OAAOE,EAAO,iBAAmBA,EAAO,EAC1C,EAAE,EASF,SAASC,GAASC,EAAM,CACtB,MAAO,CAAC,CAACH,IAAeA,MAAcG,CACxC,CAEA,IAAOC,GAAQF,GClBXG,GAAY,SAAS,UAGrBC,GAAeD,GAAU,SAS7B,SAASE,GAASJ,EAAM,CACtB,GAAIA,GAAQ,KAAM,CAChB,GAAI,CACF,OAAOG,GAAa,KAAKH,CAAI,CAC/B,MAAY,CAAC,CACb,GAAI,CACF,OAAQA,EAAO,EACjB,MAAY,CAAC,CACf,CACA,MAAO,EACT,CAEA,IAAOK,GAAQD,GChBXE,GAAe,sBAGfC,GAAe,8BAGfL,GAAY,SAAS,UACrB5E,GAAc,OAAO,UAGrB6E,GAAeD,GAAU,SAGzB3E,GAAiBD,GAAY,eAG7BkF,GAAa,OAAO,IACtBL,GAAa,KAAK5E,EAAc,EAAE,QAAQ+E,GAAc,MAAM,EAC7D,QAAQ,yDAA0D,OAAO,EAAI,GAChF,EAUA,SAASG,GAAa9E,EAAO,CAC3B,GAAI,CAACuC,GAASvC,CAAK,GAAKsE,GAAStE,CAAK,EACpC,MAAO,GAET,IAAI+E,EAAUhB,GAAW/D,CAAK,EAAI6E,GAAaD,GAC/C,OAAOG,EAAQ,KAAKL,GAAS1E,CAAK,CAAC,CACrC,CAEA,IAAOgF,GAAQF,GCtCf,SAASG,GAASC,EAAQC,EAAK,CAC7B,OAAoCD,IAAOC,CAAG,CAChD,CAEA,IAAOC,GAAQH,GCDf,SAASI,GAAUH,EAAQC,EAAK,CAC9B,IAAInF,EAAQoF,GAASF,EAAQC,CAAG,EAChC,OAAOH,GAAahF,CAAK,EAAIA,EAAQ,MACvC,CAEA,IAAOsF,GAAQD,GCZXE,GAAUD,GAAU9F,GAAM,SAAS,EAEhCgG,GAAQD,GCHXE,GAAUD,IAAW,IAAIA,GAEtBE,GAAQD,GCMXE,GAAeD,GAAqB,SAASrB,EAAMuB,EAAM,CAC3D,OAAAF,GAAQ,IAAIrB,EAAMuB,CAAI,EACfvB,CACT,EAH6BZ,GAKtBoC,GAAQF,GCbXG,GAAe,OAAO,OAUtBC,GAAc,UAAW,CAC3B,SAASb,GAAS,CAAC,CACnB,OAAO,SAASc,EAAO,CACrB,GAAI,CAACzD,GAASyD,CAAK,EACjB,MAAO,CAAC,EAEV,GAAIF,GACF,OAAOA,GAAaE,CAAK,EAE3Bd,EAAO,UAAYc,EACnB,IAAI5F,EAAS,IAAI8E,EACjB,OAAAA,EAAO,UAAY,OACZ9E,CACT,CACF,EAAE,EAEK6F,GAAQF,GClBf,SAASG,GAAWC,EAAM,CACxB,OAAO,UAAW,CAIhB,IAAIC,EAAO,UACX,OAAQA,EAAK,OAAQ,CACnB,IAAK,GAAG,OAAO,IAAID,EACnB,IAAK,GAAG,OAAO,IAAIA,EAAKC,EAAK,CAAC,CAAC,EAC/B,IAAK,GAAG,OAAO,IAAID,EAAKC,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EACxC,IAAK,GAAG,OAAO,IAAID,EAAKC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EACjD,IAAK,GAAG,OAAO,IAAID,EAAKC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAC1D,IAAK,GAAG,OAAO,IAAID,EAAKC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EACnE,IAAK,GAAG,OAAO,IAAID,EAAKC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAC5E,IAAK,GAAG,OAAO,IAAID,EAAKC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,CACvF,CACA,IAAIC,EAAcJ,GAAWE,EAAK,SAAS,EACvC/F,EAAS+F,EAAK,MAAME,EAAaD,CAAI,EAIzC,OAAO7D,GAASnC,CAAM,EAAIA,EAASiG,CACrC,CACF,CAEA,IAAOC,GAAQJ,GChCXK,GAAiB,EAYrB,SAASC,GAAWnC,EAAMoC,EAASC,EAAS,CAC1C,IAAIC,EAASF,EAAUF,GACnBJ,EAAOG,GAAWjC,CAAI,EAE1B,SAASuC,GAAU,CACjB,IAAIC,EAAM,MAAQ,OAASrH,IAAQ,gBAAgBoH,EAAWT,EAAO9B,EACrE,OAAOwC,EAAG,MAAMF,EAASD,EAAU,KAAM,SAAS,CACpD,CACA,OAAOE,CACT,CAEA,IAAOE,GAAQN,GCjBf,SAASO,GAAM1C,EAAMqC,EAASN,EAAM,CAClC,OAAQA,EAAK,OAAQ,CACnB,IAAK,GAAG,OAAO/B,EAAK,KAAKqC,CAAO,EAChC,IAAK,GAAG,OAAOrC,EAAK,KAAKqC,EAASN,EAAK,CAAC,CAAC,EACzC,IAAK,GAAG,OAAO/B,EAAK,KAAKqC,EAASN,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAClD,IAAK,GAAG,OAAO/B,EAAK,KAAKqC,EAASN,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,CAC7D,CACA,OAAO/B,EAAK,MAAMqC,EAASN,CAAI,CACjC,CAEA,IAAOY,GAAQD,GCnBXE,GAAY,KAAK,IAarB,SAASC,GAAYd,EAAMe,EAAUC,EAASC,EAAW,CAUvD,QATIC,EAAY,GACZC,EAAanB,EAAK,OAClBoB,EAAgBJ,EAAQ,OACxBK,EAAY,GACZC,EAAaP,EAAS,OACtBQ,EAAcV,GAAUM,EAAaC,EAAe,CAAC,EACrDpH,EAAS,MAAMsH,EAAaC,CAAW,EACvCC,EAAc,CAACP,EAEZ,EAAEI,EAAYC,GACnBtH,EAAOqH,CAAS,EAAIN,EAASM,CAAS,EAExC,KAAO,EAAEH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BnH,EAAOgH,EAAQE,CAAS,CAAC,EAAIlB,EAAKkB,CAAS,GAG/C,KAAOK,KACLvH,EAAOqH,GAAW,EAAIrB,EAAKkB,GAAW,EAExC,OAAOlH,CACT,CAEA,IAAOyH,GAAQX,GCrCXD,GAAY,KAAK,IAarB,SAASa,GAAiB1B,EAAMe,EAAUC,EAASC,EAAW,CAW5D,QAVIC,EAAY,GACZC,EAAanB,EAAK,OAClB2B,EAAe,GACfP,EAAgBJ,EAAQ,OACxBY,EAAa,GACbC,EAAcd,EAAS,OACvBQ,EAAcV,GAAUM,EAAaC,EAAe,CAAC,EACrDpH,EAAS,MAAMuH,EAAcM,CAAW,EACxCL,EAAc,CAACP,EAEZ,EAAEC,EAAYK,GACnBvH,EAAOkH,CAAS,EAAIlB,EAAKkB,CAAS,EAGpC,QADIY,EAASZ,EACN,EAAEU,EAAaC,GACpB7H,EAAO8H,EAASF,CAAU,EAAIb,EAASa,CAAU,EAEnD,KAAO,EAAED,EAAeP,IAClBI,GAAeN,EAAYC,KAC7BnH,EAAO8H,EAASd,EAAQW,CAAY,CAAC,EAAI3B,EAAKkB,GAAW,GAG7D,OAAOlH,CACT,CAEA,IAAO+H,GAAQL,GChCf,SAASM,GAAalH,EAAOmH,EAAa,CAIxC,QAHIhH,EAASH,EAAM,OACfd,EAAS,EAENiB,KACDH,EAAMG,CAAM,IAAMgH,GACpB,EAAEjI,EAGN,OAAOA,CACT,CAEA,IAAOkI,GAAQF,GCff,SAASG,IAAa,CAEtB,CAEA,IAAOC,GAAQD,GCLXE,GAAmB,WASvB,SAASC,GAAY1I,EAAO,CAC1B,KAAK,YAAcA,EACnB,KAAK,YAAc,CAAC,EACpB,KAAK,QAAU,EACf,KAAK,aAAe,GACpB,KAAK,cAAgB,CAAC,EACtB,KAAK,cAAgByI,GACrB,KAAK,UAAY,CAAC,CACpB,CAGAC,GAAY,UAAYzC,GAAWuC,GAAW,SAAS,EACvDE,GAAY,UAAU,YAAcA,GAEpC,IAAOC,GAAQD,GCff,SAASE,IAAO,CAEhB,CAEA,IAAOC,GAAQD,GCNXE,GAAWpD,GAAiB,SAASrB,EAAM,CAC7C,OAAOqB,GAAQ,IAAIrB,CAAI,CACzB,EAFyBwE,GAIlBE,GAAQD,GCbXE,GAAY,CAAC,EAEVC,GAAQD,GCAXrJ,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eASjC,SAASuJ,GAAY7E,EAAM,CAKzB,QAJIjE,EAAUiE,EAAK,KAAO,GACtBnD,EAAQ+H,GAAU7I,CAAM,EACxBiB,EAASzB,GAAe,KAAKqJ,GAAW7I,CAAM,EAAIc,EAAM,OAAS,EAE9DG,KAAU,CACf,IAAIuE,EAAO1E,EAAMG,CAAM,EACnB8H,EAAYvD,EAAK,KACrB,GAAIuD,GAAa,MAAQA,GAAa9E,EACpC,OAAOuB,EAAK,IAEhB,CACA,OAAOxF,CACT,CAEA,IAAOgJ,GAAQF,GCpBf,SAASG,GAAcrJ,EAAOsJ,EAAU,CACtC,KAAK,YAActJ,EACnB,KAAK,YAAc,CAAC,EACpB,KAAK,UAAY,CAAC,CAACsJ,EACnB,KAAK,UAAY,EACjB,KAAK,WAAa,MACpB,CAEAD,GAAc,UAAYpD,GAAWuC,GAAW,SAAS,EACzDa,GAAc,UAAU,YAAcA,GAEtC,IAAOE,GAAQF,GCbf,SAASG,GAAUC,EAAQvI,EAAO,CAChC,IAAIE,EAAQ,GACRC,EAASoI,EAAO,OAGpB,IADAvI,IAAUA,EAAQ,MAAMG,CAAM,GACvB,EAAED,EAAQC,GACfH,EAAME,CAAK,EAAIqI,EAAOrI,CAAK,EAE7B,OAAOF,CACT,CAEA,IAAOwI,GAAQF,GCRf,SAASG,GAAa/C,EAAS,CAC7B,GAAIA,aAAmB+B,GACrB,OAAO/B,EAAQ,MAAM,EAEvB,IAAIxG,EAAS,IAAImJ,GAAc3C,EAAQ,YAAaA,EAAQ,SAAS,EACrE,OAAAxG,EAAO,YAAcsJ,GAAU9C,EAAQ,WAAW,EAClDxG,EAAO,UAAawG,EAAQ,UAC5BxG,EAAO,WAAawG,EAAQ,WACrBxG,CACT,CAEA,IAAOwJ,GAAQD,GCdXhK,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAuHjC,SAASkK,GAAO7J,EAAO,CACrB,GAAIa,GAAab,CAAK,GAAK,CAACwB,GAAQxB,CAAK,GAAK,EAAEA,aAAiB2I,IAAc,CAC7E,GAAI3I,aAAiBuJ,GACnB,OAAOvJ,EAET,GAAIJ,GAAe,KAAKI,EAAO,aAAa,EAC1C,OAAO4J,GAAa5J,CAAK,CAE7B,CACA,OAAO,IAAIuJ,GAAcvJ,CAAK,CAChC,CAGA6J,GAAO,UAAYrB,GAAW,UAC9BqB,GAAO,UAAU,YAAcA,GAE/B,IAAOC,GAAQD,GCrIf,SAASE,GAAW1F,EAAM,CACxB,IAAI2F,EAAWZ,GAAY/E,CAAI,EAC3BvB,EAAQgH,GAAOE,CAAQ,EAE3B,GAAI,OAAOlH,GAAS,YAAc,EAAEkH,KAAYrB,GAAY,WAC1D,MAAO,GAET,GAAItE,IAASvB,EACX,MAAO,GAET,IAAI8C,EAAOmD,GAAQjG,CAAK,EACxB,MAAO,CAAC,CAAC8C,GAAQvB,IAASuB,EAAK,CAAC,CAClC,CAEA,IAAOqE,GAAQF,GC1BXG,GAAY,IACZC,GAAW,GAGXC,GAAY,KAAK,IAWrB,SAASC,GAAShG,EAAM,CACtB,IAAIiG,EAAQ,EACRC,EAAa,EAEjB,OAAO,UAAW,CAChB,IAAIC,EAAQJ,GAAU,EAClBK,EAAYN,IAAYK,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,GAAI,EAAEH,GAASJ,GACb,OAAO,UAAU,CAAC,OAGpBI,EAAQ,EAEV,OAAOjG,EAAK,MAAM,OAAW,SAAS,CACxC,CACF,CAEA,IAAOqG,GAAQL,GCnBXM,GAAUD,GAAS7E,EAAW,EAE3B+E,GAAQD,GClBXE,GAAgB,oCAChBC,GAAiB,QASrB,SAASC,GAAetB,EAAQ,CAC9B,IAAIuB,EAAQvB,EAAO,MAAMoB,EAAa,EACtC,OAAOG,EAAQA,EAAM,CAAC,EAAE,MAAMF,EAAc,EAAI,CAAC,CACnD,CAEA,IAAOG,GAAQF,GCfXG,GAAgB,4CAUpB,SAASC,GAAkB1B,EAAQ2B,EAAS,CAC1C,IAAI/J,EAAS+J,EAAQ,OACrB,GAAI,CAAC/J,EACH,OAAOoI,EAET,IAAI4B,EAAYhK,EAAS,EACzB,OAAA+J,EAAQC,CAAS,GAAKhK,EAAS,EAAI,KAAO,IAAM+J,EAAQC,CAAS,EACjED,EAAUA,EAAQ,KAAK/J,EAAS,EAAI,KAAO,GAAG,EACvCoI,EAAO,QAAQyB,GAAe;mBAAyBE,EAAU;CAAQ,CAClF,CAEA,IAAOE,GAAQH,GCHf,SAASI,GAASvL,EAAO,CACvB,OAAO,UAAW,CAChB,OAAOA,CACT,CACF,CAEA,IAAOwL,GAAQD,GCvBXE,GAAkB,UAAW,CAC/B,GAAI,CACF,IAAIpH,EAAOiB,GAAU,OAAQ,gBAAgB,EAC7C,OAAAjB,EAAK,CAAC,EAAG,GAAI,CAAC,CAAC,EACRA,CACT,MAAY,CAAC,CACf,EAAE,EAEKqH,GAAQD,GCEXE,GAAmBD,GAA4B,SAASrH,EAAMrC,EAAQ,CACxE,OAAO0J,GAAerH,EAAM,WAAY,CACtC,aAAgB,GAChB,WAAc,GACd,MAASmH,GAASxJ,CAAM,EACxB,SAAY,EACd,CAAC,CACH,EAPwCyB,GASjCmI,GAAQD,GCVXE,GAAcnB,GAASkB,EAAe,EAEnCE,GAAQD,GCJf,SAASE,GAAU7K,EAAOC,EAAU,CAIlC,QAHIC,EAAQ,GACRC,EAASH,GAAS,KAAO,EAAIA,EAAM,OAEhC,EAAEE,EAAQC,GACXF,EAASD,EAAME,CAAK,EAAGA,EAAOF,CAAK,IAAM,IAA7C,CAIF,OAAOA,CACT,CAEA,IAAO8K,GAAQD,GCVf,SAASE,GAAc/K,EAAOgL,EAAWC,EAAWC,EAAW,CAI7D,QAHI/K,EAASH,EAAM,OACfE,EAAQ+K,GAAaC,EAAY,EAAI,IAEjCA,EAAYhL,IAAU,EAAEA,EAAQC,GACtC,GAAI6K,EAAUhL,EAAME,CAAK,EAAGA,EAAOF,CAAK,EACtC,OAAOE,EAGX,MAAO,EACT,CAEA,IAAOiL,GAAQJ,GChBf,SAASK,GAAUtM,EAAO,CACxB,OAAOA,IAAUA,CACnB,CAEA,IAAOuM,GAAQD,GCDf,SAASE,GAActL,EAAOlB,EAAOmM,EAAW,CAI9C,QAHI/K,EAAQ+K,EAAY,EACpB9K,EAASH,EAAM,OAEZ,EAAEE,EAAQC,GACf,GAAIH,EAAME,CAAK,IAAMpB,EACnB,OAAOoB,EAGX,MAAO,EACT,CAEA,IAAOqL,GAAQD,GCTf,SAASE,GAAYxL,EAAOlB,EAAOmM,EAAW,CAC5C,OAAOnM,IAAUA,EACbyM,GAAcvL,EAAOlB,EAAOmM,CAAS,EACrCE,GAAcnL,EAAOqL,GAAWJ,CAAS,CAC/C,CAEA,IAAOQ,GAAQD,GCRf,SAASE,GAAc1L,EAAOlB,EAAO,CACnC,IAAIqB,EAASH,GAAS,KAAO,EAAIA,EAAM,OACvC,MAAO,CAAC,CAACG,GAAUsL,GAAYzL,EAAOlB,EAAO,CAAC,EAAI,EACpD,CAEA,IAAO6M,GAAQD,GCZXrG,GAAiB,EACjBuG,GAAqB,EACrBC,GAAkB,EAClBC,GAAwB,GACxBC,GAAoB,GACpBC,GAA0B,GAC1BC,GAAgB,IAChBC,GAAkB,IAClBC,GAAiB,IAGjBC,GAAY,CACd,CAAC,MAAOH,EAAa,EACrB,CAAC,OAAQ5G,EAAc,EACvB,CAAC,UAAWuG,EAAkB,EAC9B,CAAC,QAASC,EAAe,EACzB,CAAC,aAAcC,EAAqB,EACpC,CAAC,OAAQK,EAAc,EACvB,CAAC,UAAWJ,EAAiB,EAC7B,CAAC,eAAgBC,EAAuB,EACxC,CAAC,QAASE,EAAe,CAC3B,EAUA,SAASG,GAAkBnC,EAAS3E,EAAS,CAC3C,OAAAuF,GAAUsB,GAAW,SAASE,EAAM,CAClC,IAAIxN,EAAQ,KAAOwN,EAAK,CAAC,EACpB/G,EAAU+G,EAAK,CAAC,GAAM,CAACX,GAAczB,EAASpL,CAAK,GACtDoL,EAAQ,KAAKpL,CAAK,CAEtB,CAAC,EACMoL,EAAQ,KAAK,CACtB,CAEA,IAAOqC,GAAQF,GC9Bf,SAASG,GAAgB9G,EAAS+G,EAAWlH,EAAS,CACpD,IAAIgD,EAAUkE,EAAY,GAC1B,OAAO7B,GAAYlF,EAAS0E,GAAkB7B,EAAQgE,GAAkBxC,GAAexB,CAAM,EAAGhD,CAAO,CAAC,CAAC,CAC3G,CAEA,IAAOmH,GAAQF,GCfXnH,GAAiB,EACjBuG,GAAqB,EACrBe,GAAwB,EACxBd,GAAkB,EAClBE,GAAoB,GACpBC,GAA0B,GAmB9B,SAASY,GAAczJ,EAAMoC,EAASsH,EAAU1F,EAAa3B,EAASS,EAAUC,EAAS4G,EAAQC,EAAKC,EAAO,CAC3G,IAAIC,EAAU1H,EAAUsG,GACpBqB,EAAaD,EAAU/G,EAAU,OACjCiH,EAAkBF,EAAU,OAAY/G,EACxCkH,EAAcH,EAAUhH,EAAW,OACnCoH,EAAmBJ,EAAU,OAAYhH,EAE7CV,GAAY0H,EAAUlB,GAAoBC,GAC1CzG,GAAW,EAAE0H,EAAUjB,GAA0BD,IAE3CxG,EAAUoH,KACdpH,GAAW,EAAEF,GAAiBuG,KAEhC,IAAI0B,EAAU,CACZnK,EAAMoC,EAASC,EAAS4H,EAAaF,EAAYG,EACjDF,EAAiBL,EAAQC,EAAKC,CAChC,EAEI9N,EAAS2N,EAAS,MAAM,OAAWS,CAAO,EAC9C,OAAIvE,GAAW5F,CAAI,GACjBuG,GAAQxK,EAAQoO,CAAO,EAEzBpO,EAAO,YAAciI,EACduF,GAAgBxN,EAAQiE,EAAMoC,CAAO,CAC9C,CAEA,IAAOgI,GAAQX,GChDf,SAASY,GAAUrK,EAAM,CACvB,IAAIa,EAASb,EACb,OAAOa,EAAO,WAChB,CAEA,IAAOyJ,GAAQD,GCXXE,GAAmB,iBAGnBC,GAAW,mBAUf,SAASC,GAAQ9O,EAAOqB,EAAQ,CAC9B,IAAIiB,EAAO,OAAOtC,EAClBqB,OAAAA,EAASA,GAAiBuN,GAEnB,CAAC,CAACvN,IACNiB,GAAQ,UACNA,GAAQ,UAAYuM,GAAS,KAAK7O,CAAK,IACrCA,EAAQ,IAAMA,EAAQ,GAAK,GAAKA,EAAQqB,CACjD,CAEA,IAAO0N,GAAQD,GCpBXE,GAAY,KAAK,IAYrB,SAASC,GAAQ/N,EAAOgO,EAAS,CAK/B,QAJIC,EAAYjO,EAAM,OAClBG,EAAS2N,GAAUE,EAAQ,OAAQC,CAAS,EAC5CC,EAAW1F,GAAUxI,CAAK,EAEvBG,KAAU,CACf,IAAID,EAAQ8N,EAAQ7N,CAAM,EAC1BH,EAAMG,CAAM,EAAI0N,GAAQ3N,EAAO+N,CAAS,EAAIC,EAAShO,CAAK,EAAI,MAChE,CACA,OAAOF,CACT,CAEA,IAAOmO,GAAQJ,GC3BXK,GAAc,yBAWlB,SAASC,GAAerO,EAAOmH,EAAa,CAM1C,QALIjH,EAAQ,GACRC,EAASH,EAAM,OACfsO,EAAW,EACXpP,EAAS,CAAC,EAEP,EAAEgB,EAAQC,GAAQ,CACvB,IAAIrB,EAAQkB,EAAME,CAAK,GACnBpB,IAAUqI,GAAerI,IAAUsP,MACrCpO,EAAME,CAAK,EAAIkO,GACflP,EAAOoP,GAAU,EAAIpO,EAEzB,CACA,OAAOhB,CACT,CAEA,IAAOqP,GAAQF,GCjBXhJ,GAAiB,EACjBuG,GAAqB,EACrBC,GAAkB,EAClBC,GAAwB,GACxBG,GAAgB,IAChBE,GAAiB,IAqBrB,SAASqC,GAAarL,EAAMoC,EAASC,EAASS,EAAUC,EAASuI,EAAeC,EAAc5B,EAAQC,EAAKC,EAAO,CAChH,IAAI2B,EAAQpJ,EAAU0G,GAClBxG,EAASF,EAAUF,GACnBuJ,EAAYrJ,EAAUqG,GACtBzF,EAAYZ,GAAWsG,GAAkBC,IACzC+C,EAAStJ,EAAU4G,GACnBlH,EAAO2J,EAAY,OAAYxJ,GAAWjC,CAAI,EAElD,SAASuC,GAAU,CAKjB,QAJIvF,EAAS,UAAU,OACnB+E,EAAO,MAAM/E,CAAM,EACnBD,EAAQC,EAELD,KACLgF,EAAKhF,CAAK,EAAI,UAAUA,CAAK,EAE/B,GAAIiG,EACF,IAAIgB,EAAcsG,GAAU/H,CAAO,EAC/BoJ,EAAe1H,GAAalC,EAAMiC,CAAW,EASnD,GAPIlB,IACFf,EAAOyB,GAAYzB,EAAMe,EAAUC,EAASC,CAAS,GAEnDsI,IACFvJ,EAAO+B,GAAiB/B,EAAMuJ,EAAeC,EAAcvI,CAAS,GAEtEhG,GAAU2O,EACN3I,GAAahG,EAAS6M,EAAO,CAC/B,IAAIE,EAAaqB,GAAerJ,EAAMiC,CAAW,EACjD,OAAOoG,GACLpK,EAAMoC,EAASiJ,GAAc9I,EAAQ,YAAaF,EAClDN,EAAMgI,EAAYJ,EAAQC,EAAKC,EAAQ7M,CACzC,CACF,CACA,IAAIgF,EAAcM,EAASD,EAAU,KACjCG,GAAKiJ,EAAYzJ,EAAYhC,CAAI,EAAIA,EAEzChD,OAAAA,EAAS+E,EAAK,OACV4H,EACF5H,EAAOiJ,GAAQjJ,EAAM4H,CAAM,EAClB+B,GAAU1O,EAAS,GAC5B+E,EAAK,QAAQ,EAEXyJ,GAAS5B,EAAM5M,IACjB+E,EAAK,OAAS6H,GAEZ,MAAQ,OAASzO,IAAQ,gBAAgBoH,IAC3CC,GAAKV,GAAQG,GAAWO,EAAE,GAErBA,GAAG,MAAMR,EAAaD,CAAI,CACnC,CACA,OAAOQ,CACT,CAEA,IAAOqJ,GAAQP,GC1Ef,SAASQ,GAAY7L,EAAMoC,EAASyH,EAAO,CACzC,IAAI/H,EAAOG,GAAWjC,CAAI,EAE1B,SAASuC,GAAU,CAMjB,QALIvF,EAAS,UAAU,OACnB+E,EAAO,MAAM/E,CAAM,EACnBD,EAAQC,EACRgH,EAAcsG,GAAU/H,CAAO,EAE5BxF,KACLgF,EAAKhF,CAAK,EAAI,UAAUA,CAAK,EAE/B,IAAIgG,EAAW/F,EAAS,GAAK+E,EAAK,CAAC,IAAMiC,GAAejC,EAAK/E,EAAS,CAAC,IAAMgH,EACzE,CAAC,EACDoH,GAAerJ,EAAMiC,CAAW,EAGpC,GADAhH,GAAU+F,EAAQ,OACd/F,EAAS6M,EACX,OAAOO,GACLpK,EAAMoC,EAASwJ,GAAcrJ,EAAQ,YAAa,OAClDR,EAAMgB,EAAS,OAAW,OAAW8G,EAAQ7M,CAAM,EAEvD,IAAIwF,EAAM,MAAQ,OAASrH,IAAQ,gBAAgBoH,EAAWT,EAAO9B,EACrE,OAAO2C,GAAMH,EAAI,KAAMT,CAAI,CAC7B,CACA,OAAOQ,CACT,CAEA,IAAOuJ,GAAQD,GCxCX3J,GAAiB,EAcrB,SAAS6J,GAAc/L,EAAMoC,EAASC,EAASS,EAAU,CACvD,IAAIR,EAASF,EAAUF,GACnBJ,EAAOG,GAAWjC,CAAI,EAE1B,SAASuC,GAAU,CAQjB,QAPIU,EAAY,GACZC,EAAa,UAAU,OACvBE,EAAY,GACZC,EAAaP,EAAS,OACtBf,EAAO,MAAMsB,EAAaH,CAAU,EACpCV,EAAM,MAAQ,OAASrH,IAAQ,gBAAgBoH,EAAWT,EAAO9B,EAE9D,EAAEoD,EAAYC,GACnBtB,EAAKqB,CAAS,EAAIN,EAASM,CAAS,EAEtC,KAAOF,KACLnB,EAAKqB,GAAW,EAAI,UAAU,EAAEH,CAAS,EAE3C,OAAON,GAAMH,EAAIF,EAASD,EAAU,KAAMN,CAAI,CAChD,CACA,OAAOQ,CACT,CAEA,IAAOyJ,GAAQD,GCrCXd,GAAc,yBAGd/I,GAAiB,EACjBuG,GAAqB,EACrBe,GAAwB,EACxBd,GAAkB,EAClBI,GAAgB,IAChBC,GAAkB,IAGlB4B,GAAY,KAAK,IAkBrB,SAASsB,GAAU1K,EAAM6D,EAAQ,CAC/B,IAAIhD,EAAUb,EAAK,CAAC,EAChB2K,EAAa9G,EAAO,CAAC,EACrB+G,EAAa/J,EAAU8J,EACvBE,EAAWD,GAAcjK,GAAiBuG,GAAqBK,IAE/DuD,EACAH,GAAcpD,IAAmB1G,GAAWsG,IAC5CwD,GAAcpD,IAAmB1G,GAAW2G,IAAqBxH,EAAK,CAAC,EAAE,QAAU6D,EAAO,CAAC,GAC3F8G,IAAepD,GAAgBC,KAAsB3D,EAAO,CAAC,EAAE,QAAUA,EAAO,CAAC,GAAOhD,GAAWsG,GAGvG,GAAI,EAAE0D,GAAYC,GAChB,OAAO9K,EAGL2K,EAAahK,KACfX,EAAK,CAAC,EAAI6D,EAAO,CAAC,EAElB+G,GAAc/J,EAAUF,GAAiB,EAAIsH,IAG/C,IAAI7N,EAAQyJ,EAAO,CAAC,EACpB,GAAIzJ,EAAO,CACT,IAAImH,EAAWvB,EAAK,CAAC,EACrBA,EAAK,CAAC,EAAIuB,EAAWU,GAAYV,EAAUnH,EAAOyJ,EAAO,CAAC,CAAC,EAAIzJ,EAC/D4F,EAAK,CAAC,EAAIuB,EAAWsI,GAAe7J,EAAK,CAAC,EAAG0J,EAAW,EAAI7F,EAAO,CAAC,CACtE,CAEA,OAAAzJ,EAAQyJ,EAAO,CAAC,EACZzJ,IACFmH,EAAWvB,EAAK,CAAC,EACjBA,EAAK,CAAC,EAAIuB,EAAWgB,GAAiBhB,EAAUnH,EAAOyJ,EAAO,CAAC,CAAC,EAAIzJ,EACpE4F,EAAK,CAAC,EAAIuB,EAAWsI,GAAe7J,EAAK,CAAC,EAAG0J,EAAW,EAAI7F,EAAO,CAAC,GAGtEzJ,EAAQyJ,EAAO,CAAC,EACZzJ,IACF4F,EAAK,CAAC,EAAI5F,GAGRuQ,EAAapD,KACfvH,EAAK,CAAC,EAAIA,EAAK,CAAC,GAAK,KAAO6D,EAAO,CAAC,EAAIuF,GAAUpJ,EAAK,CAAC,EAAG6D,EAAO,CAAC,CAAC,GAGlE7D,EAAK,CAAC,GAAK,OACbA,EAAK,CAAC,EAAI6D,EAAO,CAAC,GAGpB7D,EAAK,CAAC,EAAI6D,EAAO,CAAC,EAClB7D,EAAK,CAAC,EAAI4K,EAEH5K,CACT,CAEA,IAAO+K,GAAQL,GC7EXM,GAAkB,sBAGlBrK,GAAiB,EACjBuG,GAAqB,EACrBC,GAAkB,EAClBC,GAAwB,GACxBC,GAAoB,GACpBC,GAA0B,GAG1BjG,GAAY,KAAK,IA2BrB,SAAS4J,GAAWxM,EAAMoC,EAASC,EAASS,EAAUC,EAAS4G,EAAQC,EAAKC,EAAO,CACjF,IAAI4B,EAAYrJ,EAAUqG,GAC1B,GAAI,CAACgD,GAAa,OAAOzL,GAAQ,WAC/B,MAAM,IAAI,UAAUuM,EAAe,EAErC,IAAIvP,EAAS8F,EAAWA,EAAS,OAAS,EAS1C,GARK9F,IACHoF,GAAW,EAAEwG,GAAoBC,IACjC/F,EAAWC,EAAU,QAEvB6G,EAAMA,IAAQ,OAAYA,EAAMhH,GAAU1D,GAAU0K,CAAG,EAAG,CAAC,EAC3DC,EAAQA,IAAU,OAAYA,EAAQ3K,GAAU2K,CAAK,EACrD7M,GAAU+F,EAAUA,EAAQ,OAAS,EAEjCX,EAAUyG,GAAyB,CACrC,IAAIyC,EAAgBxI,EAChByI,EAAexI,EAEnBD,EAAWC,EAAU,MACvB,CACA,IAAIxB,EAAOkK,EAAY,OAAY/G,GAAQ1E,CAAI,EAE3CmK,EAAU,CACZnK,EAAMoC,EAASC,EAASS,EAAUC,EAASuI,EAAeC,EAC1D5B,EAAQC,EAAKC,CACf,EAiBA,GAfItI,GACF+K,GAAUnC,EAAS5I,CAAI,EAEzBvB,EAAOmK,EAAQ,CAAC,EAChB/H,EAAU+H,EAAQ,CAAC,EACnB9H,EAAU8H,EAAQ,CAAC,EACnBrH,EAAWqH,EAAQ,CAAC,EACpBpH,EAAUoH,EAAQ,CAAC,EACnBN,EAAQM,EAAQ,CAAC,EAAIA,EAAQ,CAAC,IAAM,OAC/BsB,EAAY,EAAIzL,EAAK,OACtB4C,GAAUuH,EAAQ,CAAC,EAAInN,EAAQ,CAAC,EAEhC,CAAC6M,GAASzH,GAAWsG,GAAkBC,MACzCvG,GAAW,EAAEsG,GAAkBC,KAE7B,CAACvG,GAAWA,GAAWF,GACzB,IAAInG,EAAS0G,GAAWzC,EAAMoC,EAASC,CAAO,OACrCD,GAAWsG,IAAmBtG,GAAWuG,GAClD5M,EAAS+P,GAAY9L,EAAMoC,EAASyH,CAAK,GAC/BzH,GAAWwG,IAAqBxG,IAAYF,GAAiB0G,MAAuB,CAAC7F,EAAQ,OACvGhH,EAASiQ,GAAchM,EAAMoC,EAASC,EAASS,CAAQ,EAEvD/G,EAAS6P,GAAa,MAAM,OAAWzB,CAAO,EAEhD,IAAIsC,EAASlL,EAAOC,GAAc+E,GAClC,OAAOgD,GAAgBkD,EAAO1Q,EAAQoO,CAAO,EAAGnK,EAAMoC,CAAO,CAC/D,CAEA,IAAOsK,GAAQF,GC9Ff,SAASG,GAAgB9L,EAAQC,EAAKnF,EAAO,CACvCmF,GAAO,aAAeuG,GACxBA,GAAexG,EAAQC,EAAK,CAC1B,aAAgB,GAChB,WAAc,GACd,MAASnF,EACT,SAAY,EACd,CAAC,EAEDkF,EAAOC,CAAG,EAAInF,CAElB,CAEA,IAAOiR,GAAQD,GCQf,SAASE,GAAGlR,EAAO8C,EAAO,CACxB,OAAO9C,IAAU8C,GAAU9C,IAAUA,GAAS8C,IAAUA,CAC1D,CAEA,IAAOqO,GAAQD,GChCXvR,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAYjC,SAASyR,GAAYlM,EAAQC,EAAKnF,EAAO,CACvC,IAAIqR,EAAWnM,EAAOC,CAAG,GACrB,EAAEvF,GAAe,KAAKsF,EAAQC,CAAG,GAAKgM,GAAGE,EAAUrR,CAAK,IACvDA,IAAU,QAAa,EAAEmF,KAAOD,KACnC+L,GAAgB/L,EAAQC,EAAKnF,CAAK,CAEtC,CAEA,IAAOsR,GAAQF,GCxBXnK,GAAY,KAAK,IAWrB,SAASsK,GAASlN,EAAMmN,EAAOC,EAAW,CACxC,OAAAD,EAAQvK,GAAUuK,IAAU,OAAanN,EAAK,OAAS,EAAKmN,EAAO,CAAC,EAC7D,UAAW,CAMhB,QALIpL,EAAO,UACPhF,EAAQ,GACRC,EAAS4F,GAAUb,EAAK,OAASoL,EAAO,CAAC,EACzCtQ,EAAQ,MAAMG,CAAM,EAEjB,EAAED,EAAQC,GACfH,EAAME,CAAK,EAAIgF,EAAKoL,EAAQpQ,CAAK,EAEnCA,EAAQ,GAER,QADIsQ,EAAY,MAAMF,EAAQ,CAAC,EACxB,EAAEpQ,EAAQoQ,GACfE,EAAUtQ,CAAK,EAAIgF,EAAKhF,CAAK,EAE/B,OAAAsQ,EAAUF,CAAK,EAAIC,EAAUvQ,CAAK,EAC3B8F,GAAM3C,EAAM,KAAMqN,CAAS,CACpC,CACF,CAEA,IAAOC,GAAQJ,GCvBf,SAASK,GAASvN,EAAMmN,EAAO,CAC7B,OAAO1F,GAAY6F,GAAStN,EAAMmN,EAAO/N,EAAQ,EAAGY,EAAO,EAAE,CAC/D,CAEA,IAAOwN,GAAQD,GCfXhD,GAAmB,iBA4BvB,SAASkD,GAAS9R,EAAO,CACvB,OAAO,OAAOA,GAAS,UACrBA,EAAQ,IAAMA,EAAQ,GAAK,GAAKA,GAAS4O,EAC7C,CAEA,IAAOmD,GAAQD,GCNf,SAASE,GAAYhS,EAAO,CAC1B,OAAOA,GAAS,MAAQ+R,GAAS/R,EAAM,MAAM,GAAK,CAAC+D,GAAW/D,CAAK,CACrE,CAEA,IAAOiS,GAAQD,GC/BXrS,GAAc,OAAO,UASzB,SAASuS,GAAYlS,EAAO,CAC1B,IAAImG,EAAOnG,GAASA,EAAM,YACtBgG,EAAS,OAAOG,GAAQ,YAAcA,EAAK,WAAcxG,GAE7D,OAAOK,IAAUgG,CACnB,CAEA,IAAOmM,GAAQD,GCRf,SAASE,GAAUC,EAAGlR,EAAU,CAI9B,QAHIC,EAAQ,GACRhB,EAAS,MAAMiS,CAAC,EAEb,EAAEjR,EAAQiR,GACfjS,EAAOgB,CAAK,EAAID,EAASC,CAAK,EAEhC,OAAOhB,CACT,CAEA,IAAOkS,GAAQF,GCfXG,GAAU,qBASd,SAASC,GAAgBxS,EAAO,CAC9B,OAAOa,GAAab,CAAK,GAAKW,GAAWX,CAAK,GAAKuS,EACrD,CAEA,IAAOE,GAAQD,GCbX7S,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAG7B+S,GAAuB/S,GAAY,qBAoBnCgT,GAAcF,GAAgB,UAAW,CAAE,OAAO,SAAW,EAAE,CAAC,EAAIA,GAAkB,SAASzS,EAAO,CACxG,OAAOa,GAAab,CAAK,GAAKJ,GAAe,KAAKI,EAAO,QAAQ,GAC/D,CAAC0S,GAAqB,KAAK1S,EAAO,QAAQ,CAC9C,EAEO4S,GAAQD,GCtBf,SAASE,IAAY,CACnB,MAAO,EACT,CAEA,IAAOC,GAAQD,GCbXE,GAAc,OAAO,SAAW,UAAY,SAAW,CAAC,QAAQ,UAAY,QAG5EC,GAAaD,IAAe,OAAO,QAAU,UAAY,QAAU,CAAC,OAAO,UAAY,OAGvFE,GAAgBD,IAAcA,GAAW,UAAYD,GAGrDG,GAASD,GAAgBzT,GAAK,OAAS,OAGvC2T,GAAiBD,GAASA,GAAO,SAAW,OAmB5CE,GAAWD,IAAkBL,GAE1BO,GAAQD,GChCXb,GAAU,qBACVe,GAAW,iBACXC,GAAU,mBACVC,GAAU,gBACVC,GAAW,iBACX9P,GAAU,oBACV+P,GAAS,eACTC,GAAY,kBACZC,GAAY,kBACZC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAa,mBAEbC,GAAiB,uBACjBC,GAAc,oBACdC,GAAa,wBACbC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAiB,CAAC,EACtBA,GAAeT,EAAU,EAAIS,GAAeR,EAAU,EACtDQ,GAAeP,EAAO,EAAIO,GAAeN,EAAQ,EACjDM,GAAeL,EAAQ,EAAIK,GAAeJ,EAAQ,EAClDI,GAAeH,EAAe,EAAIG,GAAeF,EAAS,EAC1DE,GAAeD,EAAS,EAAI,GAC5BC,GAAerC,EAAO,EAAIqC,GAAetB,EAAQ,EACjDsB,GAAeX,EAAc,EAAIW,GAAerB,EAAO,EACvDqB,GAAeV,EAAW,EAAIU,GAAepB,EAAO,EACpDoB,GAAenB,EAAQ,EAAImB,GAAejR,EAAO,EACjDiR,GAAelB,EAAM,EAAIkB,GAAejB,EAAS,EACjDiB,GAAehB,EAAS,EAAIgB,GAAef,EAAS,EACpDe,GAAed,EAAM,EAAIc,GAAeb,EAAS,EACjDa,GAAeZ,EAAU,EAAI,GAS7B,SAASa,GAAiB7U,EAAO,CAC/B,OAAOa,GAAab,CAAK,GACvB+R,GAAS/R,EAAM,MAAM,GAAK,CAAC,CAAC4U,GAAejU,GAAWX,CAAK,CAAC,CAChE,CAEA,IAAO8U,GAAQD,GCpDf,SAASE,GAAU1Q,EAAM,CACvB,OAAO,SAASrE,EAAO,CACrB,OAAOqE,EAAKrE,CAAK,CACnB,CACF,CAEA,IAAOgV,GAAQD,GCVXhC,GAAc,OAAO,SAAW,UAAY,SAAW,CAAC,QAAQ,UAAY,QAG5EC,GAAaD,IAAe,OAAO,QAAU,UAAY,QAAU,CAAC,OAAO,UAAY,OAGvFE,GAAgBD,IAAcA,GAAW,UAAYD,GAGrDkC,GAAchC,IAAiB5T,GAAW,QAG1C6V,GAAY,UAAW,CACzB,GAAI,CAEF,IAAIC,EAAQnC,IAAcA,GAAW,SAAWA,GAAW,QAAQ,MAAM,EAAE,MAE3E,OAAImC,GAKGF,IAAeA,GAAY,SAAWA,GAAY,QAAQ,MAAM,CACzE,MAAY,CAAC,CACf,EAAE,EAEKG,GAAQF,GCxBXG,GAAmBD,IAAYA,GAAS,aAmBxCE,GAAeD,GAAmBL,GAAUK,EAAgB,EAAIP,GAE7DS,GAAQD,GClBX3V,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAUjC,SAAS6V,GAAcxV,EAAOyV,EAAW,CACvC,IAAIC,EAAQlU,GAAQxB,CAAK,EACrB2V,EAAQ,CAACD,GAAS9C,GAAY5S,CAAK,EACnC4V,EAAS,CAACF,GAAS,CAACC,GAAStC,GAASrT,CAAK,EAC3C6V,EAAS,CAACH,GAAS,CAACC,GAAS,CAACC,GAAUL,GAAavV,CAAK,EAC1D8V,EAAcJ,GAASC,GAASC,GAAUC,EAC1CzV,EAAS0V,EAAcxD,GAAUtS,EAAM,OAAQ,MAAM,EAAI,CAAC,EAC1DqB,EAASjB,EAAO,OAEpB,QAAS+E,KAAOnF,GACTyV,GAAa7V,GAAe,KAAKI,EAAOmF,CAAG,IAC5C,EAAE2Q,IAEC3Q,GAAO,UAENyQ,IAAWzQ,GAAO,UAAYA,GAAO,WAErC0Q,IAAW1Q,GAAO,UAAYA,GAAO,cAAgBA,GAAO,eAE7D4J,GAAQ5J,EAAK9D,CAAM,KAExBjB,EAAO,KAAK+E,CAAG,EAGnB,OAAO/E,CACT,CAEA,IAAO2V,GAAQP,GCxCf,SAASQ,GAAQ3R,EAAMoN,EAAW,CAChC,OAAO,SAASwE,EAAK,CACnB,OAAO5R,EAAKoN,EAAUwE,CAAG,CAAC,CAC5B,CACF,CAEA,IAAOC,GAAQF,GCXXG,GAAaD,GAAQ,OAAO,KAAM,MAAM,EAErCE,GAAQD,GCDXxW,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eASjC,SAAS0W,GAASnR,EAAQ,CACxB,GAAI,CAACiN,GAAYjN,CAAM,EACrB,OAAOkR,GAAWlR,CAAM,EAE1B,IAAI9E,EAAS,CAAC,EACd,QAAS+E,KAAO,OAAOD,CAAM,EACvBtF,GAAe,KAAKsF,EAAQC,CAAG,GAAKA,GAAO,eAC7C/E,EAAO,KAAK+E,CAAG,EAGnB,OAAO/E,CACT,CAEA,IAAOkW,GAAQD,GCGf,SAASE,GAAKrR,EAAQ,CACpB,OAAO+M,GAAY/M,CAAM,EAAI6Q,GAAc7Q,CAAM,EAAIoR,GAASpR,CAAM,CACtE,CAEA,IAAOsR,GAAQD,GChCXE,GAAe,mDACfC,GAAgB,QAUpB,SAASC,GAAM3W,EAAOkF,EAAQ,CAC5B,GAAI1D,GAAQxB,CAAK,EACf,MAAO,GAET,IAAIsC,EAAO,OAAOtC,EAClB,OAAIsC,GAAQ,UAAYA,GAAQ,UAAYA,GAAQ,WAChDtC,GAAS,MAAQgB,GAAShB,CAAK,EAC1B,GAEF0W,GAAc,KAAK1W,CAAK,GAAK,CAACyW,GAAa,KAAKzW,CAAK,GACzDkF,GAAU,MAAQlF,KAAS,OAAOkF,CAAM,CAC7C,CAEA,IAAO0R,GAAQD,GCzBXE,GAAevR,GAAU,OAAQ,QAAQ,EAEtCwR,GAAQD,GCIf,SAASE,IAAY,CACnB,KAAK,SAAWD,GAAeA,GAAa,IAAI,EAAI,CAAC,EACrD,KAAK,KAAO,CACd,CAEA,IAAOE,GAAQD,GCJf,SAASE,GAAW9R,EAAK,CACvB,IAAI/E,EAAS,KAAK,IAAI+E,CAAG,GAAK,OAAO,KAAK,SAASA,CAAG,EACtD,YAAK,MAAQ/E,EAAS,EAAI,EACnBA,CACT,CAEA,IAAO8W,GAAQD,GCbXE,GAAiB,4BAGjBxX,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAWjC,SAASyX,GAAQjS,EAAK,CACpB,IAAIS,EAAO,KAAK,SAChB,GAAIkR,GAAc,CAChB,IAAI1W,EAASwF,EAAKT,CAAG,EACrB,OAAO/E,IAAW+W,GAAiB,OAAY/W,CACjD,CACA,OAAOR,GAAe,KAAKgG,EAAMT,CAAG,EAAIS,EAAKT,CAAG,EAAI,MACtD,CAEA,IAAOkS,GAAQD,GC1BXzX,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAWjC,SAAS2X,GAAQnS,EAAK,CACpB,IAAIS,EAAO,KAAK,SAChB,OAAOkR,GAAgBlR,EAAKT,CAAG,IAAM,OAAavF,GAAe,KAAKgG,EAAMT,CAAG,CACjF,CAEA,IAAOoS,GAAQD,GCnBXH,GAAiB,4BAYrB,SAASK,GAAQrS,EAAKnF,EAAO,CAC3B,IAAI4F,EAAO,KAAK,SAChB,YAAK,MAAQ,KAAK,IAAIT,CAAG,EAAI,EAAI,EACjCS,EAAKT,CAAG,EAAK2R,IAAgB9W,IAAU,OAAamX,GAAiBnX,EAC9D,IACT,CAEA,IAAOyX,GAAQD,GCTf,SAASE,GAAKC,EAAS,CACrB,IAAIvW,EAAQ,GACRC,EAASsW,GAAW,KAAO,EAAIA,EAAQ,OAG3C,IADA,KAAK,MAAM,EACJ,EAAEvW,EAAQC,GAAQ,CACvB,IAAIuW,EAAQD,EAAQvW,CAAK,EACzB,KAAK,IAAIwW,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,CAC7B,CACF,CAGAF,GAAK,UAAU,MAAQV,GACvBU,GAAK,UAAU,OAAYR,GAC3BQ,GAAK,UAAU,IAAML,GACrBK,GAAK,UAAU,IAAMH,GACrBG,GAAK,UAAU,IAAMD,GAErB,IAAOI,GAAQH,GCxBf,SAASI,IAAiB,CACxB,KAAK,SAAW,CAAC,EACjB,KAAK,KAAO,CACd,CAEA,IAAOC,GAAQD,GCFf,SAASE,GAAa9W,EAAOiE,EAAK,CAEhC,QADI9D,EAASH,EAAM,OACZG,KACL,GAAI8P,GAAGjQ,EAAMG,CAAM,EAAE,CAAC,EAAG8D,CAAG,EAC1B,OAAO9D,EAGX,MAAO,EACT,CAEA,IAAO4W,GAAQD,GCjBXE,GAAa,MAAM,UAGnBC,GAASD,GAAW,OAWxB,SAASE,GAAgBjT,EAAK,CAC5B,IAAIS,EAAO,KAAK,SACZxE,EAAQ6W,GAAarS,EAAMT,CAAG,EAElC,GAAI/D,EAAQ,EACV,MAAO,GAET,IAAIiK,EAAYzF,EAAK,OAAS,EAC9B,OAAIxE,GAASiK,EACXzF,EAAK,IAAI,EAETuS,GAAO,KAAKvS,EAAMxE,EAAO,CAAC,EAE5B,EAAE,KAAK,KACA,EACT,CAEA,IAAOiX,GAAQD,GCvBf,SAASE,GAAanT,EAAK,CACzB,IAAIS,EAAO,KAAK,SACZxE,EAAQ6W,GAAarS,EAAMT,CAAG,EAElC,OAAO/D,EAAQ,EAAI,OAAYwE,EAAKxE,CAAK,EAAE,CAAC,CAC9C,CAEA,IAAOmX,GAAQD,GCPf,SAASE,GAAarT,EAAK,CACzB,OAAO8S,GAAa,KAAK,SAAU9S,CAAG,EAAI,EAC5C,CAEA,IAAOsT,GAAQD,GCHf,SAASE,GAAavT,EAAKnF,EAAO,CAChC,IAAI4F,EAAO,KAAK,SACZxE,EAAQ6W,GAAarS,EAAMT,CAAG,EAElC,OAAI/D,EAAQ,GACV,EAAE,KAAK,KACPwE,EAAK,KAAK,CAACT,EAAKnF,CAAK,CAAC,GAEtB4F,EAAKxE,CAAK,EAAE,CAAC,EAAIpB,EAEZ,IACT,CAEA,IAAO2Y,GAAQD,GCZf,SAASE,GAAUjB,EAAS,CAC1B,IAAIvW,EAAQ,GACRC,EAASsW,GAAW,KAAO,EAAIA,EAAQ,OAG3C,IADA,KAAK,MAAM,EACJ,EAAEvW,EAAQC,GAAQ,CACvB,IAAIuW,EAAQD,EAAQvW,CAAK,EACzB,KAAK,IAAIwW,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,CAC7B,CACF,CAGAgB,GAAU,UAAU,MAAQb,GAC5Ba,GAAU,UAAU,OAAYP,GAChCO,GAAU,UAAU,IAAML,GAC1BK,GAAU,UAAU,IAAMH,GAC1BG,GAAU,UAAU,IAAMD,GAE1B,IAAOE,GAAQD,GC3BXE,GAAMxT,GAAU9F,GAAM,KAAK,EAExBuZ,GAAQD,GCKf,SAASE,IAAgB,CACvB,KAAK,KAAO,EACZ,KAAK,SAAW,CACd,KAAQ,IAAInB,GACZ,IAAO,IAAKkB,IAAOF,IACnB,OAAU,IAAIhB,EAChB,CACF,CAEA,IAAOoB,GAAQD,GCbf,SAASE,GAAUlZ,EAAO,CACxB,IAAIsC,EAAO,OAAOtC,EAClB,OAAQsC,GAAQ,UAAYA,GAAQ,UAAYA,GAAQ,UAAYA,GAAQ,UACvEtC,IAAU,YACVA,IAAU,IACjB,CAEA,IAAOmZ,GAAQD,GCJf,SAASE,GAAWC,EAAKlU,EAAK,CAC5B,IAAIS,EAAOyT,EAAI,SACf,OAAOF,GAAUhU,CAAG,EAChBS,EAAK,OAAOT,GAAO,SAAW,SAAW,MAAM,EAC/CS,EAAK,GACX,CAEA,IAAO0T,GAAQF,GCNf,SAASG,GAAepU,EAAK,CAC3B,IAAI/E,EAASkZ,GAAW,KAAMnU,CAAG,EAAE,OAAUA,CAAG,EAChD,YAAK,MAAQ/E,EAAS,EAAI,EACnBA,CACT,CAEA,IAAOoZ,GAAQD,GCNf,SAASE,GAAYtU,EAAK,CACxB,OAAOmU,GAAW,KAAMnU,CAAG,EAAE,IAAIA,CAAG,CACtC,CAEA,IAAOuU,GAAQD,GCJf,SAASE,GAAYxU,EAAK,CACxB,OAAOmU,GAAW,KAAMnU,CAAG,EAAE,IAAIA,CAAG,CACtC,CAEA,IAAOyU,GAAQD,GCHf,SAASE,GAAY1U,EAAKnF,EAAO,CAC/B,IAAI4F,EAAO0T,GAAW,KAAMnU,CAAG,EAC3B2U,EAAOlU,EAAK,KAEhB,OAAAA,EAAK,IAAIT,EAAKnF,CAAK,EACnB,KAAK,MAAQ4F,EAAK,MAAQkU,EAAO,EAAI,EAC9B,IACT,CAEA,IAAOC,GAAQF,GCRf,SAASG,GAASrC,EAAS,CACzB,IAAIvW,EAAQ,GACRC,EAASsW,GAAW,KAAO,EAAIA,EAAQ,OAG3C,IADA,KAAK,MAAM,EACJ,EAAEvW,EAAQC,GAAQ,CACvB,IAAIuW,EAAQD,EAAQvW,CAAK,EACzB,KAAK,IAAIwW,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,CAC7B,CACF,CAGAoC,GAAS,UAAU,MAAQf,GAC3Be,GAAS,UAAU,OAAYR,GAC/BQ,GAAS,UAAU,IAAMN,GACzBM,GAAS,UAAU,IAAMJ,GACzBI,GAAS,UAAU,IAAMD,GAEzB,IAAOE,GAAQD,GC5BXpJ,GAAkB,sBA8CtB,SAASsJ,GAAQ7V,EAAM8V,EAAU,CAC/B,GAAI,OAAO9V,GAAQ,YAAe8V,GAAY,MAAQ,OAAOA,GAAY,WACvE,MAAM,IAAI,UAAUvJ,EAAe,EAErC,IAAIwJ,EAAW,UAAW,CACxB,IAAIhU,EAAO,UACPjB,EAAMgV,EAAWA,EAAS,MAAM,KAAM/T,CAAI,EAAIA,EAAK,CAAC,EACpDiU,EAAQD,EAAS,MAErB,GAAIC,EAAM,IAAIlV,CAAG,EACf,OAAOkV,EAAM,IAAIlV,CAAG,EAEtB,IAAI/E,EAASiE,EAAK,MAAM,KAAM+B,CAAI,EAClC,OAAAgU,EAAS,MAAQC,EAAM,IAAIlV,EAAK/E,CAAM,GAAKia,EACpCja,CACT,EACA,OAAAga,EAAS,MAAQ,IAAKF,GAAQ,OAASD,IAChCG,CACT,CAGAF,GAAQ,MAAQD,GAEhB,IAAOK,GAAQJ,GCrEXK,GAAmB,IAUvB,SAASC,GAAcnW,EAAM,CAC3B,IAAIjE,EAASka,GAAQjW,EAAM,SAASc,EAAK,CACvC,OAAIkV,EAAM,OAASE,IACjBF,EAAM,MAAM,EAEPlV,CACT,CAAC,EAEGkV,EAAQja,EAAO,MACnB,OAAOA,CACT,CAEA,IAAOqa,GAAQD,GCtBXE,GAAa,mGAGbC,GAAe,WASfC,GAAeH,GAAc,SAASzY,EAAQ,CAChD,IAAI5B,EAAS,CAAC,EACd,OAAI4B,EAAO,WAAW,CAAC,IAAM,IAC3B5B,EAAO,KAAK,EAAE,EAEhB4B,EAAO,QAAQ0Y,GAAY,SAAS1P,EAAO6P,EAAQC,EAAOC,EAAW,CACnE3a,EAAO,KAAK0a,EAAQC,EAAU,QAAQJ,GAAc,IAAI,EAAKE,GAAU7P,CAAM,CAC/E,CAAC,EACM5K,CACT,CAAC,EAEM4a,GAAQJ,GCHf,SAASK,GAASjb,EAAO,CACvB,OAAOA,GAAS,KAAO,GAAK6B,GAAa7B,CAAK,CAChD,CAEA,IAAOkb,GAAQD,GCdf,SAASE,GAASnb,EAAOkF,EAAQ,CAC/B,OAAI1D,GAAQxB,CAAK,EACRA,EAEF4W,GAAM5W,EAAOkF,CAAM,EAAI,CAAClF,CAAK,EAAIgb,GAAaE,GAASlb,CAAK,CAAC,CACtE,CAEA,IAAOob,GAAQD,GCjBX1Z,GAAW,IASf,SAAS4Z,GAAMrb,EAAO,CACpB,GAAI,OAAOA,GAAS,UAAYgB,GAAShB,CAAK,EAC5C,OAAOA,EAET,IAAII,EAAUJ,EAAQ,GACtB,OAAQI,GAAU,KAAQ,EAAIJ,GAAU,CAACyB,GAAY,KAAOrB,CAC9D,CAEA,IAAOkb,GAAQD,GCTf,SAASE,GAAQrW,EAAQsW,EAAM,CAC7BA,EAAOJ,GAASI,EAAMtW,CAAM,EAK5B,QAHI9D,EAAQ,EACRC,EAASma,EAAK,OAEXtW,GAAU,MAAQ9D,EAAQC,GAC/B6D,EAASA,EAAOoW,GAAME,EAAKpa,GAAO,CAAC,CAAC,EAEtC,OAAQA,GAASA,GAASC,EAAU6D,EAAS,MAC/C,CAEA,IAAOuW,GAAQF,GCIf,SAASG,GAAIxW,EAAQsW,EAAMG,EAAc,CACvC,IAAIvb,EAAS8E,GAAU,KAAO,OAAYuW,GAAQvW,EAAQsW,CAAI,EAC9D,OAAOpb,IAAW,OAAYub,EAAevb,CAC/C,CAEA,IAAOwb,GAAQF,GCxBf,SAASG,GAAU3a,EAAO4a,EAAQ,CAKhC,QAJI1a,EAAQ,GACRC,EAASya,EAAO,OAChB5T,EAAShH,EAAM,OAEZ,EAAEE,EAAQC,GACfH,EAAMgH,EAAS9G,CAAK,EAAI0a,EAAO1a,CAAK,EAEtC,OAAOF,CACT,CAEA,IAAO6a,GAAQF,GCdXG,GAAmBtc,GAASA,GAAO,mBAAqB,OAS5D,SAASuc,GAAcjc,EAAO,CAC5B,OAAOwB,GAAQxB,CAAK,GAAK4S,GAAY5S,CAAK,GACxC,CAAC,EAAEgc,IAAoBhc,GAASA,EAAMgc,EAAgB,EAC1D,CAEA,IAAOE,GAAQD,GCLf,SAASE,GAAYjb,EAAOkb,EAAOlQ,EAAWmQ,EAAUjc,EAAQ,CAC9D,IAAIgB,EAAQ,GACRC,EAASH,EAAM,OAKnB,IAHAgL,IAAcA,EAAYgQ,IAC1B9b,IAAWA,EAAS,CAAC,GAEd,EAAEgB,EAAQC,GAAQ,CACvB,IAAIrB,EAAQkB,EAAME,CAAK,EACnBgb,EAAQ,GAAKlQ,EAAUlM,CAAK,EAC1Boc,EAAQ,EAEVD,GAAYnc,EAAOoc,EAAQ,EAAGlQ,EAAWmQ,EAAUjc,CAAM,EAEzD2b,GAAU3b,EAAQJ,CAAK,EAEfqc,IACVjc,EAAOA,EAAO,MAAM,EAAIJ,EAE5B,CACA,OAAOI,CACT,CAEA,IAAOkc,GAAQH,GCrBf,SAASI,GAAQrb,EAAO,CACtB,IAAIG,EAASH,GAAS,KAAO,EAAIA,EAAM,OACvC,OAAOG,EAASib,GAAYpb,EAAO,CAAC,EAAI,CAAC,CAC3C,CAEA,IAAOsb,GAAQD,GCVf,SAASE,GAASpY,EAAM,CACtB,OAAOyH,GAAY6F,GAAStN,EAAM,OAAWmY,EAAO,EAAGnY,EAAO,EAAE,CAClE,CAEA,IAAOqY,GAAQD,GCNf,SAASE,IAAa,CACpB,KAAK,SAAW,IAAI9D,GACpB,KAAK,KAAO,CACd,CAEA,IAAO+D,GAAQD,GCLf,SAASE,GAAY1X,EAAK,CACxB,IAAIS,EAAO,KAAK,SACZxF,EAASwF,EAAK,OAAUT,CAAG,EAE/B,YAAK,KAAOS,EAAK,KACVxF,CACT,CAEA,IAAO0c,GAAQD,GCRf,SAASE,GAAS5X,EAAK,CACrB,OAAO,KAAK,SAAS,IAAIA,CAAG,CAC9B,CAEA,IAAO6X,GAAQD,GCJf,SAASE,GAAS9X,EAAK,CACrB,OAAO,KAAK,SAAS,IAAIA,CAAG,CAC9B,CAEA,IAAO+X,GAAQD,GCRXE,GAAmB,IAYvB,SAASC,GAASjY,EAAKnF,EAAO,CAC5B,IAAI4F,EAAO,KAAK,SAChB,GAAIA,aAAgBiT,GAAW,CAC7B,IAAIwE,EAAQzX,EAAK,SACjB,GAAI,CAACmT,IAAQsE,EAAM,OAASF,GAAmB,EAC7C,OAAAE,EAAM,KAAK,CAAClY,EAAKnF,CAAK,CAAC,EACvB,KAAK,KAAO,EAAE4F,EAAK,KACZ,KAETA,EAAO,KAAK,SAAW,IAAIqU,GAASoD,CAAK,CAC3C,CACA,OAAAzX,EAAK,IAAIT,EAAKnF,CAAK,EACnB,KAAK,KAAO4F,EAAK,KACV,IACT,CAEA,IAAO0X,GAAQF,GCnBf,SAASG,GAAM5F,EAAS,CACtB,IAAI/R,EAAO,KAAK,SAAW,IAAIiT,GAAUlB,CAAO,EAChD,KAAK,KAAO/R,EAAK,IACnB,CAGA2X,GAAM,UAAU,MAAQX,GACxBW,GAAM,UAAU,OAAYT,GAC5BS,GAAM,UAAU,IAAMP,GACtBO,GAAM,UAAU,IAAML,GACtBK,GAAM,UAAU,IAAMD,GAEtB,IAAOE,GAAQD,GCjBf,SAASE,GAAYvc,EAAOgL,EAAW,CAMrC,QALI9K,EAAQ,GACRC,EAASH,GAAS,KAAO,EAAIA,EAAM,OACnCsO,EAAW,EACXpP,EAAS,CAAC,EAEP,EAAEgB,EAAQC,GAAQ,CACvB,IAAIrB,EAAQkB,EAAME,CAAK,EACnB8K,EAAUlM,EAAOoB,EAAOF,CAAK,IAC/Bd,EAAOoP,GAAU,EAAIxP,EAEzB,CACA,OAAOI,CACT,CAEA,IAAOsd,GAAQD,GCNf,SAASE,IAAY,CACnB,MAAO,CAAC,CACV,CAEA,IAAOC,GAAQD,GClBXhe,GAAc,OAAO,UAGrB+S,GAAuB/S,GAAY,qBAGnCke,GAAmB,OAAO,sBAS1BC,GAAcD,GAA+B,SAAS3Y,EAAQ,CAChE,OAAIA,GAAU,KACL,CAAC,GAEVA,EAAS,OAAOA,CAAM,EACfwY,GAAYG,GAAiB3Y,CAAM,EAAG,SAAS6Y,EAAQ,CAC5D,OAAOrL,GAAqB,KAAKxN,EAAQ6Y,CAAM,CACjD,CAAC,EACH,EARqCH,GAU9BI,GAAQF,GCff,SAASG,GAAe/Y,EAAQgZ,EAAUC,EAAa,CACrD,IAAI/d,EAAS8d,EAAShZ,CAAM,EAC5B,OAAO1D,GAAQ0D,CAAM,EAAI9E,EAAS2b,GAAU3b,EAAQ+d,EAAYjZ,CAAM,CAAC,CACzE,CAEA,IAAOkZ,GAAQH,GCRf,SAASI,GAAWnZ,EAAQ,CAC1B,OAAOkZ,GAAelZ,EAAQsR,GAAMwH,EAAU,CAChD,CAEA,IAAOM,GAAQD,GCXXE,GAAWjZ,GAAU9F,GAAM,UAAU,EAElCgf,GAAQD,GCFXE,GAAUnZ,GAAU9F,GAAM,SAAS,EAEhCkf,GAAQD,GCFXE,GAAMrZ,GAAU9F,GAAM,KAAK,EAExBof,GAAQD,GCGXjL,GAAS,eACTE,GAAY,kBACZiL,GAAa,mBACb/K,GAAS,eACTE,GAAa,mBAEbE,GAAc,oBAGd4K,GAAqBpa,GAAS8Z,EAAQ,EACtCO,GAAgBra,GAASqU,EAAG,EAC5BiG,GAAoBta,GAASga,EAAO,EACpCO,GAAgBva,GAASka,EAAG,EAC5BM,GAAoBxa,GAASc,EAAO,EASpC2Z,GAASxe,IAGR6d,IAAYW,GAAO,IAAIX,GAAS,IAAI,YAAY,CAAC,CAAC,CAAC,GAAKtK,IACxD6E,IAAOoG,GAAO,IAAIpG,EAAG,GAAKrF,IAC1BgL,IAAWS,GAAOT,GAAQ,QAAQ,CAAC,GAAKG,IACxCD,IAAOO,GAAO,IAAIP,EAAG,GAAK9K,IAC1BtO,IAAW2Z,GAAO,IAAI3Z,EAAO,GAAKwO,MACrCmL,GAAS,SAASnf,EAAO,CACvB,IAAII,EAASO,GAAWX,CAAK,EACzBmG,EAAO/F,GAAUwT,GAAY5T,EAAM,YAAc,OACjDof,EAAajZ,EAAOzB,GAASyB,CAAI,EAAI,GAEzC,GAAIiZ,EACF,OAAQA,EAAY,CAClB,KAAKN,GAAoB,OAAO5K,GAChC,KAAK6K,GAAe,OAAOrL,GAC3B,KAAKsL,GAAmB,OAAOH,GAC/B,KAAKI,GAAe,OAAOnL,GAC3B,KAAKoL,GAAmB,OAAOlL,EACjC,CAEF,OAAO5T,CACT,GAGF,IAAOif,GAAQF,GCtDXG,GAAa9f,GAAK,WAEf+f,GAAQD,GCJXnI,GAAiB,4BAYrB,SAASqI,GAAYxf,EAAO,CAC1B,YAAK,SAAS,IAAIA,EAAOmX,EAAc,EAChC,IACT,CAEA,IAAOsI,GAAQD,GCTf,SAASE,GAAY1f,EAAO,CAC1B,OAAO,KAAK,SAAS,IAAIA,CAAK,CAChC,CAEA,IAAO2f,GAAQD,GCDf,SAASE,GAAS9D,EAAQ,CACxB,IAAI1a,EAAQ,GACRC,EAASya,GAAU,KAAO,EAAIA,EAAO,OAGzC,IADA,KAAK,SAAW,IAAI7B,GACb,EAAE7Y,EAAQC,GACf,KAAK,IAAIya,EAAO1a,CAAK,CAAC,CAE1B,CAGAwe,GAAS,UAAU,IAAMA,GAAS,UAAU,KAAOH,GACnDG,GAAS,UAAU,IAAMD,GAEzB,IAAOE,GAAQD,GChBf,SAASE,GAAU5e,EAAOgL,EAAW,CAInC,QAHI9K,EAAQ,GACRC,EAASH,GAAS,KAAO,EAAIA,EAAM,OAEhC,EAAEE,EAAQC,GACf,GAAI6K,EAAUhL,EAAME,CAAK,EAAGA,EAAOF,CAAK,EACtC,MAAO,GAGX,MAAO,EACT,CAEA,IAAO6e,GAAQD,GCdf,SAASE,GAAS3F,EAAOlV,EAAK,CAC5B,OAAOkV,EAAM,IAAIlV,CAAG,CACtB,CAEA,IAAO8a,GAAQD,GCPXE,GAAuB,EACvBC,GAAyB,EAe7B,SAASC,GAAYlf,EAAO4B,EAAO2D,EAAS4Z,EAAYC,EAAWC,EAAO,CACxE,IAAIC,EAAY/Z,EAAUyZ,GACtB/Q,EAAYjO,EAAM,OAClBuf,EAAY3d,EAAM,OAEtB,GAAIqM,GAAasR,GAAa,EAAED,GAAaC,EAAYtR,GACvD,MAAO,GAGT,IAAIuR,EAAaH,EAAM,IAAIrf,CAAK,EAC5Byf,EAAaJ,EAAM,IAAIzd,CAAK,EAChC,GAAI4d,GAAcC,EAChB,OAAOD,GAAc5d,GAAS6d,GAAczf,EAE9C,IAAIE,EAAQ,GACRhB,EAAS,GACTwgB,EAAQna,EAAU0Z,GAA0B,IAAIN,GAAW,OAM/D,IAJAU,EAAM,IAAIrf,EAAO4B,CAAK,EACtByd,EAAM,IAAIzd,EAAO5B,CAAK,EAGf,EAAEE,EAAQ+N,GAAW,CAC1B,IAAI0R,EAAW3f,EAAME,CAAK,EACtB0f,EAAWhe,EAAM1B,CAAK,EAE1B,GAAIif,EACF,IAAIU,EAAWP,EACXH,EAAWS,EAAUD,EAAUzf,EAAO0B,EAAO5B,EAAOqf,CAAK,EACzDF,EAAWQ,EAAUC,EAAU1f,EAAOF,EAAO4B,EAAOyd,CAAK,EAE/D,GAAIQ,IAAa,OAAW,CAC1B,GAAIA,EACF,SAEF3gB,EAAS,GACT,KACF,CAEA,GAAIwgB,GACF,GAAI,CAACb,GAAUjd,EAAO,SAASge,EAAUE,EAAU,CAC7C,GAAI,CAACf,GAASW,EAAMI,CAAQ,IACvBH,IAAaC,GAAYR,EAAUO,EAAUC,EAAUra,EAAS4Z,EAAYE,CAAK,GACpF,OAAOK,EAAK,KAAKI,CAAQ,CAE7B,CAAC,EAAG,CACN5gB,EAAS,GACT,KACF,UACS,EACLygB,IAAaC,GACXR,EAAUO,EAAUC,EAAUra,EAAS4Z,EAAYE,CAAK,GACzD,CACLngB,EAAS,GACT,KACF,CACF,CACA,OAAAmgB,EAAM,OAAUrf,CAAK,EACrBqf,EAAM,OAAUzd,CAAK,EACd1C,CACT,CAEA,IAAO6gB,GAAQb,GC5Ef,SAASc,GAAW7H,EAAK,CACvB,IAAIjY,EAAQ,GACRhB,EAAS,MAAMiZ,EAAI,IAAI,EAE3B,OAAAA,EAAI,QAAQ,SAASrZ,EAAOmF,EAAK,CAC/B/E,EAAO,EAAEgB,CAAK,EAAI,CAAC+D,EAAKnF,CAAK,CAC/B,CAAC,EACMI,CACT,CAEA,IAAO+gB,GAAQD,GCVf,SAASE,GAAWC,EAAK,CACvB,IAAIjgB,EAAQ,GACRhB,EAAS,MAAMihB,EAAI,IAAI,EAE3B,OAAAA,EAAI,QAAQ,SAASrhB,EAAO,CAC1BI,EAAO,EAAEgB,CAAK,EAAIpB,CACpB,CAAC,EACMI,CACT,CAEA,IAAOkhB,GAAQF,GCTXlB,GAAuB,EACvBC,GAAyB,EAGzB5M,GAAU,mBACVC,GAAU,gBACVC,GAAW,iBACXC,GAAS,eACTC,GAAY,kBACZE,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZjT,GAAY,kBAEZmT,GAAiB,uBACjBC,GAAc,oBAGdxS,GAAchC,GAASA,GAAO,UAAY,OAC1C6hB,GAAgB7f,GAAcA,GAAY,QAAU,OAmBxD,SAAS8f,GAAWtc,EAAQpC,EAAO5C,EAAKuG,EAAS4Z,EAAYC,EAAWC,EAAO,CAC7E,OAAQrgB,EAAK,CACX,KAAKgU,GACH,GAAKhP,EAAO,YAAcpC,EAAM,YAC3BoC,EAAO,YAAcpC,EAAM,WAC9B,MAAO,GAEToC,EAASA,EAAO,OAChBpC,EAAQA,EAAM,OAEhB,KAAKmR,GACH,MAAK,EAAA/O,EAAO,YAAcpC,EAAM,YAC5B,CAACwd,EAAU,IAAIf,GAAWra,CAAM,EAAG,IAAIqa,GAAWzc,CAAK,CAAC,GAK9D,KAAKyQ,GACL,KAAKC,GACL,KAAKG,GAGH,OAAOxC,GAAG,CAACjM,EAAQ,CAACpC,CAAK,EAE3B,KAAK2Q,GACH,OAAOvO,EAAO,MAAQpC,EAAM,MAAQoC,EAAO,SAAWpC,EAAM,QAE9D,KAAK+Q,GACL,KAAKE,GAIH,OAAO7O,GAAWpC,EAAQ,GAE5B,KAAK4Q,GACH,IAAI+N,EAAUN,GAEhB,KAAKrN,GACH,IAAI0M,EAAY/Z,EAAUyZ,GAG1B,GAFAuB,IAAYA,EAAUH,IAElBpc,EAAO,MAAQpC,EAAM,MAAQ,CAAC0d,EAChC,MAAO,GAGT,IAAIkB,EAAUnB,EAAM,IAAIrb,CAAM,EAC9B,GAAIwc,EACF,OAAOA,GAAW5e,EAEpB2D,GAAW0Z,GAGXI,EAAM,IAAIrb,EAAQpC,CAAK,EACvB,IAAI1C,EAAS6gB,GAAYQ,EAAQvc,CAAM,EAAGuc,EAAQ3e,CAAK,EAAG2D,EAAS4Z,EAAYC,EAAWC,CAAK,EAC/F,OAAAA,EAAM,OAAUrb,CAAM,EACf9E,EAET,KAAKU,GACH,GAAIygB,GACF,OAAOA,GAAc,KAAKrc,CAAM,GAAKqc,GAAc,KAAKze,CAAK,CAEnE,CACA,MAAO,EACT,CAEA,IAAO6e,GAAQH,GC5GXtB,GAAuB,EAGvBvgB,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAejC,SAASiiB,GAAa1c,EAAQpC,EAAO2D,EAAS4Z,EAAYC,EAAWC,EAAO,CAC1E,IAAIC,EAAY/Z,EAAUyZ,GACtB2B,EAAWvD,GAAWpZ,CAAM,EAC5B4c,EAAYD,EAAS,OACrBE,EAAWzD,GAAWxb,CAAK,EAC3B2d,EAAYsB,EAAS,OAEzB,GAAID,GAAarB,GAAa,CAACD,EAC7B,MAAO,GAGT,QADIpf,EAAQ0gB,EACL1gB,KAAS,CACd,IAAI+D,EAAM0c,EAASzgB,CAAK,EACxB,GAAI,EAAEof,EAAYrb,KAAOrC,EAAQlD,GAAe,KAAKkD,EAAOqC,CAAG,GAC7D,MAAO,EAEX,CAEA,IAAI6c,EAAazB,EAAM,IAAIrb,CAAM,EAC7Byb,EAAaJ,EAAM,IAAIzd,CAAK,EAChC,GAAIkf,GAAcrB,EAChB,OAAOqB,GAAclf,GAAS6d,GAAczb,EAE9C,IAAI9E,EAAS,GACbmgB,EAAM,IAAIrb,EAAQpC,CAAK,EACvByd,EAAM,IAAIzd,EAAOoC,CAAM,EAGvB,QADI+c,EAAWzB,EACR,EAAEpf,EAAQ0gB,GAAW,CAC1B3c,EAAM0c,EAASzgB,CAAK,EACpB,IAAIiQ,EAAWnM,EAAOC,CAAG,EACrB2b,EAAWhe,EAAMqC,CAAG,EAExB,GAAIkb,EACF,IAAIU,EAAWP,EACXH,EAAWS,EAAUzP,EAAUlM,EAAKrC,EAAOoC,EAAQqb,CAAK,EACxDF,EAAWhP,EAAUyP,EAAU3b,EAAKD,EAAQpC,EAAOyd,CAAK,EAG9D,GAAI,EAAEQ,IAAa,OACV1P,IAAayP,GAAYR,EAAUjP,EAAUyP,EAAUra,EAAS4Z,EAAYE,CAAK,EAClFQ,GACD,CACL3gB,EAAS,GACT,KACF,CACA6hB,IAAaA,EAAW9c,GAAO,cACjC,CACA,GAAI/E,GAAU,CAAC6hB,EAAU,CACvB,IAAIC,EAAUhd,EAAO,YACjBid,EAAUrf,EAAM,YAGhBof,GAAWC,GACV,gBAAiBjd,GAAU,gBAAiBpC,GAC7C,EAAE,OAAOof,GAAW,YAAcA,aAAmBA,GACnD,OAAOC,GAAW,YAAcA,aAAmBA,KACvD/hB,EAAS,GAEb,CACA,OAAAmgB,EAAM,OAAUrb,CAAM,EACtBqb,EAAM,OAAUzd,CAAK,EACd1C,CACT,CAEA,IAAOgiB,GAAQR,GC/EX1B,GAAuB,EAGvB3N,GAAU,qBACVe,GAAW,iBACXM,GAAY,kBAGZjU,GAAc,OAAO,UAGrBC,GAAiBD,GAAY,eAgBjC,SAAS0iB,GAAgBnd,EAAQpC,EAAO2D,EAAS4Z,EAAYC,EAAWC,EAAO,CAC7E,IAAI+B,EAAW9gB,GAAQ0D,CAAM,EACzBqd,EAAW/gB,GAAQsB,CAAK,EACxB0f,EAASF,EAAWhP,GAAW+L,GAAOna,CAAM,EAC5Cud,EAASF,EAAWjP,GAAW+L,GAAOvc,CAAK,EAE/C0f,EAASA,GAAUjQ,GAAUqB,GAAY4O,EACzCC,EAASA,GAAUlQ,GAAUqB,GAAY6O,EAEzC,IAAIC,EAAWF,GAAU5O,GACrB+O,EAAWF,GAAU7O,GACrBgP,EAAYJ,GAAUC,EAE1B,GAAIG,GAAavP,GAASnO,CAAM,EAAG,CACjC,GAAI,CAACmO,GAASvQ,CAAK,EACjB,MAAO,GAETwf,EAAW,GACXI,EAAW,EACb,CACA,GAAIE,GAAa,CAACF,EAChB,OAAAnC,IAAUA,EAAQ,IAAI/C,IACd8E,GAAY/M,GAAarQ,CAAM,EACnC+b,GAAY/b,EAAQpC,EAAO2D,EAAS4Z,EAAYC,EAAWC,CAAK,EAChEoB,GAAWzc,EAAQpC,EAAO0f,EAAQ/b,EAAS4Z,EAAYC,EAAWC,CAAK,EAE7E,GAAI,EAAE9Z,EAAUyZ,IAAuB,CACrC,IAAI2C,EAAeH,GAAY9iB,GAAe,KAAKsF,EAAQ,aAAa,EACpE4d,EAAeH,GAAY/iB,GAAe,KAAKkD,EAAO,aAAa,EAEvE,GAAI+f,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAe3d,EAAO,MAAM,EAAIA,EAC/C8d,EAAeF,EAAehgB,EAAM,MAAM,EAAIA,EAElD,OAAAyd,IAAUA,EAAQ,IAAI/C,IACf8C,EAAUyC,EAAcC,EAAcvc,EAAS4Z,EAAYE,CAAK,CACzE,CACF,CACA,OAAKqC,GAGLrC,IAAUA,EAAQ,IAAI/C,IACf4E,GAAald,EAAQpC,EAAO2D,EAAS4Z,EAAYC,EAAWC,CAAK,GAH/D,EAIX,CAEA,IAAO0C,GAAQZ,GCjEf,SAASa,GAAYljB,EAAO8C,EAAO2D,EAAS4Z,EAAYE,EAAO,CAC7D,OAAIvgB,IAAU8C,EACL,GAEL9C,GAAS,MAAQ8C,GAAS,MAAS,CAACjC,GAAab,CAAK,GAAK,CAACa,GAAaiC,CAAK,EACzE9C,IAAUA,GAAS8C,IAAUA,EAE/BmgB,GAAgBjjB,EAAO8C,EAAO2D,EAAS4Z,EAAY6C,GAAa3C,CAAK,CAC9E,CAEA,IAAO4C,GAAQD,GCvBXhD,GAAuB,EACvBC,GAAyB,EAY7B,SAASiD,GAAYle,EAAQuE,EAAQ4Z,EAAWhD,EAAY,CAC1D,IAAIjf,EAAQiiB,EAAU,OAClBhiB,EAASD,EACTkiB,EAAe,CAACjD,EAEpB,GAAInb,GAAU,KACZ,MAAO,CAAC7D,EAGV,IADA6D,EAAS,OAAOA,CAAM,EACf9D,KAAS,CACd,IAAIwE,EAAOyd,EAAUjiB,CAAK,EAC1B,GAAKkiB,GAAgB1d,EAAK,CAAC,EACnBA,EAAK,CAAC,IAAMV,EAAOU,EAAK,CAAC,CAAC,EAC1B,EAAEA,EAAK,CAAC,IAAKV,GAEnB,MAAO,EAEX,CACA,KAAO,EAAE9D,EAAQC,GAAQ,CACvBuE,EAAOyd,EAAUjiB,CAAK,EACtB,IAAI+D,EAAMS,EAAK,CAAC,EACZyL,EAAWnM,EAAOC,CAAG,EACrBoe,EAAW3d,EAAK,CAAC,EAErB,GAAI0d,GAAgB1d,EAAK,CAAC,GACxB,GAAIyL,IAAa,QAAa,EAAElM,KAAOD,GACrC,MAAO,OAEJ,CACL,IAAIqb,EAAQ,IAAI/C,GAChB,GAAI6C,EACF,IAAIjgB,EAASigB,EAAWhP,EAAUkS,EAAUpe,EAAKD,EAAQuE,EAAQ8W,CAAK,EAExE,GAAI,EAAEngB,IAAW,OACT+iB,GAAYI,EAAUlS,EAAU6O,GAAuBC,GAAwBE,EAAYE,CAAK,EAChGngB,GAEN,MAAO,EAEX,CACF,CACA,MAAO,EACT,CAEA,IAAOojB,GAAQJ,GCnDf,SAASK,GAAmBzjB,EAAO,CACjC,OAAOA,IAAUA,GAAS,CAACuC,GAASvC,CAAK,CAC3C,CAEA,IAAO0jB,GAAQD,GCJf,SAASE,GAAaze,EAAQ,CAI5B,QAHI9E,EAASoW,GAAKtR,CAAM,EACpB7D,EAASjB,EAAO,OAEbiB,KAAU,CACf,IAAI8D,EAAM/E,EAAOiB,CAAM,EACnBrB,EAAQkF,EAAOC,CAAG,EAEtB/E,EAAOiB,CAAM,EAAI,CAAC8D,EAAKnF,EAAO0jB,GAAmB1jB,CAAK,CAAC,CACzD,CACA,OAAOI,CACT,CAEA,IAAOwjB,GAAQD,GCdf,SAASE,GAAwB1e,EAAKoe,EAAU,CAC9C,OAAO,SAASre,EAAQ,CACtB,OAAIA,GAAU,KACL,GAEFA,EAAOC,CAAG,IAAMoe,IACpBA,IAAa,QAAcpe,KAAO,OAAOD,CAAM,EACpD,CACF,CAEA,IAAO4e,GAAQD,GCRf,SAASE,GAAYta,EAAQ,CAC3B,IAAI4Z,EAAYO,GAAana,CAAM,EACnC,OAAI4Z,EAAU,QAAU,GAAKA,EAAU,CAAC,EAAE,CAAC,EAClCS,GAAwBT,EAAU,CAAC,EAAE,CAAC,EAAGA,EAAU,CAAC,EAAE,CAAC,CAAC,EAE1D,SAASne,EAAQ,CACtB,OAAOA,IAAWuE,GAAU+Z,GAAYte,EAAQuE,EAAQ4Z,CAAS,CACnE,CACF,CAEA,IAAOW,GAAQD,GCbf,SAASE,GAAU/e,EAAQC,EAAK,CAC9B,OAAOD,GAAU,MAAQC,KAAO,OAAOD,CAAM,CAC/C,CAEA,IAAOgf,GAAQD,GCIf,SAASE,GAAQjf,EAAQsW,EAAM4I,EAAS,CACtC5I,EAAOJ,GAASI,EAAMtW,CAAM,EAM5B,QAJI9D,EAAQ,GACRC,EAASma,EAAK,OACdpb,EAAS,GAEN,EAAEgB,EAAQC,GAAQ,CACvB,IAAI8D,EAAMmW,GAAME,EAAKpa,CAAK,CAAC,EAC3B,GAAI,EAAEhB,EAAS8E,GAAU,MAAQkf,EAAQlf,EAAQC,CAAG,GAClD,MAEFD,EAASA,EAAOC,CAAG,CACrB,CACA,OAAI/E,GAAU,EAAEgB,GAASC,EAChBjB,GAETiB,EAAS6D,GAAU,KAAO,EAAIA,EAAO,OAC9B,CAAC,CAAC7D,GAAU0Q,GAAS1Q,CAAM,GAAK0N,GAAQ5J,EAAK9D,CAAM,IACvDG,GAAQ0D,CAAM,GAAK0N,GAAY1N,CAAM,GAC1C,CAEA,IAAOmf,GAAQF,GCTf,SAASG,GAAMpf,EAAQsW,EAAM,CAC3B,OAAOtW,GAAU,MAAQmf,GAAQnf,EAAQsW,EAAM0I,EAAS,CAC1D,CAEA,IAAOK,GAAQD,GCxBXpE,GAAuB,EACvBC,GAAyB,EAU7B,SAASqE,GAAoBhJ,EAAM+H,EAAU,CAC3C,OAAI3M,GAAM4E,CAAI,GAAKkI,GAAmBH,CAAQ,EACrCO,GAAwBxI,GAAME,CAAI,EAAG+H,CAAQ,EAE/C,SAASre,EAAQ,CACtB,IAAImM,EAAWuK,GAAI1W,EAAQsW,CAAI,EAC/B,OAAQnK,IAAa,QAAaA,IAAakS,EAC3CgB,GAAMrf,EAAQsW,CAAI,EAClB2H,GAAYI,EAAUlS,EAAU6O,GAAuBC,EAAsB,CACnF,CACF,CAEA,IAAOsE,GAAQD,GCzBf,SAASE,GAAavf,EAAK,CACzB,OAAO,SAASD,EAAQ,CACtB,OAAoCA,IAAOC,CAAG,CAChD,CACF,CAEA,IAAOwf,GAAQD,GCJf,SAASE,GAAiBpJ,EAAM,CAC9B,OAAO,SAAStW,EAAQ,CACtB,OAAOuW,GAAQvW,EAAQsW,CAAI,CAC7B,CACF,CAEA,IAAOqJ,GAAQD,GCYf,SAASE,GAAStJ,EAAM,CACtB,OAAO5E,GAAM4E,CAAI,EAAImJ,GAAarJ,GAAME,CAAI,CAAC,EAAIqJ,GAAiBrJ,CAAI,CACxE,CAEA,IAAOuJ,GAAQD,GClBf,SAASE,GAAahlB,EAAO,CAG3B,OAAI,OAAOA,GAAS,WACXA,EAELA,GAAS,KACJyD,GAEL,OAAOzD,GAAS,SACXwB,GAAQxB,CAAK,EAChBykB,GAAoBzkB,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,EACtCgkB,GAAYhkB,CAAK,EAEhB+kB,GAAS/kB,CAAK,CACvB,CAEA,IAAOilB,GAAQD,GIdf,SAASE,GAAQC,EAAQC,EAAMC,EAAOC,EAAY,CAChD,GAAI,CAACC,GAASJ,CAAM,EAClB,OAAOA,EAETC,EAAOI,GAASJ,EAAMD,CAAM,EAO5B,QALIM,EAAQ,GACRC,EAASN,EAAK,OACdO,EAAYD,EAAS,EACrBE,EAAST,EAENS,GAAU,MAAQ,EAAEH,EAAQC,GAAQ,CACzC,IAAIG,EAAMC,GAAMV,EAAKK,CAAK,CAAC,EACvBM,EAAWV,EAEf,GAAIQ,IAAQ,aAAeA,IAAQ,eAAiBA,IAAQ,YAC1D,OAAOV,EAGT,GAAIM,GAASE,EAAW,CACtB,IAAIK,EAAWJ,EAAOC,CAAG,EACzBE,EAAWT,EAAaA,EAAWU,EAAUH,EAAKD,CAAM,EAAI,OACxDG,IAAa,SACfA,EAAWR,GAASS,CAAQ,EACxBA,EACCC,GAAQb,EAAKK,EAAQ,CAAC,CAAC,EAAI,CAAC,EAAI,CAAC,EAE1C,CACAS,GAAYN,EAAQC,EAAKE,CAAQ,EACjCH,EAASA,EAAOC,CAAG,CACrB,CACA,OAAOV,CACT,CAEA,IAAOgB,GAAQjB,GCrCf,SAASkB,GAAWjB,EAAQkB,EAAOC,EAAW,CAK5C,QAJIb,EAAQ,GACRC,EAASW,EAAM,OACfE,EAAS,CAAC,EAEP,EAAEd,EAAQC,GAAQ,CACvB,IAAIN,EAAOiB,EAAMZ,CAAK,EAClBJ,EAAQmB,GAAQrB,EAAQC,CAAI,EAE5BkB,EAAUjB,EAAOD,CAAI,GACvBe,GAAQI,EAAQf,GAASJ,EAAMD,CAAM,EAAGE,CAAK,CAEjD,CACA,OAAOkB,CACT,CAEA,IAAOE,GAAQL,GCvBXM,GAAoB,GAmCpBC,GAAUC,GAAS,SAASC,EAAMC,EAAU,CAC9C,IAAIC,EAAUC,GAAeF,EAAUG,GAAUN,EAAO,CAAC,EACzD,OAAOO,GAAWL,EAAMH,GAAmB,OAAWI,EAAUC,CAAO,CACzE,CAAC,EAGDJ,GAAQ,YAAc,CAAC,EAEvB,IAAOQ,GAAQR,GCrCf,SAASS,GAASjC,EAAQkB,EAAO,CAC/B,OAAOI,GAAWtB,EAAQkB,EAAO,SAAShB,EAAOD,EAAM,CACrD,OAAOiC,GAAMlC,EAAQC,CAAI,CAC3B,CAAC,CACH,CAEA,IAAOkC,GAAQF,GCEXG,GAAOC,GAAS,SAASrC,EAAQkB,EAAO,CAC1C,OAAOlB,GAAU,KAAO,CAAC,EAAImC,GAASnC,EAAQkB,CAAK,CACrD,CAAC,EAEMoB,GAAQF,GCrBXG,GAAmB,WACnBC,GAAkBD,GAAmB,EAGrCE,GAAc,KAAK,MACnBC,GAAY,KAAK,IAerB,SAASC,GAAkBC,EAAO1C,EAAO2C,EAAUC,EAAY,CAC7D,IAAIC,EAAM,EACNC,EAAOJ,GAAS,KAAO,EAAIA,EAAM,OACrC,GAAII,IAAS,EACX,MAAO,GAGT9C,EAAQ2C,EAAS3C,CAAK,EAMtB,QALI+C,EAAW/C,IAAUA,EACrBgD,EAAYhD,IAAU,KACtBiD,EAAcC,GAASlD,CAAK,EAC5BmD,EAAiBnD,IAAU,OAExB6C,EAAMC,GAAM,CACjB,IAAIM,EAAMb,IAAaM,EAAMC,GAAQ,CAAC,EAClCO,EAAWV,EAASD,EAAMU,CAAG,CAAC,EAC9BE,EAAeD,IAAa,OAC5BE,EAAYF,IAAa,KACzBG,EAAiBH,IAAaA,EAC9BI,EAAcP,GAASG,CAAQ,EAEnC,GAAIN,EACF,IAAIW,EAASd,GAAcY,OAClBL,EACTO,EAASF,IAAmBZ,GAAcU,GACjCN,EACTU,EAASF,GAAkBF,IAAiBV,GAAc,CAACW,GAClDN,EACTS,EAASF,GAAkBF,GAAgB,CAACC,IAAcX,GAAc,CAACa,GAChEF,GAAaE,EACtBC,EAAS,GAETA,EAASd,EAAcS,GAAYrD,EAAUqD,EAAWrD,EAEtD0D,EACFb,EAAMO,EAAM,EAEZN,EAAOM,CAEX,CACA,OAAOZ,GAAUM,EAAMR,EAAe,CACxC,CAEA,IAAOqB,GAAQlB,GCtCf,SAASmB,GAAclB,EAAO1C,EAAO2C,EAAU,CAC7C,OAAOgB,GAAkBjB,EAAO1C,EAAO6D,GAAalB,EAAU,CAAC,CAAC,CAClE,CAEA,IAAOmB,GAAQF,GC3BXG,GAAW,IASXC,GAAcC,IAAQ,EAAIC,GAAW,IAAID,GAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAMF,GAAmB,SAASI,EAAQ,CAClG,OAAO,IAAIF,GAAIE,CAAM,CACvB,EAF4EC,GGE5E,GAAM,CAAE,KAAAC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,EAExDC,GAAoB,CAACC,EAAcC,EAAcC,EAAsB,QACnFA,IAAQ,MACLF,EAAK,cAAcC,EAAM,OAAO,EAChCA,EAAK,cAAcD,EAAM,OAAO,EACvBG,GAAiB,CAACC,EAAgBC,EAAcC,IACrDC,GAAS,WAAWC,GAAKH,EAAMD,CAAI,EAAGI,GAAKF,EAAMF,CAAI,CAAC,EAGjDK,GAAqB,CAACC,EAAcC,EAAcT,EAAsB,QAAUH,GAAkBW,EAAK,GAAIC,EAAK,GAAIT,CAAG,EACzHU,GAAuBC,GAAQV,GAAgB,CAAC,KAAM,IAAI,CAAC,EAGjE,SAASW,GAAgBC,EAAuBb,EAAsB,MAAO,CACnF,OAAOa,EAAY,KAAK,CAACC,EAAGC,IAAMR,GAAmBO,EAAGC,EAAGf,CAAG,CAAC,CAChE,CACO,IAAMgB,GAAa,CAACC,EAAaC,IAAyBC,GAAS,IAAI,KAAKF,EAAI,EAAE,EAAG,IAAI,KAAKC,EAAa,EAAE,CAAC,EAI9G,IAAME,GAA0BC,GAA0B,CAChE,IAAMC,EAAS,IAAI,IACnB,QAAWC,KAAWF,EAAa,CAClC,GAAI,CAACE,EACJC,MAAAA,GAAM,yBAA0BH,CAAW,EACrC,IAAI,MAAM,wBAAwB,EAEzC,IAAMI,EAAMF,EAAQ,IAChBD,EAAO,IAAIG,CAAG,EACjBC,GAAQ,6BAA8B,CAACJ,EAAO,IAAIG,CAAG,EAAGF,CAAO,CAAC,EAEhED,EAAO,IAAIG,EAAKF,CAAO,CAEzB,CACA,OAAO,MAAM,KAAKD,EAAO,OAAO,CAAC,CAClC,EAaO,SAASK,GAAWC,EAAqB,CAC/C,OAAO,OAAOA,GAAM,UAAYA,EAAE,WAAW,GAAG,CACjD,CACO,SAASC,GAAgCC,EAAa,CAC5D,OAAOA,EAAI,MAAM,CAAC,CACnB,CAoBO,SAASC,GAAyBC,EAA8BC,EAA0B,CAChG,IAAIC,EAAkB,CAAC,EACjBC,EAAkC,CAAC,EACzC,OAAW,CAACC,EAAYC,CAAY,IAAK,OAAO,QAAQL,CAAO,EAC9D,GAAIM,GAAWD,CAAY,EAAG,CAC7B,IAAME,EAAUC,GAAgCH,CAAY,EACtDI,EAAiBR,EAAUM,CAAO,EACpCE,EACHN,EAAWC,CAAU,EAAIK,EAGzBP,EAAgBE,CAAU,EAAIG,CAEhC,MACCJ,EAAWC,CAAU,EAAIC,EAI3B,MAAO,CAACF,EAAYD,CAAe,CACpC,CAcO,SAASQ,GAAgBC,EAAqBC,EAA0CC,EAAgC,CAE9H,IAAIC,EACJ,GAAIF,EAAa,CAChB,IAAMG,EAAM,OAAOH,EACfG,IAAQ,SACXD,EAASF,IAAgBC,EACfE,IAAQ,WAClBD,EAAUF,EAAyBC,CAAQ,EACjC,OAAQD,EAAoB,KAAQ,WAC9CE,EAAUF,EAAyB,IAAIC,CAAQ,EACrC,MAAM,QAAQD,CAAW,GAAK,CAAC,MAAM,QAAQC,CAAQ,EAC/DC,EAASF,EAAY,SAASC,CAAQ,EAKtCC,EAASF,IAAgBC,CAE3B,MACCC,EAASF,IAAgBC,EAI1B,OAAIF,EAAM,OAAO,CAAC,IAAM,IAChB,CAACG,EAEDA,CAET,CA2CA,IAAME,GAAM,SAAaC,EAAiB,CAEzC,QADIC,EAAM,EACDC,EAAI,EAAGC,EAAIH,EAAM,OAAQE,EAAIC,EAAGD,IAAKD,GAAOD,EAAME,CAAC,EAC5D,OAAOD,CACR,EACMG,GAAO,SAAcJ,EAAiB,CAC3C,OAAOD,GAAIC,CAAK,EAAIA,EAAM,MAC3B,EACaK,GAAW,CACvB,IAAK,SAASL,EAAiB,CAC9B,OAAO,KAAK,IAAI,MAAM,KAAMA,CAAK,CAClC,EAEA,IAAK,SAASA,EAAiB,CAC9B,OAAO,KAAK,IAAI,MAAM,KAAMA,CAAK,CAClC,EAEA,MAAO,SAASA,EAAiB,CAChC,OAAOK,GAAS,IAAIL,CAAK,EAAIK,GAAS,IAAIL,CAAK,CAChD,EAEA,SAAU,SAASA,EAAiB,CACnC,OAAOK,GAAS,MAAML,CAAK,EAAI,CAChC,EAEA,IAAAD,GAEA,KAAAK,GAEA,QAASA,GAET,OAAQ,SAASJ,EAAiB,CACjCA,EAAM,KAAK,SAASM,EAAGC,EAAG,CACzB,OAAOD,EAAIC,CACZ,CAAC,EACD,IAAIC,EAAMR,EAAM,OAAS,EACzB,OAAOQ,EAAM,EAAIR,EAAMQ,EAAM,EAAG,GAAKR,EAAMQ,EAAM,CAAC,EAAIR,EAAMQ,CAAG,GAAK,CACrE,EAEA,MAAO,SAASR,EAAiB,CAChC,GAAI,CAACA,EAAM,OAAQ,MAAO,CAAC,EAC3B,IAAIS,EAAU,CAAC,EACdC,EAAW,EACXC,EAAQ,CAAC,EAEV,OAAAX,EAAM,QAAQ,SAASY,EAAK,CACtBH,EAAQG,CAAG,EACXH,EAAQG,CAAG,IADGH,EAAQG,CAAG,EAAI,EAG9BH,EAAQG,CAAG,EAAIF,GAClBC,EAAQ,CAACC,CAAG,EACZF,EAAWD,EAAQG,CAAG,GACZH,EAAQG,CAAG,IAAMF,IAC3BC,EAAM,KAAKC,CAAG,EACdF,EAAWD,EAAQG,CAAG,EAExB,CAAC,EACMD,CACR,EAEA,SAAU,SAASX,EAAiB,CACnC,IAAII,EAAOC,GAAS,KAAKL,CAAK,EAC9B,OAAOK,GAAS,KAAKL,EAAM,IAAI,SAASC,EAAK,CAC5C,OAAO,KAAK,IAAIA,EAAMG,EAAM,CAAC,CAC9B,CAAC,CAAC,CACH,EAEA,kBAAmB,SAASJ,EAAiB,CAC5C,OAAO,KAAK,KAAKK,GAAS,SAASL,CAAK,CAAC,CAC1C,EAEA,sBAAuB,SAASA,EAAiB,CAChD,IAAII,EAAOC,GAAS,KAAKL,CAAK,EAC9B,OAAOK,GAAS,KAAKL,EAAM,IAAI,SAASC,EAAK,CAC5C,OAAO,KAAK,IAAIA,EAAMG,CAAI,CAC3B,CAAC,CAAC,CACH,EAEA,QAAS,SAASJ,EAAiB,CAClC,IAAII,EAAOC,GAAS,KAAKL,CAAK,EAC1Ba,EAAoBR,GAAS,kBAAkBL,CAAK,EACxD,OAAOA,EAAM,IAAI,SAASC,EAAK,CAC9B,OAAQA,EAAMG,GAAQS,CACvB,CAAC,CACF,CACD,EAGAR,GAAS,QAAUA,GAAS,KAYrB,IAAMS,GAAa,SACzBC,EACAC,EAAO,GACPC,EACC,CACD,GAAI,CAACF,GAAK,OACT,MAAM,IAAI,MAAM,iBAAiBA,CAAG,EAAE,EAGvC,IAAIG,EAAK,WAAaF,EAClBG,EAAK,WAAaH,EACtB,QAASI,EAAI,EAAGC,EAAID,EAAIL,EAAI,OAAQK,IACnCC,EAAKN,EAAI,WAAWK,CAAC,EACrBF,EAAK,KAAK,KAAKA,EAAKG,EAAI,UAAU,EAClCF,EAAK,KAAK,KAAKA,EAAKE,EAAI,UAAU,EAEnC,OAAAH,EAAK,KAAK,KAAKA,EAAMA,IAAO,GAAK,UAAU,EAAI,KAAK,KAAKC,EAAMA,IAAO,GAAK,UAAU,EACrFA,EAAK,KAAK,KAAKA,EAAMA,IAAO,GAAK,UAAU,EAAI,KAAK,KAAKD,EAAMA,IAAO,GAAK,UAAU,GAEtE,YAAc,QAAUC,IAAOD,IAAO,IAAI,SAAS,EAAE,EACvD,MAAM,CAACD,CAAS,EAAE,SAASA,EAAW,GAAG,CAIvD,EAiBO,SAASK,IAAqB,CAEpC,OADY,IAAI,KAAK,EACV,YAAY,CACxB,CClUA,GAAM,CAAE,KAAAC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,EAE9D,SAASC,GAA6BC,EAAoCC,EAAqB,CACrG,IAAMC,EAAKV,GAAW,EAEhBW,EAAgBF,EAKtB,OAHeD,EAAgB,IAAII,GAC3BC,GAAwBD,EAAK,CAAE,GAAAF,EAAI,YAAaC,CAAc,CAAC,CACtE,CAEF,CAKO,SAASG,GACfC,EACA,CAAE,GAAAC,EAAI,YAAAC,CAAY,EAA2D,CAAC,EAC7E,CACD,IAAMC,EAAYC,GAAOJ,EAAKC,GAAMI,GAAW,CAAC,EAC1CC,EAAYC,GAAWJ,EAAWD,CAAW,EAC7CM,EAAMC,GAAsBH,CAAS,EAAE,SAAS,EACjDN,EAAe,KAAQA,EAAe,MAAQQ,GAAKE,GAAK,kDAAmD,CAAE,IAAAV,EAAK,IAAAQ,EAAK,UAAAF,CAAU,CAAC,EACvI,IAAMK,EAAa,CAAE,GAAGL,EAAW,IAAAE,CAAI,EACvC,GAAI,CAACI,GAAcD,CAAU,EAC5B,MAAME,GAAM,gBAAgB,KAAK,UAAUF,CAAU,CAAC,GAAIG,GAAoBH,CAAU,CAAC,EAE1F,OAAO,OAAO,OAAOA,CAAU,CAChC,CAKO,SAASI,GAAMC,EAA8E,CACnG,MAAO,CAAC,CAACA,EAAI,EACd,CACO,SAASC,GAAMD,EAA+D,CACpF,MAAO,CAAC,CAACA,EAAI,EACd,CAEO,SAASE,GAAOF,EAAsBG,EAAe,CAC3D,OAAOJ,GAAMC,CAAG,EAAIA,EAAM,CAAE,GAAGA,EAAK,GAAAG,CAAG,CACxC,CACO,SAASC,GAAWJ,EAAmCK,EAAuC,CACpG,GAAIL,EAAI,KAAO,OAAW,OAAOA,EACjC,GAAKK,EAGE,CACN,GAAM,CAAE,GAAAC,EAAI,GAAAC,CAAG,EAAIP,EACbQ,EAAUH,EAAO,SAASI,GAAKA,EAAE,IAAMH,GAAMG,EAAE,IAAMF,CAAE,EAK7D,GAAIG,GAAe,CAAC,KAAM,KAAM,KAAM,KAAM,IAAI,EAAGV,EAAKQ,CAAO,EAC9D,MAAMG,GAAM,iCAAkC,CAAE,IAAAX,EAAK,GAAIQ,EAAS,OAAAH,CAAO,CAAC,EAK3E,IAAMO,GAAcZ,EAAI,KAAO,OAAYA,EAAI,GAAKQ,GAAS,MAAQ,KACrE,MAAO,CAAE,GAAGR,EAAK,GAAIY,CAAW,CACjC,KAlBa,CACZ,GAAI,CAACX,GAAMD,CAAG,EAAG,MAAMW,GAAM,oCAAqCX,CAAG,EACrE,OAAOA,CACR,CAgBD,CACO,SAASa,GAAYC,EAAgC,CAC3D,IAAMC,EAAW,KAChBC,GAAU,IAAOF,EAAQ,OAAS,GAAMG,GAAM,0BAA0BH,EAAQ,MAAM,EAAE,CAAC,EAClFI,GACNC,GAAuBL,EAAQ,QAAQM,GAAK,CAC3C,IAAMC,EAAOD,EAAE,QACf,GAAI,CAACC,EACJV,MAAAA,GAAM,0BAA2BS,CAAC,EAC5B,IAAI,MAAM,yBAAyB,EAE1C,OAAOC,CACR,CAAC,CAAC,CACH,GAEGC,EAAqBN,GAAU,IAAMD,EAAS,CAAC,EAC7CQ,EAAiCC,GAAO,SAASC,EAAOC,EAAc,CAC3E,OAAIC,GAAYF,CAAK,EACb,CAAE,KAAMT,GAAU,IAAMD,EAAS,CAAC,CAAE,EAGpC,CAEN,MAAOU,EAAM,MAAM,OAAOG,GAAY,CAAC,KAAK,UAAUA,EAAU,EAAI,CAAC,EACrE,QAASH,EAAM,SAAS,OAAOI,GAKvB,CAJmB,CAAC,KAAK,QAAQ,KAAKC,GACxCA,IAAWJ,EAAqB,GAC7BI,EAAO,UAAUD,EAAY,EAAI,CACxC,CAED,CACF,CAEF,CAAC,EACD,OAAO,IAAIE,GACVf,GAAU,IAAM,UAAUF,EAAQ,IAAIM,GAAKA,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG,EAChEN,EACA,CAAC,GAAG,EACJQ,EACAC,CACD,CACD,CCrHA,GAAM,CAAE,KAAAS,GAAM,IAAAC,GAAK,MAAAhB,GAAO,QAAAiB,GAAS,MAAAvB,EAAM,EAAIwB,GAAO,MAAMA,GAAO,IAAI,EAMxDJ,GAAN,MAAMK,WAAqBC,EAAO,CAcxC,YACUC,EACTC,EACAC,EACSC,EACDC,EACAC,EAAkC,KACzC,CAED,MACCL,EACAC,EACAC,EACAE,EACCE,GAAW,MAAM,CAAC,GAAGH,CAAY,EAAG,CAAE,KAAM,GAAO,KAAM,GAAGH,CAAI,QAAS,CAAC,EACxEG,CACJ,EAfS,KAAA,KAAAH,EAGA,KAAA,aAAAG,EACD,KAAA,aAAAC,EACA,KAAA,aAAAC,EAYRE,GAAe,KAAM,CAEpB,eAAgBrB,EACjB,CAAC,EAEGkB,GACH,KAAK,mBAAmB,CAE1B,CAvCA,OAAO,UAAUZ,EAAgBQ,EAAcQ,EAA2B,CACzE,OAAO,IAAIV,GACV,GAAGE,CAAI,IAAIR,EAAO,oBAAoB,IACtCA,EACAA,EAAO,QAEPA,EAAO,SACP,KACAgB,CACD,CACD,CACQ,qBAAkD,KA8BnD,OAAOC,EAAoC,CACjD,IAAMC,EAAS,KAAK,aAAe,KAAK,aAAaD,CAAe,EAAIA,EACxE,GAAI,OAAK,cAAgB,CAACC,GAC1B,OAAO,KAAK,QAAQ,QAAQlB,GAAUA,EAAO,OAAOkB,CAAM,CAAC,CAC5D,CACO,UAAUD,EAA2B,CAC3C,IAAMC,EAAS,KAAK,aAAe,KAAK,aAAaD,CAAe,EAAIA,EACxE,GAAI,OAAK,cAAgB,CAACC,GAC1B,OAAO,KAAK,QAAQ,QAAQlB,GAAUA,EAAO,UAAUkB,CAAkB,CAAC,CAC3E,CAEQ,oBAAqB,CAC5B,KAAK,qBAAuB,IAAI,IAChC,IAAMC,EAAkBC,GAAQ,IAAM,CAChC,KAAK,QAAQ,QACjBlB,GAAK,8BAA+B,IAAI,EAKzCE,GAAQ,kBAAkB,KAAK,IAAI,4BAA6B,KAAK,QAAQ,IAAIiB,GAAKA,EAAE,IAAI,CAAC,EAE7F,IAAMC,EAAS,IAAI,IAAI,CAAC,GAAG,KAAK,qBAAqB,KAAK,CAAC,CAAC,EAC5D,QAAWD,KAAK,KAAK,QAAS,CACfC,EAAO,OAAOD,CAAC,GAChBjB,GAAQ,kBAAkB,KAAK,IAAI,8BAA+BiB,EAAE,oBAAoB,EACrGjB,GAAQ,kBAAkB,KAAK,IAAI,sBAAuBiB,EAAE,oBAAoB,EAChF,IAAME,EAAM,KAAK,eAAe,KAAK,KAAMF,CAAC,EACtCG,EAAcH,EAAE,UAAUE,CAAG,EACnC,KAAK,qBAAqB,IAAIF,EAAGG,CAAW,CAC7C,CACA,QAAWH,KAAKC,EACflB,GAAQ,kBAAkB,KAAK,IAAI,mCAAoCiB,EAAE,oBAAoB,EAC3E,KAAK,qBAAqB,IAAIA,CAAC,EACrC,EACZ,KAAK,qBAAqB,OAAOA,CAAC,CAEpC,CAAC,CAcF,CAEA,UAAUI,EAAwC,CACjD,OAAK,KAAK,sBACT,KAAK,mBAAmB,EAElB,MAAM,UAAUA,CAAQ,CAChC,CAOA,cAAe,CACd,GAAI,CAAC,KAAK,aAAc,MAAM5C,GAAM,0DAA2D,KAAK,oBAAoB,EACxHM,GAAM,gBAAgB,KAAK,oBAAoB,gBAAgB,EAC3D,KAAK,QAAQ,SAAW,GAC3Be,GAAK,gBAAgB,KAAK,oBAAoB,mCAAmC,KAAK,QAAQ,MAAM,uBAAuB,EAE5H,KAAK,QAAQ,QAAQmB,GAAK,CACzB,KAAK,eAAeA,EAAG,CAAE,KAAMnC,GAAU,IAAMwC,GAAKL,EAAE,OAAO,CAAC,CAAE,CAAC,CAClE,CAAC,CACF,CAEU,eAAe9C,EAAgBoB,EAAoB,CAC5DS,GAAQ,gBAAgB,KAAK,oBAAoB,iBAAkBT,CAAK,EACxE,IAAMgC,EAAY,KAAK,aAAe,KAAK,aAAahC,EAAOpB,CAAM,EAAIoB,EACzE,GAAI,KAAK,aAER,GADAS,GAAQ,gBAAgB,KAAK,oBAAoB,2BAA4BuB,CAAS,EAClF9B,GAAY8B,CAAS,EACtB,KAAK,SAAsC,QAAQ,CAAC,GAAGA,EAAU,IAAI,CAAC,MAClE,CACN,QAAWzD,KAAOyD,EAAU,MAE3B,KAAK,SAAS,OAAOC,GAAc,KAAK,SAAU1D,EAAK,IAAI,EAAG,EAAGA,CAAG,EAErE,GAAIyD,EAAU,SACb,QAAWE,KAAYF,EAAU,QAChC,GAAI,CAAE,KAAK,SAAsC,OAAOE,CAAQ,EAC/D,GAAI,CAAChC,GAAYF,CAAK,GAAKA,EAAM,SAAS,SAASkC,CAAQ,EAC1D1C,GAAM,uFAAwF0C,EAAUlC,CAAK,MAE7G,OAAMd,GAAM,gBAAgB,KAAK,IAAI,8CAA+CgD,EAAU,CAC7F,OAAQ,KACR,MAAAlC,EACA,UAAAgC,CACD,CAAC,EAKN,CAEDvB,GAAQ,gBAAgB,KAAK,oBAAoB,0BAA2B0B,GAAkB,KAAK,QAAQ,CAAC,EAC5G,KAAK,kBAAkBH,CAAS,CACjC,CACA,IAAI,UAAW,CACd,MAAO,EACR,CACD,EChJM,CAAE,KAAAzB,GAAM,IAAAC,GAAK,MAAAhB,GAAO,QAAAiB,GAAS,MAAAvB,EAAM,EAAIwB,GAAO,MAAMA,GAAO,IAAI,EAExD0B,GAAgBC,GAAsB,gBAAiB,SACnEzD,EACA0D,EACAC,EAAoD,CAAC,EACpD,CACD,IAAIC,EAAmBC,GAAoBH,CAAO,EAC9CI,EAASC,GAAWH,CAAgB,EAGlCI,EAAgBzB,GAAW,MAChC5B,GAAU,UAAiD,CAC1D,OAAOmD,EAAO9D,EAAO,OAAO,CAC7B,CAAC,EACD,CAAE,KAAM,GAAO,KAAM,GAAGA,EAAO,IAAI,MAAM2D,EAAK,MAAQ,uBAAuBM,GAAUL,CAAgB,CAAC,GAAG,EAAG,CAC/G,EACMM,EAAwC9C,GAAU,CACvD,IAAI+C,EACJ,OAAI7C,GAAYF,CAAK,EACpB+C,EAAc,CAAE,KAAML,EAAO1C,EAAM,IAAI,CAAE,EAEzC+C,EAAc,CACb,MAAOL,EAAO1C,EAAM,KAAK,EACzB,QAASA,EAAM,OAChB,EAEDS,GACC,iBAAiB7B,EAAO,oBAAoB,MAAM2D,EAAK,KAAO,KAAKA,EAAK,IAAI,KAAO,EAAE,gBACrFC,EACAxC,EACA,KACA+C,CACD,EAGOA,CACR,EACMC,EAAe,IAAI1C,GACxB,GAAG1B,EAAO,IAAI,MAAM2D,EAAK,MAAQ,iBAAiBM,GAAUL,CAAgB,CAAC,GAAG,GAChF5D,EACA,CAAC,GAAGA,EAAO,QAAS,GAAI2D,EAAK,gBAAkB,CAACA,EAAK,eAAe,EAAI,CAAC,CAAE,EAC3EK,EACAE,CACD,EAGMG,EAAwBC,GAC7B,IAAMnB,GAAKO,CAAO,EACjBa,GAAQ,CACR1C,GACC,iBAAiB7B,EAAO,oBAAoB,IAAI2D,EAAK,KAAO,KAAKA,EAAK,IAAI,IAAM,EAAE,iBAClFC,EACA,KACAW,CACD,EACAX,EAAmBW,EACnBT,EAASC,GAAWH,CAAgB,EACpCQ,EAAa,aAAa,CAC3B,CACD,EAEMI,EAAuBC,GAAmBT,EAAe,IAAM,CACpEnC,GAAQ,iBAAiBlB,GAAU,IAAMX,EAAO,IAAI,CAAC,IAAI2D,EAAK,KAAO,KAAKA,EAAK,IAAI,IAAM,EAAE,aAAcC,CAAgB,EACzHS,EAAsB,EACtBG,EAAqB,CACtB,CAAC,EAED,OAAOJ,CACR,EAAG,CACF,OAAQM,GACR,cAAe,CAAC1E,EAAQ0D,EAASC,IAASgB,GAAgB,CAAE,OAAQ,gBAAiB,OAAA3E,EAAQ,QAAA0D,EAAS,KAAMC,CAAK,CAAC,CACnH,CAAC,EAEYiB,GAAgBnB,GAAsB,gBAAiB,SACnEzD,EACAkB,EACAyC,EAAoD,CAAC,EACpD,CACD,IAAMkB,EAAmBlE,GAAU,IAAMO,EAAY,KAAK,KAAM,CAAE,KAAMlB,EAAO,OAAQ,EAAGA,CAAM,CAAC,EACjG,GAAI,CAACsB,GAAYuD,CAAgB,EAChC,MAAMvE,GAAM,oCAAoC,EAEjD,IAAMwE,EAAcD,EAAiB,KAErC,OAAO,IAAInD,GACV,GAAG1B,EAAO,IAAI,MAAM2D,EAAK,MAAQ,eAAe,GAChD3D,EACA,CAAC,GAAGA,EAAO,QAAS,GAAI2D,EAAK,gBAAkB,CAACA,EAAK,eAAe,EAAa,CAAC,CAAW,EAE7FmB,EACA5D,CACD,CACD,EAAG,CACF,OAAQwD,GACR,cAAe,CAAC1E,EAAQ+E,EAASpB,IAASgB,GAAgB,CAAE,OAAQ,gBAAiB,OAAA3E,EAAQ,KAAM2D,CAAK,CAAC,CAC1G,CAAC,EAEYqB,GAAavB,GACzB,aACA,SACCzD,EACAiF,EACA/D,EACAyC,EAA0B,CAAC,EAC1B,CAED,IAAMuB,EAAoB/D,GAAOD,CAAW,EAC5C,OAAAgE,EAAkB,CAAE,KAAMlF,EAAO,OAAQ,EAAGiF,CAAG,EAC/CjF,EAAO,UAAUoB,GAAS,CACzB8D,EAAkB9D,EAAO6D,CAAG,CAC7B,CAAC,EAEMA,CACR,EACA,CAAE,cAAe,CAACjF,EAAQmF,EAAMJ,EAASpB,IAAS,cAAc3D,EAAO,oBAAoB,GAAG2D,GAAM,KAAO,MAAMA,GAAM,IAAI,GAAK,EAAE,GAAI,CACvI,EAwBaE,GAAsB,SAClCH,EACC,CACD,IAAME,EAAmBjD,GAAU,UAAiC,CACnE,OAAO,OAAO,YAAY,OAAO,QAAQwC,GAAKO,CAAO,CAAC,EAAE,IAAI,CAAC,CAAC0B,EAAGC,CAAC,IAAM,CAAClC,GAAKiC,CAAC,EAAGjC,GAAKkC,CAAC,CAAC,CAAC,CAAC,CAC5F,CAAC,EACD,GAAI,CAAC,OAAO,QAAQzB,CAAgB,EAAE,OACrC,MAAM,IAAI,MAAM,kBAAkB,EAEnC,OAAOA,CACR,EACO,SAASG,GACfL,EACC,CACD,OAAO,SAAoB1C,EAAyB,CACnD,OAAOA,EAAK,OAAO,SAA6BsE,EAAQ,CACvD,QAAWC,KAAS,OAAO,KAAK7B,CAAO,EAAG,CACzC,IAAI8B,EAAe9B,EAAQ6B,CAAK,EAChC,GAAIC,IAAiB,OAAW,SAChC,IAAMC,EAAcH,EAAOC,EAAM,WAAW,GAAG,EAAIA,EAAM,MAAM,CAAC,EAAIA,CAAK,EAEzE,GAAI,CAACG,GAAgBH,EAD4BC,EACQC,CAAW,EACnE,MAAO,EAET,CACA,MAAO,EACR,CAAC,CACF,CACD,CCtLA,GAAM,CAAE,KAAAE,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,EAE/CC,GAAf,cAAuCC,EAAO,CACpD,YACCC,EAEAC,EAAoB,CAAC,EACrBC,EACC,CACD,MAAMF,EAAM,KAAME,EAASD,CAAO,EAElCE,GAAe,KAAM,CAErB,CAAC,CACF,CAEO,MAAMC,EAA0B,CACtC,IAAMC,EAAc,KAAK,QAAQ,OAEjC,YAAK,SAAW,KAAK,QAAQ,OAAOC,GAAK,CAAEF,EAAY,SAASE,EAAI,GAAG,CAAE,EAClED,EAAc,KAAK,QAAQ,MACnC,CACO,OAAOE,EAAoC,CACjD,IAAMC,EAASC,GAA6BF,EAAiB,IAAI,EACjE,OAAO,KAAK,UAAUC,CAAM,CAC7B,CAEO,UAAUD,EAA2B,CAC3C,IAAMG,EAAeC,GAAuBJ,CAAe,EAC3D,GAAIG,EAAa,SAAWH,EAAgB,OAC3C,MAAMX,GAAM,yCAAyCW,EAAgB,OAASG,EAAa,MAAM,GAAI,CACpG,gBAAAH,EACA,aAAAG,CACD,CAAC,EAGF,IAAME,EAAQL,EAAgB,OAAOD,GAAO,CAACO,GAAcP,CAAG,CAAC,EAC/D,GAAIM,EAAM,OACT,MAAMhB,GAAM,qCAAqCgB,EAAM,MAAM,GAAI,CAAE,MAAAA,CAAM,CAAC,EAG3E,IAAME,EAAWP,EAAgB,OAAOD,GAAO,KAAK,UAAUA,EAAK,EAAK,CAAC,EACzE,GAAIQ,EAAS,OACZ,MAAMlB,GAAM,gDAAgDkB,EAAS,MAAM,GAAI,CAAE,SAAAA,CAAS,CAAC,EAG5F,GAAI,CAACP,EAAgB,OAAQ,CAC5Bf,GAAK,oDAAoD,EACzD,MACD,EAEE,CAAC,KAAK,YAAc,EAAE,gBAAgBuB,IAAkBtB,GAAMC,IAC/D,aACAa,EAAgB,SAAW,EAAIA,EAAgB,CAAC,EAAIA,EACpD,CAAE,GAAI,IAAK,CACZ,EACAS,GAAgBT,CAAe,EAC/B,IAAMU,EAAa,KAAK,SAAS,QAAUC,GAAWX,EAAgB,CAAC,EAAG,KAAK,SAAS,KAAK,SAAS,OAAS,CAAC,CAAC,EACjH,YAAK,SAAS,KAAK,GAAGA,CAAe,EACjCU,GACHD,GAAgB,KAAK,QAAQ,EAE9B,KAAK,kBAAkB,CAAE,MAAOT,EAAiB,QAAS,IAAK,CAAC,EAG3D,KAAK,QAAQA,CAAe,EAC1BA,CACR,CAEA,IAAI,UAAW,CACd,MAAO,EACR,CAGD,EACaQ,GAAN,MAAMI,WAAuBrB,EAAgB,CAQnD,YACCE,EACAC,EACAC,EACSkB,EACR,CACD,MAAMpB,EAAMC,EAASC,CAAO,EAFnB,KAAA,UAAAkB,EAITjB,GAAe,KAAM,CAEpB,SAAUkB,GAAW,OACtB,CAAC,CACF,CAnBA,OAAO,MAAMrB,EAAe,CAC3B,OAAOmB,GAAe,UAAU,CAAC,EAAGnB,GAAQ,kBAAmB,EAAK,CACrE,CACA,OAAO,UAAUC,EAAmBD,EAAesB,EAAW,GAAO,CACpE,OAAO,IAAIH,GAAenB,GAAQ,YAAaC,EAAS,CAAC,EAAGqB,CAAQ,CACrE,CAgBA,IAAI,UAAW,CACd,OAAO,KAAK,SACb,CAEA,MAAgB,QAAQC,EAAgB,CAEvC,GADA5B,GAAQ,iCAAkC4B,CAAI,EAC1C,KAAK,SACR,MAAM3B,GAAM,sCAAsC,CAEpD,CACD,ECxGM,CAAE,KAAAJ,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,ECJrE,GAAM,CAAE,KAAA2B,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,ECiF9D,SAASC,GAAiBC,EAAqB,CACrD,OAAOC,GAAWD,EAAa,GAAI,CAAC,CACrC,CClFO,IAAME,GAAN,KAAgB,CACtB,YACUC,EACAC,EACAC,EAA6B,KACrC,CAHQ,KAAA,eAAAF,EACA,KAAA,UAAAC,EACA,KAAA,SAAAC,EAETC,GAAe,KAAM,CACpB,cAAeC,EAChB,CAAC,CACF,CACA,IAAI,QAAS,CACZ,OAAO,KAAK,SACb,CAEA,IAAI,eAAgB,CACnB,OAAK,KAAK,SACHC,GAAY,CAClB,KAAK,eACL,KAAK,SAAS,aACf,CAAC,EAJ0B,KAAK,cAKjC,CACA,IAAI,WAAY,CACf,OAAO,KAAK,cAAc,OAC3B,CACD,EAIaC,GAAN,KAAkB,CACxB,YACQC,EACN,CADM,KAAA,MAAAA,EAEPJ,GAAe,KAAM,CACpB,kBAAmBC,GACnB,KAAMA,GACN,QAASA,EACV,CAAC,CACF,CAEA,IAAI,MAAO,CACV,OAAO,KAAK,QAAQ,MACrB,CACA,IAAI,SAAU,CACb,OAAO,KAAK,QAAQ,SAAW,CAChC,CACA,IAAI,eAAgB,CACnB,OAAOI,GAAU,IAAM,KAAK,QAAQ,MAAM,CAC3C,CAEA,IAAI,SAAU,CACb,OAAOC,GAAmB,IAAM,KAAK,MAAM,IAAI,CAAC,CAAE,UAAAR,CAAU,IAAMA,CAAS,EAAG,CAAE,KAAM,qBAAsB,CAAC,CAC9G,CACA,IAAI,gBAAiB,CACpB,OAAOI,GACNI,GAAmB,IAAM,KAAK,MAAM,IAAI,CAAC,CAAE,eAAgBC,CAAO,IAAMA,CAAM,EAAG,CAAE,KAAM,4BAA6B,CAAC,CACxH,CACD,CACA,IAAI,cAAe,CAClB,OAAOD,GAAmB,IAAM,KAAK,MAAM,IAAI,CAAC,CAAE,eAAgBC,CAAO,IAAMA,EAAO,OAAO,EAAG,CAAE,KAAM,0BAA2B,CAAC,CACrI,CAIA,IAAI,mBAAoB,CACvB,OAAOL,GAAYI,GAAmB,IAAM,KAAK,MAAM,IAAIE,GAAQA,EAAK,aAAa,EAAG,CAAE,KAAM,+BAAgC,CAAC,CAAC,CACnI,CACA,IAAI,QAAS,CACZ,OAAO,KAAK,iBACb,CACA,IAAI,YAAa,CAChB,OAAO,KAAK,kBAAkB,OAC/B,CACD,ECxDM,CAAE,KAAAC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,KAAM,CAAE,OAAQ,KAAM,CAAC,EAsB3EC,GAAgBC,GAAsB,gBAAiB,SACnET,EACA,CAAE,6BAAAU,EAA8B,wBAAAC,CAAwB,EAGpD,CAAC,EACe,CAGpB,GAFAN,GAAQ,gBAAgBK,EAA+B,YAAc,EAAE,MAAMV,EAAO,oBAAoB,iBAAiB,EAErHA,EAAO,QAAQ,SAAS,eAAe,EAAG,CAC7C,GAAIW,EACH,OAAAP,GAAM,kFAAkF,EACjFJ,EAER,MAAMM,GAAM,yCAA0CN,EAAO,QAAS,CAAE,KAAMA,EAAO,IAAK,CAAC,CAC5F,CAEA,IAAIY,EACEC,EAAeC,GAAcd,EAAQ,SAA6Be,EAAOC,EAAc,CAC5F,IAAMC,EAAYC,GAAYH,CAAK,EAE/BI,EACEC,EAAQ,CAAC,EACTC,EAAWJ,EAAY,KAAO,CAAC,EACjCA,GACHL,EAAa,IAAI,IACjBO,EAAUJ,EAAM,MAEhBI,EAAUJ,EAAM,MAGjB,IAAIO,EACJ,QACKC,EAAIb,EAA+B,EAAIS,EAAQ,OAAS,EAC5DT,EAA+Ba,EAAIJ,EAAQ,OAASI,GAAK,EACzDb,EAA+Ba,IAAMA,IACpC,CACD,IAAMC,EAAML,EAAQI,CAAC,EACfE,EAAMD,EAAI,GAAK,IAAMA,EAAI,GAG/B,GAAIF,IAAYZ,EAA+BY,EAAUE,EAAI,GAAKF,EAAUE,EAAI,IAC/E,MAAMlB,GAAM,wCAAyCgB,EAASZ,EAA+B,IAAM,IAAKc,EAAI,GAAI,CAC/G,IAAAA,EACA,EAAAD,EACA,QAAAJ,EACA,6BAAAT,CACD,CAAC,EAEFY,EAAUE,EAAI,GAEd,IAAME,EAAWd,EAAW,IAAIa,CAAG,GAC/B,CAACC,IAAahB,EAAgCgB,EAAS,GAAKF,EAAI,GAAOE,EAAS,GAAKF,EAAI,OACxFE,GAAY,CAACT,GAAWI,EAAS,KAAKK,CAAQ,EAClDN,EAAM,KAAKI,CAAG,EACdZ,EAAW,IAAIa,EAAKD,CAAG,EAEzB,CACA,OAAAG,GAAgBP,CAAK,EACrBf,GAAQ,YACPA,GACC,gBAAgBK,EAA+B,YAAc,EAAE,IAAIV,EAAO,oBAAoB,iBAC9FiB,EACC,CAAE,GAAG,OAAO,YAAY,OAAO,QAAQF,CAAK,EAAE,IAAI,CAAC,CAACa,EAAGC,CAAC,IAAM,CAACD,EAAGC,GAAG,MAAM,CAAC,CAAC,EAAG,MAAOT,EAAM,OAAQ,SAAAC,CAAS,EAC9G,CAAE,GAAGN,EAAO,MAAAK,EAAO,SAAAC,CAAS,CAC9B,EACMJ,EACN,CAAE,KAAMG,CAAM,EACZ,CAAE,MAAOA,EAAO,QAASC,CAAS,CACtC,EAAG,CAAE,KAAM,gBAAgBX,EAA+B,YAAc,EAAE,GAAI,gBAAiB,eAAgB,CAAC,EAChH,OAAAL,GAAQ,YAAcyB,GAAQ,IAAM,CACnCzB,GAAQ,iBAAiBL,EAAO,oBAAoB,qBAAsBa,EAAa,QAAQ,MAAM,CACtG,CAAC,EACMA,CAcR,EAAG,CAAE,OAAQkB,GAAsB,cAAgB/B,GAAWgC,GAAgB,CAAE,OAAQ,gBAAiB,OAAAhC,CAAO,CAAC,CAAE,CAAC,EAMvGiC,GAAiBxB,GAAsB,iBAAkB,SACrET,EACC,CAGD,GAFIK,GAAQ,WAAWA,GAAQ,kBAAkBL,EAAO,oBAAoB,GAAG,EAE3EA,EAAO,QAAQ,SAAS,gBAAgB,EAC3C,MAAMM,GAAM,0CAA2CN,EAAO,QAAS,CAAE,KAAMA,EAAO,IAAK,CAAC,EAG7F,IAAMkC,EAAeC,GACpBnC,EACA,CAAE,GAAI,CAAC,YAAa,qBAAsB,iBAAiB,EAAG,GAAI,EAAK,EACvE,CAAE,KAAM,WAAY,CACrB,EACAK,GAAQ,WACPA,GACC,kBAAkBL,EAAO,oBAAoB,kBAC7CF,GAAU,UAA0C,CACnD,MAAO,CAAC,GAAGoC,EAAa,OAAO,CAChC,CAAC,CACF,EACD,IAAME,EAAgBJ,GAAgB,CAAE,OAAQ,qBAAsB,OAAAhC,CAAO,CAAC,EACxEqC,EAAUC,GAAiB,UAAsC,CACtE,OAAOJ,EAAa,IAAIV,GAAOA,EAAI,EAAE,CACtC,EAAG,CAAE,KAAMY,CAAc,CAAC,EAE1B,OAAI/B,GAAQ,WACXyB,GAAQ,IAAM,CACbzB,GAAQ,kBAAkBL,EAAO,oBAAoB,aAAc,CAAC,GAAGqC,CAAO,CAAC,CAChF,CAAC,EAGKF,GAAcnC,EAAQ,CAAE,MAAOqC,CAAQ,EAAG,CAAE,KAAM,iBAAkB,gBAAiB,gBAAiB,CAAC,CAC/G,EAAG,CAAE,OAAQN,EAAqB,CAAC,EAoBtBQ,GAAQ9B,GAAsB,QAAS,SAAS8B,EAC5DC,EACAC,EACAC,EAAgC,CAAC,EACjCC,EAA4B,CAAC,EAC5B,CACD,IAAM3C,EAAS4C,GAAqBJ,CAAY,EAChDpC,GAAM,SAASJ,EAAO,oBAAoB,KAAMyC,CAAiB,EACjE,IAAMI,EAAY,MAAM,QAAQJ,CAAiB,EAAIA,EAAoB,CAACA,CAAiB,EAEvF5C,EACJ,GAAIgD,EAAS,SAAW,EAEvBhD,EAAQ,SACF,CAEN,IAAMiD,EAAoBD,EAAS,MAAM,EAAG,EAAE,EAE9ChD,EAAQ0C,EAAMvC,EAAQ8C,EAAmBJ,EAAgBC,CAAI,CAC9D,CACA,IAAMI,EAAcF,EAASA,EAAS,OAAS,CAAC,EAC1CG,EAAaC,GAAUjD,EAAQH,EAAOkD,EAAaJ,CAAI,EAC7D,OAAAtC,GAAQ,YAAcyB,GAAQ,IAAMzB,GAAQ,gBAAiB6C,GAAKF,CAAU,CAAC,CAAC,EACvEA,CACR,EAAG,CACF,OAAQG,GACR,cAAe,CAACnD,EAAQoD,EAASC,IAChCrB,GAAgB,CAAE,OAAQ,QAAS,OAAAhC,EAAQ,KAAMqD,EAAY,CAAE,QAAAD,EAAS,UAAAC,CAAU,EAAID,CAAQ,CAAC,CACjG,CAAC,EAEYH,GAAYxC,GAAsB,YAAa,SAC3DT,EACAsD,EACAF,EAEAT,EAA4B,CAAC,EAC5B,CAED,GADAvC,GAAM,aAAaJ,EAAO,oBAAoB,SAAUsD,GAAS,eAAiB,MAAO,kBAAmBF,CAAO,EAC/G,CAAC,OAAO,QAAQA,CAAO,EAAE,OAAQ,MAAM,IAAI,MAAM,kBAAkB,EAEvE,SAASG,EAAQtD,EAAwB,CACxC,GAAM,CAACuD,EAAyBC,CAAe,EAAIC,GAAyBN,EAASnD,GAAM,WAAa,CAAC,CAAC,EAC1GI,GAAQ,2CAA4CmD,CAAuB,EAC3E,IAAMG,EAAwBxB,GAAcnC,EAAQwD,CAAuB,EACrEI,EAAYC,GAAgBJ,CAAe,EAC3CK,EAAc/D,GAAmB,UAA2B,CACjE,IAAMgE,EAAqBJ,EAAsB,IAAInC,IAAQ,CAAE,IAAAA,EAAK,KAAMoC,EAAUpC,CAAG,CAAE,EAAE,EAC3F,OAAInB,GAAQ,WACXA,GACC,iCACAJ,GAAM,UACN,MACA8D,EACA,QACAjE,GAAU,IAAM6D,EAAsB,OAAO,CAC9C,EAGMI,EAAmB,IAAI,CAAC,CAAE,IAAAvC,EAAK,KAAAwC,CAAK,IAAM,CAChD,IAAMC,EAAW,OAAO,OAAO,CAAC,EAAGhE,GAAM,UAAW+D,CAAI,EACxD,OAAO,IAAI3E,GAGV6E,GAAa,UACZ,CAAC1C,CAAG,EACJQ,GAAgB,CACf,OAAQ,YACR,OAAQ2B,EACR,QAAS,GAAGQ,GAAUF,CAAQ,CAAC,IAAIE,GAAUX,CAAuB,CAAC,EACtE,CAAC,CAEF,EACAS,EACAhE,CACD,CACD,CAAC,CACF,EAAG,CAAE,KAAM+B,GAAgB,CAAE,OAAQ,mBAAoB,OAAQ2B,EAAuB,QAAAP,CAAQ,CAAC,CAAE,CAAC,EACpG,OAAI/C,GAAQ,WAAWyB,GAAQ,IAAMzB,GAAQ,mCAAoC,CAAC,GAAGyD,CAAW,CAAC,CAAC,EAC9FnB,EAAK,OACRxC,GACC,2BACAL,GAAU,IACTgE,EAAY,IAAI,CAAC,CAAE,UAAAvE,EAAW,eAAgBS,CAAO,KAAO,CAC3D,UAAAT,EACA,OAAAS,CACD,EAAE,CACH,CACD,EAEM8D,CACR,CACA,IAAMM,EAAwBrE,GAC7B,UAA+B,CAE9B,OADAK,GAAM,4BAA4BkD,GAAS,OAAO,MAAM,eAAe,EAClEA,EAKG,CAAC,GAAGA,EAAQ,MAAM,QAAQC,CAAO,CAAC,EAHlC,CAAC,GAAGA,EAAQ,IAAI,CAAC,CAK1B,EACA,CAAE,KAAMvB,GAAgB,CAAE,OAAQ,YAAa,OAAAhC,EAAQ,QAAAoD,CAAQ,CAAC,CAAE,CACnE,EAEA,OAAI/C,GAAQ,WAAWyB,GAAQ,IAAMzB,GAAQ,qCAAsC,CAAC,GAAG+D,CAAqB,CAAC,CAAC,EACvG,IAAIxE,GAAYwE,CAAqB,CAC7C,EAAG,CAAE,OAAQjB,GAAoB,cAAe,CAACnD,EAAQqE,EAAQjB,IAAYpB,GAAgB,CAAE,OAAQ,YAAa,OAAAhC,EAAQ,QAAAoD,CAAQ,CAAC,CAAE,CAAC,EAE3HkB,GAAW7D,GAAsB,WAAY,SACzDT,EACAuE,EACA9B,EACAE,EAA4B,CAAC,EAC5B,CACD,IAAI9C,EAAQ0E,EAAW,MACvBnE,GAAM,MAAM,YAAYJ,EAAO,oBAAoB,WAAWH,EAAM,MAAM,QAAQ,EAClF,IAAMgD,EAAY,MAAM,QAAQJ,CAAiB,EAAIA,EAAoB,CAACA,CAAiB,EAE3F,QAAWW,KAAWP,EAAU,CAC/B,GAAI,CAAC,OAAO,QAAQJ,CAAiB,EAAE,OAAQ,MAAM,IAAI,MAAM,kBAAkB,EACjF5C,EAAQA,EAAM,OAAO,SAAyB,CAAiB,UAAAN,CAAU,EAAG,CAC3E,GAAM,CAACiE,EAAyBgB,CAAgB,EAAId,GAAyBN,EAAS7D,GAAa,CAAC,CAAC,EACrGc,GAAQ,kCAAmCmD,CAAuB,EAClE,IAAMiB,EAAatC,GAAcnC,EAAQwD,CAAuB,EAChE,OAAAnD,GAAQ,wBAAyBd,EAAW,MAAOkF,EAAW,KAAM,SAAS,EAC7EpE,GAAQ,YAAcA,GAAQ,wBAAyBd,EAAW,aAAcO,GAAU,IAAM2E,EAAW,OAAO,CAAC,EAE/G9B,EAAK,OAAOxC,GAAI,0BAA2BZ,EAAW,KAAMkF,EAAW,OAAO,EAC3EA,EAAW,OACnB,CAAC,CACF,CACA,OAAO,IAAI7E,GAAYC,CAAK,CAC7B,EAAG,CAAE,OAAQsD,GAAoB,cAAe,CAACnD,EAAQH,EAAOuD,IAAYpB,GAAgB,CAAE,OAAQ,WAAY,OAAAhC,EAAQ,QAAAoD,CAAQ,CAAC,CAAE,CAAC,EA8BzHsB,GAAejE,GAAsB,eAAgB,SACjET,EACAoD,EACAuB,EACC,CACDvE,GAAM,gBAAgBJ,EAAO,oBAAoB,IAAKoD,CAAO,EAE7D,IAAMwB,EAAWzC,GAAcnC,EAAQoD,CAAO,EAC9C/C,GAAQ,2BAA4BuE,EAAS,aAAa,EAC1DvE,GAAQ,YAAcyB,GAAQ,IAAMzB,GAAQ,2BAA4BuE,EAAS,OAAO,CAAC,EAEzF,IAAMC,EAAO7C,GAAgB,CAAE,OAAAhC,EAAQ,QAAAoD,EAAS,OAAQ,cAAe,CAAC,EAClE0B,EAAS/E,GAAsC,IAAMgF,GAAcH,EAAUD,CAAM,EAAG,CAAE,KAAAE,CAAK,CAAC,EACpG,OAAAxE,GAAQ,YAAcyB,GAAQ,IAAMzB,GAAQ,yBAA0ByE,CAAM,CAAC,EACtEA,CACR,EAAG,CAAE,OAAQE,GAAS,WAAY,cAAe,CAAChF,EAAQoD,IAAYpB,GAAgB,CAAE,OAAQ,eAAgB,OAAAhC,EAAQ,QAAAoD,CAAQ,CAAC,CAAE,CAAC,EAEvH6B,GAAcxE,GAAsB,cAAe,SAC/D+B,EACAC,EACAyC,EACA3F,EAA2B,CAAC,EAC3B,CACD,IAAMS,EAAS4C,GAAqBJ,CAAY,EAChDpC,GAAM,eAAeJ,EAAO,oBAAoB,IAAK,CAAE,kBAAAyC,EAAmB,UAAAlD,EAAW,IAAK2F,CAAO,CAAC,EAClG,IAAMC,EAAYnD,GAAgB,CAAE,OAAAhC,EAAQ,OAAQ,aAAc,CAAC,EAE7DoF,EAAc7C,GAAMvC,EAAQyC,CAAiB,EACnDpC,GAAQ,gCAAiC+E,EAAY,aAAa,EAClE,IAAMN,EAAS/E,GACd,IAAMsF,GAAmBD,EAAaF,CAAM,EAC5C,CAAE,KAAMC,CAAU,CACnB,EACA,OAAA9E,GAAQ,YAAcyB,GAAQ,IAAMzB,GAAQ,wBAAyB6C,GAAK4B,CAAM,CAAC,CAAC,EAC3EA,CACR,EAAG,CAAE,OAAQE,GAAS,WAAY,cAAe,CAAChF,EAAQoD,IAAYpB,GAAgB,CAAE,OAAQ,cAAe,OAAAhC,EAAQ,QAAAoD,CAAQ,CAAC,CAAE,CAAC,EAEtHkC,GAAc7E,GAAsB,cAAe,SAC/DT,EACA6E,EACAU,EACAC,EACC,CACDpF,GAAM,eAAeJ,EAAO,oBAAoB,IAAKuF,EAAUV,CAAI,EAEnE,IAAMD,EAAWzC,GAAcnC,EAAQ,CAAE,GAAIuF,EAAU,GAAIE,GAAYZ,EAAMW,CAAU,CAAE,CAAC,EAC1F,OAAAnF,GAAQ,uBAAwBuE,EAAS,OAAO,EACzClF,GAAS,IACfkF,EAAS,QAAU,KAAO,OAAO,YAChCA,EAAS,IAAI,CAAC,CAAE,GAAAc,EAAI,GAAAC,CAAG,IAAM,CAACD,EAAG,MAAMb,EAAK,OAAS,CAAC,EAAGc,CAAE,CAAC,CAC7D,CACD,CACD,EAAG,CACF,OAAQC,GACR,cAAe,CAAC5F,EAAQ6E,EAAMU,IAAavD,GAAgB,CAAE,OAAQ,cAAe,OAAAhC,EAAQ,KAAM,CAAE,KAAA6E,EAAM,SAAAU,CAAS,CAAE,CAAC,CACvH,CAAC,EAEYM,GAAiBpF,GAAsB,iBAAkB,SACrET,EACC,CACDI,GAAM,kBAAkBJ,EAAO,oBAAoB,GAAG,EAEtD,IAAM8E,EAASgB,GAAW,IAAoB,EACxCC,EAAUC,GAAQjF,GAAuB,CAC9C,QAAWS,KAAQN,GAAYH,CAAK,EAAIA,EAAM,KAAOA,EAAM,MAAQ,CAClE,IAAMkF,EAAOnB,EAAO,IAAItD,EAAI,EAAE,GAAK,EACnCsD,EAAO,IAAItD,EAAI,GAAIyE,EAAO,CAAC,CAC5B,CACA,QAAWzE,IAAQ,CAACN,GAAYH,CAAK,GAAKA,EAAM,SAAW,CAAC,EAAI,CAC/D,IAAMkF,EAAOnB,EAAO,IAAItD,EAAI,EAAE,EAC9B,GAAI,CAACyE,GAAQA,EAAO,EAAG,MAAM3F,GAAM,0CAA2C,CAAE,IAAAkB,EAAK,MAAAT,EAAO,OAAA+D,EAAQ,KAAAmB,CAAK,CAAC,EAC1GnB,EAAO,IAAItD,EAAI,GAAIyE,EAAO,CAAC,CAC5B,CACA9F,GAAI,kBAAkBH,EAAO,oBAAoB,oBAAqB,CAAE,MAAAe,EAAO,OAAA+D,CAAO,CAAC,CACxF,CAAC,EAEDiB,EAAQ,CAAE,KAAM/F,EAAO,OAAQ,CAAC,EAChC,IAAMkG,EAAclG,EAAO,UAAU+F,CAAO,EAC5C,OAAAI,GAAiBrB,EAAQoB,CAAW,EAE7BpB,CACR,CAAC,EAEYsB,GAAgB3F,GAAsB,gBAAiB,SACnE4F,EACAC,EACC,CACD,OAAAnG,GAAI,iBAAiBkG,EAAQ,oBAAoB,KAAKC,EAAQ,oBAAoB,GAAG,EAE9E5G,GAAS,IAAM,CACrB,IAAM6G,EAAY,IAAI,IAAIF,EAAQ,IAAI7E,GAAOA,EAAI,EAAE,CAAC,EAC9CgF,EAAY,IAAI,IAAIF,EAAQ,IAAI9E,GAAOA,EAAI,EAAE,CAAC,EACpD,MAAO,CAAC,GAAG+E,CAAS,EAAE,OAAOE,GAAMD,EAAU,IAAIC,CAAE,CAAC,CACrD,CAAC,CACF,CAAC,EAmBM,IAAMC,GAAqBC,GACjC,qBACA,SAA4BC,EAAiBC,EAAiB,CAC7D,OAAOC,GAAS,IAAMC,GAAcH,EAASC,CAAO,EAAE,IAAI,EAAE,MAAM,CACnE,CACD,EACaG,GAAcL,GAAsB,cAAe,SAC/DM,EACAC,EACAC,EAA2B,CAAC,EAC3B,CACD,IAAMC,EAASC,GAAMJ,EAAcC,EAAmBC,CAAS,EAC/D,OAAOL,GAAS,IAAM,CACrB,GAAIM,EAAO,QAAS,OAAO,KAC3B,GAAIA,EAAO,KAAO,EAAG,MAAME,GAAM,oBAAqBF,EAAO,KAAM,WAAYA,CAAM,EACrF,IAAMG,EAAiBH,EAAO,MAAM,CAAC,EAAE,eACvC,GAAIG,EAAe,MAAQ,EAAG,MAAMD,GAAM,uCAAwCC,EAAe,KAAM,QAASA,EAAe,OAAO,EACtI,OAAOA,EAAe,QAAQ,CAAC,CAChC,CAAC,CACF,EAAG,CACF,OAAQC,GAAS,WACjB,cAAe,CAACC,EAAQC,IAAYC,GAAgB,CAAE,OAAQ,cAAe,OAAAF,EAAQ,QAAAC,CAAQ,CAAC,CAC/F,CAAC,EAEYE,GAAoBjB,GAChC,oBACA,SACCM,EACAC,EACAW,EACAV,EAA2B,CAAC,EAC3B,CACD,IAAMW,EAAYd,GAAYC,EAAcC,EAAmBC,CAAS,EACxE,OAAOL,GAAmE,IAAM,CAC/E,IAAMiB,EAAMD,EAAU,IAAI,EAC1B,GAAKC,EACL,OAAI,OAAOF,GAAW,SACdE,EAAIF,CAAgB,EAEpBG,GAAgBH,CAAM,EAAEE,CAAG,CAEpC,CAAC,CACF,EACA,CACC,OAAQP,GAAS,WACjB,cAAe,CAACC,EAAQC,IAAYC,GAAgB,CAAE,OAAQ,oBAAqB,OAAAF,EAAQ,QAAAC,CAAQ,CAAC,CACrG,CACD,EAKaO,GAAgB,SAC5BR,EACAI,EACC,CACD,OAAI,OAAOA,GAAW,WACdJ,EAAO,IAAII,CAAM,EACd,OAAOA,GAAW,SACrBJ,EAAO,IAAIM,GAAOA,EAAIF,CAAM,CAAC,EAE7BJ,EAAO,IAAIO,GAAgBH,CAAM,CAAC,CAE3C,EACaK,GAAqB,SACjCC,EACAN,EACC,CACD,OAAI,OAAOA,GAAW,WACdM,EAAY,QAAQ,IAAIN,CAAM,EAC3B,OAAOA,GAAW,SACrBM,EAAY,MAAM,IAAKC,GAAS,CACtC,GAAI,CAAC,OAAO,OAAOA,EAAK,OAAQP,CAAM,EAAG,CACxC,GAAIO,EAAK,eAAe,OAAS,EAChC,MAAMd,GAAM,uEAAuEc,EAAK,eAAe,IAAI,GAAG,EAE/G,OAAOA,EAAK,eAAe,SAASP,CAAM,CAC3C,CACA,OAAOO,EAAK,OAAOP,CAAM,CAC1B,CAAC,EAEMM,EAAY,MAAM,IAAKC,GACtBJ,GAAgBH,CAAM,EAAEM,CAAW,CAC1C,CAEH,EAMO,SAASH,GAAwDK,EAAgD,CACvH,OAAQC,GACA,OAAO,QAAQD,CAAc,EAAE,OAAO,CAACE,EAAK,CAACC,EAAKC,CAAK,KAC7DF,EAAIE,CAAW,EAAIH,EAAOE,CAAG,EACtBD,GACL,CAAC,CAA0C,CAEhD,CAMO,SAASG,GAAYC,EAAgBC,EAA0B,CACrE,OAAOA,EAAM,IAAIC,GAAMC,GAASH,EAAQE,CAAE,CAAC,CAC5C,CACO,SAASC,GAASH,EAAgBI,EAAc,CACtD,MAAO,GAAGJ,CAAM,IAAII,CAAI,EACzB,CACO,SAASC,GAAqBC,EAAiC,CACrE,OAAK,MAAM,QAAQA,CAAY,EAGxBC,GAAe,UAAUD,EAAc,mBAAmBA,EAAa,MAAM,IAAK,EAAI,EAFrFA,CAGT,CCtkBA,IAAAE,GAAAC,GAAA,CAAA,yEAAAC,EAAAC,EAAA,CAAA,aAAAA,EAAO,QAAUC,EAEjB,IAAIC,EAAM,IACNC,EAAO,IACPC,EAAS,CAACD,EACVE,EAAM,KAAK,IAAI,EAAG,EAAE,EAExB,SAASJ,EAAOK,EAAKC,EAAKC,EAAQ,CAChC,GAAI,OAAO,kBAAoBF,EAAM,OAAO,iBAC1CL,MAAAA,EAAO,MAAQ,EACT,IAAI,WAAW,yBAAyB,EAEhDM,EAAMA,GAAO,CAAC,EACdC,EAASA,GAAU,EAGnB,QAFIC,EAAYD,EAEVF,GAAOD,GACXE,EAAIC,GAAQ,EAAKF,EAAM,IAAQJ,EAC/BI,GAAO,IAET,KAAMA,EAAMF,GACVG,EAAIC,GAAQ,EAAKF,EAAM,IAAQJ,EAC/BI,KAAS,EAEX,OAAAC,EAAIC,CAAM,EAAIF,EAAM,EAEpBL,EAAO,MAAQO,EAASC,EAAY,EAE7BF,CACT,CAAA,CAAA,CAAA,EC7BAG,GAAAZ,GAAA,CAAA,yEAAAC,EAAAC,EAAA,CAAA,aAAAA,EAAO,QAAUW,EAEjB,IAAIT,EAAM,IACNC,EAAO,IAEX,SAASQ,EAAKC,EAAKJ,EAAQ,CACzB,IAAIK,EAAS,EACTL,EAASA,GAAU,EACnBM,EAAS,EACTC,EAAUP,EACVQ,EACAC,EAAIL,EAAI,OAEZ,EAAG,CACD,GAAIG,GAAWE,GAAKH,EAAQ,GAC1BH,MAAAA,EAAK,MAAQ,EACP,IAAI,WAAW,yBAAyB,EAEhDK,EAAIJ,EAAIG,GAAS,EACjBF,GAAOC,EAAQ,IACVE,EAAIb,IAASW,GACbE,EAAIb,GAAQ,KAAK,IAAI,EAAGW,CAAK,EAClCA,GAAS,CACX,OAASE,GAAKd,GAEdS,OAAAA,EAAK,MAAQI,EAAUP,EAEhBK,CACT,CAAA,CAAA,CAAA,EC5BAK,GAAApB,GAAA,CAAA,yEAAAC,EAAAC,EAAA,CAAA,aACA,IAAImB,EAAK,KAAK,IAAI,EAAI,CAAC,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,EAAK,KAAK,IAAI,EAAG,EAAE,EAEvB3B,EAAO,QAAU,SAAU4B,EAAO,CAChC,OACEA,EAAQT,EAAK,EACbS,EAAQR,EAAK,EACbQ,EAAQP,EAAK,EACbO,EAAQN,EAAK,EACbM,EAAQL,EAAK,EACbK,EAAQJ,EAAK,EACbI,EAAQH,EAAK,EACbG,EAAQF,EAAK,EACbE,EAAQD,EAAK,EACA,EAEjB,CAAA,CAAA,CAAA,ECxBAE,GAAA/B,GAAA,CAAA,wEAAAC,EAAAC,EAAA,CAAA,aAAAA,EAAO,QAAU,CACb,OAAQH,GAAA,EACR,OAAQa,GAAA,EACR,eAAgBQ,GAAA,CACpB,CAAA,CAAA,CAAA,ECJaY,GAAQ,IAAI,WAAW,CAAC,EAW/B,SAAUC,GAAQC,EAAgBC,EAAc,CACpD,GAAID,IAAOC,EAAI,MAAO,GACtB,GAAID,EAAG,aAAeC,EAAG,WACvB,MAAO,GAGT,QAASC,EAAK,EAAGA,EAAKF,EAAG,WAAYE,IACnC,GAAIF,EAAGE,CAAE,IAAMD,EAAGC,CAAE,EAClB,MAAO,GAIX,MAAO,EACT,CAEM,SAAUC,GAAQC,EAA6C,CACnE,GAAIA,aAAa,YAAcA,EAAE,YAAY,OAAS,aAAc,OAAOA,EAC3E,GAAIA,aAAa,YAAa,OAAO,IAAI,WAAWA,CAAC,EACrD,GAAI,YAAY,OAAOA,CAAC,EACtB,OAAO,IAAI,WAAWA,EAAE,OAAQA,EAAE,WAAYA,EAAE,UAAU,EAE5D,MAAM,IAAI,MAAM,mCAAmC,CACrD,CCvBA,SAASC,GAAMC,EAAUC,EAAI,CAC3B,GAAID,EAAS,QAAU,IAAO,MAAM,IAAI,UAAU,mBAAmB,EAErE,QADIE,EAAW,IAAI,WAAW,GAAG,EACxBC,EAAI,EAAGA,EAAID,EAAS,OAAQC,IACnCD,EAASC,CAAC,EAAI,IAEhB,QAAS,EAAI,EAAG,EAAIH,EAAS,OAAQ,IAAK,CACxC,IAAII,EAAIJ,EAAS,OAAO,CAAC,EACrBK,EAAKD,EAAE,WAAW,CAAC,EACvB,GAAIF,EAASG,CAAE,IAAM,IAAO,MAAM,IAAI,UAAUD,EAAI,eAAe,EACnEF,EAASG,CAAE,EAAI,CACjB,CACA,IAAIC,EAAON,EAAS,OAChBO,EAASP,EAAS,OAAO,CAAC,EAC1BQ,EAAS,KAAK,IAAIF,CAAI,EAAI,KAAK,IAAI,GAAG,EACtCG,EAAU,KAAK,IAAI,GAAG,EAAI,KAAK,IAAIH,CAAI,EAI3C,SAAS3C,EAAQ+C,EAAM,CAOrB,GALIA,aAAkB,aAAuB,YAAY,OAAOA,CAAM,EACpEA,EAAS,IAAI,WAAWA,EAAO,OAAQA,EAAO,WAAYA,EAAO,UAAU,EAClE,MAAM,QAAQA,CAAM,IAC7BA,EAAS,WAAW,KAAKA,CAAM,IAE7B,EAAEA,aAAkB,YAAe,MAAM,IAAI,UAAU,qBAAqB,EAChF,GAAIA,EAAO,SAAW,EAAK,MAAO,GAMlC,QAJIC,EAAS,EACTC,EAAS,EACTC,EAAS,EACTC,EAAOJ,EAAO,OACXG,IAAWC,GAAQJ,EAAOG,CAAM,IAAM,GAC3CA,IACAF,IAMF,QAHII,GAASD,EAAOD,GAAUJ,EAAU,IAAO,EAC3CO,EAAM,IAAI,WAAWD,CAAI,EAEtBF,IAAWC,GAAM,CAItB,QAHIG,EAAQP,EAAOG,CAAM,EAErBK,EAAI,EACCC,EAAMJ,EAAO,GAAIE,IAAU,GAAKC,EAAIN,IAAYO,IAAQ,GAAKA,IAAOD,IAC3ED,GAAU,IAAMD,EAAIG,CAAG,IAAO,EAC9BH,EAAIG,CAAG,EAAKF,EAAQX,IAAU,EAC9BW,EAASA,EAAQX,IAAU,EAE7B,GAAIW,IAAU,EAAK,MAAM,IAAI,MAAM,gBAAgB,EACnDL,EAASM,EACTL,GACF,CAGA,QADIO,GAAML,EAAOH,EACVQ,KAAQL,GAAQC,EAAII,EAAG,IAAM,GAClCA,KAIF,QADIC,EAAMd,EAAO,OAAOI,CAAM,EACvBS,GAAML,EAAM,EAAEK,GAAOC,GAAOrB,EAAS,OAAOgB,EAAII,EAAG,CAAC,EAC3D,OAAOC,CACT,CAIA,SAASC,EAAcZ,EAAM,CAC3B,GAAI,OAAOA,GAAW,SAAY,MAAM,IAAI,UAAU,iBAAiB,EACvE,GAAIA,EAAO,SAAW,EAAK,OAAO,IAAI,WACtC,IAAIa,EAAM,EAEV,GAAIb,EAAOa,CAAG,IAAM,IAIpB,SAFIZ,EAAS,EACTC,EAAS,EACNF,EAAOa,CAAG,IAAMhB,GACrBI,IACAY,IAMF,QAHIR,GAAUL,EAAO,OAASa,GAAOf,EAAU,IAAO,EAClDgB,EAAO,IAAI,WAAWT,CAAI,EAEvBL,EAAOa,CAAG,GAAG,CAElB,IAAIN,EAAQf,EAASQ,EAAO,WAAWa,CAAG,CAAC,EAE3C,GAAIN,IAAU,IAAO,OAErB,QADIC,EAAI,EACCO,EAAMV,EAAO,GAAIE,IAAU,GAAKC,EAAIN,IAAYa,IAAQ,GAAKA,IAAOP,IAC3ED,GAAUX,EAAOkB,EAAKC,CAAG,IAAO,EAChCD,EAAKC,CAAG,EAAKR,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAIA,IAAU,EAAK,MAAM,IAAI,MAAM,gBAAgB,EACnDL,EAASM,EACTK,GACF,CAEA,GAAIb,EAAOa,CAAG,IAAM,IAGpB,SADIG,EAAMX,EAAOH,EACVc,IAAQX,GAAQS,EAAKE,CAAG,IAAM,GACnCA,IAIF,QAFIC,GAAM,IAAI,WAAWhB,GAAUI,EAAOW,EAAI,EAC1CvB,EAAIQ,EACDe,IAAQX,GACbY,GAAIxB,GAAG,EAAIqB,EAAKE,GAAK,EAEvB,OAAOC,IACT,CAIA,SAASC,EAAQC,EAAM,CACrB,IAAIC,EAASR,EAAaO,CAAM,EAChC,GAAIC,EAAU,OAAOA,EACrB,MAAM,IAAI,MAAM,OAAO7B,CAAI,YAAY,CACzC,CACA,MAAO,CACL,OAAQtC,EACR,aAAA2D,EACA,OAAQM,EAEZ,CACA,IAAIG,GAAMhC,GAENiC,GAAkCD,GAEtCE,GAAeD,GCjITE,GAAN,KAAa,CACF,KACA,OACA,WAET,YAAajC,EAAYkC,EAAgBC,EAAoB,CAC3D,KAAK,KAAOnC,EACZ,KAAK,OAASkC,EACd,KAAK,WAAaC,CACpB,CAEA,OAAQC,EAAiB,CACvB,GAAIA,aAAiB,WACnB,MAAO,GAAG,KAAK,MAAM,GAAG,KAAK,WAAWA,CAAK,CAAC,GAE9C,MAAM,MAAM,mCAAmC,CAEnD,GAQIC,GAAN,KAAa,CACF,KACA,OACA,WACQ,gBAEjB,YAAarC,EAAYkC,EAAgBI,EAAoB,CAC3D,KAAK,KAAOtC,EACZ,KAAK,OAASkC,EACd,IAAMK,EAAkBL,EAAO,YAAY,CAAC,EAE5C,GAAIK,IAAoB,OACtB,MAAM,IAAI,MAAM,0BAA0B,EAE5C,KAAK,gBAAkBA,EACvB,KAAK,WAAaD,CACpB,CAEA,OAAQE,EAAY,CAClB,GAAI,OAAOA,GAAS,SAAU,CAC5B,GAAIA,EAAK,YAAY,CAAC,IAAM,KAAK,gBAC/B,MAAM,MAAM,qCAAqC,KAAK,UAAUA,CAAI,CAAC,KAAK,KAAK,IAAI,+CAA+C,KAAK,MAAM,EAAE,EAEjJ,OAAO,KAAK,WAAWA,EAAK,MAAM,KAAK,OAAO,MAAM,CAAC,CACvD,KACE,OAAM,MAAM,mCAAmC,CAEnD,CAEA,GAAgCC,EAAmE,CACjG,OAAOC,GAAG,KAAMD,CAAO,CACzB,GAKIE,GAAN,KAAqB,CACV,SAET,YAAaC,EAA0B,CACrC,KAAK,SAAWA,CAClB,CAEA,GAAiCH,EAAmE,CAClG,OAAOC,GAAG,KAAMD,CAAO,CACzB,CAEA,OAAQI,EAAa,CACnB,IAAMX,EAASW,EAAM,CAAC,EAChBJ,EAAU,KAAK,SAASP,CAAM,EACpC,GAAIO,GAAW,KACb,OAAOA,EAAQ,OAAOI,CAAK,EAE3B,MAAM,WAAW,qCAAqC,KAAK,UAAUA,CAAK,CAAC,+BAA+B,OAAO,KAAK,KAAK,QAAQ,CAAC,gBAAgB,CAExJ,GAGI,SAAUH,GAAyCI,EAA+CC,EAA8C,CAEpJ,OAAO,IAAIJ,GAAgB,CACzB,GAAIG,EAAK,UAAY,CAAE,CAAEA,EAA2B,MAAM,EAAGA,CAAI,EACjE,GAAIC,EAAM,UAAY,CAAE,CAAEA,EAA4B,MAAM,EAAGA,CAAK,EAClD,CACtB,CAEM,IAAOC,GAAP,KAAY,CACP,KACA,OACA,WACA,WACA,QACA,QAET,YAAahD,EAAYkC,EAAgBC,EAAsBG,EAAoB,CACjF,KAAK,KAAOtC,EACZ,KAAK,OAASkC,EACd,KAAK,WAAaC,EAClB,KAAK,WAAaG,EAClB,KAAK,QAAU,IAAIL,GAAQjC,EAAMkC,EAAQC,CAAU,EACnD,KAAK,QAAU,IAAIE,GAAQrC,EAAMkC,EAAQI,CAAU,CACrD,CAEA,OAAQO,EAAiB,CACvB,OAAO,KAAK,QAAQ,OAAOA,CAAK,CAClC,CAEA,OAAQA,EAAa,CACnB,OAAO,KAAK,QAAQ,OAAOA,CAAK,CAClC,GAGI,SAAUI,GAAmD,CAAE,KAAAjD,EAAM,OAAAkC,EAAQ,OAAAxE,EAAQ,OAAAiE,CAAM,EAAsE,CACrK,OAAO,IAAIqB,GAAMhD,EAAMkC,EAAQxE,EAAQiE,CAAM,CAC/C,CAEM,SAAUuB,GAAoD,CAAE,KAAAlD,EAAM,OAAAkC,EAAQ,SAAAiB,CAAQ,EAAoD,CAC9I,GAAM,CAAE,OAAAzF,EAAQ,OAAAiE,CAAM,EAAKK,GAAMmB,EAAUnD,CAAI,EAC/C,OAAOiD,GAAK,CACV,OAAAf,EACA,KAAAlC,EACA,OAAAtC,EACA,OAAS8E,GAA6B5C,GAAO+B,EAAOa,CAAI,CAAC,EAC1D,CACH,CAEA,SAASb,GAAQC,EAAgBuB,EAAkBC,EAAqBpD,EAAY,CAElF,IAAMqD,EAAgC,CAAA,EACtC,QAASpC,EAAI,EAAGA,EAAIkC,EAAS,OAAQ,EAAElC,EACrCoC,EAAMF,EAASlC,CAAC,CAAC,EAAIA,EAIvB,IAAIqC,EAAM1B,EAAO,OACjB,KAAOA,EAAO0B,EAAM,CAAC,IAAM,KACzB,EAAEA,EAIJ,IAAMtF,EAAM,IAAI,WAAYsF,EAAMF,EAAc,EAAK,CAAC,EAGlDG,EAAO,EACP1B,EAAS,EACT2B,EAAU,EACd,QAASvC,EAAI,EAAGA,EAAIqC,EAAK,EAAErC,EAAG,CAE5B,IAAM5B,EAAQgE,EAAMzB,EAAOX,CAAC,CAAC,EAC7B,GAAI5B,IAAU,OACZ,MAAM,IAAI,YAAY,OAAOW,CAAI,YAAY,EAI/C6B,EAAUA,GAAUuB,EAAe/D,EACnCkE,GAAQH,EAGJG,GAAQ,IACVA,GAAQ,EACRvF,EAAIwF,GAAS,EAAI,IAAQ3B,GAAU0B,EAEvC,CAGA,GAAIA,GAAQH,GAAgB,IAAQvB,GAAW,EAAI0B,EACjD,MAAM,IAAI,YAAY,wBAAwB,EAGhD,OAAOvF,CACT,CAEA,SAASN,GAAQ+F,EAAkBN,EAAkBC,EAAmB,CACtE,IAAMM,EAAMP,EAASA,EAAS,OAAS,CAAC,IAAM,IACxCQ,GAAQ,GAAKP,GAAe,EAC9BpF,EAAM,GAENuF,EAAO,EACP1B,EAAS,EACb,QAASZ,EAAI,EAAGA,EAAIwC,EAAK,OAAQ,EAAExC,EAMjC,IAJAY,EAAUA,GAAU,EAAK4B,EAAKxC,CAAC,EAC/BsC,GAAQ,EAGDA,EAAOH,GACZG,GAAQH,EACRpF,GAAOmF,EAASQ,EAAQ9B,GAAU0B,CAAK,EAU3C,GALIA,IAAS,IACXvF,GAAOmF,EAASQ,EAAQ9B,GAAWuB,EAAcG,CAAM,GAIrDG,EACF,KAAS1F,EAAI,OAASoF,EAAe,GACnCpF,GAAO,IAIX,OAAOA,CACT,CAKM,SAAU4F,GAAsD,CAAE,KAAA5D,EAAM,OAAAkC,EAAQ,YAAAkB,EAAa,SAAAD,CAAQ,EAAyE,CAClL,OAAOF,GAAK,CACV,OAAAf,EACA,KAAAlC,EACA,OAAQ6C,EAAiB,CACvB,OAAOnF,GAAOmF,EAAOM,EAAUC,CAAW,CAC5C,EACA,OAAQP,EAAa,CACnB,OAAOlB,GAAOkB,EAAOM,EAAUC,EAAapD,CAAI,CAClD,EACD,CACH,CC3OO,IAAM6D,GAASD,GAAQ,CAC5B,OAAQ,IACR,KAAM,SACN,SAAU,mCACV,YAAa,EACd,EAEYE,GAAcF,GAAQ,CACjC,OAAQ,IACR,KAAM,cACN,SAAU,mCACV,YAAa,EACd,EAEYG,GAAYH,GAAQ,CAC/B,OAAQ,IACR,KAAM,YACN,SAAU,oCACV,YAAa,EACd,EAEYI,GAAiBJ,GAAQ,CACpC,OAAQ,IACR,KAAM,iBACN,SAAU,oCACV,YAAa,EACd,EAEYK,GAAYL,GAAQ,CAC/B,OAAQ,IACR,KAAM,YACN,SAAU,mCACV,YAAa,EACd,EAEYM,GAAiBN,GAAQ,CACpC,OAAQ,IACR,KAAM,iBACN,SAAU,mCACV,YAAa,EACd,EAEYO,GAAeP,GAAQ,CAClC,OAAQ,IACR,KAAM,eACN,SAAU,oCACV,YAAa,EACd,EAEYQ,GAAoBR,GAAQ,CACvC,OAAQ,IACR,KAAM,oBACN,SAAU,oCACV,YAAa,EACd,EAEYS,GAAUT,GAAQ,CAC7B,OAAQ,IACR,KAAM,UACN,SAAU,mCACV,YAAa,EACd,EC7DYU,GAASpB,GAAM,CAC1B,OAAQ,IACR,KAAM,SACN,SAAU,uCACX,EAEYqB,GAAcrB,GAAM,CAC/B,OAAQ,IACR,KAAM,cACN,SAAU,uCACX,ECVYsB,GAAYtB,GAAM,CAC7B,KAAM,YACN,OAAQ,IACR,SAAU,6DACX,EAEYuB,GAAevB,GAAM,CAChC,KAAM,eACN,OAAQ,IACR,SAAU,6DACX,ECXGwB,GAAWhH,GAEXC,GAAM,IACNC,GAAO,IACPC,GAAS,CAACD,GACVE,GAAM,KAAK,IAAI,EAAG,EAAE,EAOxB,SAASJ,GAAOK,EAAKC,EAAKC,EAAM,CAC9BD,EAAMA,GAAO,CAAA,EACbC,EAASA,GAAU,EAGnB,QAFIC,EAAYD,EAEVF,GAAOD,IACXE,EAAIC,GAAQ,EAAKF,EAAM,IAAQJ,GAC/BI,GAAO,IAET,KAAMA,EAAMF,IACVG,EAAIC,GAAQ,EAAKF,EAAM,IAAQJ,GAC/BI,KAAS,EAEX,OAAAC,EAAIC,CAAM,EAAIF,EAAM,EAGpBL,GAAO,MAAQO,EAASC,EAAY,EAE7BF,CACT,CAEA,IAAI2D,GAASvD,GAETuG,GAAQ,IACRC,GAAS,IAMb,SAASxG,GAAKC,EAAKJ,EAAM,CACvB,IAAIK,EAAS,EACTL,EAASA,GAAU,EACnBM,EAAS,EACTC,EAAUP,EACVQ,EACAC,EAAIL,EAAI,OAEZ,EAAG,CACD,GAAIG,GAAWE,EAEb,MAAAN,GAAK,MAAQ,EACP,IAAI,WAAW,yBAAyB,EAEhDK,EAAIJ,EAAIG,GAAS,EACjBF,GAAOC,EAAQ,IACVE,EAAImG,KAAWrG,GACfE,EAAImG,IAAU,KAAK,IAAI,EAAGrG,CAAK,EACpCA,GAAS,CACX,OAASE,GAAKkG,IAGd,OAAAvG,GAAK,MAAQI,EAAUP,EAEhBK,CACT,CAEA,IAAIM,GAAK,KAAK,IAAI,EAAI,CAAC,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EACnBC,GAAK,KAAK,IAAI,EAAG,EAAE,EAEnBuB,GAAS,SAAgCtB,EAAK,CAChD,OACEA,EAAQT,GAAK,EACbS,EAAQR,GAAK,EACbQ,EAAQP,GAAK,EACbO,EAAQN,GAAK,EACbM,EAAQL,GAAK,EACbK,EAAQJ,GAAK,EACbI,EAAQH,GAAK,EACbG,EAAQF,GAAK,EACbE,EAAQD,GAAK,EACA,EAEjB,EAEIyF,GAAS,CACT,OAAQH,GACR,OAAQ/C,GACR,eAAgBhB,IAGhBmE,GAAeD,GAEnBE,GAAeD,GCrGT,SAAUnD,GAAQ8B,EAAkBxF,EAAS,EAAC,CAElD,MAAO,CADM8G,GAAO,OAAOtB,EAAMxF,CAAM,EACzB8G,GAAO,OAAO,KAAK,CACnC,CAEM,SAAUC,GAAUC,EAAaC,EAAoBjH,EAAS,EAAC,CACnE,OAAA8G,GAAO,OAAOE,EAAKC,EAAQjH,CAAM,EAC1BiH,CACT,CAEM,SAAUC,GAAgBF,EAAW,CACzC,OAAOF,GAAO,eAAeE,CAAG,CAClC,CCPM,SAAUG,GAA8BC,EAAYC,EAAkB,CAC1E,IAAMxE,EAAOwE,EAAO,WACdC,EAAoBJ,GAAeE,CAAI,EACvCG,EAAeD,EAAoBJ,GAAerE,CAAI,EAEtDsB,EAAQ,IAAI,WAAWoD,EAAe1E,CAAI,EACzC,OAAAkE,GAASK,EAAMjD,EAAO,CAAC,EACvB4C,GAASlE,EAAMsB,EAAOmD,CAAU,EACvCnD,EAAM,IAAIkD,EAAQE,CAAY,EAEvB,IAAIC,GAAOJ,EAAMvE,EAAMwE,EAAQlD,CAAK,CAC7C,CAKM,SAAUT,GAAQ+D,EAAqB,CAC3C,IAAMtD,EAAQxC,GAAO8F,CAAS,EACxB,CAACL,EAAME,CAAU,EAAW5D,GAAOS,CAAK,EACxC,CAACtB,EAAM0E,CAAY,EAAW7D,GAAOS,EAAM,SAASmD,CAAU,CAAC,EAC/DD,EAASlD,EAAM,SAASmD,EAAaC,CAAY,EAEvD,GAAIF,EAAO,aAAexE,EACxB,MAAM,IAAI,MAAM,kBAAkB,EAGpC,OAAO,IAAI2E,GAAOJ,EAAMvE,EAAMwE,EAAQlD,CAAK,CAC7C,CAEM,SAAU5C,GAAQmG,EAAoBlH,EAAU,CACpD,GAAIkH,IAAMlH,EACR,MAAO,GACF,CACL,IAAMgF,EAAOhF,EAEb,OACEkH,EAAE,OAASlC,EAAK,MAChBkC,EAAE,OAASlC,EAAK,MAChBA,EAAK,iBAAiB,YACtBjE,GAAWmG,EAAE,MAAOlC,EAAK,KAAK,CAElC,CACF,CAMM,IAAOgC,GAAP,KAAa,CACR,KACA,KACA,OACA,MAKT,YAAaJ,EAAYvE,EAAYwE,EAAoBlD,EAAiB,CACxE,KAAK,KAAOiD,EACZ,KAAK,KAAOvE,EACZ,KAAK,OAASwE,EACd,KAAK,MAAQlD,CACf,GC1DI,SAAUwD,GAA0FC,EAAS/F,EAAmC,CACpJ,GAAM,CAAE,MAAAsC,EAAO,QAAA0D,CAAO,EAAKD,EAC3B,OAAQC,EAAS,CACf,IAAK,GACH,OAAOC,GACL3D,EACA4D,GAAUH,CAAI,EACd/F,GAAqC0E,GAAU,OAAO,EAE1D,QACE,OAAOyB,GACL7D,EACA4D,GAAUH,CAAI,EACb/F,GAAQ+D,GAAO,OAAwC,CAE9D,CACF,CAYA,IAAMqC,GAAQ,IAAI,QAElB,SAASF,GAAWG,EAAoB,CACtC,IAAMH,EAAYE,GAAM,IAAIC,CAAG,EAC/B,GAAIH,GAAa,KAAM,CACrB,IAAMA,EAAY,IAAI,IACtB,OAAAE,GAAM,IAAIC,EAAKH,CAAS,EACjBA,CACT,CACA,OAAOA,CACT,CAEM,IAAOI,GAAP,MAAOC,EAAG,CACL,KACA,QACA,UACA,MACA,IAOT,YAAaP,EAAkBT,EAAcK,EAAqCtD,EAAiB,CACjG,KAAK,KAAOiD,EACZ,KAAK,QAAUS,EACf,KAAK,UAAYJ,EACjB,KAAK,MAAQtD,EAIb,KAAK,GAAG,EAAIA,CACd,CAQA,IAAI,OAAK,CACP,OAAO,IACT,CAGA,IAAI,YAAU,CACZ,OAAO,KAAK,MAAM,UACpB,CAGA,IAAI,YAAU,CACZ,OAAO,KAAK,MAAM,UACpB,CAEA,MAAI,CACF,OAAQ,KAAK,QAAS,CACpB,IAAK,GACH,OAAO,KAET,IAAK,GAAG,CACN,GAAM,CAAE,KAAAiD,EAAM,UAAAK,CAAS,EAAK,KAE5B,GAAIL,IAASiB,GACX,MAAM,IAAI,MAAM,0CAA0C,EAI5D,GAAIZ,EAAU,OAASa,GACrB,MAAM,IAAI,MAAM,oDAAoD,EAGtE,OACEF,GAAI,SACFX,CAA6C,CAGnD,CACA,QACE,MAAM,MACJ,+BAA+B,KAAK,OAAO,4CAA4C,CAG7F,CACF,CAEA,MAAI,CACF,OAAQ,KAAK,QAAS,CACpB,IAAK,GAAG,CACN,GAAM,CAAE,KAAAL,EAAM,OAAAC,CAAM,EAAK,KAAK,UACxBI,EAAmBN,GAAOC,EAAMC,CAAM,EAC5C,OACEe,GAAI,SAAS,KAAK,KAAMX,CAAS,CAErC,CACA,IAAK,GACH,OAAO,KAET,QACE,MAAM,MACJ,+BAA+B,KAAK,OAAO,4CAA4C,CAG7F,CACF,CAEA,OAAQc,EAAc,CACpB,OAAOH,GAAI,OAAO,KAAMG,CAAK,CAC/B,CAEA,OAAO,OAAsFC,EAA4CD,EAAc,CACrJ,IAAME,EAAUF,EAChB,OACEE,GAAW,MACXD,EAAK,OAASC,EAAQ,MACtBD,EAAK,UAAYC,EAAQ,SAClBlH,GAAOiH,EAAK,UAAWC,EAAQ,SAAS,CAEnD,CAEA,SAAU5G,EAAmC,CAC3C,OAAO8F,GAAO,KAAM9F,CAAI,CAC1B,CAEA,QAAM,CACJ,MAAO,CAAE,IAAK8F,GAAO,IAAI,CAAC,CAC5B,CAEA,MAAI,CACF,OAAO,IACT,CAES,CAAC,OAAO,WAAW,EAAI,MAIhC,CAAC,OAAO,IAAI,4BAA4B,CAAC,GAAC,CACxC,MAAO,OAAO,KAAK,SAAQ,CAAE,GAC/B,CAYA,OAAO,MAAwF/C,EAA+C,CAC5I,GAAIA,GAAS,KACX,OAAO,KAGT,IAAMxD,EAAQwD,EACd,GAAIxD,aAAiBgH,GAEnB,OAAOhH,EACT,GAAYA,EAAM,GAAG,GAAK,MAAQA,EAAM,GAAG,IAAMA,EAAM,OAAUA,EAAM,QAAUA,EAAO,CAMtF,GAAM,CAAE,QAAAyG,EAAS,KAAAT,EAAM,UAAAK,EAAW,MAAAtD,CAAK,EAAK/C,EAC5C,OAAO,IAAIgH,GACTP,EACAT,EACAK,EACAtD,GAASuE,GAAUb,EAAST,EAAMK,EAAU,KAAK,CAAC,CAEtD,SAAWrG,EAAMuH,EAAS,IAAM,GAAM,CAIpC,GAAM,CAAE,QAAAd,EAAS,UAAAJ,EAAW,KAAAL,CAAI,EAAKhG,EAC/BiG,EAAgB3D,GAAO+D,CAAS,EACtC,OAAOW,GAAI,OAAOP,EAAST,EAAMC,CAAM,CACzC,KAGE,QAAO,IAEX,CAOA,OAAO,OAAsFQ,EAAkBT,EAAcC,EAAgC,CAC3J,GAAI,OAAOD,GAAS,SAClB,MAAM,IAAI,MAAM,uCAAuC,EAGzD,GAAI,EAAEC,EAAO,iBAAiB,YAC5B,MAAM,IAAI,MAAM,gBAAgB,EAGlC,OAAQQ,EAAS,CACf,IAAK,GAAG,CACN,GAAIT,IAASiB,GACX,MAAM,IAAI,MACR,wCAAwCA,EAAW,kBAAkB,EAGvE,OAAO,IAAID,GAAIP,EAAST,EAAMC,EAAQA,EAAO,KAAK,CAEtD,CACA,IAAK,GAAG,CACN,IAAMlD,EAAQuE,GAAUb,EAAST,EAAMC,EAAO,KAAK,EACnD,OAAO,IAAIe,GAAIP,EAAST,EAAMC,EAAQlD,CAAK,CAC7C,CACA,QACE,MAAM,IAAI,MAAM,iBAAiB,CAErC,CACF,CAKA,OAAO,SAAuBkD,EAAgD,CAC5E,OAAOe,GAAI,OAAO,EAAGC,GAAahB,CAAM,CAC1C,CAQA,OAAO,SAAyDD,EAAYC,EAAgC,CAC1G,OAAOe,GAAI,OAAO,EAAGhB,EAAMC,CAAM,CACnC,CASA,OAAO,OAAoFlD,EAAuD,CAChJ,GAAM,CAAC+D,EAAKU,CAAS,EAAIR,GAAI,YAAYjE,CAAK,EAC9C,GAAIyE,EAAU,SAAW,EACvB,MAAM,IAAI,MAAM,kBAAkB,EAEpC,OAAOV,CACT,CAWA,OAAO,YAA2E/D,EAAyC,CACzH,IAAM0E,EAAQT,GAAI,aAAajE,CAAK,EAC9B2E,EAAaD,EAAM,KAAOA,EAAM,cAChCE,EAAiBpH,GACrBwC,EAAM,SAAS2E,EAAYA,EAAaD,EAAM,aAAa,CAAC,EAE9D,GAAIE,EAAe,aAAeF,EAAM,cACtC,MAAM,IAAI,MAAM,kBAAkB,EAEpC,IAAMG,EAAcD,EAAe,SACjCF,EAAM,cAAgBA,EAAM,UAAU,EAElCxB,EAAS,IAAWG,GACxBqB,EAAM,cACNA,EAAM,WACNG,EACAD,CAAc,EAMhB,MAAO,CAHLF,EAAM,UAAY,EACdT,GAAI,SAASf,CAA0C,EACvDe,GAAI,SAASS,EAAM,MAAOxB,CAAM,EACNlD,EAAM,SAAS0E,EAAM,IAAI,CAAC,CAC5D,CAWA,OAAO,aAA4EI,EAAgD,CACjI,IAAIjJ,EAAS,EACPkJ,EAAO,IAAa,CACxB,GAAM,CAAClG,EAAGN,CAAM,EAAWgB,GAAOuF,EAAa,SAASjJ,CAAM,CAAC,EAC/D,OAAAA,GAAU0C,EACHM,CACT,EAEI6E,EAAUqB,EAAI,EACdC,EAAQd,GASZ,GARIR,IAAsB,IAExBA,EAAU,EACV7H,EAAS,GAETmJ,EAAQD,EAAI,EAGVrB,IAAY,GAAKA,IAAY,EAC/B,MAAM,IAAI,WAAW,uBAAuBA,CAAO,EAAE,EAGvD,IAAMiB,EAAa9I,EACboJ,EAAgBF,EAAI,EACpBG,EAAaH,EAAI,EACjBrG,EAAO7C,EAASqJ,EAChBC,EAAgBzG,EAAOiG,EAE7B,MAAO,CAAE,QAAAjB,EAAS,MAAAsB,EAAO,cAAAC,EAAe,WAAAC,EAAY,cAAAC,EAAe,KAAAzG,CAAI,CACzE,CAQA,OAAO,MAA0GL,EAAkEX,EAAmC,CACpN,GAAM,CAACoC,EAAQE,CAAK,EAAIoF,GAAgB/G,EAAQX,CAAI,EAE9CqG,EAAME,GAAI,OAAOjE,CAAK,EAE5B,GAAI+D,EAAI,UAAY,GAAK1F,EAAO,CAAC,IAAM,IACrC,MAAM,MAAM,wDAAwD,EAItE,OAAAuF,GAAUG,CAAG,EAAE,IAAIjE,EAAQzB,CAAM,EAE1B0F,CACT,GAGF,SAASqB,GAAqH/G,EAAkEX,EAAmC,CACjO,OAAQW,EAAO,CAAC,EAAG,CAEjB,IAAK,IAAK,CACR,IAAMgC,EAAU3C,GAAQ0E,GACxB,MAAO,CACLA,GAAU,OACV/B,EAAQ,OAAO,GAAG+B,GAAU,MAAM,GAAG/D,CAAM,EAAE,EAEjD,CACA,KAAK+D,GAAU,OAAQ,CACrB,IAAM/B,EAAU3C,GAAQ0E,GACxB,MAAO,CAACA,GAAU,OAAkB/B,EAAQ,OAAOhC,CAAM,CAAC,CAC5D,CACA,KAAKoD,GAAO,OAAQ,CAClB,IAAMpB,EAAU3C,GAAQ+D,GACxB,MAAO,CAACA,GAAO,OAAkBpB,EAAQ,OAAOhC,CAAM,CAAC,CACzD,CACA,KAAK6D,GAAO,OAAQ,CAClB,IAAM7B,EAAU3C,GAAQwE,GACxB,MAAO,CAACA,GAAO,OAAkB7B,EAAQ,OAAOhC,CAAM,CAAC,CACzD,CACA,QAAS,CACP,GAAIX,GAAQ,KACV,MAAM,MACJ,yFAAyF,EAG7F,MAAO,CAACW,EAAO,CAAC,EAAaX,EAAK,OAAOW,CAAM,CAAC,CAClD,CACF,CACF,CAEA,SAASsF,GAAY3D,EAAmB8D,EAA4BpG,EAA+B,CACjG,GAAM,CAAE,OAAAoC,CAAM,EAAKpC,EACnB,GAAIoC,IAAWsC,GAAU,OACvB,MAAM,MAAM,8BAA8B1E,EAAK,IAAI,WAAW,EAGhE,IAAMqG,EAAMD,EAAM,IAAIhE,CAAM,EAC5B,GAAIiE,GAAO,KAAM,CACf,IAAMA,EAAMrG,EAAK,OAAOsC,CAAK,EAAE,MAAM,CAAC,EACtC8D,OAAAA,EAAM,IAAIhE,EAAQiE,CAAG,EACdA,CACT,KACE,QAAOA,CAEX,CAEA,SAASF,GAAoC7D,EAAmB8D,EAA4BpG,EAAkC,CAC5H,GAAM,CAAE,OAAAoC,CAAM,EAAKpC,EACbqG,EAAMD,EAAM,IAAIhE,CAAM,EAC5B,GAAIiE,GAAO,KAAM,CACf,IAAMA,EAAMrG,EAAK,OAAOsC,CAAK,EAC7B8D,OAAAA,EAAM,IAAIhE,EAAQiE,CAAG,EACdA,CACT,KACE,QAAOA,CAEX,CAEA,IAAMG,GAAc,IACdC,GAAe,GAErB,SAASI,GAAWb,EAAsBT,EAAcK,EAAqB,CAC3E,IAAM+B,EAAoBtC,GAAeW,CAAO,EAC1C4B,EAAaD,EAAoBtC,GAAeE,CAAI,EACpDjD,EAAQ,IAAI,WAAWsF,EAAahC,EAAU,UAAU,EACvD,OAAAV,GAASc,EAAS1D,EAAO,CAAC,EAC1B4C,GAASK,EAAMjD,EAAOqF,CAAU,EACvCrF,EAAM,IAAIsD,EAAWgC,CAAU,EACxBtF,CACT,CAEA,IAAMwE,GAAY,OAAO,IAAI,kBAAkB,ECzczCe,GAAe,GAerB,SAASC,GAAYC,EAAK,CACxB,GAAIA,EAAI,QAAUA,GAAOA,EAAI,GAAG,IAAMA,EAAI,MACxC,OAAO,KAET,IAAM1B,EAAMC,GAAI,MAAMyB,CAAG,EAGzB,GAAI,CAAC1B,EACH,OAAO,KAET,IAAM/D,EAAQ,IAAI,WAAW+D,EAAI,MAAM,WAAa,CAAC,EACrD,OAAA/D,EAAM,IAAI+D,EAAI,MAAO,CAAC,EACf,CACL,IAAU2B,EAAYC,EAAK,IAAKJ,EAAY,EAC5C,IAAUG,EAAYC,EAAK,MAAO3F,CAAK,CACzC,CACF,CASA,SAAS4F,IAAoB,CAC3B,MAAM,IAAI,MAAM,2EAA2E,CAC7F,CAUA,SAASC,GAAelK,EAAK,CAC3B,GAAI,OAAO,MAAMA,CAAG,EAClB,MAAM,IAAI,MAAM,qEAAqE,EAEvF,GAAIA,IAAQ,KAAYA,IAAQ,KAC9B,MAAM,IAAI,MAAM,0FAA0F,EAE5G,OAAO,IACT,CAEA,IAAMmK,GAAiB,CACrB,QAAS,GACT,aAAc,CACZ,OAAQN,GACR,UAAWI,GACX,OAAQC,EACV,CACF,EAEaE,GAAgB,CAC3B,GAAGD,GACH,aAAc,CACZ,GAAGA,GAAe,YACpB,CACF,EAMA,SAASE,GAAYhG,EAAO,CAC1B,GAAIA,EAAM,CAAC,IAAM,EACf,MAAM,IAAI,MAAM,oDAAoD,EAEtE,OAAOgE,GAAI,OAAOhE,EAAM,SAAS,CAAC,CAAC,CACrC,CAEA,IAAMiG,GAAiB,CACrB,gBAAiB,GACjB,sBAAuB,GACvB,SAAU,GACV,cAAe,GACf,YAAa,GAEb,OAAQ,GACR,QAAS,GACT,uBAAwB,GAExB,KAAM,CAAC,CACT,EACAA,GAAe,KAAKV,EAAY,EAAIS,GAE7B,IAAME,GAAgB,CAC3B,GAAGD,GACH,KAAMA,GAAe,KAAK,MAAM,CAClC,EC/GA,IAAAE,GAAmBC,GAAAC,GAAA,EAAA,CAAA,ECuBnB,IAAMC,GAAQ,CACZ,KAA2DC,GAAQA,IAAQ,KAAOA,EAAM,OACxF,IAA4DA,GAAQ,OAAO,UAAUA,CAAG,EAAIA,EAAM,OAClG,MAA8DA,GAAQ,OAAOA,GAAQ,UAAY,OAAO,SAASA,CAAG,EAAIA,EAAM,OAC9H,OAA+DA,GAAQ,OAAOA,GAAQ,SAAWA,EAAM,OACvG,KAA8DA,GAAQ,OAAOA,GAAQ,UAAYA,EAAM,OACvG,MAAkEA,GAAQA,aAAe,WAAaA,EAAM,OAC5G,KAA6DA,GAAQA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYA,EAAI,QAAUA,EAAMA,EAAM,OAC1I,KAAiEA,GAAQ,MAAM,QAAQA,CAAG,EAAIA,EAAM,OACpG,IAA4DA,GAAQA,IAAQ,MAAQ,OAAOA,GAAQ,UAAYA,EAAI,QAAUA,GAAO,CAAC,MAAM,QAAQA,CAAG,GAAK,EAAEA,aAAe,YAAcA,EAAM,MAClM,EAEMC,GAAQ,CACZ,0DAA2DF,GAAM,KACjE,uCAA4FC,GAAQ,CAClG,GAAID,GAAM,KAAKC,CAAG,IAAM,OAGxB,SAASE,EAAI,EAAGA,EAAIF,EAAI,OAAQE,IAAK,CACnC,IAAIC,EAAIH,EAAIE,CAAC,EAEb,GADAC,EAAIF,GAAM,yDAAyD,EAAEE,CAAC,EAClEA,IAAM,OACR,OAEF,GAAIA,IAAMH,EAAIE,CAAC,EAAG,CAChB,IAAME,EAAMJ,EAAI,MAAM,EAAGE,CAAC,EAC1B,QAASG,EAAIH,EAAGG,EAAIL,EAAI,OAAQK,IAAK,CACnC,IAAIF,EAAIH,EAAIK,CAAC,EAEb,GADAF,EAAIF,GAAM,yDAAyD,EAAEE,CAAC,EAClEA,IAAM,OACR,OAEFC,EAAI,KAAKD,CAAC,CACZ,CACA,OAAOC,CACT,CACF,CACA,OAAOJ,EACT,EACA,IAAKD,GAAM,IACX,sBAA2EC,GAAQ,CACjF,GAAID,GAAM,IAAIC,CAAG,IAAM,OACrB,OAEF,IAAMM,EAAU,OAAO,QAAQN,CAAG,EAE9BI,EAAMJ,EACNO,EAAgB,EACpB,QAAS,EAAI,EAAG,EAAID,EAAQ,OAAQ,IAAK,CACvC,GAAM,CAACE,EAAKC,CAAK,EAAIH,EAAQ,CAAC,EAC9B,OAAQE,EAAK,CACX,IAAK,QACH,CACE,IAAML,EAAIF,GAAM,sCAAsC,EAAED,EAAIQ,CAAG,CAAC,EAChE,GAAIL,IAAM,OACR,OAEF,GAAIA,IAAMM,GAASL,IAAQJ,EAAK,CAC9B,GAAII,IAAQJ,EAAK,CAEfI,EAAM,CAAC,EACP,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACrBD,EAAIE,EAAQD,CAAC,EAAE,CAAC,CAAC,EAAIC,EAAQD,CAAC,EAAE,CAAC,CAErC,CACAD,EAAI,MAAQD,CACd,CACF,CACA,MACF,IAAK,UACH,CACEI,IACA,IAAMJ,EAAIF,GAAM,IAAID,EAAIQ,CAAG,CAAC,EAC5B,GAAIL,IAAM,OACR,OAEF,GAAIA,IAAMM,GAASL,IAAQJ,EAAK,CAC9B,GAAII,IAAQJ,EAAK,CAEfI,EAAM,CAAC,EACP,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACrBD,EAAIE,EAAQD,CAAC,EAAE,CAAC,CAAC,EAAIC,EAAQD,CAAC,EAAE,CAAC,CAErC,CACAD,EAAI,QAAUD,CAChB,CACF,CACA,MACF,QACE,MACJ,CACF,CAEA,GAAI,EAAAI,EAAgB,GAGpB,OAAOH,CACT,CACF,EAEMM,GAAQ,CACZ,0DAA2DX,GAAM,KACjE,uCAA4FC,GAAQ,CAClG,GAAID,GAAM,KAAKC,CAAG,IAAM,OAGxB,SAASE,EAAI,EAAGA,EAAIF,EAAI,OAAQE,IAAK,CACnC,IAAIC,EAAIH,EAAIE,CAAC,EAEb,GADAC,EAAIO,GAAM,yDAAyD,EAAEP,CAAC,EAClEA,IAAM,OACR,OAEF,GAAIA,IAAMH,EAAIE,CAAC,EAAG,CAChB,IAAME,EAAMJ,EAAI,MAAM,EAAGE,CAAC,EAC1B,QAASG,EAAIH,EAAGG,EAAIL,EAAI,OAAQK,IAAK,CACnC,IAAIF,EAAIH,EAAIK,CAAC,EAEb,GADAF,EAAIO,GAAM,yDAAyD,EAAEP,CAAC,EAClEA,IAAM,OACR,OAEFC,EAAI,KAAKD,CAAC,CACZ,CACA,OAAOC,CACT,CACF,CACA,OAAOJ,EACT,EACA,IAAKD,GAAM,IACX,sBAA2EC,GAAQ,CACjF,GAAID,GAAM,IAAIC,CAAG,IAAM,OACrB,OAEF,IAAMM,EAAU,OAAO,QAAQN,CAAG,EAE9BI,EAAMJ,EACNO,EAAgB,EACpB,QAAS,EAAI,EAAG,EAAID,EAAQ,OAAQ,IAAK,CACvC,GAAM,CAACE,EAAKC,CAAK,EAAIH,EAAQ,CAAC,EAC9B,OAAQE,EAAK,CACX,IAAK,QACH,CACE,IAAML,EAAIO,GAAM,sCAAsC,EAAED,CAAK,EAC7D,GAAIN,IAAM,OACR,OAEF,GAAIA,IAAMM,GAASL,IAAQJ,EAAK,CAC9B,GAAII,IAAQJ,EAAK,CAEfI,EAAM,CAAC,EACP,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACrBD,EAAIE,EAAQD,CAAC,EAAE,CAAC,CAAC,EAAIC,EAAQD,CAAC,EAAE,CAAC,CAErC,CACAD,EAAI,MAAQD,CACd,CACF,CACA,MACF,IAAK,UACH,CACEI,IACA,IAAMJ,EAAIO,GAAM,IAAID,CAAK,EACzB,GAAIN,IAAM,OACR,OAEF,GAAIA,IAAMM,GAASL,IAAQJ,EAAK,CAC9B,GAAII,IAAQJ,EAAK,CAEfI,EAAM,CAAC,EACP,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACrBD,EAAIE,EAAQD,CAAC,EAAE,CAAC,CAAC,EAAIC,EAAQD,CAAC,EAAE,CAAC,CAErC,CACAD,EAAI,QAAUD,CAChB,CACF,CACA,MACF,QACE,MACJ,CACF,CACA,GAAI,EAAAI,EAAgB,GAGpB,OAAOH,CACT,CACF,EAEaO,GAAwB,CACnC,QAASV,GAAM,sBACf,iBAAkBS,GAAM,qBAC1B,EC5MME,GAAeC,GAAiB,ECNtCC,GAAmBC,GAAAC,GAAA,EAAA,CAAA,EAmMbC,GAAsB,CAC1B,IAAIC,EAAMC,EAAK,IAAK,CAAC,EACrB,IAAID,EAAMC,EAAK,OAAQ,SAAS,EAChC,IAAID,EAAMC,EAAK,KAAM,CAAC,EACtB,IAAID,EAAMC,EAAK,OAAQ,OAAO,CAChC,EAEMC,GAAU,IAAIF,EAAMC,EAAK,IAAK,EAAE,EG5MtC,IAAAE,GAAmBC,GAAAC,GAAA,EAAA,CAAA,EGSnB,GAAM,CAAE,KAAAC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,ECYrE,GAAM,CAAE,KAAAC,GAAM,IAAAC,GAAK,MAAAC,GAAO,QAAAC,GAAS,MAAAC,EAAM,EAAIC,GAAO,MAAMA,GAAO,IAAI,EClBrE,IAAeC,GAAf,KAA+B,CAC9B,IACA,SACA,WACA,MACD,EAEaC,GAAN,cAAwBD,EAAoC,CAClE,YAAYE,EAA0B,CACrC,MAAM,EACN,OAAO,OAAO,KAAMA,CAAO,CAC5B,CAEA,IAAI,KAAM,CACT,OAAO,KAAK,OAAO,GACpB,CACA,MAAM,KAAKC,EAAuC,CACjD,OAAO,MAAM,KAAK,OAAO,KAAKA,CAAI,CACnC,CACA,IAAI,IAAK,CACR,OAAOC,GAAiB,KAAK,WAAW,CACzC,CACA,IAAI,UAAW,CACd,OAAO,KAAK,KAAK,MAAM,EAAE,CAC1B,CACA,IAAI,aAAc,CACjB,MAAO,GAAG,KAAK,QAAQ,IAAI,KAAK,QAAQ,IAAI,KAAK,GAAG,IAAI,KAAK,UAAU,EACxE,CACD","names":["niceErrors","annotationType","key","toString","index","length","other","constructor","name","dataStructure","thing","property","derivation","method","errors","die","error","args","Array","_len","_key","arguments","e","apply","Error","mockGlobal","getGlobal","globalThis","window","global","self","assign","Object","getDescriptor","getOwnPropertyDescriptor","defineProperty","objectPrototype","prototype","EMPTY_ARRAY","freeze","EMPTY_OBJECT","hasProxy","Proxy","plainObjectString","assertProxies","warnAboutProxyRequirement","msg","globalState","verifyProxies","getNextId","mobxGuid","once","func","invoked","noop","isFunction","fn","isStringish","value","t","isObject","isPlainObject","proto","getPrototypeOf","protoConstructor","hasOwnProperty","call","isGenerator","obj","displayName","addHiddenProp","object","propName","enumerable","writable","configurable","addHiddenFinalProp","createInstanceofPredicate","theClass","x","isES6Map","Map","isES6Set","Set","hasGetOwnPropertySymbols","getOwnPropertySymbols","getPlainObjectKeys","keys","symbols","concat","filter","s","propertyIsEnumerable","ownKeys","Reflect","getOwnPropertyNames","stringifyKey","String","toPrimitive","hasProp","target","prop","getOwnPropertyDescriptors","res","forEach","storedAnnotationsSymbol","Symbol","createDecoratorAnnotation","annotation","decorator","is20223Decorator","decorate_20223_","storeAnnotation","_extends","isOverride","fieldName","assertNotDecorated","currentAnnotationType","annotationType_","requestedAnnotationType","collectStoredAnnotations","context","assert20223DecoratorType","types","includes","kind","$mobx","Atom","name_","isPendingUnobservation_","isBeingObserved_","observers_","diffValue_","lastAccessedBy_","lowestObserverState_","IDerivationState_","NOT_TRACKING_","onBOL","onBUOL","_proto","onBO","listener","onBUO","reportObserved","reportChanged","startBatch","propagateChanged","endBatch","isAtom","createAtom","onBecomeObservedHandler","onBecomeUnobservedHandler","atom","onBecomeObserved","onBecomeUnobserved","identityComparer","a","b","structuralComparer","deepEqual","shallowComparer","defaultComparer","is","comparer","identity","structural","shallow","deepEnhancer","v","_","isObservable","isArray","observable","array","undefined","map","set","isAction","isFlow","flow","autoAction","shallowEnhancer","isObservableObject","isObservableArray","isObservableMap","isObservableSet","deep","referenceEnhancer","newValue","refStructEnhancer","oldValue","OVERRIDE","isOverride","annotation","annotationType_","OVERRIDE","createActionAnnotation","name","options","annotationType_","options_","make_","extend_","decorate_20223_","adm","key","descriptor","source","_this$options_","bound","target_","isAction","value","actionDescriptor","createActionDescriptor","defineProperty","proxyTrap","defineProperty_","mthd","context","assert20223DecoratorType","kind","addInitializer","ann","_createAction","m","_ann$options_$name","_ann$options_","_ann$options_$autoAct","_ann$options_2","createAction","toString","autoAction","storeAnnotation","_this$options_2","self","bind","isMobxAction","die","String","assertActionDescriptor","_ref","_ref2","isFunction","name_","annotation","safeDescriptors","globalState","_annotation$options_","_adm$proxy_","proxy_","_annotation$options_$","_annotation$options_2","_annotation$options_$2","_annotation$options_3","_annotation$options_4","_adm$proxy_2","undefined","configurable","isPlainObject_","enumerable","writable","createFlowAnnotation","hasProp","isFlow","flowDescriptor","createFlowDescriptor","flow","_this$options_3","isMobXFlow","assertFlowDescriptor","createComputedAnnotation","assertComputedDescriptor","defineComputedProperty_","_extends","get","set","asObservableObject","$mobx","values_","ComputedValue","getObservablePropValue_","createObservableAnnotation","assertObservableDescriptor","defineObservableProperty_","_this$options_$enhanc","enhancer","deepEnhancer","desc","initializedObjects","WeakSet","initializeObservable","target","observable","ObservableValue","_ann$options_$enhance","add","has","call","setObservablePropValue_","init","AUTO","autoAnnotation","createAutoAnnotation","computed","isGenerator","flowAnnotation","autoBind","actionAnnotation","observableAnnotation","deep","ref","_this$options_4","_this$options_5","_this$options_6","OBSERVABLE","OBSERVABLE_REF","OBSERVABLE_SHALLOW","OBSERVABLE_STRUCT","defaultCreateObservableOptions","defaultDecorator","proxy","Object","freeze","asCreateObservableOptions","thing","observableRefAnnotation","referenceEnhancer","observableShallowAnnotation","shallowEnhancer","observableStructAnnotation","refStructEnhancer","observableDecoratorAnnotation","createDecoratorAnnotation","getEnhancerFromOptions","getEnhancerFromAnnotation","getAnnotationFromOptions","_options$defaultDecor","createObservable","v","arg2","arg3","is20223Decorator","isStringish","isObservable","isPlainObject","object","Array","isArray","array","isES6Map","map","isES6Set","box","assign","observableFactories","o","equals","initialValues","useProxies","createLegacyArray","createObservableArray","ObservableMap","ObservableSet","props","decorators","initObservable","extendObservable","asDynamicObservableObject","shallow","struct","COMPUTED","COMPUTED_STRUCT","computedAnnotation","computedStructAnnotation","comparer","structural","arg1","opts","currentActionId","nextActionId","isFunctionNameConfigurable","_getDescriptor$config","_getDescriptor","getDescriptor","tmpNameDescriptor","actionName","fn","res","executeAction","arguments","canRunAsDerivation","scope","args","runInfo","_startAction","apply","err","error_","_endAction","notifySpy_","isSpyEnabled","startTime_","Date","now","flattenedArgs","from","EMPTY_ARRAY","spyReportStart","type","ACTION","prevDerivation_","trackingDerivation","runAsAction","startBatch","prevAllowStateChanges_","allowStateChanges","untrackedStart","allowStateChangesStart","prevAllowStateReads_","allowStateReadsStart","runAsAction_","actionId_","parentActionId_","suppressReactionErrors","allowStateChangesEnd","allowStateReadsEnd","endBatch","untrackedEnd","spyReportEnd","time","func","prev","CREATE","_Symbol$toPrimitive","Symbol","toPrimitive","_Atom","_inheritsLoose","notifySpy","getNextId","_this","hasUnreportedChange_","interceptors_","changeListeners_","value_","dehancer","spyReport","_assertThisInitialized","observableKind","debugObjectName","newValue","_proto","prototype","dehanceValue","oldValue","prepareNewValue_","UNCHANGED","UPDATE","setNewValue_","checkIfStateModificationsAreAllowed","hasInterceptors","change","interceptChange","reportChanged","hasListeners","notifyListeners","reportObserved","intercept_","handler","registerInterceptor","observe_","listener","fireImmediately","registerListener","raw","toJSON","valueOf","Atom","isObservableValue","createInstanceofPredicate","dependenciesState_","IDerivationState_","NOT_TRACKING_","observing_","newObserving_","isBeingObserved_","isPendingUnobservation_","observers_","Set","diffValue_","runId_","lastAccessedBy_","lowestObserverState_","UP_TO_DATE_","unboundDepsCount_","CaughtException","triggeredBy_","isComputing_","isRunningSetter_","derivation","setter_","isTracing_","TraceMode","NONE","scope_","equals_","requiresReaction_","keepAlive_","onBOL","onBUOL","compareStructural","requiresReaction","keepAlive","onBecomeStale_","propagateMaybeChanged","onBO","forEach","onBUO","inBatch","size","shouldCompute","warnAboutUntrackedRead_","computeValue_","prevTrackingContext","trackingContext","trackAndCompute","propagateChangeConfirmed","result","isCaughtException","cause","wasSuspended","changed","track","trackDerivedFunction","disableErrorBoundaries","e","suspend_","clearObserving","console","log","firstTime","prevValue","autorun","prevU","computedRequiresReaction","warn","isComputedValue","STALE_","POSSIBLY_STALE_","prevAllowStateReads","prevUntracked","obs","l","length","i","obj","changeDependenciesStateTo0","isComputingDerivation","atom","hasObservers","enforceActions","checkIfStateReadsAreAllowed","allowStateReads","observableRequiresReaction","f","runId","prevTracking","bindDependencies","warnAboutDerivationWithoutDependencies","requiresObservable_","reactionRequiresObservable","prevObserving","observing","lowestNewObservingDerivationState","i0","dep","removeObserver","addObserver","untracked","action","MobXGlobals","version","UNCHANGED","trackingDerivation","trackingContext","runId","mobxGuid","inBatch","pendingUnobservations","pendingReactions","isRunningReactions","allowStateChanges","allowStateReads","enforceActions","spyListeners","globalReactionErrorHandlers","computedRequiresReaction","reactionRequiresObservable","observableRequiresReaction","disableErrorBoundaries","suppressReactionErrors","useProxies","verifyProxies","safeDescriptors","canMergeGlobalState","isolateCalled","globalState","global","getGlobal","__mobxInstanceCount","__mobxGlobals","setTimeout","die","isolateGlobalState","length","undefined","getGlobalState","hasObservers","observable","observers_","size","getObservers","addObserver","node","add","lowestObserverState_","dependenciesState_","removeObserver","queueForUnobservation","isPendingUnobservation_","globalState","pendingUnobservations","push","startBatch","inBatch","endBatch","runReactions","list","i","length","isBeingObserved_","onBUO","ComputedValue","suspend_","reportObserved","checkIfStateReadsAreAllowed","derivation","trackingDerivation","runId_","lastAccessedBy_","newObserving_","unboundDepsCount_","trackingContext","onBO","propagateChanged","IDerivationState_","STALE_","forEach","d","UP_TO_DATE_","isTracing_","TraceMode","NONE","logTraceInfo","onBecomeStale_","propagateChangeConfirmed","POSSIBLY_STALE_","propagateMaybeChanged","console","log","name_","BREAK","lines","printDepTree","getDependencyTree","Function","toString","replace","join","tree","depth","repeat","name","dependencies","child","Reaction","onInvalidate_","errorHandler_","requiresObservable_","getNextId","observing_","NOT_TRACKING_","diffValue_","isDisposed_","isScheduled_","isTrackPending_","isRunning_","_proto","prototype","schedule_","pendingReactions","isScheduled","runReaction_","prev","shouldCompute","isSpyEnabled","spyReport","type","e","reportExceptionInDerivation_","track","fn","notify","startTime","Date","now","spyReportStart","prevReaction","result","trackDerivedFunction","undefined","clearObserving","isCaughtException","cause","spyReportEnd","time","error","disableErrorBoundaries","message","suppressReactionErrors","warn","globalReactionErrorHandlers","f","_this","dispose","getDisposer_","abortSignal","_this2","removeEventListener","addEventListener","$mobx","trace","enterBreakPoint","MAX_REACTION_ITERATIONS","reactionScheduler","f","runReactions","globalState","inBatch","isRunningReactions","runReactionsHelper","allReactions","pendingReactions","iterations","length","console","error","splice","remainingReactions","i","l","runReaction_","isReaction","createInstanceofPredicate","Reaction","setReactionScheduler","fn","baseScheduler","isSpyEnabled","spyListeners","spyReport","event","listeners","spyReportStart","change","_extends","END_EVENT","type","spyReportEnd","spy","listener","push","once","filter","ACTION","ACTION_BOUND","AUTOACTION","AUTOACTION_BOUND","DEFAULT_ACTION_NAME","actionAnnotation","createActionAnnotation","actionBoundAnnotation","bound","autoActionAnnotation","autoAction","autoActionBoundAnnotation","createActionFactory","res","arg1","arg2","isFunction","createAction","name","is20223Decorator","decorate_20223_","isStringish","storeAnnotation","createDecoratorAnnotation","die","action","Object","assign","runInAction","executeAction","undefined","isAction","thing","isMobxAction","autorun","view","opts","EMPTY_OBJECT","_opts$name","_opts","getNextId","runSync","scheduler","delay","reaction","track","reactionRunner","onError","requiresObservable","createSchedulerFromOptions","isScheduled","isDisposed_","_opts2","_opts2$signal","signal","aborted","schedule_","getDisposer_","_opts3","run","setTimeout","expression","effect","isPlainObject","_opts$name2","effectAction","wrapErrorHandler","firstTime","value","oldValue","equals","compareStructural","comparer","structural","r","changed","nextValue","allowStateChanges","fireImmediately","_opts4","_opts4$signal","_opts5","errorHandler","baseFn","apply","arguments","e","call","ON_BECOME_OBSERVED","ON_BECOME_UNOBSERVED","onBecomeObserved","arg3","interceptHook","onBecomeUnobserved","hook","atom","getAtom","cb","listenersKey","add","Set","hookListeners","size","NEVER","ALWAYS","OBSERVED","configure","options","isolateGlobalState","useProxies","enforceActions","Proxy","verifyProxies","ea","forEach","key","allowStateReads","observableRequiresReaction","disableErrorBoundaries","warn","extendObservable","target","properties","annotations","isObservableMap","isObservable","descriptors","getOwnPropertyDescriptors","initObservable","adm","asObservableObject","$mobx","ownKeys","extend_","getDependencyTree","property","nodeToDependencyTree","node","result","name_","observing_","dependencies","unique","map","getObserverTree","nodeToObserverTree","hasObservers","observers","Array","from","getObservers","list","generatorId","FlowCancellationError","message","prototype","create","Error","flowAnnotation","createFlowAnnotation","flowBoundAnnotation","bound","flow","Object","assign","arg1","arg2","is20223Decorator","decorate_20223_","isStringish","storeAnnotation","arguments","length","die","generator","name","res","ctx","args","runId","generatorId","gen","action","apply","rejector","pendingPromise","undefined","promise","Promise","resolve","reject","stepId","onFulfilled","ret","next","call","e","onRejected","err","isFunction","then","done","value","cancel","cancelPromise","yieldedPromise","noop","FlowCancellationError","isMobXFlow","createDecoratorAnnotation","isFlow","fn","isMobXFlow","_isObservable","value","property","undefined","isObservableMap","isObservableArray","die","isObservableObject","$mobx","values_","has","isAtom","isReaction","isComputedValue","isObservable","arguments","length","apiOwnKeys","obj","isObservableObject","$mobx","ownKeys_","die","cache","map","key","value","set","toJSHelper","source","__alreadySeen","Date","isObservable","isObservableValue","isComputedValue","get","has","isObservableArray","res","Array","length","forEach","idx","isObservableSet","Set","add","isObservableMap","Map","apiOwnKeys","objectPrototype","propertyIsEnumerable","call","toJS","options","die","trace","enterBreakPoint","_len","arguments","args","_key","pop","derivation","getAtomFromArgs","isTracing_","TraceMode","NONE","console","log","name_","BREAK","LOG","globalState","trackingDerivation","getAtom","transaction","action","thisArg","undefined","startBatch","apply","endBatch","getAdm","target","$mobx","objectProxyTraps","has","name","globalState","trackingDerivation","warnAboutProxyRequirement","has_","get","get_","set","value","isStringish","values_","_getAdm$set_","set_","deleteProperty","_getAdm$delete_","delete_","defineProperty","descriptor","_getAdm$definePropert","defineProperty_","ownKeys","ownKeys_","preventExtensions","die","asDynamicObservableObject","options","assertProxies","asObservableObject","_target$$mobx$proxy_","_target$$mobx","proxy_","Proxy","hasInterceptors","interceptable","interceptors_","undefined","length","registerInterceptor","handler","interceptors","push","once","idx","indexOf","splice","interceptChange","change","prevU","untrackedStart","concat","i","l","type","untrackedEnd","hasListeners","listenable","changeListeners_","registerListener","listeners","notifyListeners","slice","makeObservable","annotations","initObservable","adm","storedAnnotationsSymbol","_annotations","collectStoredAnnotations","forEach","key","make_","SPLICE","UPDATE","MAX_SPLICE_SIZE","arrayTraps","get","target","name","adm","$mobx","getArrayLength_","isNaN","get_","parseInt","hasProp","arrayExtensions","set","value","setArrayLength_","set_","preventExtensions","die","ObservableArrayAdministration","enhancer","owned_","legacyMode_","getNextId","atom_","values_","interceptors_","changeListeners_","enhancer_","dehancer","proxy_","lastKnownLength_","Atom","newV","oldV","_proto","prototype","dehanceValue_","undefined","dehanceValues_","values","length","map","intercept_","handler","registerInterceptor","observe_","listener","fireImmediately","observableKind","object","debugObjectName","name_","type","index","added","slice","addedCount","removed","removedCount","registerListener","reportObserved","newLength","currentLength","newItems","Array","i","spliceWithArray_","updateArrayLength_","oldLength","delta","reserveArrayBuffer","deleteCount","checkIfStateModificationsAreAllowed","Math","max","arguments","min","EMPTY_ARRAY","hasInterceptors","change","interceptChange","v","_this","lengthDelta","res","spliceItemsIntoValues_","notifyArraySplice_","_this$values_","splice","apply","concat","oldItems","notifyArrayChildUpdate_","newValue","oldValue","notifySpy","isSpyEnabled","notify","hasListeners","spyReportStart","reportChanged","notifyListeners","spyReportEnd","console","warn","changed","createObservableArray","initialValues","owned","assertProxies","initObservable","addHiddenFinalProp","proxy","Proxy","clear","replace","toJSON","_len","_key","spliceWithArray","push","_len2","items","_key2","pop","shift","unshift","_len3","_key3","reverse","globalState","trackingDerivation","sort","copy","remove","idx","indexOf","addArrayExtension","simpleFunc","mapLikeFunc","reduceLikeFunc","funcName","funcFactory","dehancedValues","callback","thisArg","element","call","_this2","accumulator","currentValue","_this3","isObservableArrayAdministration","createInstanceofPredicate","isObservableArray","thing","isObject","ObservableMapMarker","ADD","DELETE","_Symbol$iterator","Symbol","iterator","_Symbol$toStringTag","toStringTag","ObservableMap","initialData","deepEnhancer","data_","hasMap_","keysAtom_","isFunction","Map","createAtom","merge","has_","key","has","entry","newEntry","ObservableValue","referenceEnhancer","stringifyKey","onBecomeUnobserved","hasKey","updateValue_","addValue_","value_","transaction","_this3$hasMap_$get","setNewValue_","observable","prepareNewValue_","UNCHANGED","_this4","_this4$hasMap_$get","keys","self","makeIterable","next","_keys$next","done","entries","_keys$next2","forEach","_iterator","_createForOfIteratorHelperLoose","_step","_step$value","other","isObservableMap","isPlainObject","getPlainObjectKeys","_this5","isArray","_ref","isES6Map","constructor","untracked","_iterator2","_this6","_step2","replacementMap","convertToMap","orderedData","keysReportChangedCalled","_iterator3","_this7","_step3","deleted","_iterator4","_step4","_step4$value","keyExisted","size","iter1","iter2","next1","next2","toString","from","_createClass","dataStructure","ObservableSetMarker","ObservableSet","Set","callbackFn","add","nextIndex","observableValues","isObservableSet","isES6Set","descriptorCache","Object","create","REMOVE","ObservableObjectAdministration","target_","defaultAnnotation_","autoAnnotation","isPlainObject_","appliedAnnotations_","pendingKeys_","isAnnotation","getObservablePropValue_","setObservablePropValue_","ComputedValue","proxyTrap","Reflect","extend_","enumerable","writable","configurable","make_","annotation","assertAnnotable","_this$target_$storedA","storedAnnotationsSymbol","annotationType_","source","objectPrototype","descriptor","getDescriptor","outcome","getPrototypeOf","recordAnnotationApplied","defineProperty_","startBatch","deleteOutcome","delete_","_extends","defineProperty","notifyPropertyAddition_","endBatch","defineObservableProperty_","cachedDescriptor","getCachedObservablePropDescriptor","safeDescriptors","defineComputedProperty_","options","context","_this$pendingKeys_","_this$pendingKeys_$ge","_getDescriptor","deleteProperty","propagateChanged","_this$pendingKeys_2","_this$pendingKeys_2$g","ownKeys_","ownKeys","keys_","asObservableObject","isObservableObject","getAdministration","getDebugName","isExtensible","_options$name","String","getAnnotationFromOptions","addHiddenProp","isObservableObjectAdministration","_adm$target_$storedAn","isOverride","fieldName","currentAnnotationType","requestedAnnotationType","ENTRY_0","createArrayEntryDescriptor","safariPrototypeSetterInheritanceBug","p","OBSERVABLE_ARRAY_BUFFER_SIZE","StubArray","inherit","ctor","proto","setPrototypeOf","__proto__","LegacyObservableArray","_StubArray","_inheritsLoose","_assertThisInitialized","arrays","a","prop","fn","createArrayBufferItem","createLegacyArray","getAtom","property","isAtom","isComputedValue","isReaction","named","isAction","cb","derivation","untrackedStart","allowStateChanges","allowStateChangesStart","allowStateChangesEnd","untrackedEnd","deepEqual","b","depth","eq","aStack","bStack","className","valueOf","unwrap","areArrays","aCtor","bCtor","getSelf","m","g","getGlobal","__MOBX_DEVTOOLS_GLOBAL_HOOK__","injectMobx","spy","extras","__create","__defProp","__getOwnPropDesc","__getOwnPropNames","__getProtoOf","__hasOwnProp","__commonJS","cb","mod","__export","target","all","name","__copyProps","to","from","except","desc","key","__toESM","isNodeMode","require_typebox","__commonJS","exports","TypeRegistry","map","Entries","Clear","Delete","kind","Has","Set","func","Get","TypeBoxError","message","FormatRegistry","format","ValueGuard","IsArray","value","IsBigInt","IsBoolean","IsDate","IsNull","IsNumber","IsObject","IsString","IsUint8Array","IsUndefined","TypeGuardUnknownTypeError","TypeGuard","IsPattern","IsControlCharacterFree","i","code","IsAdditionalProperties","IsOptionalBoolean","TSchema","IsOptionalBigInt","IsOptionalNumber","IsOptionalString","IsOptionalPattern","IsOptionalFormat","IsOptionalSchema","TAny","schema","TKindOf","TArray","TAsyncIterator","TBigInt","TBoolean","TConstructor","TDate","TFunction","TInteger","TIntersect","TTransform","TIterator","TKind","TLiteralString","TLiteral","TLiteralNumber","TLiteralBoolean","TNever","TNot","TNull","TNumber","TObject","key","TPromise","TRecord","keys","TRecursive","TRef","TString","TSymbol","TTemplateLiteral","TThis","TTuple","TUndefined","TUnionLiteral","TUnion","TUint8Array","TUnknown","TUnsafe","TVoid","TReadonly","TOptional","ExtendsUndefined","Check","TypeExtendsError","TypeExtendsResult","TypeExtends","IntoBooleanResult","result","Throw","IsStructuralRight","right","StructuralRight","left","TNeverRight","TIntersectRight","TUnionRight","TUnknownRight","TAnyRight","TArrayRight","IsObjectArrayLike","Visit","TObjectRight","TRecordRight","TBooleanRight","index","TIntegerRight","TStringRight","TNumberRight","UnwrapTNot","current","depth","IsObjectPropertyCount","count","IsObjectStringLike","IsObjectSymbolLike","IsObjectNumberLike","IsObjectBooleanLike","IsObjectBigIntLike","IsObjectDateLike","IsObjectUint8ArrayLike","IsObjectFunctionLike","length","IsObjectConstructorLike","IsObjectPromiseLike","then","Property","RecordKey","RecordValue","Key","Value","TemplateLiteralResolver","IsArrayOfTuple","TTupleRight","VoidRight","Extends","TypeClone","ArrayType","DateType","Uint8ArrayType","ObjectType","clonedProperties","acc","clonedSymbols","Rest","schemas","Type","options","IndexedAccessor","OptionalUnwrap","_","clone","IsIntersectOptional","IsUnionOptional","ResolveIntersect","ResolveUnion","ResolveOptional","resolved","indexed","property","items","element","Resolve","Intrinsic","Uncapitalize","first","rest","Capitalize","Uppercase","Lowercase","IntrinsicTemplateLiteral","mode","expression","TemplateLiteralParser","TemplateLiteralFinite","IntrinsicLiteral","literals","TemplateLiteralGenerator","mapped","IntrinsicRest","union","L","R","Map","ObjectMap","callback","inner","KeyResolver","UnwrapPattern","sets","set","outer","ResolveKeys","ResolvePattern","KeyArrayResolverError","KeyArrayResolver","UnionResolver","TemplateLiteralPatternError","TemplateLiteralPattern","Escape","Create","kinds","template","TemplateLiteralParserError","IsNonEscaped","pattern","char","IsOpenParen","IsCloseParen","IsSeparator","IsGroup","InGroup","IsPrecedenceOr","IsPrecedenceAnd","Or","start","expressions","range","Parse","And","Group","scan","Range","end","ParseExact","TemplateLiteralFiniteError","expr","TemplateLiteralGeneratorError","Reduce","buffer","Generate","Const","TemplateLiteralDslParser","ParseUnion","trim","literal","ParseTerminal","ParseLiteral","template_dsl","TransformDecodeBuilder","decode","TransformEncodeBuilder","encode","Codec","TypeOrdinal","TypeBuilderError","TypeBuilder","record","JsonTypeBuilder","objects","intersect","properties","item","values1","anyOf","trueType","falseType","unionType","excludedMembers","narrowed","type","unresolved","cloned","allOf","clonedUnevaluatedProperties","propertyKeys","optionalKeys","requiredKeys","name","clonedAdditionalProperties","object","thisType","additionalItems","minItems","maxItems","clonedItems","clonedAnyOf","JavaScriptTypeBuilder","Unwrap","parameters","returns","clonedParameters","clonedReturns","regex","import_typebox","__toESM","StringTB","OptionalTB","BooleanTB","ObjectTB","NumberTB","T","Str","Num","Obj","Opt","Bool","STR","NUM","BOOL","arrayIfSingle","arrOrSingle","require_lib","__commonJS","exports","_typeof","obj","isBrowser","isNode","isWebWorker","isJsDom","isDeno","require_fast_json_stable_stringify","module","data","opts","cycles","cmp","f","node","a","b","aobj","bobj","seen","stringify","i","out","seenIndex","keys","key","value","require_safe_stable_stringify","hasOwnProperty","configure","strEscapeSequencesRegExp","strEscape","str","insertSort","array","currentValue","position","typedArrayPrototypeGetSymbolToStringTag","isTypedArrayWithEntries","stringifyTypedArray","separator","maximumBreadth","whitespace","res","getCircularValueOption","options","circularValue","getBooleanOption","getPositiveIntegerOption","getItemCount","number","getUniqueReplacerSet","replacerArray","replacerSet","getStrictOption","message","fail","bigint","deterministic","maximumDepth","stringifyFnReplacer","parent","stack","replacer","spacer","indentation","join","originalIndentation","maximumValuesToStringify","tmp","removedKeys","keyLength","maximumPropertiesToStringify","stringifyArrayReplacer","stringifyIndent","stringifySimple","space","require_guard","IsAsyncIterator","IsObject","IsIterator","IsTypedArray","IsPromise","IsUint8Array","IsDate","HasPropertyKey","IsPlainObject","IsFunction","IsArray","IsUndefined","IsNull","IsBoolean","IsNumber","IsInteger","IsBigInt","IsString","IsSymbol","IsValueType","require_system","guard_1","errors_1","require_errors","Types","require_typebox","TypeSystemDuplicateTypeKind","kind","TypeSystemDuplicateFormat","TypeSystem","Type","check","Format","format","TypeSystemErrorFunction","errorMessageFunction","DefaultErrorFunction","Reset","Set","callback","Get","TypeSystemPolicy","IsExactOptionalProperty","IsObjectLike","isObject","IsRecordLike","IsNumberLike","isNumber","IsVoidLike","isUndefined","schema","errorType","require_deref","typebox_1","TypeDereferenceError","Deref","references","index","target","require_hash","ValueHashError","ByteMarker","Accumulator","Prime","Size","Bytes","_","F64","F64In","F64Out","NumberToBytes","byteCount","ArrayType","FNV1A64","item","Visit","BooleanType","BigIntType","byte","DateType","NullType","NumberType","ObjectType","StringType","SymbolType","Uint8ArrayType","UndefinedType","Hash","system_1","deref_1","hash_1","ValueErrorType","ValueErrorsUnknownTypeError","EscapeKey","IsDefined","ValueErrorIterator","iterator","next","Create","type","path","TAny","TArray","set","element","hashed","containsSchema","containsCount","acc","TAsyncIterator","TBigInt","TBoolean","TConstructor","TDate","TFunction","TInteger","TIntersect","inner","keyCheck","valueKey","TIterator","TLiteral","TNever","TNot","TNull","TNumber","TObject","requiredKeys","knownKeys","unknownKeys","requiredKey","knownKey","property","TPromise","TRecord","patternKey","patternSchema","regex","propertyKey","propertyValue","TRef","TString","TSymbol","TTemplateLiteral","TThis","TTuple","TUndefined","TUnion","count","subschema","errors","TUint8Array","TUnknown","TVoid","TKind","references_","schema_","Errors","args","__createBinding","o","m","k","k2","desc","__exportStar","p","require_check","index_1","require_system2","ValueCheckUnknownTypeError","IsAnyOrUnknown","check1","keyPattern","check2","valueKeys","check3","Check","require_transform","check_1","TransformDecodeCheckError","error","TransformEncodeCheckError","TransformDecodeError","TransformEncodeError","HasTransform","pattern","visited","Has","DecodeTransform","Default","knownProperties","unevaluatedProperties","unknownProperties","additionalProperties","defaulted","Decode","EncodeTransform","resolved","value1","Encode","require_compiler","transform_1","TypeCheck","checkFunc","code","encoded","Character","DollarSign","IsUnderscore","IsAlpha","IsNumeric","MemberExpression","IsFirstCharacterNumeric","IsAccessor","EscapeHyphen","object","Identifier","$id","buffer","LiteralString","Escape","content","TypeCompilerUnknownTypeError","TypeCompilerTypeGuardError","Policy","expression","TypeCompiler","parameter","accumulator","CreateParameter","elementExpression","CreateExpression","checkExpression","checkMinContains","checkMaxContains","checkCount","CreateVariable","memberExpression","variable","state","CreateFunctionName","instance","useHoisting","functionName","functionCode","CreateFunction","variableName","name","newline","pad","length","returns","CreateReturns","annotation","Build","functions","variables","checkFunction","Code","defaults","Compile","generatedCode","compiledFunction","instances","typeRegistryFunction","formatRegistryFunction","hashFunction","require_errors2","import_browser_or_node","__toESM","import_fast_json_stable_stringify","TIME_PREFIX_ENABLED","PERFORMANCE_PREFIX_ENABLED","LOGGER_DEFAULT_CONFIG","StringFormatters","LoggerTime","sinceFirst","sinceLast","time","delta","sinceFirstNum","t","Style","style","string","formattersEnabled","Logger","_Logger","level","config","debugLogForStub","stub","groupCollapsed","addExtraFxs","enabled","func","group","functionToWrap","result","realFunc","ERRFX","params","logFunc","fixedArgs","returnAsString","now","skippedFirst","line","matches","formatter","import__","cjsModule","wrapper_default","PERF_CHECK","WARN","LOG","DEBUG","VERBOSE","ERROR","E","rootsQueries","observable","createDebugName","caller","thread","untracked","computedStructuralComparer","a","b","untracked","comparer","applogThreadComparer","queryNodesComparer","i","nodeA","nodeB","VERBOSE","observableArrayMapID","observableArrayMap","fn","name","equals","debugName","observableArr","disposeAutorun","autorunButAlsoImmediately","items","DEBUG","observable","rootsAtom","getAtom","getObserverTree","runInAction","rootsQueries","onBecomeObserved","onBecomeUnobserved","observableSetMapID","observableSetMap","observableSet","deleted","added","unseen","item","del","add","autorunButAlsoImmediately","fn","update","name","DEBUG","debugName","result","reaction","Reaction","args","runAndTrack","start","PERF_CHECK","runInAction","WARN","getDependencyTree","VERBOSE","computedFnDeepCompare","keepAliveOrOptions","isAction","memoWarned","opts","map","existing","untrackedArgs","untracked","existingArgs","computation","comparer","cachedResult","isComputingDerivation","getGlobalState","latestValue","computed","trace","unobserveUnobserving","onBecomeUnobserved","prettifyThreadName","input","depth","insideCurlyBraces","char","WARN","LOG","DEBUG","VERBOSE","ERROR","E","isInitEvent","event","Thread","name","parents","filters","_applogs","opts","arrayIfSingle","untracked","makeObservable","computed","action","appLogsToInsert","callback","index","subscriber","l","fn","applog","byRef","cid","log","existing","prettifyThreadName","StaticThread","_StaticThread","Thread","applogs","name","parents","filters","_applogs","src_exports","__export","code","decode","encode","format","parse","typeofs","objectTypeNames","is","value","typeOf","isBuffer","objectType","getObjectType","objectTypeName","Type","major","terminal","typ","Token","type","encodedLength","useBuffer","textDecoder","textEncoder","buf","asU8A","toString","bytes","start","end","utf8Slice","fromString","string","utf8ToBytes","slice","useBuffer","bytes","start","end","isBuffer","concat","chunks","length","c","asU8A","out","off","b","alloc","size","compare","b1","b2","i","utf8ToBytes","str","p","utf8Slice","buf","offset","res","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","decodeCodePointsArray","MAX_ARGUMENTS_LENGTH","codePoints","len","defaultChunkSize","Bl","chunkSize","topChunk","chunkPos","reset","byts","chunk","decodeErrPrefix","encodeErrPrefix","uintMinorPrefixBytes","assertEnoughData","data","pos","need","uintBoundaries","readUint8","options","value","readUint16","readUint32","readUint64","hi","lo","decodeUint8","_minor","Token","Type","decodeUint16","decodeUint32","decodeUint64","encodeUint","token","encodeUintValue","major","uint","nuint","buint","set","tok1","tok2","decodeNegint8","decodeNegint16","decodeNegint32","neg1b","pos1b","decodeNegint64","int","encodeNegint","negint","unsigned","toToken","prefix","decodeBytesCompact","minor","_options","decodeBytes8","decodeBytes16","decodeBytes32","decodeBytes64","l","tokenBytes","fromString","encodeBytes","compareBytes","totLength","tok","toString","decodeStringCompact","decodeString8","decodeString16","decodeString32","decodeString64","encodeString","_data","_pos","decodeArrayCompact","decodeArray8","decodeArray16","decodeArray32","decodeArray64","decodeArrayIndefinite","encodeArray","decodeMapCompact","decodeMap8","decodeMap16","decodeMap32","decodeMap64","decodeMapIndefinite","encodeMap","decodeTagCompact","decodeTag8","decodeTag16","decodeTag32","decodeTag64","encodeTag","MINOR_FALSE","MINOR_TRUE","MINOR_NULL","MINOR_UNDEFINED","decodeUndefined","decodeBreak","createToken","decodeFloat16","readFloat16","decodeFloat32","readFloat32","decodeFloat64","readFloat64","encodeFloat","float","decoded","success","encodeFloat16","ui8a","encodeFloat32","encodeFloat64","buffer","dataView","inp","valu32","exponent","mantissa","logicalExponent","half","exp","mant","val","invalidMinor","errorer","msg","jump","quick","makeCborEncoders","encoders","Type","encodeUint","encodeNegint","encodeBytes","encodeString","encodeArray","encodeMap","encodeTag","encodeFloat","cborEncoders","buf","Bl","Ref","_Ref","obj","parent","p","stack","encodeErrPrefix","simpleTokens","Token","typeEncoders","_typ","_options","_refStack","_obj","options","refStack","entries","i","e","objectToTokens","typ","isMap","keys","length","key","sortMapEntries","is","customTypeEncoder","tokens","typeEncoder","tokensToEncoded","buf","tokens","encoders","options","token","encodeCustom","data","objectToTokens","quickBytes","encoder","size","Bl","asU8A","defaultDecodeOptions","Tokeniser","data","options","byt","token","quick","decoder","jump","decodeErrPrefix","minor","DONE","BREAK","tokenToArray","tokeniser","arr","value","tokensToObject","tokenToMap","useMaps","obj","m","i","key","Type","tagged","decodeFirst","decoded","decode","remainder","JSONEncoder","buf","recurs","is","isa","_buf","_token","encodeErrPrefix","byts","fromString","asU8A","dp","mapSorter","e1","e2","keyToken1","keyToken2","defaultEncodeOptions","encode","encodeCustom","Tokenizer","c","str","startPos","negative","float","swallow","chars","ch","Token","numStr","num","l","readu4","u4","readUtf8Char","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","ch1","decodeCodePointsArray","empty","equals","aa","bb","ii","coerce","o","base","ALPHABET","name","BASE_MAP","j","x","xc","BASE","LEADER","FACTOR","iFACTOR","source","zeroes","length","pbegin","pend","size","b58","carry","it1","it2","decodeUnsafe","psz","b256","it3","it4","vch","string","buffer","src","_brrp__multiformats_scope_baseX","base_x_default","Encoder","prefix","baseEncode","bytes","Decoder","baseDecode","text","or","ComposedDecoder","decoders","input","left","right","Codec","from","baseX","alphabet","bitsPerChar","codes","end","out","bits","written","pad","mask","rfc4648","base32","base32upper","base32pad","base32padupper","base32hex","base32hexupper","base32hexpad","base32hexpadupper","base32z","base58btc","base58flickr","digest_exports","encode_1","MSB","REST","MSBALL","INT","offset","oldOffset","read","MSB$1","REST$1","res","shift","counter","b","N1","N2","N3","N4","N5","N6","N7","N8","N9","varint","_brrp_varint","varint_default","encodeTo","int","target","encodingLength","create","code","digest","sizeOffset","digestOffset","Digest","multihash","a","format","link","version","toStringV0","baseCache","toStringV1","cache","cid","CID","_CID","DAG_PB_CODE","SHA_256_CODE","other","self","unknown","encodeCID","cidSymbol","specs","prefixSize","multihashBytes","digestBytes","initialBytes","next","codec","multihashCode","digestSize","multihashSize","parseCIDtoBytes","codeOffset","hashOffset","Hasher","result","base64","base64pad","base64url","base64urlpad","cidEncoder","cidString","bytesEncoder","bytesString","taBytesEncoder","abBytesEncoder","ab","undefinedEncoder","numberEncoder","encodeOptions","DagJsonTokenizer","keyToken","valueToken","innerKeyToken","innerValueToken","decodeOptions","node","utf8Decoder","parse","utf8Encoder","isBytes","lengths","exists","instance","checkFinished","output","min","createView","rotr","word","isLE","utf8ToBytes","toBytes","Hash","toStr","wrapConstructor","hashCons","hashC","msg","tmp","setBigUint64","view","byteOffset","_32n","_u32_max","wh","wl","h","SHA2","blockLen","outputLen","padOffset","len","pos","take","dataView","oview","outLen","state","to","finished","destroyed","Chi","Maj","SHA256_K","IV","SHA256_W","SHA256","A","B","C","D","E","F","G","H","W15","W2","s0","s1","sigma1","T1","T2","sha256","import_typebox","__toESM","require_typebox","import_compiler","require_compiler2","Nullable","schema","isCID","isShortHash","import_typebox","value","EntityID","isEncryptedApplog","l","CIDTB","isURL","URL","AppLogNoCidTB","Nullable","AppLogNoCidTBC","import_compiler","isValidApplogNoCid","AppLogNoCidTBC","AppLogTB","import_typebox","CIDTB","AppLogNoCidTB","AppLogTBC","import_compiler","getApplogTypeErrors","obj","isValidApplog","base36","baseX","base36upper","sha","name","data","sha256","from","sha512","WARN","LOG","DEBUG","VERBOSE","ERROR","E","prepareForPub","log","without","ERROR","cid","isEncryptedApplog","getCidSync","encodeBlock","WARN","logWithout","key","val","VERBOSE","encodeApplogAndGetCid","encodeApplog","bytes","hash","sha256","digest","digest_exports","CID","code","jsonObject","DEBUG","byteView","encode","toDate","argument","argStr","isBefore","date","dateToCompare","_date","_dateToCompare","freeGlobal","freeGlobal_default","freeSelf","root","root_default","Symbol","Symbol_default","objectProto","hasOwnProperty","nativeObjectToString","symToStringTag","getRawTag","value","isOwn","tag","unmasked","result","getRawTag_default","objectToString","objectToString_default","nullTag","undefinedTag","baseGetTag","baseGetTag_default","isObjectLike","isObjectLike_default","symbolTag","isSymbol","isSymbol_default","arrayMap","array","iteratee","index","length","arrayMap_default","isArray","isArray_default","INFINITY","symbolProto","symbolToString","baseToString","baseToString_default","reWhitespace","trimmedEndIndex","string","trimmedEndIndex_default","reTrimStart","baseTrim","baseTrim_default","isObject","type","isObject_default","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","other","isBinary","toNumber_default","MAX_INTEGER","toFinite","sign","toFinite_default","toInteger","remainder","toInteger_default","identity","identity_default","asyncTag","funcTag","genTag","proxyTag","isFunction","isFunction_default","coreJsData","coreJsData_default","maskSrcKey","uid","isMasked","func","isMasked_default","funcProto","funcToString","toSource","toSource_default","reRegExpChar","reIsHostCtor","reIsNative","baseIsNative","pattern","baseIsNative_default","getValue","object","key","getValue_default","getNative","getNative_default","WeakMap","WeakMap_default","metaMap","metaMap_default","baseSetData","data","baseSetData_default","objectCreate","baseCreate","proto","baseCreate_default","createCtor","Ctor","args","thisBinding","createCtor_default","WRAP_BIND_FLAG","createBind","bitmask","thisArg","isBind","wrapper","fn","createBind_default","apply","apply_default","nativeMax","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgs_default","composeArgsRight","holdersIndex","rightIndex","rightLength","offset","composeArgsRight_default","countHolders","placeholder","countHolders_default","baseLodash","baseLodash_default","MAX_ARRAY_LENGTH","LazyWrapper","LazyWrapper_default","noop","noop_default","getData","getData_default","realNames","realNames_default","getFuncName","otherFunc","getFuncName_default","LodashWrapper","chainAll","LodashWrapper_default","copyArray","source","copyArray_default","wrapperClone","wrapperClone_default","lodash","wrapperLodash_default","isLaziable","funcName","isLaziable_default","HOT_COUNT","HOT_SPAN","nativeNow","shortOut","count","lastCalled","stamp","remaining","shortOut_default","setData","setData_default","reWrapDetails","reSplitDetails","getWrapDetails","match","getWrapDetails_default","reWrapComment","insertWrapDetails","details","lastIndex","insertWrapDetails_default","constant","constant_default","defineProperty","defineProperty_default","baseSetToString","baseSetToString_default","setToString","setToString_default","arrayEach","arrayEach_default","baseFindIndex","predicate","fromIndex","fromRight","baseFindIndex_default","baseIsNaN","baseIsNaN_default","strictIndexOf","strictIndexOf_default","baseIndexOf","baseIndexOf_default","arrayIncludes","arrayIncludes_default","WRAP_BIND_KEY_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","WRAP_FLIP_FLAG","wrapFlags","updateWrapDetails","pair","updateWrapDetails_default","setWrapToString","reference","setWrapToString_default","WRAP_CURRY_BOUND_FLAG","createRecurry","wrapFunc","argPos","ary","arity","isCurry","newHolders","newHoldersRight","newPartials","newPartialsRight","newData","createRecurry_default","getHolder","getHolder_default","MAX_SAFE_INTEGER","reIsUint","isIndex","isIndex_default","nativeMin","reorder","indexes","arrLength","oldArray","reorder_default","PLACEHOLDER","replaceHolders","resIndex","replaceHolders_default","createHybrid","partialsRight","holdersRight","isAry","isBindKey","isFlip","holdersCount","createHybrid_default","createCurry","createCurry_default","createPartial","createPartial_default","mergeData","srcBitmask","newBitmask","isCommon","isCombo","mergeData_default","FUNC_ERROR_TEXT","createWrap","setter","createWrap_default","baseAssignValue","baseAssignValue_default","eq","eq_default","assignValue","objValue","assignValue_default","overRest","start","transform","otherArgs","overRest_default","baseRest","baseRest_default","isLength","isLength_default","isArrayLike","isArrayLike_default","isPrototype","isPrototype_default","baseTimes","n","baseTimes_default","argsTag","baseIsArguments","baseIsArguments_default","propertyIsEnumerable","isArguments","isArguments_default","stubFalse","stubFalse_default","freeExports","freeModule","moduleExports","Buffer","nativeIsBuffer","isBuffer","isBuffer_default","arrayTag","boolTag","dateTag","errorTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","typedArrayTags","baseIsTypedArray","baseIsTypedArray_default","baseUnary","baseUnary_default","freeProcess","nodeUtil","types","nodeUtil_default","nodeIsTypedArray","isTypedArray","isTypedArray_default","arrayLikeKeys","inherited","isArr","isArg","isBuff","isType","skipIndexes","arrayLikeKeys_default","overArg","arg","overArg_default","nativeKeys","nativeKeys_default","baseKeys","baseKeys_default","keys","keys_default","reIsDeepProp","reIsPlainProp","isKey","isKey_default","nativeCreate","nativeCreate_default","hashClear","hashClear_default","hashDelete","hashDelete_default","HASH_UNDEFINED","hashGet","hashGet_default","hashHas","hashHas_default","hashSet","hashSet_default","Hash","entries","entry","Hash_default","listCacheClear","listCacheClear_default","assocIndexOf","assocIndexOf_default","arrayProto","splice","listCacheDelete","listCacheDelete_default","listCacheGet","listCacheGet_default","listCacheHas","listCacheHas_default","listCacheSet","listCacheSet_default","ListCache","ListCache_default","Map","Map_default","mapCacheClear","mapCacheClear_default","isKeyable","isKeyable_default","getMapData","map","getMapData_default","mapCacheDelete","mapCacheDelete_default","mapCacheGet","mapCacheGet_default","mapCacheHas","mapCacheHas_default","mapCacheSet","size","mapCacheSet_default","MapCache","MapCache_default","memoize","resolver","memoized","cache","memoize_default","MAX_MEMOIZE_SIZE","memoizeCapped","memoizeCapped_default","rePropName","reEscapeChar","stringToPath","number","quote","subString","stringToPath_default","toString","toString_default","castPath","castPath_default","toKey","toKey_default","baseGet","path","baseGet_default","get","defaultValue","get_default","arrayPush","values","arrayPush_default","spreadableSymbol","isFlattenable","isFlattenable_default","baseFlatten","depth","isStrict","baseFlatten_default","flatten","flatten_default","flatRest","flatRest_default","stackClear","stackClear_default","stackDelete","stackDelete_default","stackGet","stackGet_default","stackHas","stackHas_default","LARGE_ARRAY_SIZE","stackSet","pairs","stackSet_default","Stack","Stack_default","arrayFilter","arrayFilter_default","stubArray","stubArray_default","nativeGetSymbols","getSymbols","symbol","getSymbols_default","baseGetAllKeys","keysFunc","symbolsFunc","baseGetAllKeys_default","getAllKeys","getAllKeys_default","DataView","DataView_default","Promise","Promise_default","Set","Set_default","promiseTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","getTag","ctorString","getTag_default","Uint8Array","Uint8Array_default","setCacheAdd","setCacheAdd_default","setCacheHas","setCacheHas_default","SetCache","SetCache_default","arraySome","arraySome_default","cacheHas","cacheHas_default","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","customizer","equalFunc","stack","isPartial","othLength","arrStacked","othStacked","seen","arrValue","othValue","compared","othIndex","equalArrays_default","mapToArray","mapToArray_default","setToArray","set","setToArray_default","symbolValueOf","equalByTag","convert","stacked","equalByTag_default","equalObjects","objProps","objLength","othProps","objStacked","skipCtor","objCtor","othCtor","equalObjects_default","baseIsEqualDeep","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","baseIsEqualDeep_default","baseIsEqual","baseIsEqual_default","baseIsMatch","matchData","noCustomizer","srcValue","baseIsMatch_default","isStrictComparable","isStrictComparable_default","getMatchData","getMatchData_default","matchesStrictComparable","matchesStrictComparable_default","baseMatches","baseMatches_default","baseHasIn","baseHasIn_default","hasPath","hasFunc","hasPath_default","hasIn","hasIn_default","baseMatchesProperty","baseMatchesProperty_default","baseProperty","baseProperty_default","basePropertyDeep","basePropertyDeep_default","property","property_default","baseIteratee","baseIteratee_default","baseSet","object","path","value","customizer","isObject_default","castPath_default","index","length","lastIndex","nested","key","toKey_default","newValue","objValue","isIndex_default","assignValue_default","baseSet_default","basePickBy","paths","predicate","result","baseGet_default","basePickBy_default","WRAP_PARTIAL_FLAG","partial","baseRest_default","func","partials","holders","replaceHolders_default","getHolder_default","createWrap_default","partial_default","basePick","hasIn_default","basePick_default","pick","flatRest_default","pick_default","MAX_ARRAY_LENGTH","MAX_ARRAY_INDEX","nativeFloor","nativeMin","baseSortedIndexBy","array","iteratee","retHighest","low","high","valIsNaN","valIsNull","valIsSymbol","isSymbol_default","valIsUndefined","mid","computed","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedIndexBy_default","sortedIndexBy","baseIteratee_default","sortedIndexBy_default","INFINITY","createSet","Set_default","setToArray_default","values","noop_default","WARN","LOG","DEBUG","VERBOSE","ERROR","E","isoDateStrCompare","strA","strB","dir","objEqualByKeys","keys","objA","objB","comparer","pick_default","compareApplogsByTs","logA","logB","compareApplogsByEnAt","partial_default","sortApplogsByTs","appLogArray","a","b","isTsBefore","log","logToCompare","isBefore","removeDuplicateAppLogs","appLogArray","logMap","eachLog","ERROR","key","VERBOSE","isVariable","x","variableNameWithoutQuestionmark","str","resolveOrRemoveVariables","pattern","candidate","variablesToFill","newPattern","patternKey","patternValue","isVariable","varName","variableNameWithoutQuestionmark","candidateValue","matchPartStatic","field","patternPart","atomPart","result","typ","sum","array","num","i","l","mean","arrStats","a","b","mid","modeMap","maxCount","modes","val","standardDeviation","cyrb53hash","str","seed","strLength","h1","h2","i","ch","dateNowIso","WARN","LOG","DEBUG","VERBOSE","ERROR","E","ensureTsPvAndFinalizeApplogs","appLogsToInsert","threadForPv","ts","currentThread","log","finalizeApplogForInsert","finalizeApplogForInsert","log","ts","threadForPv","logWithTs","withTs","dateNowIso","logWithPv","withPvFrom","cid","encodeApplogAndGetCid","WARN","logWithCid","isValidApplog","ERROR","getApplogTypeErrors","hasTs","log","hasPv","withTs","ts","withPvFrom","thread","en","at","prevLog","l","objEqualByKeys","ERROR","prevLogCid","joinThreads","threads","fullJoin","untracked","DEBUG","sortApplogsByTs","removeDuplicateAppLogs","s","logs","initialMergeResult","eventMapper","action","event","sourceThread","isInitEvent","addedLog","removedLog","parent","MappedThread","WARN","LOG","VERBOSE","E","_MappedThread","Thread","name","parents","filters","_initialLogs","_eventMapper","_writeMapper","observable","makeObservable","mapper","appLogsToInsert","mapped","autorunDisposer","autorun","p","unseen","sub","unsubscribe","callback","toJS","mapResult","sortedIndexBy_default","toRemove","getDependencyTree","rollingFilter","computedFnDeepCompare","pattern","opts","untrackedPattern","getUntrackedPattern","filter","makeFilter","observableArr","wrapper_default","handleUpdateEvent","mappedEvent","mappedThread","cancelPatternReaction","reaction","pat","unobserveUnobserving","onBecomeUnobserved","applogThreadComparer","createDebugName","rollingMapper","initialMapResult","initialLogs","_mapper","rollingAcc","acc","eventMapperAction","_acc","k","v","applog","field","patternValue","applogValue","matchPartStatic","WARN","LOG","DEBUG","VERBOSE","ERROR","E","WriteableThread","Thread","name","applogs","filters","makeObservable","cidsToPurge","beforeCount","log","appLogsToInsert","mapped","ensureTsPvAndFinalizeApplogs","deduplicated","removeDuplicateAppLogs","bogus","isValidApplog","existing","ThreadInMemory","sortApplogsByTs","sortNeeded","isTsBefore","_ThreadInMemory","_readOnly","observable","readOnly","logs","WARN","LOG","DEBUG","VERBOSE","ERROR","E","agentToShortHash","agentString","cyrb53hash","QueryNode","logsOfThisNode","variables","prevNode","makeObservable","computed","joinThreads","QueryResult","nodes","untracked","observableArrayMap","thread","node","WARN","LOG","DEBUG","VERBOSE","ERROR","E","lastWriteWins","computedFnDeepCompare","inverseToOnlyReturnFirstLogs","tolerateAlreadyFiltered","rollingMap","mappedThread","rollingMapper","event","sourceThread","isInitial","isInitEvent","newLogs","toAdd","toRemove","tsCheck","i","log","key","existing","sortApplogsByTs","k","v","autorun","applogThreadComparer","createDebugName","withoutDeleted","deletionLogs","rollingFilter2","obsArrMapName","deleted","observableSetMap","query","threadOrLogs","patternOrPatterns","startVariables","opts","threadFromMaybeArray","patterns","pattersExceptLast","lastPattern","stepResult","queryStep","toJS","queryNodesComparer","pattern","startVars","nodeSet","doQuery","patternWithResolvedVars","variablesToFill","resolveOrRemoveVariables","applogsMatchingStatic","varMapper","createObjMapper","resultNodes","newVarsAndTheirLog","vars","nodeVars","StaticThread","wrapper_default","observableResultNodes","_nodes","queryNot","startNodes","_variablesToFill","newApplogs","filterAndMap","mapper","filtered","name","mapped","mapThreadWith","comparer","queryAndMap","mapDef","debugName","queryResult","mapQueryResultWith","queryEntity","entityID","attributes","prefixAttrs","at","vl","computedStructuralComparer","agentsOfThread","observable","onEvent","action","prev","unsubscribe","onBecomeObserved","entityOverlap","threadA","threadB","entitiesA","entitiesB","en","entityOverlapCount","computedFnDeepCompare","threadA","threadB","computed","entityOverlap","querySingle","threadOrLogs","patternOrPatterns","variables","result","query","ERROR","logsOfThisNode","comparer","thread","pattern","createDebugName","querySingleAndMap","mapDef","resultBox","log","createObjMapper","mapThreadWith","mapQueryResultWith","queryResult","node","applogFieldMap","applog","acc","key","value","prefixAttrs","prefix","attrs","at","prefixAt","attr","threadFromMaybeArray","threadOrLogs","ThreadInMemory","require_encode","__commonJS","exports","module","encode","MSB","REST","MSBALL","INT","num","out","offset","oldOffset","require_decode","read","buf","res","shift","counter","b","l","require_length","N1","N2","N3","N4","N5","N6","N7","N8","N9","value","require_varint","empty","equals","aa","bb","ii","coerce","o","base","ALPHABET","name","BASE_MAP","j","x","xc","BASE","LEADER","FACTOR","iFACTOR","source","zeroes","length","pbegin","pend","size","b58","carry","i","it1","it2","str","decodeUnsafe","psz","b256","it3","it4","vch","decode","string","buffer","src","_brrp__multiformats_scope_baseX","base_x_default","Encoder","prefix","baseEncode","bytes","Decoder","baseDecode","prefixCodePoint","text","decoder","or","ComposedDecoder","decoders","input","left","right","Codec","from","baseX","alphabet","bitsPerChar","codes","end","bits","written","data","pad","mask","rfc4648","base32","base32upper","base32pad","base32padupper","base32hex","base32hexupper","base32hexpad","base32hexpadupper","base32z","base36","base36upper","base58btc","base58flickr","encode_1","MSB$1","REST$1","varint","_brrp_varint","varint_default","encodeTo","int","target","encodingLength","create","code","digest","sizeOffset","digestOffset","Digest","multihash","a","format","link","version","toStringV0","baseCache","toStringV1","cache","cid","CID","_CID","DAG_PB_CODE","SHA_256_CODE","other","self","unknown","encodeCID","cidSymbol","remainder","specs","prefixSize","multihashBytes","digestBytes","initialBytes","next","codec","multihashCode","digestSize","multihashSize","parseCIDtoBytes","codeOffset","hashOffset","CID_CBOR_TAG","cidEncoder","obj","Token","Type","undefinedEncoder","numberEncoder","_encodeOptions","encodeOptions","cidDecoder","_decodeOptions","decodeOptions","import_varint","__toESM","require_varint","Kinds","obj","Types","i","v","ret","j","entries","requiredCount","key","value","Reprs","CarV1HeaderOrV2Pragma","cborEncoders","makeCborEncoders","import_varint","__toESM","require_varint","headerPreludeTokens","Token","Type","CID_TAG","import_varint","__toESM","require_varint","WARN","LOG","DEBUG","VERBOSE","ERROR","E","WARN","LOG","DEBUG","VERBOSE","ERROR","E","BaseAgentFields","BaseAgent","options","data","agentToShortHash"]}