@wovin/core 0.0.12 → 0.0.14

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 (21) hide show
  1. package/dist/applog.min.js +1 -1
  2. package/dist/{chunk-UREBOWFC.min.js → chunk-3HSO7QDN.min.js} +2 -2
  3. package/dist/{chunk-L4AYAZCN.min.js → chunk-CDGK7IKH.min.js} +2 -2
  4. package/dist/{chunk-76RDQNVD.min.js → chunk-DPU6MD7E.min.js} +2 -2
  5. package/dist/{chunk-UQJEOS7T.min.js → chunk-JEYJIYNF.min.js} +1 -1
  6. package/dist/chunk-JEYJIYNF.min.js.map +1 -0
  7. package/dist/{chunk-AFZ7UK4N.min.js → chunk-R3MVKMV2.min.js} +11 -6
  8. package/dist/{chunk-AFZ7UK4N.min.js.map → chunk-R3MVKMV2.min.js.map} +1 -1
  9. package/dist/index.min.js +5 -5
  10. package/dist/ipfs/car.d.ts.map +1 -1
  11. package/dist/ipfs.min.js +3 -3
  12. package/dist/pubsub.min.js +4 -4
  13. package/dist/query.min.js +3 -3
  14. package/dist/thread/basic.d.ts +1 -1
  15. package/dist/thread/basic.d.ts.map +1 -1
  16. package/dist/thread.min.js +1 -1
  17. package/package.json +1 -1
  18. package/dist/chunk-UQJEOS7T.min.js.map +0 -1
  19. /package/dist/{chunk-UREBOWFC.min.js.map → chunk-3HSO7QDN.min.js.map} +0 -0
  20. /package/dist/{chunk-L4AYAZCN.min.js.map → chunk-CDGK7IKH.min.js.map} +0 -0
  21. /package/dist/{chunk-76RDQNVD.min.js.map → chunk-DPU6MD7E.min.js.map} +0 -0
package/dist/chunk-JEYJIYNF.min.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../../../../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","../src/mobx/mobx-utils.ts","../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","../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","../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","../src/applog/applog-utils.ts","../src/applog/applog-helpers.ts","../src/thread/mapped.ts","../src/thread/filters.ts","../src/thread/writeable.ts","../src/thread/utils.ts"],"sourcesContent":["\"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: ArrayOrSingle<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"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA,gGAAAA,UAAA;AAAA;AAEA,WAAO,eAAeA,UAAS,cAAc;AAAA,MAC3C,OAAO;AAAA,IACT,CAAC;AAED,QAAI,UAAU,OAAO,WAAW,cAAc,OAAO,OAAO,aAAa,WAAW,SAAU,KAAK;AAAE,aAAO,OAAO;AAAA,IAAK,IAAI,SAAU,KAAK;AAAE,aAAO,OAAO,OAAO,WAAW,cAAc,IAAI,gBAAgB,UAAU,QAAQ,OAAO,YAAY,WAAW,OAAO;AAAA,IAAK;AAE3Q,QAAI,YAAY,OAAO,WAAW,eAAe,OAAO,OAAO,aAAa;AAE5E,QAAI,SAAS,OAAO,YAAY,eAAe,QAAQ,YAAY,QAAQ,QAAQ,SAAS,QAAQ;AAEpG,QAAI,eAAe,OAAO,SAAS,cAAc,cAAc,QAAQ,IAAI,OAAO,YAAY,KAAK,eAAe,KAAK,YAAY,SAAS;AAM5I,QAAI,UAAU,OAAO,WAAW,eAAe,OAAO,SAAS,YAAY,OAAO,cAAc,gBAAgB,UAAU,UAAU,SAAS,SAAS,KAAK,UAAU,UAAU,SAAS,OAAO;AAE/L,QAAI,SAAS,OAAO,SAAS,eAAe,OAAO,KAAK,YAAY,eAAe,OAAO,KAAK,QAAQ,SAAS;AAEhH,IAAAA,SAAQ,YAAY;AACpB,IAAAA,SAAQ,cAAc;AACtB,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,UAAU;AAClB,IAAAA,SAAQ,SAAS;AAAA;AAAA;;;AC1BjB;AAAA,kHAAAC,UAAAC,SAAA;AAAA;AAEA,IAAAA,QAAO,UAAU,SAAU,MAAM,MAAM;AACnC,UAAI,CAAC;AAAM,eAAO,CAAC;AACnB,UAAI,OAAO,SAAS;AAAY,eAAO,EAAE,KAAK,KAAK;AACnD,UAAI,SAAU,OAAO,KAAK,WAAW,YAAa,KAAK,SAAS;AAEhE,UAAI,MAAM,KAAK,OAAQ,yBAAU,GAAG;AAChC,eAAO,SAAU,MAAM;AACnB,iBAAO,SAAU,GAAGC,IAAG;AACnB,gBAAI,OAAO,EAAE,KAAK,GAAG,OAAO,KAAK,CAAC,EAAE;AACpC,gBAAI,OAAO,EAAE,KAAKA,IAAG,OAAO,KAAKA,EAAC,EAAE;AACpC,mBAAO,EAAE,MAAM,IAAI;AAAA,UACvB;AAAA,QACJ;AAAA,MACJ,EAAG,KAAK,GAAG;AAEX,UAAI,OAAO,CAAC;AACZ,aAAQ,SAAS,UAAW,MAAM;AAC9B,YAAI,QAAQ,KAAK,UAAU,OAAO,KAAK,WAAW,YAAY;AAC1D,iBAAO,KAAK,OAAO;AAAA,QACvB;AAEA,YAAI,SAAS;AAAW;AACxB,YAAI,OAAO,QAAQ;AAAU,iBAAO,SAAS,IAAI,IAAI,KAAK,OAAO;AACjE,YAAI,OAAO,SAAS;AAAU,iBAAO,KAAK,UAAU,IAAI;AAExD,YAAI,GAAG;AACP,YAAI,MAAM,QAAQ,IAAI,GAAG;AACrB,gBAAM;AACN,eAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC9B,gBAAI;AAAG,qBAAO;AACd,mBAAO,UAAU,KAAK,CAAC,CAAC,KAAK;AAAA,UACjC;AACA,iBAAO,MAAM;AAAA,QACjB;AAEA,YAAI,SAAS;AAAM,iBAAO;AAE1B,YAAI,KAAK,QAAQ,IAAI,MAAM,IAAI;AAC3B,cAAI;AAAQ,mBAAO,KAAK,UAAU,WAAW;AAC7C,gBAAM,IAAI,UAAU,uCAAuC;AAAA,QAC/D;AAEA,YAAI,YAAY,KAAK,KAAK,IAAI,IAAI;AAClC,YAAIC,QAAO,OAAO,KAAK,IAAI,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC;AAClD,cAAM;AACN,aAAK,IAAI,GAAG,IAAIA,MAAK,QAAQ,KAAK;AAC9B,cAAI,MAAMA,MAAK,CAAC;AAChB,cAAI,QAAQ,UAAU,KAAK,GAAG,CAAC;AAE/B,cAAI,CAAC;AAAO;AACZ,cAAI;AAAK,mBAAO;AAChB,iBAAO,KAAK,UAAU,GAAG,IAAI,MAAM;AAAA,QACvC;AACA,aAAK,OAAO,WAAW,CAAC;AACxB,eAAO,MAAM,MAAM;AAAA,MACvB,EAAG,IAAI;AAAA,IACX;AAAA;AAAA;;;AC1DA;AAAA,wGAAAC,UAAAC,SAAA;AAAA;AAEA,QAAM,EAAE,gBAAAC,iBAAe,IAAI,OAAO;AAElC,QAAM,YAAYC,WAAU;AAG5B,cAAU,YAAYA;AAEtB,cAAU,YAAY;AAGtB,cAAU,UAAU;AAGpB,IAAAH,SAAQ,YAAY;AAEpB,IAAAA,SAAQ,YAAYG;AAEpB,IAAAF,QAAO,UAAU;AAGjB,QAAM,2BAA2B;AAIjC,aAAS,UAAW,KAAK;AAEvB,UAAI,IAAI,SAAS,OAAQ,CAAC,yBAAyB,KAAK,GAAG,GAAG;AAC5D,eAAO,IAAI,GAAG;AAAA,MAChB;AACA,aAAO,KAAK,UAAU,GAAG;AAAA,IAC3B;AAEA,aAAS,WAAY,OAAO;AAG1B,UAAI,MAAM,SAAS,KAAK;AACtB,eAAO,MAAM,KAAK;AAAA,MACpB;AACA,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,cAAM,eAAe,MAAM,CAAC;AAC5B,YAAI,WAAW;AACf,eAAO,aAAa,KAAK,MAAM,WAAW,CAAC,IAAI,cAAc;AAC3D,gBAAM,QAAQ,IAAI,MAAM,WAAW,CAAC;AACpC;AAAA,QACF;AACA,cAAM,QAAQ,IAAI;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAEA,QAAM,0CACJ,OAAO;AAAA,MACL,OAAO;AAAA,QACL,OAAO;AAAA,UACL,IAAI,UAAU;AAAA,QAChB;AAAA,MACF;AAAA,MACA,OAAO;AAAA,IACT,EAAE;AAEJ,aAAS,wBAAyB,OAAO;AACvC,aAAO,wCAAwC,KAAK,KAAK,MAAM,UAAa,MAAM,WAAW;AAAA,IAC/F;AAEA,aAAS,oBAAqB,OAAO,WAAW,gBAAgB;AAC9D,UAAI,MAAM,SAAS,gBAAgB;AACjC,yBAAiB,MAAM;AAAA,MACzB;AACA,YAAM,aAAa,cAAc,MAAM,KAAK;AAC5C,UAAI,MAAM,OAAO,UAAU,GAAG,MAAM,CAAC,CAAC;AACtC,eAAS,IAAI,GAAG,IAAI,gBAAgB,KAAK;AACvC,eAAO,GAAG,SAAS,IAAI,CAAC,KAAK,UAAU,GAAG,MAAM,CAAC,CAAC;AAAA,MACpD;AACA,aAAO;AAAA,IACT;AAEA,aAAS,uBAAwB,SAAS;AACxC,UAAIC,iBAAe,KAAK,SAAS,eAAe,GAAG;AACjD,cAAM,gBAAgB,QAAQ;AAC9B,YAAI,OAAO,kBAAkB,UAAU;AACrC,iBAAO,IAAI,aAAa;AAAA,QAC1B;AACA,YAAI,iBAAiB,MAAM;AACzB,iBAAO;AAAA,QACT;AACA,YAAI,kBAAkB,SAAS,kBAAkB,WAAW;AAC1D,iBAAO;AAAA,YACL,WAAY;AACV,oBAAM,IAAI,UAAU,uCAAuC;AAAA,YAC7D;AAAA,UACF;AAAA,QACF;AACA,cAAM,IAAI,UAAU,oFAAoF;AAAA,MAC1G;AACA,aAAO;AAAA,IACT;AAEA,aAAS,iBAAkB,SAAS,KAAK;AACvC,UAAI;AACJ,UAAIA,iBAAe,KAAK,SAAS,GAAG,GAAG;AACrC,gBAAQ,QAAQ,GAAG;AACnB,YAAI,OAAO,UAAU,WAAW;AAC9B,gBAAM,IAAI,UAAU,QAAQ,GAAG,oCAAoC;AAAA,QACrE;AAAA,MACF;AACA,aAAO,UAAU,SAAY,OAAO;AAAA,IACtC;AAEA,aAAS,yBAA0B,SAAS,KAAK;AAC/C,UAAI;AACJ,UAAIA,iBAAe,KAAK,SAAS,GAAG,GAAG;AACrC,gBAAQ,QAAQ,GAAG;AACnB,YAAI,OAAO,UAAU,UAAU;AAC7B,gBAAM,IAAI,UAAU,QAAQ,GAAG,mCAAmC;AAAA,QACpE;AACA,YAAI,CAAC,OAAO,UAAU,KAAK,GAAG;AAC5B,gBAAM,IAAI,UAAU,QAAQ,GAAG,+BAA+B;AAAA,QAChE;AACA,YAAI,QAAQ,GAAG;AACb,gBAAM,IAAI,WAAW,QAAQ,GAAG,yBAAyB;AAAA,QAC3D;AAAA,MACF;AACA,aAAO,UAAU,SAAY,WAAW;AAAA,IAC1C;AAEA,aAAS,aAAc,QAAQ;AAC7B,UAAI,WAAW,GAAG;AAChB,eAAO;AAAA,MACT;AACA,aAAO,GAAG,MAAM;AAAA,IAClB;AAEA,aAAS,qBAAsB,eAAe;AAC5C,YAAM,cAAc,oBAAI,IAAI;AAC5B,iBAAW,SAAS,eAAe;AACjC,YAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;AAC1D,sBAAY,IAAI,OAAO,KAAK,CAAC;AAAA,QAC/B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAEA,aAAS,gBAAiB,SAAS;AACjC,UAAIA,iBAAe,KAAK,SAAS,QAAQ,GAAG;AAC1C,cAAM,QAAQ,QAAQ;AACtB,YAAI,OAAO,UAAU,WAAW;AAC9B,gBAAM,IAAI,UAAU,+CAA+C;AAAA,QACrE;AACA,YAAI,OAAO;AACT,iBAAO,CAACE,WAAU;AAChB,gBAAI,UAAU,uDAAuD,OAAOA,MAAK;AACjF,gBAAI,OAAOA,WAAU;AAAY,yBAAW,KAAKA,OAAM,SAAS,CAAC;AACjE,kBAAM,IAAI,MAAM,OAAO;AAAA,UACzB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,aAASD,WAAW,SAAS;AAC3B,gBAAU,EAAE,GAAG,QAAQ;AACvB,YAAM,OAAO,gBAAgB,OAAO;AACpC,UAAI,MAAM;AACR,YAAI,QAAQ,WAAW,QAAW;AAChC,kBAAQ,SAAS;AAAA,QACnB;AACA,YAAI,EAAE,mBAAmB,UAAU;AACjC,kBAAQ,gBAAgB;AAAA,QAC1B;AAAA,MACF;AACA,YAAM,gBAAgB,uBAAuB,OAAO;AACpD,YAAM,SAAS,iBAAiB,SAAS,QAAQ;AACjD,YAAM,gBAAgB,iBAAiB,SAAS,eAAe;AAC/D,YAAM,eAAe,yBAAyB,SAAS,cAAc;AACrE,YAAM,iBAAiB,yBAAyB,SAAS,gBAAgB;AAEzE,eAAS,oBAAqB,KAAK,QAAQ,OAAO,UAAU,QAAQ,aAAa;AAC/E,YAAI,QAAQ,OAAO,GAAG;AAEtB,YAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,YAAY;AACrF,kBAAQ,MAAM,OAAO,GAAG;AAAA,QAC1B;AACA,gBAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK;AAExC,gBAAQ,OAAO,OAAO;AAAA,UACpB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACT;AACA,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACT;AAEA,gBAAI,MAAM;AACV,gBAAI,OAAO;AACX,kBAAM,sBAAsB;AAE5B,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACT;AACA,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACT;AACA,oBAAM,KAAK,KAAK;AAChB,kBAAI,WAAW,IAAI;AACjB,+BAAe;AACf,uBAAO;AAAA,EAAK,WAAW;AACvB,uBAAO;AAAA,EAAM,WAAW;AAAA,cAC1B;AACA,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAME,OAAM,oBAAoB,OAAO,CAAC,GAAG,OAAO,OAAO,UAAU,QAAQ,WAAW;AACtF,uBAAOA,SAAQ,SAAYA,OAAM;AACjC,uBAAO;AAAA,cACT;AACA,oBAAM,MAAM,oBAAoB,OAAO,CAAC,GAAG,OAAO,OAAO,UAAU,QAAQ,WAAW;AACtF,qBAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,uBAAO,GAAG,IAAI,QAAQ,aAAa,WAAW,CAAC;AAAA,cACjD;AACA,kBAAI,WAAW,IAAI;AACjB,uBAAO;AAAA,EAAK,mBAAmB;AAAA,cACjC;AACA,oBAAM,IAAI;AACV,qBAAO,IAAI,GAAG;AAAA,YAChB;AAEA,gBAAIC,QAAO,OAAO,KAAK,KAAK;AAC5B,kBAAM,YAAYA,MAAK;AACvB,gBAAI,cAAc,GAAG;AACnB,qBAAO;AAAA,YACT;AACA,gBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,qBAAO;AAAA,YACT;AACA,gBAAI,aAAa;AACjB,gBAAI,YAAY;AAChB,gBAAI,WAAW,IAAI;AACjB,6BAAe;AACf,qBAAO;AAAA,EAAM,WAAW;AACxB,2BAAa;AAAA,YACf;AACA,kBAAM,+BAA+B,KAAK,IAAI,WAAW,cAAc;AACvE,gBAAI,iBAAiB,CAAC,wBAAwB,KAAK,GAAG;AACpD,cAAAA,QAAO,WAAWA,KAAI;AAAA,YACxB;AACA,kBAAM,KAAK,KAAK;AAChB,qBAAS,IAAI,GAAG,IAAI,8BAA8B,KAAK;AACrD,oBAAMC,OAAMD,MAAK,CAAC;AAClB,oBAAM,MAAM,oBAAoBC,MAAK,OAAO,OAAO,UAAU,QAAQ,WAAW;AAChF,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,IAAI,UAAU,GAAG,GAAG;AACxD,4BAAY;AAAA,cACd;AAAA,YACF;AACA,gBAAI,YAAY,gBAAgB;AAC9B,oBAAM,cAAc,YAAY;AAChC,qBAAO,GAAG,SAAS,SAAS,UAAU,IAAI,aAAa,WAAW,CAAC;AACnE,0BAAY;AAAA,YACd;AACA,gBAAI,WAAW,MAAM,UAAU,SAAS,GAAG;AACzC,oBAAM;AAAA,EAAK,WAAW,GAAG,GAAG;AAAA,EAAK,mBAAmB;AAAA,YACtD;AACA,kBAAM,IAAI;AACV,mBAAO,IAAI,GAAG;AAAA,UAChB;AAAA,UACA,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YACrB;AAAA,UAEF;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QAChC;AAAA,MACF;AAEA,eAAS,uBAAwB,KAAK,OAAO,OAAO,UAAU,QAAQ,aAAa;AACjF,YAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,MAAM,WAAW,YAAY;AACrF,kBAAQ,MAAM,OAAO,GAAG;AAAA,QAC1B;AAEA,gBAAQ,OAAO,OAAO;AAAA,UACpB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACT;AACA,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACT;AAEA,kBAAM,sBAAsB;AAC5B,gBAAI,MAAM;AACV,gBAAI,OAAO;AAEX,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACT;AACA,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACT;AACA,oBAAM,KAAK,KAAK;AAChB,kBAAI,WAAW,IAAI;AACjB,+BAAe;AACf,uBAAO;AAAA,EAAK,WAAW;AACvB,uBAAO;AAAA,EAAM,WAAW;AAAA,cAC1B;AACA,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMF,OAAM,uBAAuB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,UAAU,QAAQ,WAAW;AAC5F,uBAAOA,SAAQ,SAAYA,OAAM;AACjC,uBAAO;AAAA,cACT;AACA,oBAAM,MAAM,uBAAuB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,UAAU,QAAQ,WAAW;AAC5F,qBAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,uBAAO,GAAG,IAAI,QAAQ,aAAa,WAAW,CAAC;AAAA,cACjD;AACA,kBAAI,WAAW,IAAI;AACjB,uBAAO;AAAA,EAAK,mBAAmB;AAAA,cACjC;AACA,oBAAM,IAAI;AACV,qBAAO,IAAI,GAAG;AAAA,YAChB;AACA,kBAAM,KAAK,KAAK;AAChB,gBAAI,aAAa;AACjB,gBAAI,WAAW,IAAI;AACjB,6BAAe;AACf,qBAAO;AAAA,EAAM,WAAW;AACxB,2BAAa;AAAA,YACf;AACA,gBAAI,YAAY;AAChB,uBAAWE,QAAO,UAAU;AAC1B,oBAAM,MAAM,uBAAuBA,MAAK,MAAMA,IAAG,GAAG,OAAO,UAAU,QAAQ,WAAW;AACxF,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,IAAI,UAAU,GAAG,GAAG;AACxD,4BAAY;AAAA,cACd;AAAA,YACF;AACA,gBAAI,WAAW,MAAM,UAAU,SAAS,GAAG;AACzC,oBAAM;AAAA,EAAK,WAAW,GAAG,GAAG;AAAA,EAAK,mBAAmB;AAAA,YACtD;AACA,kBAAM,IAAI;AACV,mBAAO,IAAI,GAAG;AAAA,UAChB;AAAA,UACA,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YACrB;AAAA,UAEF;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QAChC;AAAA,MACF;AAEA,eAAS,gBAAiB,KAAK,OAAO,OAAO,QAAQ,aAAa;AAChE,gBAAQ,OAAO,OAAO;AAAA,UACpB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACT;AACA,gBAAI,OAAO,MAAM,WAAW,YAAY;AACtC,sBAAQ,MAAM,OAAO,GAAG;AAExB,kBAAI,OAAO,UAAU,UAAU;AAC7B,uBAAO,gBAAgB,KAAK,OAAO,OAAO,QAAQ,WAAW;AAAA,cAC/D;AACA,kBAAI,UAAU,MAAM;AAClB,uBAAO;AAAA,cACT;AAAA,YACF;AACA,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACT;AACA,kBAAM,sBAAsB;AAE5B,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACT;AACA,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACT;AACA,oBAAM,KAAK,KAAK;AAChB,6BAAe;AACf,kBAAIC,OAAM;AAAA,EAAK,WAAW;AAC1B,oBAAMC,QAAO;AAAA,EAAM,WAAW;AAC9B,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMJ,OAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,QAAQ,WAAW;AAC3E,gBAAAG,QAAOH,SAAQ,SAAYA,OAAM;AACjC,gBAAAG,QAAOC;AAAA,cACT;AACA,oBAAM,MAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,OAAO,QAAQ,WAAW;AAC3E,cAAAD,QAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,gBAAAA,QAAO,GAAGC,KAAI,QAAQ,aAAa,WAAW,CAAC;AAAA,cACjD;AACA,cAAAD,QAAO;AAAA,EAAK,mBAAmB;AAC/B,oBAAM,IAAI;AACV,qBAAO,IAAIA,IAAG;AAAA,YAChB;AAEA,gBAAIF,QAAO,OAAO,KAAK,KAAK;AAC5B,kBAAM,YAAYA,MAAK;AACvB,gBAAI,cAAc,GAAG;AACnB,qBAAO;AAAA,YACT;AACA,gBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,qBAAO;AAAA,YACT;AACA,2BAAe;AACf,kBAAM,OAAO;AAAA,EAAM,WAAW;AAC9B,gBAAI,MAAM;AACV,gBAAI,YAAY;AAChB,gBAAI,+BAA+B,KAAK,IAAI,WAAW,cAAc;AACrE,gBAAI,wBAAwB,KAAK,GAAG;AAClC,qBAAO,oBAAoB,OAAO,MAAM,cAAc;AACtD,cAAAA,QAAOA,MAAK,MAAM,MAAM,MAAM;AAC9B,8CAAgC,MAAM;AACtC,0BAAY;AAAA,YACd;AACA,gBAAI,eAAe;AACjB,cAAAA,QAAO,WAAWA,KAAI;AAAA,YACxB;AACA,kBAAM,KAAK,KAAK;AAChB,qBAAS,IAAI,GAAG,IAAI,8BAA8B,KAAK;AACrD,oBAAMC,OAAMD,MAAK,CAAC;AAClB,oBAAM,MAAM,gBAAgBC,MAAK,MAAMA,IAAG,GAAG,OAAO,QAAQ,WAAW;AACvE,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,KAAK,GAAG;AAC5C,4BAAY;AAAA,cACd;AAAA,YACF;AACA,gBAAI,YAAY,gBAAgB;AAC9B,oBAAM,cAAc,YAAY;AAChC,qBAAO,GAAG,SAAS,WAAW,aAAa,WAAW,CAAC;AACvD,0BAAY;AAAA,YACd;AACA,gBAAI,cAAc,IAAI;AACpB,oBAAM;AAAA,EAAK,WAAW,GAAG,GAAG;AAAA,EAAK,mBAAmB;AAAA,YACtD;AACA,kBAAM,IAAI;AACV,mBAAO,IAAI,GAAG;AAAA,UAChB;AAAA,UACA,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YACrB;AAAA,UAEF;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QAChC;AAAA,MACF;AAEA,eAAS,gBAAiB,KAAK,OAAO,OAAO;AAC3C,gBAAQ,OAAO,OAAO;AAAA,UACpB,KAAK;AACH,mBAAO,UAAU,KAAK;AAAA,UACxB,KAAK,UAAU;AACb,gBAAI,UAAU,MAAM;AAClB,qBAAO;AAAA,YACT;AACA,gBAAI,OAAO,MAAM,WAAW,YAAY;AACtC,sBAAQ,MAAM,OAAO,GAAG;AAExB,kBAAI,OAAO,UAAU,UAAU;AAC7B,uBAAO,gBAAgB,KAAK,OAAO,KAAK;AAAA,cAC1C;AACA,kBAAI,UAAU,MAAM;AAClB,uBAAO;AAAA,cACT;AAAA,YACF;AACA,gBAAI,MAAM,QAAQ,KAAK,MAAM,IAAI;AAC/B,qBAAO;AAAA,YACT;AAEA,gBAAI,MAAM;AAEV,gBAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,kBAAI,MAAM,WAAW,GAAG;AACtB,uBAAO;AAAA,cACT;AACA,kBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,uBAAO;AAAA,cACT;AACA,oBAAM,KAAK,KAAK;AAChB,oBAAM,2BAA2B,KAAK,IAAI,MAAM,QAAQ,cAAc;AACtE,kBAAI,IAAI;AACR,qBAAO,IAAI,2BAA2B,GAAG,KAAK;AAC5C,sBAAMF,OAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK;AACtD,uBAAOA,SAAQ,SAAYA,OAAM;AACjC,uBAAO;AAAA,cACT;AACA,oBAAM,MAAM,gBAAgB,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK;AACtD,qBAAO,QAAQ,SAAY,MAAM;AACjC,kBAAI,MAAM,SAAS,IAAI,gBAAgB;AACrC,sBAAM,cAAc,MAAM,SAAS,iBAAiB;AACpD,uBAAO,SAAS,aAAa,WAAW,CAAC;AAAA,cAC3C;AACA,oBAAM,IAAI;AACV,qBAAO,IAAI,GAAG;AAAA,YAChB;AAEA,gBAAIC,QAAO,OAAO,KAAK,KAAK;AAC5B,kBAAM,YAAYA,MAAK;AACvB,gBAAI,cAAc,GAAG;AACnB,qBAAO;AAAA,YACT;AACA,gBAAI,eAAe,MAAM,SAAS,GAAG;AACnC,qBAAO;AAAA,YACT;AACA,gBAAI,YAAY;AAChB,gBAAI,+BAA+B,KAAK,IAAI,WAAW,cAAc;AACrE,gBAAI,wBAAwB,KAAK,GAAG;AAClC,qBAAO,oBAAoB,OAAO,KAAK,cAAc;AACrD,cAAAA,QAAOA,MAAK,MAAM,MAAM,MAAM;AAC9B,8CAAgC,MAAM;AACtC,0BAAY;AAAA,YACd;AACA,gBAAI,eAAe;AACjB,cAAAA,QAAO,WAAWA,KAAI;AAAA,YACxB;AACA,kBAAM,KAAK,KAAK;AAChB,qBAAS,IAAI,GAAG,IAAI,8BAA8B,KAAK;AACrD,oBAAMC,OAAMD,MAAK,CAAC;AAClB,oBAAM,MAAM,gBAAgBC,MAAK,MAAMA,IAAG,GAAG,KAAK;AAClD,kBAAI,QAAQ,QAAW;AACrB,uBAAO,GAAG,SAAS,GAAG,UAAUA,IAAG,CAAC,IAAI,GAAG;AAC3C,4BAAY;AAAA,cACd;AAAA,YACF;AACA,gBAAI,YAAY,gBAAgB;AAC9B,oBAAM,cAAc,YAAY;AAChC,qBAAO,GAAG,SAAS,UAAU,aAAa,WAAW,CAAC;AAAA,YACxD;AACA,kBAAM,IAAI;AACV,mBAAO,IAAI,GAAG;AAAA,UAChB;AAAA,UACA,KAAK;AACH,mBAAO,SAAS,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,UAChE,KAAK;AACH,mBAAO,UAAU,OAAO,SAAS;AAAA,UACnC,KAAK;AACH,mBAAO;AAAA,UACT,KAAK;AACH,gBAAI,QAAQ;AACV,qBAAO,OAAO,KAAK;AAAA,YACrB;AAAA,UAEF;AACE,mBAAO,OAAO,KAAK,KAAK,IAAI;AAAA,QAChC;AAAA,MACF;AAEA,eAASG,WAAW,OAAO,UAAU,OAAO;AAC1C,YAAI,UAAU,SAAS,GAAG;AACxB,cAAI,SAAS;AACb,cAAI,OAAO,UAAU,UAAU;AAC7B,qBAAS,IAAI,OAAO,KAAK,IAAI,OAAO,EAAE,CAAC;AAAA,UACzC,WAAW,OAAO,UAAU,UAAU;AACpC,qBAAS,MAAM,MAAM,GAAG,EAAE;AAAA,UAC5B;AACA,cAAI,YAAY,MAAM;AACpB,gBAAI,OAAO,aAAa,YAAY;AAClC,qBAAO,oBAAoB,IAAI,EAAE,IAAI,MAAM,GAAG,CAAC,GAAG,UAAU,QAAQ,EAAE;AAAA,YACxE;AACA,gBAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,qBAAO,uBAAuB,IAAI,OAAO,CAAC,GAAG,qBAAqB,QAAQ,GAAG,QAAQ,EAAE;AAAA,YACzF;AAAA,UACF;AACA,cAAI,OAAO,WAAW,GAAG;AACvB,mBAAO,gBAAgB,IAAI,OAAO,CAAC,GAAG,QAAQ,EAAE;AAAA,UAClD;AAAA,QACF;AACA,eAAO,gBAAgB,IAAI,OAAO,CAAC,CAAC;AAAA,MACtC;AAEA,aAAOA;AAAA,IACT;AAAA;AAAA;;;ACnmBA;AAAA,wGAAAC,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,cAAcA,SAAQ,WAAWA,SAAQ,aAAaA,SAAQ,WAAWA,SAAQ,WAAWA,SAAQ,YAAYA,SAAQ,WAAWA,SAAQ,YAAYA,SAAQ,SAASA,SAAQ,cAAcA,SAAQ,UAAUA,SAAQ,WAAWA,SAAQ,gBAAgBA,SAAQ,iBAAiBA,SAAQ,SAASA,SAAQ,eAAeA,SAAQ,YAAYA,SAAQ,eAAeA,SAAQ,aAAaA,SAAQ,kBAAkB;AAK9Z,aAAS,gBAAgB,OAAO;AAC5B,aAAO,SAAS,KAAK,KAAK,OAAO,iBAAiB;AAAA,IACtD;AACA,IAAAA,SAAQ,kBAAkB;AAE1B,aAAS,WAAW,OAAO;AACvB,aAAO,SAAS,KAAK,KAAK,OAAO,YAAY;AAAA,IACjD;AACA,IAAAA,SAAQ,aAAa;AAKrB,aAAS,aAAa,OAAO;AACzB,aAAO,YAAY,OAAO,KAAK;AAAA,IACnC;AACA,IAAAA,SAAQ,eAAe;AAEvB,aAAS,UAAU,OAAO;AACtB,aAAO,iBAAiB;AAAA,IAC5B;AACA,IAAAA,SAAQ,YAAY;AAEpB,aAAS,aAAa,OAAO;AACzB,aAAO,iBAAiB;AAAA,IAC5B;AACA,IAAAA,SAAQ,eAAe;AAEvB,aAAS,OAAO,OAAO;AACnB,aAAO,iBAAiB,QAAQ,OAAO,SAAS,MAAM,QAAQ,CAAC;AAAA,IACnE;AACA,IAAAA,SAAQ,SAAS;AAKjB,aAAS,eAAe,OAAO,KAAK;AAChC,aAAO,OAAO;AAAA,IAClB;AACA,IAAAA,SAAQ,iBAAiB;AAEzB,aAAS,cAAc,OAAO;AAC1B,aAAO,SAAS,KAAK,KAAK,WAAW,MAAM,WAAW,KAAK,MAAM,YAAY,SAAS;AAAA,IAC1F;AACA,IAAAA,SAAQ,gBAAgB;AAExB,aAAS,SAAS,OAAO;AACrB,aAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,IAC9C;AACA,IAAAA,SAAQ,WAAW;AAEnB,aAAS,QAAQ,OAAO;AACpB,aAAO,MAAM,QAAQ,KAAK,KAAK,CAAC,YAAY,OAAO,KAAK;AAAA,IAC5D;AACA,IAAAA,SAAQ,UAAU;AAElB,aAAS,YAAY,OAAO;AACxB,aAAO,UAAU;AAAA,IACrB;AACA,IAAAA,SAAQ,cAAc;AAEtB,aAAS,OAAO,OAAO;AACnB,aAAO,UAAU;AAAA,IACrB;AACA,IAAAA,SAAQ,SAAS;AAEjB,aAAS,UAAU,OAAO;AACtB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,IAAAA,SAAQ,YAAY;AAEpB,aAAS,SAAS,OAAO;AACrB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,IAAAA,SAAQ,WAAW;AAEnB,aAAS,UAAU,OAAO;AACtB,aAAO,SAAS,KAAK,KAAK,OAAO,UAAU,KAAK;AAAA,IACpD;AACA,IAAAA,SAAQ,YAAY;AAEpB,aAAS,SAAS,OAAO;AACrB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,IAAAA,SAAQ,WAAW;AAEnB,aAAS,SAAS,OAAO;AACrB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,IAAAA,SAAQ,WAAW;AAEnB,aAAS,WAAW,OAAO;AACvB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,IAAAA,SAAQ,aAAa;AAErB,aAAS,SAAS,OAAO;AACrB,aAAO,OAAO,UAAU;AAAA,IAC5B;AACA,IAAAA,SAAQ,WAAW;AAEnB,aAAS,YAAY,OAAO;AAExB,aAAQ,SAAS,KAAK,KAClB,UAAU,KAAK,KACf,OAAO,KAAK,KACZ,SAAS,KAAK,KACd,SAAS,KAAK,KACd,SAAS,KAAK,KACd,YAAY,KAAK;AAAA,IACzB;AACA,IAAAA,SAAQ,cAAc;AAAA;AAAA;;;ACjJtB;AAAA,0GAAAC,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,uBAAuBA,SAAQ,mBAAmBA,SAAQ,0BAA0BA,SAAQ,aAAaA,SAAQ,4BAA4BA,SAAQ,8BAA8B;AAC3L,QAAM,UAAU;AAChB,QAAM,WAAW;AACjB,QAAM,QAAQ;AAId,QAAM,8BAAN,cAA0C,MAAM,aAAa;AAAA,MACzD,YAAY,MAAM;AACd,cAAM,wBAAwB,IAAI,YAAY;AAAA,MAClD;AAAA,IACJ;AACA,IAAAA,SAAQ,8BAA8B;AACtC,QAAM,4BAAN,cAAwC,MAAM,aAAa;AAAA,MACvD,YAAY,MAAM;AACd,cAAM,4BAA4B,IAAI,YAAY;AAAA,MACtD;AAAA,IACJ;AACA,IAAAA,SAAQ,4BAA4B;AAKpC,QAAI;AACJ,KAAC,SAAUC,aAAY;AAEnB,eAASC,MAAK,MAAM,OAAO;AACvB,YAAI,MAAM,aAAa,IAAI,IAAI;AAC3B,gBAAM,IAAI,4BAA4B,IAAI;AAC9C,cAAM,aAAa,IAAI,MAAM,KAAK;AAClC,eAAO,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,OAAO,EAAE,GAAG,SAAS,CAAC,MAAM,IAAI,GAAG,KAAK,CAAC;AAAA,MACjF;AACA,MAAAD,YAAW,OAAOC;AAElB,eAAS,OAAOC,SAAQ,OAAO;AAC3B,YAAI,MAAM,eAAe,IAAIA,OAAM;AAC/B,gBAAM,IAAI,0BAA0BA,OAAM;AAC9C,cAAM,eAAe,IAAIA,SAAQ,KAAK;AACtC,eAAOA;AAAA,MACX;AACA,MAAAF,YAAW,SAAS;AAAA,IACxB,GAAG,eAAeD,SAAQ,aAAa,aAAa,CAAC,EAAE;AAKvD,QAAI;AACJ,KAAC,SAAUI,0BAAyB;AAChC,UAAI,uBAAuB;AAE3B,eAAS,QAAQ;AACb,+BAAuB;AAAA,MAC3B;AACA,MAAAA,yBAAwB,QAAQ;AAEhC,eAASC,KAAI,UAAU;AACnB,+BAAuB;AAAA,MAC3B;AACA,MAAAD,yBAAwB,MAAMC;AAE9B,eAAS,MAAM;AACX,eAAO;AAAA,MACX;AACA,MAAAD,yBAAwB,MAAM;AAAA,IAClC,GAAG,4BAA4BJ,SAAQ,0BAA0B,0BAA0B,CAAC,EAAE;AAK9F,QAAI;AACJ,KAAC,SAAUM,mBAAkB;AAEzB,MAAAA,kBAAiB,6BAA6B;AAE9C,MAAAA,kBAAiB,mBAAmB;AAEpC,MAAAA,kBAAiB,WAAW;AAE5B,MAAAA,kBAAiB,gBAAgB;AAEjC,eAAS,wBAAwB,OAAO,KAAK;AACzC,eAAOA,kBAAiB,6BAA6B,OAAO,QAAQ,MAAM,GAAG,MAAM;AAAA,MACvF;AACA,MAAAA,kBAAiB,0BAA0B;AAE3C,eAAS,aAAa,OAAO;AACzB,cAAMC,aAAY,GAAG,QAAQ,UAAU,KAAK;AAC5C,eAAOD,kBAAiB,mBAAmBC,YAAWA,aAAY,EAAE,GAAG,QAAQ,SAAS,KAAK;AAAA,MACjG;AACA,MAAAD,kBAAiB,eAAe;AAEhC,eAAS,aAAa,OAAO;AACzB,eAAO,aAAa,KAAK,KAAK,EAAE,iBAAiB,SAAS,EAAE,iBAAiB;AAAA,MACjF;AACA,MAAAA,kBAAiB,eAAe;AAEhC,eAAS,aAAa,OAAO;AACzB,cAAM,YAAY,GAAG,QAAQ,UAAU,KAAK;AAC5C,eAAOA,kBAAiB,WAAW,WAAW,YAAY,OAAO,SAAS,KAAK;AAAA,MACnF;AACA,MAAAA,kBAAiB,eAAe;AAEhC,eAAS,WAAW,OAAO;AACvB,cAAM,eAAe,GAAG,QAAQ,aAAa,KAAK;AAClD,eAAOA,kBAAiB,gBAAgB,eAAe,UAAU,OAAO;AAAA,MAC5E;AACA,MAAAA,kBAAiB,aAAa;AAAA,IAClC,GAAG,qBAAqBN,SAAQ,mBAAmB,mBAAmB,CAAC,EAAE;AAKzE,aAAS,qBAAqB,QAAQ,WAAW;AAC7C,cAAQ,WAAW;AAAA,QACf,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,0CAA0C,OAAO,WAAW;AAAA,QACvE,KAAK,SAAS,eAAe;AACzB,iBAAO,sCAAsC,OAAO,WAAW;AAAA,QACnE,KAAK,SAAS,eAAe;AACzB,iBAAO,gDAAgD,OAAO,QAAQ;AAAA,QAC1E,KAAK,SAAS,eAAe;AACzB,iBAAO,mDAAmD,OAAO,QAAQ;AAAA,QAC7E,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,mCAAmC,OAAO,gBAAgB;AAAA,QACrE,KAAK,SAAS,eAAe;AACzB,iBAAO,sCAAsC,OAAO,gBAAgB;AAAA,QACxE,KAAK,SAAS,eAAe;AACzB,iBAAO,0CAA0C,OAAO,OAAO;AAAA,QACnE,KAAK,SAAS,eAAe;AACzB,iBAAO,6CAA6C,OAAO,OAAO;AAAA,QACtE,KAAK,SAAS,eAAe;AACzB,iBAAO,uCAAuC,OAAO,UAAU;AAAA,QACnE,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,8CAA8C,OAAO,yBAAyB;AAAA,QACzF,KAAK,SAAS,eAAe;AACzB,iBAAO,2CAA2C,OAAO,yBAAyB;AAAA,QACtF,KAAK,SAAS,eAAe;AACzB,iBAAO,qDAAqD,OAAO,gBAAgB;AAAA,QACvF,KAAK,SAAS,eAAe;AACzB,iBAAO,kDAAkD,OAAO,gBAAgB;AAAA,QACpF,KAAK,SAAS,eAAe;AACzB,iBAAO,+CAA+C,OAAO,mBAAmB;AAAA,QACpF,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,oCAAoC,OAAO,gBAAgB;AAAA,QACtE,KAAK,SAAS,eAAe;AACzB,iBAAO,uCAAuC,OAAO,gBAAgB;AAAA,QACzE,KAAK,SAAS,eAAe;AACzB,iBAAO,2CAA2C,OAAO,OAAO;AAAA,QACpE,KAAK,SAAS,eAAe;AACzB,iBAAO,8CAA8C,OAAO,OAAO;AAAA,QACvE,KAAK,SAAS,eAAe;AACzB,iBAAO,wCAAwC,OAAO,UAAU;AAAA,QACpE,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,YAAY,OAAO,OAAO,UAAU,WAAW,IAAI,OAAO,KAAK,MAAM,OAAO,KAAK;AAAA,QAC5F,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,mCAAmC,OAAO,gBAAgB;AAAA,QACrE,KAAK,SAAS,eAAe;AACzB,iBAAO,sCAAsC,OAAO,gBAAgB;AAAA,QACxE,KAAK,SAAS,eAAe;AACzB,iBAAO,0CAA0C,OAAO,OAAO;AAAA,QACnE,KAAK,SAAS,eAAe;AACzB,iBAAO,6CAA6C,OAAO,OAAO;AAAA,QACtE,KAAK,SAAS,eAAe;AACzB,iBAAO,uCAAuC,OAAO,UAAU;AAAA,QACnE,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,wCAAwC,OAAO,aAAa;AAAA,QACvE,KAAK,SAAS,eAAe;AACzB,iBAAO,oCAAoC,OAAO,aAAa;AAAA,QACnE,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,mBAAmB,OAAO,MAAM;AAAA,QAC3C,KAAK,SAAS,eAAe;AACzB,iBAAO,6BAA6B,OAAO,MAAM;AAAA,QACrD,KAAK,SAAS,eAAe;AACzB,iBAAO,2CAA2C,OAAO,SAAS;AAAA,QACtE,KAAK,SAAS,eAAe;AACzB,iBAAO,8CAA8C,OAAO,SAAS;AAAA,QACzE,KAAK,SAAS,eAAe;AACzB,iBAAO,6BAA6B,OAAO,OAAO;AAAA,QACtD,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,0BAA0B,OAAO,YAAY,CAAC;AAAA,QACzD,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,yCAAyC,OAAO,aAAa;AAAA,QACxE,KAAK,SAAS,eAAe;AACzB,iBAAO,4CAA4C,OAAO,aAAa;AAAA,QAC3E,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO;AAAA,QACX,KAAK,SAAS,eAAe;AACzB,iBAAO,kBAAkB,OAAO,MAAM,IAAI,CAAC;AAAA,QAC/C;AACI,iBAAO;AAAA,MACf;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAAA;AAAA;;;ACjR/B;AAAA,wGAAAQ,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,QAAQA,SAAQ,uBAAuB;AAC/C,QAAM,YAAY;AAClB,QAAM,uBAAN,cAAmC,UAAU,aAAa;AAAA,MACtD,YAAY,QAAQ;AAChB,cAAM,0CAA0C,OAAO,GAAG,GAAG;AAC7D,aAAK,SAAS;AAAA,MAClB;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAE/B,aAAS,MAAM,QAAQ,YAAY;AAC/B,YAAM,QAAQ,WAAW,UAAU,CAAC,WAAW,OAAO,QAAQ,OAAO,IAAI;AACzE,UAAI,UAAU;AACV,cAAM,IAAI,qBAAqB,MAAM;AACzC,aAAO,WAAW,KAAK;AAAA,IAC3B;AACA,IAAAA,SAAQ,QAAQ;AAAA;AAAA;;;AC7ChB;AAAA,uGAAAC,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,OAAOA,SAAQ,aAAaA,SAAQ,iBAAiB;AAC7D,QAAM,UAAU;AAIhB,QAAM,iBAAN,cAA6B,MAAM;AAAA,MAC/B,YAAY,OAAO;AACf,cAAM,sBAAsB;AAC5B,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AACA,IAAAA,SAAQ,iBAAiB;AAIzB,QAAI;AACJ,KAAC,SAAUC,aAAY;AACnB,MAAAA,YAAWA,YAAW,WAAW,IAAI,CAAC,IAAI;AAC1C,MAAAA,YAAWA,YAAW,MAAM,IAAI,CAAC,IAAI;AACrC,MAAAA,YAAWA,YAAW,SAAS,IAAI,CAAC,IAAI;AACxC,MAAAA,YAAWA,YAAW,QAAQ,IAAI,CAAC,IAAI;AACvC,MAAAA,YAAWA,YAAW,QAAQ,IAAI,CAAC,IAAI;AACvC,MAAAA,YAAWA,YAAW,QAAQ,IAAI,CAAC,IAAI;AACvC,MAAAA,YAAWA,YAAW,OAAO,IAAI,CAAC,IAAI;AACtC,MAAAA,YAAWA,YAAW,MAAM,IAAI,CAAC,IAAI;AACrC,MAAAA,YAAWA,YAAW,YAAY,IAAI,CAAC,IAAI;AAC3C,MAAAA,YAAWA,YAAW,QAAQ,IAAI,CAAC,IAAI;AACvC,MAAAA,YAAWA,YAAW,QAAQ,IAAI,EAAE,IAAI;AAAA,IAC5C,GAAG,eAAeD,SAAQ,aAAa,aAAa,CAAC,EAAE;AAIvD,QAAI,cAAc,OAAO,sBAAsB;AAC/C,QAAM,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,eAAe,GAAG,OAAO,GAAG,KAAK,OAAO,IAAI,CAAC;AAC3E,QAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC;AACjE,QAAM,MAAM,IAAI,aAAa,CAAC;AAC9B,QAAM,QAAQ,IAAI,SAAS,IAAI,MAAM;AACrC,QAAM,SAAS,IAAI,WAAW,IAAI,MAAM;AAIxC,cAAU,cAAc,OAAO;AAC3B,YAAM,YAAY,UAAU,IAAI,IAAI,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC;AAClF,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAChC,cAAO,SAAU,KAAK,YAAY,IAAI,KAAO;AAAA,MACjD;AAAA,IACJ;AAIA,aAAS,UAAU,OAAO;AACtB,cAAQ,WAAW,KAAK;AACxB,iBAAW,QAAQ,OAAO;AACtB,cAAM,IAAI;AAAA,MACd;AAAA,IACJ;AACA,aAAS,YAAY,OAAO;AACxB,cAAQ,WAAW,OAAO;AAC1B,cAAQ,QAAQ,IAAI,CAAC;AAAA,IACzB;AACA,aAAS,WAAW,OAAO;AACvB,cAAQ,WAAW,MAAM;AACzB,YAAM,YAAY,GAAG,KAAK;AAC1B,iBAAW,QAAQ,QAAQ;AACvB,gBAAQ,IAAI;AAAA,MAChB;AAAA,IACJ;AACA,aAAS,SAAS,OAAO;AACrB,cAAQ,WAAW,IAAI;AACvB,YAAM,MAAM,QAAQ,CAAC;AAAA,IACzB;AACA,aAAS,SAAS,OAAO;AACrB,cAAQ,WAAW,IAAI;AAAA,IAC3B;AACA,aAAS,WAAW,OAAO;AACvB,cAAQ,WAAW,MAAM;AACzB,YAAM,WAAW,GAAG,KAAK;AACzB,iBAAW,QAAQ,QAAQ;AACvB,gBAAQ,IAAI;AAAA,MAChB;AAAA,IACJ;AACA,aAAS,WAAW,OAAO;AACvB,cAAQ,WAAW,MAAM;AACzB,iBAAW,OAAO,WAAW,OAAO,KAAK,KAAK,EAAE,KAAK,GAAG;AACpD,cAAM,GAAG;AACT,cAAM,MAAM,GAAG,CAAC;AAAA,MACpB;AAAA,IACJ;AACA,aAAS,WAAW,OAAO;AACvB,cAAQ,WAAW,MAAM;AACzB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,mBAAW,QAAQ,cAAc,MAAM,WAAW,CAAC,CAAC,GAAG;AACnD,kBAAQ,IAAI;AAAA,QAChB;AAAA,MACJ;AAAA,IACJ;AACA,aAAS,WAAW,OAAO;AACvB,cAAQ,WAAW,MAAM;AACzB,YAAM,MAAM,WAAW;AAAA,IAC3B;AACA,aAAS,eAAe,OAAO;AAC3B,cAAQ,WAAW,UAAU;AAC7B,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,gBAAQ,MAAM,CAAC,CAAC;AAAA,MACpB;AAAA,IACJ;AACA,aAAS,cAAc,OAAO;AAC1B,aAAO,QAAQ,WAAW,SAAS;AAAA,IACvC;AACA,aAAS,MAAM,OAAO;AAClB,WAAK,GAAG,QAAQ,SAAS,KAAK;AAC1B,eAAO,UAAU,KAAK;AAC1B,WAAK,GAAG,QAAQ,WAAW,KAAK;AAC5B,eAAO,YAAY,KAAK;AAC5B,WAAK,GAAG,QAAQ,UAAU,KAAK;AAC3B,eAAO,WAAW,KAAK;AAC3B,WAAK,GAAG,QAAQ,QAAQ,KAAK;AACzB,eAAO,SAAS,KAAK;AACzB,WAAK,GAAG,QAAQ,QAAQ,KAAK;AACzB,eAAO,SAAS,KAAK;AACzB,WAAK,GAAG,QAAQ,UAAU,KAAK;AAC3B,eAAO,WAAW,KAAK;AAC3B,WAAK,GAAG,QAAQ,eAAe,KAAK;AAChC,eAAO,WAAW,KAAK;AAC3B,WAAK,GAAG,QAAQ,UAAU,KAAK;AAC3B,eAAO,WAAW,KAAK;AAC3B,WAAK,GAAG,QAAQ,UAAU,KAAK;AAC3B,eAAO,WAAW,KAAK;AAC3B,WAAK,GAAG,QAAQ,cAAc,KAAK;AAC/B,eAAO,eAAe,KAAK;AAC/B,WAAK,GAAG,QAAQ,aAAa,KAAK;AAC9B,eAAO,cAAc,KAAK;AAC9B,YAAM,IAAI,eAAe,KAAK;AAAA,IAClC;AACA,aAAS,QAAQ,MAAM;AACnB,oBAAc,cAAc,MAAM,IAAI;AACtC,oBAAe,cAAc,QAAS;AAAA,IAC1C;AAKA,aAASE,MAAK,OAAO;AACjB,oBAAc,OAAO,sBAAsB;AAC3C,YAAM,KAAK;AACX,aAAO;AAAA,IACX;AACA,IAAAF,SAAQ,OAAOE;AAAA;AAAA;;;AChLf;AAAA,0GAAAC,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,SAASA,SAAQ,qBAAqBA,SAAQ,YAAYA,SAAQ,8BAA8BA,SAAQ,iBAAiB;AACjI,QAAM,UAAU;AAChB,QAAM,WAAW;AACjB,QAAM,UAAU;AAChB,QAAM,SAAS;AACf,QAAM,QAAQ;AAId,QAAI;AACJ,KAAC,SAAUC,iBAAgB;AACvB,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,CAAC,IAAI;AACtD,MAAAA,gBAAeA,gBAAe,kBAAkB,IAAI,CAAC,IAAI;AACzD,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,CAAC,IAAI;AACtD,MAAAA,gBAAeA,gBAAe,kBAAkB,IAAI,CAAC,IAAI;AACzD,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,CAAC,IAAI;AACtD,MAAAA,gBAAeA,gBAAe,kBAAkB,IAAI,CAAC,IAAI;AACzD,MAAAA,gBAAeA,gBAAe,OAAO,IAAI,CAAC,IAAI;AAC9C,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,CAAC,IAAI;AACtD,MAAAA,gBAAeA,gBAAe,wBAAwB,IAAI,CAAC,IAAI;AAC/D,MAAAA,gBAAeA,gBAAe,wBAAwB,IAAI,CAAC,IAAI;AAC/D,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,EAAE,IAAI;AACvD,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,EAAE,IAAI;AACvD,MAAAA,gBAAeA,gBAAe,kBAAkB,IAAI,EAAE,IAAI;AAC1D,MAAAA,gBAAeA,gBAAe,QAAQ,IAAI,EAAE,IAAI;AAChD,MAAAA,gBAAeA,gBAAe,SAAS,IAAI,EAAE,IAAI;AACjD,MAAAA,gBAAeA,gBAAe,+BAA+B,IAAI,EAAE,IAAI;AACvE,MAAAA,gBAAeA,gBAAe,+BAA+B,IAAI,EAAE,IAAI;AACvE,MAAAA,gBAAeA,gBAAe,sBAAsB,IAAI,EAAE,IAAI;AAC9D,MAAAA,gBAAeA,gBAAe,sBAAsB,IAAI,EAAE,IAAI;AAC9D,MAAAA,gBAAeA,gBAAe,yBAAyB,IAAI,EAAE,IAAI;AACjE,MAAAA,gBAAeA,gBAAe,MAAM,IAAI,EAAE,IAAI;AAC9C,MAAAA,gBAAeA,gBAAe,UAAU,IAAI,EAAE,IAAI;AAClD,MAAAA,gBAAeA,gBAAe,yBAAyB,IAAI,EAAE,IAAI;AACjE,MAAAA,gBAAeA,gBAAe,yBAAyB,IAAI,EAAE,IAAI;AACjE,MAAAA,gBAAeA,gBAAe,gBAAgB,IAAI,EAAE,IAAI;AACxD,MAAAA,gBAAeA,gBAAe,gBAAgB,IAAI,EAAE,IAAI;AACxD,MAAAA,gBAAeA,gBAAe,mBAAmB,IAAI,EAAE,IAAI;AAC3D,MAAAA,gBAAeA,gBAAe,SAAS,IAAI,EAAE,IAAI;AACjD,MAAAA,gBAAeA,gBAAe,gCAAgC,IAAI,EAAE,IAAI;AACxE,MAAAA,gBAAeA,gBAAe,WAAW,IAAI,EAAE,IAAI;AACnD,MAAAA,gBAAeA,gBAAe,UAAU,IAAI,EAAE,IAAI;AAClD,MAAAA,gBAAeA,gBAAe,MAAM,IAAI,EAAE,IAAI;AAC9C,MAAAA,gBAAeA,gBAAe,SAAS,IAAI,EAAE,IAAI;AACjD,MAAAA,gBAAeA,gBAAe,OAAO,IAAI,EAAE,IAAI;AAC/C,MAAAA,gBAAeA,gBAAe,KAAK,IAAI,EAAE,IAAI;AAC7C,MAAAA,gBAAeA,gBAAe,MAAM,IAAI,EAAE,IAAI;AAC9C,MAAAA,gBAAeA,gBAAe,wBAAwB,IAAI,EAAE,IAAI;AAChE,MAAAA,gBAAeA,gBAAe,wBAAwB,IAAI,EAAE,IAAI;AAChE,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,EAAE,IAAI;AACvD,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,EAAE,IAAI;AACvD,MAAAA,gBAAeA,gBAAe,kBAAkB,IAAI,EAAE,IAAI;AAC1D,MAAAA,gBAAeA,gBAAe,QAAQ,IAAI,EAAE,IAAI;AAChD,MAAAA,gBAAeA,gBAAe,4BAA4B,IAAI,EAAE,IAAI;AACpE,MAAAA,gBAAeA,gBAAe,qBAAqB,IAAI,EAAE,IAAI;AAC7D,MAAAA,gBAAeA,gBAAe,qBAAqB,IAAI,EAAE,IAAI;AAC7D,MAAAA,gBAAeA,gBAAe,wBAAwB,IAAI,EAAE,IAAI;AAChE,MAAAA,gBAAeA,gBAAe,QAAQ,IAAI,EAAE,IAAI;AAChD,MAAAA,gBAAeA,gBAAe,SAAS,IAAI,EAAE,IAAI;AACjD,MAAAA,gBAAeA,gBAAe,qBAAqB,IAAI,EAAE,IAAI;AAC7D,MAAAA,gBAAeA,gBAAe,cAAc,IAAI,EAAE,IAAI;AACtD,MAAAA,gBAAeA,gBAAe,iBAAiB,IAAI,EAAE,IAAI;AACzD,MAAAA,gBAAeA,gBAAe,iBAAiB,IAAI,EAAE,IAAI;AACzD,MAAAA,gBAAeA,gBAAe,eAAe,IAAI,EAAE,IAAI;AACvD,MAAAA,gBAAeA,gBAAe,QAAQ,IAAI,EAAE,IAAI;AAChD,MAAAA,gBAAeA,gBAAe,QAAQ,IAAI,EAAE,IAAI;AAChD,MAAAA,gBAAeA,gBAAe,aAAa,IAAI,EAAE,IAAI;AACrD,MAAAA,gBAAeA,gBAAe,OAAO,IAAI,EAAE,IAAI;AAC/C,MAAAA,gBAAeA,gBAAe,yBAAyB,IAAI,EAAE,IAAI;AACjE,MAAAA,gBAAeA,gBAAe,yBAAyB,IAAI,EAAE,IAAI;AACjE,MAAAA,gBAAeA,gBAAe,YAAY,IAAI,EAAE,IAAI;AACpD,MAAAA,gBAAeA,gBAAe,WAAW,IAAI,EAAE,IAAI;AACnD,MAAAA,gBAAeA,gBAAe,OAAO,IAAI,EAAE,IAAI;AAC/C,MAAAA,gBAAeA,gBAAe,MAAM,IAAI,EAAE,IAAI;AAAA,IAClD,GAAG,mBAAmBD,SAAQ,iBAAiB,iBAAiB,CAAC,EAAE;AAInE,QAAM,8BAAN,cAA0C,MAAM,aAAa;AAAA,MACzD,YAAY,QAAQ;AAChB,cAAM,cAAc;AACpB,aAAK,SAAS;AAAA,MAClB;AAAA,IACJ;AACA,IAAAA,SAAQ,8BAA8B;AAItC,aAAS,UAAU,KAAK;AACpB,aAAO,IAAI,QAAQ,MAAM,IAAI,EAAE,QAAQ,OAAO,IAAI;AAAA,IACtD;AACA,IAAAA,SAAQ,YAAY;AAIpB,aAAS,UAAU,OAAO;AACtB,aAAO,UAAU;AAAA,IACrB;AAIA,QAAM,qBAAN,MAAyB;AAAA,MACrB,YAAY,UAAU;AAClB,aAAK,WAAW;AAAA,MACpB;AAAA,MACA,CAAC,OAAO,QAAQ,IAAI;AAChB,eAAO,KAAK;AAAA,MAChB;AAAA;AAAA,MAEA,QAAQ;AACJ,cAAM,OAAO,KAAK,SAAS,KAAK;AAChC,eAAO,KAAK,OAAO,SAAY,KAAK;AAAA,MACxC;AAAA,IACJ;AACA,IAAAA,SAAQ,qBAAqB;AAI7B,aAAS,OAAO,MAAM,QAAQ,MAAM,OAAO;AACvC,aAAO,EAAE,MAAM,QAAQ,MAAM,OAAO,SAAS,SAAS,wBAAwB,IAAI,EAAE,QAAQ,IAAI,EAAE;AAAA,IACtG;AAIA,cAAU,KAAK,QAAQ,YAAY,MAAM,OAAO;AAAA,IAAE;AAClD,cAAU,OAAO,QAAQ,YAAY,MAAM,OAAO;AAC9C,UAAI,EAAE,GAAG,QAAQ,SAAS,KAAK,GAAG;AAC9B,eAAO,MAAM,OAAO,eAAe,OAAO,QAAQ,MAAM,KAAK;AAAA,MACjE;AACA,UAAI,UAAU,OAAO,QAAQ,KAAK,EAAE,MAAM,UAAU,OAAO,WAAW;AAClE,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,UAAI,UAAU,OAAO,QAAQ,KAAK,EAAE,MAAM,UAAU,OAAO,WAAW;AAClE,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,eAAO,MAAM,OAAO,OAAO,YAAY,GAAG,IAAI,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC;AAAA,MACnE;AAEA,UAAI,OAAO,gBAAgB,QAAQ,CAAG,WAAY;AAAE,cAAM,MAAM,oBAAI,IAAI;AAAG,mBAAW,WAAW,OAAO;AACpG,gBAAM,UAAU,GAAG,OAAO,MAAM,OAAO;AACvC,cAAI,IAAI,IAAI,MAAM,GAAG;AACjB,mBAAO;AAAA,UACX,OACK;AACD,gBAAI,IAAI,MAAM;AAAA,UAClB;AAAA,QACJ;AAAE,eAAO;AAAA,MAAM,EAAG,GAAI;AAClB,cAAM,OAAO,eAAe,kBAAkB,QAAQ,MAAM,KAAK;AAAA,MACrE;AAEA,UAAI,EAAE,UAAU,OAAO,QAAQ,KAAK,UAAU,OAAO,WAAW,KAAK,UAAU,OAAO,WAAW,IAAI;AACjG;AAAA,MACJ;AACA,YAAM,iBAAiB,UAAU,OAAO,QAAQ,IAAI,OAAO,WAAW,MAAM,KAAK,MAAM;AACvF,YAAM,gBAAgB,MAAM,OAAO,CAAC,KAAKE,QAAO,UAAW,MAAM,gBAAgB,YAAY,GAAG,IAAI,GAAG,KAAK,IAAIA,MAAK,EAAE,KAAK,EAAE,SAAS,OAAO,MAAM,IAAI,KAAM,CAAC;AAC/J,UAAI,kBAAkB,GAAG;AACrB,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,WAAK,GAAG,QAAQ,UAAU,OAAO,WAAW,KAAK,gBAAgB,OAAO,aAAa;AACjF,cAAM,OAAO,eAAe,kBAAkB,QAAQ,MAAM,KAAK;AAAA,MACrE;AACA,WAAK,GAAG,QAAQ,UAAU,OAAO,WAAW,KAAK,gBAAgB,OAAO,aAAa;AACjF,cAAM,OAAO,eAAe,kBAAkB,QAAQ,MAAM,KAAK;AAAA,MACrE;AAAA,IACJ;AACA,cAAU,eAAe,QAAQ,YAAY,MAAM,OAAO;AACtD,UAAI,EAAE,GAAG,QAAQ,iBAAiB,KAAK;AACnC,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,IACtE;AACA,cAAU,QAAQ,QAAQ,YAAY,MAAM,OAAO;AAC/C,UAAI,EAAE,GAAG,QAAQ,UAAU,KAAK;AAC5B,eAAO,MAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAClE,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,cAAM,OAAO,eAAe,wBAAwB,QAAQ,MAAM,KAAK;AAAA,MAC3E;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,cAAM,OAAO,eAAe,wBAAwB,QAAQ,MAAM,KAAK;AAAA,MAC3E;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,UAAI,UAAU,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,eAAe,OAAO,CAAC,IAAI;AAC5E,cAAM,OAAO,eAAe,kBAAkB,QAAQ,MAAM,KAAK;AAAA,MACrE;AAAA,IACJ;AACA,cAAU,SAAS,QAAQ,YAAY,MAAM,OAAO;AAChD,UAAI,EAAE,GAAG,QAAQ,WAAW,KAAK;AAC7B,cAAM,OAAO,eAAe,SAAS,QAAQ,MAAM,KAAK;AAAA,IAChE;AACA,cAAU,aAAa,QAAQ,YAAY,MAAM,OAAO;AACpD,aAAO,MAAM,OAAO,SAAS,YAAY,MAAM,MAAM,SAAS;AAAA,IAClE;AACA,cAAU,MAAM,QAAQ,YAAY,MAAM,OAAO;AAC7C,UAAI,EAAE,GAAG,QAAQ,QAAQ,KAAK;AAC1B,eAAO,MAAM,OAAO,eAAe,MAAM,QAAQ,MAAM,KAAK;AAChE,UAAI,UAAU,OAAO,yBAAyB,KAAK,EAAE,MAAM,QAAQ,IAAI,OAAO,4BAA4B;AACtG,cAAM,OAAO,eAAe,+BAA+B,QAAQ,MAAM,KAAK;AAAA,MAClF;AACA,UAAI,UAAU,OAAO,yBAAyB,KAAK,EAAE,MAAM,QAAQ,IAAI,OAAO,4BAA4B;AACtG,cAAM,OAAO,eAAe,+BAA+B,QAAQ,MAAM,KAAK;AAAA,MAClF;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,MAAM,QAAQ,KAAK,OAAO,mBAAmB;AACrF,cAAM,OAAO,eAAe,sBAAsB,QAAQ,MAAM,KAAK;AAAA,MACzE;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,MAAM,QAAQ,KAAK,OAAO,mBAAmB;AACrF,cAAM,OAAO,eAAe,sBAAsB,QAAQ,MAAM,KAAK;AAAA,MACzE;AACA,UAAI,UAAU,OAAO,mBAAmB,KAAK,EAAE,MAAM,QAAQ,IAAI,OAAO,wBAAwB,IAAI;AAChG,cAAM,OAAO,eAAe,yBAAyB,QAAQ,MAAM,KAAK;AAAA,MAC5E;AAAA,IACJ;AACA,cAAU,UAAU,QAAQ,YAAY,MAAM,OAAO;AACjD,UAAI,EAAE,GAAG,QAAQ,YAAY,KAAK;AAC9B,cAAM,OAAO,eAAe,UAAU,QAAQ,MAAM,KAAK;AAAA,IACjE;AACA,cAAU,SAAS,QAAQ,YAAY,MAAM,OAAO;AAChD,UAAI,EAAE,GAAG,QAAQ,WAAW,KAAK;AAC7B,eAAO,MAAM,OAAO,eAAe,SAAS,QAAQ,MAAM,KAAK;AACnE,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,cAAM,OAAO,eAAe,yBAAyB,QAAQ,MAAM,KAAK;AAAA,MAC5E;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,cAAM,OAAO,eAAe,yBAAyB,QAAQ,MAAM,KAAK;AAAA,MAC5E;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,cAAM,OAAO,eAAe,gBAAgB,QAAQ,MAAM,KAAK;AAAA,MACnE;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,cAAM,OAAO,eAAe,gBAAgB,QAAQ,MAAM,KAAK;AAAA,MACnE;AACA,UAAI,UAAU,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,eAAe,IAAI;AACpE,cAAM,OAAO,eAAe,mBAAmB,QAAQ,MAAM,KAAK;AAAA,MACtE;AAAA,IACJ;AACA,cAAU,WAAW,QAAQ,YAAY,MAAM,OAAO;AAClD,iBAAW,SAAS,OAAO,OAAO;AAC9B,cAAM,OAAO,MAAM,OAAO,YAAY,MAAM,KAAK,EAAE,KAAK;AACxD,YAAI,CAAC,KAAK,MAAM;AACZ,gBAAM,OAAO,eAAe,WAAW,QAAQ,MAAM,KAAK;AAC1D,gBAAM,KAAK;AAAA,QACf;AAAA,MACJ;AACA,UAAI,OAAO,0BAA0B,OAAO;AACxC,cAAM,WAAW,IAAI,OAAO,MAAM,YAAY,eAAe,MAAM,CAAC;AACpE,mBAAW,YAAY,OAAO,oBAAoB,KAAK,GAAG;AACtD,cAAI,CAAC,SAAS,KAAK,QAAQ,GAAG;AAC1B,kBAAM,OAAO,eAAe,gCAAgC,QAAQ,GAAG,IAAI,IAAI,QAAQ,IAAI,KAAK;AAAA,UACpG;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,OAAO,OAAO,0BAA0B,UAAU;AAClD,cAAM,WAAW,IAAI,OAAO,MAAM,YAAY,eAAe,MAAM,CAAC;AACpE,mBAAW,YAAY,OAAO,oBAAoB,KAAK,GAAG;AACtD,cAAI,CAAC,SAAS,KAAK,QAAQ,GAAG;AAC1B,kBAAM,OAAO,MAAM,OAAO,uBAAuB,YAAY,GAAG,IAAI,IAAI,QAAQ,IAAI,MAAM,QAAQ,CAAC,EAAE,KAAK;AAC1G,gBAAI,CAAC,KAAK;AACN,oBAAM,KAAK;AAAA,UACnB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,cAAU,UAAU,QAAQ,YAAY,MAAM,OAAO;AACjD,UAAI,EAAE,GAAG,QAAQ,YAAY,KAAK;AAC9B,cAAM,OAAO,eAAe,UAAU,QAAQ,MAAM,KAAK;AAAA,IACjE;AACA,cAAU,SAAS,QAAQ,YAAY,MAAM,OAAO;AAChD,UAAI,EAAE,UAAU,OAAO;AACnB,cAAM,OAAO,eAAe,SAAS,QAAQ,MAAM,KAAK;AAAA,IAChE;AACA,cAAU,OAAO,QAAQ,YAAY,MAAM,OAAO;AAC9C,YAAM,OAAO,eAAe,OAAO,QAAQ,MAAM,KAAK;AAAA,IAC1D;AACA,cAAU,KAAK,QAAQ,YAAY,MAAM,OAAO;AAC5C,UAAI,MAAM,OAAO,KAAK,YAAY,MAAM,KAAK,EAAE,KAAK,EAAE,SAAS;AAC3D,cAAM,OAAO,eAAe,KAAK,QAAQ,MAAM,KAAK;AAAA,IAC5D;AACA,cAAU,MAAM,QAAQ,YAAY,MAAM,OAAO;AAC7C,UAAI,EAAE,GAAG,QAAQ,QAAQ,KAAK;AAC1B,cAAM,OAAO,eAAe,MAAM,QAAQ,MAAM,KAAK;AAAA,IAC7D;AACA,cAAU,QAAQ,QAAQ,YAAY,MAAM,OAAO;AAC/C,UAAI,CAAC,SAAS,iBAAiB,aAAa,KAAK;AAC7C,eAAO,MAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAClE,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,cAAM,OAAO,eAAe,wBAAwB,QAAQ,MAAM,KAAK;AAAA,MAC3E;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,cAAM,OAAO,eAAe,wBAAwB,QAAQ,MAAM,KAAK;AAAA,MAC3E;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AACA,UAAI,UAAU,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,eAAe,IAAI;AACpE,cAAM,OAAO,eAAe,kBAAkB,QAAQ,MAAM,KAAK;AAAA,MACrE;AAAA,IACJ;AACA,cAAU,QAAQ,QAAQ,YAAY,MAAM,OAAO;AAC/C,UAAI,CAAC,SAAS,iBAAiB,aAAa,KAAK;AAC7C,eAAO,MAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAClE,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,cAAM,OAAO,eAAe,qBAAqB,QAAQ,MAAM,KAAK;AAAA,MACxE;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,cAAM,OAAO,eAAe,qBAAqB,QAAQ,MAAM,KAAK;AAAA,MACxE;AACA,YAAM,eAAe,MAAM,QAAQ,OAAO,QAAQ,IAAI,OAAO,WAAW,CAAC;AACzE,YAAM,YAAY,OAAO,oBAAoB,OAAO,UAAU;AAC9D,YAAM,cAAc,OAAO,oBAAoB,KAAK;AACpD,iBAAW,eAAe,cAAc;AACpC,YAAI,YAAY,SAAS,WAAW;AAChC;AACJ,cAAM,OAAO,eAAe,wBAAwB,OAAO,WAAW,WAAW,GAAG,GAAG,IAAI,IAAI,UAAU,WAAW,CAAC,IAAI,MAAS;AAAA,MACtI;AACA,UAAI,OAAO,yBAAyB,OAAO;AACvC,mBAAW,YAAY,aAAa;AAChC,cAAI,CAAC,UAAU,SAAS,QAAQ,GAAG;AAC/B,kBAAM,OAAO,eAAe,4BAA4B,QAAQ,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC;AAAA,UACrH;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,OAAO,OAAO,yBAAyB,UAAU;AACjD,mBAAW,YAAY,aAAa;AAChC,cAAI,UAAU,SAAS,QAAQ;AAC3B;AACJ,iBAAO,MAAM,OAAO,sBAAsB,YAAY,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC;AAAA,QAC3G;AAAA,MACJ;AACA,iBAAW,YAAY,WAAW;AAC9B,cAAMC,YAAW,OAAO,WAAW,QAAQ;AAC3C,YAAI,OAAO,YAAY,OAAO,SAAS,SAAS,QAAQ,GAAG;AACvD,iBAAO,MAAMA,WAAU,YAAY,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC;AACpF,cAAI,MAAM,iBAAiB,MAAM,MAAM,KAAK,EAAE,YAAY,QAAQ;AAC9D,kBAAM,OAAO,eAAe,wBAAwBA,WAAU,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,IAAI,MAAS;AAAA,UAC7G;AAAA,QACJ,OACK;AACD,cAAI,SAAS,iBAAiB,wBAAwB,OAAO,QAAQ,GAAG;AACpE,mBAAO,MAAMA,WAAU,YAAY,GAAG,IAAI,IAAI,UAAU,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC;AAAA,UACxF;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,cAAU,SAAS,QAAQ,YAAY,MAAM,OAAO;AAChD,UAAI,EAAE,GAAG,QAAQ,WAAW,KAAK;AAC7B,cAAM,OAAO,eAAe,SAAS,QAAQ,MAAM,KAAK;AAAA,IAChE;AACA,cAAU,QAAQ,QAAQ,YAAY,MAAM,OAAO;AAC/C,UAAI,CAAC,SAAS,iBAAiB,aAAa,KAAK;AAC7C,eAAO,MAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAClE,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,cAAM,OAAO,eAAe,qBAAqB,QAAQ,MAAM,KAAK;AAAA,MACxE;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,cAAM,OAAO,eAAe,qBAAqB,QAAQ,MAAM,KAAK;AAAA,MACxE;AACA,YAAM,CAAC,YAAY,aAAa,IAAI,OAAO,QAAQ,OAAO,iBAAiB,EAAE,CAAC;AAC9E,YAAM,QAAQ,IAAI,OAAO,UAAU;AACnC,iBAAW,CAAC,aAAa,aAAa,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC9D,YAAI,MAAM,KAAK,WAAW;AACtB,iBAAO,MAAM,eAAe,YAAY,GAAG,IAAI,IAAI,UAAU,WAAW,CAAC,IAAI,aAAa;AAAA,MAClG;AACA,UAAI,OAAO,OAAO,yBAAyB,UAAU;AACjD,mBAAW,CAAC,aAAa,aAAa,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC9D,cAAI,CAAC,MAAM,KAAK,WAAW;AACvB,mBAAO,MAAM,OAAO,sBAAsB,YAAY,GAAG,IAAI,IAAI,UAAU,WAAW,CAAC,IAAI,aAAa;AAAA,QAChH;AAAA,MACJ;AACA,UAAI,OAAO,yBAAyB,OAAO;AACvC,mBAAW,CAAC,aAAa,aAAa,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC9D,cAAI,MAAM,KAAK,WAAW;AACtB;AACJ,iBAAO,MAAM,OAAO,eAAe,4BAA4B,QAAQ,GAAG,IAAI,IAAI,UAAU,WAAW,CAAC,IAAI,aAAa;AAAA,QAC7H;AAAA,MACJ;AAAA,IACJ;AACA,cAAU,KAAK,QAAQ,YAAY,MAAM,OAAO;AAC5C,aAAO,OAAO,GAAG,QAAQ,OAAO,QAAQ,UAAU,GAAG,YAAY,MAAM,KAAK;AAAA,IAChF;AACA,cAAU,QAAQ,QAAQ,YAAY,MAAM,OAAO;AAC/C,UAAI,EAAE,GAAG,QAAQ,UAAU,KAAK;AAC5B,eAAO,MAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAClE,UAAI,UAAU,OAAO,SAAS,KAAK,EAAE,MAAM,UAAU,OAAO,YAAY;AACpE,cAAM,OAAO,eAAe,iBAAiB,QAAQ,MAAM,KAAK;AAAA,MACpE;AACA,UAAI,UAAU,OAAO,SAAS,KAAK,EAAE,MAAM,UAAU,OAAO,YAAY;AACpE,cAAM,OAAO,eAAe,iBAAiB,QAAQ,MAAM,KAAK;AAAA,MACpE;AACA,WAAK,GAAG,QAAQ,UAAU,OAAO,OAAO,GAAG;AACvC,cAAM,QAAQ,IAAI,OAAO,OAAO,OAAO;AACvC,YAAI,CAAC,MAAM,KAAK,KAAK,GAAG;AACpB,gBAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,QAClE;AAAA,MACJ;AACA,WAAK,GAAG,QAAQ,UAAU,OAAO,MAAM,GAAG;AACtC,YAAI,CAAC,MAAM,eAAe,IAAI,OAAO,MAAM,GAAG;AAC1C,gBAAM,OAAO,eAAe,qBAAqB,QAAQ,MAAM,KAAK;AAAA,QACxE,OACK;AACD,gBAAMC,UAAS,MAAM,eAAe,IAAI,OAAO,MAAM;AACrD,cAAI,CAACA,QAAO,KAAK,GAAG;AAChB,kBAAM,OAAO,eAAe,cAAc,QAAQ,MAAM,KAAK;AAAA,UACjE;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,cAAU,QAAQ,QAAQ,YAAY,MAAM,OAAO;AAC/C,UAAI,EAAE,GAAG,QAAQ,UAAU,KAAK;AAC5B,cAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAAA,IAC/D;AACA,cAAU,iBAAiB,QAAQ,YAAY,MAAM,OAAO;AACxD,UAAI,EAAE,GAAG,QAAQ,UAAU,KAAK;AAC5B,eAAO,MAAM,OAAO,eAAe,QAAQ,QAAQ,MAAM,KAAK;AAClE,YAAM,QAAQ,IAAI,OAAO,OAAO,OAAO;AACvC,UAAI,CAAC,MAAM,KAAK,KAAK,GAAG;AACpB,cAAM,OAAO,eAAe,eAAe,QAAQ,MAAM,KAAK;AAAA,MAClE;AAAA,IACJ;AACA,cAAU,MAAM,QAAQ,YAAY,MAAM,OAAO;AAC7C,aAAO,OAAO,GAAG,QAAQ,OAAO,QAAQ,UAAU,GAAG,YAAY,MAAM,KAAK;AAAA,IAChF;AACA,cAAU,OAAO,QAAQ,YAAY,MAAM,OAAO;AAC9C,UAAI,EAAE,GAAG,QAAQ,SAAS,KAAK;AAC3B,eAAO,MAAM,OAAO,eAAe,OAAO,QAAQ,MAAM,KAAK;AACjE,UAAI,OAAO,UAAU,UAAa,EAAE,MAAM,WAAW,IAAI;AACrD,eAAO,MAAM,OAAO,eAAe,aAAa,QAAQ,MAAM,KAAK;AAAA,MACvE;AACA,UAAI,EAAE,MAAM,WAAW,OAAO,WAAW;AACrC,eAAO,MAAM,OAAO,eAAe,aAAa,QAAQ,MAAM,KAAK;AAAA,MACvE;AACA,UAAI,CAAC,OAAO,OAAO;AACf;AAAA,MACJ;AACA,eAAS,IAAI,GAAG,IAAI,OAAO,MAAM,QAAQ,KAAK;AAC1C,eAAO,MAAM,OAAO,MAAM,CAAC,GAAG,YAAY,GAAG,IAAI,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC;AAAA,MACtE;AAAA,IACJ;AACA,cAAU,WAAW,QAAQ,YAAY,MAAM,OAAO;AAClD,UAAI,EAAE,GAAG,QAAQ,aAAa,KAAK;AAC/B,cAAM,OAAO,eAAe,WAAW,QAAQ,MAAM,KAAK;AAAA,IAClE;AACA,cAAU,OAAO,QAAQ,YAAY,MAAM,OAAO;AAC9C,UAAI,QAAQ;AACZ,iBAAW,aAAa,OAAO,OAAO;AAClC,cAAM,SAAS,CAAC,GAAG,MAAM,WAAW,YAAY,MAAM,KAAK,CAAC;AAC5D,YAAI,OAAO,WAAW;AAClB;AACJ,iBAAS,OAAO;AAAA,MACpB;AACA,UAAI,QAAQ,GAAG;AACX,cAAM,OAAO,eAAe,OAAO,QAAQ,MAAM,KAAK;AAAA,MAC1D;AAAA,IACJ;AACA,cAAU,YAAY,QAAQ,YAAY,MAAM,OAAO;AACnD,UAAI,EAAE,GAAG,QAAQ,cAAc,KAAK;AAChC,eAAO,MAAM,OAAO,eAAe,YAAY,QAAQ,MAAM,KAAK;AACtE,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,MAAM,UAAU,OAAO,gBAAgB;AAC5E,cAAM,OAAO,eAAe,yBAAyB,QAAQ,MAAM,KAAK;AAAA,MAC5E;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,MAAM,UAAU,OAAO,gBAAgB;AAC5E,cAAM,OAAO,eAAe,yBAAyB,QAAQ,MAAM,KAAK;AAAA,MAC5E;AAAA,IACJ;AACA,cAAU,SAAS,QAAQ,YAAY,MAAM,OAAO;AAAA,IAAE;AACtD,cAAU,MAAM,QAAQ,YAAY,MAAM,OAAO;AAC7C,UAAI,CAAC,SAAS,iBAAiB,WAAW,KAAK;AAC3C,cAAM,OAAO,eAAe,MAAM,QAAQ,MAAM,KAAK;AAAA,IAC7D;AACA,cAAU,MAAM,QAAQ,YAAY,MAAM,OAAO;AAC7C,YAAM,QAAQ,MAAM,aAAa,IAAI,OAAO,MAAM,IAAI,CAAC;AACvD,UAAI,CAAC,MAAM,QAAQ,KAAK;AACpB,cAAM,OAAO,eAAe,MAAM,QAAQ,MAAM,KAAK;AAAA,IAC7D;AACA,cAAU,MAAM,QAAQ,YAAY,MAAM,OAAO;AAC7C,YAAM,cAAc,UAAU,OAAO,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,IAAI;AACtE,YAAM,UAAU;AAChB,cAAQ,QAAQ,MAAM,IAAI,GAAG;AAAA,QACzB,KAAK;AACD,iBAAO,OAAO,KAAK,SAAS,aAAa,MAAM,KAAK;AAAA,QACxD,KAAK;AACD,iBAAO,OAAO,OAAO,SAAS,aAAa,MAAM,KAAK;AAAA,QAC1D,KAAK;AACD,iBAAO,OAAO,eAAe,SAAS,aAAa,MAAM,KAAK;AAAA,QAClE,KAAK;AACD,iBAAO,OAAO,QAAQ,SAAS,aAAa,MAAM,KAAK;AAAA,QAC3D,KAAK;AACD,iBAAO,OAAO,SAAS,SAAS,aAAa,MAAM,KAAK;AAAA,QAC5D,KAAK;AACD,iBAAO,OAAO,aAAa,SAAS,aAAa,MAAM,KAAK;AAAA,QAChE,KAAK;AACD,iBAAO,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK;AAAA,QACzD,KAAK;AACD,iBAAO,OAAO,UAAU,SAAS,aAAa,MAAM,KAAK;AAAA,QAC7D,KAAK;AACD,iBAAO,OAAO,SAAS,SAAS,aAAa,MAAM,KAAK;AAAA,QAC5D,KAAK;AACD,iBAAO,OAAO,WAAW,SAAS,aAAa,MAAM,KAAK;AAAA,QAC9D,KAAK;AACD,iBAAO,OAAO,UAAU,SAAS,aAAa,MAAM,KAAK;AAAA,QAC7D,KAAK;AACD,iBAAO,OAAO,SAAS,SAAS,aAAa,MAAM,KAAK;AAAA,QAC5D,KAAK;AACD,iBAAO,OAAO,OAAO,SAAS,aAAa,MAAM,KAAK;AAAA,QAC1D,KAAK;AACD,iBAAO,OAAO,KAAK,SAAS,aAAa,MAAM,KAAK;AAAA,QACxD,KAAK;AACD,iBAAO,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK;AAAA,QACzD,KAAK;AACD,iBAAO,OAAO,QAAQ,SAAS,aAAa,MAAM,KAAK;AAAA,QAC3D,KAAK;AACD,iBAAO,OAAO,QAAQ,SAAS,aAAa,MAAM,KAAK;AAAA,QAC3D,KAAK;AACD,iBAAO,OAAO,SAAS,SAAS,aAAa,MAAM,KAAK;AAAA,QAC5D,KAAK;AACD,iBAAO,OAAO,QAAQ,SAAS,aAAa,MAAM,KAAK;AAAA,QAC3D,KAAK;AACD,iBAAO,OAAO,KAAK,SAAS,aAAa,MAAM,KAAK;AAAA,QACxD,KAAK;AACD,iBAAO,OAAO,QAAQ,SAAS,aAAa,MAAM,KAAK;AAAA,QAC3D,KAAK;AACD,iBAAO,OAAO,QAAQ,SAAS,aAAa,MAAM,KAAK;AAAA,QAC3D,KAAK;AACD,iBAAO,OAAO,iBAAiB,SAAS,aAAa,MAAM,KAAK;AAAA,QACpE,KAAK;AACD,iBAAO,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK;AAAA,QACzD,KAAK;AACD,iBAAO,OAAO,OAAO,SAAS,aAAa,MAAM,KAAK;AAAA,QAC1D,KAAK;AACD,iBAAO,OAAO,WAAW,SAAS,aAAa,MAAM,KAAK;AAAA,QAC9D,KAAK;AACD,iBAAO,OAAO,OAAO,SAAS,aAAa,MAAM,KAAK;AAAA,QAC1D,KAAK;AACD,iBAAO,OAAO,YAAY,SAAS,aAAa,MAAM,KAAK;AAAA,QAC/D,KAAK;AACD,iBAAO,OAAO,SAAS,SAAS,aAAa,MAAM,KAAK;AAAA,QAC5D,KAAK;AACD,iBAAO,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK;AAAA,QACzD;AACI,cAAI,CAAC,MAAM,aAAa,IAAI,QAAQ,MAAM,IAAI,CAAC;AAC3C,kBAAM,IAAI,4BAA4B,MAAM;AAChD,iBAAO,OAAO,MAAM,SAAS,aAAa,MAAM,KAAK;AAAA,MAC7D;AAAA,IACJ;AAEA,aAAS,UAAU,MAAM;AACrB,YAAM,WAAW,KAAK,WAAW,IAAI,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;AAC1G,aAAO,IAAI,mBAAmB,QAAQ;AAAA,IAC1C;AACA,IAAAJ,SAAQ,SAAS;AAAA;AAAA;;;ACvkBjB,IAAAK,kBAAA;AAAA,yGAAAC,UAAA;AAAA;AA4BA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,SAAU,SAAS,GAAGC,IAAG,GAAG,IAAI;AAC5F,UAAI,OAAO;AAAW,aAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyBA,IAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAACA,GAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAOA,GAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,IAAM,SAAS,GAAGA,IAAG,GAAG,IAAI;AACxB,UAAI,OAAO;AAAW,aAAK;AAC3B,QAAE,EAAE,IAAIA,GAAE,CAAC;AAAA,IACf;AACA,QAAI,eAAgBD,YAAQA,SAAK,gBAAiB,SAASC,IAAGD,UAAS;AACnE,eAAS,KAAKC;AAAG,YAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKD,UAAS,CAAC;AAAG,0BAAgBA,UAASC,IAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,iBAAa,kBAAqBA,QAAO;AAAA;AAAA;;;AC3CzC,IAAAE,kBAAA;AAAA,yGAAAC,UAAA;AAAA;AA4BA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,SAAU,SAAS,GAAGC,IAAG,GAAG,IAAI;AAC5F,UAAI,OAAO;AAAW,aAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyBA,IAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAACA,GAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAOA,GAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,IAAM,SAAS,GAAGA,IAAG,GAAG,IAAI;AACxB,UAAI,OAAO;AAAW,aAAK;AAC3B,QAAE,EAAE,IAAIA,GAAE,CAAC;AAAA,IACf;AACA,QAAI,eAAgBD,YAAQA,SAAK,gBAAiB,SAASC,IAAGD,UAAS;AACnE,eAAS,KAAKC;AAAG,YAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKD,UAAS,CAAC;AAAG,0BAAgBA,UAASC,IAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,iBAAiB;AACzB,QAAI,WAAW;AACf,WAAO,eAAeA,UAAS,kBAAkB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,SAAS;AAAA,IAAgB,EAAE,CAAC;AAC3H,iBAAa,kBAAqBA,QAAO;AAAA;AAAA;;;AC9CzC;AAAA,wGAAAE,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,QAAQA,SAAQ,6BAA6B;AACrD,QAAM,UAAU;AAChB,QAAM,UAAU;AAChB,QAAM,UAAU;AAChB,QAAM,SAAS;AACf,QAAM,QAAQ;AAId,QAAM,6BAAN,cAAyC,MAAM,aAAa;AAAA,MACxD,YAAY,QAAQ;AAChB,cAAM,cAAc;AACpB,aAAK,SAAS;AAAA,MAClB;AAAA,IACJ;AACA,IAAAA,SAAQ,6BAA6B;AAIrC,aAAS,eAAe,QAAQ;AAC5B,aAAO,OAAO,MAAM,IAAI,MAAM,SAAS,OAAO,MAAM,IAAI,MAAM;AAAA,IAClE;AAIA,aAAS,UAAU,OAAO;AACtB,aAAO,UAAU;AAAA,IACrB;AAIA,aAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,aAAO;AAAA,IACX;AACA,aAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,UAAI,EAAE,GAAG,QAAQ,SAAS,KAAK;AAC3B,eAAO;AACX,UAAI,UAAU,OAAO,QAAQ,KAAK,EAAE,MAAM,UAAU,OAAO,WAAW;AAClE,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,QAAQ,KAAK,EAAE,MAAM,UAAU,OAAO,WAAW;AAClE,eAAO;AAAA,MACX;AACA,UAAI,CAAC,MAAM,MAAM,CAACC,WAAU,MAAM,OAAO,OAAO,YAAYA,MAAK,CAAC,GAAG;AACjE,eAAO;AAAA,MACX;AAEA,UAAI,OAAO,gBAAgB,QAAQ,CAAG,WAAY;AAAE,cAAM,MAAM,oBAAI,IAAI;AAAG,mBAAW,WAAW,OAAO;AACpG,gBAAM,UAAU,GAAG,OAAO,MAAM,OAAO;AACvC,cAAI,IAAI,IAAI,MAAM,GAAG;AACjB,mBAAO;AAAA,UACX,OACK;AACD,gBAAI,IAAI,MAAM;AAAA,UAClB;AAAA,QACJ;AAAE,eAAO;AAAA,MAAM,EAAG,GAAI;AAClB,eAAO;AAAA,MACX;AAEA,UAAI,EAAE,UAAU,OAAO,QAAQ,MAAM,GAAG,QAAQ,UAAU,OAAO,WAAW,MAAM,GAAG,QAAQ,UAAU,OAAO,WAAW,IAAI;AACzH,eAAO;AAAA,MACX;AACA,YAAM,iBAAiB,UAAU,OAAO,QAAQ,IAAI,OAAO,WAAW,MAAM,KAAK,MAAM;AACvF,YAAM,gBAAgB,MAAM,OAAO,CAAC,KAAKA,WAAW,MAAM,gBAAgB,YAAYA,MAAK,IAAI,MAAM,IAAI,KAAM,CAAC;AAChH,UAAI,kBAAkB,GAAG;AACrB,eAAO;AAAA,MACX;AACA,WAAK,GAAG,QAAQ,UAAU,OAAO,WAAW,KAAK,gBAAgB,OAAO,aAAa;AACjF,eAAO;AAAA,MACX;AACA,WAAK,GAAG,QAAQ,UAAU,OAAO,WAAW,KAAK,gBAAgB,OAAO,aAAa;AACjF,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,aAAS,eAAe,QAAQ,YAAY,OAAO;AAC/C,cAAQ,GAAG,QAAQ,iBAAiB,KAAK;AAAA,IAC7C;AACA,aAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,UAAI,EAAE,GAAG,QAAQ,UAAU,KAAK;AAC5B,eAAO;AACX,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,eAAe,OAAO,CAAC,IAAI;AAC5E,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,aAAS,SAAS,QAAQ,YAAY,OAAO;AACzC,cAAQ,GAAG,QAAQ,WAAW,KAAK;AAAA,IACvC;AACA,aAAS,aAAa,QAAQ,YAAY,OAAO;AAC7C,aAAO,MAAM,OAAO,SAAS,YAAY,MAAM,SAAS;AAAA,IAC5D;AACA,aAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,UAAI,EAAE,GAAG,QAAQ,QAAQ,KAAK;AAC1B,eAAO;AACX,UAAI,UAAU,OAAO,yBAAyB,KAAK,EAAE,MAAM,QAAQ,IAAI,OAAO,4BAA4B;AACtG,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,yBAAyB,KAAK,EAAE,MAAM,QAAQ,IAAI,OAAO,4BAA4B;AACtG,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,MAAM,QAAQ,KAAK,OAAO,mBAAmB;AACrF,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,MAAM,QAAQ,KAAK,OAAO,mBAAmB;AACrF,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,mBAAmB,KAAK,EAAE,MAAM,QAAQ,IAAI,OAAO,wBAAwB,IAAI;AAChG,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,aAAS,UAAU,QAAQ,YAAY,OAAO;AAC1C,cAAQ,GAAG,QAAQ,YAAY,KAAK;AAAA,IACxC;AACA,aAAS,SAAS,QAAQ,YAAY,OAAO;AACzC,UAAI,EAAE,GAAG,QAAQ,WAAW,KAAK,GAAG;AAChC,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,eAAe,IAAI;AACpE,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,aAAS,WAAW,QAAQ,YAAY,OAAO;AAC3C,YAAM,SAAS,OAAO,MAAM,MAAM,CAACC,YAAW,MAAMA,SAAQ,YAAY,KAAK,CAAC;AAC9E,UAAI,OAAO,0BAA0B,OAAO;AACxC,cAAM,aAAa,IAAI,OAAO,MAAM,YAAY,eAAe,MAAM,CAAC;AACtE,cAAM,SAAS,OAAO,oBAAoB,KAAK,EAAE,MAAM,CAAC,QAAQ,WAAW,KAAK,GAAG,CAAC;AACpF,eAAO,UAAU;AAAA,MACrB,WACS,MAAM,UAAU,QAAQ,OAAO,qBAAqB,GAAG;AAC5D,cAAM,WAAW,IAAI,OAAO,MAAM,YAAY,eAAe,MAAM,CAAC;AACpE,cAAM,SAAS,OAAO,oBAAoB,KAAK,EAAE,MAAM,CAAC,QAAQ,SAAS,KAAK,GAAG,KAAK,MAAM,OAAO,uBAAuB,YAAY,MAAM,GAAG,CAAC,CAAC;AACjJ,eAAO,UAAU;AAAA,MACrB,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AACA,aAAS,UAAU,QAAQ,YAAY,OAAO;AAC1C,cAAQ,GAAG,QAAQ,YAAY,KAAK;AAAA,IACxC;AACA,aAAS,SAAS,QAAQ,YAAY,OAAO;AACzC,aAAO,UAAU,OAAO;AAAA,IAC5B;AACA,aAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,aAAO;AAAA,IACX;AACA,aAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,aAAO,CAAC,MAAM,OAAO,KAAK,YAAY,KAAK;AAAA,IAC/C;AACA,aAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,cAAQ,GAAG,QAAQ,QAAQ,KAAK;AAAA,IACpC;AACA,aAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,UAAI,CAAC,QAAQ,iBAAiB,aAAa,KAAK;AAC5C,eAAO;AACX,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,gBAAgB,KAAK,EAAE,QAAQ,OAAO,mBAAmB;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,OAAO,KAAK,EAAE,SAAS,OAAO,UAAU;AACzD,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,UAAU,KAAK,EAAE,QAAQ,OAAO,eAAe,IAAI;AACpE,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,aAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,UAAI,CAAC,QAAQ,iBAAiB,aAAa,KAAK;AAC5C,eAAO;AACX,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,eAAO;AAAA,MACX;AACA,YAAM,YAAY,OAAO,oBAAoB,OAAO,UAAU;AAC9D,iBAAW,YAAY,WAAW;AAC9B,cAAMC,YAAW,OAAO,WAAW,QAAQ;AAC3C,YAAI,OAAO,YAAY,OAAO,SAAS,SAAS,QAAQ,GAAG;AACvD,cAAI,CAAC,MAAMA,WAAU,YAAY,MAAM,QAAQ,CAAC,GAAG;AAC/C,mBAAO;AAAA,UACX;AACA,eAAK,MAAM,iBAAiB,MAAMA,SAAQ,KAAK,eAAeA,SAAQ,MAAM,EAAE,YAAY,QAAQ;AAC9F,mBAAO;AAAA,UACX;AAAA,QACJ,OACK;AACD,cAAI,QAAQ,iBAAiB,wBAAwB,OAAO,QAAQ,KAAK,CAAC,MAAMA,WAAU,YAAY,MAAM,QAAQ,CAAC,GAAG;AACpH,mBAAO;AAAA,UACX;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,OAAO,yBAAyB,OAAO;AACvC,cAAM,YAAY,OAAO,oBAAoB,KAAK;AAElD,YAAI,OAAO,YAAY,OAAO,SAAS,WAAW,UAAU,UAAU,UAAU,WAAW,UAAU,QAAQ;AACzG,iBAAO;AAAA,QACX,OACK;AACD,iBAAO,UAAU,MAAM,CAAC,aAAa,UAAU,SAAS,QAAQ,CAAC;AAAA,QACrE;AAAA,MACJ,WACS,OAAO,OAAO,yBAAyB,UAAU;AACtD,cAAM,YAAY,OAAO,oBAAoB,KAAK;AAClD,eAAO,UAAU,MAAM,CAAC,QAAQ,UAAU,SAAS,GAAG,KAAK,MAAM,OAAO,sBAAsB,YAAY,MAAM,GAAG,CAAC,CAAC;AAAA,MACzH,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AACA,aAAS,SAAS,QAAQ,YAAY,OAAO;AACzC,cAAQ,GAAG,QAAQ,WAAW,KAAK;AAAA,IACvC;AACA,aAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,UAAI,CAAC,QAAQ,iBAAiB,aAAa,KAAK,GAAG;AAC/C,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,OAAO,oBAAoB,KAAK,EAAE,UAAU,OAAO,gBAAgB;AACxG,eAAO;AAAA,MACX;AACA,YAAM,CAAC,YAAY,aAAa,IAAI,OAAO,QAAQ,OAAO,iBAAiB,EAAE,CAAC;AAC9E,YAAM,QAAQ,IAAI,OAAO,UAAU;AAEnC,YAAM,SAAS,OAAO,QAAQ,KAAK,EAAE,MAAM,CAAC,CAAC,KAAKF,MAAK,MAAM;AACzD,eAAQ,MAAM,KAAK,GAAG,IAAK,MAAM,eAAe,YAAYA,MAAK,IAAI;AAAA,MACzE,CAAC;AAED,YAAM,SAAS,OAAO,OAAO,yBAAyB,WAAW,OAAO,QAAQ,KAAK,EAAE,MAAM,CAAC,CAAC,KAAKA,MAAK,MAAM;AAC3G,eAAQ,CAAC,MAAM,KAAK,GAAG,IAAK,MAAM,OAAO,sBAAsB,YAAYA,MAAK,IAAI;AAAA,MACxF,CAAC,IAAI;AACL,YAAM,SAAS,OAAO,yBAAyB,QACzC,OAAO,oBAAoB,KAAK,EAAE,MAAM,CAAC,QAAQ;AAC/C,eAAO,MAAM,KAAK,GAAG;AAAA,MACzB,CAAC,IACC;AACN,aAAO,UAAU,UAAU;AAAA,IAC/B;AACA,aAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,aAAO,OAAO,GAAG,QAAQ,OAAO,QAAQ,UAAU,GAAG,YAAY,KAAK;AAAA,IAC1E;AACA,aAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,UAAI,EAAE,GAAG,QAAQ,UAAU,KAAK,GAAG;AAC/B,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,SAAS,GAAG;AAC7B,YAAI,EAAE,MAAM,UAAU,OAAO;AACzB,iBAAO;AAAA,MACf;AACA,UAAI,UAAU,OAAO,SAAS,GAAG;AAC7B,YAAI,EAAE,MAAM,UAAU,OAAO;AACzB,iBAAO;AAAA,MACf;AACA,UAAI,UAAU,OAAO,OAAO,GAAG;AAC3B,cAAM,QAAQ,IAAI,OAAO,OAAO,OAAO;AACvC,YAAI,CAAC,MAAM,KAAK,KAAK;AACjB,iBAAO;AAAA,MACf;AACA,UAAI,UAAU,OAAO,MAAM,GAAG;AAC1B,YAAI,CAAC,MAAM,eAAe,IAAI,OAAO,MAAM;AACvC,iBAAO;AACX,cAAM,OAAO,MAAM,eAAe,IAAI,OAAO,MAAM;AACnD,eAAO,KAAK,KAAK;AAAA,MACrB;AACA,aAAO;AAAA,IACX;AACA,aAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,cAAQ,GAAG,QAAQ,UAAU,KAAK;AAAA,IACtC;AACA,aAAS,iBAAiB,QAAQ,YAAY,OAAO;AACjD,cAAQ,GAAG,QAAQ,UAAU,KAAK,KAAK,IAAI,OAAO,OAAO,OAAO,EAAE,KAAK,KAAK;AAAA,IAChF;AACA,aAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,aAAO,OAAO,GAAG,QAAQ,OAAO,QAAQ,UAAU,GAAG,YAAY,KAAK;AAAA,IAC1E;AACA,aAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,UAAI,EAAE,GAAG,QAAQ,SAAS,KAAK,GAAG;AAC9B,eAAO;AAAA,MACX;AACA,UAAI,OAAO,UAAU,UAAa,EAAE,MAAM,WAAW,IAAI;AACrD,eAAO;AAAA,MACX;AACA,UAAI,EAAE,MAAM,WAAW,OAAO,WAAW;AACrC,eAAO;AAAA,MACX;AACA,UAAI,CAAC,OAAO,OAAO;AACf,eAAO;AAAA,MACX;AACA,eAAS,IAAI,GAAG,IAAI,OAAO,MAAM,QAAQ,KAAK;AAC1C,YAAI,CAAC,MAAM,OAAO,MAAM,CAAC,GAAG,YAAY,MAAM,CAAC,CAAC;AAC5C,iBAAO;AAAA,MACf;AACA,aAAO;AAAA,IACX;AACA,aAAS,WAAW,QAAQ,YAAY,OAAO;AAC3C,cAAQ,GAAG,QAAQ,aAAa,KAAK;AAAA,IACzC;AACA,aAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,aAAO,OAAO,MAAM,KAAK,CAAC,UAAU,MAAM,OAAO,YAAY,KAAK,CAAC;AAAA,IACvE;AACA,aAAS,YAAY,QAAQ,YAAY,OAAO;AAC5C,UAAI,EAAE,GAAG,QAAQ,cAAc,KAAK,GAAG;AACnC,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,MAAM,UAAU,OAAO,gBAAgB;AAC5E,eAAO;AAAA,MACX;AACA,UAAI,UAAU,OAAO,aAAa,KAAK,EAAE,MAAM,UAAU,OAAO,gBAAgB;AAC5E,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AACA,aAAS,SAAS,QAAQ,YAAY,OAAO;AACzC,aAAO;AAAA,IACX;AACA,aAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,aAAO,QAAQ,iBAAiB,WAAW,KAAK;AAAA,IACpD;AACA,aAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,UAAI,CAAC,MAAM,aAAa,IAAI,OAAO,MAAM,IAAI,CAAC;AAC1C,eAAO;AACX,YAAM,OAAO,MAAM,aAAa,IAAI,OAAO,MAAM,IAAI,CAAC;AACtD,aAAO,KAAK,QAAQ,KAAK;AAAA,IAC7B;AACA,aAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,YAAM,cAAc,UAAU,OAAO,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,IAAI;AACtE,YAAM,UAAU;AAChB,cAAQ,QAAQ,MAAM,IAAI,GAAG;AAAA,QACzB,KAAK;AACD,iBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,QAC3C,KAAK;AACD,iBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,QAC7C,KAAK;AACD,iBAAO,eAAe,SAAS,aAAa,KAAK;AAAA,QACrD,KAAK;AACD,iBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,QAC9C,KAAK;AACD,iBAAO,SAAS,SAAS,aAAa,KAAK;AAAA,QAC/C,KAAK;AACD,iBAAO,aAAa,SAAS,aAAa,KAAK;AAAA,QACnD,KAAK;AACD,iBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,QAC5C,KAAK;AACD,iBAAO,UAAU,SAAS,aAAa,KAAK;AAAA,QAChD,KAAK;AACD,iBAAO,SAAS,SAAS,aAAa,KAAK;AAAA,QAC/C,KAAK;AACD,iBAAO,WAAW,SAAS,aAAa,KAAK;AAAA,QACjD,KAAK;AACD,iBAAO,UAAU,SAAS,aAAa,KAAK;AAAA,QAChD,KAAK;AACD,iBAAO,SAAS,SAAS,aAAa,KAAK;AAAA,QAC/C,KAAK;AACD,iBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,QAC7C,KAAK;AACD,iBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,QAC3C,KAAK;AACD,iBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,QAC5C,KAAK;AACD,iBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,QAC9C,KAAK;AACD,iBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,QAC9C,KAAK;AACD,iBAAO,SAAS,SAAS,aAAa,KAAK;AAAA,QAC/C,KAAK;AACD,iBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,QAC9C,KAAK;AACD,iBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,QAC3C,KAAK;AACD,iBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,QAC9C,KAAK;AACD,iBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,QAC9C,KAAK;AACD,iBAAO,iBAAiB,SAAS,aAAa,KAAK;AAAA,QACvD,KAAK;AACD,iBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,QAC5C,KAAK;AACD,iBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,QAC7C,KAAK;AACD,iBAAO,WAAW,SAAS,aAAa,KAAK;AAAA,QACjD,KAAK;AACD,iBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,QAC7C,KAAK;AACD,iBAAO,YAAY,SAAS,aAAa,KAAK;AAAA,QAClD,KAAK;AACD,iBAAO,SAAS,SAAS,aAAa,KAAK;AAAA,QAC/C,KAAK;AACD,iBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,QAC5C;AACI,cAAI,CAAC,MAAM,aAAa,IAAI,QAAQ,MAAM,IAAI,CAAC;AAC3C,kBAAM,IAAI,2BAA2B,OAAO;AAChD,iBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,MAChD;AAAA,IACJ;AAEA,aAAS,SAAS,MAAM;AACpB,aAAO,KAAK,WAAW,IAAI,MAAM,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAC5F;AACA,IAAAD,SAAQ,QAAQ;AAAA;AAAA;;;AC9chB;AAAA,4GAAAI,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,kBAAkBA,SAAQ,kBAAkBA,SAAQ,eAAeA,SAAQ,uBAAuBA,SAAQ,uBAAuBA,SAAQ,4BAA4BA,SAAQ,4BAA4B;AACjN,QAAM,UAAU;AAChB,QAAM,UAAU;AAChB,QAAM,UAAU;AAChB,QAAM,QAAQ;AAId,QAAM,4BAAN,cAAwC,MAAM,aAAa;AAAA,MACvD,YAAY,QAAQ,OAAO,OAAO;AAC9B,cAAM,uCAAuC;AAC7C,aAAK,SAAS;AACd,aAAK,QAAQ;AACb,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AACA,IAAAA,SAAQ,4BAA4B;AACpC,QAAM,4BAAN,cAAwC,MAAM,aAAa;AAAA,MACvD,YAAY,QAAQ,OAAO,OAAO;AAC9B,cAAM,uCAAuC;AAC7C,aAAK,SAAS;AACd,aAAK,QAAQ;AACb,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AACA,IAAAA,SAAQ,4BAA4B;AACpC,QAAM,uBAAN,cAAmC,MAAM,aAAa;AAAA,MAClD,YAAY,QAAQ,OAAO,OAAO;AAC9B,cAAM,GAAG,iBAAiB,QAAQ,MAAM,UAAU,eAAe,EAAE;AACnE,aAAK,SAAS;AACd,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAC/B,QAAM,uBAAN,cAAmC,MAAM,aAAa;AAAA,MAClD,YAAY,QAAQ,OAAO,OAAO;AAC9B,cAAM,GAAG,iBAAiB,QAAQ,MAAM,UAAU,eAAe,EAAE;AACnE,aAAK,SAAS;AACd,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AACA,IAAAA,SAAQ,uBAAuB;AAK/B,QAAI;AACJ,KAAC,SAAUC,eAAc;AACrB,eAAS,OAAO,QAAQ,YAAY;AAChC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,OAAO,UAAU;AAAA,MAC/E;AACA,eAAS,eAAe,QAAQ,YAAY;AACxC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,OAAO,UAAU;AAAA,MAC/E;AACA,eAAS,aAAa,QAAQ,YAAY;AACtC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,SAAS,UAAU,KAAK,OAAO,WAAW,KAAK,CAACC,YAAW,MAAMA,SAAQ,UAAU,CAAC;AAAA,MAClJ;AACA,eAAS,UAAU,QAAQ,YAAY;AACnC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,SAAS,UAAU,KAAK,OAAO,WAAW,KAAK,CAACA,YAAW,MAAMA,SAAQ,UAAU,CAAC;AAAA,MAClJ;AACA,eAAS,WAAW,QAAQ,YAAY;AACpC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,UAAU,WAAW,OAAO,qBAAqB,KAAK,OAAO,MAAM,KAAK,CAACA,YAAW,MAAMA,SAAQ,UAAU,CAAC;AAAA,MACpK;AACA,eAAS,UAAU,QAAQ,YAAY;AACnC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,OAAO,UAAU;AAAA,MAC/E;AACA,eAAS,KAAK,QAAQ,YAAY;AAC9B,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,KAAK,UAAU;AAAA,MAC7E;AACA,eAAS,QAAQ,QAAQ,YAAY;AAEjC,eAAQ,MAAM,UAAU,WAAW,MAAM,KAAK,OAAO,OAAO,OAAO,UAAU,EAAE,KAAK,CAACA,YAAW,MAAMA,SAAQ,UAAU,CAAC,KAAK,MAAM,UAAU,QAAQ,OAAO,oBAAoB,KAAK,MAAM,OAAO,sBAAsB,UAAU;AAAA,MACvO;AACA,eAAS,SAAS,QAAQ,YAAY;AAClC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAM,OAAO,MAAM,UAAU;AAAA,MAC9E;AACA,eAAS,QAAQ,QAAQ,YAAY;AACjC,cAAM,UAAU,OAAO,oBAAoB,OAAO,iBAAiB,EAAE,CAAC;AACtE,cAAMC,YAAW,OAAO,kBAAkB,OAAO;AACjD,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,MAAMA,WAAU,UAAU,KAAM,MAAM,UAAU,QAAQ,OAAO,oBAAoB,KAAK,MAAM,UAAU,WAAW,OAAO,oBAAoB;AAAA,MAC/L;AACA,eAAS,KAAK,QAAQ,YAAY;AAC9B,YAAI,MAAM,UAAU,WAAW,MAAM;AACjC,iBAAO;AACX,eAAO,OAAO,GAAG,QAAQ,OAAO,QAAQ,UAAU,GAAG,UAAU;AAAA,MACnE;AACA,eAAS,MAAM,QAAQ,YAAY;AAC/B,YAAI,MAAM,UAAU,WAAW,MAAM;AACjC,iBAAO;AACX,eAAO,OAAO,GAAG,QAAQ,OAAO,QAAQ,UAAU,GAAG,UAAU;AAAA,MACnE;AACA,eAAS,OAAO,QAAQ,YAAY;AAChC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAM,EAAE,GAAG,QAAQ,aAAa,OAAO,KAAK,KAAK,OAAO,MAAM,KAAK,CAACD,YAAW,MAAMA,SAAQ,UAAU,CAAC;AAAA,MACpJ;AACA,eAAS,OAAO,QAAQ,YAAY;AAChC,eAAO,MAAM,UAAU,WAAW,MAAM,KAAK,OAAO,MAAM,KAAK,CAACA,YAAW,MAAMA,SAAQ,UAAU,CAAC;AAAA,MACxG;AACA,eAAS,MAAM,QAAQ,YAAY;AAC/B,cAAM,eAAe,GAAG,QAAQ,UAAU,OAAO,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,IAAI;AAClF,cAAM,UAAU;AAChB,YAAI,OAAO,OAAO,QAAQ,IAAI,OAAO,GAAG;AACpC,iBAAO;AACX,YAAI,OAAO;AACP,kBAAQ,IAAI,OAAO,GAAG;AAC1B,gBAAQ,OAAO,MAAM,IAAI,GAAG;AAAA,UACxB,KAAK;AACD,mBAAO,OAAO,SAAS,WAAW;AAAA,UACtC,KAAK;AACD,mBAAO,eAAe,SAAS,WAAW;AAAA,UAC9C,KAAK;AACD,mBAAO,aAAa,SAAS,WAAW;AAAA,UAC5C,KAAK;AACD,mBAAO,UAAU,SAAS,WAAW;AAAA,UACzC,KAAK;AACD,mBAAO,WAAW,SAAS,WAAW;AAAA,UAC1C,KAAK;AACD,mBAAO,UAAU,SAAS,WAAW;AAAA,UACzC,KAAK;AACD,mBAAO,KAAK,SAAS,WAAW;AAAA,UACpC,KAAK;AACD,mBAAO,QAAQ,SAAS,WAAW;AAAA,UACvC,KAAK;AACD,mBAAO,SAAS,SAAS,WAAW;AAAA,UACxC,KAAK;AACD,mBAAO,QAAQ,SAAS,WAAW;AAAA,UACvC,KAAK;AACD,mBAAO,KAAK,SAAS,WAAW;AAAA,UACpC,KAAK;AACD,mBAAO,MAAM,SAAS,WAAW;AAAA,UACrC,KAAK;AACD,mBAAO,OAAO,SAAS,WAAW;AAAA,UACtC,KAAK;AACD,mBAAO,OAAO,SAAS,WAAW;AAAA,UACtC;AACI,mBAAO,MAAM,UAAU,WAAW,MAAM;AAAA,QAChD;AAAA,MACJ;AACA,YAAM,UAAU,oBAAI,IAAI;AAExB,eAAS,IAAI,QAAQ,YAAY;AAC7B,gBAAQ,MAAM;AACd,eAAO,MAAM,QAAQ,UAAU;AAAA,MACnC;AACA,MAAAD,cAAa,MAAM;AAAA,IACvB,GAAG,iBAAiBD,SAAQ,eAAe,eAAe,CAAC,EAAE;AAK7D,QAAI;AACJ,KAAC,SAAUI,kBAAiB;AACxB,eAAS,QAAQ,QAAQ,OAAO;AAC5B,YAAI;AACA,iBAAO,MAAM,UAAU,WAAW,MAAM,IAAI,OAAO,MAAM,SAAS,EAAE,OAAO,KAAK,IAAI;AAAA,QACxF,SACO,OAAO;AACV,gBAAM,IAAI,qBAAqB,QAAQ,OAAO,KAAK;AAAA,QACvD;AAAA,MACJ;AAEA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,gBAAS,GAAG,QAAQ,SAAS,KAAK,IAC5B,QAAQ,QAAQ,MAAM,IAAI,CAACC,WAAU,MAAM,OAAO,OAAO,YAAYA,MAAK,CAAC,CAAC,IAC5E,QAAQ,QAAQ,KAAK;AAAA,MAC/B;AAEA,eAAS,WAAW,QAAQ,YAAY,OAAO;AAC3C,YAAI,EAAE,GAAG,QAAQ,eAAe,KAAK,MAAM,GAAG,QAAQ,aAAa,KAAK;AACpE,iBAAO,QAAQ,QAAQ,KAAK;AAChC,cAAM,YAAY,MAAM,YAAY,YAAY,QAAQ,EAAE,iBAAiB,MAAM,CAAC;AAClF,cAAM,kBAAkB,UAAU,OAAO,CAACA,QAAO,QAAQ;AACrD,iBAAQ,OAAOA,SACT,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,MAAM,MAAM,gBAAgB,QAAQ,QAAQ,CAAC,GAAG,CAAC,GAAG,YAAYA,OAAM,GAAG,CAAC,EAAE,IAC/FA;AAAA,QACV,GAAG,KAAK;AACR,YAAI,CAAC,MAAM,UAAU,WAAW,OAAO,qBAAqB,GAAG;AAC3D,iBAAO,QAAQ,QAAQ,eAAe;AAAA,QAC1C;AACA,cAAM,cAAc,OAAO,oBAAoB,eAAe;AAC9D,cAAM,wBAAwB,OAAO;AACrC,cAAM,oBAAoB,YAAY,OAAO,CAACA,QAAO,QAAQ;AACzD,iBAAO,CAAC,UAAU,SAAS,GAAG,IACxB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,QAAQ,uBAAuBA,OAAM,GAAG,CAAC,EAAE,IAC9DA;AAAA,QACV,GAAG,eAAe;AAClB,eAAO,QAAQ,QAAQ,iBAAiB;AAAA,MAC5C;AACA,eAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,eAAO,QAAQ,QAAQ,MAAM,OAAO,KAAK,YAAY,KAAK,CAAC;AAAA,MAC/D;AAEA,eAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,YAAI,EAAE,GAAG,QAAQ,eAAe,KAAK;AACjC,iBAAO,QAAQ,QAAQ,KAAK;AAChC,cAAM,YAAY,MAAM,YAAY,YAAY,QAAQ,EAAE,iBAAiB,MAAM,CAAC;AAClF,cAAM,kBAAkB,UAAU,OAAO,CAACA,QAAO,QAAQ;AACrD,iBAAQ,OAAOA,SACT,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,MAAM,OAAO,WAAW,GAAG,GAAG,YAAYA,OAAM,GAAG,CAAC,EAAE,IACzEA;AAAA,QACV,GAAG,KAAK;AACR,YAAI,CAAC,MAAM,UAAU,QAAQ,OAAO,oBAAoB,GAAG;AACvD,iBAAO,QAAQ,QAAQ,eAAe;AAAA,QAC1C;AACA,cAAM,cAAc,OAAO,oBAAoB,eAAe;AAC9D,cAAM,uBAAuB,OAAO;AACpC,cAAM,oBAAoB,YAAY,OAAO,CAACA,QAAO,QAAQ;AACzD,iBAAO,CAAC,UAAU,SAAS,GAAG,IACxB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,QAAQ,sBAAsBA,OAAM,GAAG,CAAC,EAAE,IAC7DA;AAAA,QACV,GAAG,eAAe;AAClB,eAAO,QAAQ,QAAQ,iBAAiB;AAAA,MAC5C;AAEA,eAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,YAAI,EAAE,GAAG,QAAQ,eAAe,KAAK;AACjC,iBAAO,QAAQ,QAAQ,KAAK;AAChC,cAAM,UAAU,OAAO,oBAAoB,OAAO,iBAAiB,EAAE,CAAC;AACtE,cAAM,YAAY,IAAI,OAAO,OAAO;AACpC,cAAM,kBAAkB,OAAO,oBAAoB,KAAK,EAAE,OAAO,CAACA,QAAO,QAAQ;AAC7E,iBAAO,UAAU,KAAK,GAAG,IACnB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,MAAM,OAAO,kBAAkB,OAAO,GAAG,YAAYA,OAAM,GAAG,CAAC,EAAE,IACpFA;AAAA,QACV,GAAG,KAAK;AACR,YAAI,CAAC,MAAM,UAAU,QAAQ,OAAO,oBAAoB,GAAG;AACvD,iBAAO,QAAQ,QAAQ,eAAe;AAAA,QAC1C;AACA,cAAM,cAAc,OAAO,oBAAoB,eAAe;AAC9D,cAAM,uBAAuB,OAAO;AACpC,cAAM,oBAAoB,YAAY,OAAO,CAACA,QAAO,QAAQ;AACzD,iBAAO,CAAC,UAAU,KAAK,GAAG,IACpB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,QAAQ,sBAAsBA,OAAM,GAAG,CAAC,EAAE,IAC7DA;AAAA,QACV,GAAG,eAAe;AAClB,eAAO,QAAQ,QAAQ,iBAAiB;AAAA,MAC5C;AACA,eAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,cAAM,UAAU,GAAG,QAAQ,OAAO,QAAQ,UAAU;AACpD,eAAO,QAAQ,QAAQ,MAAM,QAAQ,YAAY,KAAK,CAAC;AAAA,MAC3D;AACA,eAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,cAAM,UAAU,GAAG,QAAQ,OAAO,QAAQ,UAAU;AACpD,eAAO,QAAQ,QAAQ,MAAM,QAAQ,YAAY,KAAK,CAAC;AAAA,MAC3D;AAEA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,gBAAS,GAAG,QAAQ,SAAS,KAAK,MAAM,GAAG,QAAQ,SAAS,OAAO,KAAK,IAClE,QAAQ,QAAQ,OAAO,MAAM,IAAI,CAACH,SAAQ,UAAU,MAAMA,SAAQ,YAAY,MAAM,KAAK,CAAC,CAAC,CAAC,IAC5F,QAAQ,QAAQ,KAAK;AAAA,MAC/B;AACA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,cAAM,YAAY,QAAQ,QAAQ,KAAK;AACvC,mBAAW,aAAa,OAAO,OAAO;AAClC,cAAI,EAAE,GAAG,QAAQ,OAAO,WAAW,YAAY,SAAS;AACpD;AACJ,iBAAO,MAAM,WAAW,YAAY,SAAS;AAAA,QACjD;AACA,eAAO;AAAA,MACX;AACA,eAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,cAAM,cAAc,OAAO,OAAO,QAAQ,WAAW,CAAC,GAAG,YAAY,MAAM,IAAI;AAC/E,cAAM,UAAU;AAChB,gBAAQ,OAAO,MAAM,IAAI,GAAG;AAAA,UACxB,KAAK;AACD,mBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UAC7C,KAAK;AACD,mBAAO,WAAW,SAAS,aAAa,KAAK;AAAA,UACjD,KAAK;AACD,mBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAC3C,KAAK;AACD,mBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UAC9C,KAAK;AACD,mBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UAC9C,KAAK;AACD,mBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAC3C,KAAK;AACD,mBAAO,QAAQ,SAAS,KAAK;AAAA,UACjC,KAAK;AACD,mBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,UAC5C,KAAK;AACD,mBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UAC7C,KAAK;AACD,mBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UAC7C;AACI,mBAAO,QAAQ,SAAS,KAAK;AAAA,QACrC;AAAA,MACJ;AACA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,eAAO,MAAM,QAAQ,YAAY,KAAK;AAAA,MAC1C;AACA,MAAAE,iBAAgB,SAAS;AAAA,IAC7B,GAAG,oBAAoBJ,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AAKtE,QAAI;AACJ,KAAC,SAAUM,kBAAiB;AACxB,eAAS,QAAQ,QAAQ,OAAO;AAC5B,YAAI;AACA,iBAAO,MAAM,UAAU,WAAW,MAAM,IAAI,OAAO,MAAM,SAAS,EAAE,OAAO,KAAK,IAAI;AAAA,QACxF,SACO,OAAO;AACV,gBAAM,IAAI,qBAAqB,QAAQ,OAAO,KAAK;AAAA,QACvD;AAAA,MACJ;AAEA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,cAAM,YAAY,QAAQ,QAAQ,KAAK;AACvC,gBAAQ,GAAG,QAAQ,SAAS,SAAS,IAC/B,UAAU,IAAI,CAACD,WAAU,MAAM,OAAO,OAAO,YAAYA,MAAK,CAAC,IAC/D;AAAA,MACV;AAEA,eAAS,WAAW,QAAQ,YAAY,OAAO;AAC3C,cAAM,YAAY,QAAQ,QAAQ,KAAK;AACvC,YAAI,EAAE,GAAG,QAAQ,eAAe,KAAK,MAAM,GAAG,QAAQ,aAAa,KAAK;AACpE,iBAAO;AACX,cAAM,YAAY,MAAM,YAAY,YAAY,QAAQ,EAAE,iBAAiB,MAAM,CAAC;AAClF,cAAM,kBAAkB,UAAU,OAAO,CAACA,QAAO,QAAQ;AACrD,iBAAO,OAAO,YACR,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,MAAM,MAAM,gBAAgB,QAAQ,QAAQ,CAAC,GAAG,CAAC,GAAG,YAAYA,OAAM,GAAG,CAAC,EAAE,IAC/FA;AAAA,QACV,GAAG,SAAS;AACZ,YAAI,CAAC,MAAM,UAAU,WAAW,OAAO,qBAAqB,GAAG;AAC3D,iBAAO,QAAQ,QAAQ,eAAe;AAAA,QAC1C;AACA,cAAM,cAAc,OAAO,oBAAoB,eAAe;AAC9D,cAAM,wBAAwB,OAAO;AACrC,eAAO,YAAY,OAAO,CAACA,QAAO,QAAQ;AACtC,iBAAO,CAAC,UAAU,SAAS,GAAG,IACxB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,QAAQ,uBAAuBA,OAAM,GAAG,CAAC,EAAE,IAC9DA;AAAA,QACV,GAAG,eAAe;AAAA,MACtB;AACA,eAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,eAAO,QAAQ,OAAO,KAAK,QAAQ,QAAQ,KAAK,CAAC;AAAA,MACrD;AAEA,eAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,cAAM,YAAY,QAAQ,QAAQ,KAAK;AACvC,YAAI,EAAE,GAAG,QAAQ,eAAe,KAAK;AACjC,iBAAO;AACX,cAAM,YAAY,MAAM,YAAY,YAAY,QAAQ,EAAE,iBAAiB,MAAM,CAAC;AAClF,cAAM,kBAAkB,UAAU,OAAO,CAACA,QAAO,QAAQ;AACrD,iBAAO,OAAOA,SACR,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,MAAM,OAAO,WAAW,GAAG,GAAG,YAAYA,OAAM,GAAG,CAAC,EAAE,IACzEA;AAAA,QACV,GAAG,SAAS;AACZ,YAAI,CAAC,MAAM,UAAU,QAAQ,OAAO,oBAAoB,GAAG;AACvD,iBAAO;AAAA,QACX;AACA,cAAM,cAAc,OAAO,oBAAoB,eAAe;AAC9D,cAAM,uBAAuB,OAAO;AACpC,eAAO,YAAY,OAAO,CAACA,QAAO,QAAQ;AACtC,iBAAO,CAAC,UAAU,SAAS,GAAG,IACxB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,QAAQ,sBAAsBA,OAAM,GAAG,CAAC,EAAE,IAC7DA;AAAA,QACV,GAAG,eAAe;AAAA,MACtB;AAEA,eAAS,QAAQ,QAAQ,YAAY,OAAO;AACxC,cAAM,YAAY,QAAQ,QAAQ,KAAK;AACvC,YAAI,EAAE,GAAG,QAAQ,eAAe,KAAK;AACjC,iBAAO;AACX,cAAM,UAAU,OAAO,oBAAoB,OAAO,iBAAiB,EAAE,CAAC;AACtE,cAAM,YAAY,IAAI,OAAO,OAAO;AACpC,cAAM,kBAAkB,OAAO,oBAAoB,KAAK,EAAE,OAAO,CAACA,QAAO,QAAQ;AAC7E,iBAAO,UAAU,KAAK,GAAG,IACnB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,MAAM,OAAO,kBAAkB,OAAO,GAAG,YAAYA,OAAM,GAAG,CAAC,EAAE,IACpFA;AAAA,QACV,GAAG,SAAS;AACZ,YAAI,CAAC,MAAM,UAAU,QAAQ,OAAO,oBAAoB,GAAG;AACvD,iBAAO,QAAQ,QAAQ,eAAe;AAAA,QAC1C;AACA,cAAM,cAAc,OAAO,oBAAoB,eAAe;AAC9D,cAAM,uBAAuB,OAAO;AACpC,eAAO,YAAY,OAAO,CAACA,QAAO,QAAQ;AACtC,iBAAO,CAAC,UAAU,KAAK,GAAG,IACpB,EAAE,GAAGA,QAAO,CAAC,GAAG,GAAG,QAAQ,sBAAsBA,OAAM,GAAG,CAAC,EAAE,IAC7DA;AAAA,QACV,GAAG,eAAe;AAAA,MACtB;AACA,eAAS,KAAK,QAAQ,YAAY,OAAO;AACrC,cAAM,UAAU,GAAG,QAAQ,OAAO,QAAQ,UAAU;AACpD,cAAM,WAAW,MAAM,QAAQ,YAAY,KAAK;AAChD,eAAO,QAAQ,QAAQ,QAAQ;AAAA,MACnC;AACA,eAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,cAAM,UAAU,GAAG,QAAQ,OAAO,QAAQ,UAAU;AACpD,cAAM,WAAW,MAAM,QAAQ,YAAY,KAAK;AAChD,eAAO,QAAQ,QAAQ,QAAQ;AAAA,MACnC;AACA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,cAAM,SAAS,QAAQ,QAAQ,KAAK;AACpC,gBAAQ,GAAG,QAAQ,SAAS,OAAO,KAAK,IAAI,OAAO,MAAM,IAAI,CAACH,SAAQ,UAAU,MAAMA,SAAQ,YAAY,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC;AAAA,MACjI;AACA,eAAS,OAAO,QAAQ,YAAY,OAAO;AAEvC,mBAAW,aAAa,OAAO,OAAO;AAClC,cAAI,EAAE,GAAG,QAAQ,OAAO,WAAW,YAAY,KAAK;AAChD;AACJ,gBAAM,SAAS,MAAM,WAAW,YAAY,KAAK;AACjD,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC;AAEA,mBAAW,aAAa,OAAO,OAAO;AAClC,gBAAM,SAAS,MAAM,WAAW,YAAY,KAAK;AACjD,cAAI,EAAE,GAAG,QAAQ,OAAO,QAAQ,YAAY,MAAM;AAC9C;AACJ,iBAAO,QAAQ,QAAQ,MAAM;AAAA,QACjC;AACA,eAAO,QAAQ,QAAQ,KAAK;AAAA,MAChC;AACA,eAAS,MAAM,QAAQ,YAAY,OAAO;AACtC,cAAM,cAAc,OAAO,OAAO,QAAQ,WAAW,CAAC,GAAG,YAAY,MAAM,IAAI;AAC/E,cAAM,UAAU;AAChB,gBAAQ,OAAO,MAAM,IAAI,GAAG;AAAA,UACxB,KAAK;AACD,mBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UAC7C,KAAK;AACD,mBAAO,WAAW,SAAS,aAAa,KAAK;AAAA,UACjD,KAAK;AACD,mBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAC3C,KAAK;AACD,mBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UAC9C,KAAK;AACD,mBAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UAC9C,KAAK;AACD,mBAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAC3C,KAAK;AACD,mBAAO,MAAM,SAAS,aAAa,KAAK;AAAA,UAC5C,KAAK;AACD,mBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UAC7C,KAAK;AACD,mBAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UAC7C;AACI,mBAAO,QAAQ,SAAS,KAAK;AAAA,QACrC;AAAA,MACJ;AACA,eAAS,OAAO,QAAQ,YAAY,OAAO;AACvC,eAAO,MAAM,QAAQ,YAAY,KAAK;AAAA,MAC1C;AACA,MAAAI,iBAAgB,SAAS;AAAA,IAC7B,GAAG,oBAAoBN,SAAQ,kBAAkB,kBAAkB,CAAC,EAAE;AAAA;AAAA;;;ACxdtE;AAAA,8GAAAO,UAAA;AAAA;AA4BA,WAAO,eAAeA,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,eAAeA,SAAQ,SAASA,SAAQ,6BAA6BA,SAAQ,+BAA+BA,SAAQ,YAAY;AACxI,QAAM,cAAc;AACpB,QAAM,UAAU;AAChB,QAAM,WAAW;AACjB,QAAM,UAAU;AAChB,QAAM,UAAU;AAChB,QAAM,SAAS;AACf,QAAM,QAAQ;AAId,QAAM,YAAN,MAAgB;AAAA,MACZ,YAAY,QAAQ,YAAY,WAAWC,OAAM;AAC7C,aAAK,SAAS;AACd,aAAK,aAAa;AAClB,aAAK,YAAY;AACjB,aAAK,OAAOA;AACZ,aAAK,eAAe,YAAY,aAAa,IAAI,QAAQ,UAAU;AAAA,MACvE;AAAA;AAAA,MAEA,OAAO;AACH,eAAO,KAAK;AAAA,MAChB;AAAA;AAAA,MAEA,OAAO,OAAO;AACV,gBAAQ,GAAG,SAAS,QAAQ,KAAK,QAAQ,KAAK,YAAY,KAAK;AAAA,MACnE;AAAA;AAAA,MAEA,MAAM,OAAO;AACT,eAAO,KAAK,UAAU,KAAK;AAAA,MAC/B;AAAA;AAAA,MAEA,OAAO,OAAO;AACV,YAAI,CAAC,KAAK,UAAU,KAAK;AACrB,gBAAM,IAAI,YAAY,0BAA0B,KAAK,QAAQ,OAAO,KAAK,OAAO,KAAK,EAAE,MAAM,CAAC;AAClG,eAAO,KAAK,eAAe,YAAY,gBAAgB,OAAO,KAAK,QAAQ,KAAK,YAAY,KAAK,IAAI;AAAA,MACzG;AAAA;AAAA,MAEA,OAAO,OAAO;AACV,cAAM,UAAU,KAAK,eAAe,YAAY,gBAAgB,OAAO,KAAK,QAAQ,KAAK,YAAY,KAAK,IAAI;AAC9G,YAAI,CAAC,KAAK,UAAU,OAAO;AACvB,gBAAM,IAAI,YAAY,0BAA0B,KAAK,QAAQ,OAAO,KAAK,OAAO,KAAK,EAAE,MAAM,CAAC;AAClG,eAAO;AAAA,MACX;AAAA,IACJ;AACA,IAAAD,SAAQ,YAAY;AAIpB,QAAI;AACJ,KAAC,SAAUE,YAAW;AAClB,eAAS,WAAWD,OAAM;AACtB,eAAOA,UAAS;AAAA,MACpB;AACA,MAAAC,WAAU,aAAa;AACvB,eAAS,aAAaD,OAAM;AACxB,eAAOA,UAAS;AAAA,MACpB;AACA,MAAAC,WAAU,eAAe;AACzB,eAAS,QAAQD,OAAM;AACnB,eAAQA,SAAQ,MAAMA,SAAQ,MAAQA,SAAQ,MAAMA,SAAQ;AAAA,MAChE;AACA,MAAAC,WAAU,UAAU;AACpB,eAAS,UAAUD,OAAM;AACrB,eAAOA,SAAQ,MAAMA,SAAQ;AAAA,MACjC;AACA,MAAAC,WAAU,YAAY;AAAA,IAC1B,GAAG,cAAc,YAAY,CAAC,EAAE;AAIhC,QAAI;AACJ,KAAC,SAAUC,mBAAkB;AACzB,eAAS,wBAAwB,OAAO;AACpC,YAAI,MAAM,WAAW;AACjB,iBAAO;AACX,eAAO,UAAU,UAAU,MAAM,WAAW,CAAC,CAAC;AAAA,MAClD;AACA,eAAS,WAAW,OAAO;AACvB,YAAI,wBAAwB,KAAK;AAC7B,iBAAO;AACX,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,gBAAMF,QAAO,MAAM,WAAW,CAAC;AAC/B,gBAAM,QAAQ,UAAU,QAAQA,KAAI,KAAK,UAAU,UAAUA,KAAI,KAAK,UAAU,WAAWA,KAAI,KAAK,UAAU,aAAaA,KAAI;AAC/H,cAAI,CAAC;AACD,mBAAO;AAAA,QACf;AACA,eAAO;AAAA,MACX;AACA,eAAS,aAAa,KAAK;AACvB,eAAO,IAAI,QAAQ,MAAM,KAAK;AAAA,MAClC;AACA,eAAS,OAAO,QAAQ,KAAK;AACzB,eAAO,WAAW,GAAG,IAAI,GAAG,MAAM,IAAI,GAAG,KAAK,GAAG,MAAM,KAAK,aAAa,GAAG,CAAC;AAAA,MACjF;AACA,MAAAE,kBAAiB,SAAS;AAAA,IAC9B,GAAG,qBAAqB,mBAAmB,CAAC,EAAE;AAI9C,QAAI;AACJ,KAAC,SAAUC,aAAY;AACnB,eAAS,OAAO,KAAK;AACjB,cAAMC,UAAS,CAAC;AAChB,iBAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACjC,gBAAMJ,QAAO,IAAI,WAAW,CAAC;AAC7B,cAAI,UAAU,UAAUA,KAAI,KAAK,UAAU,QAAQA,KAAI,GAAG;AACtD,YAAAI,QAAO,KAAK,IAAI,OAAO,CAAC,CAAC;AAAA,UAC7B,OACK;AACD,YAAAA,QAAO,KAAK,IAAIJ,KAAI,GAAG;AAAA,UAC3B;AAAA,QACJ;AACA,eAAOI,QAAO,KAAK,EAAE,EAAE,QAAQ,OAAO,GAAG;AAAA,MAC7C;AACA,MAAAD,YAAW,SAAS;AAAA,IACxB,GAAG,eAAe,aAAa,CAAC,EAAE;AAIlC,QAAI;AACJ,KAAC,SAAUE,gBAAe;AACtB,eAAS,OAAO,SAAS;AACrB,eAAO,QAAQ,QAAQ,MAAM,KAAK;AAAA,MACtC;AACA,MAAAA,eAAc,SAAS;AAAA,IAC3B,GAAG,kBAAkB,gBAAgB,CAAC,EAAE;AAIxC,QAAM,+BAAN,cAA2C,MAAM,aAAa;AAAA,MAC1D,YAAY,QAAQ;AAChB,cAAM,cAAc;AACpB,aAAK,SAAS;AAAA,MAClB;AAAA,IACJ;AACA,IAAAN,SAAQ,+BAA+B;AACvC,QAAM,6BAAN,cAAyC,MAAM,aAAa;AAAA,MACxD,YAAY,QAAQ;AAChB,cAAM,iEAAiE;AACvE,aAAK,SAAS;AAAA,MAClB;AAAA,IACJ;AACA,IAAAA,SAAQ,6BAA6B;AAIrC,QAAI;AACJ,KAAC,SAAUO,SAAQ;AACf,eAAS,wBAAwB,OAAO,KAAK,YAAY;AACrD,eAAO,QAAQ,iBAAiB,6BAA6B,KAAK,GAAG,QAAQ,KAAK,MAAM,UAAU,aAAa,IAAI,iBAAiB,OAAO,OAAO,GAAG,CAAC,oBAAoB,UAAU;AAAA,MACxL;AACA,MAAAA,QAAO,0BAA0B;AACjC,eAAS,aAAa,OAAO;AACzB,eAAO,CAAC,QAAQ,iBAAiB,mBAAmB,WAAW,KAAK,oBAAoB,KAAK,+BAA+B,KAAK,OAAO,WAAW,KAAK,oBAAoB,KAAK;AAAA,MACrL;AACA,MAAAA,QAAO,eAAe;AACtB,eAAS,aAAa,OAAO;AACzB,eAAO,CAAC,QAAQ,iBAAiB,mBAC3B,WAAW,KAAK,oBAAoB,KAAK,+BAA+B,KAAK,UAAU,KAAK,0BAA0B,KAAK,6BAC3H,WAAW,KAAK,oBAAoB,KAAK,kBAAkB,KAAK,0BAA0B,KAAK;AAAA,MACzG;AACA,MAAAA,QAAO,eAAe;AACtB,eAAS,aAAa,OAAO;AACzB,eAAO,CAAC,QAAQ,iBAAiB,WAAW,WAAW,KAAK,oCAAoC,KAAK,OAAO,UAAU,KAAK;AAAA,MAC/H;AACA,MAAAA,QAAO,eAAe;AACtB,eAAS,WAAW,OAAO;AACvB,eAAO,QAAQ,iBAAiB,gBAAgB,IAAI,KAAK,qBAAqB,KAAK,eAAe,GAAG,KAAK;AAAA,MAC9G;AACA,MAAAA,QAAO,aAAa;AAAA,IACxB,GAAG,WAAWP,SAAQ,SAAS,SAAS,CAAC,EAAE;AAE3C,QAAIQ;AACJ,KAAC,SAAUA,eAAc;AAIrB,eAAS,eAAe,QAAQ;AAC5B,eAAO,OAAO,MAAM,IAAI,MAAM,SAAS,OAAO,MAAM,IAAI,MAAM;AAAA,MAClE;AAIA,gBAAU,KAAK,QAAQ,YAAY,OAAO;AACtC,cAAM;AAAA,MACV;AACA,gBAAU,OAAO,QAAQ,YAAY,OAAO;AACxC,cAAM,iBAAiB,KAAK;AAC5B,cAAM,CAAC,WAAW,WAAW,IAAI,CAAC,gBAAgB,SAAS,KAAK,GAAG,gBAAgB,OAAO,QAAQ,CAAC;AACnG,aAAK,GAAG,QAAQ,UAAU,OAAO,QAAQ;AACrC,gBAAM,GAAG,KAAK,cAAc,OAAO,QAAQ;AAC/C,aAAK,GAAG,QAAQ,UAAU,OAAO,QAAQ;AACrC,gBAAM,GAAG,KAAK,cAAc,OAAO,QAAQ;AAC/C,cAAM,oBAAoB,iBAAiB,OAAO,OAAO,YAAY,OAAO;AAC5E,cAAM,GAAG,KAAK,WAAW,SAAS,QAAQ,iBAAiB;AAC3D,YAAI,MAAM,UAAU,QAAQ,OAAO,QAAQ,MAAM,GAAG,QAAQ,UAAU,OAAO,WAAW,MAAM,GAAG,QAAQ,UAAU,OAAO,WAAW,GAAG;AACpI,gBAAM,iBAAiB,MAAM,UAAU,QAAQ,OAAO,QAAQ,IAAI,OAAO,WAAW,MAAM,KAAK,MAAM;AACrG,gBAAM,kBAAkB,iBAAiB,gBAAgB,YAAY,OAAO;AAC5E,gBAAM,oBAAoB,GAAG,QAAQ,UAAU,OAAO,WAAW,IAAI,CAAC,aAAa,OAAO,WAAW,GAAG,IAAI,CAAC;AAC7G,gBAAM,oBAAoB,GAAG,QAAQ,UAAU,OAAO,WAAW,IAAI,CAAC,aAAa,OAAO,WAAW,GAAG,IAAI,CAAC;AAC7G,gBAAM,aAAa,+BAA+B,WAAW,KAAK,SAAS,QAAQ,eAAe;AAClG,gBAAM,QAAQ,CAAC,eAAe,GAAG,kBAAkB,GAAG,gBAAgB,EAAE,KAAK,MAAM;AACnF,gBAAM,KAAK,SAAS,UAAU,UAAU,YAAY,KAAK,MAAM,KAAK;AAAA,QACxE;AACA,YAAI,OAAO,gBAAgB,MAAM;AAC7B,gBAAM,QAAQ;AACd,gBAAM,QAAQ,wDAAwD,KAAK;AAC3E,gBAAM,KAAK,SAAS,UAAU,KAAK,MAAM,KAAK;AAAA,QAClD;AAAA,MACJ;AACA,gBAAU,eAAe,QAAQ,YAAY,OAAO;AAChD,cAAM,yDAAyD,KAAK;AAAA,MACxE;AACA,gBAAU,QAAQ,QAAQ,YAAY,OAAO;AACzC,cAAM,WAAW,KAAK;AACtB,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,aAAa,OAAO,gBAAgB;AACtD,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,aAAa,OAAO,gBAAgB;AACtD,aAAK,GAAG,QAAQ,UAAU,OAAO,OAAO;AACpC,gBAAM,GAAG,KAAK,cAAc,OAAO,OAAO;AAC9C,aAAK,GAAG,QAAQ,UAAU,OAAO,OAAO;AACpC,gBAAM,GAAG,KAAK,cAAc,OAAO,OAAO;AAC9C,aAAK,GAAG,QAAQ,UAAU,OAAO,UAAU;AACvC,gBAAM,IAAI,KAAK,aAAa,OAAO,UAAU;AAAA,MACrD;AACA,gBAAU,SAAS,QAAQ,YAAY,OAAO;AAC1C,cAAM,WAAW,KAAK;AAAA,MAC1B;AACA,gBAAU,aAAa,QAAQ,YAAY,OAAO;AAC9C,eAAO,MAAM,OAAO,SAAS,YAAY,GAAG,KAAK,YAAY;AAAA,MACjE;AACA,gBAAU,MAAM,QAAQ,YAAY,OAAO;AACvC,cAAM,IAAI,KAAK,wCAAwC,KAAK;AAC5D,aAAK,GAAG,QAAQ,UAAU,OAAO,yBAAyB;AACtD,gBAAM,GAAG,KAAK,gBAAgB,OAAO,yBAAyB;AAClE,aAAK,GAAG,QAAQ,UAAU,OAAO,yBAAyB;AACtD,gBAAM,GAAG,KAAK,gBAAgB,OAAO,yBAAyB;AAClE,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,iBAAiB,OAAO,gBAAgB;AAC1D,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,iBAAiB,OAAO,gBAAgB;AAC1D,aAAK,GAAG,QAAQ,UAAU,OAAO,mBAAmB;AAChD,gBAAM,IAAI,KAAK,gBAAgB,OAAO,mBAAmB;AAAA,MACjE;AACA,gBAAU,UAAU,QAAQ,YAAY,OAAO;AAC3C,cAAM,WAAW,KAAK;AAAA,MAC1B;AACA,gBAAU,SAAS,QAAQ,YAAY,OAAO;AAC1C,cAAM,WAAW,KAAK,qCAAqC,KAAK;AAChE,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,MAAM,OAAO,gBAAgB;AAC/C,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,MAAM,OAAO,gBAAgB;AAC/C,aAAK,GAAG,QAAQ,UAAU,OAAO,OAAO;AACpC,gBAAM,GAAG,KAAK,OAAO,OAAO,OAAO;AACvC,aAAK,GAAG,QAAQ,UAAU,OAAO,OAAO;AACpC,gBAAM,GAAG,KAAK,OAAO,OAAO,OAAO;AACvC,aAAK,GAAG,QAAQ,UAAU,OAAO,UAAU;AACvC,gBAAM,IAAI,KAAK,MAAM,OAAO,UAAU;AAAA,MAC9C;AACA,gBAAU,WAAW,QAAQ,YAAY,OAAO;AAC5C,cAAM,SAAS,OAAO,MAAM,IAAI,CAACC,YAAW,iBAAiBA,SAAQ,YAAY,KAAK,CAAC,EAAE,KAAK,MAAM;AACpG,YAAI,OAAO,0BAA0B,OAAO;AACxC,gBAAM,WAAW,eAAe,GAAG,IAAI,OAAO,MAAM,YAAY,eAAe,MAAM,CAAC,CAAC,GAAG;AAC1F,gBAAM,SAAS,8BAA8B,KAAK,kBAAkB,QAAQ;AAC5E,gBAAM,IAAI,MAAM,OAAO,MAAM;AAAA,QACjC,WACS,MAAM,UAAU,QAAQ,OAAO,qBAAqB,GAAG;AAC5D,gBAAM,WAAW,eAAe,GAAG,IAAI,OAAO,MAAM,YAAY,eAAe,MAAM,CAAC,CAAC,GAAG;AAC1F,gBAAM,SAAS,8BAA8B,KAAK,kBAAkB,QAAQ,iBAAiB,iBAAiB,OAAO,uBAAuB,YAAY,GAAG,KAAK,OAAO,CAAC;AACxK,gBAAM,IAAI,MAAM,OAAO,MAAM;AAAA,QACjC,OACK;AACD,gBAAM,IAAI,MAAM;AAAA,QACpB;AAAA,MACJ;AACA,gBAAU,UAAU,QAAQ,YAAY,OAAO;AAC3C,cAAM,oDAAoD,KAAK;AAAA,MACnE;AACA,gBAAU,SAAS,QAAQ,YAAY,OAAO;AAC1C,YAAI,OAAO,OAAO,UAAU,YAAY,OAAO,OAAO,UAAU,WAAW;AACvE,gBAAM,IAAI,KAAK,QAAQ,OAAO,KAAK;AAAA,QACvC,OACK;AACD,gBAAM,IAAI,KAAK,SAAS,cAAc,OAAO,OAAO,KAAK,CAAC;AAAA,QAC9D;AAAA,MACJ;AACA,gBAAU,OAAO,QAAQ,YAAY,OAAO;AACxC,cAAM;AAAA,MACV;AACA,gBAAU,KAAK,QAAQ,YAAY,OAAO;AACtC,cAAM,aAAa,iBAAiB,OAAO,KAAK,YAAY,KAAK;AACjE,cAAM,KAAK,UAAU;AAAA,MACzB;AACA,gBAAU,MAAM,QAAQ,YAAY,OAAO;AACvC,cAAM,IAAI,KAAK;AAAA,MACnB;AACA,gBAAU,QAAQ,QAAQ,YAAY,OAAO;AACzC,cAAM,OAAO,aAAa,KAAK;AAC/B,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,MAAM,OAAO,gBAAgB;AAC/C,aAAK,GAAG,QAAQ,UAAU,OAAO,gBAAgB;AAC7C,gBAAM,GAAG,KAAK,MAAM,OAAO,gBAAgB;AAC/C,aAAK,GAAG,QAAQ,UAAU,OAAO,OAAO;AACpC,gBAAM,GAAG,KAAK,OAAO,OAAO,OAAO;AACvC,aAAK,GAAG,QAAQ,UAAU,OAAO,OAAO;AACpC,gBAAM,GAAG,KAAK,OAAO,OAAO,OAAO;AACvC,aAAK,GAAG,QAAQ,UAAU,OAAO,UAAU;AACvC,gBAAM,IAAI,KAAK,MAAM,OAAO,UAAU;AAAA,MAC9C;AACA,gBAAU,QAAQ,QAAQ,YAAY,OAAO;AACzC,cAAM,OAAO,aAAa,KAAK;AAC/B,aAAK,GAAG,QAAQ,UAAU,OAAO,aAAa;AAC1C,gBAAM,8BAA8B,KAAK,eAAe,OAAO,aAAa;AAChF,aAAK,GAAG,QAAQ,UAAU,OAAO,aAAa;AAC1C,gBAAM,8BAA8B,KAAK,eAAe,OAAO,aAAa;AAChF,cAAM,YAAY,OAAO,oBAAoB,OAAO,UAAU;AAC9D,mBAAW,YAAY,WAAW;AAC9B,gBAAM,mBAAmB,iBAAiB,OAAO,OAAO,QAAQ;AAChE,gBAAMC,YAAW,OAAO,WAAW,QAAQ;AAC3C,cAAI,OAAO,YAAY,OAAO,SAAS,SAAS,QAAQ,GAAG;AACvD,mBAAO,MAAMA,WAAU,YAAY,gBAAgB;AACnD,gBAAI,MAAM,iBAAiB,MAAMA,SAAQ,KAAK,eAAeA,SAAQ;AACjE,oBAAM,KAAK,QAAQ,QAAQ,KAAK;AAAA,UACxC,OACK;AACD,kBAAM,aAAa,iBAAiBA,WAAU,YAAY,gBAAgB;AAC1E,kBAAM,OAAO,wBAAwB,OAAO,UAAU,UAAU;AAAA,UACpE;AAAA,QACJ;AACA,YAAI,OAAO,yBAAyB,OAAO;AACvC,cAAI,OAAO,YAAY,OAAO,SAAS,WAAW,UAAU,QAAQ;AAChE,kBAAM,8BAA8B,KAAK,gBAAgB,UAAU,MAAM;AAAA,UAC7E,OACK;AACD,kBAAMC,QAAO,IAAI,UAAU,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC;AAC9D,kBAAM,8BAA8B,KAAK,kBAAkBA,KAAI;AAAA,UACnE;AAAA,QACJ;AACA,YAAI,OAAO,OAAO,yBAAyB,UAAU;AACjD,gBAAM,aAAa,iBAAiB,OAAO,sBAAsB,YAAY,GAAG,KAAK,OAAO;AAC5F,gBAAMA,QAAO,IAAI,UAAU,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC;AAC9D,gBAAM,+BAA+B,KAAK,kBAAkBA,KAAI,qBAAqB,UAAU;AAAA,QACnG;AAAA,MACJ;AACA,gBAAU,SAAS,QAAQ,YAAY,OAAO;AAC1C,cAAM,wCAAwC,KAAK;AAAA,MACvD;AACA,gBAAU,QAAQ,QAAQ,YAAY,OAAO;AACzC,cAAM,OAAO,aAAa,KAAK;AAC/B,aAAK,GAAG,QAAQ,UAAU,OAAO,aAAa;AAC1C,gBAAM,8BAA8B,KAAK,eAAe,OAAO,aAAa;AAChF,aAAK,GAAG,QAAQ,UAAU,OAAO,aAAa;AAC1C,gBAAM,8BAA8B,KAAK,eAAe,OAAO,aAAa;AAChF,cAAM,CAAC,YAAY,aAAa,IAAI,OAAO,QAAQ,OAAO,iBAAiB,EAAE,CAAC;AAC9E,cAAM,WAAW,eAAe,GAAG,IAAI,OAAO,UAAU,CAAC,EAAE;AAC3D,cAAM,SAAS,iBAAiB,eAAe,YAAY,OAAO;AAClE,cAAM,SAAS,MAAM,UAAU,QAAQ,OAAO,oBAAoB,IAAI,iBAAiB,OAAO,sBAAsB,YAAY,KAAK,IAAI,OAAO,yBAAyB,QAAQ,UAAU;AAC3L,cAAM,aAAa,IAAI,QAAQ,gBAAgB,MAAM,MAAM,MAAM;AACjE,cAAM,mBAAmB,KAAK,6BAA6B,UAAU;AAAA,MACzE;AACA,gBAAU,KAAK,QAAQ,YAAY,OAAO;AACtC,cAAM,UAAU,GAAG,QAAQ,OAAO,QAAQ,UAAU;AAGpD,YAAI,MAAM,UAAU,IAAI,OAAO,IAAI;AAC/B,iBAAO,MAAM,GAAG,mBAAmB,OAAO,IAAI,CAAC,IAAI,KAAK;AAC5D,eAAO,MAAM,QAAQ,YAAY,KAAK;AAAA,MAC1C;AACA,gBAAU,QAAQ,QAAQ,YAAY,OAAO;AACzC,cAAM,WAAW,KAAK;AACtB,aAAK,GAAG,QAAQ,UAAU,OAAO,SAAS;AACtC,gBAAM,GAAG,KAAK,cAAc,OAAO,SAAS;AAChD,aAAK,GAAG,QAAQ,UAAU,OAAO,SAAS;AACtC,gBAAM,GAAG,KAAK,cAAc,OAAO,SAAS;AAChD,YAAI,OAAO,YAAY,QAAW;AAC9B,gBAAM,WAAW,eAAe,GAAG,IAAI,OAAO,OAAO,OAAO,CAAC,GAAG;AAChE,gBAAM,GAAG,QAAQ,SAAS,KAAK;AAAA,QACnC;AACA,YAAI,OAAO,WAAW,QAAW;AAC7B,gBAAM,WAAW,OAAO,MAAM,MAAM,KAAK;AAAA,QAC7C;AAAA,MACJ;AACA,gBAAU,QAAQ,QAAQ,YAAY,OAAO;AACzC,cAAM,WAAW,KAAK;AAAA,MAC1B;AACA,gBAAU,iBAAiB,QAAQ,YAAY,OAAO;AAClD,cAAM,WAAW,KAAK;AACtB,cAAM,WAAW,eAAe,GAAG,IAAI,OAAO,OAAO,OAAO,CAAC,GAAG;AAChE,cAAM,GAAG,QAAQ,SAAS,KAAK;AAAA,MACnC;AACA,gBAAU,MAAM,QAAQ,YAAY,OAAO;AAEvC,cAAM,GAAG,mBAAmB,OAAO,IAAI,CAAC,IAAI,KAAK;AAAA,MACrD;AACA,gBAAU,OAAO,QAAQ,YAAY,OAAO;AACxC,cAAM,iBAAiB,KAAK;AAC5B,YAAI,OAAO,UAAU;AACjB,iBAAO,MAAM,GAAG,KAAK;AACzB,cAAM,IAAI,KAAK,eAAe,OAAO,QAAQ;AAC7C,iBAAS,IAAI,GAAG,IAAI,OAAO,MAAM,QAAQ,KAAK;AAC1C,gBAAM,aAAa,iBAAiB,OAAO,MAAM,CAAC,GAAG,YAAY,GAAG,KAAK,IAAI,CAAC,GAAG;AACjF,gBAAM,GAAG,UAAU;AAAA,QACvB;AAAA,MACJ;AACA,gBAAU,WAAW,QAAQ,YAAY,OAAO;AAC5C,cAAM,GAAG,KAAK;AAAA,MAClB;AACA,gBAAU,OAAO,QAAQ,YAAY,OAAO;AACxC,cAAM,cAAc,OAAO,MAAM,IAAI,CAACF,YAAW,iBAAiBA,SAAQ,YAAY,KAAK,CAAC;AAC5F,cAAM,IAAI,YAAY,KAAK,MAAM,CAAC;AAAA,MACtC;AACA,gBAAU,YAAY,QAAQ,YAAY,OAAO;AAC7C,cAAM,GAAG,KAAK;AACd,aAAK,GAAG,QAAQ,UAAU,OAAO,aAAa;AAC1C,gBAAM,IAAI,KAAK,cAAc,OAAO,aAAa;AACrD,aAAK,GAAG,QAAQ,UAAU,OAAO,aAAa;AAC1C,gBAAM,IAAI,KAAK,cAAc,OAAO,aAAa;AAAA,MACzD;AACA,gBAAU,SAAS,QAAQ,YAAY,OAAO;AAC1C,cAAM;AAAA,MACV;AACA,gBAAU,MAAM,QAAQ,YAAY,OAAO;AACvC,cAAM,OAAO,WAAW,KAAK;AAAA,MACjC;AACA,gBAAU,MAAM,QAAQ,YAAY,OAAO;AACvC,cAAM,WAAW,MAAM,UAAU;AACjC,cAAM,UAAU,IAAI,UAAU,MAAM;AACpC,cAAM,SAAS,OAAO,MAAM,IAAI,CAAC,MAAM,QAAQ,KAAK,KAAK;AAAA,MAC7D;AACA,gBAAU,MAAM,QAAQ,YAAY,OAAO,cAAc,MAAM;AAC3D,cAAM,eAAe,GAAG,QAAQ,UAAU,OAAO,GAAG,IAAI,CAAC,GAAG,YAAY,MAAM,IAAI;AAClF,cAAM,UAAU;AAIhB,YAAI,gBAAgB,GAAG,QAAQ,UAAU,OAAO,GAAG,GAAG;AAClD,gBAAM,eAAe,mBAAmB,OAAO,GAAG;AAClD,cAAI,MAAM,UAAU,IAAI,YAAY,GAAG;AACnC,mBAAO,MAAM,GAAG,YAAY,IAAI,KAAK;AAAA,UACzC,OACK;AACD,kBAAM,eAAe,eAAe,cAAc,QAAQ,YAAY,SAAS,KAAK;AACpF,kBAAM,UAAU,IAAI,cAAc,YAAY;AAC9C,mBAAO,MAAM,GAAG,YAAY,IAAI,KAAK;AAAA,UACzC;AAAA,QACJ;AACA,gBAAQ,QAAQ,MAAM,IAAI,GAAG;AAAA,UACzB,KAAK;AACD,mBAAO,OAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAClD,KAAK;AACD,mBAAO,OAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UACpD,KAAK;AACD,mBAAO,OAAO,eAAe,SAAS,aAAa,KAAK;AAAA,UAC5D,KAAK;AACD,mBAAO,OAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UACrD,KAAK;AACD,mBAAO,OAAO,SAAS,SAAS,aAAa,KAAK;AAAA,UACtD,KAAK;AACD,mBAAO,OAAO,aAAa,SAAS,aAAa,KAAK;AAAA,UAC1D,KAAK;AACD,mBAAO,OAAO,MAAM,SAAS,aAAa,KAAK;AAAA,UACnD,KAAK;AACD,mBAAO,OAAO,UAAU,SAAS,aAAa,KAAK;AAAA,UACvD,KAAK;AACD,mBAAO,OAAO,SAAS,SAAS,aAAa,KAAK;AAAA,UACtD,KAAK;AACD,mBAAO,OAAO,WAAW,SAAS,aAAa,KAAK;AAAA,UACxD,KAAK;AACD,mBAAO,OAAO,UAAU,SAAS,aAAa,KAAK;AAAA,UACvD,KAAK;AACD,mBAAO,OAAO,SAAS,SAAS,aAAa,KAAK;AAAA,UACtD,KAAK;AACD,mBAAO,OAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UACpD,KAAK;AACD,mBAAO,OAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAClD,KAAK;AACD,mBAAO,OAAO,MAAM,SAAS,aAAa,KAAK;AAAA,UACnD,KAAK;AACD,mBAAO,OAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UACrD,KAAK;AACD,mBAAO,OAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UACrD,KAAK;AACD,mBAAO,OAAO,SAAS,SAAS,aAAa,KAAK;AAAA,UACtD,KAAK;AACD,mBAAO,OAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UACrD,KAAK;AACD,mBAAO,OAAO,KAAK,SAAS,aAAa,KAAK;AAAA,UAClD,KAAK;AACD,mBAAO,OAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UACrD,KAAK;AACD,mBAAO,OAAO,QAAQ,SAAS,aAAa,KAAK;AAAA,UACrD,KAAK;AACD,mBAAO,OAAO,iBAAiB,SAAS,aAAa,KAAK;AAAA,UAC9D,KAAK;AACD,mBAAO,OAAO,MAAM,SAAS,aAAa,KAAK;AAAA,UACnD,KAAK;AACD,mBAAO,OAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UACpD,KAAK;AACD,mBAAO,OAAO,WAAW,SAAS,aAAa,KAAK;AAAA,UACxD,KAAK;AACD,mBAAO,OAAO,OAAO,SAAS,aAAa,KAAK;AAAA,UACpD,KAAK;AACD,mBAAO,OAAO,YAAY,SAAS,aAAa,KAAK;AAAA,UACzD,KAAK;AACD,mBAAO,OAAO,SAAS,SAAS,aAAa,KAAK;AAAA,UACtD,KAAK;AACD,mBAAO,OAAO,MAAM,SAAS,aAAa,KAAK;AAAA,UACnD;AACI,gBAAI,CAAC,MAAM,aAAa,IAAI,QAAQ,MAAM,IAAI,CAAC;AAC3C,oBAAM,IAAI,6BAA6B,MAAM;AACjD,mBAAO,OAAO,MAAM,SAAS,aAAa,KAAK;AAAA,QACvD;AAAA,MACJ;AAKA,YAAM,QAAQ;AAAA,QACV,UAAU;AAAA,QACV,WAAW,oBAAI,IAAI;AAAA,QACnB,WAAW,oBAAI,IAAI;AAAA,QACnB,WAAW,oBAAI,IAAI;AAAA;AAAA,MACvB;AAIA,eAAS,iBAAiB,QAAQ,YAAY,OAAO,cAAc,MAAM;AACrE,eAAO,IAAI,CAAC,GAAG,MAAM,QAAQ,YAAY,OAAO,WAAW,CAAC,EAAE,KAAK,MAAM,CAAC;AAAA,MAC9E;AACA,eAAS,mBAAmB,KAAK;AAC7B,eAAO,SAAS,WAAW,OAAO,GAAG,CAAC;AAAA,MAC1C;AACA,eAAS,eAAe,YAAY;AAChC,cAAM,eAAe,SAAS,MAAM,UAAU,IAAI;AAClD,cAAM,UAAU,IAAI,cAAc,SAAS,YAAY,MAAM,UAAU,EAAE;AACzE,eAAO;AAAA,MACX;AACA,eAAS,eAAeG,OAAM,QAAQ,YAAY,OAAO,cAAc,MAAM;AACzE,cAAM,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAACC,YAAW,GAAG,SAASA,SAAQ,GAAG,CAAC;AAClE,cAAM,YAAY,gBAAgB,SAAS,KAAK;AAChD,cAAM,UAAU,cAAc,SAAS;AACvC,cAAM,aAAa,CAAC,GAAG,MAAM,QAAQ,YAAY,OAAO,WAAW,CAAC,EAAE,IAAI,CAACC,gBAAe,GAAG,IAAI,CAAC,CAAC,GAAGA,WAAU,EAAE,EAAE,KAAK,MAAM,OAAO,EAAE;AACxI,eAAO,YAAYF,KAAI,IAAI,SAAS,IAAI,OAAO,KAAK,OAAO,GAAG,IAAI,CAAC,CAAC,WAAW,OAAO,GAAG,UAAU,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC;AAAA;AAAA,MAC1H;AACA,eAAS,gBAAgBA,OAAM,MAAM;AACjC,cAAM,aAAa,MAAM,aAAa,eAAe,KAAK,IAAI,KAAK;AACnE,eAAO,GAAGA,KAAI,GAAG,UAAU;AAAA,MAC/B;AACA,eAAS,cAAc,MAAM;AACzB,eAAO,MAAM,aAAa,eAAe,KAAK,IAAI,KAAK;AAAA,MAC3D;AAIA,eAAS,MAAM,QAAQ,YAAY,SAAS;AACxC,cAAM,eAAe,eAAe,SAAS,QAAQ,YAAY,OAAO;AACxE,cAAM,YAAY,gBAAgB,SAAS,KAAK;AAChD,cAAM,UAAU,cAAc,SAAS;AACvC,cAAM,YAAY,CAAC,GAAG,MAAM,UAAU,OAAO,CAAC;AAC9C,cAAM,YAAY,CAAC,GAAG,MAAM,UAAU,OAAO,CAAC;AAE9C,cAAM,iBAAiB,GAAG,QAAQ,UAAU,OAAO,GAAG,IAChD,yBAAyB,SAAS,IAAI,OAAO;AAAA,WAAgB,mBAAmB,OAAO,GAAG,CAAC;AAAA,KAC3F,UAAU,YAAY;AAC5B,eAAO,CAAC,GAAG,WAAW,GAAG,WAAW,aAAa,EAAE,KAAK,IAAI;AAAA,MAChE;AAEA,eAAS,QAAQ,MAAM;AACnB,cAAM,WAAW,EAAE,UAAU,aAAa;AAE1C,cAAM,CAAC,QAAQ,YAAY,OAAO,IAAK,KAAK,WAAW,MAAM,GAAG,QAAQ,SAAS,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,QAAQ,IACnH,KAAK,WAAW,KAAK,EAAE,GAAG,QAAQ,SAAS,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IACvE,KAAK,WAAW,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,IAC1C,KAAK,WAAW,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,QAAQ,IACtC,CAAC,MAAM,CAAC,GAAG,QAAQ;AAEnC,cAAM,WAAW,QAAQ;AACzB,cAAM,UAAU,MAAM;AACtB,cAAM,UAAU,MAAM;AACtB,cAAM,UAAU,MAAM;AACtB,YAAI,CAAC,MAAM,UAAU,QAAQ,MAAM;AAC/B,gBAAM,IAAI,2BAA2B,MAAM;AAC/C,mBAAWH,WAAU;AACjB,cAAI,CAAC,MAAM,UAAU,QAAQA,OAAM;AAC/B,kBAAM,IAAI,2BAA2BA,OAAM;AACnD,eAAO,MAAM,QAAQ,YAAY,OAAO;AAAA,MAC5C;AACA,MAAAD,cAAa,OAAO;AAEpB,eAAS,QAAQ,QAAQ,aAAa,CAAC,GAAG;AACtC,cAAM,gBAAgB,KAAK,QAAQ,YAAY,EAAE,UAAU,aAAa,CAAC;AACzE,cAAM,mBAAmB,WAAW,SAAS,QAAQ,UAAU,QAAQ,aAAa;AACpF,cAAM,YAAY,IAAI,IAAI,MAAM,SAAS;AACzC,iBAAS,qBAAqB,MAAM,UAAU,OAAO;AACjD,cAAI,CAAC,MAAM,aAAa,IAAI,IAAI,KAAK,CAAC,UAAU,IAAI,QAAQ;AACxD,mBAAO;AACX,gBAAM,YAAY,MAAM,aAAa,IAAI,IAAI;AAC7C,gBAAMC,UAAS,UAAU,IAAI,QAAQ;AACrC,iBAAO,UAAUA,SAAQ,KAAK;AAAA,QAClC;AACA,iBAAS,uBAAuBM,SAAQ,OAAO;AAC3C,cAAI,CAAC,MAAM,eAAe,IAAIA,OAAM;AAChC,mBAAO;AACX,gBAAM,YAAY,MAAM,eAAe,IAAIA,OAAM;AACjD,iBAAO,UAAU,KAAK;AAAA,QAC1B;AACA,iBAAS,aAAa,OAAO;AACzB,kBAAQ,GAAG,OAAO,MAAM,KAAK;AAAA,QACjC;AACA,cAAM,gBAAgB,iBAAiB,sBAAsB,wBAAwB,YAAY;AACjG,eAAO,IAAI,UAAU,QAAQ,YAAY,eAAe,aAAa;AAAA,MACzE;AACA,MAAAP,cAAa,UAAU;AAAA,IAC3B,GAAGA,kBAAiBR,SAAQ,eAAeQ,gBAAe,CAAC,EAAE;AAAA;AAAA;;;ACroB7D,IAAAQ,oBAAA;AAAA,2GAAAC,UAAA;AAAA;AA4BA,QAAI,kBAAmBA,YAAQA,SAAK,oBAAqB,OAAO,SAAU,SAAS,GAAGC,IAAG,GAAG,IAAI;AAC5F,UAAI,OAAO;AAAW,aAAK;AAC3B,UAAI,OAAO,OAAO,yBAAyBA,IAAG,CAAC;AAC/C,UAAI,CAAC,SAAS,SAAS,OAAO,CAACA,GAAE,aAAa,KAAK,YAAY,KAAK,eAAe;AACjF,eAAO,EAAE,YAAY,MAAM,KAAK,WAAW;AAAE,iBAAOA,GAAE,CAAC;AAAA,QAAG,EAAE;AAAA,MAC9D;AACA,aAAO,eAAe,GAAG,IAAI,IAAI;AAAA,IACrC,IAAM,SAAS,GAAGA,IAAG,GAAG,IAAI;AACxB,UAAI,OAAO;AAAW,aAAK;AAC3B,QAAE,EAAE,IAAIA,GAAE,CAAC;AAAA,IACf;AACA,QAAI,eAAgBD,YAAQA,SAAK,gBAAiB,SAASC,IAAGD,UAAS;AACnE,eAAS,KAAKC;AAAG,YAAI,MAAM,aAAa,CAAC,OAAO,UAAU,eAAe,KAAKD,UAAS,CAAC;AAAG,0BAAgBA,UAASC,IAAG,CAAC;AAAA,IAC5H;AACA,WAAO,eAAeD,UAAS,cAAc,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAAA,SAAQ,qBAAqBA,SAAQ,iBAAiB;AACtD,QAAI,UAAU;AACd,WAAO,eAAeA,UAAS,kBAAkB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,QAAQ;AAAA,IAAgB,EAAE,CAAC;AAC1H,WAAO,eAAeA,UAAS,sBAAsB,EAAE,YAAY,MAAM,KAAK,WAAY;AAAE,aAAO,QAAQ;AAAA,IAAoB,EAAE,CAAC;AAClI,iBAAa,oBAAuBA,QAAO;AAAA;AAAA;;;AC/C3C,6BAAkC;AAC3BE,wCAAe;AASlBC,IAA6B,IAC7BC;AADAD,IAGE,IAAA;AAAS,uBAAAE,WAAK,SAAA,KAAA,uBAAwD,IAAA,SAAA,KAAuB,uBAC/E,SAAA,SAAA,KAAiD,uBAAc,IAAA,SAAuB,KAAA,uBAIxG;AACA,IAAOF,IACP,EAAA,QAAA,QACA,MAAA,GAAA,OAAA,GAAqB,kBACrB,MAAA,qBACA,MAAA,sBAIA,CAAA,GAAA,0BAmCK,MACL,yBAEA,OAAA,KACA,KAAA;AA/CA,IA+CQ,IACR,CAAA;AAhDA,IAgDA,IAAA,MAAmDG;EAAeC,aACzD;EAAA,YAAe;EAAA,OAAY;EAAA,QAAW;EAAAD,YAG/C,GAAA,GAAA,GAAW,GACT;AAAME,WAAsB,OAAA,MAAa,EAAA,YACR,GAAwB,WAErD,GAAK,MAAA,GAAA,OACH,EAAG,CAAA;EAAA;EAAK,WAAU;AAAA,QAAQ,IAAE,KAAG,aAC/B,MAAO,IAAA,EAAK,QAAA,IAAY,IAAO,IAAA,CAAA,GAAQ,IAAK,KAAA,YAAyB,MAAI,GAAA,KAAS,UACxF,QAAO,CAAI,CAAC,GAAA,SAAyB,GAAA,GAAM,IAAK,GAAA,IAAQC,KAAgB,YACzDC,MAAG,QACV,KAAI,YAIG,MACjB,IAAA,CAAA,CAAA,GAA2BC,SACzB,GAAO,GAAA,CAAA;AAAO,WAAQ,IAAO,CAAA,KAAAA,OAG7BC,IAESC,MAAN,KACL,QAAO,IAAQ,IACf,EAAA,OAAO,OACP,KAAO,IAAA,EAAO,KACd,GAAO,CAAA;EAAM;AACb;AA7EA,IA6EA,IAAO,MAAQ;EACf,YAAO,GAAU,GAEjB;AAAA,WAAO,OAAW,MAClB,EAAO,OAAA,GAoBP,QAAO,EAAA,CAAA;EAAMC;AAA4BC;AArGzC,IAqGgD,IAAMC;AArGtD,IAqGwE,IAC7D,MAAA,EAAO;EAuImB,OAC3BC,QAAe;EAAM,OAAA,OAAe;EAC1C,OACMC,OAGF;EACED,OACG,MAKA;EAAA,OAAQ,QAAa;EAG5BC,OAIR,UAME;EAAO,OAAA,WAAqB;EAAA,OAAO,UAAA;EAAA,OAGnC,MAAO,IAAA,EAAA,MAAA,IAAA,CAAA,GAAmB;AAAA,QAGtB,OAASC,OACHC,CAAAA,GAAqC,GAAA,CAAA,GAAA,IACvC,MAAWC,QACT,MAAc,gBACJ,EAAA,QAAsB,EAAA,CAAA;AAAOF,QAG3C,IAAA,KAAO,QAET,QAAe,OAUf,EAAA,GAASA,GAAa,KAChB,EAAEA,iBACJ,CAAA,GAAA,IAAO,IACJP,MACiB;AACtB,aAAUC,SAAeM,OAAUA,QAAS,0BAGjC,EAAA,GAAA,CAAA;IAAA;AAAA,MAAA,aAAA,MAAkC,EAC3CG,YAEF;AAEF,QAAA,IAAS,KACX,QAGE,QACQH,gBAEDP,CACHA,GAAoB,IACd,CAAA,GAAA,MAAU;AAAA,eAAO,KAAA,GAAA;AAAA,YAAA,IAAA,EAAA,EAAA,SAAgEO,CAAI;AAAA,eAHpF,MAKX,IAAA,EAAS,KAAM,EAEnB,GAOK,EAAA,MAAA,GAASI,EACd,CAAA,IAAA,YACF;AAAA,cAAA;AAAA,gBAAA,IAAA,EAAA;AAAA,mBAAA,aAAA,UAAA,MAAA,IAAA;UAAA,UAAA;AAAA,oBAAA,SAAA;UAAA;QAAA,GAAA;MAAA;AAAA,UAAA,IAAA,OAAA,OAAA,EAAA,KAAA,CAAA,CAAA,GAAA,EAAA,WAAA,GAAA,YAAA,CAAA,GAAA,OAAA,GAAA,OAAA,EAAA,CAAA;AAAA,aAAA,IAAA,IAAA,OAAA,OAAA,EAAA,KAAA,CAAA,CAAA,GAAA,EAAA,WAAA,GAAA,YAAA,CAAA,GAAA,OAAA,GAAA,OAAA,EAAA,CAAA;IAAA,GAAA,IAAA,EAAA,KAAA,EAAA,OAAA,KAAA,QAAA,QAAA,OAAA,CAAA,CAAA;AAAA,WAAA,EAAA,OAAA,IAAA,OAAA,EAAA,GAAA,CAAA,GAAA,IAAA,UAAA,kCAAAC,SAAA,CAAA,CAAA,IAAA,MAAA,EAAA,KAAA,EAAA,MAAA,KAAA,QAAA,QAAA,MAAA,CAAA,CAAA,GAAA,KAAA,EAAA,KAAA,EAAA,MAAA,KAAA,QAAA,QAAA,KAAA,CAAA,CAAA,GAAA,OAAA,EAAA,KAAA,EAAA,OAAA,KAAA,QAAA,QAAA,KAAA,EAAA,GAAA,GAAA,KAAA,EAAA,iBAAA,CAAA,CAAA,GAAA,SAAA,EAAA,KAAA,EAAA,SAAA,KAAA,QAAA,QAAA,OAAA,EAAA,GAAA,GAAA,KAAA,EAAA,iBAAA,CAAA,CAAA,EAAA;EAAA;EAAA,OAAA,QAAA,GAAA,GAAA;AAAA,QAAA,uBAAAnB;AAAA,aAAA,EAAA,KAAA,OAAA;AAAA;AAAA,UAAA,IAAA,CAAA;AAAA,UAAA,EAAA,QAAA,EAAA,OAAA;AAAA,YAAA,IAAA,uBAAAoB,aAAA,UAAA,UAAA,SAAA,QAAA,IAAA,CAAA,IAAA,EAAA,QAAA,CAAA,CAAA,EAAA,MAAA,CAAA,CAAA,EAAA,KAAA,CAAA,IAAA,CAAA;AAAA,UAAA,KAAA,GAAA,CAAA;MAAA;AAAA,aAAA,EAAA,WAAA,IAAA,EAAA,KAAA,IAAA,EAAA,OAAA,EAAA,MAAA,CAAA,IAAA,EAAA,KAAA,EAAA,MAAA,IAAA,EAAA,KAAA,SAAA,GAAA,CAAA;IAAA;EAAA;EAAA,OAAA,QAAA,GAAA,GAAA,IAAA,GAAA;AAAA,QAAA,CAAA,YAAA;AAAA;AAAA,QAAA,IAAA,YAAA,IAAA;AAAA,MAAA,aAAA,EAAA,WAAA,GAAA,EAAA,UAAA;AAAA,QAAA,IAAA,IAAA,EAAA,IAAA,EAAA,UAAA,IAAA,EAAA,SAAA,GAAA,CAAA;AAAA,WAAA,EAAA,UAAA,GAAA,IAAA,EAAA,SAAA,IAAA;EAAA;EAAA,OAAA,mBAAA,GAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtVA,eAAsB;AAEf,IAAMC,aAAY,SAAAC,QAAU;AAGnC,IAAO,kBAAQ,SAAAC;;;AC8Bf,IAAM,aAAa;AACnB,IAAM,EAAE,MAAM,KAAK,OAAO,SAAS,MAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,IAAM,eAAe,WAAW,IAAI;AAG3C,UAAU;AAAA,EACT,gBAAgB;AAAA;AAAA;AAAA;AAAA;AAKjB,CAAC;AAED,IACC,CAAC,IAAI,MAAM;AAAA,EACV;AACD,EAAE,EAAE,eAAe,KAAK;AACvB,QAAM,IAAI,MAAM,wCAAwC;AAEnD,IAAM,kBAAkB,CAAC,EAAE,QAAQ,QAAQ,SAAS,KAAK,MAK1D;AACL,SAAO,UAAU,MAAM;AACtB,WAAO,QAAQ;AACf,UAAM,MAAM,GAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,QAAQ,OAAQ,OAAO,OAAO,QAAQ,EAAE,GAC5E,UAAU,SAAS,GACnB,OAAO,IAAI,OAAO,SAAS,WAAW,OAAO,gBAAU,IAAI,CAAC,MAAM,EAAE;AAC1E,WAAO;AAAA,EACR,CAAC;AACF;AACO,IAAM,qBAAqB,CAAC,SAAgD;AAClF,SAAO,EAAE,MAAM,gBAAgB,IAAI,EAAE;AACtC;AAEO,SAAS,2BAA8B,GAAsBC,IAAsB;AACzF,SAAO,UAAU,MAAM,SAAS,WAAW,EAAE,IAAI,GAAGA,GAAE,IAAI,CAAC,CAAC;AAC7D;AACO,SAAS,qBAAqB,GAAWA,IAAW;AAC1D,SAAO,SAAS,QAAQ,EAAE,SAASA,GAAE,OAAO;AAC7C;AACO,SAAS,mBAAmB,GAAgBA,IAAgB;AAClE,MAAI,EAAE,SAASA,GAAE;AAAM,WAAO;AAC9B,WAAS,IAAI,GAAG,IAAI,EAAE,MAAM,KAAK;AAChC,UAAM,QAAQ,EAAE,MAAM,CAAC;AACvB,UAAM,QAAQA,GAAE,MAAM,CAAC;AACvB,QAAI,QAAQ;AAAW,cAAQ,sBAAsB,GAAG,OAAO,KAAK;AACpE,QAAI,CAAC,SAAS,WAAW,MAAM,WAAW,MAAM,SAAS,GAAG;AAC3D,UAAI,QAAQ;AAAW,gBAAQ,sCAAsC,GAAG,OAAO,KAAK;AACpF,aAAO;AAAA,IACR;AAEA,QAAI,CAAC,qBAAqB,MAAM,gBAAgB,MAAM,cAAc,GAAG;AACtE,UAAI,QAAQ;AAAW,gBAAQ,gDAAgD,GAAG,OAAO,KAAK;AAC9F,aAAO;AAAA,IACR;AAAA,EACD;AACA,MAAI,QAAQ;AAAW,YAAQ,+BAA+B,EAAE,GAAG,GAAAA,GAAE,CAAC;AACtE,SAAO;AACR;AAEA,IAAI,uBAAuB;AACpB,SAAS,mBAAsB,IAAwB,EAAE,MAAAC,OAAM,QAAAC,QAAO,IAGzE,CAAC,GAAG;AACP,QAAM,YAAY,sBAAsB,EAAE,oBAAoB,IAAID,KAAI;AACtE,MAAI,QAAQ;AAAW,YAAQ,IAAI,SAAS,YAAY,EAAE,QAAQ,GAAG,MAAM,IAAI,MAAAA,OAAM,QAAAC,QAAO,CAAC;AAE7F,MAAI;AAEJ,QAAM,iBAAiB;AAAA,IACtB;AAAA,IACA,CAAC,UAAU;AACV,UAAI,CAAC,eAAe;AACnB,wBAAgB,WAAW;AAAA,UAAM;AAAA;AAAA,UAA8B,EAAE,MAAM,OAAO,MAAAD,OAAM,QAAAC,QAAO;AAAA,QAAC;AAAA,MAC7F,OAAO;AACN,YAAI,CAAC,UAAU,OAAOA,WAAU,SAAS,YAAY,eAAe,KAAK,CAAC,GAAG;AAC5E,wBAAc,QAAQ,KAAK;AAC3B,cAAI,MAAM;AAAW,kBAAM,IAAI,SAAS,aAAa,EAAE,cAAc,OAAO,cAAc,CAAC;AAAA,QAC5F,OAAO;AACN,cAAI,MAAM;AAAW,kBAAM,IAAI,SAAS,oBAAoB,EAAE,cAAc,OAAO,cAAc,CAAC;AAAA,QACnG;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,UAAU;AAAA,EACnB;AAEA,MAAI,UAAU,SAAS,UAAU,GAAG;AACnC,QAAI,YAAY,QAAQ,aAAa;AACrC,UAAM,IAAI,SAAS,UAAU,EAAE,gBAAgB,WAAW,eAAe,WAAW,gBAAgB,aAAa,EAAE,CAAC;AACpH,gBAAY,MAAM,aAAa,IAAI,SAAS,CAAC;AAAA,EAC9C;AACA,MAAI,QAAQ,WAAW;AACtB,qBAAiB,eAAe,MAAM;AACrC,cAAQ,IAAI,SAAS,cAAc,gBAAgB,aAAa,GAAG,EAAE,WAAW,cAAc,CAAC;AAAA,IAChG,CAAC;AAAA,EACF;AAEiC,qBAAmB,eAAe,MAAM;AACxE,QAAI,QAAQ;AAAW,cAAQ,IAAI,SAAS,WAAW;AAEvD,QAAI;AAAW,kBAAY,MAAM,aAAa,OAAO,SAAS,CAAC;AAC/D,mBAAe;AAAA,EAChB,CAAC;AACD,SAAO;AACR;AAEA,IAAI,qBAAqB;AAElB,SAAS,iBAAoB,IAAwB,EAAE,MAAAD,MAAK,IAG/D,CAAC,GAAG;AACP,QAAM,YAAY,oBAAoB,EAAE,kBAAkB,IAAIA,KAAI;AAClE,MAAI,QAAQ;AAAW,YAAQ,IAAI,SAAS,YAAY,EAAE,QAAQ,GAAG,MAAM,IAAI,MAAAA,MAAK,CAAC;AAErF,MAAI;AAEJ,QAAM,iBAAiB;AAAA,IACtB;AAAA,IACA,CAAC,UAAU;AACV,UAAI,CAAC,eAAe;AACnB,wBAAgB,WAAW;AAAA,UAAI;AAAA;AAAA,UAA8B,EAAE,MAAM,OAAO,MAAAA,MAAK;AAAA,QAAC;AAAA,MACnF,OAAO;AACN,cAAM,EAAE,SAAS,MAAM,IAAI,UAAU,MAAM;AAC1C,gBAAM,SAAS,IAAI,IAAI,cAAc,OAAO,CAAC;AAC7C,gBAAME,SAAQ,oBAAI,IAAO;AACzB,qBAAW,QAAQ,OAAO;AAEzB,gBAAI,cAAc,IAAI,IAAI,GAAG;AAC5B,kBAAI,QAAQ;AAAW,wBAAQ,IAAI,SAAS,eAAe,MAAM,EAAE,cAAc,OAAO,cAAc,CAAC;AACvG,qBAAO,OAAO,IAAI;AAAA,YACnB,OAAO;AACN,cAAAA,OAAM,IAAI,IAAI;AAAA,YACf;AAAA,UACD;AACA,cAAI,MAAM;AAAW,kBAAM,IAAI,SAAS,cAAc,EAAE,QAAQ,OAAAA,QAAO,cAAc,OAAO,cAAc,CAAC;AAC3G,iBAAO;AAAA,YACN,OAAAA;AAAA,YACA,SAAS;AAAA,UACV;AAAA,QACD,CAAC;AACD,mBAAW,OAAO;AAAS,wBAAc,OAAO,GAAG;AACnD,mBAAW,OAAO;AAAO,wBAAc,IAAI,GAAG;AAAA,MAC/C;AAAA,IACD;AAAA,IACA,EAAE,MAAM,UAAU;AAAA,EACnB;AAEA,MAAI,UAAU,SAAS,UAAU,GAAG;AACnC,QAAI,YAAY,QAAQ,aAAa;AACrC,QAAI,MAAM,WAAW;AACpB,YAAM,IAAI,SAAS,UAAU,EAAE,gBAAgB,WAAW,eAAe,WAAW,gBAAgB,aAAa,EAAE,CAAC;AAAA,IACrH;AACA,gBAAY,MAAM,aAAa,IAAI,SAAS,CAAC;AAAA,EAC9C;AACA,MAAI,QAAQ,WAAW;AACtB,qBAAiB,eAAe,MAAM;AACrC,cAAQ,IAAI,SAAS,cAAc,gBAAgB,aAAa,GAAG,EAAE,WAAW,cAAc,CAAC;AAAA,IAChG,CAAC;AAAA,EACF;AAEiC,qBAAmB,eAAe,MAAM;AACxE,QAAI,QAAQ;AAAW,cAAQ,IAAI,SAAS,WAAW;AAEvD,QAAI;AAAW,kBAAY,MAAM,aAAa,OAAO,SAAS,CAAC;AAC/D,mBAAe;AAAA,EAChB,CAAC;AACD,SAAO;AACR;AAmDA,IAAI,qBAAqB;AAClB,SAAS,iBAAuB,IAAkC,EAAE,MAAAF,OAAM,QAAAC,QAAO,IAGpF,CAAC,GAAG;AACP,QAAM,YAAY,oBAAoB,EAAE,kBAAkB,IAAID,KAAI;AAClE,MAAI,MAAM;AAAW,UAAM,IAAI,SAAS,YAAY,EAAE,QAAQ,GAAG,MAAM,IAAI,MAAAA,OAAM,QAAAC,QAAO,CAAC;AAEzF,MAAI;AAEJ,QAAM,UAAU;AAAA,IACf;AAAA,IACA,CAAC,UAAU;AACV,UAAI,CAAC,eAAe;AACnB,wBAAgB,WAAW;AAAA,UAAI;AAAA;AAAA,UAA8B,EAAE,MAAM,OAAO,MAAAD,MAAK;AAAA,QAAC;AAClF,YAAI,MAAM;AAAW,gBAAM,IAAI,SAAS,aAAa,EAAE,OAAO,cAAc,CAAC;AAAA,MAC9E,OAAO;AACN,YAAI,CAAC,UAAU,OAAOC,WAAU,SAAS,YAAY,CAAC,GAAG,cAAc,QAAQ,CAAC,GAAG,KAAK,CAAC,GAAG;AAE3F,wBAAc,QAAQ,KAAK;AAC3B,cAAI,MAAM;AAAW,kBAAM,IAAI,SAAS,aAAa,EAAE,OAAO,cAAc,CAAC;AAAA,QAC9E,WAAW,MAAM;AAAW,gBAAM,IAAI,SAAS,oBAAoB,EAAE,OAAO,cAAc,CAAC;AAAA,MAC5F;AAAA,IACD;AAAA,IACA,EAAE,MAAM,UAAU;AAAA,EACnB;AACA,MAAI,QAAQ;AAAW,YAAQ,MAAM,QAAQ,IAAI,SAAS,mBAAmB,KAAK,aAAa,CAAC,CAAC;AAEjG,QAAM,uBAAuB,mBAAmB,eAAe,MAAM;AACpE,QAAI,QAAQ;AAAW,cAAQ,IAAI,SAAS,WAAW;AACvD,yBAAqB;AAErB,eAAW,MAAM,QAAQ,CAAC;AAAA,EAC3B,CAAC;AACD,SAAO;AACR;AAEO,SAAS,0BACf,IAEA,SAAqB,MACrB,EAAE,MAAAD,MAAK,IAAuB,CAAC,GAC9B;AACD,MAAI,MAAM;AAAW,UAAM,sCAAsC,EAAE,QAAQ,GAAG,MAAM,IAAI,MAAAA,MAAK,CAAC;AAC9F,QAAM,YAAY,GAAGA,KAAI;AAEzB,MAAI;AACJ,QAAMG,YAAW,IAAI,SAAS,WAAW,SAAS,sBAAsB,MAAM;AAC7E,QAAI,MAAM;AAAW,YAAM,IAAI,SAAS,yBAAyB,IAAI;AACrE,gBAAY;AAAA,EAIb,CAAC;AACD,WAAS,cAAc;AACtB,IAAAA,UAAS,MAAM,SAAS,wBAAwB;AAC/C,UAAI,QAAQ,cAAc,YAAY,IAAI;AAC1C,UAAI,MAAM;AAAW,cAAM,IAAI,SAAS,kBAAkB,EAAE,MAAMH,SAAQ,GAAG,MAAM,GAAG,CAAC;AACvF,eAAS,GAAG;AACZ,UAAI,MAAM;AAAW,cAAM,IAAI,SAAS,oBAAoB,MAAM;AAElE,kBAAY,MAAM;AACjB,iBAAS,MAAM;AAAA,MAChB,CAAC;AACD,UAAI,cAAc,YAAY,IAAI,IAAI,QAAQ,YAAY;AACzD,aAAK,IAAI,SAAS,UAAU,YAAY,IAAI,IAAI,KAAK,IAAI;AAAA,MAC1D;AAAA,IACD,CAAC;AAAA,EACF;AAEA,cAAY;AACZ,MAAI,MAAM;AAAW,UAAM,IAAI,SAAS,sBAAsB,EAAE,UAAAG,WAAU,QAAQ,MAAM,kBAAkBA,SAAQ,EAAE,CAAC;AA4BrH,QAAM,UAAU,MAAM;AACrB,QAAI,QAAQ;AAAW,cAAQ,IAAI,SAAS,WAAW;AAEvD,eAAW,MAAMA,UAAS,QAAQ,CAAC;AAAA,EACpC;AACA,SAAO;AACR;AA0CO,SAAS,sBACfH,OACA,IACA,qBAAiH,OAC7G;AACJ,MAAI,SAAS,EAAE;AAAG,UAAM,IAAI,MAAM,oDAAoD;AAEtF,MAAI,aAAa;AACjB,MAAI,IAAI;AACR,QAAM,OAAO,OAAO,uBAAuB,YACxC,EAAE,WAAW,mBAAmB,IAChC;AACH,QAAM,MAAM,oBAAI,IAAwC;AAExD,SAAO,YAAuB,MAAoC;AACjE,QAAI;AACJ,UAAM,gBAAgB,UAAU,MAAM,IAAI;AAC1C,UAAM,YAAY,yBAAyBA,SAAQ,GAAG,IAAI,IAAI,EAAE,CAAC,IAAI,KAAK,gBAAgB,IAAI,KAAK,cAAc,GAAG,IAAI,CAAC,MAAM,EAAE;AAEjI,aAAS,CAAC,cAAcI,YAAW,KAAK,IAAI,QAAQ,GAAG;AACtD,UAAI,SAAS,WAAW,cAAc,aAAa,GAAG;AACrD,mBAAWA;AACX;AAAA,MACD;AAAA,IACD;AAEA,QAAI,UAAU;AACb,YAAM,eAAe,SAAS,IAAI;AAClC,UAAI,QAAQ;AAAW,gBAAQ,IAAI,SAAS,eAAe,EAAE,eAAe,aAAa,CAAC;AAC1F,aAAO;AAAA,IACR;AAGA,QAAI,CAAC,KAAK,aAAa,CAAC,sBAAuB,GAAG;AACjD,UAAI,CAAC,cAAc,eAAgB,EAAE,0BAA0B;AAC9D,gBAAQ;AAAA,UACP;AAAA,QACD;AACA,qBAAa;AAAA,MACd;AACA,aAAO,GAAG,MAAM,MAAM,IAAI;AAAA,IAC3B;AAGA,QAAI,QAAQ;AAAW,cAAQ,IAAI,SAAS,qBAAqB,EAAE,cAAc,CAAC;AAClF,QAAI;AACJ,UAAM,cAAc;AAAA,MACnB,MAAM;AACL,YAAI,QAAQ;AAAW,kBAAQ,IAAI,SAAS,mBAAmB,UAAU,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE;AAC9F,YAAI,QAAQ;AAAW,gBAAM;AAC7B,eAAQ,cAAc,GAAG,MAAM,MAAM,IAAI;AAAA,MAC1C;AAAA,MACA;AAAA,QACC,GAAG;AAAA,QACH,MAAM;AAAA,MACP;AAAA,IACD;AACA,QAAI,QAAQ;AAAW,cAAQ,IAAI,SAAS,UAAU,kBAAkB,WAAW,GAAG,EAAE,cAAc,CAAC;AACvG,QAAI,IAAI,eAAe,WAAW;AAGlC,QAAI,CAAC,KAAK,WAAW;AACpB,YAAM,uBAAuB,mBAAmB,aAAa,MAAM;AAClE,YAAI,QAAQ;AAAW,kBAAQ,IAAI,SAAS,aAAa,WAAW;AACpE,6BAAqB;AACrB,YAAI,OAAO,aAAa;AACxB,YAAI,KAAK;AAAW,eAAK,UAAU,aAAa,GAAG,IAAI;AACvD,sBAAc;AAAA,MACf,CAAC;AAAA,IACF;AAEA,WAAO,YAAY,IAAI;AAAA,EACxB;AACD;AAEO,SAAS,mBAAmB,OAAuB;AACzD,MAAI,QAAQ;AACZ,MAAI,SAAS;AACb,MAAI,oBAAoB;AAExB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACtC,UAAM,OAAO,MAAM,CAAC;AAEpB,QAAI,SAAS,KAAK;AACjB,gBAAU,OAAO,OAAO,IAAK,OAAO,EAAE,KAAK;AAAA,IAC5C,WAAW,SAAS,KAAK;AACxB,gBAAU,OAAO,IAAK,OAAO,EAAE,KAAK,IAAI;AAAA,IACzC,WAAW,SAAS,OAAO,sBAAsB,GAAG;AACnD,gBAAU,OAAO,OAAO,IAAK,OAAO,KAAK;AAAA,IAC1C,WAAW,SAAS,OAAO,sBAAsB,GAAG;AACnD;AACA,gBAAU,OAAO,OAAO,IAAK,OAAO,QAAQ,CAAC;AAAA,IAC9C,WAAW,SAAS,OAAO,sBAAsB,GAAG;AACnD;AACA,gBAAU,OAAO,IAAK,OAAO,KAAK,IAAI;AAAA,IACvC,WAAW,SAAS,OAAO,oBAAoB,GAAG;AACjD;AACA,gBAAU;AAAA,IACX,WAAW,SAAS,OAAO,oBAAoB,GAAG;AACjD;AACA,gBAAU;AAAA,IACX,OAAO;AACN,gBAAU;AAAA,IACX;AAAA,EACD;AAEA,SAAO;AACR;AACO,SAAS,sBAA6D,QAA6B;AACzG,SAAO,IAAI,MAAM,CAAC,GAAG;AAAA,IACpB,KAAK,SAAS,SAAS,MAAM;AAC5B,aAAO,OAAO,IAAI,IAAW;AAAA,IAC9B;AAAA,EACD,CAAC;AACF;;;AC5fA,IAAM,EAAE,MAAAC,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,MAAM,EAAE,QAAQ,WAAW,CAAC;AAGtF,SAAS,YAAY,OAA0D;AACrF,SAAQ,MAAc,SAAS;AAChC;AAIO,IAAe,SAAf,MAAsB;AAAA,EAK5B,YACUC,OACT,SACA,SACU,WAAqB,CAAC,GAChC,OAAqC,CAAC,GACrC;AALQ,gBAAAA;AAGC;AAGV,SAAK,UAAU,YAAY,OAAO,OAAO,cAAc,OAAO;AAC9D,SAAK,UAAU;AACf,QAAI,UAAU,MAAM,KAAK,SAAS,WAAW,CAAC,GAAG;AAChD,MAAAL,MAAK,gCAAgCK,KAAI;AAAA,IAC1C;AACA,QAAI,CAAC,KAAK,gBAAgB;AACzB,qBAAe,MAAM;AAAA;AAAA;AAAA,QAGpB,aAAa;AAAA,QACb,cAAc;AAAA,QACd,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,SAAS;AAAA,QACT,UAAU;AAAA,QACV,WAAW;AAAA,MACZ,GAAG,EAAE,MAAM,UAAUA,KAAI,IAAI,CAAC;AAAA,IAC/B;AAAA,EACD;AAAA,EA7BS;AAAA,EACA;AAAA,EACC,eAAiD,CAAC;AAAA,EA6B5D,IAAI,WAAW;AACd,QAAI,KAAK,QAAQ,WAAW;AAAG,aAAO;AACtC,WAAO,KAAK,QAAQ,CAAC,EAAE;AAAA,EACxB;AAAA,EAEO,OAAO,iBAAiD;AAC9D,QAAI,KAAK;AAAU,YAAMD,OAAM,iDAAiD,KAAK,oBAAoB;AACzG,QAAI,CAAC,KAAK;AAAS,YAAMA,OAAM,oEAAoE,KAAK,oBAAoB;AAC5H,QAAI,KAAK,SAAS,WAAW;AAAG,YAAMA,OAAM,6DAA6D,KAAK,oBAAoB;AAClI,WAAO,KAAK,QAAQ,CAAC,EAAE,OAAO,eAAe;AAAA,EAC9C;AAAA,EACO,UAAU,iBAAoC;AACpD,QAAI,KAAK;AAAU,YAAMA,OAAM,oDAAoD,KAAK,oBAAoB;AAC5G,QAAI,CAAC,KAAK;AAAS,YAAMA,OAAM,uEAAuE,KAAK,oBAAoB;AAC/H,QAAI,KAAK,SAAS,WAAW;AAAG,YAAMA,OAAM,gEAAgE,KAAK,oBAAoB;AACrI,WAAO,KAAK,QAAQ,CAAC,EAAE,UAAU,eAAe;AAAA,EACjD;AAAA,EAEA,UAAU,UAAwC;AACjD,SAAK,aAAa,KAAK,QAAQ;AAC/B,WAAO,KAAK,YAAY,KAAK,MAAM,QAAQ;AAAA,EAC5C;AAAA,EAEA,YAAY,UAAwC;AACnD,UAAM,QAAQ,KAAK,aAAa,QAAQ,QAAQ;AAChD,QAAI,UAAU,IAAI;AACjB,WAAK,aAAa,OAAO,OAAO,CAAC;AAAA,IAClC;AAAO,MAAAJ,MAAK,uCAAuC,QAAQ;AAAA,EAC5D;AAAA,EAEU,kBAAkB,OAAoB;AAC/C,IAAAE,OAAM,YAAY,KAAK,IAAI,eAAe,KAAK,aAAa,QAAQ,kBAAkB,EAAE,GAAG,OAAO,MAAM,KAAK,aAAa,CAAC;AAC3H,eAAW,cAAc,KAAK,cAAc;AAC3C,iBAAW,KAAK;AAAA,IACjB;AAAA,EACD;AAAA,EAEA,IAAI,UAA8E;AAEjF,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,cAAoC;AACvC,WAAO,KAAK,SAAS,IAAI,CAAAI,OAAKA,GAAE,GAAG;AAAA,EACpC;AAAA,EAEO,IAAO,IAA2B;AAExC,WAAO,KAAK,QAAQ,IAAI,EAAE;AAAA,EAC3B;AAAA,EACA,IAAW,WAAW;AACrB,WAAO,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO;AAAA,EAC/C;AAAA,EACA,IAAW,YAAY;AACtB,WAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,OAAO;AAAA,EAC3C;AAAA,EAEA,IAAI,WAAW;AACd,WAAO,KAAK,QAAQ,CAAC;AAAA,EACtB;AAAA,EACA,IAAI,YAAY;AACf,WAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAAA,EAC5C;AAAA,EACO,UAAU,QAAgB,OAAgB;AAChD,QAAI,OAAO;AACV,aAAO,KAAK,QAAQ,SAAS,MAAM;AAAA,IACpC,OAAO;AACN,UAAI,CAAC,OAAO;AAAK,cAAMF,OAAM,oCAAoC,MAAM;AACvE,aAAO,KAAK,aAAa,OAAO,GAAG;AAAA,IASpC;AAAA,EACD;AAAA,EACO,aAAa,KAAsB;AACzC,WAAO,KAAK,YAAY,SAAS,IAAI,SAAS,CAAC;AAAA,EAChD;AAAA,EACA,IAAI,eAAe;AAClB,WAAO,IAAI,IAAI,KAAK,QAAQ,IAAI,SAAO,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;AAAA,EACvD;AAAA,EACO,UAAU,KAAsB;AACtC,WAAO,KAAK,aAAa,IAAI,IAAI,SAAS,CAAC;AAAA,EAI5C;AAAA,EAEO,oBAAoB,QAAyB;AAEnD,WAAO,KAAK,QAAQ,KAAK,cACxB,SAAS,OAAO,OAAO,MACpB,SAAS,OAAO,OAAO,MACvB,SAAS,OAAO,OAAO,MACvB,SAAS,OAAO,OAAO,EAC1B;AAAA,EACF;AAAA,EAEA,IAAI,UAAU;AACb,WAAO,KAAK,SAAS;AAAA,EACtB;AAAA,EACA,IAAI,OAAO;AACV,WAAO,KAAK,QAAQ;AAAA,EACrB;AAAA,EACA,IAAI,SAAS;AACZ,WAAO,KAAK,QAAQ;AAAA,EACrB;AAAA,EACA,IAAI,gBAAgB;AACnB,WAAO,UAAU,MAAM,KAAK,IAAI;AAAA,EACjC;AAAA,EACA,IAAI,uBAAuB;AAC1B,WAAO,UAAU,MAAM,GAAG,KAAK,IAAI,KAAK,KAAK,IAAI,GAAG;AAAA,EACrD;AAAA,EACA,IAAI,aAAa;AAChB,WAAO,mBAAmB,KAAK,IAAI;AAAA,EACpC;AAAA,EACA,IAAI,aAAa;AAChB,WAAO,CAAC,CAAC,KAAK,SAAS;AAAA,EACxB;AACD;AAEO,IAAM,oBAAoB,CAAC,iBAAkC,wBAAwB,SAAS,aAAa,UAAU;AAErH,IAAM,eAAN,MAAM,sBAAqB,OAAO;AAAA,EACxC,OAAO,UAAU,SAAmBC,OAAe;AAClD,WAAO,IAAI,cAAaA,SAAQ,UAAU,MAAM,CAAC,GAAG,OAAO;AAAA,EAC5D;AAAA,EACA,YACCA,OACA,SACA,SACA,UACC;AACD,UAAMA,OAAM,SAAS,SAAS,UAAU,EAAE,gBAAgB,KAAK,CAAC;AAAA,EACjE;AAAA,EAEA,IAAI,WAAW;AACd,WAAO;AAAA,EACR;AACD;;;ACnMA;AAAA;AAAA;AAAA,gBAAAE;AAAA,EAAA,cAAAC;AAAA,EAAA,cAAAC;AAAA,EAAA;AAAA;AAAA,mBAAAA;AAAA;;;ACKA,IAAM,UAAU;AAAA,EACd;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,kBAAkB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAMO,SAAS,GAAI,OAAO;AACzB,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,QAAW;AACvB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,QAAQ,UAAU,OAAO;AACrC,WAAO;AAAA,EACT;AACA,QAAM,SAAS,OAAO;AACtB,MAAI,QAAQ,SAAS,MAAM,GAAG;AAC5B,WAAO;AAAA,EACT;AAGA,MAAI,WAAW,YAAY;AACzB,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT;AACA,QAAM,aAAa,cAAc,KAAK;AACtC,MAAI,YAAY;AACd,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAMA,SAAS,SAAU,OAAO;AACxB,SAAO,SAAS,MAAM,eAAe,MAAM,YAAY,YAAY,MAAM,YAAY,SAAS,KAAK,MAAM,KAAK;AAChH;AAMA,SAAS,cAAe,OAAO;AAC7B,QAAM,iBAAiB,OAAO,UAAU,SAAS,KAAK,KAAK,EAAE,MAAM,GAAG,EAAE;AACxE,MAAI,gBAAgB,SAAS,cAAc,GAAG;AAC5C,WAAO;AAAA,EACT;AAEA,SAAO;AACT;;;ACzGA,IAAM,OAAN,MAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMT,YAAa,OAAOC,OAAM,UAAU;AAClC,SAAK,QAAQ;AACb,SAAK,eAAe,SAAS;AAC7B,SAAK,OAAOA;AACZ,SAAK,WAAW;AAAA,EAClB;AAAA;AAAA,EAGA,WAAY;AACV,WAAO,QAAQ,KAAK,KAAK,KAAK,KAAK,IAAI;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAS,KAAK;AAEZ,WAAO,KAAK,QAAQ,IAAI,QAAQ,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAI;AAAA,EACpE;AACF;AAGA,KAAK,OAAO,IAAI,KAAK,GAAG,QAAQ,IAAI;AACpC,KAAK,SAAS,IAAI,KAAK,GAAG,UAAU,IAAI;AACxC,KAAK,QAAQ,IAAI,KAAK,GAAG,SAAS,IAAI;AACtC,KAAK,SAAS,IAAI,KAAK,GAAG,UAAU,IAAI;AACxC,KAAK,QAAQ,IAAI,KAAK,GAAG,SAAS,KAAK;AACvC,KAAK,MAAM,IAAI,KAAK,GAAG,OAAO,KAAK;AACnC,KAAK,MAAM,IAAI,KAAK,GAAG,OAAO,KAAK;AACnC,KAAK,QAAQ,IAAI,KAAK,GAAG,SAAS,IAAI;AACtC,KAAK,QAAQ,IAAI,KAAK,GAAG,SAAS,IAAI;AACtC,KAAK,OAAO,IAAI,KAAK,GAAG,QAAQ,IAAI;AACpC,KAAK,OAAO,IAAI,KAAK,GAAG,QAAQ,IAAI;AACpC,KAAK,YAAY,IAAI,KAAK,GAAG,aAAa,IAAI;AAC9C,KAAK,QAAQ,IAAI,KAAK,GAAG,SAAS,IAAI;AAGtC,IAAM,QAAN,MAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMV,YAAa,MAAM,OAAO,eAAe;AACvC,SAAK,OAAO;AACZ,SAAK,QAAQ;AACb,SAAK,gBAAgB;AAErB,SAAK,eAAe;AAEpB,SAAK,YAAY;AAAA,EACnB;AAAA;AAAA,EAGA,WAAY;AACV,WAAO,SAAS,KAAK,IAAI,KAAK,KAAK,KAAK;AAAA,EAC1C;AACF;;;AC5DO,IAAM,YAAY,WAAW;AAElC,CAAC,WAAW,QAAQ;AAEpB,WAAW;AAEX,OAAO,WAAW,OAAO,aAAa;AAExC,IAAM,cAAc,IAAI,YAAY;AACpC,IAAM,cAAc,IAAI,YAAY;AAMpC,SAASC,UAAUC,MAAK;AAEtB,SAAO,aAAa,WAAW,OAAO,SAASA,IAAG;AACpD;AAMO,SAAS,MAAOA,MAAK;AAE1B,MAAI,EAAEA,gBAAe,aAAa;AAChC,WAAO,WAAW,KAAKA,IAAG;AAAA,EAC5B;AACA,SAAOD,UAASC,IAAG,IAAI,IAAI,WAAWA,KAAI,QAAQA,KAAI,YAAYA,KAAI,UAAU,IAAIA;AACtF;AAEO,IAAM,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOpB,CAACC,QAAO,OAAO,QAAQ;AACrB,WAAO,MAAM,QAAQ;AAAA;AAAA;AAAA,MAGnB,WAAW,OAAO,KAAKA,OAAM,SAAS,OAAO,GAAG,CAAC,EAAE,SAAS,MAAM;AAAA,QAChE,UAAUA,QAAO,OAAO,GAAG;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAACA,QAAO,OAAO,QAAQ;AACrB,WAAO,MAAM,QAAQ,KACjB,YAAY,OAAOA,OAAM,SAAS,OAAO,GAAG,CAAC,IAC7C,UAAUA,QAAO,OAAO,GAAG;AAAA,EACjC;AAAA;AAEG,IAAM,aAAa;AAAA;AAAA;AAAA;AAAA;AAAA,EAKtB,CAAC,WAAW;AACV,WAAO,OAAO,SAAS;AAAA;AAAA;AAAA,MAGrB,WAAW,OAAO,KAAK,MAAM;AAAA,QAC3B,YAAY,MAAM;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,WAAW;AACV,WAAO,OAAO,SAAS,KAAK,YAAY,OAAO,MAAM,IAAI,YAAY,MAAM;AAAA,EAC7E;AAAA;AAOG,IAAM,YAAY,CAAC,QAAQ;AAChC,SAAO,WAAW,KAAK,GAAG;AAC5B;AAEO,IAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOjB,CAACA,QAAO,OAAO,QAAQ;AACrB,QAAIF,UAASE,MAAK,GAAG;AACnB,aAAO,IAAI,WAAWA,OAAM,SAAS,OAAO,GAAG,CAAC;AAAA,IAClD;AACA,WAAOA,OAAM,MAAM,OAAO,GAAG;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAACA,QAAO,OAAO,QAAQ;AACrB,WAAOA,OAAM,MAAM,OAAO,GAAG;AAAA,EAC/B;AAAA;AAEG,IAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOlB,CAAC,QAAQC,YAAW;AAGlB,aAAS,OAAO,IAAI,CAACC,OAAMA,cAAa,aACpCA;AAAA;AAAA;AAAA,MAKF,WAAW,OAAO,KAAKA,EAAC;AAAA,KAAC;AAE3B,WAAO,MAAM,WAAW,OAAO,OAAO,QAAQD,OAAM,CAAC;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,CAAC,QAAQA,YAAW;AAClB,UAAM,MAAM,IAAI,WAAWA,OAAM;AACjC,QAAI,MAAM;AACV,aAASE,MAAK,QAAQ;AACpB,UAAI,MAAMA,GAAE,SAAS,IAAI,QAAQ;AAE/B,QAAAA,KAAIA,GAAE,SAAS,GAAG,IAAI,SAAS,GAAG;AAAA,MACpC;AACA,UAAI,IAAIA,IAAG,GAAG;AACd,aAAOA,GAAE;AAAA,IACX;AACA,WAAO;AAAA,EACT;AAAA;AAEG,IAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMjB,CAAC,SAAS;AAGR,WAAO,WAAW,OAAO,YAAY,IAAI;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,CAAC,SAAS;AACR,WAAO,IAAI,WAAW,IAAI;AAAA,EAC5B;AAAA;AAoFG,SAAS,QAAS,IAAI,IAAI;AAE/B,MAAIC,UAAS,EAAE,KAAKA,UAAS,EAAE,GAAG;AAGhC,WAAO,GAAG,QAAQ,EAAE;AAAA,EACtB;AACA,WAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,QAAI,GAAG,CAAC,MAAM,GAAG,CAAC,GAAG;AACnB;AAAA,IACF;AACA,WAAO,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK;AAAA,EAC9B;AACA,SAAO;AACT;AASA,SAAS,YAAa,KAAK;AACzB,QAAM,MAAM,CAAC;AACb,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,QAAIC,KAAI,IAAI,WAAW,CAAC;AACxB,QAAIA,KAAI,KAAK;AACX,UAAI,GAAG,IAAIA;AAAA,IACb,WAAWA,KAAI,MAAM;AACnB,UAAI,GAAG,IAAKA,MAAK,IAAK;AACtB,UAAI,GAAG,IAAKA,KAAI,KAAM;AAAA,IACxB,YACIA,KAAI,WAAY,SAAY,IAAI,IAAK,IAAI,WACzC,IAAI,WAAW,IAAI,CAAC,IAAI,WAAY,OAAS;AAE/C,MAAAA,KAAI,UAAYA,KAAI,SAAW,OAAO,IAAI,WAAW,EAAE,CAAC,IAAI;AAC5D,UAAI,GAAG,IAAKA,MAAK,KAAM;AACvB,UAAI,GAAG,IAAMA,MAAK,KAAM,KAAM;AAC9B,UAAI,GAAG,IAAMA,MAAK,IAAK,KAAM;AAC7B,UAAI,GAAG,IAAKA,KAAI,KAAM;AAAA,IACxB,OAAO;AACL,UAAI,GAAG,IAAKA,MAAK,KAAM;AACvB,UAAI,GAAG,IAAMA,MAAK,IAAK,KAAM;AAC7B,UAAI,GAAG,IAAKA,KAAI,KAAM;AAAA,IACxB;AAAA,EACF;AACA,SAAO;AACT;AAWA,SAAS,UAAWC,MAAK,QAAQ,KAAK;AACpC,QAAM,MAAM,CAAC;AAEb,SAAO,SAAS,KAAK;AACnB,UAAM,YAAYA,KAAI,MAAM;AAC5B,QAAI,YAAY;AAChB,QAAI,mBAAoB,YAAY,MAAQ,IAAK,YAAY,MAAQ,IAAK,YAAY,MAAQ,IAAI;AAElG,QAAI,SAAS,oBAAoB,KAAK;AACpC,UAAI,YAAY,WAAW,YAAY;AAEvC,cAAQ,kBAAkB;AAAA,QACxB,KAAK;AACH,cAAI,YAAY,KAAM;AACpB,wBAAY;AAAA,UACd;AACA;AAAA,QACF,KAAK;AACH,uBAAaA,KAAI,SAAS,CAAC;AAC3B,eAAK,aAAa,SAAU,KAAM;AAChC,6BAAiB,YAAY,OAAS,IAAO,aAAa;AAC1D,gBAAI,gBAAgB,KAAM;AACxB,0BAAY;AAAA,YACd;AAAA,UACF;AACA;AAAA,QACF,KAAK;AACH,uBAAaA,KAAI,SAAS,CAAC;AAC3B,sBAAYA,KAAI,SAAS,CAAC;AAC1B,eAAK,aAAa,SAAU,QAAS,YAAY,SAAU,KAAM;AAC/D,6BAAiB,YAAY,OAAQ,MAAO,aAAa,OAAS,IAAO,YAAY;AAErF,gBAAI,gBAAgB,SAAU,gBAAgB,SAAU,gBAAgB,QAAS;AAC/E,0BAAY;AAAA,YACd;AAAA,UACF;AACA;AAAA,QACF,KAAK;AACH,uBAAaA,KAAI,SAAS,CAAC;AAC3B,sBAAYA,KAAI,SAAS,CAAC;AAC1B,uBAAaA,KAAI,SAAS,CAAC;AAC3B,eAAK,aAAa,SAAU,QAAS,YAAY,SAAU,QAAS,aAAa,SAAU,KAAM;AAC/F,6BAAiB,YAAY,OAAQ,MAAQ,aAAa,OAAS,MAAO,YAAY,OAAS,IAAO,aAAa;AACnH,gBAAI,gBAAgB,SAAU,gBAAgB,SAAU;AACtD,0BAAY;AAAA,YACd;AAAA,UACF;AAAA,MACJ;AAAA,IACF;AAGA,QAAI,cAAc,MAAM;AAGtB,kBAAY;AACZ,yBAAmB;AAAA,IACrB,WAAW,YAAY,OAAQ;AAE7B,mBAAa;AACb,UAAI,KAAK,cAAc,KAAK,OAAQ,KAAM;AAC1C,kBAAY,QAAS,YAAY;AAAA,IACnC;AAEA,QAAI,KAAK,SAAS;AAClB,cAAU;AAAA,EACZ;AAEA,SAAO,sBAAsB,GAAG;AAClC;AAKA,IAAM,uBAAuB;AAMtB,SAAS,sBAAuB,YAAY;AACjD,QAAM,MAAM,WAAW;AACvB,MAAI,OAAO,sBAAsB;AAC/B,WAAO,OAAO,aAAa,MAAM,QAAQ,UAAU;AAAA,EACrD;AAGA,MAAI,MAAM;AACV,MAAI,IAAI;AACR,SAAO,IAAI,KAAK;AACd,WAAO,OAAO,aAAa;AAAA,MACzB;AAAA,MACA,WAAW,MAAM,GAAG,KAAK,oBAAoB;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;;;ACxYA,IAAM,mBAAmB;AAElB,IAAM,KAAN,MAAS;AAAA;AAAA;AAAA;AAAA,EAId,YAAa,YAAY,kBAAkB;AACzC,SAAK,YAAY;AAEjB,SAAK,SAAS;AAEd,SAAK,YAAY;AAEjB,SAAK,SAAS,CAAC;AAGf,SAAK,kBAAkB;AAAA,EACzB;AAAA,EAEA,QAAS;AACP,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,QAAI,KAAK,OAAO,QAAQ;AACtB,WAAK,SAAS,CAAC;AAAA,IACjB;AACA,QAAI,KAAK,oBAAoB,MAAM;AACjC,WAAK,OAAO,KAAK,KAAK,eAAe;AACrC,WAAK,YAAY,KAAK,gBAAgB,SAAS;AAAA,IACjD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,KAAMC,QAAO;AACX,QAAI,WAAW,KAAK,OAAO,KAAK,OAAO,SAAS,CAAC;AACjD,UAAM,SAAS,KAAK,SAASA,OAAM;AACnC,QAAI,UAAU,KAAK,YAAY,GAAG;AAEhC,YAAM,WAAW,SAAS,UAAU,KAAK,YAAY,KAAK,UAAU;AAEpE,eAAS,IAAIA,QAAO,QAAQ;AAAA,IAC9B,OAAO;AAEL,UAAI,UAAU;AAEZ,cAAM,WAAW,SAAS,UAAU,KAAK,YAAY,KAAK,UAAU;AACpE,YAAI,WAAW,SAAS,QAAQ;AAE9B,eAAK,OAAO,KAAK,OAAO,SAAS,CAAC,IAAI,SAAS,SAAS,GAAG,QAAQ;AACnE,eAAK,YAAY,KAAK,SAAS;AAAA,QACjC;AAAA,MACF;AACA,UAAIA,OAAM,SAAS,MAAMA,OAAM,SAAS,KAAK,WAAW;AAEtD,mBAAW,MAAM,KAAK,SAAS;AAC/B,aAAK,OAAO,KAAK,QAAQ;AACzB,aAAK,aAAa,SAAS;AAC3B,YAAI,KAAK,oBAAoB,MAAM;AACjC,eAAK,kBAAkB;AAAA,QACzB;AAEA,iBAAS,IAAIA,QAAO,CAAC;AAAA,MACvB,OAAO;AAEL,aAAK,OAAO,KAAKA,MAAK;AACtB,aAAK,aAAaA,OAAM;AAAA,MAC1B;AAAA,IACF;AACA,SAAK,UAAUA,OAAM;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAS,QAAQ,OAAO;AACtB,QAAI;AACJ,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B,YAAM,QAAQ,KAAK,OAAO,CAAC;AAC3B,UAAI,SAAS,KAAK,SAAS,MAAM,SAAS,GAAG;AAG3C,eAAO,KAAK,WAAW,MAAM,SAAS,QAAQ,MAAM,SAAS,GAAG,KAAK,MAAM;AAC3E,aAAK,kBAAkB;AACvB,aAAK,SAAS,CAAC;AAAA,MACjB,OAAO;AAEL,eAAO,MAAM,OAAO,GAAG,KAAK,MAAM;AAAA,MACpC;AAAA,IACF,OAAO;AAEL,aAAO,OAAO,KAAK,QAAQ,KAAK,MAAM;AAAA,IACxC;AACA,QAAI,OAAO;AACT,WAAK,MAAM;AAAA,IACb;AACA,WAAO;AAAA,EACT;AACF;;;AC3HA,IAAM,kBAAkB;AACxB,IAAM,kBAAkB;AAExB,IAAM,uBAAuB,CAAC;AAC9B,qBAAqB,EAAE,IAAI;AAC3B,qBAAqB,EAAE,IAAI;AAC3B,qBAAqB,EAAE,IAAI;AAC3B,qBAAqB,EAAE,IAAI;AAC3B,qBAAqB,EAAE,IAAI;AAO3B,SAAS,iBAAkB,MAAM,KAAK,MAAM;AAC1C,MAAI,KAAK,SAAS,MAAM,MAAM;AAC5B,UAAM,IAAI,MAAM,GAAG,eAAe,2BAA2B;AAAA,EAC/D;AACF;;;ACdO,IAAM,iBAAiB,CAAC,IAAI,KAAK,OAAO,YAAY,OAAO,sBAAsB,CAAC;AAalF,SAAS,UAAW,MAAM,QAAQ,SAAS;AAChD,mBAAiB,MAAM,QAAQ,CAAC;AAChC,QAAM,QAAQ,KAAK,MAAM;AACzB,MAAI,QAAQ,WAAW,QAAQ,QAAQ,eAAe,CAAC,GAAG;AACxD,UAAM,IAAI,MAAM,GAAG,eAAe,+DAA+D;AAAA,EACnG;AACA,SAAO;AACT;AAQO,SAAS,WAAY,MAAM,QAAQ,SAAS;AACjD,mBAAiB,MAAM,QAAQ,CAAC;AAChC,QAAM,QAAS,KAAK,MAAM,KAAK,IAAK,KAAK,SAAS,CAAC;AACnD,MAAI,QAAQ,WAAW,QAAQ,QAAQ,eAAe,CAAC,GAAG;AACxD,UAAM,IAAI,MAAM,GAAG,eAAe,+DAA+D;AAAA,EACnG;AACA,SAAO;AACT;AAQO,SAAS,WAAY,MAAM,QAAQ,SAAS;AACjD,mBAAiB,MAAM,QAAQ,CAAC;AAChC,QAAM,QAAS,KAAK,MAAM,IAAI,YAA2B,KAAK,SAAS,CAAC,KAAK,OAAO,KAAK,SAAS,CAAC,KAAK,KAAK,KAAK,SAAS,CAAC;AAC5H,MAAI,QAAQ,WAAW,QAAQ,QAAQ,eAAe,CAAC,GAAG;AACxD,UAAM,IAAI,MAAM,GAAG,eAAe,+DAA+D;AAAA,EACnG;AACA,SAAO;AACT;AAQO,SAAS,WAAY,MAAM,QAAQ,SAAS;AAEjD,mBAAiB,MAAM,QAAQ,CAAC;AAChC,QAAM,KAAM,KAAK,MAAM,IAAI,YAA2B,KAAK,SAAS,CAAC,KAAK,OAAO,KAAK,SAAS,CAAC,KAAK,KAAK,KAAK,SAAS,CAAC;AACzH,QAAM,KAAM,KAAK,SAAS,CAAC,IAAI,YAA2B,KAAK,SAAS,CAAC,KAAK,OAAO,KAAK,SAAS,CAAC,KAAK,KAAK,KAAK,SAAS,CAAC;AAC7H,QAAM,SAAS,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE;AACpD,MAAI,QAAQ,WAAW,QAAQ,QAAQ,eAAe,CAAC,GAAG;AACxD,UAAM,IAAI,MAAM,GAAG,eAAe,+DAA+D;AAAA,EACnG;AACA,MAAI,SAAS,OAAO,kBAAkB;AACpC,WAAO,OAAO,KAAK;AAAA,EACrB;AACA,MAAI,QAAQ,gBAAgB,MAAM;AAChC,WAAO;AAAA,EACT;AACA,QAAM,IAAI,MAAM,GAAG,eAAe,+DAA+D;AACnG;AAgBO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,SAAO,IAAI,MAAM,KAAK,MAAM,UAAU,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AAClE;AASO,SAAS,aAAc,MAAM,KAAK,QAAQ,SAAS;AACxD,SAAO,IAAI,MAAM,KAAK,MAAM,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACnE;AASO,SAAS,aAAc,MAAM,KAAK,QAAQ,SAAS;AACxD,SAAO,IAAI,MAAM,KAAK,MAAM,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACnE;AASO,SAAS,aAAc,MAAM,KAAK,QAAQ,SAAS;AACxD,SAAO,IAAI,MAAM,KAAK,MAAM,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACnE;AAMO,SAAS,WAAYC,MAAK,OAAO;AACtC,SAAO,gBAAgBA,MAAK,GAAG,MAAM,KAAK;AAC5C;AAOO,SAAS,gBAAiBA,MAAK,OAAO,MAAM;AACjD,MAAI,OAAO,eAAe,CAAC,GAAG;AAC5B,UAAM,QAAQ,OAAO,IAAI;AAEzB,IAAAA,KAAI,KAAK,CAAC,QAAQ,KAAK,CAAC;AAAA,EAC1B,WAAW,OAAO,eAAe,CAAC,GAAG;AACnC,UAAM,QAAQ,OAAO,IAAI;AAEzB,IAAAA,KAAI,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC;AAAA,EAC9B,WAAW,OAAO,eAAe,CAAC,GAAG;AACnC,UAAM,QAAQ,OAAO,IAAI;AAEzB,IAAAA,KAAI,KAAK,CAAC,QAAQ,IAAI,UAAU,GAAG,QAAQ,GAAI,CAAC;AAAA,EAClD,WAAW,OAAO,eAAe,CAAC,GAAG;AACnC,UAAM,QAAQ,OAAO,IAAI;AAEzB,IAAAA,KAAI,KAAK,CAAC,QAAQ,IAAK,UAAU,KAAM,KAAO,UAAU,KAAM,KAAO,UAAU,IAAK,KAAM,QAAQ,GAAI,CAAC;AAAA,EACzG,OAAO;AACL,UAAM,QAAQ,OAAO,IAAI;AACzB,QAAI,QAAQ,eAAe,CAAC,GAAG;AAE7B,YAAM,MAAM,CAAC,QAAQ,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAE5C,UAAI,KAAK,OAAO,QAAQ,OAAO,UAAU,CAAC;AAC1C,UAAI,KAAK,OAAO,SAAS,OAAO,EAAE,IAAI,OAAO,UAAU,CAAC;AACxD,UAAI,CAAC,IAAI,KAAK;AACd,WAAK,MAAM;AACX,UAAI,CAAC,IAAI,KAAK;AACd,WAAK,MAAM;AACX,UAAI,CAAC,IAAI,KAAK;AACd,WAAK,MAAM;AACX,UAAI,CAAC,IAAI,KAAK;AACd,UAAI,CAAC,IAAI,KAAK;AACd,WAAK,MAAM;AACX,UAAI,CAAC,IAAI,KAAK;AACd,WAAK,MAAM;AACX,UAAI,CAAC,IAAI,KAAK;AACd,WAAK,MAAM;AACX,UAAI,CAAC,IAAI,KAAK;AACd,MAAAA,KAAI,KAAK,GAAG;AAAA,IACd,OAAO;AACL,YAAM,IAAI,MAAM,GAAG,eAAe,iDAAiD;AAAA,IACrF;AAAA,EACF;AACF;AAMA,WAAW,cAAc,SAAS,YAAa,OAAO;AACpD,SAAO,gBAAgB,YAAY,MAAM,KAAK;AAChD;AAMA,gBAAgB,cAAc,SAASC,aAAa,MAAM;AACxD,MAAI,OAAO,eAAe,CAAC,GAAG;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,OAAO,eAAe,CAAC,GAAG;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,OAAO,eAAe,CAAC,GAAG;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,OAAO,eAAe,CAAC,GAAG;AAC5B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAOA,WAAW,gBAAgB,SAAS,cAAe,MAAM,MAAM;AAC7D,SAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,KAAK,QAAQ,KAAK,QAAQ;AAAA;AAAA,IAAyB;AAAA;AAC3F;;;AChNO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAO,IAAI,MAAM,KAAK,QAAQ,KAAU,UAAU,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AAC9E;AASO,SAAS,eAAgB,MAAM,KAAK,QAAQ,SAAS;AAC1D,SAAO,IAAI,MAAM,KAAK,QAAQ,KAAU,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AAC/E;AASO,SAAS,eAAgB,MAAM,KAAK,QAAQ,SAAS;AAC1D,SAAO,IAAI,MAAM,KAAK,QAAQ,KAAU,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AAC/E;AAEA,IAAM,QAAQ,OAAO,EAAE;AACvB,IAAM,QAAQ,OAAO,CAAC;AASf,SAAS,eAAgB,MAAM,KAAK,QAAQ,SAAS;AAC1D,QAAM,MAAW,WAAW,MAAM,MAAM,GAAG,OAAO;AAClD,MAAI,OAAO,QAAQ,UAAU;AAC3B,UAAM,QAAQ,KAAK;AACnB,QAAI,SAAS,OAAO,kBAAkB;AACpC,aAAO,IAAI,MAAM,KAAK,QAAQ,OAAO,CAAC;AAAA,IACxC;AAAA,EACF;AACA,MAAI,QAAQ,gBAAgB,MAAM;AAChC,UAAM,IAAI,MAAM,GAAG,eAAe,+DAA+D;AAAA,EACnG;AACA,SAAO,IAAI,MAAM,KAAK,QAAQ,QAAQ,OAAO,GAAG,GAAG,CAAC;AACtD;AAMO,SAAS,aAAcC,MAAK,OAAO;AACxC,QAAM,SAAS,MAAM;AACrB,QAAM,WAAY,OAAO,WAAW,WAAY,SAAS,QAAQ,QAAU,SAAS,KAAK;AACzF,EAAK,gBAAgBA,MAAK,MAAM,KAAK,cAAc,QAAQ;AAC7D;AAMA,aAAa,cAAc,SAASC,aAAa,OAAO;AACtD,QAAM,SAAS,MAAM;AACrB,QAAM,WAAY,OAAO,WAAW,WAAY,SAAS,QAAQ,QAAU,SAAS,KAAK;AAGzF,MAAI,WAAgB,eAAe,CAAC,GAAG;AACrC,WAAO;AAAA,EACT;AACA,MAAI,WAAgB,eAAe,CAAC,GAAG;AACrC,WAAO;AAAA,EACT;AACA,MAAI,WAAgB,eAAe,CAAC,GAAG;AACrC,WAAO;AAAA,EACT;AACA,MAAI,WAAgB,eAAe,CAAC,GAAG;AACrC,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAOA,aAAa,gBAAgB,SAASC,eAAe,MAAM,MAAM;AAE/D,SAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI,KAAK,QAAQ,KAAK,QAAQ;AAAA;AAAA,IAA0B;AAAA;AAC3F;;;AC7FA,SAAS,QAAS,MAAM,KAAK,QAAQC,SAAQ;AAC3C,mBAAiB,MAAM,KAAK,SAASA,OAAM;AAC3C,QAAMC,OAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,SAASD,OAAM;AAC3D,SAAO,IAAI,MAAM,KAAK,OAAOC,MAAK,SAASD,OAAM;AACnD;AASO,SAAS,mBAAoB,MAAM,KAAK,OAAO,UAAU;AAC9D,SAAO,QAAQ,MAAM,KAAK,GAAG,KAAK;AACpC;AASO,SAAS,aAAc,MAAM,KAAK,QAAQ,SAAS;AACxD,SAAO,QAAQ,MAAM,KAAK,GAAQ,UAAU,MAAM,MAAM,GAAG,OAAO,CAAC;AACrE;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAO,QAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,CAAC;AACtE;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAO,QAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,CAAC;AACtE;AAUO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,QAAME,KAAS,WAAW,MAAM,MAAM,GAAG,OAAO;AAChD,MAAI,OAAOA,OAAM,UAAU;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,6CAA6C;AAAA,EACjF;AACA,SAAO,QAAQ,MAAM,KAAK,GAAGA,EAAC;AAChC;AAQA,SAAS,WAAY,OAAO;AAC1B,MAAI,MAAM,iBAAiB,QAAW;AACpC,UAAM,eAAe,MAAM,SAAS,KAAK,SAAS,WAAW,MAAM,KAAK,IAAI,MAAM;AAAA,EACpF;AAEA,SAAO,MAAM;AACf;AAMO,SAAS,YAAaD,MAAK,OAAO;AACvC,QAAME,SAAQ,WAAW,KAAK;AAC9B,EAAK,gBAAgBF,MAAK,MAAM,KAAK,cAAcE,OAAM,MAAM;AAC/D,EAAAF,KAAI,KAAKE,MAAK;AAChB;AAMA,YAAY,cAAc,SAASC,aAAa,OAAO;AACrD,QAAMD,SAAQ,WAAW,KAAK;AAC9B,SAAY,gBAAgB,YAAYA,OAAM,MAAM,IAAIA,OAAM;AAChE;AAOA,YAAY,gBAAgB,SAASE,eAAe,MAAM,MAAM;AAC9D,SAAO,aAAa,WAAW,IAAI,GAAG,WAAW,IAAI,CAAC;AACxD;AAOO,SAAS,aAAc,IAAI,IAAI;AACpC,SAAO,GAAG,SAAS,GAAG,SAAS,KAAK,GAAG,SAAS,GAAG,SAAS,IAAI,QAAQ,IAAI,EAAE;AAChF;;;ACjHA,SAASC,SAAS,MAAM,KAAK,QAAQC,SAAQ,SAAS;AACpD,QAAM,YAAY,SAASA;AAC3B,mBAAiB,MAAM,KAAK,SAAS;AACrC,QAAM,MAAM,IAAI,MAAM,KAAK,QAAQ,SAAS,MAAM,MAAM,QAAQ,MAAM,SAAS,GAAG,SAAS;AAC3F,MAAI,QAAQ,sBAAsB,MAAM;AACtC,QAAI,YAAY,MAAM,MAAM,MAAM,QAAQ,MAAM,SAAS;AAAA,EAC3D;AACA,SAAO;AACT;AASO,SAAS,oBAAqB,MAAM,KAAK,OAAO,SAAS;AAC9D,SAAOD,SAAQ,MAAM,KAAK,GAAG,OAAO,OAAO;AAC7C;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,UAAU,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO;AAC9E;AASO,SAAS,eAAgB,MAAM,KAAK,QAAQ,SAAS;AAC1D,SAAOA,SAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO;AAC/E;AASO,SAAS,eAAgB,MAAM,KAAK,QAAQ,SAAS;AAC1D,SAAOA,SAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,OAAO;AAC/E;AAUO,SAAS,eAAgB,MAAM,KAAK,QAAQ,SAAS;AAC1D,QAAME,KAAS,WAAW,MAAM,MAAM,GAAG,OAAO;AAChD,MAAI,OAAOA,OAAM,UAAU;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,8CAA8C;AAAA,EAClF;AACA,SAAOF,SAAQ,MAAM,KAAK,GAAGE,IAAG,OAAO;AACzC;AAEO,IAAM,eAAe;;;ACzE5B,SAASC,SAAS,OAAO,MAAM,QAAQC,SAAQ;AAC7C,SAAO,IAAI,MAAM,KAAK,OAAOA,SAAQ,MAAM;AAC7C;AASO,SAAS,mBAAoB,MAAM,KAAK,OAAO,UAAU;AAC9D,SAAOD,SAAQ,MAAM,KAAK,GAAG,KAAK;AACpC;AASO,SAAS,aAAc,MAAM,KAAK,QAAQ,SAAS;AACxD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,UAAU,MAAM,MAAM,GAAG,OAAO,CAAC;AACrE;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,CAAC;AACtE;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,CAAC;AACtE;AAUO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,QAAME,KAAS,WAAW,MAAM,MAAM,GAAG,OAAO;AAChD,MAAI,OAAOA,OAAM,UAAU;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,6CAA6C;AAAA,EACjF;AACA,SAAOF,SAAQ,MAAM,KAAK,GAAGE,EAAC;AAChC;AASO,SAAS,sBAAuB,MAAM,KAAK,QAAQ,SAAS;AACjE,MAAI,QAAQ,oBAAoB,OAAO;AACrC,UAAM,IAAI,MAAM,GAAG,eAAe,sCAAsC;AAAA,EAC1E;AACA,SAAOF,SAAQ,MAAM,KAAK,GAAG,QAAQ;AACvC;AAMO,SAAS,YAAaG,MAAK,OAAO;AACvC,EAAK,gBAAgBA,MAAK,KAAK,MAAM,cAAc,MAAM,KAAK;AAChE;AAIA,YAAY,gBAAqB,WAAW;AAM5C,YAAY,cAAc,SAASC,aAAa,OAAO;AACrD,SAAY,gBAAgB,YAAY,MAAM,KAAK;AACrD;;;AChGA,SAASC,SAAS,OAAO,MAAM,QAAQC,SAAQ;AAC7C,SAAO,IAAI,MAAM,KAAK,KAAKA,SAAQ,MAAM;AAC3C;AASO,SAAS,iBAAkB,MAAM,KAAK,OAAO,UAAU;AAC5D,SAAOD,SAAQ,MAAM,KAAK,GAAG,KAAK;AACpC;AASO,SAAS,WAAY,MAAM,KAAK,QAAQ,SAAS;AACtD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,UAAU,MAAM,MAAM,GAAG,OAAO,CAAC;AACrE;AASO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,CAAC;AACtE;AASO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,SAAOA,SAAQ,MAAM,KAAK,GAAQ,WAAW,MAAM,MAAM,GAAG,OAAO,CAAC;AACtE;AAUO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,QAAME,KAAS,WAAW,MAAM,MAAM,GAAG,OAAO;AAChD,MAAI,OAAOA,OAAM,UAAU;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,2CAA2C;AAAA,EAC/E;AACA,SAAOF,SAAQ,MAAM,KAAK,GAAGE,EAAC;AAChC;AASO,SAAS,oBAAqB,MAAM,KAAK,QAAQ,SAAS;AAC/D,MAAI,QAAQ,oBAAoB,OAAO;AACrC,UAAM,IAAI,MAAM,GAAG,eAAe,sCAAsC;AAAA,EAC1E;AACA,SAAOF,SAAQ,MAAM,KAAK,GAAG,QAAQ;AACvC;AAMO,SAAS,UAAWG,MAAK,OAAO;AACrC,EAAK,gBAAgBA,MAAK,KAAK,IAAI,cAAc,MAAM,KAAK;AAC9D;AAIA,UAAU,gBAAqB,WAAW;AAM1C,UAAU,cAAc,SAASC,aAAa,OAAO;AACnD,SAAY,gBAAgB,YAAY,MAAM,KAAK;AACrD;;;ACjGO,SAAS,iBAAkB,OAAO,MAAM,OAAO,UAAU;AAC9D,SAAO,IAAI,MAAM,KAAK,KAAK,OAAO,CAAC;AACrC;AASO,SAAS,WAAY,MAAM,KAAK,QAAQ,SAAS;AACtD,SAAO,IAAI,MAAM,KAAK,KAAU,UAAU,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACtE;AASO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,SAAO,IAAI,MAAM,KAAK,KAAU,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACvE;AASO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,SAAO,IAAI,MAAM,KAAK,KAAU,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACvE;AASO,SAAS,YAAa,MAAM,KAAK,QAAQ,SAAS;AACvD,SAAO,IAAI,MAAM,KAAK,KAAU,WAAW,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC;AACvE;AAMO,SAAS,UAAWC,MAAK,OAAO;AACrC,EAAK,gBAAgBA,MAAK,KAAK,IAAI,cAAc,MAAM,KAAK;AAC9D;AAEA,UAAU,gBAAqB,WAAW;AAM1C,UAAU,cAAc,SAASC,aAAa,OAAO;AACnD,SAAY,gBAAgB,YAAY,MAAM,KAAK;AACrD;;;AClEA,IAAM,cAAc;AACpB,IAAM,aAAa;AACnB,IAAM,aAAa;AACnB,IAAM,kBAAkB;AASjB,SAAS,gBAAiB,OAAO,MAAM,QAAQ,SAAS;AAC7D,MAAI,QAAQ,mBAAmB,OAAO;AACpC,UAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC;AAAA,EACzE,WAAW,QAAQ,0BAA0B,MAAM;AACjD,WAAO,IAAI,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,EACrC;AACA,SAAO,IAAI,MAAM,KAAK,WAAW,QAAW,CAAC;AAC/C;AASO,SAAS,YAAa,OAAO,MAAM,QAAQ,SAAS;AACzD,MAAI,QAAQ,oBAAoB,OAAO;AACrC,UAAM,IAAI,MAAM,GAAG,eAAe,sCAAsC;AAAA,EAC1E;AACA,SAAO,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAC3C;AAQA,SAAS,YAAa,OAAOC,QAAO,SAAS;AAC3C,MAAI,SAAS;AACX,QAAI,QAAQ,aAAa,SAAS,OAAO,MAAM,KAAK,GAAG;AACrD,YAAM,IAAI,MAAM,GAAG,eAAe,+BAA+B;AAAA,IACnE;AACA,QAAI,QAAQ,kBAAkB,UAAU,UAAU,YAAY,UAAU,YAAY;AAClF,YAAM,IAAI,MAAM,GAAG,eAAe,oCAAoC;AAAA,IACxE;AAAA,EACF;AACA,SAAO,IAAI,MAAM,KAAK,OAAO,OAAOA,MAAK;AAC3C;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAO,YAAY,YAAY,MAAM,MAAM,CAAC,GAAG,GAAG,OAAO;AAC3D;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAO,YAAY,YAAY,MAAM,MAAM,CAAC,GAAG,GAAG,OAAO;AAC3D;AASO,SAAS,cAAe,MAAM,KAAK,QAAQ,SAAS;AACzD,SAAO,YAAY,YAAY,MAAM,MAAM,CAAC,GAAG,GAAG,OAAO;AAC3D;AAOO,SAAS,YAAaC,MAAK,OAAO,SAAS;AAChD,QAAM,QAAQ,MAAM;AAEpB,MAAI,UAAU,OAAO;AACnB,IAAAA,KAAI,KAAK,CAAC,KAAK,MAAM,eAAe,WAAW,CAAC;AAAA,EAClD,WAAW,UAAU,MAAM;AACzB,IAAAA,KAAI,KAAK,CAAC,KAAK,MAAM,eAAe,UAAU,CAAC;AAAA,EACjD,WAAW,UAAU,MAAM;AACzB,IAAAA,KAAI,KAAK,CAAC,KAAK,MAAM,eAAe,UAAU,CAAC;AAAA,EACjD,WAAW,UAAU,QAAW;AAC9B,IAAAA,KAAI,KAAK,CAAC,KAAK,MAAM,eAAe,eAAe,CAAC;AAAA,EACtD,OAAO;AACL,QAAI;AACJ,QAAI,UAAU;AACd,QAAI,CAAC,WAAW,QAAQ,YAAY,MAAM;AACxC,oBAAc,KAAK;AACnB,gBAAU,YAAY,MAAM,CAAC;AAC7B,UAAI,UAAU,WAAW,OAAO,MAAM,KAAK,GAAG;AAC5C,aAAK,CAAC,IAAI;AACV,QAAAA,KAAI,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC;AACzB,kBAAU;AAAA,MACZ,OAAO;AACL,sBAAc,KAAK;AACnB,kBAAU,YAAY,MAAM,CAAC;AAC7B,YAAI,UAAU,SAAS;AACrB,eAAK,CAAC,IAAI;AACV,UAAAA,KAAI,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC;AACzB,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,SAAS;AACZ,oBAAc,KAAK;AACnB,gBAAU,YAAY,MAAM,CAAC;AAC7B,WAAK,CAAC,IAAI;AACV,MAAAA,KAAI,KAAK,KAAK,MAAM,GAAG,CAAC,CAAC;AAAA,IAC3B;AAAA,EACF;AACF;AAOA,YAAY,cAAc,SAASC,aAAa,OAAO,SAAS;AAC9D,QAAM,QAAQ,MAAM;AAEpB,MAAI,UAAU,SAAS,UAAU,QAAQ,UAAU,QAAQ,UAAU,QAAW;AAC9E,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,WAAW,QAAQ,YAAY,MAAM;AACxC,kBAAc,KAAK;AACnB,QAAI,UAAU,YAAY,MAAM,CAAC;AACjC,QAAI,UAAU,WAAW,OAAO,MAAM,KAAK,GAAG;AAC5C,aAAO;AAAA,IACT;AACA,kBAAc,KAAK;AACnB,cAAU,YAAY,MAAM,CAAC;AAC7B,QAAI,UAAU,SAAS;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAM,SAAS,IAAI,YAAY,CAAC;AAChC,IAAM,WAAW,IAAI,SAAS,QAAQ,CAAC;AACvC,IAAM,OAAO,IAAI,WAAW,QAAQ,CAAC;AAKrC,SAAS,cAAe,KAAK;AAC3B,MAAI,QAAQ,UAAU;AACpB,aAAS,UAAU,GAAG,OAAQ,KAAK;AAAA,EACrC,WAAW,QAAQ,WAAW;AAC5B,aAAS,UAAU,GAAG,OAAQ,KAAK;AAAA,EACrC,WAAW,OAAO,MAAM,GAAG,GAAG;AAC5B,aAAS,UAAU,GAAG,OAAQ,KAAK;AAAA,EACrC,OAAO;AACL,aAAS,WAAW,GAAG,GAAG;AAC1B,UAAM,SAAS,SAAS,UAAU,CAAC;AACnC,UAAM,YAAY,SAAS,eAAe;AAC1C,UAAM,WAAW,SAAS;AAG1B,QAAI,aAAa,KAAM;AAErB,eAAS,UAAU,GAAG,OAAQ,KAAK;AAAA,IACrC,WAAW,aAAa,GAAM;AAE5B,eAAS,UAAU,IAAK,MAAM,eAAe,KAAO,YAAY,IAAK,KAAK;AAAA,IAC5E,OAAO;AAEL,YAAM,kBAAkB,WAAW;AAGnC,UAAI,kBAAkB,KAAK;AAKzB,iBAAS,UAAU,GAAG,CAAC;AAAA,MACzB,WAAW,kBAAkB,KAAK;AAIhC,iBAAS,UAAU,IAAK,SAAS,eAAe;AAAA,QAAsB,KAAM,KAAK,iBAAmB,KAAK;AAAA,MAC3G,OAAO;AACL,iBAAS,UAAU,IAAK,SAAS,eAAe,KAAQ,kBAAkB,MAAO,KAAO,YAAY,IAAK,KAAK;AAAA,MAChH;AAAA,IACF;AAAA,EACF;AACF;AAOA,SAAS,YAAaC,OAAM,KAAK;AAC/B,MAAIA,MAAK,SAAS,MAAM,GAAG;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,8BAA8B;AAAA,EAClE;AAEA,QAAM,QAAQA,MAAK,GAAG,KAAK,KAAKA,MAAK,MAAM,CAAC;AAC5C,MAAI,SAAS,OAAQ;AACnB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,OAAQ;AACnB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,OAAQ;AACnB,WAAO;AAAA,EACT;AACA,QAAM,MAAO,QAAQ,KAAM;AAC3B,QAAM,OAAO,OAAO;AACpB,MAAI;AACJ,MAAI,QAAQ,GAAG;AACb,UAAM,OAAQ,KAAK;AAAA,EACrB,WAAW,QAAQ,IAAI;AACrB,WAAO,OAAO,QAAS,MAAM,MAAM;AAAA,EAErC,OAAO;AAEL,UAAM,SAAS,IAAI,WAAW;AAAA,EAChC;AACA,SAAQ,OAAO,QAAU,CAAC,MAAM;AAClC;AAKA,SAAS,cAAe,KAAK;AAC3B,WAAS,WAAW,GAAG,KAAK,KAAK;AACnC;AAOA,SAAS,YAAaA,OAAM,KAAK;AAC/B,MAAIA,MAAK,SAAS,MAAM,GAAG;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,8BAA8B;AAAA,EAClE;AACA,QAAM,UAAUA,MAAK,cAAc,KAAK;AACxC,SAAO,IAAI,SAASA,MAAK,QAAQ,QAAQ,CAAC,EAAE,WAAW,GAAG,KAAK;AACjE;AAKA,SAAS,cAAe,KAAK;AAC3B,WAAS,WAAW,GAAG,KAAK,KAAK;AACnC;AAOA,SAAS,YAAaA,OAAM,KAAK;AAC/B,MAAIA,MAAK,SAAS,MAAM,GAAG;AACzB,UAAM,IAAI,MAAM,GAAG,eAAe,8BAA8B;AAAA,EAClE;AACA,QAAM,UAAUA,MAAK,cAAc,KAAK;AACxC,SAAO,IAAI,SAASA,MAAK,QAAQ,QAAQ,CAAC,EAAE,WAAW,GAAG,KAAK;AACjE;AAOA,YAAY,gBAAgB,WAAW;;;ACxRvC,SAAS,aAAc,MAAM,KAAK,OAAO;AACvC,QAAM,IAAI,MAAM,GAAG,eAAe,+BAA+B,KAAK,eAAe,KAAK,GAAG,MAAM,CAAC,EAAE;AACxG;AAMA,SAAS,QAAS,KAAK;AACrB,SAAO,MAAM;AAAE,UAAM,IAAI,MAAM,GAAG,eAAe,IAAI,GAAG,EAAE;AAAA,EAAE;AAC9D;AAGO,IAAM,OAAO,CAAC;AAGrB,SAAS,IAAI,GAAG,KAAK,IAAM,KAAK;AAC9B,OAAK,CAAC,IAAI;AACZ;AACA,KAAK,EAAI,IAAS;AAClB,KAAK,EAAI,IAAS;AAClB,KAAK,EAAI,IAAS;AAClB,KAAK,EAAI,IAAS;AAClB,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AAEb,SAAS,IAAI,IAAM,KAAK,IAAM,KAAK;AACjC,OAAK,CAAC,IAAI;AACZ;AACA,KAAK,EAAI,IAAW;AACpB,KAAK,EAAI,IAAW;AACpB,KAAK,EAAI,IAAW;AACpB,KAAK,EAAI,IAAW;AACpB,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AAEb,SAAS,IAAI,IAAM,KAAK,IAAM,KAAK;AACjC,OAAK,CAAC,IAAU;AAClB;AACA,KAAK,EAAI,IAAU;AACnB,KAAK,EAAI,IAAU;AACnB,KAAK,EAAI,IAAU;AACnB,KAAK,EAAI,IAAU;AACnB,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI;AACb,KAAK,EAAI,IAAI,QAAQ,mDAAmD;AAExE,SAAS,IAAI,IAAM,KAAK,KAAM,KAAK;AACjC,OAAK,CAAC,IAAW;AACnB;AACA,KAAK,GAAI,IAAW;AACpB,KAAK,GAAI,IAAW;AACpB,KAAK,GAAI,IAAW;AACpB,KAAK,GAAI,IAAW;AACpB,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI,QAAQ,mDAAmD;AAExE,SAAS,IAAI,KAAM,KAAK,KAAM,KAAK;AACjC,OAAK,CAAC,IAAU;AAClB;AACA,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAU;AAEnB,SAAS,IAAI,KAAM,KAAK,KAAM,KAAK;AACjC,OAAK,CAAC,IAAQ;AAChB;AACA,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAQ;AAEjB,SAAS,IAAI,KAAM,KAAK,KAAM,KAAK;AACjC,OAAK,CAAC,IAAQ;AAChB;AACA,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAQ;AACjB,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AAEb,SAAS,IAAI,KAAM,KAAK,KAAM,KAAK;AACjC,OAAK,CAAC,IAAI,QAAQ,iCAAiC;AACrD;AACA,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAI,QAAQ,iCAAiC;AACtD,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAU;AACnB,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAI;AACb,KAAK,GAAI,IAAU;AAGZ,IAAM,QAAQ,CAAC;AAEtB,SAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAM,CAAC,IAAI,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC;AACtC;AAEA,SAAS,IAAI,IAAI,KAAK,KAAK,KAAK;AAC9B,QAAM,KAAK,CAAC,IAAI,IAAI,MAAM,KAAK,QAAQ,GAAG,CAAC;AAC7C;AAEA,MAAM,EAAI,IAAI,IAAI,MAAM,KAAK,OAAO,IAAI,WAAW,CAAC,GAAG,CAAC;AAExD,MAAM,EAAI,IAAI,IAAI,MAAM,KAAK,QAAQ,IAAI,CAAC;AAE1C,MAAM,GAAI,IAAI,IAAI,MAAM,KAAK,OAAO,GAAG,CAAC;AAExC,MAAM,GAAI,IAAI,IAAI,MAAM,KAAK,KAAK,GAAG,CAAC;AAEtC,MAAM,GAAI,IAAI,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC;AAE5C,MAAM,GAAI,IAAI,IAAI,MAAM,KAAK,MAAM,MAAM,CAAC;AAE1C,MAAM,GAAI,IAAI,IAAI,MAAM,KAAK,MAAM,MAAM,CAAC;AAMnC,SAAS,iBAAkB,OAAO;AACvC,UAAQ,MAAM,MAAM;AAAA,IAClB,KAAK,KAAK;AACR,aAAO,UAAU,CAAC,GAAI,CAAC;AAAA,IACzB,KAAK,KAAK;AACR,aAAO,UAAU,CAAC,GAAI,CAAC;AAAA,IACzB,KAAK,KAAK;AACR,aAAO,UAAU,CAAC,GAAI,CAAC;AAAA,IACzB,KAAK,KAAK;AACR,UAAI,CAAC,MAAM,MAAM,QAAQ;AACvB,eAAO,UAAU,CAAC,EAAI,CAAC;AAAA,MACzB;AACA;AAAA,IACF,KAAK,KAAK;AACR,UAAI,MAAM,UAAU,IAAI;AACtB,eAAO,UAAU,CAAC,EAAI,CAAC;AAAA,MACzB;AACA;AAAA,IACF,KAAK,KAAK;AACR,UAAI,MAAM,UAAU,GAAG;AACrB,eAAO,UAAU,CAAC,GAAI,CAAC;AAAA,MACzB;AAGA;AAAA,IACF,KAAK,KAAK;AACR,UAAI,MAAM,UAAU,GAAG;AACrB,eAAO,UAAU,CAAC,GAAI,CAAC;AAAA,MACzB;AAGA;AAAA,IACF,KAAK,KAAK;AACR,UAAI,MAAM,QAAQ,IAAI;AACpB,eAAO,UAAU,CAAC,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,MACxC;AACA;AAAA,IACF,KAAK,KAAK;AACR,UAAI,MAAM,SAAS,KAAK;AACtB,eAAO,UAAU,CAAC,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,MAC7C;AAAA,EACJ;AACF;;;ACtLA,IAAM,uBAAuB;AAAA,EAC3B,SAAS;AAAA,EACT;AAAA,EACA;AACF;AAGO,SAAS,mBAAoB;AAClC,QAAM,WAAW,CAAC;AAClB,WAAS,KAAK,KAAK,KAAK,IAAI;AAC5B,WAAS,KAAK,OAAO,KAAK,IAAI;AAC9B,WAAS,KAAK,MAAM,KAAK,IAAI;AAC7B,WAAS,KAAK,OAAO,KAAK,IAAI;AAC9B,WAAS,KAAK,MAAM,KAAK,IAAI;AAC7B,WAAS,KAAK,IAAI,KAAK,IAAI;AAC3B,WAAS,KAAK,IAAI,KAAK,IAAI;AAC3B,WAAS,KAAK,MAAM,KAAK,IAAI;AAC7B,SAAO;AACT;AAEA,IAAM,eAAe,iBAAiB;AAEtC,IAAM,MAAM,IAAI,GAAG;AAGnB,IAAM,MAAN,MAAM,KAAI;AAAA;AAAA;AAAA;AAAA;AAAA,EAKR,YAAa,KAAK,QAAQ;AACxB,SAAK,MAAM;AACX,SAAK,SAAS;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAU,KAAK;AAEb,QAAI,IAAI;AACR,OAAG;AACD,UAAI,EAAE,QAAQ,KAAK;AACjB,eAAO;AAAA,MACT;AAAA,IACF,SAAS,IAAI,EAAE;AACf,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,YAAa,OAAO,KAAK;AAC9B,QAAI,SAAS,MAAM,SAAS,GAAG,GAAG;AAChC,YAAM,IAAI,MAAM,GAAG,eAAe,sCAAsC;AAAA,IAC1E;AACA,WAAO,IAAI,KAAI,KAAK,KAAK;AAAA,EAC3B;AACF;AAEA,IAAM,eAAe;AAAA,EACnB,MAAM,IAAI,MAAM,KAAK,MAAM,IAAI;AAAA,EAC/B,WAAW,IAAI,MAAM,KAAK,WAAW,MAAS;AAAA,EAC9C,MAAM,IAAI,MAAM,KAAK,MAAM,IAAI;AAAA,EAC/B,OAAO,IAAI,MAAM,KAAK,OAAO,KAAK;AAAA,EAClC,YAAY,IAAI,MAAM,KAAK,OAAO,CAAC;AAAA,EACnC,UAAU,IAAI,MAAM,KAAK,KAAK,CAAC;AACjC;AAGA,IAAM,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQnB,OAAQ,KAAK,MAAM,UAAU,WAAW;AACtC,QAAI,CAAC,OAAO,UAAU,GAAG,KAAK,CAAC,OAAO,cAAc,GAAG,GAAG;AACxD,aAAO,IAAI,MAAM,KAAK,OAAO,GAAG;AAAA,IAClC,WAAW,OAAO,GAAG;AACnB,aAAO,IAAI,MAAM,KAAK,MAAM,GAAG;AAAA,IACjC,OAAO;AACL,aAAO,IAAI,MAAM,KAAK,QAAQ,GAAG;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAQ,KAAK,MAAM,UAAU,WAAW;AACtC,QAAI,OAAO,OAAO,CAAC,GAAG;AACpB,aAAO,IAAI,MAAM,KAAK,MAAM,GAAG;AAAA,IACjC,OAAO;AACL,aAAO,IAAI,MAAM,KAAK,QAAQ,GAAG;AAAA,IACnC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAY,KAAK,MAAM,UAAU,WAAW;AAC1C,WAAO,IAAI,MAAM,KAAK,OAAO,GAAG;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAQ,KAAK,MAAM,UAAU,WAAW;AACtC,WAAO,IAAI,MAAM,KAAK,QAAQ,GAAG;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAS,KAAK,MAAM,UAAU,WAAW;AACvC,WAAO,MAAM,aAAa,OAAO,aAAa;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,KAAM,MAAM,MAAM,UAAU,WAAW;AACrC,WAAO,aAAa;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,UAAW,MAAM,MAAM,UAAU,WAAW;AAC1C,WAAO,aAAa;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAa,KAAK,MAAM,UAAU,WAAW;AAC3C,WAAO,IAAI,MAAM,KAAK,OAAO,IAAI,WAAW,GAAG,CAAC;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAU,KAAK,MAAM,UAAU,WAAW;AACxC,WAAO,IAAI,MAAM,KAAK,OAAO,IAAI,WAAW,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU,CAAC;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAO,KAAK,MAAM,SAAS,UAAU;AACnC,QAAI,CAAC,IAAI,QAAQ;AACf,UAAI,QAAQ,mBAAmB,MAAM;AACnC,eAAO,CAAC,aAAa,YAAY,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,MACxD;AACA,aAAO,aAAa;AAAA,IACtB;AACA,eAAW,IAAI,YAAY,UAAU,GAAG;AACxC,UAAM,UAAU,CAAC;AACjB,QAAI,IAAI;AACR,eAAWC,MAAK,KAAK;AACnB,cAAQ,GAAG,IAAI,eAAeA,IAAG,SAAS,QAAQ;AAAA,IACpD;AACA,QAAI,QAAQ,gBAAgB;AAC1B,aAAO,CAAC,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,GAAG,SAAS,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,IAC3E;AACA,WAAO,CAAC,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,GAAG,OAAO;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAQ,KAAK,KAAK,SAAS,UAAU;AAEnC,UAAM,QAAQ,QAAQ;AAEtB,UAAMC,QAAO,QAAQ,IAAI,KAAK,IAAI,OAAO,KAAK,GAAG;AACjD,UAAMC,UAAS,QAAQ,IAAI,OAAOD,MAAK;AACvC,QAAI,CAACC,SAAQ;AACX,UAAI,QAAQ,mBAAmB,MAAM;AACnC,eAAO,CAAC,aAAa,UAAU,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,MACtD;AACA,aAAO,aAAa;AAAA,IACtB;AACA,eAAW,IAAI,YAAY,UAAU,GAAG;AAExC,UAAM,UAAU,CAAC;AACjB,QAAI,IAAI;AACR,eAAW,OAAOD,OAAM;AACtB,cAAQ,GAAG,IAAI;AAAA,QACb,eAAe,KAAK,SAAS,QAAQ;AAAA,QACrC,eAAe,QAAQ,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,GAAG,SAAS,QAAQ;AAAA,MACnE;AAAA,IACF;AACA,mBAAe,SAAS,OAAO;AAC/B,QAAI,QAAQ,gBAAgB;AAC1B,aAAO,CAAC,IAAI,MAAM,KAAK,KAAKC,OAAM,GAAG,SAAS,IAAI,MAAM,KAAK,KAAK,CAAC;AAAA,IACrE;AACA,WAAO,CAAC,IAAI,MAAM,KAAK,KAAKA,OAAM,GAAG,OAAO;AAAA,EAC9C;AACF;AAEA,aAAa,MAAM,aAAa;AAChC,aAAa,SAAS,aAAa;AACnC,WAAW,OAAO,iFAAiF,MAAM,GAAG,GAAG;AAC7G,eAAa,GAAG,GAAG,OAAO,IAAI,aAAa;AAC7C;AAQA,SAAS,eAAgB,KAAK,UAAU,CAAC,GAAG,UAAU;AACpD,QAAM,MAAM,GAAG,GAAG;AAClB,QAAM,oBAAqB,WAAW,QAAQ;AAAA,EAAmD,QAAQ,aAAa,GAAG,KAAM,aAAa,GAAG;AAC/I,MAAI,OAAO,sBAAsB,YAAY;AAC3C,UAAM,SAAS,kBAAkB,KAAK,KAAK,SAAS,QAAQ;AAC5D,QAAI,UAAU,MAAM;AAClB,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,cAAc,aAAa,GAAG;AACpC,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI,MAAM,GAAG,eAAe,sBAAsB,GAAG,EAAE;AAAA,EAC/D;AACA,SAAO,YAAY,KAAK,KAAK,SAAS,QAAQ;AAChD;AAyEA,SAAS,eAAgB,SAAS,SAAS;AACzC,MAAI,QAAQ,WAAW;AACrB,YAAQ,KAAK,QAAQ,SAAS;AAAA,EAChC;AACF;AAOA,SAAS,UAAW,IAAI,IAAI;AAI1B,QAAM,YAAY,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC;AACxD,QAAM,YAAY,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC;AAGxD,MAAI,UAAU,SAAS,UAAU,MAAM;AACrC,WAAO,UAAU,KAAK,QAAQ,UAAU,IAAI;AAAA,EAC9C;AAEA,QAAM,QAAQ,UAAU,KAAK;AAE7B,QAAM,OAAO,aAAa,KAAK,EAAE,cAAc,WAAW,SAAS;AAEnE,MAAI,SAAS,GAAG;AAGd,YAAQ,KAAK,uEAAuE;AAAA,EACtF;AACA,SAAO;AACT;AAQA,SAAS,gBAAiBC,MAAK,QAAQ,UAAU,SAAS;AACxD,MAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,eAAW,SAAS,QAAQ;AAC1B,sBAAgBA,MAAK,OAAO,UAAU,OAAO;AAAA,IAC/C;AAAA,EACF,OAAO;AACL,aAAS,OAAO,KAAK,KAAK,EAAEA,MAAK,QAAQ,OAAO;AAAA,EAClD;AACF;AAQA,SAAS,aAAc,MAAM,UAAU,SAAS;AAC9C,QAAM,SAAS,eAAe,MAAM,OAAO;AAC3C,MAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,QAAQ,kBAAkB;AACtD,UAAM,aAAa,QAAQ,iBAAiB,MAAM;AAClD,QAAI,YAAY;AACd,aAAO;AAAA,IACT;AACA,UAAM,UAAU,SAAS,OAAO,KAAK,KAAK;AAC1C,QAAI,QAAQ,aAAa;AACvB,YAAM,OAAO,QAAQ,YAAY,QAAQ,OAAO;AAChD,YAAMA,OAAM,IAAI,GAAG,IAAI;AACvB,cAAQA,MAAK,QAAQ,OAAO;AAG5B,UAAIA,KAAI,OAAO,WAAW,GAAG;AAC3B,cAAM,IAAI,MAAM,+CAA+C,MAAM,YAAY;AAAA,MACnF;AACA,aAAO,MAAMA,KAAI,OAAO,CAAC,CAAC;AAAA,IAC5B;AAAA,EACF;AACA,MAAI,MAAM;AACV,kBAAgB,KAAK,QAAQ,UAAU,OAAO;AAC9C,SAAO,IAAI,QAAQ,IAAI;AACzB;AAOA,SAAS,OAAQ,MAAM,SAAS;AAC9B,YAAU,OAAO,OAAO,CAAC,GAAG,sBAAsB,OAAO;AACzD,SAAO,aAAa,MAAM,cAAc,OAAO;AACjD;;;ACncA,IAAM,uBAAuB;AAAA,EAC3B,QAAQ;AAAA,EACR,iBAAiB;AAAA,EACjB,gBAAgB;AAAA,EAChB,aAAa;AACf;AAKA,IAAM,YAAN,MAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKd,YAAa,MAAM,UAAU,CAAC,GAAG;AAC/B,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,MAAO;AACL,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OAAQ;AACN,WAAO,KAAK,QAAQ,KAAK,KAAK;AAAA,EAChC;AAAA,EAEA,OAAQ;AACN,UAAM,MAAM,KAAK,KAAK,KAAK,IAAI;AAC/B,QAAI,QAAQ,MAAM,GAAG;AACrB,QAAI,UAAU,QAAW;AACvB,YAAM,UAAU,KAAK,GAAG;AAGxB,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,GAAG,eAAe,8BAA8B,QAAQ,CAAC,YAAY,IAAI,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,GAAG;AAAA,MAC3H;AACA,YAAM,QAAQ,MAAM;AACpB,cAAQ,QAAQ,KAAK,MAAM,KAAK,MAAM,OAAO,KAAK,OAAO;AAAA,IAC3D;AAEA,SAAK,QAAQ,MAAM;AACnB,WAAO;AAAA,EACT;AACF;AAEA,IAAM,OAAO,OAAO,IAAI,MAAM;AAC9B,IAAM,QAAQ,OAAO,IAAI,OAAO;AAQhC,SAAS,aAAc,OAAO,WAAW,SAAS;AAChD,QAAM,MAAM,CAAC;AACb,WAAS,IAAI,GAAG,IAAI,MAAM,OAAO,KAAK;AACpC,UAAM,QAAQ,eAAe,WAAW,OAAO;AAC/C,QAAI,UAAU,OAAO;AACnB,UAAI,MAAM,UAAU,UAAU;AAE5B;AAAA,MACF;AACA,YAAM,IAAI,MAAM,GAAG,eAAe,yCAAyC;AAAA,IAC7E;AACA,QAAI,UAAU,MAAM;AAClB,YAAM,IAAI,MAAM,GAAG,eAAe,4CAA4C,CAAC,cAAc,MAAM,KAAK,GAAG;AAAA,IAC7G;AACA,QAAI,CAAC,IAAI;AAAA,EACX;AACA,SAAO;AACT;AAQA,SAAS,WAAY,OAAO,WAAW,SAAS;AAC9C,QAAM,UAAU,QAAQ,YAAY;AACpC,QAAM,MAAM,UAAU,SAAY,CAAC;AACnC,QAAMC,KAAI,UAAU,oBAAI,IAAI,IAAI;AAChC,WAAS,IAAI,GAAG,IAAI,MAAM,OAAO,KAAK;AACpC,UAAM,MAAM,eAAe,WAAW,OAAO;AAC7C,QAAI,QAAQ,OAAO;AACjB,UAAI,MAAM,UAAU,UAAU;AAE5B;AAAA,MACF;AACA,YAAM,IAAI,MAAM,GAAG,eAAe,uCAAuC;AAAA,IAC3E;AACA,QAAI,QAAQ,MAAM;AAChB,YAAM,IAAI,MAAM,GAAG,eAAe,0CAA0C,CAAC,uBAAuB,MAAM,KAAK,GAAG;AAAA,IACpH;AACA,QAAI,YAAY,QAAQ,OAAO,QAAQ,UAAU;AAC/C,YAAM,IAAI,MAAM,GAAG,eAAe,uCAAuC,OAAO,GAAG,GAAG;AAAA,IACxF;AACA,QAAI,QAAQ,2BAA2B,MAAM;AAE3C,UAAK,WAAWA,GAAE,IAAI,GAAG,KAAO,CAAC,WAAY,OAAO,KAAO;AACzD,cAAM,IAAI,MAAM,GAAG,eAAe,0BAA0B,GAAG,GAAG;AAAA,MACpE;AAAA,IACF;AACA,UAAM,QAAQ,eAAe,WAAW,OAAO;AAC/C,QAAI,UAAU,MAAM;AAClB,YAAM,IAAI,MAAM,GAAG,eAAe,0CAA0C,CAAC,yBAAyB,MAAM,KAAK,GAAG;AAAA,IACtH;AACA,QAAI,SAAS;AAEX,MAAAA,GAAE,IAAI,KAAK,KAAK;AAAA,IAClB,OAAO;AAEL,UAAI,GAAG,IAAI;AAAA,IACb;AAAA,EACF;AAEA,SAAO,UAAUA,KAAI;AACvB;AAOA,SAAS,eAAgB,WAAW,SAAS;AAG3C,MAAI,UAAU,KAAK,GAAG;AACpB,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,UAAU,KAAK;AAE7B,MAAI,MAAM,SAAS,KAAK,OAAO;AAC7B,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,KAAK,UAAU;AACvB,WAAO,MAAM;AAAA,EACf;AAEA,MAAI,MAAM,SAAS,KAAK,OAAO;AAC7B,WAAO,aAAa,OAAO,WAAW,OAAO;AAAA,EAC/C;AAEA,MAAI,MAAM,SAAS,KAAK,KAAK;AAC3B,WAAO,WAAW,OAAO,WAAW,OAAO;AAAA,EAC7C;AAEA,MAAI,MAAM,SAAS,KAAK,KAAK;AAC3B,QAAI,QAAQ,QAAQ,OAAO,QAAQ,KAAK,MAAM,KAAK,MAAM,YAAY;AACnE,YAAM,SAAS,eAAe,WAAW,OAAO;AAChD,aAAO,QAAQ,KAAK,MAAM,KAAK,EAAE,MAAM;AAAA,IACzC;AACA,UAAM,IAAI,MAAM,GAAG,eAAe,uBAAuB,MAAM,KAAK,GAAG;AAAA,EACzE;AAEA,QAAM,IAAI,MAAM,aAAa;AAC/B;AAOA,SAAS,YAAa,MAAM,SAAS;AACnC,MAAI,EAAE,gBAAgB,aAAa;AACjC,UAAM,IAAI,MAAM,GAAG,eAAe,sCAAsC;AAAA,EAC1E;AACA,YAAU,OAAO,OAAO,CAAC,GAAG,sBAAsB,OAAO;AACzD,QAAM,YAAY,QAAQ,aAAa,IAAI,UAAU,MAAM,OAAO;AAClE,QAAM,UAAU,eAAe,WAAW,OAAO;AACjD,MAAI,YAAY,MAAM;AACpB,UAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC;AAAA,EACzE;AACA,MAAI,YAAY,OAAO;AACrB,UAAM,IAAI,MAAM,GAAG,eAAe,uBAAuB;AAAA,EAC3D;AACA,SAAO,CAAC,SAAS,KAAK,SAAS,UAAU,IAAI,CAAC,CAAC;AACjD;AAOA,SAAS,OAAQ,MAAM,SAAS;AAC9B,QAAM,CAAC,SAAS,SAAS,IAAI,YAAY,MAAM,OAAO;AACtD,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,IAAI,MAAM,GAAG,eAAe,0CAA0C;AAAA,EAC9E;AACA,SAAO;AACT;;;ACnMA,IAAM,cAAN,cAA0B,MAAM;AAAA,EAC9B,cAAe;AACb,UAAM;AAEN,SAAK,cAAc,CAAC;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAQC,MAAK;AACX,UAAM,SAAS,KAAK,YAAY,KAAK,YAAY,SAAS,CAAC;AAC3D,QAAI,QAAQ;AACV,UAAI,OAAO,SAAS,KAAK,OAAO;AAC9B,eAAO;AACP,YAAI,OAAO,aAAa,GAAG;AACzB,UAAAA,KAAI,KAAK,CAAC,EAAE,CAAC;AAAA,QACf;AAAA,MACF;AACA,UAAI,OAAO,SAAS,KAAK,KAAK;AAC5B,eAAO;AACP,YAAI,OAAO,aAAa,GAAG;AACzB,cAAI,OAAO,WAAW,MAAM,GAAG;AAC7B,YAAAA,KAAI,KAAK,CAAC,EAAE,CAAC;AAAA,UACf,OAAO;AACL,YAAAA,KAAI,KAAK,CAAC,EAAE,CAAC;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,KAAK,KAAK,EAAGA,MAAK,OAAO;AAC7B,SAAK,OAAOA,IAAG;AACf,UAAMC,MAAK,OAAO,MAAM,KAAK;AAC7B,UAAM,MAAM,CAAC;AACb,aAAS,IAAI,GAAG,IAAIA,IAAG,QAAQ,KAAK;AAClC,UAAI,CAAC,IAAIA,IAAG,WAAW,CAAC;AAAA,IAC1B;AACA,IAAAD,KAAI,KAAK,GAAG;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,OAAO,KAAK,EAAGA,MAAK,OAAO;AAE/B,SAAK,KAAK,KAAK,KAAK,EAAEA,MAAK,KAAK;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,MAAM,KAAK,EAAG,MAAM,QAAQ;AAChC,UAAM,IAAI,MAAM,GAAG,eAAe,+BAA+B;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,OAAO,KAAK,EAAGA,MAAK,OAAO;AAC/B,SAAK,OAAOA,IAAG;AAIf,UAAM,OAAO,WAAW,KAAK,UAAU,MAAM,KAAK,CAAC;AACnD,IAAAA,KAAI,KAAK,KAAK,SAAS,KAAK,MAAM,IAAI,IAAI,IAAI;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,MAAM,KAAK,EAAGA,MAAK,QAAQ;AAC/B,SAAK,OAAOA,IAAG;AACf,SAAK,YAAY,KAAK,EAAE,MAAM,KAAK,OAAO,UAAU,EAAE,CAAC;AACvD,IAAAA,KAAI,KAAK,CAAC,EAAE,CAAC;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,IAAI,KAAK,EAAGA,MAAK,QAAQ;AAC7B,SAAK,OAAOA,IAAG;AACf,SAAK,YAAY,KAAK,EAAE,MAAM,KAAK,KAAK,UAAU,EAAE,CAAC;AACrD,IAAAA,KAAI,KAAK,CAAC,GAAG,CAAC;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,CAAC,KAAK,IAAI,KAAK,EAAG,MAAM,QAAQ;AAAA,EAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMjC,CAAC,KAAK,MAAM,KAAK,EAAGA,MAAK,OAAO;AAC9B,QAAI,MAAM,KAAK,SAAS,SAAS;AAC/B,YAAM,SAAS,KAAK,YAAY,IAAI;AACpC,UAAI,QAAQ;AACV,YAAI,OAAO,SAAS,KAAK,OAAO;AAC9B,UAAAA,KAAI,KAAK,CAAC,EAAE,CAAC;AAAA,QACf,WAAW,OAAO,SAAS,KAAK,KAAK;AACnC,UAAAA,KAAI,KAAK,CAAC,GAAG,CAAC;AAAA,QAEhB,OAAO;AACL,gBAAM,IAAI,MAAM,oDAAoD;AAAA,QACtE;AACA;AAAA,MACF;AAEA,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,QAAI,MAAM,UAAU,QAAW;AAC7B,YAAM,IAAI,MAAM,GAAG,eAAe,8BAA8B;AAAA,IAClE;AAEA,SAAK,OAAOA,IAAG;AACf,QAAI,MAAM,KAAK,SAAS,QAAQ;AAC9B,MAAAA,KAAI,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAC7B;AAAA,IACF,WAAW,MAAM,KAAK,SAAS,SAAS;AACtC,MAAAA,KAAI,KAAK,CAAC,KAAK,IAAI,KAAK,KAAK,GAAG,CAAC;AACjC;AAAA,IACF,WAAW,MAAM,KAAK,SAAS,QAAQ;AACrC,MAAAA,KAAI,KAAK,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAC7B;AAAA,IACF;AAGA,UAAMC,MAAK,OAAO,MAAM,KAAK;AAC7B,UAAM,MAAM,CAAC;AACb,QAAI,KAAK;AACT,aAAS,IAAI,GAAG,IAAIA,IAAG,QAAQ,KAAK;AAClC,UAAI,CAAC,IAAIA,IAAG,WAAW,CAAC;AACxB,UAAI,CAAC,OAAO,IAAI,CAAC,MAAM,MAAM,IAAI,CAAC,MAAM,OAAO,IAAI,CAAC,MAAM,KAAK;AAC7D,aAAK;AAAA,MACP;AAAA,IACF;AACA,QAAI,CAAC,IAAI;AACP,UAAI,KAAK,EAAE;AACX,UAAI,KAAK,EAAE;AAAA,IACb;AACA,IAAAD,KAAI,KAAK,GAAG;AAAA,EACd;AACF;AAiHA,SAASE,WAAW,IAAI,IAAI;AAC1B,MAAI,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG;AAChD,UAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC;AAAA,EACzE;AACA,QAAM,YAAY,GAAG,CAAC;AACtB,QAAM,YAAY,GAAG,CAAC;AACtB,MAAI,UAAU,SAAS,KAAK,UAAU,UAAU,SAAS,KAAK,QAAQ;AACpE,UAAM,IAAI,MAAM,GAAG,eAAe,wCAAwC;AAAA,EAC5E;AACA,MAAI,YAAY,WAAW;AACzB,WAAO;AAAA,EACT;AACA,MAAI,YAAY,WAAW;AACzB,WAAO;AAAA,EACT;AAEA,QAAM,IAAI,MAAM,GAAG,eAAe,uDAAuD;AAC3F;AAEA,IAAMC,wBAAuB,EAAE,gBAAgB,MAAM,WAAAD,WAAU;AAO/D,SAASE,QAAQ,MAAM,SAAS;AAC9B,YAAU,OAAO,OAAO,CAAC,GAAGD,uBAAsB,OAAO;AACzD,SAAO,aAAa,MAAM,IAAI,YAAY,GAAG,OAAO;AACtD;;;ACvSA,IAAM,YAAN,MAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKd,YAAa,MAAM,UAAU,CAAC,GAAG;AAC/B,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,UAAU;AAEf,SAAK,YAAY,CAAC,OAAO;AACzB,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,MAAO;AACL,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,OAAQ;AACN,WAAO,KAAK,QAAQ,KAAK,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAKA,KAAM;AACJ,WAAO,KAAK,KAAK,KAAK,IAAI;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,cAAe;AACb,WAAO,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC;AAAA,EACjD;AAAA,EAEA,iBAAkB;AAChB,QAAIE,KAAI,KAAK,GAAG;AAEhB,WAAOA,OAAM,MAAgBA,OAAM,KAAgBA,OAAM,MAAiBA,OAAM,IAAe;AAC7F,MAAAA,KAAI,KAAK,KAAK,EAAE,KAAK,IAAI;AAAA,IAC3B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAQ,KAAK;AACX,QAAI,KAAK,KAAK,SAAS,KAAK,OAAO,IAAI,QAAQ;AAC7C,YAAM,IAAI,MAAM,GAAG,eAAe,wCAAwC,KAAK,IAAI,EAAE;AAAA,IACvF;AACA,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAI,KAAK,KAAK,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG;AACrC,cAAM,IAAI,MAAM,GAAG,eAAe,iCAAiC,KAAK,IAAI,uBAAuB,OAAO,aAAa,GAAG,GAAG,CAAC,GAAG;AAAA,MACnI;AAAA,IACF;AAAA,EACF;AAAA,EAEA,cAAe;AACb,UAAM,WAAW,KAAK;AACtB,QAAI,WAAW;AACf,QAAI,QAAQ;AAKZ,UAAM,UAAU,CAAC,UAAU;AACzB,aAAO,CAAC,KAAK,KAAK,GAAG;AACnB,cAAM,KAAK,KAAK,GAAG;AACnB,YAAI,MAAM,SAAS,EAAE,GAAG;AACtB,eAAK;AAAA,QACP,OAAO;AACL;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,GAAG,MAAM,IAAI;AACpB,iBAAW;AACX,WAAK;AAAA,IACP;AACA,QAAI,KAAK,GAAG,MAAM,IAAI;AACpB,WAAK;AACL,UAAI,KAAK,GAAG,MAAM,IAAI;AACpB,aAAK;AACL,gBAAQ;AAAA,MACV,OAAO;AACL,eAAO,IAAI,MAAM,KAAK,MAAM,GAAG,KAAK,OAAO,QAAQ;AAAA,MACrD;AAAA,IACF;AACA,YAAQ,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;AAChD,QAAI,YAAY,KAAK,SAAS,WAAW,GAAG;AAC1C,YAAM,IAAI,MAAM,GAAG,eAAe,iCAAiC,KAAK,IAAI,EAAE;AAAA,IAChF;AACA,QAAI,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,MAAM,IAAI;AACpC,UAAI,OAAO;AACT,cAAM,IAAI,MAAM,GAAG,eAAe,iCAAiC,KAAK,IAAI,EAAE;AAAA,MAChF;AACA,cAAQ;AACR,WAAK;AACL,cAAQ,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;AAAA,IAClD;AACA,QAAI,CAAC,KAAK,KAAK,MAAM,KAAK,GAAG,MAAM,OAAO,KAAK,GAAG,MAAM,KAAK;AAC3D,cAAQ;AACR,WAAK;AACL,UAAI,CAAC,KAAK,KAAK,MAAM,KAAK,GAAG,MAAM,MAAM,KAAK,GAAG,MAAM,KAAK;AAC1D,aAAK;AAAA,MACP;AACA,cAAQ,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;AAAA,IAClD;AAEA,UAAM,SAAS,OAAO,aAAa,MAAM,MAAM,KAAK,KAAK,SAAS,UAAU,KAAK,IAAI,CAAC;AACtF,UAAM,MAAM,WAAW,MAAM;AAC7B,QAAI,OAAO;AACT,aAAO,IAAI,MAAM,KAAK,OAAO,KAAK,KAAK,OAAO,QAAQ;AAAA,IACxD;AACA,QAAI,KAAK,QAAQ,gBAAgB,QAAQ,OAAO,cAAc,GAAG,GAAG;AAClE,aAAO,IAAI,MAAM,OAAO,IAAI,KAAK,OAAO,KAAK,QAAQ,KAAK,KAAK,OAAO,QAAQ;AAAA,IAChF;AACA,WAAO,IAAI,MAAM,OAAO,IAAI,KAAK,OAAO,KAAK,QAAQ,OAAO,MAAM,GAAG,KAAK,OAAO,QAAQ;AAAA,EAC3F;AAAA;AAAA;AAAA;AAAA,EAKA,cAAe;AAEb,QAAI,KAAK,GAAG,MAAM,IAAI;AAEpB,YAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC,KAAK,IAAI,yBAAyB;AAAA,IAC3G;AACA,SAAK;AAIL,aAAS,IAAI,KAAK,MAAMC,KAAI,GAAG,IAAI,KAAK,KAAK,UAAUA,KAAI,OAAS,KAAKA,MAAK;AAC5E,YAAM,KAAK,KAAK,KAAK,CAAC;AACtB,UAAI,OAAO,MAAM,KAAK,MAAM,MAAM,KAAK;AACrC;AAAA,MACF;AACA,UAAI,OAAO,IAAI;AAEb,cAAM,MAAM,OAAO,aAAa,MAAM,MAAM,KAAK,KAAK,SAAS,KAAK,MAAM,CAAC,CAAC;AAC5E,aAAK,OAAO,IAAI;AAChB,eAAO,IAAI,MAAM,KAAK,QAAQ,KAAKA,EAAC;AAAA,MACtC;AAAA,IACF;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,QAAQ,CAAC;AAEf,UAAM,SAAS,MAAM;AACnB,UAAI,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ;AACrC,cAAM,IAAI,MAAM,GAAG,eAAe,0DAA0D,KAAK,IAAI,EAAE;AAAA,MACzG;AACA,UAAI,KAAK;AACT,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,KAAK,KAAK,GAAG;AACjB,YAAI,MAAM,MAAM,MAAM,IAAI;AACxB,gBAAM;AAAA,QACR,WAAW,MAAM,MAAM,MAAM,KAAK;AAChC,eAAK,KAAK,KAAK;AAAA,QACjB,WAAW,MAAM,MAAM,MAAM,IAAI;AAC/B,eAAK,KAAK,KAAK;AAAA,QACjB,OAAO;AACL,gBAAM,IAAI,MAAM,GAAG,eAAe,oDAAoD,KAAK,IAAI,EAAE;AAAA,QACnG;AACA,aAAK,KAAK,KAAK;AACf,aAAK;AAAA,MACP;AACA,aAAO;AAAA,IACT;AAGA,UAAM,eAAe,MAAM;AACzB,YAAM,YAAY,KAAK,GAAG;AAC1B,UAAI,YAAY;AAEhB,UAAI,mBAAoB,YAAY,MAAQ,IAAK,YAAY,MAAQ,IAAK,YAAY,MAAQ,IAAI;AAElG,UAAI,KAAK,OAAO,mBAAmB,KAAK,KAAK,QAAQ;AACnD,cAAM,IAAI,MAAM,GAAG,eAAe,4CAA4C,KAAK,IAAI,EAAE;AAAA,MAC3F;AAEA,UAAI,YAAY,WAAW,YAAY;AAEvC,cAAQ,kBAAkB;AAAA,QAGxB,KAAK;AACH,cAAI,YAAY,KAAM;AACpB,wBAAY;AAAA,UACd;AACA;AAAA,QACF,KAAK;AACH,uBAAa,KAAK,KAAK,KAAK,OAAO,CAAC;AACpC,eAAK,aAAa,SAAU,KAAM;AAChC,6BAAiB,YAAY,OAAS,IAAO,aAAa;AAC1D,gBAAI,gBAAgB,KAAM;AACxB,0BAAY;AAAA,YACd;AAAA,UACF;AACA;AAAA,QACF,KAAK;AACH,uBAAa,KAAK,KAAK,KAAK,OAAO,CAAC;AACpC,sBAAY,KAAK,KAAK,KAAK,OAAO,CAAC;AACnC,eAAK,aAAa,SAAU,QAAS,YAAY,SAAU,KAAM;AAC/D,6BAAiB,YAAY,OAAQ,MAAO,aAAa,OAAS,IAAO,YAAY;AAErF,gBAAI,gBAAgB,SAAU,gBAAgB,SAAU,gBAAgB,QAAS;AAC/E,0BAAY;AAAA,YACd;AAAA,UACF;AACA;AAAA,QACF,KAAK;AACH,uBAAa,KAAK,KAAK,KAAK,OAAO,CAAC;AACpC,sBAAY,KAAK,KAAK,KAAK,OAAO,CAAC;AACnC,uBAAa,KAAK,KAAK,KAAK,OAAO,CAAC;AACpC,eAAK,aAAa,SAAU,QAAS,YAAY,SAAU,QAAS,aAAa,SAAU,KAAM;AAC/F,6BAAiB,YAAY,OAAQ,MAAQ,aAAa,OAAS,MAAO,YAAY,OAAS,IAAO,aAAa;AACnH,gBAAI,gBAAgB,SAAU,gBAAgB,SAAU;AACtD,0BAAY;AAAA,YACd;AAAA,UACF;AAAA,MACJ;AAGA,UAAI,cAAc,MAAM;AAGtB,oBAAY;AACZ,2BAAmB;AAAA,MACrB,WAAW,YAAY,OAAQ;AAE7B,qBAAa;AACb,cAAM,KAAK,cAAc,KAAK,OAAQ,KAAM;AAC5C,oBAAY,QAAS,YAAY;AAAA,MACnC;AAEA,YAAM,KAAK,SAAS;AACpB,WAAK,QAAQ;AAAA,IACf;AAIA,WAAO,CAAC,KAAK,KAAK,GAAG;AACnB,YAAM,KAAK,KAAK,GAAG;AACnB,UAAI;AACJ,cAAQ,IAAI;AAAA,QACV,KAAK;AACH,eAAK;AACL,cAAI,KAAK,KAAK,GAAG;AACf,kBAAM,IAAI,MAAM,GAAG,eAAe,8CAA8C,KAAK,IAAI,EAAE;AAAA,UAC7F;AACA,gBAAM,KAAK,GAAG;AACd,eAAK;AACL,kBAAQ,KAAK;AAAA,YACX,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,oBAAM,KAAK,GAAG;AACd;AAAA,YACF,KAAK;AACH,oBAAM,KAAK,CAAC;AACZ;AAAA,YACF,KAAK;AACH,oBAAM,KAAK,CAAC;AACZ;AAAA,YACF,KAAK;AACH,oBAAM,KAAK,EAAE;AACb;AAAA,YACF,KAAK;AACH,oBAAM,KAAK,EAAE;AACb;AAAA,YACF,KAAK;AACH,oBAAM,KAAK,EAAE;AACb;AAAA,YACF,KAAK;AACH,oBAAM,KAAK,OAAO,CAAC;AACnB;AAAA,YACF;AACE,oBAAM,IAAI,MAAM,GAAG,eAAe,mDAAmD,KAAK,IAAI,EAAE;AAAA,UACpG;AACA;AAAA,QACF,KAAK;AACH,eAAK;AACL,iBAAO,IAAI,MAAM,KAAK,QAAQ,sBAAsB,KAAK,GAAG,KAAK,OAAO,QAAQ;AAAA,QAClF;AACE,cAAI,KAAK,IAAI;AACX,kBAAM,IAAI,MAAM,GAAG,eAAe,0CAA0C,KAAK,IAAI,EAAE;AAAA,UACzF,WAAW,KAAK,KAAM;AACpB,kBAAM,KAAK,EAAE;AACb,iBAAK;AAAA,UACP,OAAO;AACL,yBAAa;AAAA,UACf;AAAA,MACJ;AAAA,IACF;AAEA,UAAM,IAAI,MAAM,GAAG,eAAe,yCAAyC,KAAK,IAAI,EAAE;AAAA,EACxF;AAAA;AAAA;AAAA;AAAA,EAKA,aAAc;AACZ,YAAQ,KAAK,GAAG,GAAG;AAAA,MACjB,KAAK;AACH,aAAK,UAAU,KAAK,WAAW;AAC/B,aAAK;AACL,eAAO,IAAI,MAAM,KAAK,KAAK,UAAU,CAAC;AAAA,MACxC,KAAK;AACH,aAAK,UAAU,KAAK,aAAa;AACjC,aAAK;AACL,eAAO,IAAI,MAAM,KAAK,OAAO,UAAU,CAAC;AAAA,MAC1C,KAAK,IAAI;AACP,eAAO,KAAK,YAAY;AAAA,MAC1B;AAAA,MACA,KAAK;AACH,aAAK,OAAO,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAChC,eAAO,IAAI,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MACrC,KAAK;AACH,aAAK,OAAO,CAAC,KAAK,IAAI,KAAK,KAAK,GAAG,CAAC;AACpC,eAAO,IAAI,MAAM,KAAK,OAAO,OAAO,CAAC;AAAA,MACvC,KAAK;AACH,aAAK,OAAO,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAChC,eAAO,IAAI,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MACrC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,eAAO,KAAK,YAAY;AAAA,MAC1B;AACE,cAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC,KAAK,IAAI,EAAE;AAAA,IACtF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,OAAQ;AACN,SAAK,eAAe;AACpB,YAAQ,KAAK,YAAY,GAAG;AAAA,MAC1B,KAAK;AACH,aAAK,UAAU,IAAI;AACnB,eAAO,KAAK,WAAW;AAAA,MACzB,KAAK,eAAe;AAClB,aAAK,UAAU,IAAI;AACnB,YAAI,KAAK,GAAG,MAAM,IAAI;AACpB,eAAK;AACL,eAAK,eAAe;AACpB,iBAAO,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,QAC3C;AACA,YAAI,KAAK,GAAG,MAAM,IAAI;AACpB,gBAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC,KAAK,IAAI,8CAA8C,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,GAAG;AAAA,QACjK;AACA,aAAK;AACL,aAAK,UAAU,KAAK,aAAa;AACjC,aAAK,eAAe;AACpB,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA,MACA,KAAK,eAAe;AAClB,aAAK,UAAU,IAAI;AACnB,YAAI,KAAK,GAAG,MAAM,IAAI;AACpB,eAAK;AACL,eAAK,eAAe;AACpB,iBAAO,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,QAC3C;AACA,aAAK,UAAU,KAAK,aAAa;AACjC,aAAK,eAAe;AACpB,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA,MAEA,KAAK;AACH,YAAI,KAAK,GAAG,MAAM,KAAK;AACrB,eAAK,UAAU,IAAI;AACnB,eAAK;AACL,eAAK,eAAe;AACpB,iBAAO,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,QAC3C;AACA,YAAI,KAAK,GAAG,MAAM,IAAI;AACpB,gBAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC,KAAK,IAAI,+CAA+C,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,GAAG;AAAA,QAClK;AACA,aAAK;AACL,aAAK,eAAe;AAAA,MACtB,KAAK,aAAa;AAChB,aAAK,UAAU,IAAI;AACnB,YAAI,KAAK,GAAG,MAAM,KAAK;AACrB,eAAK;AACL,eAAK,eAAe;AACpB,iBAAO,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,QAC3C;AACA,cAAM,QAAQ,KAAK,YAAY;AAC/B,aAAK,eAAe;AACpB,YAAI,KAAK,GAAG,MAAM,IAAI;AACpB,gBAAM,IAAI,MAAM,GAAG,eAAe,qCAAqC,KAAK,IAAI,sDAAsD,OAAO,aAAa,KAAK,GAAG,CAAC,CAAC,GAAG;AAAA,QACzK;AACA,aAAK;AACL,aAAK,UAAU,KAAK,WAAW;AAC/B,eAAO;AAAA,MACT;AAAA,MACA,KAAK,aAAa;AAChB,aAAK,UAAU,IAAI;AACnB,aAAK,UAAU,KAAK,SAAS;AAC7B,aAAK,eAAe;AACpB,eAAO,KAAK,WAAW;AAAA,MACzB;AAAA,MAEA;AACE,cAAM,IAAI,MAAM,GAAG,eAAe,uCAAuC,KAAK,IAAI,yBAAyB;AAAA,IAC/G;AAAA,EACF;AACF;AAOA,SAASC,QAAQ,MAAM,SAAS;AAC9B,YAAU,OAAO,OAAO,EAAE,WAAW,IAAI,UAAU,MAAM,OAAO,EAAE,GAAG,OAAO;AAC5E,SAAO,OAAQ,MAAM,OAAO;AAC9B;;;AC/bO,IAAM,QAAQ,IAAI,WAAW,CAAC;AAW/B,SAAU,OAAQ,IAAgB,IAAc;AACpD,MAAI,OAAO;AAAI,WAAO;AACtB,MAAI,GAAG,eAAe,GAAG,YAAY;AACnC,WAAO;EACT;AAEA,WAAS,KAAK,GAAG,KAAK,GAAG,YAAY,MAAM;AACzC,QAAI,GAAG,EAAE,MAAM,GAAG,EAAE,GAAG;AACrB,aAAO;IACT;EACF;AAEA,SAAO;AACT;AAEM,SAAU,OAAQ,GAA6C;AACnE,MAAI,aAAa,cAAc,EAAE,YAAY,SAAS;AAAc,WAAO;AAC3E,MAAI,aAAa;AAAa,WAAO,IAAI,WAAW,CAAC;AACrD,MAAI,YAAY,OAAO,CAAC,GAAG;AACzB,WAAO,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU;EAC5D;AACA,QAAM,IAAI,MAAM,mCAAmC;AACrD;;;ACvBA,SAAS,KAAM,UAAUC,OAAI;AAC3B,MAAI,SAAS,UAAU,KAAK;AAAE,UAAM,IAAI,UAAU,mBAAmB;EAAE;AACvE,MAAI,WAAW,IAAI,WAAW,GAAG;AACjC,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAS,CAAC,IAAI;EAChB;AACA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAIC,KAAI,SAAS,OAAO,CAAC;AACzB,QAAI,KAAKA,GAAE,WAAW,CAAC;AACvB,QAAI,SAAS,EAAE,MAAM,KAAK;AAAE,YAAM,IAAI,UAAUA,KAAI,eAAe;IAAE;AACrE,aAAS,EAAE,IAAI;EACjB;AACA,MAAI,OAAO,SAAS;AACpB,MAAI,SAAS,SAAS,OAAO,CAAC;AAC9B,MAAI,SAAS,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG;AAC1C,MAAI,UAAU,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI;AAI3C,WAASC,QAAQ,QAAM;AAErB,QAAI,kBAAkB;AAAY;aAAW,YAAY,OAAO,MAAM,GAAG;AACvE,eAAS,IAAI,WAAW,OAAO,QAAQ,OAAO,YAAY,OAAO,UAAU;IAC7E,WAAW,MAAM,QAAQ,MAAM,GAAG;AAChC,eAAS,WAAW,KAAK,MAAM;IACjC;AACA,QAAI,EAAE,kBAAkB,aAAa;AAAE,YAAM,IAAI,UAAU,qBAAqB;IAAE;AAClF,QAAI,OAAO,WAAW,GAAG;AAAE,aAAO;IAAG;AAErC,QAAI,SAAS;AACb,QAAIC,UAAS;AACb,QAAI,SAAS;AACb,QAAI,OAAO,OAAO;AAClB,WAAO,WAAW,QAAQ,OAAO,MAAM,MAAM,GAAG;AAC9C;AACA;IACF;AAEA,QAAI,QAAS,OAAO,UAAU,UAAU,MAAO;AAC/C,QAAI,MAAM,IAAI,WAAW,IAAI;AAE7B,WAAO,WAAW,MAAM;AACtB,UAAI,QAAQ,OAAO,MAAM;AAEzB,UAAIC,KAAI;AACR,eAAS,MAAM,OAAO,IAAI,UAAU,KAAKA,KAAID,YAAY,QAAQ,IAAK,OAAOC,MAAK;AAChF,iBAAU,MAAM,IAAI,GAAG,MAAO;AAC9B,YAAI,GAAG,IAAK,QAAQ,SAAU;AAC9B,gBAAS,QAAQ,SAAU;MAC7B;AACA,UAAI,UAAU,GAAG;AAAE,cAAM,IAAI,MAAM,gBAAgB;MAAE;AACrD,MAAAD,UAASC;AACT;IACF;AAEA,QAAI,MAAM,OAAOD;AACjB,WAAO,QAAQ,QAAQ,IAAI,GAAG,MAAM,GAAG;AACrC;IACF;AAEA,QAAI,MAAM,OAAO,OAAO,MAAM;AAC9B,WAAO,MAAM,MAAM,EAAE,KAAK;AAAE,aAAO,SAAS,OAAO,IAAI,GAAG,CAAC;IAAG;AAC9D,WAAO;EACT;AAIA,WAAS,aAAc,QAAM;AAC3B,QAAI,OAAO,WAAW,UAAU;AAAE,YAAM,IAAI,UAAU,iBAAiB;IAAE;AACzE,QAAI,OAAO,WAAW,GAAG;AAAE,aAAO,IAAI,WAAU;IAAG;AACnD,QAAI,MAAM;AAEV,QAAI,OAAO,GAAG,MAAM,KAAK;AAAE;IAAO;AAElC,QAAI,SAAS;AACb,QAAIA,UAAS;AACb,WAAO,OAAO,GAAG,MAAM,QAAQ;AAC7B;AACA;IACF;AAEA,QAAI,QAAU,OAAO,SAAS,OAAO,SAAU,MAAO;AACtD,QAAI,OAAO,IAAI,WAAW,IAAI;AAE9B,WAAO,OAAO,GAAG,GAAG;AAElB,UAAI,QAAQ,SAAS,OAAO,WAAW,GAAG,CAAC;AAE3C,UAAI,UAAU,KAAK;AAAE;MAAO;AAC5B,UAAIC,KAAI;AACR,eAAS,MAAM,OAAO,IAAI,UAAU,KAAKA,KAAID,YAAY,QAAQ,IAAK,OAAOC,MAAK;AAChF,iBAAU,OAAO,KAAK,GAAG,MAAO;AAChC,aAAK,GAAG,IAAK,QAAQ,QAAS;AAC9B,gBAAS,QAAQ,QAAS;MAC5B;AACA,UAAI,UAAU,GAAG;AAAE,cAAM,IAAI,MAAM,gBAAgB;MAAE;AACrD,MAAAD,UAASC;AACT;IACF;AAEA,QAAI,OAAO,GAAG,MAAM,KAAK;AAAE;IAAO;AAElC,QAAI,MAAM,OAAOD;AACjB,WAAO,QAAQ,QAAQ,KAAK,GAAG,MAAM,GAAG;AACtC;IACF;AACA,QAAI,MAAM,IAAI,WAAW,UAAU,OAAO,IAAI;AAC9C,QAAIE,KAAI;AACR,WAAO,QAAQ,MAAM;AACnB,UAAIA,IAAG,IAAI,KAAK,KAAK;IACvB;AACA,WAAO;EACT;AAIA,WAASC,QAAQ,QAAM;AACrB,QAAIC,UAAS,aAAa,MAAM;AAChC,QAAIA,SAAQ;AAAE,aAAOA;IAAO;AAC5B,UAAM,IAAI,MAAM,OAAOP,KAAI,YAAY;EACzC;AACA,SAAO;IACL,QAAQE;IACR;IACA,QAAQI;;AAEZ;AACA,IAAI,MAAM;AAEV,IAAI,kCAAkC;AAEtC,IAAA,iBAAe;;;ACjIf,IAAM,UAAN,MAAa;EACF;EACA;EACA;EAET,YAAaE,OAAY,QAAgB,YAAoB;AAC3D,SAAK,OAAOA;AACZ,SAAK,SAAS;AACd,SAAK,aAAa;EACpB;EAEA,OAAQC,QAAiB;AACvB,QAAIA,kBAAiB,YAAY;AAC/B,aAAO,GAAG,KAAK,MAAM,GAAG,KAAK,WAAWA,MAAK,CAAC;IAChD,OAAO;AACL,YAAM,MAAM,mCAAmC;IACjD;EACF;;AAQF,IAAM,UAAN,MAAa;EACF;EACA;EACA;EACQ;EAEjB,YAAaD,OAAY,QAAgB,YAAoB;AAC3D,SAAK,OAAOA;AACZ,SAAK,SAAS;AAEd,QAAI,OAAO,YAAY,CAAC,MAAM,QAAW;AACvC,YAAM,IAAI,MAAM,0BAA0B;IAC5C;AACA,SAAK,kBAAkB,OAAO,YAAY,CAAC;AAC3C,SAAK,aAAa;EACpB;EAEA,OAAQ,MAAY;AAClB,QAAI,OAAO,SAAS,UAAU;AAC5B,UAAI,KAAK,YAAY,CAAC,MAAM,KAAK,iBAAiB;AAChD,cAAM,MAAM,qCAAqC,KAAK,UAAU,IAAI,CAAC,KAAK,KAAK,IAAI,+CAA+C,KAAK,MAAM,EAAE;MACjJ;AACA,aAAO,KAAK,WAAW,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC;IACvD,OAAO;AACL,YAAM,MAAM,mCAAmC;IACjD;EACF;EAEA,GAAgC,SAAmE;AACjG,WAAO,GAAG,MAAM,OAAO;EACzB;;AAKF,IAAM,kBAAN,MAAqB;EACV;EAET,YAAa,UAA0B;AACrC,SAAK,WAAW;EAClB;EAEA,GAAiC,SAAmE;AAClG,WAAO,GAAG,MAAM,OAAO;EACzB;EAEA,OAAQ,OAAa;AACnB,UAAM,SAAS,MAAM,CAAC;AACtB,UAAM,UAAU,KAAK,SAAS,MAAM;AACpC,QAAI,WAAW,MAAM;AACnB,aAAO,QAAQ,OAAO,KAAK;IAC7B,OAAO;AACL,YAAM,WAAW,qCAAqC,KAAK,UAAU,KAAK,CAAC,+BAA+B,OAAO,KAAK,KAAK,QAAQ,CAAC,gBAAgB;IACtJ;EACF;;AAGI,SAAU,GAAyC,MAA+C,OAA8C;AAEpJ,SAAO,IAAI,gBAAgB;IACzB,GAAI,KAAK,YAAY,EAAE,CAAE,KAA2B,MAAM,GAAG,KAAI;IACjE,GAAI,MAAM,YAAY,EAAE,CAAE,MAA4B,MAAM,GAAG,MAAK;GAClD;AACtB;AAEM,IAAO,QAAP,MAAY;EACP;EACA;EACA;EACA;EACA;EACA;EAET,YAAaA,OAAY,QAAgB,YAAsB,YAAoB;AACjF,SAAK,OAAOA;AACZ,SAAK,SAAS;AACd,SAAK,aAAa;AAClB,SAAK,aAAa;AAClB,SAAK,UAAU,IAAI,QAAQA,OAAM,QAAQ,UAAU;AACnD,SAAK,UAAU,IAAI,QAAQA,OAAM,QAAQ,UAAU;EACrD;EAEA,OAAQ,OAAiB;AACvB,WAAO,KAAK,QAAQ,OAAO,KAAK;EAClC;EAEA,OAAQ,OAAa;AACnB,WAAO,KAAK,QAAQ,OAAO,KAAK;EAClC;;AAGI,SAAU,KAAmD,EAAE,MAAAA,OAAM,QAAQ,QAAAE,SAAQ,QAAAC,QAAM,GAAsE;AACrK,SAAO,IAAI,MAAMH,OAAM,QAAQE,SAAQC,OAAM;AAC/C;AAEM,SAAU,MAAoD,EAAE,MAAAH,OAAM,QAAQ,SAAQ,GAAoD;AAC9I,QAAM,EAAE,QAAAE,SAAQ,QAAAC,QAAM,IAAK,eAAM,UAAUH,KAAI;AAC/C,SAAO,KAAK;IACV;IACA,MAAAA;IACA,QAAAE;IACA,QAAQ,CAAC,SAA6B,OAAOC,QAAO,IAAI,CAAC;GAC1D;AACH;AAEA,SAASA,QAAQ,QAAgB,UAAkB,aAAqBH,OAAY;AAElF,QAAM,QAAgC,CAAA;AACtC,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,EAAE,GAAG;AACxC,UAAM,SAAS,CAAC,CAAC,IAAI;EACvB;AAGA,MAAI,MAAM,OAAO;AACjB,SAAO,OAAO,MAAM,CAAC,MAAM,KAAK;AAC9B,MAAE;EACJ;AAGA,QAAM,MAAM,IAAI,WAAY,MAAM,cAAc,IAAK,CAAC;AAGtD,MAAI,OAAO;AACX,MAAII,UAAS;AACb,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAE5B,UAAM,QAAQ,MAAM,OAAO,CAAC,CAAC;AAC7B,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI,YAAY,OAAOJ,KAAI,YAAY;IAC/C;AAGA,IAAAI,UAAUA,WAAU,cAAe;AACnC,YAAQ;AAGR,QAAI,QAAQ,GAAG;AACb,cAAQ;AACR,UAAI,SAAS,IAAI,MAAQA,WAAU;IACrC;EACF;AAGA,MAAI,QAAQ,gBAAgB,MAAQA,WAAW,IAAI,UAAY,GAAG;AAChE,UAAM,IAAI,YAAY,wBAAwB;EAChD;AAEA,SAAO;AACT;AAEA,SAASF,QAAQ,MAAkB,UAAkB,aAAmB;AACtE,QAAM,MAAM,SAAS,SAAS,SAAS,CAAC,MAAM;AAC9C,QAAM,QAAQ,KAAK,eAAe;AAClC,MAAI,MAAM;AAEV,MAAI,OAAO;AACX,MAAIE,UAAS;AACb,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAEpC,IAAAA,UAAUA,WAAU,IAAK,KAAK,CAAC;AAC/B,YAAQ;AAGR,WAAO,OAAO,aAAa;AACzB,cAAQ;AACR,aAAO,SAAS,OAAQA,WAAU,IAAK;IACzC;EACF;AAGA,MAAI,SAAS,GAAG;AACd,WAAO,SAAS,OAAQA,WAAW,cAAc,IAAM;EACzD;AAGA,MAAI,KAAK;AACP,YAAS,IAAI,SAAS,cAAe,OAAO,GAAG;AAC7C,aAAO;IACT;EACF;AAEA,SAAO;AACT;AAKM,SAAU,QAAsD,EAAE,MAAAJ,OAAM,QAAQ,aAAa,SAAQ,GAAyE;AAClL,SAAO,KAAK;IACV;IACA,MAAAA;IACA,OAAQ,OAAiB;AACvB,aAAOE,QAAO,OAAO,UAAU,WAAW;IAC5C;IACA,OAAQ,OAAa;AACnB,aAAOC,QAAO,OAAO,UAAU,aAAaH,KAAI;IAClD;GACD;AACH;;;AC1OO,IAAM,SAAS,QAAQ;EAC5B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,cAAc,QAAQ;EACjC,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,YAAY,QAAQ;EAC/B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,iBAAiB,QAAQ;EACpC,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,YAAY,QAAQ;EAC/B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,iBAAiB,QAAQ;EACpC,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,eAAe,QAAQ;EAClC,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,oBAAoB,QAAQ;EACvC,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,UAAU,QAAQ;EAC7B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;;;AC7DM,IAAM,YAAY,MAAM;EAC7B,MAAM;EACN,QAAQ;EACR,UAAU;CACX;AAEM,IAAM,eAAe,MAAM;EAChC,MAAM;EACN,QAAQ;EACR,UAAU;CACX;;;ACZD;;;;gBAAAK;EAAA,cAAAC;;;;ACCA,IAAI,WAAWC;AAEf,IAAI,MAAM;AAAV,IACI,OAAO;AADX,IAEI,SAAS,CAAC;AAFd,IAGI,MAAM,KAAK,IAAI,GAAG,EAAE;AAOxB,SAASA,QAAO,KAAK,KAAK,QAAM;AAC9B,QAAM,OAAO,CAAA;AACb,WAAS,UAAU;AACnB,MAAI,YAAY;AAEhB,SAAM,OAAO,KAAK;AAChB,QAAI,QAAQ,IAAK,MAAM,MAAQ;AAC/B,WAAO;EACT;AACA,SAAM,MAAM,QAAQ;AAClB,QAAI,QAAQ,IAAK,MAAM,MAAQ;AAC/B,aAAS;EACX;AACA,MAAI,MAAM,IAAI,MAAM;AAGpB,EAAAA,QAAO,QAAQ,SAAS,YAAY;AAEpC,SAAO;AACT;AAEA,IAAIC,UAAS;AAEb,IAAI,QAAQ;AAAZ,IACI,SAAS;AAMb,SAAS,KAAKC,MAAK,QAAM;AACvB,MAAI,MAAS,GACT,SAAS,UAAU,GACnB,QAAS,GACT,UAAU,QACVC,IACAC,KAAIF,KAAI;AAEZ,KAAG;AACD,QAAI,WAAWE,IAAG;AAEhB,WAAK,QAAQ;AACb,YAAM,IAAI,WAAW,yBAAyB;IAChD;AACA,IAAAD,KAAID,KAAI,SAAS;AACjB,WAAO,QAAQ,MACVC,KAAI,WAAW,SACfA,KAAI,UAAU,KAAK,IAAI,GAAG,KAAK;AACpC,aAAS;EACX,SAASA,MAAK;AAGd,OAAK,QAAQ,UAAU;AAEvB,SAAO;AACT;AAEA,IAAI,KAAK,KAAK,IAAI,GAAI,CAAC;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AACvB,IAAI,KAAK,KAAK,IAAI,GAAG,EAAE;AAEvB,IAAI,SAAS,SAAgC,OAAK;AAChD,SACE,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACb,QAAQ,KAAK,IACA;AAEjB;AAEA,IAAI,SAAS;EACT,QAAQ;EACR,QAAQF;EACR,gBAAgB;;AAGpB,IAAI,eAAe;AAEnB,IAAA,iBAAe;;;ACrGT,SAAUI,QAAQ,MAAkB,SAAS,GAAC;AAClD,QAAMC,QAAO,eAAO,OAAO,MAAM,MAAM;AACvC,SAAO,CAACA,OAAM,eAAO,OAAO,KAAK;AACnC;AAEM,SAAU,SAAU,KAAa,QAAoB,SAAS,GAAC;AACnE,iBAAO,OAAO,KAAK,QAAQ,MAAM;AACjC,SAAO;AACT;AAEM,SAAU,eAAgB,KAAW;AACzC,SAAO,eAAO,eAAe,GAAG;AAClC;;;AFPM,SAAU,OAA8BC,OAAY,QAAkB;AAC1E,QAAM,OAAO,OAAO;AACpB,QAAM,aAAoB,eAAeA,KAAI;AAC7C,QAAM,eAAe,aAAoB,eAAe,IAAI;AAE5D,QAAMC,SAAQ,IAAI,WAAW,eAAe,IAAI;AAChD,EAAO,SAASD,OAAMC,QAAO,CAAC;AAC9B,EAAO,SAAS,MAAMA,QAAO,UAAU;AACvC,EAAAA,OAAM,IAAI,QAAQ,YAAY;AAE9B,SAAO,IAAI,OAAOD,OAAM,MAAM,QAAQC,MAAK;AAC7C;AAKM,SAAUC,QAAQ,WAAqB;AAC3C,QAAMD,SAAQ,OAAO,SAAS;AAC9B,QAAM,CAACD,OAAM,UAAU,IAAWE,QAAOD,MAAK;AAC9C,QAAM,CAAC,MAAM,YAAY,IAAWC,QAAOD,OAAM,SAAS,UAAU,CAAC;AACrE,QAAM,SAASA,OAAM,SAAS,aAAa,YAAY;AAEvD,MAAI,OAAO,eAAe,MAAM;AAC9B,UAAM,IAAI,MAAM,kBAAkB;EACpC;AAEA,SAAO,IAAI,OAAOD,OAAM,MAAM,QAAQC,MAAK;AAC7C;AAEM,SAAUE,QAAQ,GAAoBC,IAAU;AACpD,MAAI,MAAMA,IAAG;AACX,WAAO;EACT,OAAO;AACL,UAAM,OAAOA;AAEb,WACE,EAAE,SAAS,KAAK,QAChB,EAAE,SAAS,KAAK,QAChB,KAAK,iBAAiB,cACtB,OAAW,EAAE,OAAO,KAAK,KAAK;EAElC;AACF;AAMM,IAAO,SAAP,MAAa;EACR;EACA;EACA;EACA;;;;EAKT,YAAaJ,OAAY,MAAY,QAAoBC,QAAiB;AACxE,SAAK,OAAOD;AACZ,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,QAAQC;EACf;;;;AG3DI,SAAU,OAA0F,MAASI,OAAmC;AACpJ,QAAM,EAAE,OAAAC,QAAO,QAAO,IAAK;AAC3B,UAAQ,SAAS;IACf,KAAK;AACH,aAAO,WACLA,QACA,UAAU,IAAI,GACdD,SAAqC,UAAU,OAAO;IAE1D;AACE,aAAO,WACLC,QACA,UAAU,IAAI,GACbD,SAAQ,OAAO,OAAwC;EAE9D;AACF;AAYA,IAAM,QAAQ,oBAAI,QAAO;AAEzB,SAAS,UAAW,KAAoB;AACtC,QAAME,aAAY,MAAM,IAAI,GAAG;AAC/B,MAAIA,cAAa,MAAM;AACrB,UAAMA,aAAY,oBAAI,IAAG;AACzB,UAAM,IAAI,KAAKA,UAAS;AACxB,WAAOA;EACT;AACA,SAAOA;AACT;AAEM,IAAO,MAAP,MAAO,KAAG;EACL;EACA;EACA;EACA;EACA;;;;;;EAOT,YAAa,SAAkBC,OAAc,WAAqCC,QAAiB;AACjG,SAAK,OAAOD;AACZ,SAAK,UAAU;AACf,SAAK,YAAY;AACjB,SAAK,QAAQC;AAIb,SAAK,GAAG,IAAIA;EACd;;;;;;;EAQA,IAAI,QAAK;AACP,WAAO;EACT;;EAGA,IAAI,aAAU;AACZ,WAAO,KAAK,MAAM;EACpB;;EAGA,IAAI,aAAU;AACZ,WAAO,KAAK,MAAM;EACpB;EAEA,OAAI;AACF,YAAQ,KAAK,SAAS;MACpB,KAAK,GAAG;AACN,eAAO;MACT;MACA,KAAK,GAAG;AACN,cAAM,EAAE,MAAAD,OAAM,UAAS,IAAK;AAE5B,YAAIA,UAAS,aAAa;AACxB,gBAAM,IAAI,MAAM,0CAA0C;QAC5D;AAGA,YAAI,UAAU,SAAS,cAAc;AACnC,gBAAM,IAAI,MAAM,oDAAoD;QACtE;AAEA,eACE,KAAI,SACF,SAA6C;MAGnD;MACA,SAAS;AACP,cAAM,MACJ,+BAA+B,KAAK,OAAO,4CAA4C;MAE3F;IACF;EACF;EAEA,OAAI;AACF,YAAQ,KAAK,SAAS;MACpB,KAAK,GAAG;AACN,cAAM,EAAE,MAAAA,OAAM,OAAM,IAAK,KAAK;AAC9B,cAAM,YAAmB,OAAOA,OAAM,MAAM;AAC5C,eACE,KAAI,SAAS,KAAK,MAAM,SAAS;MAErC;MACA,KAAK,GAAG;AACN,eAAO;MACT;MACA,SAAS;AACP,cAAM,MACJ,+BAA+B,KAAK,OAAO,4CAA4C;MAE3F;IACF;EACF;EAEA,OAAQ,OAAc;AACpB,WAAO,KAAI,OAAO,MAAM,KAAK;EAC/B;EAEA,OAAO,OAAsFE,OAA4C,OAAc;AACrJ,UAAM,UAAU;AAChB,WACE,WAAW,QACXA,MAAK,SAAS,QAAQ,QACtBA,MAAK,YAAY,QAAQ,WAClBC,QAAOD,MAAK,WAAW,QAAQ,SAAS;EAEnD;EAEA,SAAUE,OAAmC;AAC3C,WAAO,OAAO,MAAMA,KAAI;EAC1B;EAEA,SAAM;AACJ,WAAO,EAAE,KAAK,OAAO,IAAI,EAAC;EAC5B;EAEA,OAAI;AACF,WAAO;EACT;EAES,CAAC,OAAO,WAAW,IAAI;;EAIhC,CAAC,OAAO,IAAI,4BAA4B,CAAC,IAAC;AACxC,WAAO,OAAO,KAAK,SAAQ,CAAE;EAC/B;;;;;;;;;;;EAYA,OAAO,MAAwF,OAA+C;AAC5I,QAAI,SAAS,MAAM;AACjB,aAAO;IACT;AAEA,UAAM,QAAQ;AACd,QAAI,iBAAiB,MAAK;AAExB,aAAO;IACT,WAAY,MAAM,GAAG,KAAK,QAAQ,MAAM,GAAG,MAAM,MAAM,SAAU,MAAM,UAAU,OAAO;AAMtF,YAAM,EAAE,SAAS,MAAAJ,OAAM,WAAW,OAAAC,OAAK,IAAK;AAC5C,aAAO,IAAI,KACT,SACAD,OACA,WACAC,UAAS,UAAU,SAASD,OAAM,UAAU,KAAK,CAAC;IAEtD,WAAW,MAAM,SAAS,MAAM,MAAM;AAIpC,YAAM,EAAE,SAAS,WAAW,MAAAA,MAAI,IAAK;AACrC,YAAM,SAAgBK,QAAO,SAAS;AACtC,aAAO,KAAI,OAAO,SAASL,OAAM,MAAM;IACzC,OAAO;AAGL,aAAO;IACT;EACF;;;;;;EAOA,OAAO,OAAsF,SAAkBA,OAAc,QAAgC;AAC3J,QAAI,OAAOA,UAAS,UAAU;AAC5B,YAAM,IAAI,MAAM,uCAAuC;IACzD;AAEA,QAAI,EAAE,OAAO,iBAAiB,aAAa;AACzC,YAAM,IAAI,MAAM,gBAAgB;IAClC;AAEA,YAAQ,SAAS;MACf,KAAK,GAAG;AACN,YAAIA,UAAS,aAAa;AACxB,gBAAM,IAAI,MACR,wCAAwC,WAAW,kBAAkB;QAEzE,OAAO;AACL,iBAAO,IAAI,KAAI,SAASA,OAAM,QAAQ,OAAO,KAAK;QACpD;MACF;MACA,KAAK,GAAG;AACN,cAAMC,SAAQ,UAAU,SAASD,OAAM,OAAO,KAAK;AACnD,eAAO,IAAI,KAAI,SAASA,OAAM,QAAQC,MAAK;MAC7C;MACA,SAAS;AACP,cAAM,IAAI,MAAM,iBAAiB;MACnC;IACF;EACF;;;;EAKA,OAAO,SAAuB,QAAgD;AAC5E,WAAO,KAAI,OAAO,GAAG,aAAa,MAAM;EAC1C;;;;;;;EAQA,OAAO,SAAyDD,OAAY,QAAgC;AAC1G,WAAO,KAAI,OAAO,GAAGA,OAAM,MAAM;EACnC;;;;;;;;EASA,OAAO,OAAoFC,QAAuD;AAChJ,UAAM,CAAC,KAAK,SAAS,IAAI,KAAI,YAAYA,MAAK;AAC9C,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,IAAI,MAAM,kBAAkB;IACpC;AACA,WAAO;EACT;;;;;;;;;;EAWA,OAAO,YAA2EA,QAAyC;AACzH,UAAM,QAAQ,KAAI,aAAaA,MAAK;AACpC,UAAM,aAAa,MAAM,OAAO,MAAM;AACtC,UAAM,iBAAiB,OACrBA,OAAM,SAAS,YAAY,aAAa,MAAM,aAAa,CAAC;AAE9D,QAAI,eAAe,eAAe,MAAM,eAAe;AACrD,YAAM,IAAI,MAAM,kBAAkB;IACpC;AACA,UAAM,cAAc,eAAe,SACjC,MAAM,gBAAgB,MAAM,UAAU;AAExC,UAAM,SAAS,IAAW,OACxB,MAAM,eACN,MAAM,YACN,aACA,cAAc;AAEhB,UAAM,MACJ,MAAM,YAAY,IACd,KAAI,SAAS,MAA0C,IACvD,KAAI,SAAS,MAAM,OAAO,MAAM;AACtC,WAAO,CAAC,KAAwBA,OAAM,SAAS,MAAM,IAAI,CAAC;EAC5D;;;;;;;;;;EAWA,OAAO,aAA4E,cAAgD;AACjI,QAAI,SAAS;AACb,UAAM,OAAO,MAAa;AACxB,YAAM,CAAC,GAAGK,OAAM,IAAWD,QAAO,aAAa,SAAS,MAAM,CAAC;AAC/D,gBAAUC;AACV,aAAO;IACT;AAEA,QAAI,UAAU,KAAI;AAClB,QAAI,QAAQ;AACZ,QAAI,YAAsB,IAAI;AAE5B,gBAAU;AACV,eAAS;IACX,OAAO;AACL,cAAQ,KAAI;IACd;AAEA,QAAI,YAAY,KAAK,YAAY,GAAG;AAClC,YAAM,IAAI,WAAW,uBAAuB,OAAO,EAAE;IACvD;AAEA,UAAM,aAAa;AACnB,UAAM,gBAAgB,KAAI;AAC1B,UAAM,aAAa,KAAI;AACvB,UAAM,OAAO,SAAS;AACtB,UAAM,gBAAgB,OAAO;AAE7B,WAAO,EAAE,SAAS,OAAO,eAAe,YAAY,eAAe,KAAI;EACzE;;;;;;;EAQA,OAAO,MAA0G,QAAkEF,OAAmC;AACpN,UAAM,CAAC,QAAQH,MAAK,IAAI,gBAAgB,QAAQG,KAAI;AAEpD,UAAM,MAAM,KAAI,OAAOH,MAAK;AAE5B,QAAI,IAAI,YAAY,KAAK,OAAO,CAAC,MAAM,KAAK;AAC1C,YAAM,MAAM,wDAAwD;IACtE;AAGA,cAAU,GAAG,EAAE,IAAI,QAAQ,MAAM;AAEjC,WAAO;EACT;;AAGF,SAAS,gBAAqH,QAAkEG,OAAmC;AACjO,UAAQ,OAAO,CAAC,GAAG;IAEjB,KAAK,KAAK;AACR,YAAM,UAAUA,SAAQ;AACxB,aAAO;QACL,UAAU;QACV,QAAQ,OAAO,GAAG,UAAU,MAAM,GAAG,MAAM,EAAE;;IAEjD;IACA,KAAK,UAAU,QAAQ;AACrB,YAAM,UAAUA,SAAQ;AACxB,aAAO,CAAC,UAAU,QAAkB,QAAQ,OAAO,MAAM,CAAC;IAC5D;IACA,KAAK,OAAO,QAAQ;AAClB,YAAM,UAAUA,SAAQ;AACxB,aAAO,CAAC,OAAO,QAAkB,QAAQ,OAAO,MAAM,CAAC;IACzD;IACA,SAAS;AACP,UAAIA,SAAQ,MAAM;AAChB,cAAM,MACJ,iFAAiF;MAErF;AACA,aAAO,CAAC,OAAO,CAAC,GAAaA,MAAK,OAAO,MAAM,CAAC;IAClD;EACF;AACF;AAEA,SAAS,WAAYH,QAAmBM,QAA4BH,OAA+B;AACjG,QAAM,EAAE,OAAM,IAAKA;AACnB,MAAI,WAAW,UAAU,QAAQ;AAC/B,UAAM,MAAM,8BAA8BA,MAAK,IAAI,WAAW;EAChE;AAEA,QAAM,MAAMG,OAAM,IAAI,MAAM;AAC5B,MAAI,OAAO,MAAM;AACf,UAAMC,OAAMJ,MAAK,OAAOH,MAAK,EAAE,MAAM,CAAC;AACtC,IAAAM,OAAM,IAAI,QAAQC,IAAG;AACrB,WAAOA;EACT,OAAO;AACL,WAAO;EACT;AACF;AAEA,SAAS,WAAoCP,QAAmBM,QAA4BH,OAAkC;AAC5H,QAAM,EAAE,OAAM,IAAKA;AACnB,QAAM,MAAMG,OAAM,IAAI,MAAM;AAC5B,MAAI,OAAO,MAAM;AACf,UAAMC,OAAMJ,MAAK,OAAOH,MAAK;AAC7B,IAAAM,OAAM,IAAI,QAAQC,IAAG;AACrB,WAAOA;EACT,OAAO;AACL,WAAO;EACT;AACF;AAEA,IAAM,cAAc;AACpB,IAAM,eAAe;AAErB,SAAS,UAAW,SAAsBR,OAAc,WAAqB;AAC3E,QAAM,aAAoB,eAAe,OAAO;AAChD,QAAM,aAAa,aAAoB,eAAeA,KAAI;AAC1D,QAAMC,SAAQ,IAAI,WAAW,aAAa,UAAU,UAAU;AAC9D,EAAO,SAAS,SAASA,QAAO,CAAC;AACjC,EAAO,SAASD,OAAMC,QAAO,UAAU;AACvC,EAAAA,OAAM,IAAI,WAAW,UAAU;AAC/B,SAAOA;AACT;AAEA,IAAM,YAAY,OAAO,IAAI,kBAAkB;;;ACnczC,SAAUQ,MAAiD,EAAE,MAAAC,OAAM,MAAAC,OAAM,QAAAC,QAAM,GAA4E;AAC/J,SAAO,IAAI,OAAOF,OAAMC,OAAMC,OAAM;AACtC;AAMM,IAAO,SAAP,MAAa;EACR;EACA;EACA;EAET,YAAaF,OAAYC,OAAYC,SAAgD;AACnF,SAAK,OAAOF;AACZ,SAAK,OAAOC;AACZ,SAAK,SAASC;EAChB;EAEA,OAAQ,OAAiB;AACvB,QAAI,iBAAiB,YAAY;AAC/B,YAAM,SAAS,KAAK,OAAO,KAAK;AAChC,aAAO,kBAAkB,aACd,OAAO,KAAK,MAAM,MAAM,IAE/B,OAAO,KAAK,YAAiB,OAAO,KAAK,MAAM,MAAM,CAAC;IAC5D,OAAO;AACL,YAAM,MAAM,mCAAmC;IAEjD;EACF;;;;ACjCK,IAAM,SAAS,QAAQ;EAC5B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,YAAY,QAAQ;EAC/B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,YAAY,QAAQ;EAC/B,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;AAEM,IAAM,eAAe,QAAQ;EAClC,QAAQ;EACR,MAAM;EACN,UAAU;EACV,aAAa;CACd;;;A7BDD,SAAS,WAAY,KAAK;AACxB,MAAI,IAAI,UAAU,OAAO,IAAI,GAAG,MAAM,IAAI,OAAO;AAC/C,WAAO;AAAA,EACT;AACA,QAAM,MAAM,IAAI,MAAM,GAAG;AAGzB,MAAI,CAAC,KAAK;AACR,WAAO;AAAA,EACT;AACA,QAAM,YAAY,IAAI,SAAS;AAE/B,SAAO;AAAA,IACL,IAAI,MAAM,KAAK,KAAK,UAAU,CAAC;AAAA,IAC/B,IAAI,MAAM,KAAK,QAAQ,KAAK,CAAC;AAAA;AAAA,IAC7B,IAAI,MAAM,KAAK,QAAQ,WAAW,UAAU,MAAM;AAAA;AAAA,IAClD,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,EACpC;AACF;AAUA,SAAS,aAAcC,QAAO;AAC5B,QAAM,cAAc,OAAO,OAAOA,MAAK,EAAE,MAAM,CAAC;AAChD,SAAO;AAAA,IACL,IAAI,MAAM,KAAK,KAAK,UAAU,CAAC;AAAA,IAC/B,IAAI,MAAM,KAAK,QAAQ,KAAK,CAAC;AAAA;AAAA,IAC7B,IAAI,MAAM,KAAK,KAAK,UAAU,CAAC;AAAA;AAAA,IAC/B,IAAI,MAAM,KAAK,QAAQ,SAAS,CAAC;AAAA;AAAA,IACjC,IAAI,MAAM,KAAK,QAAQ,aAAa,YAAY,MAAM;AAAA;AAAA,IACtD,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,IAClC,IAAI,MAAM,KAAK,OAAO,QAAW,CAAC;AAAA,EACpC;AACF;AASA,SAAS,eAAgB,KAAK;AAC5B,SAAO,aAAa,IAAI,WAAW,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU,CAAC;AAChF;AAQA,SAAS,eAAgB,IAAI;AAC3B,SAAO,aAAa,IAAI,WAAW,EAAE,CAAC;AACxC;AASA,SAAS,mBAAoB;AAC3B,QAAM,IAAI,MAAM,2EAA2E;AAC7F;AAUA,SAAS,cAAe,KAAK;AAC3B,MAAI,OAAO,MAAM,GAAG,GAAG;AACrB,UAAM,IAAI,MAAM,qEAAqE;AAAA,EACvF;AACA,MAAI,QAAQ,YAAY,QAAQ,WAAW;AACzC,UAAM,IAAI,MAAM,0FAA0F;AAAA,EAC5G;AACA,SAAO;AACT;AAEA,IAAM,gBAAgB;AAAA,EACpB,cAAc;AAAA,IACZ,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,cAAc;AAAA,IACd,mBAAmB;AAAA,IACnB,eAAe;AAAA,IACf,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,aAAa;AAAA,IACb,WAAW;AAAA,IACX,QAAQ;AAAA,EACV;AACF;AAKA,IAAM,mBAAN,cAAyC,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKjD,YAAa,MAAM,SAAS;AAC1B,UAAM,MAAM,OAAO;AAEnB,SAAK,cAAc,CAAC;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA,EAKA,OAAQ;AACN,WAAO,KAAK,YAAY,WAAW,KAAK,MAAM,KAAK;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA,EAKA,QAAS;AACP,QAAI,KAAK,YAAY,SAAS,GAAG;AAE/B,aAAO,KAAK,YAAY,IAAI;AAAA,IAC9B;AACA,WAAO,MAAM,KAAK;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAQ;AACN,UAAM,QAAQ,KAAK,MAAM;AAEzB,QAAI,MAAM,SAAS,KAAK,KAAK;AAC3B,YAAM,WAAW,KAAK,MAAM;AAC5B,UAAI,SAAS,SAAS,KAAK,UAAU,SAAS,UAAU,KAAK;AAC3D,cAAM,aAAa,KAAK,MAAM;AAC9B,YAAI,WAAW,SAAS,KAAK,QAAQ;AACnC,gBAAM,aAAa,KAAK,MAAM;AAC9B,cAAI,WAAW,SAAS,KAAK,OAAO;AAClC,kBAAM,IAAI,MAAM,0BAA0B;AAAA,UAC5C;AACA,eAAK,YAAY,KAAK,UAAU;AAChC,iBAAO,IAAI,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QAClC;AACA,YAAI,WAAW,SAAS,KAAK,KAAK;AAChC,gBAAM,gBAAgB,KAAK,MAAM;AACjC,cAAI,cAAc,SAAS,KAAK,UAAU,cAAc,UAAU,SAAS;AACzE,kBAAM,kBAAkB,KAAK,MAAM;AACnC,gBAAI,gBAAgB,SAAS,KAAK,QAAQ;AACxC,uBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,sBAAM,aAAa,KAAK,MAAM;AAC9B,oBAAI,WAAW,SAAS,KAAK,OAAO;AAClC,wBAAM,IAAI,MAAM,4BAA4B;AAAA,gBAC9C;AAAA,cACF;AACA,oBAAMA,SAAQ,OAAO,OAAO,IAAI,gBAAgB,KAAK,EAAE;AACvD,qBAAO,IAAI,MAAM,KAAK,OAAOA,QAAO,gBAAgB,MAAM,MAAM;AAAA,YAClE;AACA,iBAAK,YAAY,KAAK,eAAe;AAAA,UACvC;AACA,eAAK,YAAY,KAAK,aAAa;AAAA,QACrC;AACA,aAAK,YAAY,KAAK,UAAU;AAAA,MAClC;AACA,WAAK,YAAY,KAAK,QAAQ;AAAA,IAChC;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAM,gBAAgB;AAAA,EACpB,iBAAiB;AAAA,EACjB,gBAAgB;AAAA,EAChB,UAAU;AAAA,EACV,eAAe;AAAA,EACf,aAAa;AAAA;AAAA;AAAA,EAEb,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,wBAAwB;AAAA;AAAA,EAExB,MAAM,CAAC;AACT;AAIA,cAAc,KAAK,EAAE,IAAI,IAAI;AAEtB,IAAM,OAAO;AACb,IAAM,OAAO;AAOb,IAAMC,UAAS,CAAC,SAAmBA,QAAO,MAAM,aAAa;AAO7D,IAAMC,UAAS,CAAC,SAAS;AAE9B,QAAM,UAAU,OAAO,OAAO,eAAe,EAAE,WAAW,IAAI,iBAAiB,MAAM,aAAa,EAAE,CAAC;AACrG,SAAiBA,QAAO,MAAM,OAAO;AACvC;AAOO,IAAMC,UAAS,CAAC,SAAS,YAAY,OAAOF,QAAO,IAAI,CAAC;AAE/D,IAAM,cAAc,IAAI,YAAY;AAO7B,IAAM,QAAQ,CAAC,SAASG,QAAO,YAAY,OAAO,IAAI,CAAC;AAC9D,IAAM,cAAc,IAAI,YAAY;;;A8BvQpC,SAAS,QAAQ,GAAU;AACzB,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AAEA,SAAS,MAAMC,OAA8B,SAAiB;AAC5D,MAAI,CAAC,QAAQA,EAAC;AAAG,UAAM,IAAI,MAAM,qBAAqB;AACtD,MAAI,QAAQ,SAAS,KAAK,CAAC,QAAQ,SAASA,GAAE,MAAM;AAClD,UAAM,IAAI,MAAM,iCAAiC,OAAO,mBAAmBA,GAAE,MAAM,EAAE;AACzF;AAeA,SAAS,OAAO,UAAe,gBAAgB,MAAI;AACjD,MAAI,SAAS;AAAW,UAAM,IAAI,MAAM,kCAAkC;AAC1E,MAAI,iBAAiB,SAAS;AAAU,UAAM,IAAI,MAAM,uCAAuC;AACjG;AACA,SAAS,OAAO,KAAU,UAAa;AACrC,QAAM,GAAG;AACT,QAAM,MAAM,SAAS;AACrB,MAAI,IAAI,SAAS,KAAK;AACpB,UAAM,IAAI,MAAM,yDAAyD,GAAG,EAAE;EAChF;AACF;;;AC1BA,SAASC,SAAQ,GAAU;AACzB,SACE,aAAa,cACZ,KAAK,QAAQ,OAAO,MAAM,YAAY,EAAE,YAAY,SAAS;AAElE;AAGO,IAAM,aAAa,CAAC,QACzB,IAAI,SAAS,IAAI,QAAQ,IAAI,YAAY,IAAI,UAAU;AAGlD,IAAM,OAAO,CAAC,MAAc,UAAmB,QAAS,KAAK,QAAW,SAAS;AAMjF,IAAM,OAAO,IAAI,WAAW,IAAI,YAAY,CAAC,SAAU,CAAC,EAAE,MAAM,EAAE,CAAC,MAAM;AAChF,IAAI,CAAC;AAAM,QAAM,IAAI,MAAM,6CAA6C;AA0ElE,SAAUC,aAAY,KAAW;AACrC,MAAI,OAAO,QAAQ;AAAU,UAAM,IAAI,MAAM,oCAAoC,OAAO,GAAG,EAAE;AAC7F,SAAO,IAAI,WAAW,IAAI,YAAW,EAAG,OAAO,GAAG,CAAC;AACrD;AAQM,SAAU,QAAQ,MAAW;AACjC,MAAI,OAAO,SAAS;AAAU,WAAOA,aAAY,IAAI;AACrD,MAAI,CAACC,SAAQ,IAAI;AAAG,UAAM,IAAI,MAAM,4BAA4B,OAAO,IAAI,EAAE;AAC7E,SAAO;AACT;AAsBM,IAAgB,OAAhB,MAAoB;;EAsBxB,QAAK;AACH,WAAO,KAAK,WAAU;EACxB;;AAcF,IAAM,QAAQ,CAAA,EAAG;AAcX,SAAU,gBAAmC,UAAuB;AACxE,QAAM,QAAQ,CAAC,QAA2B,SAAQ,EAAG,OAAO,QAAQ,GAAG,CAAC,EAAE,OAAM;AAChF,QAAM,MAAM,SAAQ;AACpB,QAAM,YAAY,IAAI;AACtB,QAAM,WAAW,IAAI;AACrB,QAAM,SAAS,MAAM,SAAQ;AAC7B,SAAO;AACT;;;AC5MA,SAAS,aAAa,MAAgB,YAAoB,OAAeC,OAAa;AACpF,MAAI,OAAO,KAAK,iBAAiB;AAAY,WAAO,KAAK,aAAa,YAAY,OAAOA,KAAI;AAC7F,QAAM,OAAO,OAAO,EAAE;AACtB,QAAM,WAAW,OAAO,UAAU;AAClC,QAAM,KAAK,OAAQ,SAAS,OAAQ,QAAQ;AAC5C,QAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,QAAM,IAAIA,QAAO,IAAI;AACrB,QAAMC,KAAID,QAAO,IAAI;AACrB,OAAK,UAAU,aAAa,GAAG,IAAIA,KAAI;AACvC,OAAK,UAAU,aAAaC,IAAG,IAAID,KAAI;AACzC;AAGM,IAAgB,OAAhB,cAAgD,KAAO;EAc3D,YACW,UACF,WACE,WACAA,OAAa;AAEtB,UAAK;AALI,SAAA,WAAA;AACF,SAAA,YAAA;AACE,SAAA,YAAA;AACA,SAAA,OAAAA;AATD,SAAA,WAAW;AACX,SAAA,SAAS;AACT,SAAA,MAAM;AACN,SAAA,YAAY;AASpB,SAAK,SAAS,IAAI,WAAW,QAAQ;AACrC,SAAK,OAAO,WAAW,KAAK,MAAM;EACpC;EACA,OAAO,MAAW;AAChB,WAAO,IAAI;AACX,UAAM,EAAE,MAAM,QAAAE,SAAQ,SAAQ,IAAK;AACnC,WAAO,QAAQ,IAAI;AACnB,UAAM,MAAM,KAAK;AACjB,aAAS,MAAM,GAAG,MAAM,OAAO;AAC7B,YAAM,OAAO,KAAK,IAAI,WAAW,KAAK,KAAK,MAAM,GAAG;AAEpD,UAAI,SAAS,UAAU;AACrB,cAAMC,YAAW,WAAW,IAAI;AAChC,eAAO,YAAY,MAAM,KAAK,OAAO;AAAU,eAAK,QAAQA,WAAU,GAAG;AACzE;MACF;AACA,MAAAD,QAAO,IAAI,KAAK,SAAS,KAAK,MAAM,IAAI,GAAG,KAAK,GAAG;AACnD,WAAK,OAAO;AACZ,aAAO;AACP,UAAI,KAAK,QAAQ,UAAU;AACzB,aAAK,QAAQ,MAAM,CAAC;AACpB,aAAK,MAAM;MACb;IACF;AACA,SAAK,UAAU,KAAK;AACpB,SAAK,WAAU;AACf,WAAO;EACT;EACA,WAAW,KAAe;AACxB,WAAO,IAAI;AACX,WAAO,KAAK,IAAI;AAChB,SAAK,WAAW;AAIhB,UAAM,EAAE,QAAAA,SAAQ,MAAM,UAAU,MAAAF,MAAI,IAAK;AACzC,QAAI,EAAE,IAAG,IAAK;AAEd,IAAAE,QAAO,KAAK,IAAI;AAChB,SAAK,OAAO,SAAS,GAAG,EAAE,KAAK,CAAC;AAEhC,QAAI,KAAK,YAAY,WAAW,KAAK;AACnC,WAAK,QAAQ,MAAM,CAAC;AACpB,YAAM;IACR;AAEA,aAAS,IAAI,KAAK,IAAI,UAAU;AAAK,MAAAA,QAAO,CAAC,IAAI;AAIjD,iBAAa,MAAM,WAAW,GAAG,OAAO,KAAK,SAAS,CAAC,GAAGF,KAAI;AAC9D,SAAK,QAAQ,MAAM,CAAC;AACpB,UAAM,QAAQ,WAAW,GAAG;AAC5B,UAAM,MAAM,KAAK;AAEjB,QAAI,MAAM;AAAG,YAAM,IAAI,MAAM,6CAA6C;AAC1E,UAAM,SAAS,MAAM;AACrB,UAAM,QAAQ,KAAK,IAAG;AACtB,QAAI,SAAS,MAAM;AAAQ,YAAM,IAAI,MAAM,oCAAoC;AAC/E,aAAS,IAAI,GAAG,IAAI,QAAQ;AAAK,YAAM,UAAU,IAAI,GAAG,MAAM,CAAC,GAAGA,KAAI;EACxE;EACA,SAAM;AACJ,UAAM,EAAE,QAAAE,SAAQ,UAAS,IAAK;AAC9B,SAAK,WAAWA,OAAM;AACtB,UAAM,MAAMA,QAAO,MAAM,GAAG,SAAS;AACrC,SAAK,QAAO;AACZ,WAAO;EACT;EACA,WAAW,IAAM;AACf,WAAA,KAAO,IAAK,KAAK,YAAmB;AACpC,OAAG,IAAI,GAAG,KAAK,IAAG,CAAE;AACpB,UAAM,EAAE,UAAU,QAAAA,SAAQ,QAAAE,SAAQ,UAAU,WAAW,IAAG,IAAK;AAC/D,OAAG,SAASA;AACZ,OAAG,MAAM;AACT,OAAG,WAAW;AACd,OAAG,YAAY;AACf,QAAIA,UAAS;AAAU,SAAG,OAAO,IAAIF,OAAM;AAC3C,WAAO;EACT;;;;AC7GF,IAAM,MAAM,CAAC,GAAWG,IAAWC,OAAe,IAAID,KAAM,CAAC,IAAIC;AAEjE,IAAM,MAAM,CAAC,GAAWD,IAAWC,OAAe,IAAID,KAAM,IAAIC,KAAMD,KAAIC;AAK1E,IAAM,WAA0B,oBAAI,YAAY;EAC9C;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EACpF;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAID,IAAM,KAAoB,oBAAI,YAAY;EACxC;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;EAAY;CACrF;AAID,IAAM,WAA2B,oBAAI,YAAY,EAAE;AACnD,IAAM,SAAN,cAAqB,KAAY;EAY/B,cAAA;AACE,UAAM,IAAI,IAAI,GAAG,KAAK;AAVxB,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;AACZ,SAAA,IAAI,GAAG,CAAC,IAAI;EAIZ;EACU,MAAG;AACX,UAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAAC,IAAG,GAAG,GAAG,EAAC,IAAK;AACnC,WAAO,CAAC,GAAG,GAAG,GAAG,GAAGA,IAAG,GAAG,GAAG,CAAC;EAChC;;EAEU,IACR,GAAW,GAAW,GAAW,GAAWA,IAAW,GAAW,GAAW,GAAS;AAEtF,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAIA,KAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;AACb,SAAK,IAAI,IAAI;EACf;EACU,QAAQ,MAAgB,QAAc;AAE9C,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,UAAU;AAAG,eAAS,CAAC,IAAI,KAAK,UAAU,QAAQ,KAAK;AACpF,aAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAC5B,YAAM,MAAM,SAAS,IAAI,EAAE;AAC3B,YAAM,KAAK,SAAS,IAAI,CAAC;AACzB,YAAM,KAAK,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,EAAE,IAAK,QAAQ;AACnD,YAAM,KAAK,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,IAAK,OAAO;AACjD,eAAS,CAAC,IAAK,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAK;IACjE;AAEA,QAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAAA,IAAG,GAAG,GAAG,EAAC,IAAK;AACjC,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,YAAM,SAAS,KAAKA,IAAG,CAAC,IAAI,KAAKA,IAAG,EAAE,IAAI,KAAKA,IAAG,EAAE;AACpD,YAAM,KAAM,IAAI,SAAS,IAAIA,IAAG,GAAG,CAAC,IAAI,SAAS,CAAC,IAAI,SAAS,CAAC,IAAK;AACrE,YAAM,SAAS,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,KAAK,GAAG,EAAE;AACpD,YAAM,KAAM,SAAS,IAAI,GAAG,GAAG,CAAC,IAAK;AACrC,UAAI;AACJ,UAAI;AACJ,UAAIA;AACJ,MAAAA,KAAK,IAAI,KAAM;AACf,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAK,KAAK,KAAM;IAClB;AAEA,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,IAAAA,KAAKA,KAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,QAAK,IAAI,KAAK,IAAK;AACnB,SAAK,IAAI,GAAG,GAAG,GAAG,GAAGA,IAAG,GAAG,GAAG,CAAC;EACjC;EACU,aAAU;AAClB,aAAS,KAAK,CAAC;EACjB;EACA,UAAO;AACL,SAAK,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAC/B,SAAK,OAAO,KAAK,CAAC;EACpB;;AAsBK,IAAM,SAAyB,gCAAgB,MAAM,IAAI,OAAM,CAAE;;;AChIxE,SAAS,SAAU,EAAE,aAAa,MAAM,eAAe,MAAK,IAAK,CAAA,GAAE;AACjE,SAAO,EAAE,YAAY,cAAc,UAAU,MAAK;AACpD;AAEA,UAAW,YAAa,MAAiC,OAAU;AACjE,MAAI,SAAS,QAAQ,OAAO,UAAU,UAAU;AAC9C,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,iBAAW,CAAC,OAAO,OAAO,KAAK,MAAM,QAAO,GAAI;AAC9C,cAAM,cAAc,CAAC,GAAG,MAAM,KAAK;AACnC,cAAM,MAAM,IAAI,MAAM,OAAO;AAC7B,YAAI,OAAO,MAAM;AACf,gBAAM,CAAC,YAAY,KAAK,GAAG,GAAG,GAAG;QACnC,WAAW,OAAO,YAAY,UAAU;AACtC,iBAAQ,MAAM,SAAS,WAAW;QACpC;MACF;IACF,OAAO;AACL,YAAM,MAAM,IAAI,MAAM,KAAK;AAC3B,UAAI,OAAO,MAAM;AACf,cAAM,CAAC,KAAK,KAAK,GAAG,GAAG,GAAG;MAC5B,OAAO;AACL,eAAQ,MAAM,OAAO,IAAI;MAC3B;IACF;EACF;AACF;AAEA,UAAW,MAAW,QAAWC,OAA4B;AAC3D,MAAI,UAAU,QAAQ,kBAAkB,YAAY;AAClD;EACF;AACA,QAAM,MAAM,IAAI,MAAM,MAAM;AAC5B,MAAI,OAAO,MAAM;AACf,UAAM,CAACA,MAAK,KAAK,GAAG,GAAG,GAAG;EAC5B;AACA,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACjD,UAAM,OAAO,CAAC,GAAGA,OAAM,GAAG;AAC1B,WAAQ,YAAY,MAAM,KAAK;EACjC;AACF;AAEA,UAAW,WAAY,MAAiC,OAAU;AAChE,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,eAAW,CAAC,OAAO,OAAO,KAAK,MAAM,QAAO,GAAI;AAC9C,YAAM,cAAc,CAAC,GAAG,MAAM,KAAK;AACnC,YAAM,YAAY,KAAK,GAAG;AAC1B,UAAI,OAAO,YAAY,YAAa,IAAI,MAAM,OAAO,KAAK,MAAO;AAC/D,eAAQ,KAAK,SAAS,WAAW;MACnC;IACF;EACF,OAAO;AACL,WAAQ,KAAK,OAAO,IAAI;EAC1B;AACF;AAEA,UAAW,KAAU,QAAWA,OAA4B;AAC1D,MAAI,UAAU,QAAQ,OAAO,WAAW,UAAU;AAChD;EACF;AACA,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACjD,UAAM,OAAO,CAAC,GAAGA,OAAM,GAAG;AAC1B,UAAM,KAAK,KAAK,GAAG;AACnB,QAAI,SAAS,QAAQ,EAAE,iBAAiB,eAAe,OAAO,UAAU,YAAa,IAAI,MAAM,KAAK,KAAK,MAAO;AAC9G,aAAQ,WAAW,MAAM,KAAK;IAChC;EACF;AACF;AAEA,SAAS,IAAS,QAAW,MAAc;AACzC,MAAI,OAAO;AACX,aAAW,CAAC,OAAO,GAAG,KAAK,KAAK,QAAO,GAAI;AACzC,WAAO,KAAK,GAAG;AACf,QAAI,QAAQ,MAAM;AAChB,YAAM,IAAI,MAAM,6BAA6B,KAAK,MAAM,GAAG,QAAQ,CAAC,EAAE,IAAI,UAAQ,IAAI,KAAK,UAAU,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE;IAC3H;AACA,UAAM,MAAM,IAAI,MAAM,IAAI;AAC1B,QAAI,OAAO,MAAM;AACf,aAAO,EAAE,OAAO,KAAK,WAAW,KAAK,MAAM,QAAQ,CAAC,EAAE,KAAK,GAAG,EAAC;IACjE;EACF;AACA,SAAO,EAAE,OAAO,KAAI;AACtB;AAQM,IAAO,QAAP,MAAY;EACP;EACA;EACA;EACA;EAET,YAAa,EAAE,KAAK,OAAAC,QAAO,MAAK,GAA8D;AAC5F,QAAI,OAAO,QAAQA,UAAS,QAAQ,OAAO,UAAU,aAAa;AAAE,YAAM,IAAI,MAAM,2BAA2B;IAAE;AAEjH,SAAK,MAAM;AACX,SAAK,QAAQA;AACb,SAAK,QAAQ;AACb,SAAK,UAAU;AAGf,WAAO,iBAAiB,MAAM;MAC5B,KAAK,SAAQ;MACb,OAAO,SAAQ;MACf,OAAO,SAAQ;MACf,SAAS,SAAQ;KAClB;EACH;EAEA,QAAK;AACH,WAAO,MAAM,KAAK,OAAO,CAAA,CAAE;EAC7B;EAEA,OAAI;AACF,WAAO,KAAK,KAAK,OAAO,CAAA,CAAE;EAC5B;EAEA,IAAK,OAAO,KAAG;AACb,WAAO,IAAI,KAAK,OAAO,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;EACxD;;AAcF,eAAsBC,QAAqD,EAAE,OAAO,OAAO,OAAM,GAA6B;AAC5H,MAAI,OAAO,UAAU;AAAa,UAAM,IAAI,MAAM,mCAAmC;AACrF,MAAI,SAAS,QAAQ,UAAU;AAAM,UAAM,IAAI,MAAM,4CAA4C;AAEjG,QAAMD,SAAQ,MAAM,OAAO,KAAK;AAChC,QAAM,OAAO,MAAM,OAAO,OAAOA,MAAK;AAEtC,QAAM,MAAM,IAAI,OACd,GACA,MAAM,MACN,IAAI;AAGN,SAAO,IAAI,MAAM,EAAE,OAAO,OAAAA,QAAO,IAAG,CAAE;AACxC;;;ACvJA,qBAAsD;AACtD,sBAA6B;AAItB,IAAM,WAAW,CAAoB,WAAc,oBAAK,MAAM,CAAC,QAAQ,oBAAK,KAAK,CAAC,CAAC;AACnF,IAAM,kBAAkB;AAG/B,IAAM,QAAQ;AACd,IAAM,cAAc;AAIpB,8BAAe,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC,MAAM,MAAM,WAAW,KAAK,CAAC,CAAC,MAAM,MAAM,KAAK,CAAC;AACrF,IAAM,WAAW,oBAAK,OAAO;AA4C7B,IAAM,oBAAoB,CAACE,OAAyCA,IAAiB,eAAe;AAoD3G,8BAAe,IAAI,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,MAAM,KAAK,CAAC;AAClD,IAAM,QAAQ,oBAAK,OAAO,EAAE,QAAQ,MAAM,CAAC;AAGlD,IAAM,QAAQ;AACd,8BAAe,IAAI,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,MAAM,KAAK,CAAC;AAClD,IAAM,MAAM,oBAAK,OAAO,EAAE,QAAQ,MAAM,CAAC;AAGzC,IAAM,gBAAgB,oBAAK,OAAO;AAAA,EACxC,IAAI;AAAA;AAAA,EACJ,IAAI,oBAAK,OAAO;AAAA;AAAA,EAChB,IAAI,SAAS,oBAAK,MAAM,CAAC,oBAAK,OAAO,GAAG,oBAAK,QAAQ,GAAG,oBAAK,OAAO,CAAC,CAAC,CAAC;AAAA;AAAA,EACvE,IAAI,oBAAK,OAAO;AAAA;AAAA,EAChB,IAAI,oBAAK,OAAO;AAAA;AAAA,EAChB,IAAI,SAAS,KAAK;AAAA;AACnB,CAAC;AAGM,IAAM,iBAAiB,6BAAa,QAAQ,aAAa;AACzD,IAAM,2BAA2B,CAAC,QAAa,MAAM,KAAK,eAAe,OAAO,GAAG,CAAC;AACpF,IAAM,qBAAqB,eAAe,MAAM,KAAK,cAAc;AAEnE,IAAM,WAAW,oBAAK,UAAU;AAAA,EACtC,oBAAK,OAAO;AAAA,IACX,KAAK;AAAA,EACN,CAAC;AAAA,EACD;AACD,CAAC;AAGM,IAAM,YAAY,6BAAa,QAAQ,QAAQ;AAC/C,IAAM,sBAAsB,CAAC,QAAa,MAAM,KAAK,UAAU,OAAO,GAAG,CAAC;AAC1E,IAAM,gBAAgB,UAAU,MAAM,KAAK,SAAS;;;AChJpD,IAAM,SAAS,MAAM;EAC1B,QAAQ;EACR,MAAM;EACN,UAAU;CACX;AAEM,IAAM,cAAc,MAAM;EAC/B,QAAQ;EACR,MAAM;EACN,UAAU;CACX;;;ACRD,SAAS,IAAKC,OAAyB;AACrC,SAAO,OAAM,SAAQ,IAAI,WAAW,MAAM,OAAO,OAAO,OAAOA,OAAM,IAAI,CAAC;AAC5E;AAEO,IAAMC,UAASC,MAAK;EACzB,MAAM;EACN,MAAM;EACN,QAAQ,IAAI,SAAS;CACtB;AAEM,IAAM,SAASA,MAAK;EACzB,MAAM;EACN,MAAM;EACN,QAAQ,IAAI,SAAS;CACtB;;;ACLD,IAAM,EAAE,MAAAC,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,IAAM,sBAAsB;AAE5B,SAAS,cAAc,KAAuB,UAAoB,CAAC,KAAK,GAAG;AACjF,MAAI,CAAC;AAAK,UAAMA,OAAM,aAAa,GAAG;AACtC,MAAI,MAAO,IAAe;AAC1B,MAAI,kBAAkB,GAAG,GAAG;AAC3B,QAAI,CAAC;AAAK,YAAM,WAAW,YAAY,GAAqB,EAAE,KAAK,EAAE,SAAS;AAC9E,IAAAJ,MAAK,yCAAyC;AAC9C,WAAO,EAAE,KAAK,IAAI;AAAA,EACnB;AACA,QAAM,aAAa,CAAC;AACpB,WAAS,CAAC,KAAK,GAAG,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC3C,QAAI,QAAQ,QAAW;AACtB,MAAAA,MAAK,OAAO,GAAG,0DAA0D,GAAG;AAC5E,YAAM;AAAA,IACP;AACA,QAAI,CAAC,QAAQ,SAAS,GAAG,GAAG;AAC3B,iBAAW,GAAG,IAAI;AAAA,IACnB,OAAO;AACN,MAAAG,SAAQ,qBAAqB,EAAE,KAAK,IAAI,CAAC;AAAA,IAC1C;AAAA,EACD;AACA,SAAO,EAAE,KAAK,YAAsB,IAAI;AACzC;AAEO,SAAS,sBAAsB,KAAkB;AACvD,SAAO,WAAW,aAAa,GAAG,EAAE,KAAK;AAC1C;AACO,SAAS,aAAa,KAA+E;AAC3G,SAAO,YAAY,cAAc,GAAG,GAAG,GAAG;AAC3C;AAEO,SAAS,WAAWE,QAA8B;AAExD,QAAM,OAAO,OAAOA,MAAK;AACzB,QAAM,SAAS,eAAO,OAAOC,QAAa,MAAM,IAAI;AACpD,QAAM,MAAM,IAAI,OAAO,GAAW,MAAM,MAAM;AAC9C,EAAAH,SAAQ,gBAAgB,EAAE,OAAAE,QAAO,MAAM,QAAQ,IAAI,CAAC;AACpD,SAAO;AACR;AAEO,SAAS,YAAY,YAA6D;AACxF,EAAAH,OAAM,iBAAiB,UAAU;AACjC,QAAM,WAAmBK,QAAO,UAAU;AAC1C,SAAO,EAAE,OAAO,UAAU,KAAK,WAAW,QAAQ,EAAE;AACrD;AAEA,eAAsB,oBAAoB,YAAiB;AAE1D,QAAM,UAAU,MAAMA,QAAmB,EAAE,OAAO,YAAY,OAAO,aAAS,QAAQD,QAAa,CAAC;AACpG,QAAM,cAAc,YAAY,UAAU;AAC1C,MAAI,YAAY,IAAI,SAAS,MAAM,QAAQ,IAAI,SAAS,GAAG;AAC1D,IAAAF,OAAM,2CAA2C,EAAE,YAAY,SAAS,YAAY,CAAC;AAAA,EACtF;AACA,SAAO;AACR;AAEO,SAAS,YAAY,WAAsB;AACjD,MAAI,MAAkB;AACtB,MAAI,SAAS,CAAC;AACd,MAAI;AACH,UAAM,IAAI,MAAM,SAAS;AAAA,EAC1B,SAAS,KAAK;AACb,IAAAD,SAAQ,yDAAyD;AACjE,WAAO,KAAK,GAAG;AAAA,EAChB;AACA,MAAI,CAAC,KAAK;AACT,QAAI;AACH,YAAM,IAAI,MAAM,WAAW,MAAM;AAAA,IAClC,SAAS,KAAK;AACb,MAAAA,SAAQ,mDAAmD;AAC3D,aAAO,KAAK,GAAG;AAAA,IAChB;AAAA,EACD;AACA,SAAO;AAAA,IACN;AAAA,IACA,QAAQ,MAAM,OAAO;AAAA;AAAA,IACrB,QAAQ,OAAO,aAAa,GAAG;AAAA,EAChC;AACD;AACO,SAAS,aAAa,KAAU;AACtC,SAAO,IAAI,SAAS;AACrB;AAEO,SAAS,YAAY,KAAU;AACrC,MAAI,IAAI,QAAQ,qBAAqB;AACpC,WAAO,aAAa,GAAG;AAAA,EACxB,OAAO;AACN,WAAO,IAAI,SAAS;AAAA,EACrB;AACD;AACO,SAAS,aAAa,KAAU;AACtC,MAAI,IAAI,SAAS;AAAqB,UAAMC,OAAM,oBAAoB,IAAI,IAAI,MAAM,IAAI,SAAS,CAAC;AAClG,SAAO,IAAI,SAAS,MAAM;AAC3B;AACO,SAAS,uBAAuB,cAA+B;AACrE,SAAO,OAAO,iBAAiB,WAC5B,IAAI,MAAM,YAAY,IACtB,OAAO,aAAa,QAAQ,aAC5B,IAAI,OAAO,aAAa,KAAK,IAC7B;AACJ;AACO,SAAS,aAAa,cAA+B,cAA+B;AAC1F,MAAI,CAAC,gBAAgB,CAAC;AAAc,UAAM,IAAI,MAAM,kCAAkC,YAAY,KAAK,YAAY,EAAE;AACrH,MAAI,iBAAiB;AAAc,WAAO;AAC1C,QAAM,OAAO,uBAAuB,YAAY;AAChD,QAAM,OAAO,uBAAuB,YAAY;AAChD,SAAO,KAAK,KAAK,EAAE,SAAS,MAAM,KAAK,KAAK,EAAE,SAAS;AACxD;AACO,SAAS,YAAY,MAA4C,QAAyB;AAChG,MAAI,gBAAgB;AAAK,WAAO,KAAK,IAAI,OAAO,WAAW,WAAW,SAAS,OAAO,KAAK,EAAE,SAAS,CAAC;AACvG,SAAO,KAAK,KAAK,iBAAe,aAAa,aAAa,MAAM,CAAC;AAClE;;;AC/FO,SAAS,OAAO,UAAU;AAC/B,QAAM,SAAS,OAAO,UAAU,SAAS,KAAK,QAAQ;AAGtD,MACE,oBAAoB,QACnB,OAAO,aAAa,YAAY,WAAW,iBAC5C;AAEA,WAAO,IAAI,SAAS,YAAY,CAAC,QAAQ;AAAA,EAC3C,WACE,OAAO,aAAa,YACpB,WAAW,qBACX,OAAO,aAAa,YACpB,WAAW,mBACX;AAEA,WAAO,IAAI,KAAK,QAAQ;AAAA,EAC1B,OAAO;AAEL,WAAO,oBAAI,KAAK,GAAG;AAAA,EACrB;AACF;;;AChCO,SAAS,SAAS,MAAM,eAAe;AAC5C,QAAM,QAAQ,OAAO,IAAI;AACzB,QAAM,iBAAiB,OAAO,aAAa;AAC3C,SAAO,CAAC,QAAQ,CAAC;AACnB;;;ACzBA,IAAI,aAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU;AAEpF,IAAO,qBAAQ;;;ACAf,IAAI,WAAW,OAAO,QAAQ,YAAY,QAAQ,KAAK,WAAW,UAAU;AAG5E,IAAI,OAAO,sBAAc,YAAY,SAAS,aAAa,EAAE;AAE7D,IAAO,eAAQ;;;ACLf,IAAII,UAAS,aAAK;AAElB,IAAO,iBAAQA;;;ACFf,IAAI,cAAc,OAAO;AAGzB,IAAI,iBAAiB,YAAY;AAOjC,IAAI,uBAAuB,YAAY;AAGvC,IAAI,iBAAiB,iBAAS,eAAO,cAAc;AASnD,SAAS,UAAU,OAAO;AACxB,MAAI,QAAQ,eAAe,KAAK,OAAO,cAAc,GACjD,MAAM,MAAM,cAAc;AAE9B,MAAI;AACF,UAAM,cAAc,IAAI;AACxB,QAAI,WAAW;AAAA,EACjB,SAASC,IAAG;AAAA,EAAC;AAEb,MAAI,SAAS,qBAAqB,KAAK,KAAK;AAC5C,MAAI,UAAU;AACZ,QAAI,OAAO;AACT,YAAM,cAAc,IAAI;AAAA,IAC1B,OAAO;AACL,aAAO,MAAM,cAAc;AAAA,IAC7B;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;AC5Cf,IAAIC,eAAc,OAAO;AAOzB,IAAIC,wBAAuBD,aAAY;AASvC,SAAS,eAAe,OAAO;AAC7B,SAAOC,sBAAqB,KAAK,KAAK;AACxC;AAEA,IAAO,yBAAQ;;;AChBf,IAAI,UAAU;AAAd,IACI,eAAe;AAGnB,IAAIC,kBAAiB,iBAAS,eAAO,cAAc;AASnD,SAAS,WAAW,OAAO;AACzB,MAAI,SAAS,MAAM;AACjB,WAAO,UAAU,SAAY,eAAe;AAAA,EAC9C;AACA,SAAQA,mBAAkBA,mBAAkB,OAAO,KAAK,IACpD,kBAAU,KAAK,IACf,uBAAe,KAAK;AAC1B;AAEA,IAAO,qBAAQ;;;ACHf,SAAS,aAAa,OAAO;AAC3B,SAAO,SAAS,QAAQ,OAAO,SAAS;AAC1C;AAEA,IAAO,uBAAQ;;;ACxBf,IAAI,YAAY;AAmBhB,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACpB,qBAAa,KAAK,KAAK,mBAAW,KAAK,KAAK;AACjD;AAEA,IAAO,mBAAQ;;;ACnBf,SAAS,SAAS,OAAO,UAAU;AACjC,MAAI,QAAQ,IACRC,UAAS,SAAS,OAAO,IAAI,MAAM,QACnC,SAAS,MAAMA,OAAM;AAEzB,SAAO,EAAE,QAAQA,SAAQ;AACvB,WAAO,KAAK,IAAI,SAAS,MAAM,KAAK,GAAG,OAAO,KAAK;AAAA,EACrD;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACGf,IAAI,UAAU,MAAM;AAEpB,IAAO,kBAAQ;;;ACnBf,IAAI,WAAW,IAAI;AAGnB,IAAI,cAAc,iBAAS,eAAO,YAAY;AAA9C,IACI,iBAAiB,cAAc,YAAY,WAAW;AAU1D,SAAS,aAAa,OAAO;AAE3B,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,gBAAQ,KAAK,GAAG;AAElB,WAAO,iBAAS,OAAO,YAAY,IAAI;AAAA,EACzC;AACA,MAAI,iBAAS,KAAK,GAAG;AACnB,WAAO,iBAAiB,eAAe,KAAK,KAAK,IAAI;AAAA,EACvD;AACA,MAAI,SAAU,QAAQ;AACtB,SAAQ,UAAU,OAAQ,IAAI,SAAU,CAAC,WAAY,OAAO;AAC9D;AAEA,IAAO,uBAAQ;;;ACnCf,IAAI,eAAe;AAUnB,SAAS,gBAAgB,QAAQ;AAC/B,MAAI,QAAQ,OAAO;AAEnB,SAAO,WAAW,aAAa,KAAK,OAAO,OAAO,KAAK,CAAC,GAAG;AAAA,EAAC;AAC5D,SAAO;AACT;AAEA,IAAO,0BAAQ;;;ACff,IAAI,cAAc;AASlB,SAAS,SAAS,QAAQ;AACxB,SAAO,SACH,OAAO,MAAM,GAAG,wBAAgB,MAAM,IAAI,CAAC,EAAE,QAAQ,aAAa,EAAE,IACpE;AACN;AAEA,IAAO,mBAAQ;;;ACOf,SAAS,SAAS,OAAO;AACvB,MAAI,OAAO,OAAO;AAClB,SAAO,SAAS,SAAS,QAAQ,YAAY,QAAQ;AACvD;AAEA,IAAO,mBAAQ;;;ACzBf,IAAI,MAAM,IAAI;AAGd,IAAI,aAAa;AAGjB,IAAI,aAAa;AAGjB,IAAI,YAAY;AAGhB,IAAI,eAAe;AAyBnB,SAAS,SAAS,OAAO;AACvB,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO;AAAA,EACT;AACA,MAAI,iBAAS,KAAK,GAAG;AACnB,WAAO;AAAA,EACT;AACA,MAAI,iBAAS,KAAK,GAAG;AACnB,QAAI,QAAQ,OAAO,MAAM,WAAW,aAAa,MAAM,QAAQ,IAAI;AACnE,YAAQ,iBAAS,KAAK,IAAK,QAAQ,KAAM;AAAA,EAC3C;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,UAAU,IAAI,QAAQ,CAAC;AAAA,EAChC;AACA,UAAQ,iBAAS,KAAK;AACtB,MAAI,WAAW,WAAW,KAAK,KAAK;AACpC,SAAQ,YAAY,UAAU,KAAK,KAAK,IACpC,aAAa,MAAM,MAAM,CAAC,GAAG,WAAW,IAAI,CAAC,IAC5C,WAAW,KAAK,KAAK,IAAI,MAAM,CAAC;AACvC;AAEA,IAAO,mBAAQ;;;AC5Df,IAAIC,YAAW,IAAI;AAAnB,IACI,cAAc;AAyBlB,SAAS,SAAS,OAAO;AACvB,MAAI,CAAC,OAAO;AACV,WAAO,UAAU,IAAI,QAAQ;AAAA,EAC/B;AACA,UAAQ,iBAAS,KAAK;AACtB,MAAI,UAAUA,aAAY,UAAU,CAACA,WAAU;AAC7C,QAAI,OAAQ,QAAQ,IAAI,KAAK;AAC7B,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,UAAU,QAAQ,QAAQ;AACnC;AAEA,IAAO,mBAAQ;;;ACbf,SAAS,UAAU,OAAO;AACxB,MAAI,SAAS,iBAAS,KAAK,GACvB,YAAY,SAAS;AAEzB,SAAO,WAAW,SAAU,YAAY,SAAS,YAAY,SAAU;AACzE;AAEA,IAAO,oBAAQ;;;ACnBf,SAAS,SAAS,OAAO;AACvB,SAAO;AACT;AAEA,IAAO,mBAAQ;;;AChBf,IAAI,WAAW;AAAf,IACI,UAAU;AADd,IAEI,SAAS;AAFb,IAGI,WAAW;AAmBf,SAAS,WAAW,OAAO;AACzB,MAAI,CAAC,iBAAS,KAAK,GAAG;AACpB,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,mBAAW,KAAK;AAC1B,SAAO,OAAO,WAAW,OAAO,UAAU,OAAO,YAAY,OAAO;AACtE;AAEA,IAAO,qBAAQ;;;ACjCf,IAAI,aAAa,aAAK,oBAAoB;AAE1C,IAAO,qBAAQ;;;ACFf,IAAI,aAAc,WAAW;AAC3B,MAAI,MAAM,SAAS,KAAK,sBAAc,mBAAW,QAAQ,mBAAW,KAAK,YAAY,EAAE;AACvF,SAAO,MAAO,mBAAmB,MAAO;AAC1C,EAAE;AASF,SAAS,SAAS,MAAM;AACtB,SAAO,CAAC,CAAC,cAAe,cAAc;AACxC;AAEA,IAAO,mBAAQ;;;AClBf,IAAI,YAAY,SAAS;AAGzB,IAAI,eAAe,UAAU;AAS7B,SAAS,SAAS,MAAM;AACtB,MAAI,QAAQ,MAAM;AAChB,QAAI;AACF,aAAO,aAAa,KAAK,IAAI;AAAA,IAC/B,SAASC,IAAG;AAAA,IAAC;AACb,QAAI;AACF,aAAQ,OAAO;AAAA,IACjB,SAASA,IAAG;AAAA,IAAC;AAAA,EACf;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;AChBf,IAAI,eAAe;AAGnB,IAAI,eAAe;AAGnB,IAAIC,aAAY,SAAS;AAAzB,IACIC,eAAc,OAAO;AAGzB,IAAIC,gBAAeF,WAAU;AAG7B,IAAIG,kBAAiBF,aAAY;AAGjC,IAAI,aAAa;AAAA,EAAO,MACtBC,cAAa,KAAKC,eAAc,EAAE,QAAQ,cAAc,MAAM,EAC7D,QAAQ,0DAA0D,OAAO,IAAI;AAChF;AAUA,SAAS,aAAa,OAAO;AAC3B,MAAI,CAAC,iBAAS,KAAK,KAAK,iBAAS,KAAK,GAAG;AACvC,WAAO;AAAA,EACT;AACA,MAAI,UAAU,mBAAW,KAAK,IAAI,aAAa;AAC/C,SAAO,QAAQ,KAAK,iBAAS,KAAK,CAAC;AACrC;AAEA,IAAO,uBAAQ;;;ACtCf,SAAS,SAAS,QAAQ,KAAK;AAC7B,SAAO,UAAU,OAAO,SAAY,OAAO,GAAG;AAChD;AAEA,IAAO,mBAAQ;;;ACDf,SAAS,UAAU,QAAQ,KAAK;AAC9B,MAAI,QAAQ,iBAAS,QAAQ,GAAG;AAChC,SAAO,qBAAa,KAAK,IAAI,QAAQ;AACvC;AAEA,IAAO,oBAAQ;;;ACZf,IAAIC,WAAU,kBAAU,cAAM,SAAS;AAEvC,IAAO,kBAAQA;;;ACHf,IAAI,UAAU,mBAAW,IAAI;AAE7B,IAAO,kBAAQ;;;ACMf,IAAI,cAAc,CAAC,kBAAU,mBAAW,SAAS,MAAM,MAAM;AAC3D,kBAAQ,IAAI,MAAM,IAAI;AACtB,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACbf,IAAI,eAAe,OAAO;AAU1B,IAAI,aAAc,2BAAW;AAC3B,WAAS,SAAS;AAAA,EAAC;AACnB,SAAO,SAAS,OAAO;AACrB,QAAI,CAAC,iBAAS,KAAK,GAAG;AACpB,aAAO,CAAC;AAAA,IACV;AACA,QAAI,cAAc;AAChB,aAAO,aAAa,KAAK;AAAA,IAC3B;AACA,WAAO,YAAY;AACnB,QAAI,SAAS,IAAI;AACjB,WAAO,YAAY;AACnB,WAAO;AAAA,EACT;AACF,EAAE;AAEF,IAAO,qBAAQ;;;AClBf,SAAS,WAAW,MAAM;AACxB,SAAO,WAAW;AAIhB,QAAI,OAAO;AACX,YAAQ,KAAK,QAAQ;AAAA,MACnB,KAAK;AAAG,eAAO,IAAI;AAAA,MACnB,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,MAC/B,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MACxC,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MACjD,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC1D,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MACnE,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC5E,KAAK;AAAG,eAAO,IAAI,KAAK,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IACvF;AACA,QAAI,cAAc,mBAAW,KAAK,SAAS,GACvC,SAAS,KAAK,MAAM,aAAa,IAAI;AAIzC,WAAO,iBAAS,MAAM,IAAI,SAAS;AAAA,EACrC;AACF;AAEA,IAAO,qBAAQ;;;AChCf,IAAI,iBAAiB;AAYrB,SAAS,WAAW,MAAM,SAAS,SAAS;AAC1C,MAAI,SAAS,UAAU,gBACnB,OAAO,mBAAW,IAAI;AAE1B,WAAS,UAAU;AACjB,QAAI,KAAM,QAAQ,SAAS,gBAAQ,gBAAgB,UAAW,OAAO;AACrE,WAAO,GAAG,MAAM,SAAS,UAAU,MAAM,SAAS;AAAA,EACpD;AACA,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACjBf,SAAS,MAAM,MAAM,SAAS,MAAM;AAClC,UAAQ,KAAK,QAAQ;AAAA,IACnB,KAAK;AAAG,aAAO,KAAK,KAAK,OAAO;AAAA,IAChC,KAAK;AAAG,aAAO,KAAK,KAAK,SAAS,KAAK,CAAC,CAAC;AAAA,IACzC,KAAK;AAAG,aAAO,KAAK,KAAK,SAAS,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAClD,KAAK;AAAG,aAAO,KAAK,KAAK,SAAS,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,EAC7D;AACA,SAAO,KAAK,MAAM,SAAS,IAAI;AACjC;AAEA,IAAO,gBAAQ;;;ACnBf,IAAI,YAAY,KAAK;AAarB,SAAS,YAAY,MAAM,UAAU,SAAS,WAAW;AACvD,MAAI,YAAY,IACZ,aAAa,KAAK,QAClB,gBAAgB,QAAQ,QACxB,YAAY,IACZ,aAAa,SAAS,QACtB,cAAc,UAAU,aAAa,eAAe,CAAC,GACrD,SAAS,MAAM,aAAa,WAAW,GACvC,cAAc,CAAC;AAEnB,SAAO,EAAE,YAAY,YAAY;AAC/B,WAAO,SAAS,IAAI,SAAS,SAAS;AAAA,EACxC;AACA,SAAO,EAAE,YAAY,eAAe;AAClC,QAAI,eAAe,YAAY,YAAY;AACzC,aAAO,QAAQ,SAAS,CAAC,IAAI,KAAK,SAAS;AAAA,IAC7C;AAAA,EACF;AACA,SAAO,eAAe;AACpB,WAAO,WAAW,IAAI,KAAK,WAAW;AAAA,EACxC;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACrCf,IAAIC,aAAY,KAAK;AAarB,SAAS,iBAAiB,MAAM,UAAU,SAAS,WAAW;AAC5D,MAAI,YAAY,IACZ,aAAa,KAAK,QAClB,eAAe,IACf,gBAAgB,QAAQ,QACxB,aAAa,IACb,cAAc,SAAS,QACvB,cAAcA,WAAU,aAAa,eAAe,CAAC,GACrD,SAAS,MAAM,cAAc,WAAW,GACxC,cAAc,CAAC;AAEnB,SAAO,EAAE,YAAY,aAAa;AAChC,WAAO,SAAS,IAAI,KAAK,SAAS;AAAA,EACpC;AACA,MAAI,SAAS;AACb,SAAO,EAAE,aAAa,aAAa;AACjC,WAAO,SAAS,UAAU,IAAI,SAAS,UAAU;AAAA,EACnD;AACA,SAAO,EAAE,eAAe,eAAe;AACrC,QAAI,eAAe,YAAY,YAAY;AACzC,aAAO,SAAS,QAAQ,YAAY,CAAC,IAAI,KAAK,WAAW;AAAA,IAC3D;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,2BAAQ;;;AChCf,SAAS,aAAa,OAAO,aAAa;AACxC,MAAIC,UAAS,MAAM,QACf,SAAS;AAEb,SAAOA,WAAU;AACf,QAAI,MAAMA,OAAM,MAAM,aAAa;AACjC,QAAE;AAAA,IACJ;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACff,SAAS,aAAa;AAEtB;AAEA,IAAO,qBAAQ;;;ACLf,IAAI,mBAAmB;AASvB,SAAS,YAAY,OAAO;AAC1B,OAAK,cAAc;AACnB,OAAK,cAAc,CAAC;AACpB,OAAK,UAAU;AACf,OAAK,eAAe;AACpB,OAAK,gBAAgB,CAAC;AACtB,OAAK,gBAAgB;AACrB,OAAK,YAAY,CAAC;AACpB;AAGA,YAAY,YAAY,mBAAW,mBAAW,SAAS;AACvD,YAAY,UAAU,cAAc;AAEpC,IAAO,sBAAQ;;;ACff,SAAS,OAAO;AAEhB;AAEA,IAAO,eAAQ;;;ACNf,IAAI,UAAU,CAAC,kBAAU,eAAO,SAAS,MAAM;AAC7C,SAAO,gBAAQ,IAAI,IAAI;AACzB;AAEA,IAAO,kBAAQ;;;ACbf,IAAI,YAAY,CAAC;AAEjB,IAAO,oBAAQ;;;ACAf,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AASjC,SAAS,YAAY,MAAM;AACzB,MAAI,SAAU,KAAK,OAAO,IACtB,QAAQ,kBAAU,MAAM,GACxBE,UAASD,gBAAe,KAAK,mBAAW,MAAM,IAAI,MAAM,SAAS;AAErE,SAAOC,WAAU;AACf,QAAI,OAAO,MAAMA,OAAM,GACnB,YAAY,KAAK;AACrB,QAAI,aAAa,QAAQ,aAAa,MAAM;AAC1C,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACpBf,SAAS,cAAc,OAAO,UAAU;AACtC,OAAK,cAAc;AACnB,OAAK,cAAc,CAAC;AACpB,OAAK,YAAY,CAAC,CAAC;AACnB,OAAK,YAAY;AACjB,OAAK,aAAa;AACpB;AAEA,cAAc,YAAY,mBAAW,mBAAW,SAAS;AACzD,cAAc,UAAU,cAAc;AAEtC,IAAO,wBAAQ;;;ACbf,SAAS,UAAU,QAAQ,OAAO;AAChC,MAAI,QAAQ,IACRC,UAAS,OAAO;AAEpB,YAAU,QAAQ,MAAMA,OAAM;AAC9B,SAAO,EAAE,QAAQA,SAAQ;AACvB,UAAM,KAAK,IAAI,OAAO,KAAK;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACRf,SAAS,aAAa,SAAS;AAC7B,MAAI,mBAAmB,qBAAa;AAClC,WAAO,QAAQ,MAAM;AAAA,EACvB;AACA,MAAI,SAAS,IAAI,sBAAc,QAAQ,aAAa,QAAQ,SAAS;AACrE,SAAO,cAAc,kBAAU,QAAQ,WAAW;AAClD,SAAO,YAAa,QAAQ;AAC5B,SAAO,aAAa,QAAQ;AAC5B,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACdf,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAuHjC,SAAS,OAAO,OAAO;AACrB,MAAI,qBAAa,KAAK,KAAK,CAAC,gBAAQ,KAAK,KAAK,EAAE,iBAAiB,sBAAc;AAC7E,QAAI,iBAAiB,uBAAe;AAClC,aAAO;AAAA,IACT;AACA,QAAIC,gBAAe,KAAK,OAAO,aAAa,GAAG;AAC7C,aAAO,qBAAa,KAAK;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,IAAI,sBAAc,KAAK;AAChC;AAGA,OAAO,YAAY,mBAAW;AAC9B,OAAO,UAAU,cAAc;AAE/B,IAAO,wBAAQ;;;ACrIf,SAAS,WAAW,MAAM;AACxB,MAAI,WAAW,oBAAY,IAAI,GAC3B,QAAQ,sBAAO,QAAQ;AAE3B,MAAI,OAAO,SAAS,cAAc,EAAE,YAAY,oBAAY,YAAY;AACtE,WAAO;AAAA,EACT;AACA,MAAI,SAAS,OAAO;AAClB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,gBAAQ,KAAK;AACxB,SAAO,CAAC,CAAC,QAAQ,SAAS,KAAK,CAAC;AAClC;AAEA,IAAO,qBAAQ;;;AC1Bf,IAAI,YAAY;AAAhB,IACI,WAAW;AAGf,IAAI,YAAY,KAAK;AAWrB,SAAS,SAAS,MAAM;AACtB,MAAI,QAAQ,GACR,aAAa;AAEjB,SAAO,WAAW;AAChB,QAAI,QAAQ,UAAU,GAClB,YAAY,YAAY,QAAQ;AAEpC,iBAAa;AACb,QAAI,YAAY,GAAG;AACjB,UAAI,EAAE,SAAS,WAAW;AACxB,eAAO,UAAU,CAAC;AAAA,MACpB;AAAA,IACF,OAAO;AACL,cAAQ;AAAA,IACV;AACA,WAAO,KAAK,MAAM,QAAW,SAAS;AAAA,EACxC;AACF;AAEA,IAAO,mBAAQ;;;ACnBf,IAAI,UAAU,iBAAS,mBAAW;AAElC,IAAO,kBAAQ;;;AClBf,IAAI,gBAAgB;AAApB,IACI,iBAAiB;AASrB,SAAS,eAAe,QAAQ;AAC9B,MAAI,QAAQ,OAAO,MAAM,aAAa;AACtC,SAAO,QAAQ,MAAM,CAAC,EAAE,MAAM,cAAc,IAAI,CAAC;AACnD;AAEA,IAAO,yBAAQ;;;ACff,IAAI,gBAAgB;AAUpB,SAAS,kBAAkB,QAAQ,SAAS;AAC1C,MAAIC,UAAS,QAAQ;AACrB,MAAI,CAACA,SAAQ;AACX,WAAO;AAAA,EACT;AACA,MAAI,YAAYA,UAAS;AACzB,UAAQ,SAAS,KAAKA,UAAS,IAAI,OAAO,MAAM,QAAQ,SAAS;AACjE,YAAU,QAAQ,KAAKA,UAAS,IAAI,OAAO,GAAG;AAC9C,SAAO,OAAO,QAAQ,eAAe,yBAAyB,UAAU,QAAQ;AAClF;AAEA,IAAO,4BAAQ;;;ACHf,SAAS,SAAS,OAAO;AACvB,SAAO,WAAW;AAChB,WAAO;AAAA,EACT;AACF;AAEA,IAAO,mBAAQ;;;ACvBf,IAAI,iBAAkB,WAAW;AAC/B,MAAI;AACF,QAAI,OAAO,kBAAU,QAAQ,gBAAgB;AAC7C,SAAK,CAAC,GAAG,IAAI,CAAC,CAAC;AACf,WAAO;AAAA,EACT,SAASC,IAAG;AAAA,EAAC;AACf,EAAE;AAEF,IAAO,yBAAQ;;;ACEf,IAAI,kBAAkB,CAAC,yBAAiB,mBAAW,SAAS,MAAM,QAAQ;AACxE,SAAO,uBAAe,MAAM,YAAY;AAAA,IACtC,gBAAgB;AAAA,IAChB,cAAc;AAAA,IACd,SAAS,iBAAS,MAAM;AAAA,IACxB,YAAY;AAAA,EACd,CAAC;AACH;AAEA,IAAO,0BAAQ;;;ACVf,IAAI,cAAc,iBAAS,uBAAe;AAE1C,IAAO,sBAAQ;;;ACJf,SAAS,UAAU,OAAO,UAAU;AAClC,MAAI,QAAQ,IACRC,UAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,SAAS,MAAM,KAAK,GAAG,OAAO,KAAK,MAAM,OAAO;AAClD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACVf,SAAS,cAAc,OAAO,WAAW,WAAW,WAAW;AAC7D,MAAIC,UAAS,MAAM,QACf,QAAQ,aAAa,YAAY,IAAI;AAEzC,SAAQ,YAAY,UAAU,EAAE,QAAQA,SAAS;AAC/C,QAAI,UAAU,MAAM,KAAK,GAAG,OAAO,KAAK,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;AChBf,SAAS,UAAU,OAAO;AACxB,SAAO,UAAU;AACnB;AAEA,IAAO,oBAAQ;;;ACDf,SAAS,cAAc,OAAO,OAAO,WAAW;AAC9C,MAAI,QAAQ,YAAY,GACpBC,UAAS,MAAM;AAEnB,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,MAAM,KAAK,MAAM,OAAO;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;ACTf,SAAS,YAAY,OAAO,OAAO,WAAW;AAC5C,SAAO,UAAU,QACb,sBAAc,OAAO,OAAO,SAAS,IACrC,sBAAc,OAAO,mBAAW,SAAS;AAC/C;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,cAAc,OAAO,OAAO;AACnC,MAAIC,UAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAO,CAAC,CAACA,WAAU,oBAAY,OAAO,OAAO,CAAC,IAAI;AACpD;AAEA,IAAO,wBAAQ;;;ACZf,IAAIC,kBAAiB;AAArB,IACI,qBAAqB;AADzB,IAEI,kBAAkB;AAFtB,IAGI,wBAAwB;AAH5B,IAII,oBAAoB;AAJxB,IAKI,0BAA0B;AAL9B,IAMI,gBAAgB;AANpB,IAOI,kBAAkB;AAPtB,IAQI,iBAAiB;AAGrB,IAAI,YAAY;AAAA,EACd,CAAC,OAAO,aAAa;AAAA,EACrB,CAAC,QAAQA,eAAc;AAAA,EACvB,CAAC,WAAW,kBAAkB;AAAA,EAC9B,CAAC,SAAS,eAAe;AAAA,EACzB,CAAC,cAAc,qBAAqB;AAAA,EACpC,CAAC,QAAQ,cAAc;AAAA,EACvB,CAAC,WAAW,iBAAiB;AAAA,EAC7B,CAAC,gBAAgB,uBAAuB;AAAA,EACxC,CAAC,SAAS,eAAe;AAC3B;AAUA,SAAS,kBAAkB,SAAS,SAAS;AAC3C,oBAAU,WAAW,SAAS,MAAM;AAClC,QAAI,QAAQ,OAAO,KAAK,CAAC;AACzB,QAAK,UAAU,KAAK,CAAC,KAAM,CAAC,sBAAc,SAAS,KAAK,GAAG;AACzD,cAAQ,KAAK,KAAK;AAAA,IACpB;AAAA,EACF,CAAC;AACD,SAAO,QAAQ,KAAK;AACtB;AAEA,IAAO,4BAAQ;;;AC9Bf,SAAS,gBAAgB,SAAS,WAAW,SAAS;AACpD,MAAI,SAAU,YAAY;AAC1B,SAAO,oBAAY,SAAS,0BAAkB,QAAQ,0BAAkB,uBAAe,MAAM,GAAG,OAAO,CAAC,CAAC;AAC3G;AAEA,IAAO,0BAAQ;;;ACff,IAAIC,kBAAiB;AAArB,IACIC,sBAAqB;AADzB,IAEI,wBAAwB;AAF5B,IAGIC,mBAAkB;AAHtB,IAIIC,qBAAoB;AAJxB,IAKIC,2BAA0B;AAmB9B,SAAS,cAAc,MAAM,SAAS,UAAU,aAAa,SAAS,UAAU,SAAS,QAAQ,KAAK,OAAO;AAC3G,MAAI,UAAU,UAAUF,kBACpB,aAAa,UAAU,UAAU,QACjC,kBAAkB,UAAU,SAAY,SACxC,cAAc,UAAU,WAAW,QACnC,mBAAmB,UAAU,SAAY;AAE7C,aAAY,UAAUC,qBAAoBC;AAC1C,aAAW,EAAE,UAAUA,2BAA0BD;AAEjD,MAAI,EAAE,UAAU,wBAAwB;AACtC,eAAW,EAAEH,kBAAiBC;AAAA,EAChC;AACA,MAAI,UAAU;AAAA,IACZ;AAAA,IAAM;AAAA,IAAS;AAAA,IAAS;AAAA,IAAa;AAAA,IAAY;AAAA,IACjD;AAAA,IAAiB;AAAA,IAAQ;AAAA,IAAK;AAAA,EAChC;AAEA,MAAI,SAAS,SAAS,MAAM,QAAW,OAAO;AAC9C,MAAI,mBAAW,IAAI,GAAG;AACpB,oBAAQ,QAAQ,OAAO;AAAA,EACzB;AACA,SAAO,cAAc;AACrB,SAAO,wBAAgB,QAAQ,MAAM,OAAO;AAC9C;AAEA,IAAO,wBAAQ;;;AChDf,SAAS,UAAU,MAAM;AACvB,MAAI,SAAS;AACb,SAAO,OAAO;AAChB;AAEA,IAAO,oBAAQ;;;ACXf,IAAI,mBAAmB;AAGvB,IAAI,WAAW;AAUf,SAAS,QAAQ,OAAOI,SAAQ;AAC9B,MAAI,OAAO,OAAO;AAClB,EAAAA,UAASA,WAAU,OAAO,mBAAmBA;AAE7C,SAAO,CAAC,CAACA,YACN,QAAQ,YACN,QAAQ,YAAY,SAAS,KAAK,KAAK,OACrC,QAAQ,MAAM,QAAQ,KAAK,KAAK,QAAQA;AACjD;AAEA,IAAO,kBAAQ;;;ACpBf,IAAI,YAAY,KAAK;AAYrB,SAAS,QAAQ,OAAO,SAAS;AAC/B,MAAI,YAAY,MAAM,QAClBC,UAAS,UAAU,QAAQ,QAAQ,SAAS,GAC5C,WAAW,kBAAU,KAAK;AAE9B,SAAOA,WAAU;AACf,QAAI,QAAQ,QAAQA,OAAM;AAC1B,UAAMA,OAAM,IAAI,gBAAQ,OAAO,SAAS,IAAI,SAAS,KAAK,IAAI;AAAA,EAChE;AACA,SAAO;AACT;AAEA,IAAO,kBAAQ;;;AC3Bf,IAAI,cAAc;AAWlB,SAAS,eAAe,OAAO,aAAa;AAC1C,MAAI,QAAQ,IACRC,UAAS,MAAM,QACf,WAAW,GACX,SAAS,CAAC;AAEd,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,UAAU,eAAe,UAAU,aAAa;AAClD,YAAM,KAAK,IAAI;AACf,aAAO,UAAU,IAAI;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,yBAAQ;;;ACjBf,IAAIC,kBAAiB;AAArB,IACIC,sBAAqB;AADzB,IAEIC,mBAAkB;AAFtB,IAGIC,yBAAwB;AAH5B,IAIIC,iBAAgB;AAJpB,IAKIC,kBAAiB;AAqBrB,SAAS,aAAa,MAAM,SAAS,SAAS,UAAU,SAAS,eAAe,cAAc,QAAQ,KAAK,OAAO;AAChH,MAAI,QAAQ,UAAUD,gBAClB,SAAS,UAAUJ,iBACnB,YAAY,UAAUC,qBACtB,YAAY,WAAWC,mBAAkBC,yBACzC,SAAS,UAAUE,iBACnB,OAAO,YAAY,SAAY,mBAAW,IAAI;AAElD,WAAS,UAAU;AACjB,QAAIC,UAAS,UAAU,QACnB,OAAO,MAAMA,OAAM,GACnB,QAAQA;AAEZ,WAAO,SAAS;AACd,WAAK,KAAK,IAAI,UAAU,KAAK;AAAA,IAC/B;AACA,QAAI,WAAW;AACb,UAAI,cAAc,kBAAU,OAAO,GAC/B,eAAe,qBAAa,MAAM,WAAW;AAAA,IACnD;AACA,QAAI,UAAU;AACZ,aAAO,oBAAY,MAAM,UAAU,SAAS,SAAS;AAAA,IACvD;AACA,QAAI,eAAe;AACjB,aAAO,yBAAiB,MAAM,eAAe,cAAc,SAAS;AAAA,IACtE;AACA,IAAAA,WAAU;AACV,QAAI,aAAaA,UAAS,OAAO;AAC/B,UAAI,aAAa,uBAAe,MAAM,WAAW;AACjD,aAAO;AAAA,QACL;AAAA,QAAM;AAAA,QAAS;AAAA,QAAc,QAAQ;AAAA,QAAa;AAAA,QAClD;AAAA,QAAM;AAAA,QAAY;AAAA,QAAQ;AAAA,QAAK,QAAQA;AAAA,MACzC;AAAA,IACF;AACA,QAAI,cAAc,SAAS,UAAU,MACjC,KAAK,YAAY,YAAY,IAAI,IAAI;AAEzC,IAAAA,UAAS,KAAK;AACd,QAAI,QAAQ;AACV,aAAO,gBAAQ,MAAM,MAAM;AAAA,IAC7B,WAAW,UAAUA,UAAS,GAAG;AAC/B,WAAK,QAAQ;AAAA,IACf;AACA,QAAI,SAAS,MAAMA,SAAQ;AACzB,WAAK,SAAS;AAAA,IAChB;AACA,QAAI,QAAQ,SAAS,gBAAQ,gBAAgB,SAAS;AACpD,WAAK,QAAQ,mBAAW,EAAE;AAAA,IAC5B;AACA,WAAO,GAAG,MAAM,aAAa,IAAI;AAAA,EACnC;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;AC1Ef,SAAS,YAAY,MAAM,SAAS,OAAO;AACzC,MAAI,OAAO,mBAAW,IAAI;AAE1B,WAAS,UAAU;AACjB,QAAIC,UAAS,UAAU,QACnB,OAAO,MAAMA,OAAM,GACnB,QAAQA,SACR,cAAc,kBAAU,OAAO;AAEnC,WAAO,SAAS;AACd,WAAK,KAAK,IAAI,UAAU,KAAK;AAAA,IAC/B;AACA,QAAI,UAAWA,UAAS,KAAK,KAAK,CAAC,MAAM,eAAe,KAAKA,UAAS,CAAC,MAAM,cACzE,CAAC,IACD,uBAAe,MAAM,WAAW;AAEpC,IAAAA,WAAU,QAAQ;AAClB,QAAIA,UAAS,OAAO;AAClB,aAAO;AAAA,QACL;AAAA,QAAM;AAAA,QAAS;AAAA,QAAc,QAAQ;AAAA,QAAa;AAAA,QAClD;AAAA,QAAM;AAAA,QAAS;AAAA,QAAW;AAAA,QAAW,QAAQA;AAAA,MAAM;AAAA,IACvD;AACA,QAAI,KAAM,QAAQ,SAAS,gBAAQ,gBAAgB,UAAW,OAAO;AACrE,WAAO,cAAM,IAAI,MAAM,IAAI;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACxCf,IAAIC,kBAAiB;AAcrB,SAAS,cAAc,MAAM,SAAS,SAAS,UAAU;AACvD,MAAI,SAAS,UAAUA,iBACnB,OAAO,mBAAW,IAAI;AAE1B,WAAS,UAAU;AACjB,QAAI,YAAY,IACZ,aAAa,UAAU,QACvB,YAAY,IACZ,aAAa,SAAS,QACtB,OAAO,MAAM,aAAa,UAAU,GACpC,KAAM,QAAQ,SAAS,gBAAQ,gBAAgB,UAAW,OAAO;AAErE,WAAO,EAAE,YAAY,YAAY;AAC/B,WAAK,SAAS,IAAI,SAAS,SAAS;AAAA,IACtC;AACA,WAAO,cAAc;AACnB,WAAK,WAAW,IAAI,UAAU,EAAE,SAAS;AAAA,IAC3C;AACA,WAAO,cAAM,IAAI,SAAS,UAAU,MAAM,IAAI;AAAA,EAChD;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;ACrCf,IAAIC,eAAc;AAGlB,IAAIC,kBAAiB;AAArB,IACIC,sBAAqB;AADzB,IAEIC,yBAAwB;AAF5B,IAGIC,mBAAkB;AAHtB,IAIIC,iBAAgB;AAJpB,IAKIC,mBAAkB;AAGtB,IAAIC,aAAY,KAAK;AAkBrB,SAAS,UAAU,MAAM,QAAQ;AAC/B,MAAI,UAAU,KAAK,CAAC,GAChB,aAAa,OAAO,CAAC,GACrB,aAAa,UAAU,YACvB,WAAW,cAAcN,kBAAiBC,sBAAqBG;AAEnE,MAAI,UACA,cAAcA,kBAAmB,WAAWD,oBAC5C,cAAcC,kBAAmB,WAAWC,oBAAqB,KAAK,CAAC,EAAE,UAAU,OAAO,CAAC,KAC3F,eAAeD,iBAAgBC,qBAAsB,OAAO,CAAC,EAAE,UAAU,OAAO,CAAC,KAAO,WAAWF;AAGvG,MAAI,EAAE,YAAY,UAAU;AAC1B,WAAO;AAAA,EACT;AAEA,MAAI,aAAaH,iBAAgB;AAC/B,SAAK,CAAC,IAAI,OAAO,CAAC;AAElB,kBAAc,UAAUA,kBAAiB,IAAIE;AAAA,EAC/C;AAEA,MAAI,QAAQ,OAAO,CAAC;AACpB,MAAI,OAAO;AACT,QAAI,WAAW,KAAK,CAAC;AACrB,SAAK,CAAC,IAAI,WAAW,oBAAY,UAAU,OAAO,OAAO,CAAC,CAAC,IAAI;AAC/D,SAAK,CAAC,IAAI,WAAW,uBAAe,KAAK,CAAC,GAAGH,YAAW,IAAI,OAAO,CAAC;AAAA,EACtE;AAEA,UAAQ,OAAO,CAAC;AAChB,MAAI,OAAO;AACT,eAAW,KAAK,CAAC;AACjB,SAAK,CAAC,IAAI,WAAW,yBAAiB,UAAU,OAAO,OAAO,CAAC,CAAC,IAAI;AACpE,SAAK,CAAC,IAAI,WAAW,uBAAe,KAAK,CAAC,GAAGA,YAAW,IAAI,OAAO,CAAC;AAAA,EACtE;AAEA,UAAQ,OAAO,CAAC;AAChB,MAAI,OAAO;AACT,SAAK,CAAC,IAAI;AAAA,EACZ;AAEA,MAAI,aAAaK,gBAAe;AAC9B,SAAK,CAAC,IAAI,KAAK,CAAC,KAAK,OAAO,OAAO,CAAC,IAAIE,WAAU,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,EACtE;AAEA,MAAI,KAAK,CAAC,KAAK,MAAM;AACnB,SAAK,CAAC,IAAI,OAAO,CAAC;AAAA,EACpB;AAEA,OAAK,CAAC,IAAI,OAAO,CAAC;AAClB,OAAK,CAAC,IAAI;AAEV,SAAO;AACT;AAEA,IAAO,oBAAQ;;;AC7Ef,IAAI,kBAAkB;AAGtB,IAAIC,kBAAiB;AAArB,IACIC,sBAAqB;AADzB,IAEIC,mBAAkB;AAFtB,IAGIC,yBAAwB;AAH5B,IAIIC,qBAAoB;AAJxB,IAKIC,2BAA0B;AAG9B,IAAIC,aAAY,KAAK;AA2BrB,SAAS,WAAW,MAAM,SAAS,SAAS,UAAU,SAAS,QAAQ,KAAK,OAAO;AACjF,MAAI,YAAY,UAAUL;AAC1B,MAAI,CAAC,aAAa,OAAO,QAAQ,YAAY;AAC3C,UAAM,IAAI,UAAU,eAAe;AAAA,EACrC;AACA,MAAIM,UAAS,WAAW,SAAS,SAAS;AAC1C,MAAI,CAACA,SAAQ;AACX,eAAW,EAAEH,qBAAoBC;AACjC,eAAW,UAAU;AAAA,EACvB;AACA,QAAM,QAAQ,SAAY,MAAMC,WAAU,kBAAU,GAAG,GAAG,CAAC;AAC3D,UAAQ,UAAU,SAAY,QAAQ,kBAAU,KAAK;AACrD,EAAAC,WAAU,UAAU,QAAQ,SAAS;AAErC,MAAI,UAAUF,0BAAyB;AACrC,QAAI,gBAAgB,UAChB,eAAe;AAEnB,eAAW,UAAU;AAAA,EACvB;AACA,MAAI,OAAO,YAAY,SAAY,gBAAQ,IAAI;AAE/C,MAAI,UAAU;AAAA,IACZ;AAAA,IAAM;AAAA,IAAS;AAAA,IAAS;AAAA,IAAU;AAAA,IAAS;AAAA,IAAe;AAAA,IAC1D;AAAA,IAAQ;AAAA,IAAK;AAAA,EACf;AAEA,MAAI,MAAM;AACR,sBAAU,SAAS,IAAI;AAAA,EACzB;AACA,SAAO,QAAQ,CAAC;AAChB,YAAU,QAAQ,CAAC;AACnB,YAAU,QAAQ,CAAC;AACnB,aAAW,QAAQ,CAAC;AACpB,YAAU,QAAQ,CAAC;AACnB,UAAQ,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,SAC/B,YAAY,IAAI,KAAK,SACtBC,WAAU,QAAQ,CAAC,IAAIC,SAAQ,CAAC;AAEpC,MAAI,CAAC,SAAS,WAAWL,mBAAkBC,yBAAwB;AACjE,eAAW,EAAED,mBAAkBC;AAAA,EACjC;AACA,MAAI,CAAC,WAAW,WAAWH,iBAAgB;AACzC,QAAI,SAAS,mBAAW,MAAM,SAAS,OAAO;AAAA,EAChD,WAAW,WAAWE,oBAAmB,WAAWC,wBAAuB;AACzE,aAAS,oBAAY,MAAM,SAAS,KAAK;AAAA,EAC3C,YAAY,WAAWC,sBAAqB,YAAYJ,kBAAiBI,wBAAuB,CAAC,QAAQ,QAAQ;AAC/G,aAAS,sBAAc,MAAM,SAAS,SAAS,QAAQ;AAAA,EACzD,OAAO;AACL,aAAS,qBAAa,MAAM,QAAW,OAAO;AAAA,EAChD;AACA,MAAI,SAAS,OAAO,sBAAc;AAClC,SAAO,wBAAgB,OAAO,QAAQ,OAAO,GAAG,MAAM,OAAO;AAC/D;AAEA,IAAO,qBAAQ;;;AC9Ff,SAAS,gBAAgB,QAAQ,KAAK,OAAO;AAC3C,MAAI,OAAO,eAAe,wBAAgB;AACxC,2BAAe,QAAQ,KAAK;AAAA,MAC1B,gBAAgB;AAAA,MAChB,cAAc;AAAA,MACd,SAAS;AAAA,MACT,YAAY;AAAA,IACd,CAAC;AAAA,EACH,OAAO;AACL,WAAO,GAAG,IAAI;AAAA,EAChB;AACF;AAEA,IAAO,0BAAQ;;;ACQf,SAAS,GAAG,OAAO,OAAO;AACxB,SAAO,UAAU,SAAU,UAAU,SAAS,UAAU;AAC1D;AAEA,IAAO,aAAQ;;;AChCf,IAAII,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAYjC,SAAS,YAAY,QAAQ,KAAK,OAAO;AACvC,MAAI,WAAW,OAAO,GAAG;AACzB,MAAI,EAAEC,gBAAe,KAAK,QAAQ,GAAG,KAAK,WAAG,UAAU,KAAK,MACvD,UAAU,UAAa,EAAE,OAAO,SAAU;AAC7C,4BAAgB,QAAQ,KAAK,KAAK;AAAA,EACpC;AACF;AAEA,IAAO,sBAAQ;;;ACxBf,IAAIC,aAAY,KAAK;AAWrB,SAAS,SAAS,MAAM,OAAO,WAAW;AACxC,UAAQA,WAAU,UAAU,SAAa,KAAK,SAAS,IAAK,OAAO,CAAC;AACpE,SAAO,WAAW;AAChB,QAAI,OAAO,WACP,QAAQ,IACRC,UAASD,WAAU,KAAK,SAAS,OAAO,CAAC,GACzC,QAAQ,MAAMC,OAAM;AAExB,WAAO,EAAE,QAAQA,SAAQ;AACvB,YAAM,KAAK,IAAI,KAAK,QAAQ,KAAK;AAAA,IACnC;AACA,YAAQ;AACR,QAAI,YAAY,MAAM,QAAQ,CAAC;AAC/B,WAAO,EAAE,QAAQ,OAAO;AACtB,gBAAU,KAAK,IAAI,KAAK,KAAK;AAAA,IAC/B;AACA,cAAU,KAAK,IAAI,UAAU,KAAK;AAClC,WAAO,cAAM,MAAM,MAAM,SAAS;AAAA,EACpC;AACF;AAEA,IAAO,mBAAQ;;;ACvBf,SAAS,SAAS,MAAM,OAAO;AAC7B,SAAO,oBAAY,iBAAS,MAAM,OAAO,gBAAQ,GAAG,OAAO,EAAE;AAC/D;AAEA,IAAO,mBAAQ;;;ACff,IAAIC,oBAAmB;AA4BvB,SAAS,SAAS,OAAO;AACvB,SAAO,OAAO,SAAS,YACrB,QAAQ,MAAM,QAAQ,KAAK,KAAK,SAASA;AAC7C;AAEA,IAAO,mBAAQ;;;ACNf,SAAS,YAAY,OAAO;AAC1B,SAAO,SAAS,QAAQ,iBAAS,MAAM,MAAM,KAAK,CAAC,mBAAW,KAAK;AACrE;AAEA,IAAO,sBAAQ;;;AC/Bf,IAAIC,eAAc,OAAO;AASzB,SAAS,YAAY,OAAO;AAC1B,MAAI,OAAO,SAAS,MAAM,aACtB,QAAS,OAAO,QAAQ,cAAc,KAAK,aAAcA;AAE7D,SAAO,UAAU;AACnB;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,UAAU,GAAG,UAAU;AAC9B,MAAI,QAAQ,IACR,SAAS,MAAM,CAAC;AAEpB,SAAO,EAAE,QAAQ,GAAG;AAClB,WAAO,KAAK,IAAI,SAAS,KAAK;AAAA,EAChC;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACff,IAAI,UAAU;AASd,SAAS,gBAAgB,OAAO;AAC9B,SAAO,qBAAa,KAAK,KAAK,mBAAW,KAAK,KAAK;AACrD;AAEA,IAAO,0BAAQ;;;ACbf,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAGjC,IAAI,uBAAuBA,aAAY;AAoBvC,IAAI,cAAc,wBAAgB,2BAAW;AAAE,SAAO;AAAW,EAAE,CAAC,IAAI,0BAAkB,SAAS,OAAO;AACxG,SAAO,qBAAa,KAAK,KAAKC,gBAAe,KAAK,OAAO,QAAQ,KAC/D,CAAC,qBAAqB,KAAK,OAAO,QAAQ;AAC9C;AAEA,IAAO,sBAAQ;;;ACtBf,SAAS,YAAY;AACnB,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACbf,IAAI,cAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;AAGhF,IAAI,aAAa,eAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;AAG3F,IAAI,gBAAgB,cAAc,WAAW,YAAY;AAGzD,IAAI,SAAS,gBAAgB,aAAK,SAAS;AAG3C,IAAI,iBAAiB,SAAS,OAAO,WAAW;AAmBhD,IAAIC,YAAW,kBAAkB;AAEjC,IAAO,mBAAQA;;;AChCf,IAAIC,WAAU;AAAd,IACI,WAAW;AADf,IAEI,UAAU;AAFd,IAGI,UAAU;AAHd,IAII,WAAW;AAJf,IAKIC,WAAU;AALd,IAMI,SAAS;AANb,IAOI,YAAY;AAPhB,IAQI,YAAY;AARhB,IASI,YAAY;AAThB,IAUI,SAAS;AAVb,IAWI,YAAY;AAXhB,IAYI,aAAa;AAEjB,IAAI,iBAAiB;AAArB,IACI,cAAc;AADlB,IAEI,aAAa;AAFjB,IAGI,aAAa;AAHjB,IAII,UAAU;AAJd,IAKI,WAAW;AALf,IAMI,WAAW;AANf,IAOI,WAAW;AAPf,IAQI,kBAAkB;AARtB,IASI,YAAY;AAThB,IAUI,YAAY;AAGhB,IAAI,iBAAiB,CAAC;AACtB,eAAe,UAAU,IAAI,eAAe,UAAU,IACtD,eAAe,OAAO,IAAI,eAAe,QAAQ,IACjD,eAAe,QAAQ,IAAI,eAAe,QAAQ,IAClD,eAAe,eAAe,IAAI,eAAe,SAAS,IAC1D,eAAe,SAAS,IAAI;AAC5B,eAAeD,QAAO,IAAI,eAAe,QAAQ,IACjD,eAAe,cAAc,IAAI,eAAe,OAAO,IACvD,eAAe,WAAW,IAAI,eAAe,OAAO,IACpD,eAAe,QAAQ,IAAI,eAAeC,QAAO,IACjD,eAAe,MAAM,IAAI,eAAe,SAAS,IACjD,eAAe,SAAS,IAAI,eAAe,SAAS,IACpD,eAAe,MAAM,IAAI,eAAe,SAAS,IACjD,eAAe,UAAU,IAAI;AAS7B,SAAS,iBAAiB,OAAO;AAC/B,SAAO,qBAAa,KAAK,KACvB,iBAAS,MAAM,MAAM,KAAK,CAAC,CAAC,eAAe,mBAAW,KAAK,CAAC;AAChE;AAEA,IAAO,2BAAQ;;;ACpDf,SAAS,UAAU,MAAM;AACvB,SAAO,SAAS,OAAO;AACrB,WAAO,KAAK,KAAK;AAAA,EACnB;AACF;AAEA,IAAO,oBAAQ;;;ACVf,IAAIC,eAAc,OAAO,WAAW,YAAY,WAAW,CAAC,QAAQ,YAAY;AAGhF,IAAIC,cAAaD,gBAAe,OAAO,UAAU,YAAY,UAAU,CAAC,OAAO,YAAY;AAG3F,IAAIE,iBAAgBD,eAAcA,YAAW,YAAYD;AAGzD,IAAI,cAAcE,kBAAiB,mBAAW;AAG9C,IAAI,WAAY,WAAW;AACzB,MAAI;AAEF,QAAI,QAAQD,eAAcA,YAAW,WAAWA,YAAW,QAAQ,MAAM,EAAE;AAE3E,QAAI,OAAO;AACT,aAAO;AAAA,IACT;AAGA,WAAO,eAAe,YAAY,WAAW,YAAY,QAAQ,MAAM;AAAA,EACzE,SAASE,IAAG;AAAA,EAAC;AACf,EAAE;AAEF,IAAO,mBAAQ;;;ACxBf,IAAI,mBAAmB,oBAAY,iBAAS;AAmB5C,IAAI,eAAe,mBAAmB,kBAAU,gBAAgB,IAAI;AAEpE,IAAO,uBAAQ;;;AClBf,IAAIC,eAAc,OAAO;AAGzB,IAAIC,kBAAiBD,aAAY;AAUjC,SAAS,cAAc,OAAO,WAAW;AACvC,MAAI,QAAQ,gBAAQ,KAAK,GACrB,QAAQ,CAAC,SAAS,oBAAY,KAAK,GACnC,SAAS,CAAC,SAAS,CAAC,SAAS,iBAAS,KAAK,GAC3C,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,qBAAa,KAAK,GAC1D,cAAc,SAAS,SAAS,UAAU,QAC1C,SAAS,cAAc,kBAAU,MAAM,QAAQ,MAAM,IAAI,CAAC,GAC1DE,UAAS,OAAO;AAEpB,WAAS,OAAO,OAAO;AACrB,SAAK,aAAaD,gBAAe,KAAK,OAAO,GAAG,MAC5C,EAAE;AAAA,KAEC,OAAO;AAAA,IAEN,WAAW,OAAO,YAAY,OAAO;AAAA,IAErC,WAAW,OAAO,YAAY,OAAO,gBAAgB,OAAO;AAAA,IAE7D,gBAAQ,KAAKC,OAAM,KAClB;AACN,aAAO,KAAK,GAAG;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,wBAAQ;;;ACxCf,SAAS,QAAQ,MAAM,WAAW;AAChC,SAAO,SAAS,KAAK;AACnB,WAAO,KAAK,UAAU,GAAG,CAAC;AAAA,EAC5B;AACF;AAEA,IAAO,kBAAQ;;;ACXf,IAAI,aAAa,gBAAQ,OAAO,MAAM,MAAM;AAE5C,IAAO,qBAAQ;;;ACDf,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,kBAAiBD,cAAY;AASjC,SAAS,SAAS,QAAQ;AACxB,MAAI,CAAC,oBAAY,MAAM,GAAG;AACxB,WAAO,mBAAW,MAAM;AAAA,EAC1B;AACA,MAAI,SAAS,CAAC;AACd,WAAS,OAAO,OAAO,MAAM,GAAG;AAC9B,QAAIC,gBAAe,KAAK,QAAQ,GAAG,KAAK,OAAO,eAAe;AAC5D,aAAO,KAAK,GAAG;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACGf,SAAS,KAAK,QAAQ;AACpB,SAAO,oBAAY,MAAM,IAAI,sBAAc,MAAM,IAAI,iBAAS,MAAM;AACtE;AAEA,IAAO,eAAQ;;;AChCf,IAAI,eAAe;AAAnB,IACI,gBAAgB;AAUpB,SAAS,MAAM,OAAO,QAAQ;AAC5B,MAAI,gBAAQ,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,OAAO;AAClB,MAAI,QAAQ,YAAY,QAAQ,YAAY,QAAQ,aAChD,SAAS,QAAQ,iBAAS,KAAK,GAAG;AACpC,WAAO;AAAA,EACT;AACA,SAAO,cAAc,KAAK,KAAK,KAAK,CAAC,aAAa,KAAK,KAAK,KACzD,UAAU,QAAQ,SAAS,OAAO,MAAM;AAC7C;AAEA,IAAO,gBAAQ;;;ACzBf,IAAI,eAAe,kBAAU,QAAQ,QAAQ;AAE7C,IAAO,uBAAQ;;;ACIf,SAAS,YAAY;AACnB,OAAK,WAAW,uBAAe,qBAAa,IAAI,IAAI,CAAC;AACrD,OAAK,OAAO;AACd;AAEA,IAAO,oBAAQ;;;ACJf,SAAS,WAAW,KAAK;AACvB,MAAI,SAAS,KAAK,IAAI,GAAG,KAAK,OAAO,KAAK,SAAS,GAAG;AACtD,OAAK,QAAQ,SAAS,IAAI;AAC1B,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACbf,IAAI,iBAAiB;AAGrB,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,kBAAiBD,cAAY;AAWjC,SAAS,QAAQ,KAAK;AACpB,MAAI,OAAO,KAAK;AAChB,MAAI,sBAAc;AAChB,QAAI,SAAS,KAAK,GAAG;AACrB,WAAO,WAAW,iBAAiB,SAAY;AAAA,EACjD;AACA,SAAOC,gBAAe,KAAK,MAAM,GAAG,IAAI,KAAK,GAAG,IAAI;AACtD;AAEA,IAAO,kBAAQ;;;AC1Bf,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,mBAAiBD,cAAY;AAWjC,SAAS,QAAQ,KAAK;AACpB,MAAI,OAAO,KAAK;AAChB,SAAO,uBAAgB,KAAK,GAAG,MAAM,SAAaC,iBAAe,KAAK,MAAM,GAAG;AACjF;AAEA,IAAO,kBAAQ;;;ACnBf,IAAIC,kBAAiB;AAYrB,SAAS,QAAQ,KAAK,OAAO;AAC3B,MAAI,OAAO,KAAK;AAChB,OAAK,QAAQ,KAAK,IAAI,GAAG,IAAI,IAAI;AACjC,OAAK,GAAG,IAAK,wBAAgB,UAAU,SAAaA,kBAAiB;AACrE,SAAO;AACT;AAEA,IAAO,kBAAQ;;;ACTf,SAASC,MAAK,SAAS;AACrB,MAAI,QAAQ,IACRC,UAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAM;AACX,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,QAAQ,QAAQ,KAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAD,MAAK,UAAU,QAAQ;AACvBA,MAAK,UAAU,QAAQ,IAAI;AAC3BA,MAAK,UAAU,MAAM;AACrBA,MAAK,UAAU,MAAM;AACrBA,MAAK,UAAU,MAAM;AAErB,IAAO,eAAQA;;;ACxBf,SAAS,iBAAiB;AACxB,OAAK,WAAW,CAAC;AACjB,OAAK,OAAO;AACd;AAEA,IAAO,yBAAQ;;;ACFf,SAAS,aAAa,OAAO,KAAK;AAChC,MAAIE,UAAS,MAAM;AACnB,SAAOA,WAAU;AACf,QAAI,WAAG,MAAMA,OAAM,EAAE,CAAC,GAAG,GAAG,GAAG;AAC7B,aAAOA;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACjBf,IAAI,aAAa,MAAM;AAGvB,IAAI,SAAS,WAAW;AAWxB,SAAS,gBAAgB,KAAK;AAC5B,MAAI,OAAO,KAAK,UACZ,QAAQ,qBAAa,MAAM,GAAG;AAElC,MAAI,QAAQ,GAAG;AACb,WAAO;AAAA,EACT;AACA,MAAI,YAAY,KAAK,SAAS;AAC9B,MAAI,SAAS,WAAW;AACtB,SAAK,IAAI;AAAA,EACX,OAAO;AACL,WAAO,KAAK,MAAM,OAAO,CAAC;AAAA,EAC5B;AACA,IAAE,KAAK;AACP,SAAO;AACT;AAEA,IAAO,0BAAQ;;;ACvBf,SAAS,aAAa,KAAK;AACzB,MAAI,OAAO,KAAK,UACZ,QAAQ,qBAAa,MAAM,GAAG;AAElC,SAAO,QAAQ,IAAI,SAAY,KAAK,KAAK,EAAE,CAAC;AAC9C;AAEA,IAAO,uBAAQ;;;ACPf,SAAS,aAAa,KAAK;AACzB,SAAO,qBAAa,KAAK,UAAU,GAAG,IAAI;AAC5C;AAEA,IAAO,uBAAQ;;;ACHf,SAAS,aAAa,KAAK,OAAO;AAChC,MAAI,OAAO,KAAK,UACZ,QAAQ,qBAAa,MAAM,GAAG;AAElC,MAAI,QAAQ,GAAG;AACb,MAAE,KAAK;AACP,SAAK,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,EACxB,OAAO;AACL,SAAK,KAAK,EAAE,CAAC,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACZf,SAAS,UAAU,SAAS;AAC1B,MAAI,QAAQ,IACRC,UAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAM;AACX,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,QAAQ,QAAQ,KAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGA,UAAU,UAAU,QAAQ;AAC5B,UAAU,UAAU,QAAQ,IAAI;AAChC,UAAU,UAAU,MAAM;AAC1B,UAAU,UAAU,MAAM;AAC1B,UAAU,UAAU,MAAM;AAE1B,IAAO,oBAAQ;;;AC3Bf,IAAIC,OAAM,kBAAU,cAAM,KAAK;AAE/B,IAAO,cAAQA;;;ACKf,SAAS,gBAAgB;AACvB,OAAK,OAAO;AACZ,OAAK,WAAW;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,OAAO,KAAK,eAAO;AAAA,IACnB,UAAU,IAAI;AAAA,EAChB;AACF;AAEA,IAAO,wBAAQ;;;ACbf,SAAS,UAAU,OAAO;AACxB,MAAI,OAAO,OAAO;AAClB,SAAQ,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YAAY,QAAQ,YACvE,UAAU,cACV,UAAU;AACjB;AAEA,IAAO,oBAAQ;;;ACJf,SAAS,WAAW,KAAK,KAAK;AAC5B,MAAI,OAAO,IAAI;AACf,SAAO,kBAAU,GAAG,IAChB,KAAK,OAAO,OAAO,WAAW,WAAW,MAAM,IAC/C,KAAK;AACX;AAEA,IAAO,qBAAQ;;;ACNf,SAAS,eAAe,KAAK;AAC3B,MAAI,SAAS,mBAAW,MAAM,GAAG,EAAE,QAAQ,EAAE,GAAG;AAChD,OAAK,QAAQ,SAAS,IAAI;AAC1B,SAAO;AACT;AAEA,IAAO,yBAAQ;;;ACNf,SAAS,YAAY,KAAK;AACxB,SAAO,mBAAW,MAAM,GAAG,EAAE,IAAI,GAAG;AACtC;AAEA,IAAO,sBAAQ;;;ACJf,SAAS,YAAY,KAAK;AACxB,SAAO,mBAAW,MAAM,GAAG,EAAE,IAAI,GAAG;AACtC;AAEA,IAAO,sBAAQ;;;ACHf,SAAS,YAAY,KAAK,OAAO;AAC/B,MAAI,OAAO,mBAAW,MAAM,GAAG,GAC3B,OAAO,KAAK;AAEhB,OAAK,IAAI,KAAK,KAAK;AACnB,OAAK,QAAQ,KAAK,QAAQ,OAAO,IAAI;AACrC,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,SAAS,SAAS;AACzB,MAAI,QAAQ,IACRC,UAAS,WAAW,OAAO,IAAI,QAAQ;AAE3C,OAAK,MAAM;AACX,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,QAAQ,QAAQ,KAAK;AACzB,SAAK,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGA,SAAS,UAAU,QAAQ;AAC3B,SAAS,UAAU,QAAQ,IAAI;AAC/B,SAAS,UAAU,MAAM;AACzB,SAAS,UAAU,MAAM;AACzB,SAAS,UAAU,MAAM;AAEzB,IAAO,mBAAQ;;;AC5Bf,IAAIC,mBAAkB;AA8CtB,SAAS,QAAQ,MAAM,UAAU;AAC/B,MAAI,OAAO,QAAQ,cAAe,YAAY,QAAQ,OAAO,YAAY,YAAa;AACpF,UAAM,IAAI,UAAUA,gBAAe;AAAA,EACrC;AACA,MAAI,WAAW,WAAW;AACxB,QAAI,OAAO,WACP,MAAM,WAAW,SAAS,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GACpDC,SAAQ,SAAS;AAErB,QAAIA,OAAM,IAAI,GAAG,GAAG;AAClB,aAAOA,OAAM,IAAI,GAAG;AAAA,IACtB;AACA,QAAI,SAAS,KAAK,MAAM,MAAM,IAAI;AAClC,aAAS,QAAQA,OAAM,IAAI,KAAK,MAAM,KAAKA;AAC3C,WAAO;AAAA,EACT;AACA,WAAS,QAAQ,KAAK,QAAQ,SAAS;AACvC,SAAO;AACT;AAGA,QAAQ,QAAQ;AAEhB,IAAO,kBAAQ;;;ACrEf,IAAI,mBAAmB;AAUvB,SAAS,cAAc,MAAM;AAC3B,MAAI,SAAS,gBAAQ,MAAM,SAAS,KAAK;AACvC,QAAIC,OAAM,SAAS,kBAAkB;AACnC,MAAAA,OAAM,MAAM;AAAA,IACd;AACA,WAAO;AAAA,EACT,CAAC;AAED,MAAIA,SAAQ,OAAO;AACnB,SAAO;AACT;AAEA,IAAO,wBAAQ;;;ACtBf,IAAI,aAAa;AAGjB,IAAI,eAAe;AASnB,IAAI,eAAe,sBAAc,SAAS,QAAQ;AAChD,MAAI,SAAS,CAAC;AACd,MAAI,OAAO,WAAW,CAAC,MAAM,IAAY;AACvC,WAAO,KAAK,EAAE;AAAA,EAChB;AACA,SAAO,QAAQ,YAAY,SAAS,OAAO,QAAQ,OAAO,WAAW;AACnE,WAAO,KAAK,QAAQ,UAAU,QAAQ,cAAc,IAAI,IAAK,UAAU,KAAM;AAAA,EAC/E,CAAC;AACD,SAAO;AACT,CAAC;AAED,IAAO,uBAAQ;;;ACHf,SAASC,UAAS,OAAO;AACvB,SAAO,SAAS,OAAO,KAAK,qBAAa,KAAK;AAChD;AAEA,IAAO,mBAAQA;;;ACdf,SAAS,SAAS,OAAO,QAAQ;AAC/B,MAAI,gBAAQ,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AACA,SAAO,cAAM,OAAO,MAAM,IAAI,CAAC,KAAK,IAAI,qBAAa,iBAAS,KAAK,CAAC;AACtE;AAEA,IAAO,mBAAQ;;;ACjBf,IAAIC,YAAW,IAAI;AASnB,SAAS,MAAM,OAAO;AACpB,MAAI,OAAO,SAAS,YAAY,iBAAS,KAAK,GAAG;AAC/C,WAAO;AAAA,EACT;AACA,MAAI,SAAU,QAAQ;AACtB,SAAQ,UAAU,OAAQ,IAAI,SAAU,CAACA,YAAY,OAAO;AAC9D;AAEA,IAAO,gBAAQ;;;ACTf,SAAS,QAAQ,QAAQ,MAAM;AAC7B,SAAO,iBAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,GACRC,UAAS,KAAK;AAElB,SAAO,UAAU,QAAQ,QAAQA,SAAQ;AACvC,aAAS,OAAO,cAAM,KAAK,OAAO,CAAC,CAAC;AAAA,EACtC;AACA,SAAQ,SAAS,SAASA,UAAU,SAAS;AAC/C;AAEA,IAAO,kBAAQ;;;ACIf,SAASC,KAAI,QAAQ,MAAM,cAAc;AACvC,MAAI,SAAS,UAAU,OAAO,SAAY,gBAAQ,QAAQ,IAAI;AAC9D,SAAO,WAAW,SAAY,eAAe;AAC/C;AAEA,IAAO,cAAQA;;;ACxBf,SAAS,UAAU,OAAO,QAAQ;AAChC,MAAI,QAAQ,IACRC,UAAS,OAAO,QAChB,SAAS,MAAM;AAEnB,SAAO,EAAE,QAAQA,SAAQ;AACvB,UAAM,SAAS,KAAK,IAAI,OAAO,KAAK;AAAA,EACtC;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACdf,IAAI,mBAAmB,iBAAS,eAAO,qBAAqB;AAS5D,SAAS,cAAc,OAAO;AAC5B,SAAO,gBAAQ,KAAK,KAAK,oBAAY,KAAK,KACxC,CAAC,EAAE,oBAAoB,SAAS,MAAM,gBAAgB;AAC1D;AAEA,IAAO,wBAAQ;;;ACLf,SAAS,YAAY,OAAO,OAAO,WAAW,UAAU,QAAQ;AAC9D,MAAI,QAAQ,IACRC,UAAS,MAAM;AAEnB,gBAAc,YAAY;AAC1B,aAAW,SAAS,CAAC;AAErB,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,QAAQ,KAAK,UAAU,KAAK,GAAG;AACjC,UAAI,QAAQ,GAAG;AAEb,oBAAY,OAAO,QAAQ,GAAG,WAAW,UAAU,MAAM;AAAA,MAC3D,OAAO;AACL,0BAAU,QAAQ,KAAK;AAAA,MACzB;AAAA,IACF,WAAW,CAAC,UAAU;AACpB,aAAO,OAAO,MAAM,IAAI;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACrBf,SAAS,QAAQ,OAAO;AACtB,MAAIC,UAAS,SAAS,OAAO,IAAI,MAAM;AACvC,SAAOA,UAAS,oBAAY,OAAO,CAAC,IAAI,CAAC;AAC3C;AAEA,IAAO,kBAAQ;;;ACVf,SAAS,SAAS,MAAM;AACtB,SAAO,oBAAY,iBAAS,MAAM,QAAW,eAAO,GAAG,OAAO,EAAE;AAClE;AAEA,IAAO,mBAAQ;;;ACNf,SAAS,aAAa;AACpB,OAAK,WAAW,IAAI;AACpB,OAAK,OAAO;AACd;AAEA,IAAO,qBAAQ;;;ACLf,SAAS,YAAY,KAAK;AACxB,MAAI,OAAO,KAAK,UACZ,SAAS,KAAK,QAAQ,EAAE,GAAG;AAE/B,OAAK,OAAO,KAAK;AACjB,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACRf,SAAS,SAAS,KAAK;AACrB,SAAO,KAAK,SAAS,IAAI,GAAG;AAC9B;AAEA,IAAO,mBAAQ;;;ACJf,SAAS,SAAS,KAAK;AACrB,SAAO,KAAK,SAAS,IAAI,GAAG;AAC9B;AAEA,IAAO,mBAAQ;;;ACRf,IAAI,mBAAmB;AAYvB,SAAS,SAAS,KAAK,OAAO;AAC5B,MAAI,OAAO,KAAK;AAChB,MAAI,gBAAgB,mBAAW;AAC7B,QAAI,QAAQ,KAAK;AACjB,QAAI,CAAC,eAAQ,MAAM,SAAS,mBAAmB,GAAI;AACjD,YAAM,KAAK,CAAC,KAAK,KAAK,CAAC;AACvB,WAAK,OAAO,EAAE,KAAK;AACnB,aAAO;AAAA,IACT;AACA,WAAO,KAAK,WAAW,IAAI,iBAAS,KAAK;AAAA,EAC3C;AACA,OAAK,IAAI,KAAK,KAAK;AACnB,OAAK,OAAO,KAAK;AACjB,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACnBf,SAAS,MAAM,SAAS;AACtB,MAAI,OAAO,KAAK,WAAW,IAAI,kBAAU,OAAO;AAChD,OAAK,OAAO,KAAK;AACnB;AAGA,MAAM,UAAU,QAAQ;AACxB,MAAM,UAAU,QAAQ,IAAI;AAC5B,MAAM,UAAU,MAAM;AACtB,MAAM,UAAU,MAAM;AACtB,MAAM,UAAU,MAAM;AAEtB,IAAO,gBAAQ;;;ACjBf,SAAS,YAAY,OAAO,WAAW;AACrC,MAAI,QAAQ,IACRC,UAAS,SAAS,OAAO,IAAI,MAAM,QACnC,WAAW,GACX,SAAS,CAAC;AAEd,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,QAAQ,MAAM,KAAK;AACvB,QAAI,UAAU,OAAO,OAAO,KAAK,GAAG;AAClC,aAAO,UAAU,IAAI;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACNf,SAAS,YAAY;AACnB,SAAO,CAAC;AACV;AAEA,IAAO,oBAAQ;;;AClBf,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,wBAAuBD,cAAY;AAGvC,IAAI,mBAAmB,OAAO;AAS9B,IAAI,aAAa,CAAC,mBAAmB,oBAAY,SAAS,QAAQ;AAChE,MAAI,UAAU,MAAM;AAClB,WAAO,CAAC;AAAA,EACV;AACA,WAAS,OAAO,MAAM;AACtB,SAAO,oBAAY,iBAAiB,MAAM,GAAG,SAAS,QAAQ;AAC5D,WAAOC,sBAAqB,KAAK,QAAQ,MAAM;AAAA,EACjD,CAAC;AACH;AAEA,IAAO,qBAAQ;;;ACff,SAAS,eAAe,QAAQ,UAAU,aAAa;AACrD,MAAI,SAAS,SAAS,MAAM;AAC5B,SAAO,gBAAQ,MAAM,IAAI,SAAS,kBAAU,QAAQ,YAAY,MAAM,CAAC;AACzE;AAEA,IAAO,yBAAQ;;;ACRf,SAAS,WAAW,QAAQ;AAC1B,SAAO,uBAAe,QAAQ,cAAM,kBAAU;AAChD;AAEA,IAAO,qBAAQ;;;ACXf,IAAIC,YAAW,kBAAU,cAAM,UAAU;AAEzC,IAAO,mBAAQA;;;ACFf,IAAIC,WAAU,kBAAU,cAAM,SAAS;AAEvC,IAAO,kBAAQA;;;ACFf,IAAIC,OAAM,kBAAU,cAAM,KAAK;AAE/B,IAAO,cAAQA;;;ACGf,IAAIC,UAAS;AAAb,IACIC,aAAY;AADhB,IAEI,aAAa;AAFjB,IAGIC,UAAS;AAHb,IAIIC,cAAa;AAEjB,IAAIC,eAAc;AAGlB,IAAI,qBAAqB,iBAAS,gBAAQ;AAA1C,IACI,gBAAgB,iBAAS,WAAG;AADhC,IAEI,oBAAoB,iBAAS,eAAO;AAFxC,IAGI,gBAAgB,iBAAS,WAAG;AAHhC,IAII,oBAAoB,iBAAS,eAAO;AASxC,IAAI,SAAS;AAGb,IAAK,oBAAY,OAAO,IAAI,iBAAS,IAAI,YAAY,CAAC,CAAC,CAAC,KAAKA,gBACxD,eAAO,OAAO,IAAI,aAAG,KAAKJ,WAC1B,mBAAW,OAAO,gBAAQ,QAAQ,CAAC,KAAK,cACxC,eAAO,OAAO,IAAI,aAAG,KAAKE,WAC1B,mBAAW,OAAO,IAAI,iBAAO,KAAKC,aAAa;AAClD,WAAS,SAAS,OAAO;AACvB,QAAI,SAAS,mBAAW,KAAK,GACzB,OAAO,UAAUF,aAAY,MAAM,cAAc,QACjD,aAAa,OAAO,iBAAS,IAAI,IAAI;AAEzC,QAAI,YAAY;AACd,cAAQ,YAAY;AAAA,QAClB,KAAK;AAAoB,iBAAOG;AAAA,QAChC,KAAK;AAAe,iBAAOJ;AAAA,QAC3B,KAAK;AAAmB,iBAAO;AAAA,QAC/B,KAAK;AAAe,iBAAOE;AAAA,QAC3B,KAAK;AAAmB,iBAAOC;AAAA,MACjC;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAO,iBAAQ;;;ACtDf,IAAIE,cAAa,aAAK;AAEtB,IAAO,qBAAQA;;;ACJf,IAAIC,kBAAiB;AAYrB,SAAS,YAAY,OAAO;AAC1B,OAAK,SAAS,IAAI,OAAOA,eAAc;AACvC,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACTf,SAAS,YAAY,OAAO;AAC1B,SAAO,KAAK,SAAS,IAAI,KAAK;AAChC;AAEA,IAAO,sBAAQ;;;ACDf,SAAS,SAAS,QAAQ;AACxB,MAAI,QAAQ,IACRC,UAAS,UAAU,OAAO,IAAI,OAAO;AAEzC,OAAK,WAAW,IAAI;AACpB,SAAO,EAAE,QAAQA,SAAQ;AACvB,SAAK,IAAI,OAAO,KAAK,CAAC;AAAA,EACxB;AACF;AAGA,SAAS,UAAU,MAAM,SAAS,UAAU,OAAO;AACnD,SAAS,UAAU,MAAM;AAEzB,IAAO,mBAAQ;;;AChBf,SAAS,UAAU,OAAO,WAAW;AACnC,MAAI,QAAQ,IACRC,UAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,UAAU,MAAM,KAAK,GAAG,OAAO,KAAK,GAAG;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,oBAAQ;;;ACdf,SAAS,SAASC,QAAO,KAAK;AAC5B,SAAOA,OAAM,IAAI,GAAG;AACtB;AAEA,IAAO,mBAAQ;;;ACPf,IAAI,uBAAuB;AAA3B,IACI,yBAAyB;AAe7B,SAAS,YAAY,OAAO,OAAO,SAAS,YAAY,WAAW,OAAO;AACxE,MAAI,YAAY,UAAU,sBACtB,YAAY,MAAM,QAClB,YAAY,MAAM;AAEtB,MAAI,aAAa,aAAa,EAAE,aAAa,YAAY,YAAY;AACnE,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,MAAM,IAAI,KAAK;AAChC,MAAI,aAAa,MAAM,IAAI,KAAK;AAChC,MAAI,cAAc,YAAY;AAC5B,WAAO,cAAc,SAAS,cAAc;AAAA,EAC9C;AACA,MAAI,QAAQ,IACR,SAAS,MACT,OAAQ,UAAU,yBAA0B,IAAI,qBAAW;AAE/D,QAAM,IAAI,OAAO,KAAK;AACtB,QAAM,IAAI,OAAO,KAAK;AAGtB,SAAO,EAAE,QAAQ,WAAW;AAC1B,QAAI,WAAW,MAAM,KAAK,GACtB,WAAW,MAAM,KAAK;AAE1B,QAAI,YAAY;AACd,UAAI,WAAW,YACX,WAAW,UAAU,UAAU,OAAO,OAAO,OAAO,KAAK,IACzD,WAAW,UAAU,UAAU,OAAO,OAAO,OAAO,KAAK;AAAA,IAC/D;AACA,QAAI,aAAa,QAAW;AAC1B,UAAI,UAAU;AACZ;AAAA,MACF;AACA,eAAS;AACT;AAAA,IACF;AAEA,QAAI,MAAM;AACR,UAAI,CAAC,kBAAU,OAAO,SAASC,WAAU,UAAU;AAC7C,YAAI,CAAC,iBAAS,MAAM,QAAQ,MACvB,aAAaA,aAAY,UAAU,UAAUA,WAAU,SAAS,YAAY,KAAK,IAAI;AACxF,iBAAO,KAAK,KAAK,QAAQ;AAAA,QAC3B;AAAA,MACF,CAAC,GAAG;AACN,iBAAS;AACT;AAAA,MACF;AAAA,IACF,WAAW,EACL,aAAa,YACX,UAAU,UAAU,UAAU,SAAS,YAAY,KAAK,IACzD;AACL,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,QAAM,QAAQ,EAAE,KAAK;AACrB,QAAM,QAAQ,EAAE,KAAK;AACrB,SAAO;AACT;AAEA,IAAO,sBAAQ;;;AC5Ef,SAAS,WAAW,KAAK;AACvB,MAAI,QAAQ,IACR,SAAS,MAAM,IAAI,IAAI;AAE3B,MAAI,QAAQ,SAAS,OAAO,KAAK;AAC/B,WAAO,EAAE,KAAK,IAAI,CAAC,KAAK,KAAK;AAAA,EAC/B,CAAC;AACD,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACVf,SAAS,WAAW,KAAK;AACvB,MAAI,QAAQ,IACR,SAAS,MAAM,IAAI,IAAI;AAE3B,MAAI,QAAQ,SAAS,OAAO;AAC1B,WAAO,EAAE,KAAK,IAAI;AAAA,EACpB,CAAC;AACD,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACTf,IAAIC,wBAAuB;AAA3B,IACIC,0BAAyB;AAG7B,IAAIC,WAAU;AAAd,IACIC,WAAU;AADd,IAEIC,YAAW;AAFf,IAGIC,UAAS;AAHb,IAIIC,aAAY;AAJhB,IAKIC,aAAY;AALhB,IAMIC,UAAS;AANb,IAOIC,aAAY;AAPhB,IAQIC,aAAY;AAEhB,IAAIC,kBAAiB;AAArB,IACIC,eAAc;AAGlB,IAAIC,eAAc,iBAAS,eAAO,YAAY;AAA9C,IACI,gBAAgBA,eAAcA,aAAY,UAAU;AAmBxD,SAAS,WAAW,QAAQ,OAAO,KAAK,SAAS,YAAY,WAAW,OAAO;AAC7E,UAAQ,KAAK;AAAA,IACX,KAAKD;AACH,UAAK,OAAO,cAAc,MAAM,cAC3B,OAAO,cAAc,MAAM,YAAa;AAC3C,eAAO;AAAA,MACT;AACA,eAAS,OAAO;AAChB,cAAQ,MAAM;AAAA,IAEhB,KAAKD;AACH,UAAK,OAAO,cAAc,MAAM,cAC5B,CAAC,UAAU,IAAI,mBAAW,MAAM,GAAG,IAAI,mBAAW,KAAK,CAAC,GAAG;AAC7D,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IAET,KAAKT;AAAA,IACL,KAAKC;AAAA,IACL,KAAKG;AAGH,aAAO,WAAG,CAAC,QAAQ,CAAC,KAAK;AAAA,IAE3B,KAAKF;AACH,aAAO,OAAO,QAAQ,MAAM,QAAQ,OAAO,WAAW,MAAM;AAAA,IAE9D,KAAKG;AAAA,IACL,KAAKE;AAIH,aAAO,UAAW,QAAQ;AAAA,IAE5B,KAAKJ;AACH,UAAI,UAAU;AAAA,IAEhB,KAAKG;AACH,UAAI,YAAY,UAAUR;AAC1B,kBAAY,UAAU;AAEtB,UAAI,OAAO,QAAQ,MAAM,QAAQ,CAAC,WAAW;AAC3C,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,MAAM,IAAI,MAAM;AAC9B,UAAI,SAAS;AACX,eAAO,WAAW;AAAA,MACpB;AACA,iBAAWC;AAGX,YAAM,IAAI,QAAQ,KAAK;AACvB,UAAI,SAAS,oBAAY,QAAQ,MAAM,GAAG,QAAQ,KAAK,GAAG,SAAS,YAAY,WAAW,KAAK;AAC/F,YAAM,QAAQ,EAAE,MAAM;AACtB,aAAO;AAAA,IAET,KAAKS;AACH,UAAI,eAAe;AACjB,eAAO,cAAc,KAAK,MAAM,KAAK,cAAc,KAAK,KAAK;AAAA,MAC/D;AAAA,EACJ;AACA,SAAO;AACT;AAEA,IAAO,qBAAQ;;;AC5Gf,IAAII,wBAAuB;AAG3B,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,mBAAiBD,cAAY;AAejC,SAAS,aAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;AAC1E,MAAI,YAAY,UAAUD,uBACtB,WAAW,mBAAW,MAAM,GAC5B,YAAY,SAAS,QACrB,WAAW,mBAAW,KAAK,GAC3B,YAAY,SAAS;AAEzB,MAAI,aAAa,aAAa,CAAC,WAAW;AACxC,WAAO;AAAA,EACT;AACA,MAAI,QAAQ;AACZ,SAAO,SAAS;AACd,QAAI,MAAM,SAAS,KAAK;AACxB,QAAI,EAAE,YAAY,OAAO,QAAQE,iBAAe,KAAK,OAAO,GAAG,IAAI;AACjE,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,aAAa,MAAM,IAAI,MAAM;AACjC,MAAI,aAAa,MAAM,IAAI,KAAK;AAChC,MAAI,cAAc,YAAY;AAC5B,WAAO,cAAc,SAAS,cAAc;AAAA,EAC9C;AACA,MAAI,SAAS;AACb,QAAM,IAAI,QAAQ,KAAK;AACvB,QAAM,IAAI,OAAO,MAAM;AAEvB,MAAI,WAAW;AACf,SAAO,EAAE,QAAQ,WAAW;AAC1B,UAAM,SAAS,KAAK;AACpB,QAAI,WAAW,OAAO,GAAG,GACrB,WAAW,MAAM,GAAG;AAExB,QAAI,YAAY;AACd,UAAI,WAAW,YACX,WAAW,UAAU,UAAU,KAAK,OAAO,QAAQ,KAAK,IACxD,WAAW,UAAU,UAAU,KAAK,QAAQ,OAAO,KAAK;AAAA,IAC9D;AAEA,QAAI,EAAE,aAAa,SACV,aAAa,YAAY,UAAU,UAAU,UAAU,SAAS,YAAY,KAAK,IAClF,WACD;AACL,eAAS;AACT;AAAA,IACF;AACA,iBAAa,WAAW,OAAO;AAAA,EACjC;AACA,MAAI,UAAU,CAAC,UAAU;AACvB,QAAI,UAAU,OAAO,aACjB,UAAU,MAAM;AAGpB,QAAI,WAAW,YACV,iBAAiB,UAAU,iBAAiB,UAC7C,EAAE,OAAO,WAAW,cAAc,mBAAmB,WACnD,OAAO,WAAW,cAAc,mBAAmB,UAAU;AACjE,eAAS;AAAA,IACX;AAAA,EACF;AACA,QAAM,QAAQ,EAAE,MAAM;AACtB,QAAM,QAAQ,EAAE,KAAK;AACrB,SAAO;AACT;AAEA,IAAO,uBAAQ;;;AC/Ef,IAAIC,wBAAuB;AAG3B,IAAIC,WAAU;AAAd,IACIC,YAAW;AADf,IAEIC,aAAY;AAGhB,IAAIC,gBAAc,OAAO;AAGzB,IAAIC,mBAAiBD,cAAY;AAgBjC,SAAS,gBAAgB,QAAQ,OAAO,SAAS,YAAY,WAAW,OAAO;AAC7E,MAAI,WAAW,gBAAQ,MAAM,GACzB,WAAW,gBAAQ,KAAK,GACxB,SAAS,WAAWF,YAAW,eAAO,MAAM,GAC5C,SAAS,WAAWA,YAAW,eAAO,KAAK;AAE/C,WAAS,UAAUD,WAAUE,aAAY;AACzC,WAAS,UAAUF,WAAUE,aAAY;AAEzC,MAAI,WAAW,UAAUA,YACrB,WAAW,UAAUA,YACrB,YAAY,UAAU;AAE1B,MAAI,aAAa,iBAAS,MAAM,GAAG;AACjC,QAAI,CAAC,iBAAS,KAAK,GAAG;AACpB,aAAO;AAAA,IACT;AACA,eAAW;AACX,eAAW;AAAA,EACb;AACA,MAAI,aAAa,CAAC,UAAU;AAC1B,cAAU,QAAQ,IAAI;AACtB,WAAQ,YAAY,qBAAa,MAAM,IACnC,oBAAY,QAAQ,OAAO,SAAS,YAAY,WAAW,KAAK,IAChE,mBAAW,QAAQ,OAAO,QAAQ,SAAS,YAAY,WAAW,KAAK;AAAA,EAC7E;AACA,MAAI,EAAE,UAAUH,wBAAuB;AACrC,QAAI,eAAe,YAAYK,iBAAe,KAAK,QAAQ,aAAa,GACpE,eAAe,YAAYA,iBAAe,KAAK,OAAO,aAAa;AAEvE,QAAI,gBAAgB,cAAc;AAChC,UAAI,eAAe,eAAe,OAAO,MAAM,IAAI,QAC/C,eAAe,eAAe,MAAM,MAAM,IAAI;AAElD,gBAAU,QAAQ,IAAI;AACtB,aAAO,UAAU,cAAc,cAAc,SAAS,YAAY,KAAK;AAAA,IACzE;AAAA,EACF;AACA,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,EACT;AACA,YAAU,QAAQ,IAAI;AACtB,SAAO,qBAAa,QAAQ,OAAO,SAAS,YAAY,WAAW,KAAK;AAC1E;AAEA,IAAO,0BAAQ;;;ACjEf,SAAS,YAAY,OAAO,OAAO,SAAS,YAAY,OAAO;AAC7D,MAAI,UAAU,OAAO;AACnB,WAAO;AAAA,EACT;AACA,MAAI,SAAS,QAAQ,SAAS,QAAS,CAAC,qBAAa,KAAK,KAAK,CAAC,qBAAa,KAAK,GAAI;AACpF,WAAO,UAAU,SAAS,UAAU;AAAA,EACtC;AACA,SAAO,wBAAgB,OAAO,OAAO,SAAS,YAAY,aAAa,KAAK;AAC9E;AAEA,IAAO,sBAAQ;;;ACvBf,IAAIC,wBAAuB;AAA3B,IACIC,0BAAyB;AAY7B,SAAS,YAAY,QAAQ,QAAQ,WAAW,YAAY;AAC1D,MAAI,QAAQ,UAAU,QAClBC,UAAS,OACT,eAAe,CAAC;AAEpB,MAAI,UAAU,MAAM;AAClB,WAAO,CAACA;AAAA,EACV;AACA,WAAS,OAAO,MAAM;AACtB,SAAO,SAAS;AACd,QAAI,OAAO,UAAU,KAAK;AAC1B,QAAK,gBAAgB,KAAK,CAAC,IACnB,KAAK,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC,IAC1B,EAAE,KAAK,CAAC,KAAK,SACf;AACJ,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,EAAE,QAAQA,SAAQ;AACvB,WAAO,UAAU,KAAK;AACtB,QAAI,MAAM,KAAK,CAAC,GACZ,WAAW,OAAO,GAAG,GACrB,WAAW,KAAK,CAAC;AAErB,QAAI,gBAAgB,KAAK,CAAC,GAAG;AAC3B,UAAI,aAAa,UAAa,EAAE,OAAO,SAAS;AAC9C,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,UAAI,QAAQ,IAAI;AAChB,UAAI,YAAY;AACd,YAAI,SAAS,WAAW,UAAU,UAAU,KAAK,QAAQ,QAAQ,KAAK;AAAA,MACxE;AACA,UAAI,EAAE,WAAW,SACT,oBAAY,UAAU,UAAUF,wBAAuBC,yBAAwB,YAAY,KAAK,IAChG,SACD;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,sBAAQ;;;ACnDf,SAAS,mBAAmB,OAAO;AACjC,SAAO,UAAU,SAAS,CAAC,iBAAS,KAAK;AAC3C;AAEA,IAAO,6BAAQ;;;ACJf,SAAS,aAAa,QAAQ;AAC5B,MAAI,SAAS,aAAK,MAAM,GACpBE,UAAS,OAAO;AAEpB,SAAOA,WAAU;AACf,QAAI,MAAM,OAAOA,OAAM,GACnB,QAAQ,OAAO,GAAG;AAEtB,WAAOA,OAAM,IAAI,CAAC,KAAK,OAAO,2BAAmB,KAAK,CAAC;AAAA,EACzD;AACA,SAAO;AACT;AAEA,IAAO,uBAAQ;;;ACdf,SAAS,wBAAwB,KAAK,UAAU;AAC9C,SAAO,SAAS,QAAQ;AACtB,QAAI,UAAU,MAAM;AAClB,aAAO;AAAA,IACT;AACA,WAAO,OAAO,GAAG,MAAM,aACpB,aAAa,UAAc,OAAO,OAAO,MAAM;AAAA,EACpD;AACF;AAEA,IAAO,kCAAQ;;;ACRf,SAAS,YAAY,QAAQ;AAC3B,MAAI,YAAY,qBAAa,MAAM;AACnC,MAAI,UAAU,UAAU,KAAK,UAAU,CAAC,EAAE,CAAC,GAAG;AAC5C,WAAO,gCAAwB,UAAU,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;AAAA,EACjE;AACA,SAAO,SAAS,QAAQ;AACtB,WAAO,WAAW,UAAU,oBAAY,QAAQ,QAAQ,SAAS;AAAA,EACnE;AACF;AAEA,IAAO,sBAAQ;;;ACbf,SAAS,UAAU,QAAQ,KAAK;AAC9B,SAAO,UAAU,QAAQ,OAAO,OAAO,MAAM;AAC/C;AAEA,IAAO,oBAAQ;;;ACIf,SAAS,QAAQ,QAAQ,MAAM,SAAS;AACtC,SAAO,iBAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,IACRC,UAAS,KAAK,QACd,SAAS;AAEb,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,MAAM,cAAM,KAAK,KAAK,CAAC;AAC3B,QAAI,EAAE,SAAS,UAAU,QAAQ,QAAQ,QAAQ,GAAG,IAAI;AACtD;AAAA,IACF;AACA,aAAS,OAAO,GAAG;AAAA,EACrB;AACA,MAAI,UAAU,EAAE,SAASA,SAAQ;AAC/B,WAAO;AAAA,EACT;AACA,EAAAA,UAAS,UAAU,OAAO,IAAI,OAAO;AACrC,SAAO,CAAC,CAACA,WAAU,iBAASA,OAAM,KAAK,gBAAQ,KAAKA,OAAM,MACvD,gBAAQ,MAAM,KAAK,oBAAY,MAAM;AAC1C;AAEA,IAAO,kBAAQ;;;ACTf,SAAS,MAAM,QAAQ,MAAM;AAC3B,SAAO,UAAU,QAAQ,gBAAQ,QAAQ,MAAM,iBAAS;AAC1D;AAEA,IAAO,gBAAQ;;;ACxBf,IAAIC,wBAAuB;AAA3B,IACIC,0BAAyB;AAU7B,SAAS,oBAAoB,MAAM,UAAU;AAC3C,MAAI,cAAM,IAAI,KAAK,2BAAmB,QAAQ,GAAG;AAC/C,WAAO,gCAAwB,cAAM,IAAI,GAAG,QAAQ;AAAA,EACtD;AACA,SAAO,SAAS,QAAQ;AACtB,QAAI,WAAW,YAAI,QAAQ,IAAI;AAC/B,WAAQ,aAAa,UAAa,aAAa,WAC3C,cAAM,QAAQ,IAAI,IAClB,oBAAY,UAAU,UAAUD,wBAAuBC,uBAAsB;AAAA,EACnF;AACF;AAEA,IAAO,8BAAQ;;;ACzBf,SAAS,aAAa,KAAK;AACzB,SAAO,SAAS,QAAQ;AACtB,WAAO,UAAU,OAAO,SAAY,OAAO,GAAG;AAAA,EAChD;AACF;AAEA,IAAO,uBAAQ;;;ACJf,SAAS,iBAAiB,MAAM;AAC9B,SAAO,SAAS,QAAQ;AACtB,WAAO,gBAAQ,QAAQ,IAAI;AAAA,EAC7B;AACF;AAEA,IAAO,2BAAQ;;;ACYf,SAAS,SAAS,MAAM;AACtB,SAAO,cAAM,IAAI,IAAI,qBAAa,cAAM,IAAI,CAAC,IAAI,yBAAiB,IAAI;AACxE;AAEA,IAAO,mBAAQ;;;AClBf,SAAS,aAAa,OAAO;AAG3B,MAAI,OAAO,SAAS,YAAY;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,SAAS,MAAM;AACjB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,SAAS,UAAU;AAC5B,WAAO,gBAAQ,KAAK,IAChB,4BAAoB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,IACtC,oBAAY,KAAK;AAAA,EACvB;AACA,SAAO,iBAAS,KAAK;AACvB;AAEA,IAAO,uBAAQ;;;ACZf,IAAI,MAAM,WAAW;AACnB,SAAO,aAAK,KAAK,IAAI;AACvB;AAEA,IAAO,cAAQ;;;ACjBf,IAAIC,mBAAkB;AAGtB,IAAIC,aAAY,KAAK;AAArB,IACIC,aAAY,KAAK;AAwDrB,SAAS,SAAS,MAAM,MAAM,SAAS;AACrC,MAAI,UACA,UACA,SACA,QACA,SACA,cACA,iBAAiB,GACjB,UAAU,OACV,SAAS,OACT,WAAW;AAEf,MAAI,OAAO,QAAQ,YAAY;AAC7B,UAAM,IAAI,UAAUF,gBAAe;AAAA,EACrC;AACA,SAAO,iBAAS,IAAI,KAAK;AACzB,MAAI,iBAAS,OAAO,GAAG;AACrB,cAAU,CAAC,CAAC,QAAQ;AACpB,aAAS,aAAa;AACtB,cAAU,SAASC,WAAU,iBAAS,QAAQ,OAAO,KAAK,GAAG,IAAI,IAAI;AACrE,eAAW,cAAc,UAAU,CAAC,CAAC,QAAQ,WAAW;AAAA,EAC1D;AAEA,WAAS,WAAW,MAAM;AACxB,QAAI,OAAO,UACP,UAAU;AAEd,eAAW,WAAW;AACtB,qBAAiB;AACjB,aAAS,KAAK,MAAM,SAAS,IAAI;AACjC,WAAO;AAAA,EACT;AAEA,WAAS,YAAY,MAAM;AAEzB,qBAAiB;AAEjB,cAAU,WAAW,cAAc,IAAI;AAEvC,WAAO,UAAU,WAAW,IAAI,IAAI;AAAA,EACtC;AAEA,WAAS,cAAc,MAAM;AAC3B,QAAI,oBAAoB,OAAO,cAC3B,sBAAsB,OAAO,gBAC7B,cAAc,OAAO;AAEzB,WAAO,SACHC,WAAU,aAAa,UAAU,mBAAmB,IACpD;AAAA,EACN;AAEA,WAAS,aAAa,MAAM;AAC1B,QAAI,oBAAoB,OAAO,cAC3B,sBAAsB,OAAO;AAKjC,WAAQ,iBAAiB,UAAc,qBAAqB,QACzD,oBAAoB,KAAO,UAAU,uBAAuB;AAAA,EACjE;AAEA,WAAS,eAAe;AACtB,QAAI,OAAO,YAAI;AACf,QAAI,aAAa,IAAI,GAAG;AACtB,aAAO,aAAa,IAAI;AAAA,IAC1B;AAEA,cAAU,WAAW,cAAc,cAAc,IAAI,CAAC;AAAA,EACxD;AAEA,WAAS,aAAa,MAAM;AAC1B,cAAU;AAIV,QAAI,YAAY,UAAU;AACxB,aAAO,WAAW,IAAI;AAAA,IACxB;AACA,eAAW,WAAW;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,SAAS;AAChB,QAAI,YAAY,QAAW;AACzB,mBAAa,OAAO;AAAA,IACtB;AACA,qBAAiB;AACjB,eAAW,eAAe,WAAW,UAAU;AAAA,EACjD;AAEA,WAAS,QAAQ;AACf,WAAO,YAAY,SAAY,SAAS,aAAa,YAAI,CAAC;AAAA,EAC5D;AAEA,WAAS,YAAY;AACnB,QAAI,OAAO,YAAI,GACX,aAAa,aAAa,IAAI;AAElC,eAAW;AACX,eAAW;AACX,mBAAe;AAEf,QAAI,YAAY;AACd,UAAI,YAAY,QAAW;AACzB,eAAO,YAAY,YAAY;AAAA,MACjC;AACA,UAAI,QAAQ;AAEV,qBAAa,OAAO;AACpB,kBAAU,WAAW,cAAc,IAAI;AACvC,eAAO,WAAW,YAAY;AAAA,MAChC;AAAA,IACF;AACA,QAAI,YAAY,QAAW;AACzB,gBAAU,WAAW,cAAc,IAAI;AAAA,IACzC;AACA,WAAO;AAAA,EACT;AACA,YAAU,SAAS;AACnB,YAAU,QAAQ;AAClB,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACrLf,SAAS,kBAAkB,OAAO,OAAO,YAAY;AACnD,MAAI,QAAQ,IACRC,UAAS,SAAS,OAAO,IAAI,MAAM;AAEvC,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,WAAW,OAAO,MAAM,KAAK,CAAC,GAAG;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,4BAAQ;;;ACLf,SAAS,QAAQ,QAAQ,MAAM,OAAO,YAAY;AAChD,MAAI,CAAC,iBAAS,MAAM,GAAG;AACrB,WAAO;AAAA,EACT;AACA,SAAO,iBAAS,MAAM,MAAM;AAE5B,MAAI,QAAQ,IACRC,UAAS,KAAK,QACd,YAAYA,UAAS,GACrB,SAAS;AAEb,SAAO,UAAU,QAAQ,EAAE,QAAQA,SAAQ;AACzC,QAAI,MAAM,cAAM,KAAK,KAAK,CAAC,GACvB,WAAW;AAEf,QAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,WAAW;AACtB,UAAI,WAAW,OAAO,GAAG;AACzB,iBAAW,aAAa,WAAW,UAAU,KAAK,MAAM,IAAI;AAC5D,UAAI,aAAa,QAAW;AAC1B,mBAAW,iBAAS,QAAQ,IACxB,WACC,gBAAQ,KAAK,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AAAA,MACxC;AAAA,IACF;AACA,wBAAY,QAAQ,KAAK,QAAQ;AACjC,aAAS,OAAO,GAAG;AAAA,EACrB;AACA,SAAO;AACT;AAEA,IAAO,kBAAQ;;;ACrCf,SAAS,WAAW,QAAQ,OAAO,WAAW;AAC5C,MAAI,QAAQ,IACRC,UAAS,MAAM,QACf,SAAS,CAAC;AAEd,SAAO,EAAE,QAAQA,SAAQ;AACvB,QAAI,OAAO,MAAM,KAAK,GAClB,QAAQ,gBAAQ,QAAQ,IAAI;AAEhC,QAAI,UAAU,OAAO,IAAI,GAAG;AAC1B,sBAAQ,QAAQ,iBAAS,MAAM,MAAM,GAAG,KAAK;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;AAEA,IAAO,qBAAQ;;;ACvBf,IAAIC,qBAAoB;AAmCxB,IAAI,UAAU,iBAAS,SAAS,MAAM,UAAU;AAC9C,MAAI,UAAU,uBAAe,UAAU,kBAAU,OAAO,CAAC;AACzD,SAAO,mBAAW,MAAMA,oBAAmB,QAAW,UAAU,OAAO;AACzE,CAAC;AAGD,QAAQ,cAAc,CAAC;AAEvB,IAAO,kBAAQ;;;ACrCf,SAAS,SAAS,QAAQ,OAAO;AAC/B,SAAO,mBAAW,QAAQ,OAAO,SAAS,OAAO,MAAM;AACrD,WAAO,cAAM,QAAQ,IAAI;AAAA,EAC3B,CAAC;AACH;AAEA,IAAO,mBAAQ;;;ACEf,IAAI,OAAO,iBAAS,SAAS,QAAQ,OAAO;AAC1C,SAAO,UAAU,OAAO,CAAC,IAAI,iBAAS,QAAQ,KAAK;AACrD,CAAC;AAED,IAAO,eAAQ;;;ACrBf,IAAIC,oBAAmB;AAAvB,IACI,kBAAkBA,oBAAmB;AAGzC,IAAI,cAAc,KAAK;AAAvB,IACIC,aAAY,KAAK;AAerB,SAAS,kBAAkB,OAAO,OAAO,UAAU,YAAY;AAC7D,MAAI,MAAM,GACN,OAAO,SAAS,OAAO,IAAI,MAAM;AACrC,MAAI,SAAS,GAAG;AACd,WAAO;AAAA,EACT;AAEA,UAAQ,SAAS,KAAK;AACtB,MAAI,WAAW,UAAU,OACrB,YAAY,UAAU,MACtB,cAAc,iBAAS,KAAK,GAC5B,iBAAiB,UAAU;AAE/B,SAAO,MAAM,MAAM;AACjB,QAAI,MAAM,aAAa,MAAM,QAAQ,CAAC,GAClCC,YAAW,SAAS,MAAM,GAAG,CAAC,GAC9B,eAAeA,cAAa,QAC5B,YAAYA,cAAa,MACzB,iBAAiBA,cAAaA,WAC9B,cAAc,iBAASA,SAAQ;AAEnC,QAAI,UAAU;AACZ,UAAI,SAAS,cAAc;AAAA,IAC7B,WAAW,gBAAgB;AACzB,eAAS,mBAAmB,cAAc;AAAA,IAC5C,WAAW,WAAW;AACpB,eAAS,kBAAkB,iBAAiB,cAAc,CAAC;AAAA,IAC7D,WAAW,aAAa;AACtB,eAAS,kBAAkB,gBAAgB,CAAC,cAAc,cAAc,CAAC;AAAA,IAC3E,WAAW,aAAa,aAAa;AACnC,eAAS;AAAA,IACX,OAAO;AACL,eAAS,aAAcA,aAAY,QAAUA,YAAW;AAAA,IAC1D;AACA,QAAI,QAAQ;AACV,YAAM,MAAM;AAAA,IACd,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAOD,WAAU,MAAM,eAAe;AACxC;AAEA,IAAO,4BAAQ;;;ACtCf,SAAS,cAAc,OAAO,OAAO,UAAU;AAC7C,SAAO,0BAAkB,OAAO,OAAO,qBAAa,UAAU,CAAC,CAAC;AAClE;AAEA,IAAO,wBAAQ;;;AC3Bf,IAAIE,YAAW,IAAI;AASnB,IAAI,YAAY,EAAE,eAAQ,IAAI,mBAAW,IAAI,YAAI,CAAC,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAMA,aAAY,eAAO,SAAS,QAAQ;AAClG,SAAO,IAAI,YAAI,MAAM;AACvB;AAEA,IAAO,oBAAQ;;;ACVf,IAAIC,oBAAmB;AAWvB,SAAS,SAAS,OAAO,UAAU,YAAY;AAC7C,MAAI,QAAQ,IACR,WAAW,uBACXC,UAAS,MAAM,QACf,WAAW,MACX,SAAS,CAAC,GACV,OAAO;AAEX,MAAI,YAAY;AACd,eAAW;AACX,eAAW;AAAA,EACb,WACSA,WAAUD,mBAAkB;AACnC,QAAI,MAAM,WAAW,OAAO,kBAAU,KAAK;AAC3C,QAAI,KAAK;AACP,aAAO,mBAAW,GAAG;AAAA,IACvB;AACA,eAAW;AACX,eAAW;AACX,WAAO,IAAI;AAAA,EACb,OACK;AACH,WAAO,WAAW,CAAC,IAAI;AAAA,EACzB;AACA;AACA,WAAO,EAAE,QAAQC,SAAQ;AACvB,UAAI,QAAQ,MAAM,KAAK,GACnBC,YAAW,WAAW,SAAS,KAAK,IAAI;AAE5C,cAAS,cAAc,UAAU,IAAK,QAAQ;AAC9C,UAAI,YAAYA,cAAaA,WAAU;AACrC,YAAI,YAAY,KAAK;AACrB,eAAO,aAAa;AAClB,cAAI,KAAK,SAAS,MAAMA,WAAU;AAChC,qBAAS;AAAA,UACX;AAAA,QACF;AACA,YAAI,UAAU;AACZ,eAAK,KAAKA,SAAQ;AAAA,QACpB;AACA,eAAO,KAAK,KAAK;AAAA,MACnB,WACS,CAAC,SAAS,MAAMA,WAAU,UAAU,GAAG;AAC9C,YAAI,SAAS,QAAQ;AACnB,eAAK,KAAKA,SAAQ;AAAA,QACpB;AACA,eAAO,KAAK,KAAK;AAAA,MACnB;AAAA,IACF;AACA,SAAO;AACT;AAEA,IAAO,mBAAQ;;;ACjDf,SAAS,SAAS,OAAO,YAAY;AACnC,eAAa,OAAO,cAAc,aAAa,aAAa;AAC5D,SAAQ,SAAS,MAAM,SAAU,iBAAS,OAAO,QAAW,UAAU,IAAI,CAAC;AAC7E;AAEA,IAAO,mBAAQ;;;ACXf,IAAM,EAAE,MAAAC,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,IAAM,oBAAoB,CAAC,MAAc,MAAc,MAAsB,UACnF,QAAQ,QACL,KAAK,cAAc,MAAM,OAAO,IAChC,KAAK,cAAc,MAAM,OAAO;AAC7B,IAAM,iBAAiB,CAACC,OAAgB,MAAc,SAAiB;AAC7E,SAAO,SAAS,WAAW,aAAK,MAAMA,KAAI,GAAG,aAAK,MAAMA,KAAI,CAAC;AAC9D;AAEO,IAAM,qBAAqB,CAAC,MAAc,MAAc,MAAsB,UAAU,kBAAkB,KAAK,IAAI,KAAK,IAAI,GAAG;AAC/H,IAAM,uBAAuB,gBAAQ,gBAAgB,CAAC,MAAM,IAAI,CAAC;AAGjE,SAAS,gBAAgB,aAAuB,MAAsB,OAAO;AACnF,SAAO,YAAY,KAAK,CAAC,GAAGC,OAAM,mBAAmB,GAAGA,IAAG,GAAG,CAAC;AAChE;AACO,IAAM,aAAa,CAAC,KAAa,iBAAyB,SAAS,IAAI,KAAK,IAAI,EAAE,GAAG,IAAI,KAAK,aAAa,EAAE,CAAC;AAC9G,IAAM,sBAAsB,CAAC,gBAA0B,CAAC,GAAG,IAAI,IAAI,YAAY,IAAI,aAAW,QAAQ,EAAE,CAAC,CAAC;AAC1G,IAAM,kBAAkB,CAAC,MAAc,SAAiB,SAAS,WAAW,MAAM,IAAI;AAEtF,IAAM,yBAAyB,CAAC,gBAA0B;AAChE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,WAAW,aAAa;AAClC,QAAI,CAAC,SAAS;AACb,MAAAF,OAAM,0BAA0B,WAAW;AAC3C,YAAM,IAAI,MAAM,wBAAwB;AAAA,IACzC;AACA,UAAM,MAAM,QAAQ;AACpB,QAAI,OAAO,IAAI,GAAG,GAAG;AACpB,MAAAD,SAAQ,8BAA8B,CAAC,OAAO,IAAI,GAAG,GAAG,OAAO,CAAC;AAAA,IACjE,OAAO;AACN,aAAO,IAAI,KAAK,OAAO;AAAA,IACxB;AAAA,EACD;AACA,SAAO,MAAM,KAAK,OAAO,OAAO,CAAC;AAClC;AAWO,IAAM,YAAY,CAAC,eAAoB,QAAQ,MAAM,WAAW,gBAAU,aAAa,GAAG,IAAI,KAAK;AAEnG,SAAS,WAAWI,IAAqB;AAC/C,SAAO,OAAOA,OAAM,YAAYA,GAAE,WAAW,GAAG;AACjD;AACO,SAAS,gCAAgC,KAAa;AAC5D,SAAO,IAAI,MAAM,CAAC;AACnB;AAIO,SAAS,gBAAgBA,IAA0B;AACzD,MAAI,CAAC,CAAC,UAAU,WAAW,UAAU,UAAU,EAAE,SAAS,OAAOA,EAAC;AAAG,IAAAP,MAAK,iCAAiC,OAAOO,IAAGA,EAAC;AACtH,SAAO,CAAC,WAAWA,EAAC,KAAK,CAAC,UAAU,WAAW,QAAQ,EAAE,SAAS,OAAOA,EAAC;AAC3E;AAaO,SAAS,yBAAyB,SAA8B,WAA0B;AAChG,MAAI,kBAAkB,CAAC;AACvB,QAAM,aAAkC,CAAC;AACzC,aAAW,CAAC,YAAY,YAAY,KAAK,OAAO,QAAQ,OAAO,GAAG;AACjE,QAAI,WAAW,YAAY,GAAG;AAC7B,YAAM,UAAU,gCAAgC,YAAY;AAC5D,YAAM,iBAAiB,UAAU,OAAO;AACxC,UAAI,gBAAgB;AACnB,mBAAW,UAAU,IAAI;AAAA,MAE1B,OAAO;AACN,wBAAgB,UAAU,IAAI;AAAA,MAC/B;AAAA,IACD,OAAO;AACN,iBAAW,UAAU,IAAI;AAAA,IAC1B;AAAA,EACD;AAEA,SAAO,CAAC,YAAY,eAAe;AACpC;AAEA,SAAS,cAAc,UAAkB,YAAyB,SAAuC;AACxG,MAAI,QAAQ,eAAe,QAAQ,GAAG;AAErC,UAAM,QAAQ,QAAQ,QAAQ;AAC9B,UAAM,QAAQ,UAAU,OAAO,YAAY,OAAO;AAElD,WAAO;AAAA,EACR;AAEA,SAAO,EAAE,GAAG,SAAS,CAAC,QAAQ,GAAG,WAAW;AAC7C;AAEO,SAAS,gBAAgB,OAAqB,aAA0C,UAAgC;AAE9H,MAAI;AACJ,MAAI,aAAa;AAChB,UAAM,MAAM,OAAO;AACnB,QAAI,QAAQ,UAAU;AACrB,eAAS,gBAAgB;AAAA,IAC1B,WAAW,QAAQ,YAAY;AAC9B,eAAU,YAAyB,QAAQ;AAAA,IAC5C,WAAW,OAAQ,YAAoB,QAAQ,YAAY;AAC1D,eAAU,YAAyB,IAAI,QAAQ;AAAA,IAChD,WAAW,MAAM,QAAQ,WAAW,KAAK,CAAC,MAAM,QAAQ,QAAQ,GAAsC;AACrG,eAAS,YAAY,SAAS,QAAQ;AAAA,IACvC,OAGK;AACJ,eAAS,gBAAgB;AAAA,IAC1B;AAAA,EACD,OAAO;AACN,aAAS,gBAAgB;AAAA,EAC1B;AAGA,MAAI,MAAM,OAAO,CAAC,MAAM,KAAK;AAC5B,WAAO,CAAC;AAAA,EACT,OAAO;AACN,WAAO;AAAA,EACR;AACD;AACO,SAAS,UAAU,aAA0C,UAAuB,SAAuC;AACjI,MAAI,CAAC,SAAS;AAEb,WAAO;AAAA,EACR;AACA,MAAI,OAAO,gBAAgB,UAAU;AACpC,QAAI,WAAW,WAAW,GAAG;AAC5B,aAAO,cAAc,aAAa,UAAU,OAAO;AAAA,IACpD;AAAA,EAGD;AAEA,MAAI,OAAO,gBAAgB,YAAY;AACtC,WAAO,YAAY,QAAQ,IAAI,UAAU;AAAA,EAC1C;AACA,SAAO,gBAAgB,WAAW,UAAU;AAC7C;AAKO,SAAS,aAAa,SAA8B,QAAgB,SAAuC;AACjH,SAAO,OAAO,QAAQ,OAAO,EAAE,OAAO,CAACC,UAAS,CAAC,OAAO,YAAY,MAAM;AACzE,UAAM,cAAc,OAAO,KAAK;AAEhC,UAAM,cAA2C;AACjD,WAAO,UAAU,aAAa,aAAaA,QAAO;AAAA,EACnD,GAAG,OAAO;AACX;AAEO,SAAS,UAAiC,SAAwB,MAA0D;AAClI,SAAO,OAAO,YAAY,KAAK,IAAI,CAAC,cAAc;AACjD,QAAI,YAAY,MAAM;AACrB,YAAM,IAAI,MAAM,6BAA6B,IAAI,EAAE;AAAA,IACpD;AACA,WAAO;AAAA,MACN,WAAW,SAAS,IAAI,UAAU,QAAQ,OAAO,EAAE,IAAI;AAAA,MACvD,WAAW,SAAS,IAAI,QAAQ,SAAS,IAAI;AAAA,IAC9C;AAAA,EACD,CAAC,CAAC;AACH;AACA,IAAM,MAAM,SAASC,KAAI,OAAiB;AACzC,MAAI,MAAM;AACV,WAAS,IAAI,GAAGC,KAAI,MAAM,QAAQ,IAAIA,IAAG;AAAK,WAAO,MAAM,CAAC;AAC5D,SAAO;AACR;AACA,IAAM,OAAO,SAASC,MAAK,OAAiB;AAC3C,SAAO,IAAI,KAAK,IAAI,MAAM;AAC3B;AACO,IAAM,WAAW;AAAA,EACvB,KAAK,SAAS,OAAiB;AAC9B,WAAO,KAAK,IAAI,MAAM,MAAM,KAAK;AAAA,EAClC;AAAA,EAEA,KAAK,SAAS,OAAiB;AAC9B,WAAO,KAAK,IAAI,MAAM,MAAM,KAAK;AAAA,EAClC;AAAA,EAEA,OAAO,SAAS,OAAiB;AAChC,WAAO,SAAS,IAAI,KAAK,IAAI,SAAS,IAAI,KAAK;AAAA,EAChD;AAAA,EAEA,UAAU,SAAS,OAAiB;AACnC,WAAO,SAAS,MAAM,KAAK,IAAI;AAAA,EAChC;AAAA,EAEA;AAAA,EAEA;AAAA,EAEA,SAAS;AAAA,EAET,QAAQ,SAAS,OAAiB;AACjC,UAAM,KAAK,SAAS,GAAGL,IAAG;AACzB,aAAO,IAAIA;AAAA,IACZ,CAAC;AACD,QAAI,MAAM,MAAM,SAAS;AACzB,WAAO,MAAM,IAAI,MAAM,MAAM,GAAG,KAAK,MAAM,MAAM,CAAC,IAAI,MAAM,GAAG,KAAK;AAAA,EACrE;AAAA,EAEA,OAAO,SAAS,OAAiB;AAChC,QAAI,CAAC,MAAM;AAAQ,aAAO,CAAC;AAC3B,QAAI,UAAU,CAAC,GACd,WAAW,GACX,QAAQ,CAAC;AAEV,UAAM,QAAQ,SAAS,KAAK;AAC3B,UAAI,CAAC,QAAQ,GAAG;AAAG,gBAAQ,GAAG,IAAI;AAAA;AAC7B,gBAAQ,GAAG;AAEhB,UAAI,QAAQ,GAAG,IAAI,UAAU;AAC5B,gBAAQ,CAAC,GAAG;AACZ,mBAAW,QAAQ,GAAG;AAAA,MACvB,WAAW,QAAQ,GAAG,MAAM,UAAU;AACrC,cAAM,KAAK,GAAG;AACd,mBAAW,QAAQ,GAAG;AAAA,MACvB;AAAA,IACD,CAAC;AACD,WAAO;AAAA,EACR;AAAA,EAEA,UAAU,SAAS,OAAiB;AACnC,QAAIK,QAAO,SAAS,KAAK,KAAK;AAC9B,WAAO,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK;AAC5C,aAAO,KAAK,IAAI,MAAMA,OAAM,CAAC;AAAA,IAC9B,CAAC,CAAC;AAAA,EACH;AAAA,EAEA,mBAAmB,SAAS,OAAiB;AAC5C,WAAO,KAAK,KAAK,SAAS,SAAS,KAAK,CAAC;AAAA,EAC1C;AAAA,EAEA,uBAAuB,SAAS,OAAiB;AAChD,QAAIA,QAAO,SAAS,KAAK,KAAK;AAC9B,WAAO,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK;AAC5C,aAAO,KAAK,IAAI,MAAMA,KAAI;AAAA,IAC3B,CAAC,CAAC;AAAA,EACH;AAAA,EAEA,SAAS,SAAS,OAAiB;AAClC,QAAIA,QAAO,SAAS,KAAK,KAAK;AAC9B,QAAI,oBAAoB,SAAS,kBAAkB,KAAK;AACxD,WAAO,MAAM,IAAI,SAAS,KAAK;AAC9B,cAAQ,MAAMA,SAAQ;AAAA,IACvB,CAAC;AAAA,EACF;AACD;AAGA,SAAS,UAAU,SAAS;AAErB,IAAM,eAAe,CAAC,OAAe,UAAkB,MAAM,WAAW,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,CAAC;AAUxG,IAAM,aAAa,SACzB,KACA,OAAO,IACP,WACC;AACD,MAAI,CAAC,KAAK,QAAQ;AACjB,UAAM,IAAI,MAAM,iBAAiB,GAAG,EAAE;AAAA,EACvC;AAEA,MAAI,KAAK,aAAa;AACtB,MAAI,KAAK,aAAa;AACtB,WAAS,IAAI,GAAG,IAAI,IAAI,IAAI,QAAQ,KAAK;AACxC,SAAK,IAAI,WAAW,CAAC;AACrB,SAAK,KAAK,KAAK,KAAK,IAAI,UAAU;AAClC,SAAK,KAAK,KAAK,KAAK,IAAI,UAAU;AAAA,EACnC;AACA,OAAK,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU,IAAI,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU;AACrF,OAAK,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU,IAAI,KAAK,KAAK,KAAM,OAAO,IAAK,UAAU;AAErF,QAAM,SAAS,cAAc,UAAU,OAAO,OAAO,IAAI,SAAS,EAAE;AACpE,SAAO,MAAM,MAAM,CAAC,SAAS,EAAE,SAAS,WAAW,GAAG;AAIvD;AACO,SAAS,0BAA0B,MAAM,MAAM;AACrD,MAAI,KAAK,WAAW,KAAK,QAAQ;AAChC,WAAO;AAAA,EACR;AAEA,QAAM,aAAa,CAAC,GAAG,IAAI,EAAE,KAAK;AAClC,QAAM,aAAa,CAAC,GAAG,IAAI,EAAE,KAAK;AAElC,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC3C,QAAI,WAAW,CAAC,MAAM,WAAW,CAAC,GAAG;AACpC,aAAO;AAAA,IACR;AAAA,EACD;AAEA,SAAO;AACR;AACO,SAAS,aAAqB;AACpC,QAAMC,OAAM,oBAAI,KAAK;AACrB,SAAOA,KAAI,YAAY;AACxB;;;AClUA,IAAM,EAAE,MAAAC,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,SAAS,6BAA6B,iBAAoC,aAAqB;AACrG,QAAM,KAAK,WAAW;AAEtB,QAAM,gBAAgB;AAEtB,QAAM,SAAS,gBAAgB,IAAI,SAAO;AACzC,WAAO,wBAAwB,KAAK,EAAE,IAAI,aAAa,cAAc,CAAC;AAAA,EACvE,CAAC;AACD,SAAO;AACR;AACO,SAAS,4BAA4B,gBAAiC,aAAqB;AACjG,SAAO,6BAA6B,CAAC,cAAc,GAAG,WAAW,EAAE,CAAC;AACrE;AAEO,SAAS,wBACf,KACA,EAAE,IAAI,YAAY,IAA2D,CAAC,GAC7E;AACD,QAAM,YAAY,OAAO,KAAK,MAAM,WAAW,CAAC;AAChD,QAAM,YAAY,WAAW,WAAW,WAAW;AACnD,QAAM,MAAM,sBAAsB,SAAS,EAAE,SAAS;AACtD,MAAK,IAAe,OAAQ,IAAe,QAAQ;AAAK,IAAAJ,MAAK,mDAAmD,EAAE,KAAK,KAAK,UAAU,CAAC;AACvI,QAAM,aAAa,EAAE,GAAG,WAAW,IAAI;AACvC,MAAI,CAAC,cAAc,UAAU,GAAG;AAC/B,UAAMI,OAAM,gBAAgB,KAAK,UAAU,UAAU,CAAC,IAAI,oBAAoB,UAAU,CAAC;AAAA,EAC1F;AACA,SAAO,OAAO,OAAO,UAAU;AAChC;AAEO,SAAS,MAAM,KAA2D;AAChF,SAAO,CAAC,CAAC,IAAI;AACd;AACO,SAAS,MAAM,KAA8E;AACnG,SAAO,CAAC,CAAC,IAAI;AACd;AACO,SAAS,MAAM,KAA+D;AACpF,SAAO,CAAC,CAAC,IAAI;AACd;AAEO,SAAS,OAAO,KAAsB,IAAe;AAC3D,SAAO,MAAM,GAAG,IAAI,MAAM,EAAE,GAAG,KAAK,GAAG;AACxC;AACO,SAAS,WAAW,KAAmC,QAAuC;AACpG,MAAI,IAAI,OAAO;AAAW,WAAO;AACjC,MAAI,CAAC,QAAQ;AACZ,QAAI,CAAC,MAAM,GAAG;AAAG,YAAMA,OAAM,qCAAqC,GAAG;AACrE,WAAO;AAAA,EACR,OAAO;AACN,UAAM,EAAE,IAAI,GAAG,IAAI;AACnB,UAAM,UAAU,OAAO,SAAS,CAAAC,OAAKA,GAAE,MAAM,MAAMA,GAAE,MAAM,EAAE;AAK7D,QAAI,eAAe,CAAC,MAAM,MAAM,MAAM,MAAM,IAAI,GAAG,KAAK,OAAO,GAAG;AACjE,YAAMD,OAAM,kCAAkC,EAAE,KAAK,IAAI,SAAS,OAAO,CAAC;AAAA,IAC3E;AAIA,UAAM,cAAc,IAAI,OAAO,SAAY,IAAI,KAAK,SAAS,QAAQ;AACrE,WAAO,EAAE,GAAG,KAAK,IAAI,WAAW;AAAA,EACjC;AACD;AACO,SAAS,YAAY,SAAgC;AAC3D,QAAM,WAAW,MAAM;AACtB,cAAU,MAAO,QAAQ,SAAS,KAAMF,OAAM,0BAA0B,QAAQ,MAAM,EAAE,CAAC;AACzF,WAAO;AAAA,MACN,uBAAuB,QAAQ,QAAQ,OAAK;AAC3C,cAAM,OAAO,EAAE;AACf,YAAI,CAAC,MAAM;AACV,UAAAE,OAAM,2BAA2B,CAAC;AAClC,gBAAM,IAAI,MAAM,yBAAyB;AAAA,QAC1C;AACA,eAAO;AAAA,MACR,CAAC,CAAC;AAAA,IACH;AAAA,EACD;AACA,MAAI,qBAAqB,UAAU,MAAM,SAAS,CAAC;AACnD,QAAM,cAAiC,OAAO,SAAS,OAAO,cAAc;AAC3E,QAAI,YAAY,KAAK,GAAG;AACvB,aAAO,EAAE,MAAM,UAAU,MAAM,SAAS,CAAC,EAAE;AAAA,IAC5C,OAAO;AAEN,aAAO;AAAA;AAAA,QAEN,OAAO,MAAM,MAAM,OAAO,cAAY,CAAC,KAAK,UAAU,UAAU,IAAI,CAAC;AAAA,QACrE,SAAS,MAAM,SAAS,OAAO,gBAAc;AAC5C,gBAAM,oBAAoB,CAAC,KAAK,QAAQ,KAAK,YAAU;AACtD,gBAAI,WAAW;AAAc,qBAAO;AACpC,mBAAO,OAAO,UAAU,YAAY,IAAI;AAAA,UACzC,CAAC;AACD,iBAAO,CAAC;AAAA,QACT,CAAC;AAAA,MACF;AAAA,IACD;AAAA,EACD,CAAC;AACD,SAAO,IAAI;AAAA,IACV,UAAU,MAAM,UAAU,QAAQ,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG;AAAA,IAChE;AAAA,IACA,CAAC,GAAG;AAAA;AAAA,IACJ;AAAA,IACA;AAAA,EACD;AACD;;;ACrHA,IAAM,EAAE,MAAAE,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAM9D,IAAM,eAAN,MAAM,sBAAqB,OAAO;AAAA;AAAA,EAcxC,YACUC,OACT,SACA,SACS,cACD,cACA,eAAkC,MACzC;AAED;AAAA,MACCA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eACC,WAAW,MAAM,CAAC,GAAG,YAAY,GAAG,EAAE,MAAM,OAAO,MAAM,GAAGA,KAAI,SAAS,CAAC,IACxE;AAAA;AAAA,IACJ;AAfS,gBAAAA;AAGA;AACD;AACA;AAYR,mBAAe,MAAM;AAAA;AAAA,MAEpB,gBAAgB;AAAA,IACjB,CAAC;AAED,QAAI,cAAc;AACjB,WAAK,mBAAmB;AAAA,IACzB;AAAA,EACD;AAAA,EAvCA,OAAO,UAAU,QAAgBA,OAAc,QAA2B;AACzE,WAAO,IAAI;AAAA,MACV,GAAGA,KAAI,IAAI,OAAO,oBAAoB;AAAA,MACtC;AAAA,MACA,OAAO;AAAA;AAAA,MAEP,OAAO;AAAA,MACP;AAAA,MACA;AAAA,IACD;AAAA,EACD;AAAA,EACQ,uBAAkD;AAAA,EA8BnD,OAAO,iBAAoC;AACjD,UAAM,SAAS,KAAK,eAAe,KAAK,aAAa,eAAe,IAAI;AACxE,QAAI,KAAK,gBAAgB,CAAC;AAAQ;AAClC,WAAO,KAAK,QAAQ,QAAQ,YAAU,OAAO,OAAO,MAAM,CAAC;AAAA,EAC5D;AAAA,EACO,UAAU,iBAA2B;AAC3C,UAAM,SAAS,KAAK,eAAe,KAAK,aAAa,eAAe,IAAI;AACxE,QAAI,KAAK,gBAAgB,CAAC;AAAQ;AAClC,WAAO,KAAK,QAAQ,QAAQ,YAAU,OAAO,UAAU,MAAkB,CAAC;AAAA,EAC3E;AAAA,EAEQ,qBAAqB;AAC5B,SAAK,uBAAuB,oBAAI,IAAI;AACpC,UAAM,kBAAkB,QAAQ,MAAM;AACrC,UAAI,CAAC,KAAK,QAAQ,QAAQ;AACzB,QAAAL,MAAK,+BAA+B,IAAI;AAAA,MACzC;AAIA,MAAAG,SAAQ,kBAAkB,KAAK,IAAI,6BAA6B,KAAK,QAAQ,IAAI,OAAK,EAAE,IAAI,CAAC;AAE7F,YAAM,SAAS,oBAAI,IAAI,CAAC,GAAG,KAAK,qBAAqB,KAAK,CAAC,CAAC;AAC5D,iBAAW,KAAK,KAAK,SAAS;AAC7B,YAAI,UAAU,OAAO,OAAO,CAAC;AAC7B,YAAI;AAAS,UAAAA,SAAQ,kBAAkB,KAAK,IAAI,+BAA+B,EAAE,oBAAoB;AACrG,QAAAA,SAAQ,kBAAkB,KAAK,IAAI,uBAAuB,EAAE,oBAAoB;AAChF,cAAM,MAAM,KAAK,eAAe,KAAK,MAAM,CAAC;AAC5C,cAAM,cAAc,EAAE,UAAU,GAAG;AACnC,aAAK,qBAAqB,IAAI,GAAG,WAAW;AAAA,MAC7C;AACA,iBAAW,KAAK,QAAQ;AACvB,QAAAA,SAAQ,kBAAkB,KAAK,IAAI,oCAAoC,EAAE,oBAAoB;AAC7F,YAAI,cAAc,KAAK,qBAAqB,IAAI,CAAC;AACjD,oBAAY;AACZ,aAAK,qBAAqB,OAAO,CAAC;AAAA,MACnC;AAAA,IACD,CAAC;AAAA,EAcF;AAAA,EAEA,UAAU,UAAwC;AACjD,QAAI,CAAC,KAAK,sBAAsB;AAC/B,WAAK,mBAAmB;AAAA,IACzB;AACA,WAAO,MAAM,UAAU,QAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAe;AACd,QAAI,CAAC,KAAK;AAAc,YAAMC,OAAM,2DAA2D,KAAK,oBAAoB;AACxH,IAAAF,OAAM,gBAAgB,KAAK,oBAAoB,gBAAgB;AAC/D,QAAI,KAAK,QAAQ,WAAW,GAAG;AAC9B,MAAAF,MAAK,gBAAgB,KAAK,oBAAoB,mCAAmC,KAAK,QAAQ,MAAM,uBAAuB;AAAA,IAC5H;AACA,SAAK,QAAQ,QAAQ,OAAK;AACzB,WAAK,eAAe,GAAG,EAAE,MAAM,UAAU,MAAM,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;AAAA,IAClE,CAAC;AAAA,EACF;AAAA,EAEU,eAAe,QAAgB,OAAoB;AAC5D,IAAAG,SAAQ,gBAAgB,KAAK,oBAAoB,kBAAkB,KAAK;AACxE,UAAM,YAAY,KAAK,eAAe,KAAK,aAAa,OAAO,MAAM,IAAI;AACzE,QAAI,KAAK,cAAc;AACtB,MAAAA,SAAQ,gBAAgB,KAAK,oBAAoB,4BAA4B,SAAS;AACtF,UAAI,YAAY,SAAS,GAAG;AAC3B;AAAC,QAAC,KAAK,SAAsC,QAAQ,CAAC,GAAG,UAAU,IAAI,CAAC;AAAA,MACzE,OAAO;AACN,mBAAW,OAAO,UAAU,OAAO;AAElC,eAAK,SAAS,OAAO,sBAAc,KAAK,UAAU,KAAK,IAAI,GAAG,GAAG,GAAG;AAAA,QACrE;AACA,YAAI,UAAU,SAAS;AACtB,qBAAW,YAAY,UAAU,SAAS;AACzC,gBAAI,CAAE,KAAK,SAAsC,OAAO,QAAQ,GAAG;AAClE,kBAAI,CAAC,YAAY,KAAK,KAAK,MAAM,SAAS,SAAS,QAAQ,GAAG;AAC7D,gBAAAD,OAAM,wFAAwF,UAAU,KAAK;AAAA,cAC9G,OAAO;AACN,sBAAME,OAAM,gBAAgB,KAAK,IAAI,+CAA+C,UAAU;AAAA,kBAC7F,QAAQ;AAAA,kBACR;AAAA,kBACA;AAAA,gBACD,CAAC;AAAA,cACF;AAAA,YACD;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,IACD;AACA,IAAAD,SAAQ,gBAAgB,KAAK,oBAAoB,2BAA2B,kBAAkB,KAAK,QAAQ,CAAC;AAC5G,SAAK,kBAAkB,SAAS;AAAA,EACjC;AAAA,EACA,IAAI,WAAW;AACd,WAAO;AAAA,EACR;AACD;;;AChJA,IAAM,EAAE,MAAAG,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,IAAMC,iBAAgB,sBAAsB,iBAAiB,SAASA,eAC5E,QACA,SACA,OAAoD,CAAC,GACpD;AACD,MAAI,mBAAmB,oBAAoB,OAAO;AAClD,MAAI,SAAS,WAAW,gBAAgB;AAGxC,QAAM,gBAAgB,WAAW;AAAA,IAChC,UAAU,SAAS,wCAAwC;AAC1D,aAAO,OAAO,OAAO,OAAO;AAAA,IAC7B,CAAC;AAAA,IACD,EAAE,MAAM,OAAO,MAAM,GAAG,OAAO,IAAI,MAAM,KAAK,QAAQ,uBAAuB,gBAAU,gBAAgB,CAAC,GAAG,GAAG;AAAA,EAC/G;AACA,QAAM,oBAAuC,CAAC,UAAU;AACvD,QAAI;AACJ,QAAI,YAAY,KAAK,GAAG;AACvB,oBAAc,EAAE,MAAM,OAAO,MAAM,IAAI,EAAE;AAAA,IAC1C,OAAO;AACN,oBAAc;AAAA,QACb,OAAO,OAAO,MAAM,KAAK;AAAA,QACzB,SAAS,MAAM;AAAA;AAAA,MAChB;AAAA,IACD;AACA,IAAAF;AAAA,MACC,iBAAiB,OAAO,oBAAoB,MAAM,KAAK,OAAO,KAAK,KAAK,IAAI,OAAO,EAAE;AAAA,MACrF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACD;AAGA,WAAO;AAAA,EACR;AACA,QAAM,eAAe,IAAI;AAAA,IACxB,GAAG,OAAO,IAAI,MAAM,KAAK,QAAQ,iBAAiB,gBAAU,gBAAgB,CAAC,GAAG;AAAA,IAChF;AAAA,IACA,CAAC,GAAG,OAAO,SAAS,GAAI,KAAK,kBAAkB,CAAC,KAAK,eAAe,IAAI,CAAC,CAAE;AAAA,IAC3E;AAAA,IACA;AAAA,EACD;AAGA,QAAM,wBAAwB;AAAA,IAC7B,MAAM,KAAK,OAAO;AAAA;AAAA,IAClB,CAAC,QAAQ;AACR,MAAAA;AAAA,QACC,iBAAiB,OAAO,oBAAoB,IAAI,KAAK,OAAO,KAAK,KAAK,IAAI,MAAM,EAAE;AAAA,QAClF;AAAA,QACA;AAAA,QACA;AAAA;AAAA,MACD;AACA,yBAAmB;AACnB,eAAS,WAAW,gBAAgB;AACpC,mBAAa,aAAa;AAAA,IAC3B;AAAA,EACD;AAEA,QAAM,uBAAuB,mBAAmB,eAAe,MAAM;AACpE,IAAAA,SAAQ,iBAAiB,UAAU,MAAM,OAAO,IAAI,CAAC,IAAI,KAAK,OAAO,KAAK,KAAK,IAAI,MAAM,EAAE,cAAc,gBAAgB;AACzH,0BAAsB;AACtB,yBAAqB;AAAA,EACtB,CAAC;AAED,SAAO;AACR,GAAG;AAAA,EACF,QAAQ;AAAA,EACR,eAAe,CAAC,QAAQ,SAAS,SAAS,gBAAgB,EAAE,QAAQ,iBAAiB,QAAQ,SAAS,MAAM,KAAK,CAAC;AACnH,CAAC;AAEM,IAAM,gBAAgB,sBAAsB,iBAAiB,SAASG,eAC5E,QACA,aACA,OAAoD,CAAC,GACpD;AACD,QAAM,mBAAmB,UAAU,MAAM,YAAY,KAAK,MAAM,EAAE,MAAM,OAAO,QAAQ,GAAG,MAAM,CAAC;AACjG,MAAI,CAAC,YAAY,gBAAgB,GAAG;AACnC,UAAMF,OAAM,oCAAoC;AAAA,EACjD;AACA,QAAM,cAAc,iBAAiB;AAErC,SAAO,IAAI;AAAA,IACV,GAAG,OAAO,IAAI,MAAM,KAAK,QAAQ,eAAe;AAAA,IAChD;AAAA,IACA,CAAC,GAAG,OAAO,SAAS,GAAI,KAAK,kBAAkB,CAAC,KAAK,eAAe,IAAa,CAAC,CAAW;AAAA;AAAA,IAE7F;AAAA,IACA;AAAA,EACD;AACD,GAAG;AAAA,EACF,QAAQ;AAAA,EACR,eAAe,CAAC,QAAQ,SAAS,SAAS,gBAAgB,EAAE,QAAQ,iBAAiB,QAAQ,MAAM,KAAK,CAAC;AAC1G,CAAC;AAEM,IAAM,aAAa;AAAA,EACzB;AAAA,EACA,SAASG,YACR,QACA,KACA,aACA,OAA0B,CAAC,GAC1B;AAED,UAAM,oBAAoB,OAAO,WAAW;AAC5C,sBAAkB,EAAE,MAAM,OAAO,QAAQ,GAAG,GAAG;AAC/C,WAAO,UAAU,WAAS;AACzB,wBAAkB,OAAO,GAAG;AAAA,IAC7B,CAAC;AAED,WAAO;AAAA,EACR;AAAA,EACA,EAAE,eAAe,CAAC,QAAQ,MAAM,SAAS,SAAS,cAAc,OAAO,oBAAoB,GAAG,MAAM,OAAO,MAAM,MAAM,IAAI,KAAK,EAAE,IAAI;AACvI;AAwBO,IAAM,sBAAsB,SAASC,qBAC3C,SACC;AACD,QAAM,mBAAmB,UAAU,SAAS,wBAAwB;AACnE,WAAO,OAAO,YAAY,OAAO,QAAQ,KAAK,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,EAC5F,CAAC;AACD,MAAI,CAAC,OAAO,QAAQ,gBAAgB,EAAE,QAAQ;AAC7C,UAAM,IAAI,MAAM,kBAAkB;AAAA,EACnC;AACA,SAAO;AACR;AACO,SAAS,WACf,SACC;AACD,SAAO,SAAS,WAAW,MAAyB;AACnD,WAAO,KAAK,OAAO,SAAS,oBAAoB,QAAQ;AACvD,iBAAW,SAAS,OAAO,KAAK,OAAO,GAAG;AACzC,YAAI,eAAe,QAAQ,KAAK;AAChC,YAAI,iBAAiB;AAAW;AAChC,cAAM,cAAc,OAAO,MAAM,WAAW,GAAG,IAAI,MAAM,MAAM,CAAC,IAAI,KAAK;AACzE,cAAM,cAA2C;AACjD,YAAI,CAAC,gBAAgB,OAAuB,aAAa,WAAW,GAAG;AACtE,iBAAO;AAAA,QACR;AAAA,MACD;AACA,aAAO;AAAA,IACR,CAAC;AAAA,EACF;AACD;AAKO,IAAM,4BAA4B,SAASC,2BACjD,QACA,SACA,OAA0B,CAAC,GAC1B;AACD,QAAM,mBAAmB,oBAAoB,OAAO;AACpD,QAAM,SAAS,WAAW,gBAAgB;AAC1C,SAAO,UAAU,MAAM,OAAO,OAAO,OAAO,CAAC;AAC9C;AAQO,SAAS,UAA4B,QAAgB,QAA0C;AACrG,SAAO,OAAO,QAAQ,SAAS,MAAM;AACtC;AACO,SAAS,UAAU,QAAuD;AAChF,MAAI,OAAO,QAAQ,QAAQ;AAC1B,IAAAT,MAAK,oBAAoB,OAAO,oBAAoB,kBAAkB,OAAO,OAAO;AAAA,EACrF;AACA,SAAO;AACR;AACO,SAAS,kBAAkB,QAAoD;AACrF,MACC,CAAC,UAAU,QAAQ,eAAe,KAClC,CAAC,UAAU,QAAQ,gBAAgB;AAClC,UAAMI,OAAM,sCAAsC,OAAO,OAAO;AAClE,SAAO;AACR;AAWO,IAAM,qBAAqB,SAASM,oBAC1C,QACA,WACA,OAAoD,CAAC,GACpD;AACD,QAAM,WAAW,oBAAI,IAAuB;AAC5C,QAAM,UAAU,CAAC,SAA4BC,YAAmB;AAC/D,UAAM,KAAK,WAAW;AACtB,WAAO,QAAQ,IAAI,SAAO;AACzB,YAAM,SAAS,UAAU,KAAKA,OAAM;AACpC,UAAI;AACJ,UAAI,WAAW,KAAK;AACnB,gBAAQ;AAAA,MACT,OAAO;AACN,YAAK,OAAkB,QAAQ,IAAI,KAAK;AACvC,iBAAQ,OAAkB;AAAA,QAC3B;AACA,gBAAQ,wBAAwB,QAAQ;AAAA,UACvC;AAAA,UACA,aAAa;AAAA;AAAA,QACd,CAAC;AAAA,MACF;AACA,eAAS,IAAI,IAAI,KAAK,KAAK;AAC3B,aAAO;AAAA,IACR,CAAC;AAAA,EACF;AAEA,QAAM,oBAAuC,CAAC,UAAU;AACvD,QAAI;AACJ,QAAI,YAAY,KAAK,GAAG;AACvB,oBAAc,EAAE,MAAM,QAAQ,MAAM,MAAM,MAAM,EAAE;AAAA,IACnD,OAAO;AACN,oBAAc;AAAA,QACb,OAAO,QAAQ,MAAM,OAAO,MAAM;AAAA,QAClC,SAAS,MAAM,QAAQ,IAAI,sBAAoB;AAC9C,gBAAM,YAAY,SAAS,IAAI,iBAAiB,GAAG;AACnD,cAAI,CAAC,WAAW;AACf,kBAAMP,OAAM,gFAAgF,EAAE,iBAAiB,CAAC;AAAA,UACjH;AACA,mBAAS,OAAO,iBAAiB,GAAG;AACpC,iBAAO;AAAA,QACR,CAAC;AAAA,MACF;AAAA,IACD;AACA,IAAAD;AAAA,MACC,sBAAsB,OAAO,oBAAoB,MAAM,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,EAAE;AAAA,MAC5F;AAAA,MACA;AAAA,MACA;AAAA,IACD;AAGA,WAAO;AAAA,EACR;AACA,QAAM,eAAe,cAAc,QAAQ,mBAAmB,IAAI;AAClE,EAAAA,SAAQ,cAAc,QAAQ,MAAM;AACnC,IAAAA,SAAQ,sBAAsB,OAAO,oBAAoB,eAAe,aAAa,OAAO;AAAA,EAC7F,CAAC;AACD,SAAO;AACR;;;AChSA,IAAM,EAAE,MAAAS,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,IAAe,kBAAf,cAAuC,OAAO;AAAA,EACpD,YACCC,OAEA,UAAoB,CAAC,GACrB,SACC;AACD,UAAMA,OAAM,MAAM,SAAS,OAAO;AAElC,mBAAe,MAAM;AAAA;AAAA,IAErB,CAAC;AAAA,EACF;AAAA,EAEO,MAAM,aAA0B;AACtC,UAAM,cAAc,KAAK,QAAQ;AAEjC,SAAK,WAAW,KAAK,QAAQ,OAAO,SAAK,CAAE,YAAY,SAAS,IAAI,GAAG,CAAE;AACzE,WAAO,cAAc,KAAK,QAAQ;AAAA,EACnC;AAAA,EACO,OAAO,iBAAoC;AACjD,UAAM,SAAS,6BAA6B,iBAAiB,IAAI;AACjE,WAAO,KAAK,UAAU,MAAM;AAAA,EAC7B;AAAA,EAEO,UAAU,iBAA2B;AAC3C,UAAM,eAAe,uBAAuB,eAAe;AAC3D,QAAI,aAAa,WAAW,gBAAgB,QAAQ;AACnD,YAAMD,OAAM,yCAAyC,gBAAgB,SAAS,aAAa,MAAM,IAAI;AAAA,QACpG;AAAA,QACA;AAAA,MACD,CAAC;AAAA,IACF;AAEA,UAAM,QAAQ,gBAAgB,OAAO,SAAO,CAAC,cAAc,GAAG,CAAC;AAC/D,QAAI,MAAM,QAAQ;AACjB,YAAMA,OAAM,qCAAqC,MAAM,MAAM,IAAI,EAAE,MAAM,CAAC;AAAA,IAC3E;AAEA,UAAM,WAAW,gBAAgB,OAAO,SAAO,KAAK,UAAU,KAAK,KAAK,CAAC;AACzE,QAAI,SAAS,QAAQ;AACpB,YAAMA,OAAM,gDAAgD,SAAS,MAAM,IAAI,EAAE,SAAS,CAAC;AAAA,IAC5F;AAEA,QAAI,CAAC,gBAAgB,QAAQ;AAC5B,MAAAJ,MAAK,oDAAoD;AACzD;AAAA,IACD;AAEA;AAAC,KAAC,CAAC,KAAK,cAAc,EAAE,gBAAgB,kBAAkBC,OAAMC;AAAA,MAC/D;AAAA,MACA,gBAAgB,WAAW,IAAI,gBAAgB,CAAC,IAAI;AAAA,MACpD,EAAE,IAAI,KAAK;AAAA,IACZ;AACA,oBAAgB,eAAe;AAC/B,UAAM,aAAa,KAAK,SAAS,UAAU,WAAW,gBAAgB,CAAC,GAAG,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC,CAAC;AACjH,SAAK,SAAS,KAAK,GAAG,eAAe;AACrC,QAAI,YAAY;AACf,sBAAgB,KAAK,QAAQ;AAAA,IAC9B;AACA,SAAK,kBAAkB,EAAE,OAAO,iBAAiB,SAAS,KAAK,CAAC;AAGhE,SAAK,KAAK,QAAQ,eAAe;AACjC,WAAO;AAAA,EACR;AAAA,EAEA,IAAI,WAAW;AACd,WAAO;AAAA,EACR;AAGD;AACO,IAAM,iBAAN,MAAM,wBAAuB,gBAAgB;AAAA,EAQnD,YACCG,OACA,SACA,SACS,WACR;AACD,UAAMA,OAAM,SAAS,OAAO;AAFnB;AAIT,mBAAe,MAAM;AAAA;AAAA,MAEpB,UAAU,WAAW;AAAA,IACtB,CAAC;AAAA,EACF;AAAA,EAnBA,OAAO,MAAMA,OAAe;AAC3B,WAAO,gBAAe,UAAU,CAAC,GAAGA,SAAQ,mBAAmB,KAAK;AAAA,EACrE;AAAA,EACA,OAAO,UAAU,SAAmBA,OAAe,WAAW,OAAO;AACpE,WAAO,IAAI,gBAAeA,SAAQ,aAAa,SAAS,CAAC,GAAG,QAAQ;AAAA,EACrE;AAAA,EAgBA,IAAI,WAAW;AACd,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,MAAgB,QAAQ,MAAgB;AACvC,IAAAF,SAAQ,kCAAkC,IAAI;AAC9C,QAAI,KAAK,UAAU;AAClB,YAAMC,OAAM,sCAAsC;AAAA,IACnD;AAAA,EACD;AACD;;;ACxGA,IAAM,EAAE,MAAAE,OAAM,KAAAC,MAAK,OAAAC,QAAO,SAAAC,UAAS,OAAAC,OAAM,IAAI,EAAO,MAAM,EAAO,IAAI;AAE9D,SAAS,YAAY,QAAgB;AAC3C,SAAO,aAAa,MAAM,EAAE;AAC7B;AACO,SAAS,aAAa,QAAgB;AAC5C,SAAO,oBAAoB,QAAQ,SAAO,IAAI,EAAE;AACjD;AAEA,SAAS,oBACR,cACA,UACC;AACD,QAAM,OAAO,wBAAwB,SAAS,aAAa,UAAU;AACrE,QAAM,MAAM,oBAAI,IAAS;AACzB,aAAW,OAAO,MAAM;AACvB,QAAI,IAAI,SAAS,KAAK,GAAG,CAAC;AAAA,EAC3B;AACA,SAAO;AACR;AAEO,SAAS,eACf,QACA,OAAO,KACP,uBAAuB,sBACtB;AACD,MAAI,OAAO;AAAU,UAAMA,OAAM,wCAAwC,OAAO,IAAI;AACpF,MAAI,cAA+C,CAAC;AAEpD,QAAM,kBAAkB,iBAAS,MAAM;AACtC,IAAAJ,MAAK,iBAAiB,EAAE,QAAQ,cAAc,YAAY,CAAC;AAC3D,UAAM,WAAW;AAAA;AAAA,MAEhB,iBAAS,YAAY,QAAQ,GAAG,oBAAoB;AAAA,MACpD;AAAA,IACD;AACA,WAAO,UAAU,QAAQ;AACzB,gBAAY,OAAO,GAAG,YAAY,MAAM;AAAA,EACzC,GAAG,IAAI;AACP,QAAM,eAAe,CAAC,YAA0C;AAC/D,IAAAE,OAAM,mBAAmB,SAAS,EAAE,QAAQ,cAAc,YAAY,CAAC;AACvE,gBAAY,KAAK,GAAG,OAAO;AAC3B,oBAAgB;AAChB,WAAO;AAAA,EACR;AAEA,QAAM,eAAe,aAAa;AAAA,IACjC;AAAA,IACA,YAAY,IAAI;AAAA,IAChB;AAAA,EACD;AACA,SAAO;AACR;AAMO,SAAS,mBACf,QACA,eACA,MAIC;AACD,EAAAA,OAAM,sCAAsC,EAAE,cAAc,CAAC;AAC7D,MAAI,OAAO;AAAU,UAAME,OAAM,4CAA4C,OAAO,oBAAoB;AACxG,QAAM,WAAW;AAAA,IAAU;AAAA;AAAA,MAE1B,6BAA6B,CAAC,GAAG,aAAa,GAAG,MAAM;AAAA;AAAA,EACxD;AACA,QAAM,aAAa,eAAe,UAAU,QAAQ;AAEpD,MAAI,cAAc;AAClB,QAAM,eAAe,CAAC,gBAA8C;AACnE,QAAI;AAAa,aAAO;AACxB,kBAAc;AAEd,QAAI,WAAW,CAAC,GAAG,QAAQ;AAE3B,QAAI,KAAK,0BAA0B;AAClC,iBAAW,SAAS;AAAA,QAAO;AAAA;AAAA,UAE1B,CAAC,YAAY,KAAK,aAAW,KAAK,yBAAyB,SAAS,OAAO,CAAC;AAAA;AAAA,MAC7E;AAAA,IACD;AACA,QAAI,KAAK,cAAc;AACtB,YAAM,iBAAiB,KAAK,aAAa,QAAQ;AACjD,UAAI,mBAAmB,QAAW;AACjC,mBAAW;AAAA,MACZ;AAAA,IACD;AACA,IAAAF,OAAM,0CAA0C,EAAE,eAAe,UAAU,UAAU,YAAY,CAAC;AAClG,WAAO,CAAC,GAAG,UAAU,GAAG,WAAW;AAAA,EACpC;AACA,QAAM,eAAe,YAAY,CAAC,QAAQ,UAAU,CAAC;AACrD,SAAO,IAAI;AAAA,IACV,sBAAsB,cAAc,MAAM,KAAK,OAAO,oBAAoB;AAAA,IAC1E;AAAA,IACA,OAAO;AAAA;AAAA,IAEP,aAAa;AAAA,IACb;AAAA,IACA,CAAC,YAAY;AACZ,YAAM,eAAe,aAAa,OAAO;AACzC,aAAO,OAAO,YAAY;AAC1B,aAAO;AAAA,IACR;AAAA,EACD;AACD;","names":["exports","exports","module","b","keys","exports","module","hasOwnProperty","configure","value","tmp","keys","key","res","join","stringify","exports","exports","TypeSystem","Type","format","TypeSystemErrorFunction","Set","TypeSystemPolicy","isObject","exports","exports","ByteMarker","Hash","exports","ValueErrorType","value","property","format","require_errors","exports","m","require_system","exports","m","exports","value","schema","property","exports","HasTransform","schema","property","DecodeTransform","value","EncodeTransform","exports","code","Character","MemberExpression","Identifier","buffer","LiteralString","Policy","TypeCompiler","schema","property","keys","name","length","expression","format","require_compiler","exports","m","stringify","PERFORMANCE_PREFIX_ENABLED","isNode","g","time","delta","sinceFirstNum","sinceLast","t","string","formattersEnabled","Logger","level","_Logger","config","matches","skippedFirst","obj","StringFormatters","formatter","p","logriniTest","b","L","configure","cjsModule","cjsModule","b","name","equals","added","reaction","computation","WARN","LOG","DEBUG","VERBOSE","ERROR","name","l","decode","encode","format","name","isBuffer","buf","bytes","length","c","b","isBuffer","c","buf","bytes","buf","encodedSize","buf","encodedSize","compareTokens","length","buf","l","bytes","encodedSize","compareTokens","toToken","length","l","toToken","length","l","buf","encodedSize","toToken","length","l","buf","encodedSize","buf","encodedSize","bytes","buf","encodedSize","ui8a","e","keys","length","buf","m","buf","is","mapSorter","defaultEncodeOptions","encode","c","l","decode","name","x","encode","length","i","j","decode","buffer","name","bytes","encode","decode","buffer","decode","equals","encode","decode","buf","b","l","decode","code","code","bytes","decode","equals","b","base","bytes","baseCache","code","bytes","self","equals","base","decode","length","cache","cid","from","name","code","encode","bytes","encode","decode","format","decode","b","isBytes","utf8ToBytes","isBytes","isLE","l","buffer","dataView","length","b","c","E","base","bytes","encode","l","name","sha256","from","WARN","LOG","DEBUG","VERBOSE","ERROR","bytes","sha256","encode","Symbol","e","objectProto","nativeObjectToString","symToStringTag","length","INFINITY","e","funcProto","objectProto","funcToString","hasOwnProperty","WeakMap","nativeMax","length","objectProto","hasOwnProperty","length","length","objectProto","hasOwnProperty","length","e","length","length","length","length","WRAP_BIND_FLAG","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","length","length","length","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_FLIP_FLAG","length","length","WRAP_BIND_FLAG","PLACEHOLDER","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_BOUND_FLAG","WRAP_CURRY_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","nativeMin","WRAP_BIND_FLAG","WRAP_BIND_KEY_FLAG","WRAP_CURRY_FLAG","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","nativeMax","length","objectProto","hasOwnProperty","nativeMax","length","MAX_SAFE_INTEGER","objectProto","objectProto","hasOwnProperty","isBuffer","argsTag","funcTag","freeExports","freeModule","moduleExports","e","objectProto","hasOwnProperty","length","objectProto","hasOwnProperty","objectProto","hasOwnProperty","objectProto","hasOwnProperty","HASH_UNDEFINED","Hash","length","length","length","Map","length","FUNC_ERROR_TEXT","cache","cache","toString","INFINITY","length","get","length","length","length","length","objectProto","propertyIsEnumerable","DataView","Promise","Set","mapTag","objectTag","setTag","weakMapTag","dataViewTag","Uint8Array","HASH_UNDEFINED","length","length","cache","othValue","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","COMPARE_PARTIAL_FLAG","objectProto","hasOwnProperty","COMPARE_PARTIAL_FLAG","argsTag","arrayTag","objectTag","objectProto","hasOwnProperty","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","length","length","length","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","FUNC_ERROR_TEXT","nativeMax","nativeMin","length","length","length","WRAP_PARTIAL_FLAG","MAX_ARRAY_LENGTH","nativeMin","computed","INFINITY","LARGE_ARRAY_SIZE","length","computed","WARN","LOG","DEBUG","VERBOSE","ERROR","keys","b","x","context","sum","l","mean","now","WARN","LOG","DEBUG","VERBOSE","ERROR","l","WARN","LOG","DEBUG","VERBOSE","ERROR","name","WARN","LOG","DEBUG","VERBOSE","ERROR","rollingFilter","rollingMapper","rollingAcc","getUntrackedPattern","getUntrackedFilterResults","simpleApplogMapper","thread","WARN","LOG","DEBUG","VERBOSE","ERROR","name","WARN","LOG","DEBUG","VERBOSE","ERROR"]}