seroval 0.2.0 → 0.3.0

package/dist/cjs/development/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../../../src/index.ts", "../../../src/array.ts", "../../../src/get-identifier.ts", "../../../src/context.ts", "../../../src/is-primitive.ts", "../../../src/is-promise.ts", "../../../src/quote.ts", "../../../src/serialize-primitive.ts", "../../../src/async.ts", "../../../src/sync.ts"],
-  "sourcesContent": ["/* eslint-disable no-await-in-loop */\nimport { join } from './array';\nimport { lookupRefsAsync, traverseAsync } from './async';\nimport {\n  SerializationContext,\n  getRefParam,\n  createRef,\n  resolvePatches,\n  createSerializationContext,\n} from './context';\nimport isPrimitive from './is-primitive';\nimport serializePrimitive from './serialize-primitive';\nimport { lookupRefs, traverseSync } from './sync';\nimport {\n  AsyncServerValue,\n  NonPrimitiveServerValue,\n  PrimitiveValue,\n  ServerValue,\n} from './types';\n\nexport { AsyncServerValue, ServerValue, PrimitiveValue };\n\nfunction finalize<T extends ServerValue | AsyncServerValue>(\n  ctx: SerializationContext,\n  source: NonPrimitiveServerValue<T>,\n  result: string,\n) {\n  // Shared references detected\n  if (ctx.vars.length) {\n    // Get (or create) a ref from the source\n    const index = getRefParam(ctx, createRef(ctx, source));\n    const patches = resolvePatches(ctx);\n    const params = ctx.vars.length > 1\n      ? `(${join(ctx.vars, ',')})`\n      : ctx.vars[0];\n    // Source is probably already assigned\n    if (result.startsWith(`${index}=`)) {\n      return `(${params}=>(${result},${patches}${index}))()`;\n    }\n    return `(${params}=>(${index}=${result},${patches}${index}))()`;\n  }\n  if (source.constructor === Object) {\n    return `(${result})`;\n  }\n  return result;\n}\n\nexport function serialize(source: ServerValue) {\n  if (isPrimitive(source)) {\n    return serializePrimitive(source);\n  }\n  const ctx = createSerializationContext();\n  // Lookup possible shared references\n  lookupRefs(ctx, source);\n  // Add shared references to refs\n  for (const [key, value] of ctx.refCount.entries()) {\n    if (value > 1) {\n      createRef(ctx, key);\n    }\n  }\n  // Get top-level serialization\n  const result = traverseSync(ctx, source);\n  if (typeof result !== 'string') {\n    throw new Error('Unreachable error');\n  }\n  return finalize(ctx, source, result);\n}\n\nexport async function serializeAsync(source: AsyncServerValue) {\n  if (isPrimitive(source)) {\n    return serializePrimitive(source);\n  }\n  const ctx = createSerializationContext();\n  // Lookup possible shared references\n  await lookupRefsAsync(ctx, source);\n  // Add shared references to refs\n  for (const [key, value] of ctx.refCount.entries()) {\n    if (value > 1) {\n      createRef(ctx, key);\n    }\n  }\n  // Get top-level serialization\n  const result = await traverseAsync(ctx, source);\n  if (typeof result !== 'string') {\n    throw new Error('Unreachable error');\n  }\n  return finalize(ctx, source, result);\n}\n\nexport function deserialize<T extends AsyncServerValue>(source: string): T {\n  // eslint-disable-next-line no-eval\n  return (0, eval)(source) as T;\n}\n\nexport default serialize;\n", "export function forEach<T>(arr: T[], callback: (value: T, index: number) => (boolean | void)) {\n  for (let i = 0, len = arr.length; i < len; i++) {\n    if (callback(arr[i], i)) {\n      break;\n    }\n  }\n}\n\nexport function join(arr: string[], joiner: string): string {\n  let result = '';\n  forEach(arr, (value, index) => {\n    result += value;\n    if (index < arr.length - 1) {\n      result += joiner;\n    }\n  });\n  return result;\n}\n", "// Written by https://github.com/DylanPiercey and is distributed under the MIT license.\nconst REF_START_CHARS = 'hjkmoquxzABCDEFGHIJKLNPQRTUVWXYZ$_'; // Avoids chars that could evaluate to a reserved word.\nconst REF_START_CHARS_LEN = REF_START_CHARS.length;\nconst REF_CHARS = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789$_';\nconst REF_CHARS_LEN = REF_CHARS.length;\n\nexport default function getIdentifier(index: number) {\n  let mod = index % REF_START_CHARS_LEN;\n  let ref = REF_START_CHARS[mod];\n  index = (index - mod) / REF_START_CHARS_LEN;\n  while (index > 0) {\n    mod = index % REF_CHARS_LEN;\n    ref += REF_CHARS[mod];\n    index = (index - mod) / REF_CHARS_LEN;\n  }\n  return ref;\n}\n", "import { forEach, join } from './array';\nimport getIdentifier from './get-identifier';\nimport { AsyncServerValue } from './types';\n\nexport const EMPTY_SET = 'new Set';\nexport const EMPTY_MAP = 'new Map';\nexport const EMPTY_ARRAY = '[]';\n\n// Array of assignments to be done (used for recursion)\nexport type Assignment = [source: string, value: string];\n\n// Array of Map.prototype.set calls\nexport type MapSet = [source: string, key: string, value: string];\n\n// Array of Set.prototype.add calls\nexport type SetAdd = [source: string, value: string];\n\nexport interface SerializationContext {\n  stack: Set<unknown>;\n  // Set to check if ref id already has an assigned value\n  assignedRefs: Set<number>;\n  // Variables\n  vars: string[];\n  // Array of assignments to be done (used for recursion)\n  assignments: Assignment[];\n  // Array of Map.prototype.set calls\n  mapSets: MapSet[];\n  // Array of Set.prototype.add calls\n  setAdds: SetAdd[];\n  // Reference counter\n  refCount: Map<unknown, number>;\n  // Value-to-ref map\n  refs: Map<unknown, number>;\n}\n\nexport function createSerializationContext(): SerializationContext {\n  return {\n    refCount: new Map(),\n    stack: new Set(),\n    refs: new Map(),\n    assignedRefs: new Set(),\n    vars: [],\n    assignments: [],\n    mapSets: [],\n    setAdds: [],\n  };\n}\n\nexport function resolveAssignments(ctx: SerializationContext) {\n  if (ctx.assignments.length) {\n    const result: Record<string, string> = {};\n\n    // Merge all assignments with similar source\n    forEach(ctx.assignments, ([source, value]) => {\n      if (value in result) {\n        result[value] = `${source}=${result[value]}`;\n      } else {\n        result[value] = `${source}=${value}`;\n      }\n    });\n\n    return `${join(Object.values(result), ',')},`;\n  }\n  return '';\n}\n\nexport function resolveMapSets(ctx: SerializationContext) {\n  if (ctx.mapSets.length) {\n    const result: Record<string, string> = {};\n\n    // Merge all assignments with similar source\n    forEach(ctx.mapSets, ([source, key, value]) => {\n      if (source in result) {\n        result[source] = `${result[source]}.set(${key},${value})`;\n      } else {\n        result[source] = `${source}.set(${key},${value})`;\n      }\n    });\n\n    return `${join(Object.values(result), ',')},`;\n  }\n  return '';\n}\n\nexport function resolveSetAdds(ctx: SerializationContext) {\n  if (ctx.setAdds.length) {\n    const result: Record<string, string> = {};\n\n    // Merge all assignments with similar source\n    forEach(ctx.setAdds, ([source, value]) => {\n      if (source in result) {\n        result[source] = `${result[source]}.add(${value})`;\n      } else {\n        result[source] = `${source}.add(${value})`;\n      }\n    });\n\n    return `${join(Object.values(result), ',')},`;\n  }\n  return '';\n}\n\nexport function resolvePatches(ctx: SerializationContext) {\n  return `${resolveAssignments(ctx)}${resolveMapSets(ctx)}${resolveSetAdds(ctx)}`;\n}\n\nexport function insertRef(ctx: SerializationContext, current: unknown) {\n  const count = ctx.refCount.get(current) || 0;\n  ctx.refCount.set(current, count + 1);\n  return count === 0;\n}\n\nexport function constructorCheck<T extends NonNullable<AsyncServerValue>>(\n  value: NonNullable<AsyncServerValue>,\n  constructor: unknown,\n): value is T {\n  return value.constructor === constructor;\n}\n\nexport function createRef(\n  ctx: SerializationContext,\n  value: unknown,\n) {\n  const current = ctx.refs.get(value);\n  if (current != null) {\n    return current;\n  }\n  const id = ctx.refs.size;\n  ctx.refs.set(value, id);\n  return id;\n}\n\nexport function getRefParam(ctx: SerializationContext, index: number) {\n  if (ctx.vars[index]) {\n    return ctx.vars[index];\n  }\n  const result = getIdentifier(index);\n  ctx.vars[index] = result;\n  return result;\n}\n\nexport function assignRef(\n  ctx: SerializationContext,\n  index: number,\n  value: string,\n) {\n  return `${getRefParam(ctx, index)}=${value}`;\n}\n\nexport function createAssignment(\n  ctx: SerializationContext,\n  source: string,\n  value: string,\n) {\n  ctx.assignments.push([source, value]);\n}\n\nexport function createSetAdd(\n  ctx: SerializationContext,\n  ref: number,\n  value: string,\n) {\n  ctx.setAdds.push([getRefParam(ctx, ref), value]);\n}\n\nexport function createMapSet(\n  ctx: SerializationContext,\n  ref: number,\n  key: string,\n  value: string,\n) {\n  ctx.mapSets.push([getRefParam(ctx, ref), key, value]);\n}\n\nexport function createArrayAssign(\n  ctx: SerializationContext,\n  ref: number,\n  index: number,\n  value: string,\n) {\n  createAssignment(ctx, `${getRefParam(ctx, ref)}[${index}]`, value);\n}\n\nexport function createObjectIdentifierAssign(\n  ctx: SerializationContext,\n  ref: number,\n  key: string,\n  value: string,\n) {\n  createAssignment(ctx, `${getRefParam(ctx, ref)}.${key}`, value);\n}\n\nexport function createObjectComputedAssign(\n  ctx: SerializationContext,\n  ref: number,\n  key: string,\n  value: string,\n) {\n  createAssignment(ctx, `${getRefParam(ctx, ref)}[${key}]`, value);\n}\n", "import { PrimitiveValue } from './types';\n\nexport default function isPrimitive(current: unknown): current is PrimitiveValue {\n  if (!current || current === true) {\n    return true;\n  }\n  const type = typeof current;\n  const classConst = current.constructor;\n  return type === 'number'\n    || type === 'string'\n    || type === 'bigint'\n    || classConst === Date\n    || classConst === RegExp;\n}\n", "export default function isPromise<T>(obj: unknown): obj is PromiseLike<T> {\n  return !!obj\n    && (typeof obj === 'object' || typeof obj === 'function')\n    && 'then' in obj\n    && typeof obj.then === 'function';\n}\n", "// Written by https://github.com/DylanPiercey and is distributed under the MIT license.\n// Creates a JavaScript double quoted string and escapes all characters\n// not listed as DoubleStringCharacters on\n// Also includes \"<\" to escape \"</script>\" and \"\\\" to avoid invalid escapes in the output.\n// http://www.ecma-international.org/ecma-262/5.1/#sec-7.8.4\nexport default function quote(str: string) {\n  let result = '';\n  let lastPos = 0;\n  for (let i = 0, len = str.length; i < len; i++) {\n    let replacement;\n    switch (str[i]) {\n      case '\"':\n        replacement = '\\\\\"';\n        break;\n      case '\\\\':\n        replacement = '\\\\\\\\';\n        break;\n      case '<':\n        replacement = '\\\\x3C';\n        break;\n      case '\\n':\n        replacement = '\\\\n';\n        break;\n      case '\\r':\n        replacement = '\\\\r';\n        break;\n      case '\\u2028':\n        replacement = '\\\\u2028';\n        break;\n      case '\\u2029':\n        replacement = '\\\\u2029';\n        break;\n      default:\n        continue;\n    }\n    result += str.slice(lastPos, i) + replacement;\n    lastPos = i + 1;\n  }\n  if (lastPos === 0) {\n    result = str;\n  } else {\n    result += str.slice(lastPos);\n  }\n  return `\"${result}\"`;\n}\n", "import quote from './quote';\nimport { PrimitiveValue } from './types';\n\nexport default function serializePrimitive(value: PrimitiveValue): string {\n  // Shortened forms\n  if (value === true) {\n    return '!0';\n  }\n  if (value === false) {\n    return '!1';\n  }\n  if (value === undefined) {\n    return 'void 0';\n  }\n  if (value === null) {\n    return 'null';\n  }\n  // negative 0 isn't the same as 0\n  if (Object.is(value, -0)) {\n    return '-0';\n  }\n  if (typeof value === 'bigint') {\n    return `BigInt(\"${value}\")`;\n  }\n  if (typeof value === 'string') {\n    return quote(value);\n  }\n  if (value.constructor === Date) {\n    return `new Date(\"${value.toISOString()}\")`;\n  }\n  return String(value);\n}\n", "/* eslint-disable no-await-in-loop */\nimport { join } from './array';\nimport {\n  SerializationContext,\n  insertRef,\n  constructorCheck,\n  getRefParam,\n  createRef,\n  assignRef,\n  createSetAdd,\n  EMPTY_SET,\n  createMapSet,\n  EMPTY_MAP,\n  createArrayAssign,\n  EMPTY_ARRAY,\n  createObjectIdentifierAssign,\n  createObjectComputedAssign,\n} from './context';\nimport isPrimitive from './is-primitive';\nimport isPromise from './is-promise';\nimport quote from './quote';\nimport serializePrimitive from './serialize-primitive';\nimport { ServerValue, AsyncServerValue } from './types';\n\nexport async function lookupRefsAsync(\n  ctx: SerializationContext,\n  current: AsyncServerValue,\n) {\n  if (isPrimitive(current)) {\n    return;\n  }\n  if (isPromise(current)) {\n    if (insertRef(ctx, current)) {\n      await current.then((value) => lookupRefsAsync(ctx, value));\n    }\n  } else if (Array.isArray(current)) {\n    if (insertRef(ctx, current)) {\n      for (const value of current) {\n        await lookupRefsAsync(ctx, value);\n      }\n    }\n  } else if (constructorCheck<Set<AsyncServerValue>>(current, Set)) {\n    if (insertRef(ctx, current)) {\n      for (const item of current.keys()) {\n        await lookupRefsAsync(ctx, item);\n      }\n    }\n  } else if (constructorCheck<Map<AsyncServerValue, AsyncServerValue>>(current, Map)) {\n    if (insertRef(ctx, current)) {\n      for (const [key, value] of current.entries()) {\n        await lookupRefsAsync(ctx, key);\n        await lookupRefsAsync(ctx, value);\n      }\n    }\n  } else if (\n    (current.constructor === Object || current.constructor == null)\n    && insertRef(ctx, current)\n  ) {\n    for (const value of Object.values(current)) {\n      await lookupRefsAsync(ctx, value);\n    }\n  }\n}\n\nexport async function traverseAsync(\n  ctx: SerializationContext,\n  current: AsyncServerValue,\n): Promise<string> {\n  // Skip primitives\n  if (isPrimitive(current)) {\n    return serializePrimitive(current);\n  }\n  // Get reference of the current object\n  let refResult = ctx.refs.get(current);\n  if (refResult != null) {\n    // Return the reference if already assigned a value\n    if (ctx.assignedRefs.has(refResult)) {\n      return getRefParam(ctx, refResult);\n    }\n    // Early sign (to prevent recursion)\n    ctx.assignedRefs.add(refResult);\n  }\n  function getCurrentRef() {\n    // This object received a ref, we must generate a setter ref\n    if (refResult == null) {\n      refResult = createRef(ctx, current);\n    }\n    return refResult;\n  }\n  function processRef(value: string) {\n    if (refResult != null) {\n      return assignRef(ctx, refResult, value);\n    }\n    return value;\n  }\n  if (isPromise(current)) {\n    return current.then(async (value) => {\n      ctx.stack.add(current);\n      let result: string;\n      if (ctx.stack.has(value)) {\n        const refParam = getRefParam(ctx, createRef(ctx, value));\n        result = `Promise.resolve().then(()=>${refParam})`;\n      } else {\n        result = `Promise.resolve(${await traverseAsync(ctx, value)})`;\n      }\n      ctx.stack.delete(current);\n      return processRef(result);\n    });\n  }\n  // Transform Set\n  if (constructorCheck<Set<AsyncServerValue>>(current, Set)) {\n    if (current.size) {\n      const values: string[] = [];\n\n      ctx.stack.add(current);\n      for (const value of current.keys()) {\n        if (ctx.stack.has(value)) {\n          // Received a ref, this might be a recursive ref, defer an assignment\n          createSetAdd(ctx, getCurrentRef(), getRefParam(ctx, createRef(ctx, value)));\n        } else {\n          values.push(await traverseAsync(ctx, value));\n        }\n      }\n      ctx.stack.delete(current);\n\n      return processRef(values.length ? `new Set([${join(values, ',')}])` : EMPTY_SET);\n    }\n    return EMPTY_SET;\n  }\n  if (constructorCheck<Map<ServerValue, ServerValue>>(current, Map)) {\n    if (current.size) {\n      const values: string[] = [];\n\n      ctx.stack.add(current);\n      for (const [key, value] of current.entries()) {\n        if (ctx.stack.has(key)) {\n          const ref = getCurrentRef();\n          const keyRef = getRefParam(ctx, createRef(ctx, key));\n          if (ctx.stack.has(value)) {\n            const valueRef = getRefParam(ctx, createRef(ctx, value));\n            createMapSet(ctx, ref, keyRef, valueRef);\n          } else {\n            const valueResult = await traverseAsync(ctx, value);\n            createMapSet(ctx, ref, keyRef, valueResult);\n          }\n        } else if (ctx.stack.has(value)) {\n          const valueRef = getRefParam(ctx, createRef(ctx, value));\n          const keyResult = await traverseAsync(ctx, key);\n          createMapSet(ctx, getCurrentRef(), keyResult, valueRef);\n        } else {\n          const keyResult = await traverseAsync(ctx, key);\n          const valueResult = await traverseAsync(ctx, value);\n          values.push(`[${keyResult},${valueResult}]`);\n        }\n      }\n      ctx.stack.delete(current);\n      return processRef(values.length ? `new Map([${join(values, ',')}])` : EMPTY_MAP);\n    }\n    return EMPTY_MAP;\n  }\n  if (Array.isArray(current)) {\n    if (current.length) {\n      let values = '';\n\n      ctx.stack.add(current);\n      for (let i = 0, len = current.length; i < len; i += 1) {\n        if (i in current) {\n          const item = current[i];\n          if (ctx.stack.has(item)) {\n            const refParam = getRefParam(ctx, createRef(ctx, item));\n            createArrayAssign(ctx, getCurrentRef(), i, refParam);\n            values += ',';\n          } else {\n            values += await traverseAsync(ctx, item);\n            if (i < current.length - 1) {\n              values += ',';\n            }\n          }\n        } else {\n          values += ',';\n        }\n      }\n      ctx.stack.delete(current);\n      return processRef(`[${values}]`);\n    }\n    return EMPTY_ARRAY;\n  }\n  const empty = current.constructor == null;\n  if (current.constructor === Object || empty) {\n    const values: string[] = [];\n\n    ctx.stack.add(current);\n    for (const [key, value] of Object.entries(current)) {\n      const check = Number(key);\n      // Test if key is a valid number or JS identifier\n      // so that we don't have to serialize the key and wrap with brackets\n      if (\n        check >= 0\n        || (Number.isNaN(check) && /^([$A-Z_][0-9A-Z_$]*)$/i.test(key))\n      ) {\n        if (ctx.stack.has(value)) {\n          const ref = getCurrentRef();\n          const refParam = getRefParam(ctx, createRef(ctx, value));\n          if (Number.isNaN(check)) {\n            createObjectIdentifierAssign(ctx, ref, key, refParam);\n          } else {\n            createObjectComputedAssign(ctx, ref, key, refParam);\n          }\n        } else {\n          const valueResult = await traverseAsync(ctx, value as AsyncServerValue);\n          values.push(`${key}:${valueResult}`);\n        }\n      } else if (ctx.stack.has(value)) {\n        const refParam = getRefParam(ctx, createRef(ctx, value));\n        createObjectComputedAssign(ctx, getCurrentRef(), quote(key), refParam);\n      } else {\n        const valueResult = await traverseAsync(ctx, value as AsyncServerValue);\n        values.push(`${quote(key)}:${valueResult}`);\n      }\n    }\n    ctx.stack.delete(current);\n    const value = `{${join(values, ',')}}`;\n    if (empty) {\n      return processRef(`Object.assign(Object.create(null),${value})`);\n    }\n    return processRef(value);\n  }\n  throw new Error('Unserializable value');\n}\n", "import { forEach, join } from './array';\nimport {\n  SerializationContext,\n  insertRef,\n  constructorCheck,\n  getRefParam,\n  createRef,\n  assignRef,\n  createSetAdd,\n  EMPTY_SET,\n  createMapSet,\n  EMPTY_MAP,\n  createArrayAssign,\n  EMPTY_ARRAY,\n  createObjectIdentifierAssign,\n  createObjectComputedAssign,\n} from './context';\nimport isPrimitive from './is-primitive';\nimport quote from './quote';\nimport serializePrimitive from './serialize-primitive';\nimport { AsyncServerValue, ServerValue } from './types';\n\nexport function lookupRefs(ctx: SerializationContext, current: ServerValue) {\n  if (isPrimitive(current)) {\n    return;\n  }\n  if (Array.isArray(current)) {\n    if (insertRef(ctx, current)) {\n      forEach(current, (value) => {\n        lookupRefs(ctx, value);\n      });\n    }\n  } else if (constructorCheck<Set<AsyncServerValue>>(current, Set)) {\n    if (insertRef(ctx, current)) {\n      for (const item of current.keys()) {\n        lookupRefs(ctx, item);\n      }\n    }\n  } else if (constructorCheck<Map<AsyncServerValue, AsyncServerValue>>(current, Map)) {\n    if (insertRef(ctx, current)) {\n      for (const [key, value] of current.entries()) {\n        lookupRefs(ctx, key);\n        lookupRefs(ctx, value);\n      }\n    }\n  } else if (\n    (current.constructor === Object || current.constructor == null)\n    && insertRef(ctx, current)\n  ) {\n    forEach(Object.values(current), (value) => {\n      lookupRefs(ctx, value);\n    });\n  }\n}\n\nexport function traverseSync(\n  ctx: SerializationContext,\n  current: ServerValue,\n): string {\n  // Skip primitives\n  if (isPrimitive(current)) {\n    return serializePrimitive(current);\n  }\n  // Get reference of the current object\n  let refResult = ctx.refs.get(current);\n  if (refResult != null) {\n    // Return the reference if already assigned a value\n    if (ctx.assignedRefs.has(refResult)) {\n      return getRefParam(ctx, refResult);\n    }\n    // Early sign (to prevent recursion)\n    ctx.assignedRefs.add(refResult);\n  }\n  function getCurrentRef() {\n    // This object received a ref, we must generate a setter ref\n    if (refResult == null) {\n      refResult = createRef(ctx, current);\n    }\n    return refResult;\n  }\n  function processRef(value: string) {\n    if (refResult != null) {\n      return assignRef(ctx, refResult, value);\n    }\n    return value;\n  }\n  // Transform Set\n  if (constructorCheck<Set<ServerValue>>(current, Set)) {\n    if (current.size) {\n      const values: string[] = [];\n\n      ctx.stack.add(current);\n      for (const value of current.keys()) {\n        if (ctx.stack.has(value)) {\n          // Received a ref, this might be a recursive ref, defer an assignment\n          createSetAdd(ctx, getCurrentRef(), getRefParam(ctx, createRef(ctx, value)));\n        } else {\n          values.push(traverseSync(ctx, value));\n        }\n      }\n      ctx.stack.delete(current);\n\n      return processRef(values.length ? `new Set([${join(values, ',')}])` : EMPTY_SET);\n    }\n    return EMPTY_SET;\n  }\n  if (constructorCheck<Map<ServerValue, ServerValue>>(current, Map)) {\n    if (current.size) {\n      const values: string[] = [];\n\n      ctx.stack.add(current);\n      for (const [key, value] of current.entries()) {\n        if (ctx.stack.has(key)) {\n          const ref = getCurrentRef();\n          const keyRef = getRefParam(ctx, createRef(ctx, key));\n          if (ctx.stack.has(value)) {\n            const valueRef = getRefParam(ctx, createRef(ctx, value));\n            createMapSet(ctx, ref, keyRef, valueRef);\n          } else {\n            createMapSet(ctx, ref, keyRef, traverseSync(ctx, value));\n          }\n        } else if (ctx.stack.has(value)) {\n          const valueRef = getRefParam(ctx, createRef(ctx, value));\n          createMapSet(ctx, getCurrentRef(), traverseSync(ctx, key), valueRef);\n        } else {\n          values.push(`[${traverseSync(ctx, key)},${traverseSync(ctx, value)}]`);\n        }\n      }\n      ctx.stack.delete(current);\n      return processRef(values.length ? `new Map([${join(values, ',')}])` : EMPTY_MAP);\n    }\n    return EMPTY_MAP;\n  }\n  if (Array.isArray(current)) {\n    if (current.length) {\n      let values = '';\n\n      ctx.stack.add(current);\n      forEach(current, (item, i) => {\n        if (i in current) {\n          if (ctx.stack.has(item)) {\n            const refParam = getRefParam(ctx, createRef(ctx, item));\n            createArrayAssign(ctx, getCurrentRef(), i, refParam);\n            values += ',';\n          } else {\n            values += traverseSync(ctx, item);\n            if (i < current.length - 1) {\n              values += ',';\n            }\n          }\n        } else {\n          values += ',';\n        }\n      });\n      ctx.stack.delete(current);\n      return processRef(`[${values}]`);\n    }\n    return EMPTY_ARRAY;\n  }\n  const empty = current.constructor == null;\n  if (current.constructor === Object || empty) {\n    const values: string[] = [];\n\n    ctx.stack.add(current);\n    forEach(Object.entries(current), ([key, value]) => {\n      const check = Number(key);\n      // Test if key is a valid number or JS identifier\n      // so that we don't have to serialize the key and wrap with brackets\n      if (\n        check >= 0\n        || (Number.isNaN(check) && /^([$A-Z_][0-9A-Z_$]*)$/i.test(key))\n      ) {\n        if (ctx.stack.has(value)) {\n          const ref = getCurrentRef();\n          const refParam = getRefParam(ctx, createRef(ctx, value));\n          if (!Number.isNaN(check)) {\n            createObjectComputedAssign(ctx, ref, key, refParam);\n          } else {\n            createObjectIdentifierAssign(ctx, ref, key, refParam);\n          }\n        } else {\n          values.push(`${key}:${traverseSync(ctx, value)}`);\n        }\n      } else if (ctx.stack.has(value)) {\n        const refParam = getRefParam(ctx, createRef(ctx, value));\n        createObjectComputedAssign(ctx, getCurrentRef(), quote(key), refParam);\n      } else {\n        values.push(`${quote(key)}:${traverseSync(ctx, value)}`);\n      }\n    });\n    ctx.stack.delete(current);\n    const value = `{${join(values, ',')}}`;\n    if (empty) {\n      return processRef(`Object.assign(Object.create(null),${value})`);\n    }\n    return processRef(value);\n  }\n  throw new Error('Unserializable value');\n}\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAO,SAAS,QAAW,KAAU,UAAyD;AAC5F,WAAS,IAAI,GAAG,MAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAC9C,QAAI,SAAS,IAAI,CAAC,GAAG,CAAC,GAAG;AACvB;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,KAAK,KAAe,QAAwB;AAC1D,MAAI,SAAS;AACb,UAAQ,KAAK,CAAC,OAAO,UAAU;AAC7B,cAAU;AACV,QAAI,QAAQ,IAAI,SAAS,GAAG;AAC1B,gBAAU;AAAA,IACZ;AAAA,EACF,CAAC;AACD,SAAO;AACT;;;AChBA,IAAM,kBAAkB;AACxB,IAAM,sBAAsB,gBAAgB;AAC5C,IAAM,YAAY;AAClB,IAAM,gBAAgB,UAAU;AAEjB,SAAR,cAA+B,OAAe;AACnD,MAAI,MAAM,QAAQ;AAClB,MAAI,MAAM,gBAAgB,GAAG;AAC7B,WAAS,QAAQ,OAAO;AACxB,SAAO,QAAQ,GAAG;AAChB,UAAM,QAAQ;AACd,WAAO,UAAU,GAAG;AACpB,aAAS,QAAQ,OAAO;AAAA,EAC1B;AACA,SAAO;AACT;;;ACZO,IAAM,YAAY;AAClB,IAAM,YAAY;AAClB,IAAM,cAAc;AA6BpB,SAAS,6BAAmD;AACjE,SAAO;AAAA,IACL,UAAU,oBAAI,IAAI;AAAA,IAClB,OAAO,oBAAI,IAAI;AAAA,IACf,MAAM,oBAAI,IAAI;AAAA,IACd,cAAc,oBAAI,IAAI;AAAA,IACtB,MAAM,CAAC;AAAA,IACP,aAAa,CAAC;AAAA,IACd,SAAS,CAAC;AAAA,IACV,SAAS,CAAC;AAAA,EACZ;AACF;AAEO,SAAS,mBAAmB,KAA2B;AAC5D,MAAI,IAAI,YAAY,QAAQ;AAC1B,UAAM,SAAiC,CAAC;AAGxC,YAAQ,IAAI,aAAa,CAAC,CAAC,QAAQ,KAAK,MAAM;AAC5C,UAAI,SAAS,QAAQ;AACnB,eAAO,KAAK,IAAI,GAAG,UAAU,OAAO,KAAK;AAAA,MAC3C,OAAO;AACL,eAAO,KAAK,IAAI,GAAG,UAAU;AAAA,MAC/B;AAAA,IACF,CAAC;AAED,WAAO,GAAG,KAAK,OAAO,OAAO,MAAM,GAAG,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAEO,SAAS,eAAe,KAA2B;AACxD,MAAI,IAAI,QAAQ,QAAQ;AACtB,UAAM,SAAiC,CAAC;AAGxC,YAAQ,IAAI,SAAS,CAAC,CAAC,QAAQ,KAAK,KAAK,MAAM;AAC7C,UAAI,UAAU,QAAQ;AACpB,eAAO,MAAM,IAAI,GAAG,OAAO,MAAM,SAAS,OAAO;AAAA,MACnD,OAAO;AACL,eAAO,MAAM,IAAI,GAAG,cAAc,OAAO;AAAA,MAC3C;AAAA,IACF,CAAC;AAED,WAAO,GAAG,KAAK,OAAO,OAAO,MAAM,GAAG,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAEO,SAAS,eAAe,KAA2B;AACxD,MAAI,IAAI,QAAQ,QAAQ;AACtB,UAAM,SAAiC,CAAC;AAGxC,YAAQ,IAAI,SAAS,CAAC,CAAC,QAAQ,KAAK,MAAM;AACxC,UAAI,UAAU,QAAQ;AACpB,eAAO,MAAM,IAAI,GAAG,OAAO,MAAM,SAAS;AAAA,MAC5C,OAAO;AACL,eAAO,MAAM,IAAI,GAAG,cAAc;AAAA,MACpC;AAAA,IACF,CAAC;AAED,WAAO,GAAG,KAAK,OAAO,OAAO,MAAM,GAAG,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAEO,SAAS,eAAe,KAA2B;AACxD,SAAO,GAAG,mBAAmB,GAAG,IAAI,eAAe,GAAG,IAAI,eAAe,GAAG;AAC9E;AAEO,SAAS,UAAU,KAA2B,SAAkB;AACrE,QAAM,QAAQ,IAAI,SAAS,IAAI,OAAO,KAAK;AAC3C,MAAI,SAAS,IAAI,SAAS,QAAQ,CAAC;AACnC,SAAO,UAAU;AACnB;AAEO,SAAS,iBACd,OACA,aACY;AACZ,SAAO,MAAM,gBAAgB;AAC/B;AAEO,SAAS,UACd,KACA,OACA;AACA,QAAM,UAAU,IAAI,KAAK,IAAI,KAAK;AAClC,MAAI,WAAW,MAAM;AACnB,WAAO;AAAA,EACT;AACA,QAAM,KAAK,IAAI,KAAK;AACpB,MAAI,KAAK,IAAI,OAAO,EAAE;AACtB,SAAO;AACT;AAEO,SAAS,YAAY,KAA2B,OAAe;AACpE,MAAI,IAAI,KAAK,KAAK,GAAG;AACnB,WAAO,IAAI,KAAK,KAAK;AAAA,EACvB;AACA,QAAM,SAAS,cAAc,KAAK;AAClC,MAAI,KAAK,KAAK,IAAI;AAClB,SAAO;AACT;AAEO,SAAS,UACd,KACA,OACA,OACA;AACA,SAAO,GAAG,YAAY,KAAK,KAAK,KAAK;AACvC;AAEO,SAAS,iBACd,KACA,QACA,OACA;AACA,MAAI,YAAY,KAAK,CAAC,QAAQ,KAAK,CAAC;AACtC;AAEO,SAAS,aACd,KACA,KACA,OACA;AACA,MAAI,QAAQ,KAAK,CAAC,YAAY,KAAK,GAAG,GAAG,KAAK,CAAC;AACjD;AAEO,SAAS,aACd,KACA,KACA,KACA,OACA;AACA,MAAI,QAAQ,KAAK,CAAC,YAAY,KAAK,GAAG,GAAG,KAAK,KAAK,CAAC;AACtD;AAEO,SAAS,kBACd,KACA,KACA,OACA,OACA;AACA,mBAAiB,KAAK,GAAG,YAAY,KAAK,GAAG,KAAK,UAAU,KAAK;AACnE;AAEO,SAAS,6BACd,KACA,KACA,KACA,OACA;AACA,mBAAiB,KAAK,GAAG,YAAY,KAAK,GAAG,KAAK,OAAO,KAAK;AAChE;AAEO,SAAS,2BACd,KACA,KACA,KACA,OACA;AACA,mBAAiB,KAAK,GAAG,YAAY,KAAK,GAAG,KAAK,QAAQ,KAAK;AACjE;;;ACrMe,SAAR,YAA6B,SAA6C;AAC/E,MAAI,CAAC,WAAW,YAAY,MAAM;AAChC,WAAO;AAAA,EACT;AACA,QAAM,OAAO,OAAO;AACpB,QAAM,aAAa,QAAQ;AAC3B,SAAO,SAAS,YACX,SAAS,YACT,SAAS,YACT,eAAe,QACf,eAAe;AACtB;;;ACbe,SAAR,UAA8B,KAAqC;AACxE,SAAO,CAAC,CAAC,QACH,OAAO,QAAQ,YAAY,OAAO,QAAQ,eAC3C,UAAU,OACV,OAAO,IAAI,SAAS;AAC3B;;;ACAe,SAAR,MAAuB,KAAa;AACzC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,MAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAC9C,QAAI;AACJ,YAAQ,IAAI,CAAC,GAAG;AAAA,MACd,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF;AACE;AAAA,IACJ;AACA,cAAU,IAAI,MAAM,SAAS,CAAC,IAAI;AAClC,cAAU,IAAI;AAAA,EAChB;AACA,MAAI,YAAY,GAAG;AACjB,aAAS;AAAA,EACX,OAAO;AACL,cAAU,IAAI,MAAM,OAAO;AAAA,EAC7B;AACA,SAAO,IAAI;AACb;;;ACzCe,SAAR,mBAAoC,OAA+B;AAExE,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,OAAO;AACnB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,QAAW;AACvB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,GAAG,OAAO,EAAE,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,WAAW;AAAA,EACpB;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,MAAM,KAAK;AAAA,EACpB;AACA,MAAI,MAAM,gBAAgB,MAAM;AAC9B,WAAO,aAAa,MAAM,YAAY;AAAA,EACxC;AACA,SAAO,OAAO,KAAK;AACrB;;;ACPA,eAAsB,gBACpB,KACA,SACA;AACA,MAAI,YAAY,OAAO,GAAG;AACxB;AAAA,EACF;AACA,MAAI,UAAU,OAAO,GAAG;AACtB,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,YAAM,QAAQ,KAAK,CAAC,UAAU,gBAAgB,KAAK,KAAK,CAAC;AAAA,IAC3D;AAAA,EACF,WAAW,MAAM,QAAQ,OAAO,GAAG;AACjC,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,iBAAW,SAAS,SAAS;AAC3B,cAAM,gBAAgB,KAAK,KAAK;AAAA,MAClC;AAAA,IACF;AAAA,EACF,WAAW,iBAAwC,SAAS,GAAG,GAAG;AAChE,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,iBAAW,QAAQ,QAAQ,KAAK,GAAG;AACjC,cAAM,gBAAgB,KAAK,IAAI;AAAA,MACjC;AAAA,IACF;AAAA,EACF,WAAW,iBAA0D,SAAS,GAAG,GAAG;AAClF,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,iBAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC5C,cAAM,gBAAgB,KAAK,GAAG;AAC9B,cAAM,gBAAgB,KAAK,KAAK;AAAA,MAClC;AAAA,IACF;AAAA,EACF,YACG,QAAQ,gBAAgB,UAAU,QAAQ,eAAe,SACvD,UAAU,KAAK,OAAO,GACzB;AACA,eAAW,SAAS,OAAO,OAAO,OAAO,GAAG;AAC1C,YAAM,gBAAgB,KAAK,KAAK;AAAA,IAClC;AAAA,EACF;AACF;AAEA,eAAsB,cACpB,KACA,SACiB;AAEjB,MAAI,YAAY,OAAO,GAAG;AACxB,WAAO,mBAAmB,OAAO;AAAA,EACnC;AAEA,MAAI,YAAY,IAAI,KAAK,IAAI,OAAO;AACpC,MAAI,aAAa,MAAM;AAErB,QAAI,IAAI,aAAa,IAAI,SAAS,GAAG;AACnC,aAAO,YAAY,KAAK,SAAS;AAAA,IACnC;AAEA,QAAI,aAAa,IAAI,SAAS;AAAA,EAChC;AACA,WAAS,gBAAgB;AAEvB,QAAI,aAAa,MAAM;AACrB,kBAAY,UAAU,KAAK,OAAO;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AACA,WAAS,WAAW,OAAe;AACjC,QAAI,aAAa,MAAM;AACrB,aAAO,UAAU,KAAK,WAAW,KAAK;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AACA,MAAI,UAAU,OAAO,GAAG;AACtB,WAAO,QAAQ,KAAK,OAAO,UAAU;AACnC,UAAI,MAAM,IAAI,OAAO;AACrB,UAAI;AACJ,UAAI,IAAI,MAAM,IAAI,KAAK,GAAG;AACxB,cAAM,WAAW,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC;AACvD,iBAAS,8BAA8B;AAAA,MACzC,OAAO;AACL,iBAAS,mBAAmB,MAAM,cAAc,KAAK,KAAK;AAAA,MAC5D;AACA,UAAI,MAAM,OAAO,OAAO;AACxB,aAAO,WAAW,MAAM;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,iBAAwC,SAAS,GAAG,GAAG;AACzD,QAAI,QAAQ,MAAM;AAChB,YAAM,SAAmB,CAAC;AAE1B,UAAI,MAAM,IAAI,OAAO;AACrB,iBAAW,SAAS,QAAQ,KAAK,GAAG;AAClC,YAAI,IAAI,MAAM,IAAI,KAAK,GAAG;AAExB,uBAAa,KAAK,cAAc,GAAG,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC,CAAC;AAAA,QAC5E,OAAO;AACL,iBAAO,KAAK,MAAM,cAAc,KAAK,KAAK,CAAC;AAAA,QAC7C;AAAA,MACF;AACA,UAAI,MAAM,OAAO,OAAO;AAExB,aAAO,WAAW,OAAO,SAAS,YAAY,KAAK,QAAQ,GAAG,QAAQ,SAAS;AAAA,IACjF;AACA,WAAO;AAAA,EACT;AACA,MAAI,iBAAgD,SAAS,GAAG,GAAG;AACjE,QAAI,QAAQ,MAAM;AAChB,YAAM,SAAmB,CAAC;AAE1B,UAAI,MAAM,IAAI,OAAO;AACrB,iBAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC5C,YAAI,IAAI,MAAM,IAAI,GAAG,GAAG;AACtB,gBAAM,MAAM,cAAc;AAC1B,gBAAM,SAAS,YAAY,KAAK,UAAU,KAAK,GAAG,CAAC;AACnD,cAAI,IAAI,MAAM,IAAI,KAAK,GAAG;AACxB,kBAAM,WAAW,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC;AACvD,yBAAa,KAAK,KAAK,QAAQ,QAAQ;AAAA,UACzC,OAAO;AACL,kBAAM,cAAc,MAAM,cAAc,KAAK,KAAK;AAClD,yBAAa,KAAK,KAAK,QAAQ,WAAW;AAAA,UAC5C;AAAA,QACF,WAAW,IAAI,MAAM,IAAI,KAAK,GAAG;AAC/B,gBAAM,WAAW,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC;AACvD,gBAAM,YAAY,MAAM,cAAc,KAAK,GAAG;AAC9C,uBAAa,KAAK,cAAc,GAAG,WAAW,QAAQ;AAAA,QACxD,OAAO;AACL,gBAAM,YAAY,MAAM,cAAc,KAAK,GAAG;AAC9C,gBAAM,cAAc,MAAM,cAAc,KAAK,KAAK;AAClD,iBAAO,KAAK,IAAI,aAAa,cAAc;AAAA,QAC7C;AAAA,MACF;AACA,UAAI,MAAM,OAAO,OAAO;AACxB,aAAO,WAAW,OAAO,SAAS,YAAY,KAAK,QAAQ,GAAG,QAAQ,SAAS;AAAA,IACjF;AACA,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,QAAI,QAAQ,QAAQ;AAClB,UAAI,SAAS;AAEb,UAAI,MAAM,IAAI,OAAO;AACrB,eAAS,IAAI,GAAG,MAAM,QAAQ,QAAQ,IAAI,KAAK,KAAK,GAAG;AACrD,YAAI,KAAK,SAAS;AAChB,gBAAM,OAAO,QAAQ,CAAC;AACtB,cAAI,IAAI,MAAM,IAAI,IAAI,GAAG;AACvB,kBAAM,WAAW,YAAY,KAAK,UAAU,KAAK,IAAI,CAAC;AACtD,8BAAkB,KAAK,cAAc,GAAG,GAAG,QAAQ;AACnD,sBAAU;AAAA,UACZ,OAAO;AACL,sBAAU,MAAM,cAAc,KAAK,IAAI;AACvC,gBAAI,IAAI,QAAQ,SAAS,GAAG;AAC1B,wBAAU;AAAA,YACZ;AAAA,UACF;AAAA,QACF,OAAO;AACL,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,MAAM,OAAO,OAAO;AACxB,aAAO,WAAW,IAAI,SAAS;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,QAAQ,eAAe;AACrC,MAAI,QAAQ,gBAAgB,UAAU,OAAO;AAC3C,UAAM,SAAmB,CAAC;AAE1B,QAAI,MAAM,IAAI,OAAO;AACrB,eAAW,CAAC,KAAKA,MAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AAClD,YAAM,QAAQ,OAAO,GAAG;AAGxB,UACE,SAAS,KACL,OAAO,MAAM,KAAK,KAAK,0BAA0B,KAAK,GAAG,GAC7D;AACA,YAAI,IAAI,MAAM,IAAIA,MAAK,GAAG;AACxB,gBAAM,MAAM,cAAc;AAC1B,gBAAM,WAAW,YAAY,KAAK,UAAU,KAAKA,MAAK,CAAC;AACvD,cAAI,OAAO,MAAM,KAAK,GAAG;AACvB,yCAA6B,KAAK,KAAK,KAAK,QAAQ;AAAA,UACtD,OAAO;AACL,uCAA2B,KAAK,KAAK,KAAK,QAAQ;AAAA,UACpD;AAAA,QACF,OAAO;AACL,gBAAM,cAAc,MAAM,cAAc,KAAKA,MAAyB;AACtE,iBAAO,KAAK,GAAG,OAAO,aAAa;AAAA,QACrC;AAAA,MACF,WAAW,IAAI,MAAM,IAAIA,MAAK,GAAG;AAC/B,cAAM,WAAW,YAAY,KAAK,UAAU,KAAKA,MAAK,CAAC;AACvD,mCAA2B,KAAK,cAAc,GAAG,MAAM,GAAG,GAAG,QAAQ;AAAA,MACvE,OAAO;AACL,cAAM,cAAc,MAAM,cAAc,KAAKA,MAAyB;AACtE,eAAO,KAAK,GAAG,MAAM,GAAG,KAAK,aAAa;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,MAAM,OAAO,OAAO;AACxB,UAAM,QAAQ,IAAI,KAAK,QAAQ,GAAG;AAClC,QAAI,OAAO;AACT,aAAO,WAAW,qCAAqC,QAAQ;AAAA,IACjE;AACA,WAAO,WAAW,KAAK;AAAA,EACzB;AACA,QAAM,IAAI,MAAM,sBAAsB;AACxC;;;AC9MO,SAAS,WAAW,KAA2B,SAAsB;AAC1E,MAAI,YAAY,OAAO,GAAG;AACxB;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,cAAQ,SAAS,CAAC,UAAU;AAC1B,mBAAW,KAAK,KAAK;AAAA,MACvB,CAAC;AAAA,IACH;AAAA,EACF,WAAW,iBAAwC,SAAS,GAAG,GAAG;AAChE,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,iBAAW,QAAQ,QAAQ,KAAK,GAAG;AACjC,mBAAW,KAAK,IAAI;AAAA,MACtB;AAAA,IACF;AAAA,EACF,WAAW,iBAA0D,SAAS,GAAG,GAAG;AAClF,QAAI,UAAU,KAAK,OAAO,GAAG;AAC3B,iBAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC5C,mBAAW,KAAK,GAAG;AACnB,mBAAW,KAAK,KAAK;AAAA,MACvB;AAAA,IACF;AAAA,EACF,YACG,QAAQ,gBAAgB,UAAU,QAAQ,eAAe,SACvD,UAAU,KAAK,OAAO,GACzB;AACA,YAAQ,OAAO,OAAO,OAAO,GAAG,CAAC,UAAU;AACzC,iBAAW,KAAK,KAAK;AAAA,IACvB,CAAC;AAAA,EACH;AACF;AAEO,SAAS,aACd,KACA,SACQ;AAER,MAAI,YAAY,OAAO,GAAG;AACxB,WAAO,mBAAmB,OAAO;AAAA,EACnC;AAEA,MAAI,YAAY,IAAI,KAAK,IAAI,OAAO;AACpC,MAAI,aAAa,MAAM;AAErB,QAAI,IAAI,aAAa,IAAI,SAAS,GAAG;AACnC,aAAO,YAAY,KAAK,SAAS;AAAA,IACnC;AAEA,QAAI,aAAa,IAAI,SAAS;AAAA,EAChC;AACA,WAAS,gBAAgB;AAEvB,QAAI,aAAa,MAAM;AACrB,kBAAY,UAAU,KAAK,OAAO;AAAA,IACpC;AACA,WAAO;AAAA,EACT;AACA,WAAS,WAAW,OAAe;AACjC,QAAI,aAAa,MAAM;AACrB,aAAO,UAAU,KAAK,WAAW,KAAK;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAEA,MAAI,iBAAmC,SAAS,GAAG,GAAG;AACpD,QAAI,QAAQ,MAAM;AAChB,YAAM,SAAmB,CAAC;AAE1B,UAAI,MAAM,IAAI,OAAO;AACrB,iBAAW,SAAS,QAAQ,KAAK,GAAG;AAClC,YAAI,IAAI,MAAM,IAAI,KAAK,GAAG;AAExB,uBAAa,KAAK,cAAc,GAAG,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC,CAAC;AAAA,QAC5E,OAAO;AACL,iBAAO,KAAK,aAAa,KAAK,KAAK,CAAC;AAAA,QACtC;AAAA,MACF;AACA,UAAI,MAAM,OAAO,OAAO;AAExB,aAAO,WAAW,OAAO,SAAS,YAAY,KAAK,QAAQ,GAAG,QAAQ,SAAS;AAAA,IACjF;AACA,WAAO;AAAA,EACT;AACA,MAAI,iBAAgD,SAAS,GAAG,GAAG;AACjE,QAAI,QAAQ,MAAM;AAChB,YAAM,SAAmB,CAAC;AAE1B,UAAI,MAAM,IAAI,OAAO;AACrB,iBAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC5C,YAAI,IAAI,MAAM,IAAI,GAAG,GAAG;AACtB,gBAAM,MAAM,cAAc;AAC1B,gBAAM,SAAS,YAAY,KAAK,UAAU,KAAK,GAAG,CAAC;AACnD,cAAI,IAAI,MAAM,IAAI,KAAK,GAAG;AACxB,kBAAM,WAAW,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC;AACvD,yBAAa,KAAK,KAAK,QAAQ,QAAQ;AAAA,UACzC,OAAO;AACL,yBAAa,KAAK,KAAK,QAAQ,aAAa,KAAK,KAAK,CAAC;AAAA,UACzD;AAAA,QACF,WAAW,IAAI,MAAM,IAAI,KAAK,GAAG;AAC/B,gBAAM,WAAW,YAAY,KAAK,UAAU,KAAK,KAAK,CAAC;AACvD,uBAAa,KAAK,cAAc,GAAG,aAAa,KAAK,GAAG,GAAG,QAAQ;AAAA,QACrE,OAAO;AACL,iBAAO,KAAK,IAAI,aAAa,KAAK,GAAG,KAAK,aAAa,KAAK,KAAK,IAAI;AAAA,QACvE;AAAA,MACF;AACA,UAAI,MAAM,OAAO,OAAO;AACxB,aAAO,WAAW,OAAO,SAAS,YAAY,KAAK,QAAQ,GAAG,QAAQ,SAAS;AAAA,IACjF;AACA,WAAO;AAAA,EACT;AACA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,QAAI,QAAQ,QAAQ;AAClB,UAAI,SAAS;AAEb,UAAI,MAAM,IAAI,OAAO;AACrB,cAAQ,SAAS,CAAC,MAAM,MAAM;AAC5B,YAAI,KAAK,SAAS;AAChB,cAAI,IAAI,MAAM,IAAI,IAAI,GAAG;AACvB,kBAAM,WAAW,YAAY,KAAK,UAAU,KAAK,IAAI,CAAC;AACtD,8BAAkB,KAAK,cAAc,GAAG,GAAG,QAAQ;AACnD,sBAAU;AAAA,UACZ,OAAO;AACL,sBAAU,aAAa,KAAK,IAAI;AAChC,gBAAI,IAAI,QAAQ,SAAS,GAAG;AAC1B,wBAAU;AAAA,YACZ;AAAA,UACF;AAAA,QACF,OAAO;AACL,oBAAU;AAAA,QACZ;AAAA,MACF,CAAC;AACD,UAAI,MAAM,OAAO,OAAO;AACxB,aAAO,WAAW,IAAI,SAAS;AAAA,IACjC;AACA,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,QAAQ,eAAe;AACrC,MAAI,QAAQ,gBAAgB,UAAU,OAAO;AAC3C,UAAM,SAAmB,CAAC;AAE1B,QAAI,MAAM,IAAI,OAAO;AACrB,YAAQ,OAAO,QAAQ,OAAO,GAAG,CAAC,CAAC,KAAKC,MAAK,MAAM;AACjD,YAAM,QAAQ,OAAO,GAAG;AAGxB,UACE,SAAS,KACL,OAAO,MAAM,KAAK,KAAK,0BAA0B,KAAK,GAAG,GAC7D;AACA,YAAI,IAAI,MAAM,IAAIA,MAAK,GAAG;AACxB,gBAAM,MAAM,cAAc;AAC1B,gBAAM,WAAW,YAAY,KAAK,UAAU,KAAKA,MAAK,CAAC;AACvD,cAAI,CAAC,OAAO,MAAM,KAAK,GAAG;AACxB,uCAA2B,KAAK,KAAK,KAAK,QAAQ;AAAA,UACpD,OAAO;AACL,yCAA6B,KAAK,KAAK,KAAK,QAAQ;AAAA,UACtD;AAAA,QACF,OAAO;AACL,iBAAO,KAAK,GAAG,OAAO,aAAa,KAAKA,MAAK,GAAG;AAAA,QAClD;AAAA,MACF,WAAW,IAAI,MAAM,IAAIA,MAAK,GAAG;AAC/B,cAAM,WAAW,YAAY,KAAK,UAAU,KAAKA,MAAK,CAAC;AACvD,mCAA2B,KAAK,cAAc,GAAG,MAAM,GAAG,GAAG,QAAQ;AAAA,MACvE,OAAO;AACL,eAAO,KAAK,GAAG,MAAM,GAAG,KAAK,aAAa,KAAKA,MAAK,GAAG;AAAA,MACzD;AAAA,IACF,CAAC;AACD,QAAI,MAAM,OAAO,OAAO;AACxB,UAAM,QAAQ,IAAI,KAAK,QAAQ,GAAG;AAClC,QAAI,OAAO;AACT,aAAO,WAAW,qCAAqC,QAAQ;AAAA,IACjE;AACA,WAAO,WAAW,KAAK;AAAA,EACzB;AACA,QAAM,IAAI,MAAM,sBAAsB;AACxC;;;AThLA,SAAS,SACP,KACA,QACA,QACA;AAEA,MAAI,IAAI,KAAK,QAAQ;AAEnB,UAAM,QAAQ,YAAY,KAAK,UAAU,KAAK,MAAM,CAAC;AACrD,UAAM,UAAU,eAAe,GAAG;AAClC,UAAM,SAAS,IAAI,KAAK,SAAS,IAC7B,IAAI,KAAK,IAAI,MAAM,GAAG,OACtB,IAAI,KAAK,CAAC;AAEd,QAAI,OAAO,WAAW,GAAG,QAAQ,GAAG;AAClC,aAAO,IAAI,YAAY,UAAU,UAAU;AAAA,IAC7C;AACA,WAAO,IAAI,YAAY,SAAS,UAAU,UAAU;AAAA,EACtD;AACA,MAAI,OAAO,gBAAgB,QAAQ;AACjC,WAAO,IAAI;AAAA,EACb;AACA,SAAO;AACT;AAEO,SAAS,UAAU,QAAqB;AAC7C,MAAI,YAAY,MAAM,GAAG;AACvB,WAAO,mBAAmB,MAAM;AAAA,EAClC;AACA,QAAM,MAAM,2BAA2B;AAEvC,aAAW,KAAK,MAAM;AAEtB,aAAW,CAAC,KAAK,KAAK,KAAK,IAAI,SAAS,QAAQ,GAAG;AACjD,QAAI,QAAQ,GAAG;AACb,gBAAU,KAAK,GAAG;AAAA,IACpB;AAAA,EACF;AAEA,QAAM,SAAS,aAAa,KAAK,MAAM;AACvC,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,IAAI,MAAM,mBAAmB;AAAA,EACrC;AACA,SAAO,SAAS,KAAK,QAAQ,MAAM;AACrC;AAEA,eAAsB,eAAe,QAA0B;AAC7D,MAAI,YAAY,MAAM,GAAG;AACvB,WAAO,mBAAmB,MAAM;AAAA,EAClC;AACA,QAAM,MAAM,2BAA2B;AAEvC,QAAM,gBAAgB,KAAK,MAAM;AAEjC,aAAW,CAAC,KAAK,KAAK,KAAK,IAAI,SAAS,QAAQ,GAAG;AACjD,QAAI,QAAQ,GAAG;AACb,gBAAU,KAAK,GAAG;AAAA,IACpB;AAAA,EACF;AAEA,QAAM,SAAS,MAAM,cAAc,KAAK,MAAM;AAC9C,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,IAAI,MAAM,mBAAmB;AAAA,EACrC;AACA,SAAO,SAAS,KAAK,QAAQ,MAAM;AACrC;AAEO,SAAS,YAAwC,QAAmB;AAEzE,UAAQ,GAAG,MAAM,MAAM;AACzB;AAEA,IAAO,cAAQ;",
-  "names": ["value", "value"]
+  "sources": ["../../../src/index.ts", "../../../src/checks.ts", "../../../src/quote.ts", "../../../src/serialize-primitive.ts", "../../../src/get-identifier.ts", "../../../src/tree.ts"],
+  "sourcesContent": ["/* eslint-disable no-await-in-loop */\nimport { isPrimitive } from './checks';\nimport serializePrimitive from './serialize-primitive';\nimport {\n  createRef,\n  createSerializationContext,\n  generateTreeAsync,\n  generateTreeSync,\n  getRefParam,\n  resolvePatches,\n  SerializationContext,\n  serializeTree,\n} from './tree';\nimport {\n  AsyncServerValue,\n  NonPrimitiveServerValue,\n  PrimitiveValue,\n  ServerValue,\n  CommonServerValue,\n  SemiPrimitiveValue,\n  ErrorValue,\n} from './types';\n\nexport {\n  AsyncServerValue,\n  ServerValue,\n  PrimitiveValue,\n  CommonServerValue,\n  SemiPrimitiveValue,\n  ErrorValue,\n};\n\nfunction finalize<T extends ServerValue | AsyncServerValue>(\n  ctx: SerializationContext,\n  source: NonPrimitiveServerValue<T>,\n  result: string,\n) {\n  // Shared references detected\n  if (ctx.vars.length) {\n    // Get (or create) a ref from the source\n    const index = getRefParam(ctx, createRef(ctx, source));\n    const patches = resolvePatches(ctx);\n    const params = ctx.vars.length > 1\n      ? `(${ctx.vars.join(',')})`\n      : ctx.vars[0];\n    // Source is probably already assigned\n    if (result.startsWith(`${index}=`)) {\n      return `(${params}=>(${result},${patches}${index}))()`;\n    }\n    return `(${params}=>(${index}=${result},${patches}${index}))()`;\n  }\n  if (source.constructor === Object) {\n    return `(${result})`;\n  }\n  return result;\n}\n\nexport function serialize(source: ServerValue) {\n  if (isPrimitive(source)) {\n    return serializePrimitive(source);\n  }\n  const ctx = createSerializationContext();\n  const tree = generateTreeSync(ctx, source);\n  const result = serializeTree(ctx, tree);\n  return finalize(ctx, source, result);\n}\n\nexport async function serializeAsync(source: AsyncServerValue) {\n  if (isPrimitive(source)) {\n    return serializePrimitive(source);\n  }\n  const ctx = createSerializationContext();\n  const tree = await generateTreeAsync(ctx, source);\n  const result = serializeTree(ctx, tree);\n  return finalize(ctx, source, result);\n}\n\nexport function deserialize<T extends AsyncServerValue>(source: string): T {\n  // eslint-disable-next-line no-eval\n  return (0, eval)(source) as T;\n}\n\nexport default serialize;\n", "import { AsyncServerValue, PrimitiveValue } from './types';\n\nexport function isPrimitive(current: unknown): current is PrimitiveValue {\n  if (!current || current === true) {\n    return true;\n  }\n  const type = typeof current;\n  return type === 'number'\n    || type === 'string'\n    || type === 'bigint';\n}\n\nexport function isPromise<T>(obj: unknown): obj is PromiseLike<T> {\n  return !!obj\n    && (typeof obj === 'object' || typeof obj === 'function')\n    && 'then' in obj\n    && typeof obj.then === 'function';\n}\n\nexport function constructorCheck<T extends NonNullable<AsyncServerValue>>(\n  value: unknown,\n  constructor: unknown,\n): value is T {\n  return (value as { constructor: unknown }).constructor === constructor;\n}\n\nfunction isIterableBuiltin(obj: unknown) {\n  return (\n    Array.isArray(obj)\n    || constructorCheck<Set<any>>(obj, Set)\n    || constructorCheck<Map<any, any>>(obj, Map)\n  );\n}\n\nexport function isIterable<T>(obj: unknown): obj is Iterable<T> {\n  return !!obj\n    && typeof obj === 'object'\n    && !isIterableBuiltin(obj)\n    && Symbol.iterator in obj\n    && typeof obj[Symbol.iterator] === 'function';\n}\n", "// Written by https://github.com/DylanPiercey and is distributed under the MIT license.\n// Creates a JavaScript double quoted string and escapes all characters\n// not listed as DoubleStringCharacters on\n// Also includes \"<\" to escape \"</script>\" and \"\\\" to avoid invalid escapes in the output.\n// http://www.ecma-international.org/ecma-262/5.1/#sec-7.8.4\nexport default function quote(str: string) {\n  let result = '';\n  let lastPos = 0;\n  for (let i = 0, len = str.length; i < len; i++) {\n    let replacement;\n    switch (str[i]) {\n      case '\"':\n        replacement = '\\\\\"';\n        break;\n      case '\\\\':\n        replacement = '\\\\\\\\';\n        break;\n      case '<':\n        replacement = '\\\\x3C';\n        break;\n      case '\\n':\n        replacement = '\\\\n';\n        break;\n      case '\\r':\n        replacement = '\\\\r';\n        break;\n      case '\\u2028':\n        replacement = '\\\\u2028';\n        break;\n      case '\\u2029':\n        replacement = '\\\\u2029';\n        break;\n      default:\n        continue;\n    }\n    result += str.slice(lastPos, i) + replacement;\n    lastPos = i + 1;\n  }\n  if (lastPos === 0) {\n    result = str;\n  } else {\n    result += str.slice(lastPos);\n  }\n  return `\"${result}\"`;\n}\n", "import quote from './quote';\nimport { PrimitiveValue } from './types';\n\nexport default function serializePrimitive(value: PrimitiveValue): string {\n  // Shortened forms\n  if (value === true) {\n    return '!0';\n  }\n  if (value === false) {\n    return '!1';\n  }\n  if (value === undefined) {\n    return 'void 0';\n  }\n  if (value === null) {\n    return 'null';\n  }\n  if (typeof value === 'bigint') {\n    return `${value}n`;\n  }\n  if (typeof value === 'string') {\n    return quote(value);\n  }\n  // negative 0 isn't the same as 0\n  if (Object.is(value, -0)) {\n    return '-0';\n  }\n  if (Object.is(value, Infinity)) {\n    return '1/0';\n  }\n  if (Object.is(value, -Infinity)) {\n    return '-1/0';\n  }\n  return String(value);\n}\n", "// Written by https://github.com/DylanPiercey and is distributed under the MIT license.\nconst REF_START_CHARS = 'hjkmoquxzABCDEFGHIJKLNPQRTUVWXYZ$_'; // Avoids chars that could evaluate to a reserved word.\nconst REF_START_CHARS_LEN = REF_START_CHARS.length;\nconst REF_CHARS = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789$_';\nconst REF_CHARS_LEN = REF_CHARS.length;\n\nexport default function getIdentifier(index: number) {\n  let mod = index % REF_START_CHARS_LEN;\n  let ref = REF_START_CHARS[mod];\n  index = (index - mod) / REF_START_CHARS_LEN;\n  while (index > 0) {\n    mod = index % REF_CHARS_LEN;\n    ref += REF_CHARS[mod];\n    index = (index - mod) / REF_CHARS_LEN;\n  }\n  return ref;\n}\n", "/* eslint-disable guard-for-in */\n/* eslint-disable @typescript-eslint/no-for-in-array */\n/* eslint-disable no-await-in-loop */\nimport {\n  isIterable,\n  isPrimitive,\n  isPromise,\n  constructorCheck,\n} from './checks';\nimport quote from './quote';\nimport {\n  AsyncServerValue,\n  ErrorValue,\n  PrimitiveValue,\n  ServerValue,\n  TypedArrayValue,\n} from './types';\nimport getIdentifier from './get-identifier';\nimport serializePrimitive from './serialize-primitive';\n\ninterface IndexAssignment {\n  type: 'index';\n  source: string;\n  value: string;\n}\n\ninterface MapAssignment {\n  type: 'map';\n  source: string;\n  key: string;\n  value: string;\n}\n\ninterface SetAssignment {\n  type: 'set';\n  source: string;\n  value: string;\n}\n\n// Array of assignments to be done (used for recursion)\nexport type Assignment =\n  | IndexAssignment\n  | MapAssignment\n  | SetAssignment;\n\nexport interface SerializationContext {\n  stack: number[];\n  // Value-to-ref map\n  refs: Map<unknown, number>;\n  // Map tree refs to actual refs\n  validRefs: Map<number, number>;\n  // Refs that are...referenced\n  markedRefs: boolean[];\n  // Variables\n  vars: string[];\n  // Array of assignments to be done (used for recursion)\n  assignments: Assignment[];\n}\n\nexport function createSerializationContext(): SerializationContext {\n  return {\n    markedRefs: [],\n    stack: [],\n    refs: new Map(),\n    vars: [],\n    assignments: [],\n    validRefs: new Map(),\n  };\n}\n\nfunction getAssignmentExpression(assignment: Assignment): string {\n  switch (assignment.type) {\n    case 'index':\n      return `${assignment.source}=${assignment.value}`;\n    case 'map':\n      return `${assignment.source}.set(${assignment.key},${assignment.value})`;\n    case 'set':\n      return `${assignment.source}.add(${assignment.value})`;\n    default:\n      return '';\n  }\n}\n\nfunction mergeAssignments(ctx: SerializationContext) {\n  const newAssignments = [];\n  let current = ctx.assignments[0];\n  let prev = current;\n  for (let i = 1, len = ctx.assignments.length; i < len; i += 1) {\n    const item = ctx.assignments[i];\n    if (item.type === prev.type) {\n      if (item.type === 'index' && item.value === prev.value) {\n        // Merge if the right-hand value is the same\n        // saves at least 2 chars\n        current = {\n          type: 'index',\n          source: item.source,\n          value: getAssignmentExpression(current),\n        };\n      } else if (item.type === 'map' && item.source === prev.source) {\n        // Maps has chaining methods, merge if source is the same\n        current = {\n          type: 'map',\n          source: getAssignmentExpression(current),\n          key: item.key,\n          value: item.value,\n        };\n      } else if (item.type === 'set' && item.source === prev.source) {\n        // Sets has chaining methods too\n        current = {\n          type: 'set',\n          source: getAssignmentExpression(current),\n          value: item.value,\n        };\n      } else {\n        // Different assignment, push current\n        newAssignments.push(current);\n        current = item;\n      }\n    } else {\n      newAssignments.push(current);\n      current = item;\n    }\n    prev = item;\n  }\n\n  newAssignments.push(current);\n\n  return newAssignments;\n}\n\nexport function resolvePatches(ctx: SerializationContext) {\n  if (ctx.assignments.length) {\n    let result = '';\n    for (const assignment of mergeAssignments(ctx)) {\n      result += `${getAssignmentExpression(assignment)},`;\n    }\n    return result;\n  }\n  return '';\n}\n\n/**\n * Increments the number of references the referenced value has\n */\nfunction markRef(ctx: SerializationContext, current: number) {\n  ctx.markedRefs[current] = true;\n}\n\n/**\n * Creates a reference ID from the given values\n */\nexport function createRef(\n  ctx: SerializationContext,\n  index: unknown,\n) {\n  const current = ctx.refs.get(index);\n  if (current != null) {\n    return current;\n  }\n  const id = ctx.refs.size;\n  ctx.refs.set(index, id);\n  return id;\n}\n\n/**\n * Creates a new reference ID from a given reference ID\n * This new reference ID means that the reference itself\n * has been referenced at least once, and is used to generate\n * the variables\n */\nfunction createValidRef(\n  ctx: SerializationContext,\n  index: number,\n) {\n  const current = ctx.validRefs.get(index);\n  if (current != null) {\n    return current;\n  }\n  const id = ctx.validRefs.size;\n  ctx.validRefs.set(index, id);\n  return id;\n}\n\n/**\n * Creates the reference param (identifier) from the given reference ID\n * Calling this function means the value has been referenced somewhere\n */\nexport function getRefParam(ctx: SerializationContext, index: number) {\n  const actualIndex = createValidRef(ctx, index);\n  if (ctx.vars[actualIndex]) {\n    return ctx.vars[actualIndex];\n  }\n  const result = getIdentifier(actualIndex);\n  ctx.vars[actualIndex] = result;\n  return result;\n}\n\n/**\n * Generates the inlined assignment for the reference\n * This is different from the assignments array as this one\n * signifies creation rather than mutation\n */\nfunction assignRef(\n  ctx: SerializationContext,\n  index: number,\n  value: string,\n) {\n  if (ctx.markedRefs[index]) {\n    return `${getRefParam(ctx, index)}=${value}`;\n  }\n  return value;\n}\n\nfunction createAssignment(\n  ctx: SerializationContext,\n  source: string,\n  value: string,\n) {\n  ctx.assignments.push({\n    type: 'index',\n    source,\n    value,\n  });\n}\n\nfunction createSetAdd(\n  ctx: SerializationContext,\n  ref: number,\n  value: string,\n) {\n  markRef(ctx, ref);\n  ctx.assignments.push({\n    type: 'set',\n    source: getRefParam(ctx, ref),\n    value,\n  });\n}\n\nfunction createMapSet(\n  ctx: SerializationContext,\n  ref: number,\n  key: string,\n  value: string,\n) {\n  markRef(ctx, ref);\n  ctx.assignments.push({\n    type: 'map',\n    source: getRefParam(ctx, ref),\n    key,\n    value,\n  });\n}\n\nfunction createArrayAssign(\n  ctx: SerializationContext,\n  ref: number,\n  index: number,\n  value: string,\n) {\n  markRef(ctx, ref);\n  createAssignment(ctx, `${getRefParam(ctx, ref)}[${index}]`, value);\n}\n\nfunction createObjectIdentifierAssign(\n  ctx: SerializationContext,\n  ref: number,\n  key: string,\n  value: string,\n) {\n  markRef(ctx, ref);\n  createAssignment(ctx, `${getRefParam(ctx, ref)}.${key}`, value);\n}\n\nfunction createObjectComputedAssign(\n  ctx: SerializationContext,\n  ref: number,\n  key: string,\n  value: string,\n) {\n  markRef(ctx, ref);\n  createAssignment(ctx, `${getRefParam(ctx, ref)}[${key}]`, value);\n}\n\nfunction getErrorConstructor(error: ErrorValue) {\n  if (error instanceof EvalError) {\n    return 'EvalError';\n  }\n  if (error instanceof RangeError) {\n    return 'RangeError';\n  }\n  if (error instanceof ReferenceError) {\n    return 'ReferenceError';\n  }\n  if (error instanceof SyntaxError) {\n    return 'SyntaxError';\n  }\n  if (error instanceof TypeError) {\n    return 'TypeError';\n  }\n  if (error instanceof URIError) {\n    return 'URIError';\n  }\n  return 'Error';\n}\n\nconst EXCLUDED_ERROR_KEYS = {\n  name: true,\n  cause: true,\n  stack: true,\n  message: true,\n};\n\nfunction getErrorOptions(error: Error) {\n  let options: Record<string, any> | undefined;\n  const constructor = getErrorConstructor(error);\n  // Name has been modified\n  if (error.name !== constructor) {\n    options = { name: error.name };\n  } else if (error.constructor.name !== constructor) {\n    // Otherwise, name is overriden because\n    // the Error class is extended\n    options = { name: error.constructor.name };\n  }\n  const names = Object.getOwnPropertyNames(error);\n  for (const name of names) {\n    if (!(name in EXCLUDED_ERROR_KEYS)) {\n      options = options || {};\n      options[name] = error[name as keyof Error];\n    }\n  }\n  return options;\n}\n\nfunction getIterableOptions(obj: Iterable<any>) {\n  const names = Object.getOwnPropertyNames(obj);\n  if (names.length) {\n    const options: Record<string, unknown> = {};\n    for (const name of names) {\n      options[name] = obj[name as unknown as keyof typeof obj];\n    }\n    return options;\n  }\n  return undefined;\n}\n\nconst enum SerovalNodeType {\n  Primitive,\n  Reference,\n  Date,\n  RegExp,\n  Set,\n  Map,\n  Array,\n  Object,\n  NullConstructor,\n  Promise,\n  Error,\n  AggregateError,\n  Iterable,\n  TypedArray,\n}\n\ntype SerovalPrimitiveNode = [type: SerovalNodeType.Primitive, value: PrimitiveValue];\ntype SerovalReferenceNode = [type: SerovalNodeType.Reference, value: number];\ntype SerovalSemiPrimitiveNode =\n  | [type: SerovalNodeType.Date, value: Date, id: number]\n  | [type: SerovalNodeType.RegExp, value: RegExp, id: number]\n  | [\n    type: SerovalNodeType.TypedArray,\n    value: { constructor: string, array: TypedArrayValue },\n    id: number\n  ];\n\ntype SerovalNode =\n  | SerovalPrimitiveNode\n  | SerovalReferenceNode\n  | SerovalSemiPrimitiveNode\n  | [type: SerovalNodeType.Set, value: SerovalNode[], id: number]\n  | [type: SerovalNodeType.Map, value: [key: SerovalNode, value: SerovalNode][], id: number]\n  | [type: SerovalNodeType.Array, value: SerovalNode[], id: number]\n  | [type: SerovalNodeType.Object, value: Record<string, SerovalNode>, id: number]\n  | [type: SerovalNodeType.NullConstructor, value: Record<string, SerovalNode>, id: number]\n  | [type: SerovalNodeType.Promise, value: SerovalNode, id: number]\n  | [\n    type: SerovalNodeType.Error,\n    value: {\n      constructor: string;\n      message: string;\n      options?: SerovalNode;\n      cause?: SerovalNode;\n    },\n    id: number\n  ]\n  | [\n    type: SerovalNodeType.AggregateError,\n    value: {\n      message: string;\n      options?: SerovalNode;\n      cause?: SerovalNode;\n      errors: SerovalNode;\n    },\n    id: number\n  ]\n  | [\n    type: SerovalNodeType.Iterable,\n    value: {\n      items: SerovalNode,\n      options?: SerovalNode,\n    },\n    id: number,\n  ];\n\nfunction isReferenceInStack(\n  ctx: SerializationContext,\n  node: SerovalNode,\n): node is SerovalReferenceNode {\n  return node[0] === SerovalNodeType.Reference && ctx.stack.includes(node[1]);\n}\n\nfunction generateRef(\n  ctx: SerializationContext,\n  current: unknown,\n): number | SerovalReferenceNode {\n  // Check if reference number already exists\n  const ref = ctx.refs.has(current);\n  if (ref) {\n    // Exists, means this value is currently\n    // being referenced\n    const refID = ctx.refs.get(current) || 0;\n    // Mark reference\n    markRef(ctx, refID);\n    return [SerovalNodeType.Reference, refID];\n  }\n  // Create a new reference ID\n  const id = ctx.refs.size;\n  ctx.refs.set(current, id);\n  return id;\n}\n\nfunction generateSemiPrimitiveValue(\n  current: unknown,\n  id: number,\n): SerovalNode | undefined {\n  if (constructorCheck<Date>(current, Date)) {\n    return [SerovalNodeType.Date, current, id];\n  }\n  if (constructorCheck<RegExp>(current, RegExp)) {\n    return [SerovalNodeType.RegExp, current, id];\n  }\n  if (constructorCheck<Int8Array>(current, Int8Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Int8Array', array: current }, id];\n  }\n  if (constructorCheck<Int16Array>(current, Int16Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Int16Array', array: current }, id];\n  }\n  if (constructorCheck<Int32Array>(current, Int32Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Int32Array', array: current }, id];\n  }\n  if (constructorCheck<Uint8Array>(current, Uint8Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Uint8Array', array: current }, id];\n  }\n  if (constructorCheck<Uint16Array>(current, Uint16Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Uint16Array', array: current }, id];\n  }\n  if (constructorCheck<Uint32Array>(current, Uint32Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Uint32Array', array: current }, id];\n  }\n  if (constructorCheck<Uint8ClampedArray>(current, Uint8ClampedArray)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Uint8ClampedArray', array: current }, id];\n  }\n  if (constructorCheck<Float32Array>(current, Float32Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Float32Array', array: current }, id];\n  }\n  if (constructorCheck<Float64Array>(current, Float64Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'Float64Array', array: current }, id];\n  }\n  if (constructorCheck<BigInt64Array>(current, BigInt64Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'BigInt64Array', array: current }, id];\n  }\n  if (constructorCheck<BigUint64Array>(current, BigUint64Array)) {\n    return [SerovalNodeType.TypedArray, { constructor: 'BigUint64Array', array: current }, id];\n  }\n  return undefined;\n}\n\nexport function generateTreeSync(\n  ctx: SerializationContext,\n  current: ServerValue,\n): SerovalNode {\n  if (isPrimitive(current)) {\n    return [SerovalNodeType.Primitive, current];\n  }\n  // Non-primitive values needs a reference ID\n  // mostly because the values themselves are stateful\n  const id = generateRef(ctx, current);\n  if (Array.isArray(id)) {\n    return id;\n  }\n  const semiPrimitive = generateSemiPrimitiveValue(current, id);\n  if (semiPrimitive) {\n    return semiPrimitive;\n  }\n  if (constructorCheck<Set<ServerValue>>(current, Set)) {\n    const nodes: SerovalNode[] = [];\n    const deferred: ServerValue[] = [];\n    for (const item of current.keys()) {\n      // Iterables are lazy, so the evaluation must be deferred\n      if (isIterable(item)) {\n        deferred.push(item);\n      } else {\n        nodes.push(generateTreeSync(ctx, item));\n      }\n    }\n    // Parse deferred items\n    for (const item of deferred) {\n      nodes.push(generateTreeSync(ctx, item));\n    }\n    return [SerovalNodeType.Set, nodes, id];\n  }\n  if (constructorCheck<Map<ServerValue, ServerValue>>(current, Map)) {\n    const nodes: [key: SerovalNode, value: SerovalNode][] = [];\n    const deferred: [ServerValue, ServerValue][] = [];\n    for (const [key, value] of current.entries()) {\n      // Either key or value might be an iterable\n      if (isIterable(key) || isIterable(value)) {\n        deferred.push([key, value]);\n      } else {\n        const keyNode = generateTreeSync(ctx, key);\n        const valueNode = generateTreeSync(ctx, value);\n        nodes.push([keyNode, valueNode]);\n      }\n    }\n    for (const [key, value] of deferred) {\n      const keyNode = generateTreeSync(ctx, key);\n      const valueNode = generateTreeSync(ctx, value);\n      nodes.push([keyNode, valueNode]);\n    }\n    return [SerovalNodeType.Map, nodes, id];\n  }\n  if (Array.isArray(current)) {\n    const nodes = new Array<SerovalNode>(current.length);\n    const deferred = new Array<ServerValue>(current.length);\n    for (const key in current) {\n      const item = current[key];\n      if (isIterable(item)) {\n        deferred[key] = item;\n      } else {\n        nodes[key] = generateTreeSync(ctx, item);\n      }\n    }\n    for (const key in deferred) {\n      nodes[key] = generateTreeSync(ctx, deferred[key]);\n    }\n    return [SerovalNodeType.Array, nodes, id];\n  }\n  if (current instanceof AggregateError) {\n    const options = getErrorOptions(current);\n    return [SerovalNodeType.AggregateError, {\n      message: current.message,\n      options: options\n        ? generateTreeSync(ctx, options)\n        : undefined,\n      cause: 'cause' in current\n        ? generateTreeSync(ctx, { cause: current.cause as ServerValue })\n        : undefined,\n      errors: generateTreeSync(ctx, current.errors as ServerValue),\n    }, id];\n  }\n  if (current instanceof Error) {\n    const options = getErrorOptions(current);\n    return [SerovalNodeType.Error, {\n      constructor: getErrorConstructor(current),\n      message: current.message,\n      options: options ? generateTreeSync(ctx, options) : undefined,\n      cause: 'cause' in current\n        ? generateTreeSync(ctx, { cause: current.cause as ServerValue })\n        : undefined,\n    }, id];\n  }\n  if (isIterable(current)) {\n    const options = getIterableOptions(current);\n    return [SerovalNodeType.Iterable, {\n      // Parse options first before the items\n      options: options\n        ? generateTreeSync(ctx, options as ServerValue)\n        : undefined,\n      items: generateTreeSync(ctx, Array.from(current)),\n    }, id];\n  }\n  const empty = current.constructor == null;\n  if (current.constructor === Object || empty) {\n    const nodes: Record<string, SerovalNode> = {};\n    const deferred: Record<string, ServerValue> = {};\n    for (const [key, item] of Object.entries(current)) {\n      if (isIterable(item)) {\n        deferred[key] = item as ServerValue;\n      } else {\n        nodes[key] = generateTreeSync(ctx, item as ServerValue);\n      }\n    }\n    for (const [key, item] of Object.entries(deferred)) {\n      nodes[key] = generateTreeSync(ctx, item);\n    }\n    return [\n      empty ? SerovalNodeType.NullConstructor : SerovalNodeType.Object,\n      nodes,\n      id,\n    ];\n  }\n  throw new Error('Unsupported value');\n}\n\nexport async function generateTreeAsync(\n  ctx: SerializationContext,\n  current: AsyncServerValue,\n): Promise<SerovalNode> {\n  if (isPrimitive(current)) {\n    return [SerovalNodeType.Primitive, current];\n  }\n  const id = generateRef(ctx, current);\n  if (Array.isArray(id)) {\n    return id;\n  }\n  const semiPrimitive = generateSemiPrimitiveValue(current, id);\n  if (semiPrimitive) {\n    return semiPrimitive;\n  }\n  if (isPromise(current)) {\n    return current.then(async (value) => [\n      SerovalNodeType.Promise,\n      await generateTreeAsync(ctx, value),\n      id,\n    ]);\n  }\n  if (constructorCheck<Set<ServerValue>>(current, Set)) {\n    const nodes: SerovalNode[] = [];\n    const deferred: ServerValue[] = [];\n    for (const item of current.keys()) {\n      if (isIterable(item)) {\n        deferred.push(item);\n      } else {\n        nodes.push(await generateTreeAsync(ctx, item));\n      }\n    }\n    for (const item of deferred) {\n      nodes.push(await generateTreeAsync(ctx, item));\n    }\n    return [SerovalNodeType.Set, nodes, id];\n  }\n  if (constructorCheck<Map<ServerValue, ServerValue>>(current, Map)) {\n    const nodes: [key: SerovalNode, value: SerovalNode][] = [];\n    const deferred: [ServerValue, ServerValue][] = [];\n    for (const [key, value] of current.entries()) {\n      if (isIterable(key) || isIterable(value)) {\n        deferred.push([key, value]);\n      } else {\n        const keyNode = await generateTreeAsync(ctx, key);\n        const valueNode = await generateTreeAsync(ctx, value);\n        nodes.push([keyNode, valueNode]);\n      }\n    }\n    for (const [key, value] of deferred) {\n      const keyNode = await generateTreeAsync(ctx, key);\n      const valueNode = await generateTreeAsync(ctx, value);\n      nodes.push([keyNode, valueNode]);\n    }\n    return [SerovalNodeType.Map, nodes, id];\n  }\n  if (Array.isArray(current)) {\n    const nodes = new Array<SerovalNode>(current.length);\n    const deferred = new Array<AsyncServerValue>(current.length);\n    for (const key in current) {\n      const item = current[key];\n      if (isIterable(item)) {\n        deferred[key] = item;\n      } else {\n        nodes[key] = await generateTreeAsync(ctx, item);\n      }\n    }\n    for (const key in deferred) {\n      nodes[key] = await generateTreeAsync(ctx, deferred[key]);\n    }\n    return [SerovalNodeType.Array, nodes, id];\n  }\n  if (current instanceof AggregateError) {\n    const options = getErrorOptions(current);\n    return [SerovalNodeType.AggregateError, {\n      message: current.message,\n      options: options\n        ? generateTreeSync(ctx, options)\n        : undefined,\n      cause: 'cause' in current\n        ? await generateTreeAsync(ctx, { cause: current.cause as ServerValue })\n        : undefined,\n      errors: await generateTreeAsync(ctx, current.errors as ServerValue),\n    }, id];\n  }\n  if (current instanceof Error) {\n    const options = getErrorOptions(current);\n    return [SerovalNodeType.Error, {\n      constructor: getErrorConstructor(current),\n      message: current.message,\n      options: options ? await generateTreeAsync(ctx, options) : undefined,\n      cause: 'cause' in current\n        ? await generateTreeAsync(ctx, { cause: current.cause as ServerValue })\n        : undefined,\n    }, id];\n  }\n  if (isIterable(current)) {\n    const options = getIterableOptions(current);\n    return [SerovalNodeType.Iterable, {\n      options: options\n        ? await generateTreeAsync(ctx, options as ServerValue)\n        : undefined,\n      items: await generateTreeAsync(ctx, Array.from(current)),\n    }, id];\n  }\n  const empty = current.constructor == null;\n  if (current.constructor === Object || empty) {\n    const nodes: Record<string, SerovalNode> = {};\n    const deferred: Record<string, AsyncServerValue> = {};\n    for (const [key, item] of Object.entries(current)) {\n      if (isIterable(item)) {\n        deferred[key] = item as ServerValue;\n      } else {\n        nodes[key] = await generateTreeAsync(ctx, item as ServerValue);\n      }\n    }\n    for (const [key, item] of Object.entries(deferred)) {\n      nodes[key] = await generateTreeAsync(ctx, item);\n    }\n    return [\n      empty ? SerovalNodeType.NullConstructor : SerovalNodeType.Object,\n      nodes,\n      id,\n    ];\n  }\n  throw new Error('Unsupported value');\n}\n\nexport function serializeTree(\n  ctx: SerializationContext,\n  [type, value, id]: SerovalNode,\n): string {\n  switch (type) {\n    case SerovalNodeType.Primitive:\n      return serializePrimitive(value);\n    case SerovalNodeType.Reference:\n      return getRefParam(ctx, value);\n    case SerovalNodeType.Promise: {\n      let serialized: string;\n      // Check if resolved value is a parent expression\n      if (isReferenceInStack(ctx, value)) {\n        // A Promise trick, reference the value\n        // inside the `then` expression so that\n        // the Promise evaluates after the parent\n        // has initialized\n        serialized = `Promise.resolve().then(()=>${getRefParam(ctx, value[1])})`;\n      } else {\n        ctx.stack.push(id);\n        const result = serializeTree(ctx, value);\n        ctx.stack.pop();\n        // just inline the value/reference here\n        serialized = `Promise.resolve(${result})`;\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    case SerovalNodeType.Date:\n      return assignRef(ctx, id, `new Date(\"${value.toISOString()}\")`);\n    case SerovalNodeType.RegExp:\n      return assignRef(ctx, id, String(value));\n    case SerovalNodeType.TypedArray: {\n      // BigInt typed arrays are broken for toString()\n      const values = [...value.array].map(serializePrimitive).join(',');\n      let args = `[${values}]`;\n      if (value.array.byteOffset !== 0) {\n        args += `,${value.array.byteOffset}`;\n      }\n      return assignRef(ctx, id, `new ${value.constructor}(${args})`);\n    }\n    case SerovalNodeType.Set: {\n      let serialized = 'new Set';\n      if (value.length) {\n        const values: string[] = [];\n        ctx.stack.push(id);\n        for (const item of value) {\n          if (isReferenceInStack(ctx, item)) {\n            createSetAdd(ctx, id, getRefParam(ctx, item[1]));\n          } else {\n            // Push directly\n            values.push(serializeTree(ctx, item));\n          }\n        }\n        ctx.stack.pop();\n        if (values.length) {\n          serialized += `([${values.join(',')}])`;\n        }\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    case SerovalNodeType.Map: {\n      let serialized = 'new Map';\n      if (value.length) {\n        const values: string[] = [];\n        ctx.stack.push(id);\n        for (const [key, val] of value) {\n          // Check if key is a parent\n          if (isReferenceInStack(ctx, key)) {\n            // Create reference for the map instance\n            const keyRef = getRefParam(ctx, key[1]);\n            // Check if value is a parent\n            if (isReferenceInStack(ctx, val)) {\n              const valueRef = getRefParam(ctx, val[1]);\n              // Register an assignment since\n              // both key and value are a parent of this\n              // Map instance\n              createMapSet(ctx, id, keyRef, valueRef);\n            } else {\n              // Reset the stack\n              // This is required because the serialized\n              // value is no longer part of the expression\n              // tree and has been moved to the deferred\n              // assignment\n              const parent = ctx.stack;\n              ctx.stack = [];\n              createMapSet(ctx, id, keyRef, serializeTree(ctx, val));\n              ctx.stack = parent;\n            }\n          } else if (isReferenceInStack(ctx, val)) {\n            // Create ref for the Map instance\n            const valueRef = getRefParam(ctx, val[1]);\n            // Reset stack for the key serialization\n            const parent = ctx.stack;\n            ctx.stack = [];\n            createMapSet(ctx, id, serializeTree(ctx, key), valueRef);\n            ctx.stack = parent;\n          } else {\n            values.push(`[${serializeTree(ctx, key)},${serializeTree(ctx, val)}]`);\n          }\n        }\n        ctx.stack.pop();\n        // Check if there are any values\n        // so that the empty Map constructor\n        // can be used instead\n        if (values.length) {\n          serialized += `([${values.join(',')}])`;\n        }\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    case SerovalNodeType.Array: {\n      // This is different than Map and Set\n      // because we also need to serialize\n      // the holes of the Array\n      let values = '';\n\n      ctx.stack.push(id);\n      for (let i = 0, len = value.length; i < len; i++) {\n        const item = value[i];\n        // Check if index is a hole\n        if (i in value) {\n          // Check if item is a parent\n          if (isReferenceInStack(ctx, item)) {\n            createArrayAssign(ctx, id, i, getRefParam(ctx, item[1]));\n            values += ',';\n          } else {\n            values += serializeTree(ctx, item);\n            if (i < value.length - 1) {\n              values += ',';\n            }\n          }\n        } else {\n          // Add an empty item\n          values += ',';\n        }\n      }\n      ctx.stack.pop();\n      return assignRef(ctx, id, `[${values}]`);\n    }\n    case SerovalNodeType.AggregateError: {\n      // Serialize the required arguments\n      const args = [serializeTree(ctx, value.errors), quote(value.message)];\n      // cause is an optional argument\n      if (value.cause) {\n        args.push(serializeTree(ctx, value.cause));\n      }\n      let serialized = `new AggregateError(${args.join(',')})`;\n      // `AggregateError` might've been extended\n      // either through class or custom properties\n      // Make sure to assign extra properties\n      if (value.options) {\n        const options = serializeTree(ctx, value.options);\n        serialized = `Object.assign(${serialized},${options})`;\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    case SerovalNodeType.Error: {\n      const args = [quote(value.message)];\n      if (value.cause) {\n        args.push(serializeTree(ctx, value.cause));\n      }\n      let serialized = `new ${value.constructor}(${args.join(',')})`;\n      if (value.options) {\n        const options = serializeTree(ctx, value.options);\n        serialized = `Object.assign(${serialized},${options})`;\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    case SerovalNodeType.Iterable: {\n      const parent = ctx.stack;\n      ctx.stack = [];\n      const values = serializeTree(ctx, value.items);\n      ctx.stack = parent;\n      let serialized = `{[Symbol.iterator]:()=>${values}.values()}`;\n      if (value.options) {\n        ctx.stack.push(id);\n        const options = serializeTree(ctx, value.options);\n        ctx.stack.pop();\n        serialized = `Object.assign(${serialized},${options})`;\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    case SerovalNodeType.NullConstructor:\n    case SerovalNodeType.Object: {\n      const values: string[] = [];\n\n      ctx.stack.push(id);\n      for (const [key, val] of Object.entries(value)) {\n        const check = Number(key);\n        // Test if key is a valid number or JS identifier\n        // so that we don't have to serialize the key and wrap with brackets\n        if (\n          check >= 0\n          || (Number.isNaN(check) && /^([$A-Z_][0-9A-Z_$]*)$/i.test(key))\n        ) {\n          if (isReferenceInStack(ctx, val)) {\n            const refParam = getRefParam(ctx, val[1]);\n            if (!Number.isNaN(check)) {\n              createObjectComputedAssign(ctx, id, key, refParam);\n            } else {\n              createObjectIdentifierAssign(ctx, id, key, refParam);\n            }\n          } else {\n            values.push(`${key}:${serializeTree(ctx, val)}`);\n          }\n        } else if (isReferenceInStack(ctx, val)) {\n          const refParam = getRefParam(ctx, val[1]);\n          createObjectComputedAssign(ctx, id, quote(key), refParam);\n        } else {\n          values.push(`${quote(key)}:${serializeTree(ctx, val)}`);\n        }\n      }\n      ctx.stack.pop();\n      let serialized = `{${values.join(',')}}`;\n      if (type === SerovalNodeType.NullConstructor) {\n        serialized = `Object.assign(Object.create(null),${serialized})`;\n      }\n      return assignRef(ctx, id, serialized);\n    }\n    default:\n      throw new Error('Unsupported type');\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACEO,SAAS,YAAY,SAA6C;AACvE,MAAI,CAAC,WAAW,YAAY,MAAM;AAChC,WAAO;AAAA,EACT;AACA,QAAM,OAAO,OAAO;AACpB,SAAO,SAAS,YACX,SAAS,YACT,SAAS;AAChB;AAEO,SAAS,UAAa,KAAqC;AAChE,SAAO,CAAC,CAAC,QACH,OAAO,QAAQ,YAAY,OAAO,QAAQ,eAC3C,UAAU,OACV,OAAO,IAAI,SAAS;AAC3B;AAEO,SAAS,iBACd,OACA,aACY;AACZ,SAAQ,MAAmC,gBAAgB;AAC7D;AAEA,SAAS,kBAAkB,KAAc;AACvC,SACE,MAAM,QAAQ,GAAG,KACd,iBAA2B,KAAK,GAAG,KACnC,iBAAgC,KAAK,GAAG;AAE/C;AAEO,SAAS,WAAc,KAAkC;AAC9D,SAAO,CAAC,CAAC,OACJ,OAAO,QAAQ,YACf,CAAC,kBAAkB,GAAG,KACtB,OAAO,YAAY,OACnB,OAAO,IAAI,OAAO,QAAQ,MAAM;AACvC;;;ACnCe,SAAR,MAAuB,KAAa;AACzC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,WAAS,IAAI,GAAG,MAAM,IAAI,QAAQ,IAAI,KAAK,KAAK;AAC9C,QAAI;AACJ,YAAQ,IAAI,CAAC,GAAG;AAAA,MACd,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF,KAAK;AACH,sBAAc;AACd;AAAA,MACF;AACE;AAAA,IACJ;AACA,cAAU,IAAI,MAAM,SAAS,CAAC,IAAI;AAClC,cAAU,IAAI;AAAA,EAChB;AACA,MAAI,YAAY,GAAG;AACjB,aAAS;AAAA,EACX,OAAO;AACL,cAAU,IAAI,MAAM,OAAO;AAAA,EAC7B;AACA,SAAO,IAAI;AACb;;;ACzCe,SAAR,mBAAoC,OAA+B;AAExE,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,OAAO;AACnB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,QAAW;AACvB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,MAAM;AAClB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,GAAG;AAAA,EACZ;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,MAAM,KAAK;AAAA,EACpB;AAEA,MAAI,OAAO,GAAG,OAAO,EAAE,GAAG;AACxB,WAAO;AAAA,EACT;AACA,MAAI,OAAO,GAAG,OAAO,QAAQ,GAAG;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,OAAO,GAAG,OAAO,SAAS,GAAG;AAC/B,WAAO;AAAA,EACT;AACA,SAAO,OAAO,KAAK;AACrB;;;ACjCA,IAAM,kBAAkB;AACxB,IAAM,sBAAsB,gBAAgB;AAC5C,IAAM,YAAY;AAClB,IAAM,gBAAgB,UAAU;AAEjB,SAAR,cAA+B,OAAe;AACnD,MAAI,MAAM,QAAQ;AAClB,MAAI,MAAM,gBAAgB,GAAG;AAC7B,WAAS,QAAQ,OAAO;AACxB,SAAO,QAAQ,GAAG;AAChB,UAAM,QAAQ;AACd,WAAO,UAAU,GAAG;AACpB,aAAS,QAAQ,OAAO;AAAA,EAC1B;AACA,SAAO;AACT;;;AC2CO,SAAS,6BAAmD;AACjE,SAAO;AAAA,IACL,YAAY,CAAC;AAAA,IACb,OAAO,CAAC;AAAA,IACR,MAAM,oBAAI,IAAI;AAAA,IACd,MAAM,CAAC;AAAA,IACP,aAAa,CAAC;AAAA,IACd,WAAW,oBAAI,IAAI;AAAA,EACrB;AACF;AAEA,SAAS,wBAAwB,YAAgC;AAC/D,UAAQ,WAAW,MAAM;AAAA,IACvB,KAAK;AACH,aAAO,GAAG,WAAW,UAAU,WAAW;AAAA,IAC5C,KAAK;AACH,aAAO,GAAG,WAAW,cAAc,WAAW,OAAO,WAAW;AAAA,IAClE,KAAK;AACH,aAAO,GAAG,WAAW,cAAc,WAAW;AAAA,IAChD;AACE,aAAO;AAAA,EACX;AACF;AAEA,SAAS,iBAAiB,KAA2B;AACnD,QAAM,iBAAiB,CAAC;AACxB,MAAI,UAAU,IAAI,YAAY,CAAC;AAC/B,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,MAAM,IAAI,YAAY,QAAQ,IAAI,KAAK,KAAK,GAAG;AAC7D,UAAM,OAAO,IAAI,YAAY,CAAC;AAC9B,QAAI,KAAK,SAAS,KAAK,MAAM;AAC3B,UAAI,KAAK,SAAS,WAAW,KAAK,UAAU,KAAK,OAAO;AAGtD,kBAAU;AAAA,UACR,MAAM;AAAA,UACN,QAAQ,KAAK;AAAA,UACb,OAAO,wBAAwB,OAAO;AAAA,QACxC;AAAA,MACF,WAAW,KAAK,SAAS,SAAS,KAAK,WAAW,KAAK,QAAQ;AAE7D,kBAAU;AAAA,UACR,MAAM;AAAA,UACN,QAAQ,wBAAwB,OAAO;AAAA,UACvC,KAAK,KAAK;AAAA,UACV,OAAO,KAAK;AAAA,QACd;AAAA,MACF,WAAW,KAAK,SAAS,SAAS,KAAK,WAAW,KAAK,QAAQ;AAE7D,kBAAU;AAAA,UACR,MAAM;AAAA,UACN,QAAQ,wBAAwB,OAAO;AAAA,UACvC,OAAO,KAAK;AAAA,QACd;AAAA,MACF,OAAO;AAEL,uBAAe,KAAK,OAAO;AAC3B,kBAAU;AAAA,MACZ;AAAA,IACF,OAAO;AACL,qBAAe,KAAK,OAAO;AAC3B,gBAAU;AAAA,IACZ;AACA,WAAO;AAAA,EACT;AAEA,iBAAe,KAAK,OAAO;AAE3B,SAAO;AACT;AAEO,SAAS,eAAe,KAA2B;AACxD,MAAI,IAAI,YAAY,QAAQ;AAC1B,QAAI,SAAS;AACb,eAAW,cAAc,iBAAiB,GAAG,GAAG;AAC9C,gBAAU,GAAG,wBAAwB,UAAU;AAAA,IACjD;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,SAAS,QAAQ,KAA2B,SAAiB;AAC3D,MAAI,WAAW,OAAO,IAAI;AAC5B;AAKO,SAAS,UACd,KACA,OACA;AACA,QAAM,UAAU,IAAI,KAAK,IAAI,KAAK;AAClC,MAAI,WAAW,MAAM;AACnB,WAAO;AAAA,EACT;AACA,QAAM,KAAK,IAAI,KAAK;AACpB,MAAI,KAAK,IAAI,OAAO,EAAE;AACtB,SAAO;AACT;AAQA,SAAS,eACP,KACA,OACA;AACA,QAAM,UAAU,IAAI,UAAU,IAAI,KAAK;AACvC,MAAI,WAAW,MAAM;AACnB,WAAO;AAAA,EACT;AACA,QAAM,KAAK,IAAI,UAAU;AACzB,MAAI,UAAU,IAAI,OAAO,EAAE;AAC3B,SAAO;AACT;AAMO,SAAS,YAAY,KAA2B,OAAe;AACpE,QAAM,cAAc,eAAe,KAAK,KAAK;AAC7C,MAAI,IAAI,KAAK,WAAW,GAAG;AACzB,WAAO,IAAI,KAAK,WAAW;AAAA,EAC7B;AACA,QAAM,SAAS,cAAc,WAAW;AACxC,MAAI,KAAK,WAAW,IAAI;AACxB,SAAO;AACT;AAOA,SAAS,UACP,KACA,OACA,OACA;AACA,MAAI,IAAI,WAAW,KAAK,GAAG;AACzB,WAAO,GAAG,YAAY,KAAK,KAAK,KAAK;AAAA,EACvC;AACA,SAAO;AACT;AAEA,SAAS,iBACP,KACA,QACA,OACA;AACA,MAAI,YAAY,KAAK;AAAA,IACnB,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF,CAAC;AACH;AAEA,SAAS,aACP,KACA,KACA,OACA;AACA,UAAQ,KAAK,GAAG;AAChB,MAAI,YAAY,KAAK;AAAA,IACnB,MAAM;AAAA,IACN,QAAQ,YAAY,KAAK,GAAG;AAAA,IAC5B;AAAA,EACF,CAAC;AACH;AAEA,SAAS,aACP,KACA,KACA,KACA,OACA;AACA,UAAQ,KAAK,GAAG;AAChB,MAAI,YAAY,KAAK;AAAA,IACnB,MAAM;AAAA,IACN,QAAQ,YAAY,KAAK,GAAG;AAAA,IAC5B;AAAA,IACA;AAAA,EACF,CAAC;AACH;AAEA,SAAS,kBACP,KACA,KACA,OACA,OACA;AACA,UAAQ,KAAK,GAAG;AAChB,mBAAiB,KAAK,GAAG,YAAY,KAAK,GAAG,KAAK,UAAU,KAAK;AACnE;AAEA,SAAS,6BACP,KACA,KACA,KACA,OACA;AACA,UAAQ,KAAK,GAAG;AAChB,mBAAiB,KAAK,GAAG,YAAY,KAAK,GAAG,KAAK,OAAO,KAAK;AAChE;AAEA,SAAS,2BACP,KACA,KACA,KACA,OACA;AACA,UAAQ,KAAK,GAAG;AAChB,mBAAiB,KAAK,GAAG,YAAY,KAAK,GAAG,KAAK,QAAQ,KAAK;AACjE;AAEA,SAAS,oBAAoB,OAAmB;AAC9C,MAAI,iBAAiB,WAAW;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,iBAAiB,YAAY;AAC/B,WAAO;AAAA,EACT;AACA,MAAI,iBAAiB,gBAAgB;AACnC,WAAO;AAAA,EACT;AACA,MAAI,iBAAiB,aAAa;AAChC,WAAO;AAAA,EACT;AACA,MAAI,iBAAiB,WAAW;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,iBAAiB,UAAU;AAC7B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,IAAM,sBAAsB;AAAA,EAC1B,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,EACP,SAAS;AACX;AAEA,SAAS,gBAAgB,OAAc;AACrC,MAAI;AACJ,QAAM,cAAc,oBAAoB,KAAK;AAE7C,MAAI,MAAM,SAAS,aAAa;AAC9B,cAAU,EAAE,MAAM,MAAM,KAAK;AAAA,EAC/B,WAAW,MAAM,YAAY,SAAS,aAAa;AAGjD,cAAU,EAAE,MAAM,MAAM,YAAY,KAAK;AAAA,EAC3C;AACA,QAAM,QAAQ,OAAO,oBAAoB,KAAK;AAC9C,aAAW,QAAQ,OAAO;AACxB,QAAI,EAAE,QAAQ,sBAAsB;AAClC,gBAAU,WAAW,CAAC;AACtB,cAAQ,IAAI,IAAI,MAAM,IAAmB;AAAA,IAC3C;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,KAAoB;AAC9C,QAAM,QAAQ,OAAO,oBAAoB,GAAG;AAC5C,MAAI,MAAM,QAAQ;AAChB,UAAM,UAAmC,CAAC;AAC1C,eAAW,QAAQ,OAAO;AACxB,cAAQ,IAAI,IAAI,IAAI,IAAmC;AAAA,IACzD;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAqEA,SAAS,mBACP,KACA,MAC8B;AAC9B,SAAO,KAAK,CAAC,MAAM,qBAA6B,IAAI,MAAM,SAAS,KAAK,CAAC,CAAC;AAC5E;AAEA,SAAS,YACP,KACA,SAC+B;AAE/B,QAAM,MAAM,IAAI,KAAK,IAAI,OAAO;AAChC,MAAI,KAAK;AAGP,UAAM,QAAQ,IAAI,KAAK,IAAI,OAAO,KAAK;AAEvC,YAAQ,KAAK,KAAK;AAClB,WAAO,CAAC,mBAA2B,KAAK;AAAA,EAC1C;AAEA,QAAM,KAAK,IAAI,KAAK;AACpB,MAAI,KAAK,IAAI,SAAS,EAAE;AACxB,SAAO;AACT;AAEA,SAAS,2BACP,SACA,IACyB;AACzB,MAAI,iBAAuB,SAAS,IAAI,GAAG;AACzC,WAAO,CAAC,cAAsB,SAAS,EAAE;AAAA,EAC3C;AACA,MAAI,iBAAyB,SAAS,MAAM,GAAG;AAC7C,WAAO,CAAC,gBAAwB,SAAS,EAAE;AAAA,EAC7C;AACA,MAAI,iBAA4B,SAAS,SAAS,GAAG;AACnD,WAAO,CAAC,qBAA4B,EAAE,aAAa,aAAa,OAAO,QAAQ,GAAG,EAAE;AAAA,EACtF;AACA,MAAI,iBAA6B,SAAS,UAAU,GAAG;AACrD,WAAO,CAAC,qBAA4B,EAAE,aAAa,cAAc,OAAO,QAAQ,GAAG,EAAE;AAAA,EACvF;AACA,MAAI,iBAA6B,SAAS,UAAU,GAAG;AACrD,WAAO,CAAC,qBAA4B,EAAE,aAAa,cAAc,OAAO,QAAQ,GAAG,EAAE;AAAA,EACvF;AACA,MAAI,iBAA6B,SAAS,UAAU,GAAG;AACrD,WAAO,CAAC,qBAA4B,EAAE,aAAa,cAAc,OAAO,QAAQ,GAAG,EAAE;AAAA,EACvF;AACA,MAAI,iBAA8B,SAAS,WAAW,GAAG;AACvD,WAAO,CAAC,qBAA4B,EAAE,aAAa,eAAe,OAAO,QAAQ,GAAG,EAAE;AAAA,EACxF;AACA,MAAI,iBAA8B,SAAS,WAAW,GAAG;AACvD,WAAO,CAAC,qBAA4B,EAAE,aAAa,eAAe,OAAO,QAAQ,GAAG,EAAE;AAAA,EACxF;AACA,MAAI,iBAAoC,SAAS,iBAAiB,GAAG;AACnE,WAAO,CAAC,qBAA4B,EAAE,aAAa,qBAAqB,OAAO,QAAQ,GAAG,EAAE;AAAA,EAC9F;AACA,MAAI,iBAA+B,SAAS,YAAY,GAAG;AACzD,WAAO,CAAC,qBAA4B,EAAE,aAAa,gBAAgB,OAAO,QAAQ,GAAG,EAAE;AAAA,EACzF;AACA,MAAI,iBAA+B,SAAS,YAAY,GAAG;AACzD,WAAO,CAAC,qBAA4B,EAAE,aAAa,gBAAgB,OAAO,QAAQ,GAAG,EAAE;AAAA,EACzF;AACA,MAAI,iBAAgC,SAAS,aAAa,GAAG;AAC3D,WAAO,CAAC,qBAA4B,EAAE,aAAa,iBAAiB,OAAO,QAAQ,GAAG,EAAE;AAAA,EAC1F;AACA,MAAI,iBAAiC,SAAS,cAAc,GAAG;AAC7D,WAAO,CAAC,qBAA4B,EAAE,aAAa,kBAAkB,OAAO,QAAQ,GAAG,EAAE;AAAA,EAC3F;AACA,SAAO;AACT;AAEO,SAAS,iBACd,KACA,SACa;AACb,MAAI,YAAY,OAAO,GAAG;AACxB,WAAO,CAAC,mBAA2B,OAAO;AAAA,EAC5C;AAGA,QAAM,KAAK,YAAY,KAAK,OAAO;AACnC,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,WAAO;AAAA,EACT;AACA,QAAM,gBAAgB,2BAA2B,SAAS,EAAE;AAC5D,MAAI,eAAe;AACjB,WAAO;AAAA,EACT;AACA,MAAI,iBAAmC,SAAS,GAAG,GAAG;AACpD,UAAM,QAAuB,CAAC;AAC9B,UAAM,WAA0B,CAAC;AACjC,eAAW,QAAQ,QAAQ,KAAK,GAAG;AAEjC,UAAI,WAAW,IAAI,GAAG;AACpB,iBAAS,KAAK,IAAI;AAAA,MACpB,OAAO;AACL,cAAM,KAAK,iBAAiB,KAAK,IAAI,CAAC;AAAA,MACxC;AAAA,IACF;AAEA,eAAW,QAAQ,UAAU;AAC3B,YAAM,KAAK,iBAAiB,KAAK,IAAI,CAAC;AAAA,IACxC;AACA,WAAO,CAAC,aAAqB,OAAO,EAAE;AAAA,EACxC;AACA,MAAI,iBAAgD,SAAS,GAAG,GAAG;AACjE,UAAM,QAAkD,CAAC;AACzD,UAAM,WAAyC,CAAC;AAChD,eAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAE5C,UAAI,WAAW,GAAG,KAAK,WAAW,KAAK,GAAG;AACxC,iBAAS,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,MAC5B,OAAO;AACL,cAAM,UAAU,iBAAiB,KAAK,GAAG;AACzC,cAAM,YAAY,iBAAiB,KAAK,KAAK;AAC7C,cAAM,KAAK,CAAC,SAAS,SAAS,CAAC;AAAA,MACjC;AAAA,IACF;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,UAAU;AACnC,YAAM,UAAU,iBAAiB,KAAK,GAAG;AACzC,YAAM,YAAY,iBAAiB,KAAK,KAAK;AAC7C,YAAM,KAAK,CAAC,SAAS,SAAS,CAAC;AAAA,IACjC;AACA,WAAO,CAAC,aAAqB,OAAO,EAAE;AAAA,EACxC;AACA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,UAAM,QAAQ,IAAI,MAAmB,QAAQ,MAAM;AACnD,UAAM,WAAW,IAAI,MAAmB,QAAQ,MAAM;AACtD,eAAW,OAAO,SAAS;AACzB,YAAM,OAAO,QAAQ,GAAG;AACxB,UAAI,WAAW,IAAI,GAAG;AACpB,iBAAS,GAAG,IAAI;AAAA,MAClB,OAAO;AACL,cAAM,GAAG,IAAI,iBAAiB,KAAK,IAAI;AAAA,MACzC;AAAA,IACF;AACA,eAAW,OAAO,UAAU;AAC1B,YAAM,GAAG,IAAI,iBAAiB,KAAK,SAAS,GAAG,CAAC;AAAA,IAClD;AACA,WAAO,CAAC,eAAuB,OAAO,EAAE;AAAA,EAC1C;AACA,MAAI,mBAAmB,gBAAgB;AACrC,UAAM,UAAU,gBAAgB,OAAO;AACvC,WAAO,CAAC,yBAAgC;AAAA,MACtC,SAAS,QAAQ;AAAA,MACjB,SAAS,UACL,iBAAiB,KAAK,OAAO,IAC7B;AAAA,MACJ,OAAO,WAAW,UACd,iBAAiB,KAAK,EAAE,OAAO,QAAQ,MAAqB,CAAC,IAC7D;AAAA,MACJ,QAAQ,iBAAiB,KAAK,QAAQ,MAAqB;AAAA,IAC7D,GAAG,EAAE;AAAA,EACP;AACA,MAAI,mBAAmB,OAAO;AAC5B,UAAM,UAAU,gBAAgB,OAAO;AACvC,WAAO,CAAC,gBAAuB;AAAA,MAC7B,aAAa,oBAAoB,OAAO;AAAA,MACxC,SAAS,QAAQ;AAAA,MACjB,SAAS,UAAU,iBAAiB,KAAK,OAAO,IAAI;AAAA,MACpD,OAAO,WAAW,UACd,iBAAiB,KAAK,EAAE,OAAO,QAAQ,MAAqB,CAAC,IAC7D;AAAA,IACN,GAAG,EAAE;AAAA,EACP;AACA,MAAI,WAAW,OAAO,GAAG;AACvB,UAAM,UAAU,mBAAmB,OAAO;AAC1C,WAAO,CAAC,mBAA0B;AAAA;AAAA,MAEhC,SAAS,UACL,iBAAiB,KAAK,OAAsB,IAC5C;AAAA,MACJ,OAAO,iBAAiB,KAAK,MAAM,KAAK,OAAO,CAAC;AAAA,IAClD,GAAG,EAAE;AAAA,EACP;AACA,QAAM,QAAQ,QAAQ,eAAe;AACrC,MAAI,QAAQ,gBAAgB,UAAU,OAAO;AAC3C,UAAM,QAAqC,CAAC;AAC5C,UAAM,WAAwC,CAAC;AAC/C,eAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,OAAO,GAAG;AACjD,UAAI,WAAW,IAAI,GAAG;AACpB,iBAAS,GAAG,IAAI;AAAA,MAClB,OAAO;AACL,cAAM,GAAG,IAAI,iBAAiB,KAAK,IAAmB;AAAA,MACxD;AAAA,IACF;AACA,eAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,QAAQ,GAAG;AAClD,YAAM,GAAG,IAAI,iBAAiB,KAAK,IAAI;AAAA,IACzC;AACA,WAAO;AAAA,MACL,QAAQ,0BAAkC;AAAA,MAC1C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,IAAI,MAAM,mBAAmB;AACrC;AAEA,eAAsB,kBACpB,KACA,SACsB;AACtB,MAAI,YAAY,OAAO,GAAG;AACxB,WAAO,CAAC,mBAA2B,OAAO;AAAA,EAC5C;AACA,QAAM,KAAK,YAAY,KAAK,OAAO;AACnC,MAAI,MAAM,QAAQ,EAAE,GAAG;AACrB,WAAO;AAAA,EACT;AACA,QAAM,gBAAgB,2BAA2B,SAAS,EAAE;AAC5D,MAAI,eAAe;AACjB,WAAO;AAAA,EACT;AACA,MAAI,UAAU,OAAO,GAAG;AACtB,WAAO,QAAQ,KAAK,OAAO,UAAU;AAAA,MACnC;AAAA,MACA,MAAM,kBAAkB,KAAK,KAAK;AAAA,MAClC;AAAA,IACF,CAAC;AAAA,EACH;AACA,MAAI,iBAAmC,SAAS,GAAG,GAAG;AACpD,UAAM,QAAuB,CAAC;AAC9B,UAAM,WAA0B,CAAC;AACjC,eAAW,QAAQ,QAAQ,KAAK,GAAG;AACjC,UAAI,WAAW,IAAI,GAAG;AACpB,iBAAS,KAAK,IAAI;AAAA,MACpB,OAAO;AACL,cAAM,KAAK,MAAM,kBAAkB,KAAK,IAAI,CAAC;AAAA,MAC/C;AAAA,IACF;AACA,eAAW,QAAQ,UAAU;AAC3B,YAAM,KAAK,MAAM,kBAAkB,KAAK,IAAI,CAAC;AAAA,IAC/C;AACA,WAAO,CAAC,aAAqB,OAAO,EAAE;AAAA,EACxC;AACA,MAAI,iBAAgD,SAAS,GAAG,GAAG;AACjE,UAAM,QAAkD,CAAC;AACzD,UAAM,WAAyC,CAAC;AAChD,eAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC5C,UAAI,WAAW,GAAG,KAAK,WAAW,KAAK,GAAG;AACxC,iBAAS,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,MAC5B,OAAO;AACL,cAAM,UAAU,MAAM,kBAAkB,KAAK,GAAG;AAChD,cAAM,YAAY,MAAM,kBAAkB,KAAK,KAAK;AACpD,cAAM,KAAK,CAAC,SAAS,SAAS,CAAC;AAAA,MACjC;AAAA,IACF;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,UAAU;AACnC,YAAM,UAAU,MAAM,kBAAkB,KAAK,GAAG;AAChD,YAAM,YAAY,MAAM,kBAAkB,KAAK,KAAK;AACpD,YAAM,KAAK,CAAC,SAAS,SAAS,CAAC;AAAA,IACjC;AACA,WAAO,CAAC,aAAqB,OAAO,EAAE;AAAA,EACxC;AACA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,UAAM,QAAQ,IAAI,MAAmB,QAAQ,MAAM;AACnD,UAAM,WAAW,IAAI,MAAwB,QAAQ,MAAM;AAC3D,eAAW,OAAO,SAAS;AACzB,YAAM,OAAO,QAAQ,GAAG;AACxB,UAAI,WAAW,IAAI,GAAG;AACpB,iBAAS,GAAG,IAAI;AAAA,MAClB,OAAO;AACL,cAAM,GAAG,IAAI,MAAM,kBAAkB,KAAK,IAAI;AAAA,MAChD;AAAA,IACF;AACA,eAAW,OAAO,UAAU;AAC1B,YAAM,GAAG,IAAI,MAAM,kBAAkB,KAAK,SAAS,GAAG,CAAC;AAAA,IACzD;AACA,WAAO,CAAC,eAAuB,OAAO,EAAE;AAAA,EAC1C;AACA,MAAI,mBAAmB,gBAAgB;AACrC,UAAM,UAAU,gBAAgB,OAAO;AACvC,WAAO,CAAC,yBAAgC;AAAA,MACtC,SAAS,QAAQ;AAAA,MACjB,SAAS,UACL,iBAAiB,KAAK,OAAO,IAC7B;AAAA,MACJ,OAAO,WAAW,UACd,MAAM,kBAAkB,KAAK,EAAE,OAAO,QAAQ,MAAqB,CAAC,IACpE;AAAA,MACJ,QAAQ,MAAM,kBAAkB,KAAK,QAAQ,MAAqB;AAAA,IACpE,GAAG,EAAE;AAAA,EACP;AACA,MAAI,mBAAmB,OAAO;AAC5B,UAAM,UAAU,gBAAgB,OAAO;AACvC,WAAO,CAAC,gBAAuB;AAAA,MAC7B,aAAa,oBAAoB,OAAO;AAAA,MACxC,SAAS,QAAQ;AAAA,MACjB,SAAS,UAAU,MAAM,kBAAkB,KAAK,OAAO,IAAI;AAAA,MAC3D,OAAO,WAAW,UACd,MAAM,kBAAkB,KAAK,EAAE,OAAO,QAAQ,MAAqB,CAAC,IACpE;AAAA,IACN,GAAG,EAAE;AAAA,EACP;AACA,MAAI,WAAW,OAAO,GAAG;AACvB,UAAM,UAAU,mBAAmB,OAAO;AAC1C,WAAO,CAAC,mBAA0B;AAAA,MAChC,SAAS,UACL,MAAM,kBAAkB,KAAK,OAAsB,IACnD;AAAA,MACJ,OAAO,MAAM,kBAAkB,KAAK,MAAM,KAAK,OAAO,CAAC;AAAA,IACzD,GAAG,EAAE;AAAA,EACP;AACA,QAAM,QAAQ,QAAQ,eAAe;AACrC,MAAI,QAAQ,gBAAgB,UAAU,OAAO;AAC3C,UAAM,QAAqC,CAAC;AAC5C,UAAM,WAA6C,CAAC;AACpD,eAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,OAAO,GAAG;AACjD,UAAI,WAAW,IAAI,GAAG;AACpB,iBAAS,GAAG,IAAI;AAAA,MAClB,OAAO;AACL,cAAM,GAAG,IAAI,MAAM,kBAAkB,KAAK,IAAmB;AAAA,MAC/D;AAAA,IACF;AACA,eAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,QAAQ,GAAG;AAClD,YAAM,GAAG,IAAI,MAAM,kBAAkB,KAAK,IAAI;AAAA,IAChD;AACA,WAAO;AAAA,MACL,QAAQ,0BAAkC;AAAA,MAC1C;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,IAAI,MAAM,mBAAmB;AACrC;AAEO,SAAS,cACd,KACA,CAAC,MAAM,OAAO,EAAE,GACR;AACR,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO,mBAAmB,KAAK;AAAA,IACjC,KAAK;AACH,aAAO,YAAY,KAAK,KAAK;AAAA,IAC/B,KAAK,iBAAyB;AAC5B,UAAI;AAEJ,UAAI,mBAAmB,KAAK,KAAK,GAAG;AAKlC,qBAAa,8BAA8B,YAAY,KAAK,MAAM,CAAC,CAAC;AAAA,MACtE,OAAO;AACL,YAAI,MAAM,KAAK,EAAE;AACjB,cAAM,SAAS,cAAc,KAAK,KAAK;AACvC,YAAI,MAAM,IAAI;AAEd,qBAAa,mBAAmB;AAAA,MAClC;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA,KAAK;AACH,aAAO,UAAU,KAAK,IAAI,aAAa,MAAM,YAAY,KAAK;AAAA,IAChE,KAAK;AACH,aAAO,UAAU,KAAK,IAAI,OAAO,KAAK,CAAC;AAAA,IACzC,KAAK,qBAA4B;AAE/B,YAAM,SAAS,CAAC,GAAG,MAAM,KAAK,EAAE,IAAI,kBAAkB,EAAE,KAAK,GAAG;AAChE,UAAI,OAAO,IAAI;AACf,UAAI,MAAM,MAAM,eAAe,GAAG;AAChC,gBAAQ,IAAI,MAAM,MAAM;AAAA,MAC1B;AACA,aAAO,UAAU,KAAK,IAAI,OAAO,MAAM,eAAe,OAAO;AAAA,IAC/D;AAAA,IACA,KAAK,aAAqB;AACxB,UAAI,aAAa;AACjB,UAAI,MAAM,QAAQ;AAChB,cAAM,SAAmB,CAAC;AAC1B,YAAI,MAAM,KAAK,EAAE;AACjB,mBAAW,QAAQ,OAAO;AACxB,cAAI,mBAAmB,KAAK,IAAI,GAAG;AACjC,yBAAa,KAAK,IAAI,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC;AAAA,UACjD,OAAO;AAEL,mBAAO,KAAK,cAAc,KAAK,IAAI,CAAC;AAAA,UACtC;AAAA,QACF;AACA,YAAI,MAAM,IAAI;AACd,YAAI,OAAO,QAAQ;AACjB,wBAAc,KAAK,OAAO,KAAK,GAAG;AAAA,QACpC;AAAA,MACF;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA,KAAK,aAAqB;AACxB,UAAI,aAAa;AACjB,UAAI,MAAM,QAAQ;AAChB,cAAM,SAAmB,CAAC;AAC1B,YAAI,MAAM,KAAK,EAAE;AACjB,mBAAW,CAAC,KAAK,GAAG,KAAK,OAAO;AAE9B,cAAI,mBAAmB,KAAK,GAAG,GAAG;AAEhC,kBAAM,SAAS,YAAY,KAAK,IAAI,CAAC,CAAC;AAEtC,gBAAI,mBAAmB,KAAK,GAAG,GAAG;AAChC,oBAAM,WAAW,YAAY,KAAK,IAAI,CAAC,CAAC;AAIxC,2BAAa,KAAK,IAAI,QAAQ,QAAQ;AAAA,YACxC,OAAO;AAML,oBAAM,SAAS,IAAI;AACnB,kBAAI,QAAQ,CAAC;AACb,2BAAa,KAAK,IAAI,QAAQ,cAAc,KAAK,GAAG,CAAC;AACrD,kBAAI,QAAQ;AAAA,YACd;AAAA,UACF,WAAW,mBAAmB,KAAK,GAAG,GAAG;AAEvC,kBAAM,WAAW,YAAY,KAAK,IAAI,CAAC,CAAC;AAExC,kBAAM,SAAS,IAAI;AACnB,gBAAI,QAAQ,CAAC;AACb,yBAAa,KAAK,IAAI,cAAc,KAAK,GAAG,GAAG,QAAQ;AACvD,gBAAI,QAAQ;AAAA,UACd,OAAO;AACL,mBAAO,KAAK,IAAI,cAAc,KAAK,GAAG,KAAK,cAAc,KAAK,GAAG,IAAI;AAAA,UACvE;AAAA,QACF;AACA,YAAI,MAAM,IAAI;AAId,YAAI,OAAO,QAAQ;AACjB,wBAAc,KAAK,OAAO,KAAK,GAAG;AAAA,QACpC;AAAA,MACF;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA,KAAK,eAAuB;AAI1B,UAAI,SAAS;AAEb,UAAI,MAAM,KAAK,EAAE;AACjB,eAAS,IAAI,GAAG,MAAM,MAAM,QAAQ,IAAI,KAAK,KAAK;AAChD,cAAM,OAAO,MAAM,CAAC;AAEpB,YAAI,KAAK,OAAO;AAEd,cAAI,mBAAmB,KAAK,IAAI,GAAG;AACjC,8BAAkB,KAAK,IAAI,GAAG,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC;AACvD,sBAAU;AAAA,UACZ,OAAO;AACL,sBAAU,cAAc,KAAK,IAAI;AACjC,gBAAI,IAAI,MAAM,SAAS,GAAG;AACxB,wBAAU;AAAA,YACZ;AAAA,UACF;AAAA,QACF,OAAO;AAEL,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,MAAM,IAAI;AACd,aAAO,UAAU,KAAK,IAAI,IAAI,SAAS;AAAA,IACzC;AAAA,IACA,KAAK,yBAAgC;AAEnC,YAAM,OAAO,CAAC,cAAc,KAAK,MAAM,MAAM,GAAG,MAAM,MAAM,OAAO,CAAC;AAEpE,UAAI,MAAM,OAAO;AACf,aAAK,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC;AAAA,MAC3C;AACA,UAAI,aAAa,sBAAsB,KAAK,KAAK,GAAG;AAIpD,UAAI,MAAM,SAAS;AACjB,cAAM,UAAU,cAAc,KAAK,MAAM,OAAO;AAChD,qBAAa,iBAAiB,cAAc;AAAA,MAC9C;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA,KAAK,gBAAuB;AAC1B,YAAM,OAAO,CAAC,MAAM,MAAM,OAAO,CAAC;AAClC,UAAI,MAAM,OAAO;AACf,aAAK,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC;AAAA,MAC3C;AACA,UAAI,aAAa,OAAO,MAAM,eAAe,KAAK,KAAK,GAAG;AAC1D,UAAI,MAAM,SAAS;AACjB,cAAM,UAAU,cAAc,KAAK,MAAM,OAAO;AAChD,qBAAa,iBAAiB,cAAc;AAAA,MAC9C;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA,KAAK,mBAA0B;AAC7B,YAAM,SAAS,IAAI;AACnB,UAAI,QAAQ,CAAC;AACb,YAAM,SAAS,cAAc,KAAK,MAAM,KAAK;AAC7C,UAAI,QAAQ;AACZ,UAAI,aAAa,0BAA0B;AAC3C,UAAI,MAAM,SAAS;AACjB,YAAI,MAAM,KAAK,EAAE;AACjB,cAAM,UAAU,cAAc,KAAK,MAAM,OAAO;AAChD,YAAI,MAAM,IAAI;AACd,qBAAa,iBAAiB,cAAc;AAAA,MAC9C;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA,KAAK;AAAA,IACL,KAAK,gBAAwB;AAC3B,YAAM,SAAmB,CAAC;AAE1B,UAAI,MAAM,KAAK,EAAE;AACjB,iBAAW,CAAC,KAAK,GAAG,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC9C,cAAM,QAAQ,OAAO,GAAG;AAGxB,YACE,SAAS,KACL,OAAO,MAAM,KAAK,KAAK,0BAA0B,KAAK,GAAG,GAC7D;AACA,cAAI,mBAAmB,KAAK,GAAG,GAAG;AAChC,kBAAM,WAAW,YAAY,KAAK,IAAI,CAAC,CAAC;AACxC,gBAAI,CAAC,OAAO,MAAM,KAAK,GAAG;AACxB,yCAA2B,KAAK,IAAI,KAAK,QAAQ;AAAA,YACnD,OAAO;AACL,2CAA6B,KAAK,IAAI,KAAK,QAAQ;AAAA,YACrD;AAAA,UACF,OAAO;AACL,mBAAO,KAAK,GAAG,OAAO,cAAc,KAAK,GAAG,GAAG;AAAA,UACjD;AAAA,QACF,WAAW,mBAAmB,KAAK,GAAG,GAAG;AACvC,gBAAM,WAAW,YAAY,KAAK,IAAI,CAAC,CAAC;AACxC,qCAA2B,KAAK,IAAI,MAAM,GAAG,GAAG,QAAQ;AAAA,QAC1D,OAAO;AACL,iBAAO,KAAK,GAAG,MAAM,GAAG,KAAK,cAAc,KAAK,GAAG,GAAG;AAAA,QACxD;AAAA,MACF;AACA,UAAI,MAAM,IAAI;AACd,UAAI,aAAa,IAAI,OAAO,KAAK,GAAG;AACpC,UAAI,SAAS,yBAAiC;AAC5C,qBAAa,qCAAqC;AAAA,MACpD;AACA,aAAO,UAAU,KAAK,IAAI,UAAU;AAAA,IACtC;AAAA,IACA;AACE,YAAM,IAAI,MAAM,kBAAkB;AAAA,EACtC;AACF;;;ALl6BA,SAAS,SACP,KACA,QACA,QACA;AAEA,MAAI,IAAI,KAAK,QAAQ;AAEnB,UAAM,QAAQ,YAAY,KAAK,UAAU,KAAK,MAAM,CAAC;AACrD,UAAM,UAAU,eAAe,GAAG;AAClC,UAAM,SAAS,IAAI,KAAK,SAAS,IAC7B,IAAI,IAAI,KAAK,KAAK,GAAG,OACrB,IAAI,KAAK,CAAC;AAEd,QAAI,OAAO,WAAW,GAAG,QAAQ,GAAG;AAClC,aAAO,IAAI,YAAY,UAAU,UAAU;AAAA,IAC7C;AACA,WAAO,IAAI,YAAY,SAAS,UAAU,UAAU;AAAA,EACtD;AACA,MAAI,OAAO,gBAAgB,QAAQ;AACjC,WAAO,IAAI;AAAA,EACb;AACA,SAAO;AACT;AAEO,SAAS,UAAU,QAAqB;AAC7C,MAAI,YAAY,MAAM,GAAG;AACvB,WAAO,mBAAmB,MAAM;AAAA,EAClC;AACA,QAAM,MAAM,2BAA2B;AACvC,QAAM,OAAO,iBAAiB,KAAK,MAAM;AACzC,QAAM,SAAS,cAAc,KAAK,IAAI;AACtC,SAAO,SAAS,KAAK,QAAQ,MAAM;AACrC;AAEA,eAAsB,eAAe,QAA0B;AAC7D,MAAI,YAAY,MAAM,GAAG;AACvB,WAAO,mBAAmB,MAAM;AAAA,EAClC;AACA,QAAM,MAAM,2BAA2B;AACvC,QAAM,OAAO,MAAM,kBAAkB,KAAK,MAAM;AAChD,QAAM,SAAS,cAAc,KAAK,IAAI;AACtC,SAAO,SAAS,KAAK,QAAQ,MAAM;AACrC;AAEO,SAAS,YAAwC,QAAmB;AAEzE,UAAQ,GAAG,MAAM,MAAM;AACzB;AAEA,IAAO,cAAQ;",
+  "names": []
 }

package/dist/cjs/production/index.cjs

@@ -1,2 +1,2 @@
-"use strict";var _=Object.defineProperty;var W=Object.getOwnPropertyDescriptor;var G=Object.getOwnPropertyNames;var J=Object.prototype.hasOwnProperty;var K=(e,t)=>{for(var s in t)_(e,s,{get:t[s],enumerable:!0})},Q=(e,t,s,i)=>{if(t&&typeof t=="object"||typeof t=="function")for(let o of G(t))!J.call(e,o)&&o!==s&&_(e,o,{get:()=>t[o],enumerable:!(i=W(t,o))||i.enumerable});return e};var X=e=>Q(_({},"__esModule",{value:!0}),e);var re={};K(re,{default:()=>ne,deserialize:()=>ie,serialize:()=>B,serializeAsync:()=>se});module.exports=X(re);function A(e,t){for(let s=0,i=e.length;s<i&&!t(e[s],s);s++);}function S(e,t){let s="";return A(e,(i,o)=>{s+=i,o<e.length-1&&(s+=t)}),s}var U="hjkmoquxzABCDEFGHIJKLNPQRTUVWXYZ$_",F=U.length,Z="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789$_",H=Z.length;function Y(e){let t=e%F,s=U[t];for(e=(e-t)/F;e>0;)t=e%H,s+=Z[t],e=(e-t)/H;return s}var w="new Set",c="new Map",M="[]";function I(){return{refCount:new Map,stack:new Set,refs:new Map,assignedRefs:new Set,vars:[],assignments:[],mapSets:[],setAdds:[]}}function x(e){if(e.assignments.length){let t={};return A(e.assignments,([s,i])=>{i in t?t[i]=`${s}=${t[i]}`:t[i]=`${s}=${i}`}),`${S(Object.values(t),",")},`}return""}function ee(e){if(e.mapSets.length){let t={};return A(e.mapSets,([s,i,o])=>{s in t?t[s]=`${t[s]}.set(${i},${o})`:t[s]=`${s}.set(${i},${o})`}),`${S(Object.values(t),",")},`}return""}function te(e){if(e.setAdds.length){let t={};return A(e.setAdds,([s,i])=>{s in t?t[s]=`${t[s]}.add(${i})`:t[s]=`${s}.add(${i})`}),`${S(Object.values(t),",")},`}return""}function D(e){return`${x(e)}${ee(e)}${te(e)}`}function v(e,t){let s=e.refCount.get(t)||0;return e.refCount.set(t,s+1),s===0}function $(e,t){return e.constructor===t}function u(e,t){let s=e.refs.get(t);if(s!=null)return s;let i=e.refs.size;return e.refs.set(t,i),i}function l(e,t){if(e.vars[t])return e.vars[t];let s=Y(t);return e.vars[t]=s,s}function T(e,t,s){return`${l(e,t)}=${s}`}function q(e,t,s){e.assignments.push([t,s])}function j(e,t,s){e.setAdds.push([l(e,t),s])}function R(e,t,s,i){e.mapSets.push([l(e,t),s,i])}function E(e,t,s,i){q(e,`${l(e,t)}[${s}]`,i)}function O(e,t,s,i){q(e,`${l(e,t)}.${s}`,i)}function z(e,t,s,i){q(e,`${l(e,t)}[${s}]`,i)}function h(e){if(!e||e===!0)return!0;let t=typeof e,s=e.constructor;return t==="number"||t==="string"||t==="bigint"||s===Date||s===RegExp}function N(e){return!!e&&(typeof e=="object"||typeof e=="function")&&"then"in e&&typeof e.then=="function"}function y(e){let t="",s=0;for(let i=0,o=e.length;i<o;i++){let g;switch(e[i]){case'"':g='\\"';break;case"\\":g="\\\\";break;case"<":g="\\x3C";break;case`
-`:g="\\n";break;case"\r":g="\\r";break;case"\u2028":g="\\u2028";break;case"\u2029":g="\\u2029";break;default:continue}t+=e.slice(s,i)+g,s=i+1}return s===0?t=e:t+=e.slice(s),`"${t}"`}function b(e){return e===!0?"!0":e===!1?"!1":e===void 0?"void 0":e===null?"null":Object.is(e,-0)?"-0":typeof e=="bigint"?`BigInt("${e}")`:typeof e=="string"?y(e):e.constructor===Date?`new Date("${e.toISOString()}")`:String(e)}async function P(e,t){if(!h(t)){if(N(t))v(e,t)&&await t.then(s=>P(e,s));else if(Array.isArray(t)){if(v(e,t))for(let s of t)await P(e,s)}else if($(t,Set)){if(v(e,t))for(let s of t.keys())await P(e,s)}else if($(t,Map)){if(v(e,t))for(let[s,i]of t.entries())await P(e,s),await P(e,i)}else if((t.constructor===Object||t.constructor==null)&&v(e,t))for(let s of Object.values(t))await P(e,s)}}async function d(e,t){if(h(t))return b(t);let s=e.refs.get(t);if(s!=null){if(e.assignedRefs.has(s))return l(e,s);e.assignedRefs.add(s)}function i(){return s==null&&(s=u(e,t)),s}function o(n){return s!=null?T(e,s,n):n}if(N(t))return t.then(async n=>{e.stack.add(t);let r;return e.stack.has(n)?r=`Promise.resolve().then(()=>${l(e,u(e,n))})`:r=`Promise.resolve(${await d(e,n)})`,e.stack.delete(t),o(r)});if($(t,Set)){if(t.size){let n=[];e.stack.add(t);for(let r of t.keys())e.stack.has(r)?j(e,i(),l(e,u(e,r))):n.push(await d(e,r));return e.stack.delete(t),o(n.length?`new Set([${S(n,",")}])`:w)}return w}if($(t,Map)){if(t.size){let n=[];e.stack.add(t);for(let[r,a]of t.entries())if(e.stack.has(r)){let f=i(),m=l(e,u(e,r));if(e.stack.has(a)){let p=l(e,u(e,a));R(e,f,m,p)}else{let p=await d(e,a);R(e,f,m,p)}}else if(e.stack.has(a)){let f=l(e,u(e,a)),m=await d(e,r);R(e,i(),m,f)}else{let f=await d(e,r),m=await d(e,a);n.push(`[${f},${m}]`)}return e.stack.delete(t),o(n.length?`new Map([${S(n,",")}])`:c)}return c}if(Array.isArray(t)){if(t.length){let n="";e.stack.add(t);for(let r=0,a=t.length;r<a;r+=1)if(r in t){let f=t[r];if(e.stack.has(f)){let m=l(e,u(e,f));E(e,i(),r,m),n+=","}else n+=await d(e,f),r<t.length-1&&(n+=",")}else n+=",";return e.stack.delete(t),o(`[${n}]`)}return M}let g=t.constructor==null;if(t.constructor===Object||g){let n=[];e.stack.add(t);for(let[a,f]of Object.entries(t)){let m=Number(a);if(m>=0||Number.isNaN(m)&&/^([$A-Z_][0-9A-Z_$]*)$/i.test(a))if(e.stack.has(f)){let p=i(),V=l(e,u(e,f));Number.isNaN(m)?O(e,p,a,V):z(e,p,a,V)}else{let p=await d(e,f);n.push(`${a}:${p}`)}else if(e.stack.has(f)){let p=l(e,u(e,f));z(e,i(),y(a),p)}else{let p=await d(e,f);n.push(`${y(a)}:${p}`)}}e.stack.delete(t);let r=`{${S(n,",")}}`;return o(g?`Object.assign(Object.create(null),${r})`:r)}throw new Error("Unserializable value")}function C(e,t){if(!h(t))if(Array.isArray(t))v(e,t)&&A(t,s=>{C(e,s)});else if($(t,Set)){if(v(e,t))for(let s of t.keys())C(e,s)}else if($(t,Map)){if(v(e,t))for(let[s,i]of t.entries())C(e,s),C(e,i)}else(t.constructor===Object||t.constructor==null)&&v(e,t)&&A(Object.values(t),s=>{C(e,s)})}function k(e,t){if(h(t))return b(t);let s=e.refs.get(t);if(s!=null){if(e.assignedRefs.has(s))return l(e,s);e.assignedRefs.add(s)}function i(){return s==null&&(s=u(e,t)),s}function o(n){return s!=null?T(e,s,n):n}if($(t,Set)){if(t.size){let n=[];e.stack.add(t);for(let r of t.keys())e.stack.has(r)?j(e,i(),l(e,u(e,r))):n.push(k(e,r));return e.stack.delete(t),o(n.length?`new Set([${S(n,",")}])`:w)}return w}if($(t,Map)){if(t.size){let n=[];e.stack.add(t);for(let[r,a]of t.entries())if(e.stack.has(r)){let f=i(),m=l(e,u(e,r));if(e.stack.has(a)){let p=l(e,u(e,a));R(e,f,m,p)}else R(e,f,m,k(e,a))}else if(e.stack.has(a)){let f=l(e,u(e,a));R(e,i(),k(e,r),f)}else n.push(`[${k(e,r)},${k(e,a)}]`);return e.stack.delete(t),o(n.length?`new Map([${S(n,",")}])`:c)}return c}if(Array.isArray(t)){if(t.length){let n="";return e.stack.add(t),A(t,(r,a)=>{if(a in t)if(e.stack.has(r)){let f=l(e,u(e,r));E(e,i(),a,f),n+=","}else n+=k(e,r),a<t.length-1&&(n+=",");else n+=","}),e.stack.delete(t),o(`[${n}]`)}return M}let g=t.constructor==null;if(t.constructor===Object||g){let n=[];e.stack.add(t),A(Object.entries(t),([a,f])=>{let m=Number(a);if(m>=0||Number.isNaN(m)&&/^([$A-Z_][0-9A-Z_$]*)$/i.test(a))if(e.stack.has(f)){let p=i(),V=l(e,u(e,f));Number.isNaN(m)?O(e,p,a,V):z(e,p,a,V)}else n.push(`${a}:${k(e,f)}`);else if(e.stack.has(f)){let p=l(e,u(e,f));z(e,i(),y(a),p)}else n.push(`${y(a)}:${k(e,f)}`)}),e.stack.delete(t);let r=`{${S(n,",")}}`;return o(g?`Object.assign(Object.create(null),${r})`:r)}throw new Error("Unserializable value")}function L(e,t,s){if(e.vars.length){let i=l(e,u(e,t)),o=D(e),g=e.vars.length>1?`(${S(e.vars,",")})`:e.vars[0];return s.startsWith(`${i}=`)?`(${g}=>(${s},${o}${i}))()`:`(${g}=>(${i}=${s},${o}${i}))()`}return t.constructor===Object?`(${s})`:s}function B(e){if(h(e))return b(e);let t=I();C(t,e);for(let[i,o]of t.refCount.entries())o>1&&u(t,i);let s=k(t,e);if(typeof s!="string")throw new Error("Unreachable error");return L(t,e,s)}async function se(e){if(h(e))return b(e);let t=I();await P(t,e);for(let[i,o]of t.refCount.entries())o>1&&u(t,i);let s=await d(t,e);if(typeof s!="string")throw new Error("Unreachable error");return L(t,e,s)}function ie(e){return(0,eval)(e)}var ne=B;
+"use strict";var R=Object.defineProperty;var q=Object.getOwnPropertyDescriptor;var Z=Object.getOwnPropertyNames;var K=Object.prototype.hasOwnProperty;var W=(e,r)=>{for(var n in r)R(e,n,{get:r[n],enumerable:!0})},X=(e,r,n,t)=>{if(r&&typeof r=="object"||typeof r=="function")for(let i of Z(r))!K.call(e,i)&&i!==n&&R(e,i,{get:()=>r[i],enumerable:!(t=q(r,i))||t.enumerable});return e};var Y=e=>X(R({},"__esModule",{value:!0}),e);var ae={};W(ae,{default:()=>se,deserialize:()=>te,serialize:()=>L,serializeAsync:()=>oe});module.exports=Y(ae);function k(e){if(!e||e===!0)return!0;let r=typeof e;return r==="number"||r==="string"||r==="bigint"}function C(e){return!!e&&(typeof e=="object"||typeof e=="function")&&"then"in e&&typeof e.then=="function"}function u(e,r){return e.constructor===r}function G(e){return Array.isArray(e)||u(e,Set)||u(e,Map)}function c(e){return!!e&&typeof e=="object"&&!G(e)&&Symbol.iterator in e&&typeof e[Symbol.iterator]=="function"}function v(e){let r="",n=0;for(let t=0,i=e.length;t<i;t++){let o;switch(e[t]){case'"':o='\\"';break;case"\\":o="\\\\";break;case"<":o="\\x3C";break;case`
+`:o="\\n";break;case"\r":o="\\r";break;case"\u2028":o="\\u2028";break;case"\u2029":o="\\u2029";break;default:continue}r+=e.slice(n,t)+o,n=t+1}return n===0?r=e:r+=e.slice(n),`"${r}"`}function N(e){return e===!0?"!0":e===!1?"!1":e===void 0?"void 0":e===null?"null":typeof e=="bigint"?`${e}n`:typeof e=="string"?v(e):Object.is(e,-0)?"-0":Object.is(e,1/0)?"1/0":Object.is(e,-1/0)?"-1/0":String(e)}var O="hjkmoquxzABCDEFGHIJKLNPQRTUVWXYZ$_",z=O.length,j="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789$_",I=j.length;function $(e){let r=e%z,n=O[r];for(e=(e-r)/z;e>0;)r=e%I,n+=j[r],e=(e-r)/I;return n}function E(){return{markedRefs:[],stack:[],refs:new Map,vars:[],assignments:[],validRefs:new Map}}function T(e){switch(e.type){case"index":return`${e.source}=${e.value}`;case"map":return`${e.source}.set(${e.key},${e.value})`;case"set":return`${e.source}.add(${e.value})`;default:return""}}function J(e){let r=[],n=e.assignments[0],t=n;for(let i=1,o=e.assignments.length;i<o;i+=1){let s=e.assignments[i];s.type===t.type?s.type==="index"&&s.value===t.value?n={type:"index",source:s.source,value:T(n)}:s.type==="map"&&s.source===t.source?n={type:"map",source:T(n),key:s.key,value:s.value}:s.type==="set"&&s.source===t.source?n={type:"set",source:T(n),value:s.value}:(r.push(n),n=s):(r.push(n),n=s),t=s}return r.push(n),r}function M(e){if(e.assignments.length){let r="";for(let n of J(e))r+=`${T(n)},`;return r}return""}function b(e,r){e.markedRefs[r]=!0}function _(e,r){let n=e.refs.get(r);if(n!=null)return n;let t=e.refs.size;return e.refs.set(r,t),t}function Q(e,r){let n=e.validRefs.get(r);if(n!=null)return n;let t=e.validRefs.size;return e.validRefs.set(r,t),t}function d(e,r){let n=Q(e,r);if(e.vars[n])return e.vars[n];let t=$(n);return e.vars[n]=t,t}function S(e,r,n){return e.markedRefs[r]?`${d(e,r)}=${n}`:n}function w(e,r,n){e.assignments.push({type:"index",source:r,value:n})}function x(e,r,n){b(e,r),e.assignments.push({type:"set",source:d(e,r),value:n})}function V(e,r,n,t){b(e,r),e.assignments.push({type:"map",source:d(e,r),key:n,value:t})}function ee(e,r,n,t){b(e,r),w(e,`${d(e,r)}[${n}]`,t)}function re(e,r,n,t){b(e,r),w(e,`${d(e,r)}.${n}`,t)}function U(e,r,n,t){b(e,r),w(e,`${d(e,r)}[${n}]`,t)}function P(e){return e instanceof EvalError?"EvalError":e instanceof RangeError?"RangeError":e instanceof ReferenceError?"ReferenceError":e instanceof SyntaxError?"SyntaxError":e instanceof TypeError?"TypeError":e instanceof URIError?"URIError":"Error"}var ne={name:!0,cause:!0,stack:!0,message:!0};function h(e){let r,n=P(e);e.name!==n?r={name:e.name}:e.constructor.name!==n&&(r={name:e.constructor.name});let t=Object.getOwnPropertyNames(e);for(let i of t)i in ne||(r=r||{},r[i]=e[i]);return r}function D(e){let r=Object.getOwnPropertyNames(e);if(r.length){let n={};for(let t of r)n[t]=e[t];return n}}function g(e,r){return r[0]===1&&e.stack.includes(r[1])}function F(e,r){if(e.refs.has(r)){let i=e.refs.get(r)||0;return b(e,i),[1,i]}let t=e.refs.size;return e.refs.set(r,t),t}function B(e,r){if(u(e,Date))return[2,e,r];if(u(e,RegExp))return[3,e,r];if(u(e,Int8Array))return[13,{constructor:"Int8Array",array:e},r];if(u(e,Int16Array))return[13,{constructor:"Int16Array",array:e},r];if(u(e,Int32Array))return[13,{constructor:"Int32Array",array:e},r];if(u(e,Uint8Array))return[13,{constructor:"Uint8Array",array:e},r];if(u(e,Uint16Array))return[13,{constructor:"Uint16Array",array:e},r];if(u(e,Uint32Array))return[13,{constructor:"Uint32Array",array:e},r];if(u(e,Uint8ClampedArray))return[13,{constructor:"Uint8ClampedArray",array:e},r];if(u(e,Float32Array))return[13,{constructor:"Float32Array",array:e},r];if(u(e,Float64Array))return[13,{constructor:"Float64Array",array:e},r];if(u(e,BigInt64Array))return[13,{constructor:"BigInt64Array",array:e},r];if(u(e,BigUint64Array))return[13,{constructor:"BigUint64Array",array:e},r]}function f(e,r){if(k(r))return[0,r];let n=F(e,r);if(Array.isArray(n))return n;let t=B(r,n);if(t)return t;if(u(r,Set)){let o=[],s=[];for(let a of r.keys())c(a)?s.push(a):o.push(f(e,a));for(let a of s)o.push(f(e,a));return[4,o,n]}if(u(r,Map)){let o=[],s=[];for(let[a,l]of r.entries())if(c(a)||c(l))s.push([a,l]);else{let m=f(e,a),A=f(e,l);o.push([m,A])}for(let[a,l]of s){let m=f(e,a),A=f(e,l);o.push([m,A])}return[5,o,n]}if(Array.isArray(r)){let o=new Array(r.length),s=new Array(r.length);for(let a in r){let l=r[a];c(l)?s[a]=l:o[a]=f(e,l)}for(let a in s)o[a]=f(e,s[a]);return[6,o,n]}if(r instanceof AggregateError){let o=h(r);return[11,{message:r.message,options:o?f(e,o):void 0,cause:"cause"in r?f(e,{cause:r.cause}):void 0,errors:f(e,r.errors)},n]}if(r instanceof Error){let o=h(r);return[10,{constructor:P(r),message:r.message,options:o?f(e,o):void 0,cause:"cause"in r?f(e,{cause:r.cause}):void 0},n]}if(c(r)){let o=D(r);return[12,{options:o?f(e,o):void 0,items:f(e,Array.from(r))},n]}let i=r.constructor==null;if(r.constructor===Object||i){let o={},s={};for(let[a,l]of Object.entries(r))c(l)?s[a]=l:o[a]=f(e,l);for(let[a,l]of Object.entries(s))o[a]=f(e,l);return[i?8:7,o,n]}throw new Error("Unsupported value")}async function p(e,r){if(k(r))return[0,r];let n=F(e,r);if(Array.isArray(n))return n;let t=B(r,n);if(t)return t;if(C(r))return r.then(async o=>[9,await p(e,o),n]);if(u(r,Set)){let o=[],s=[];for(let a of r.keys())c(a)?s.push(a):o.push(await p(e,a));for(let a of s)o.push(await p(e,a));return[4,o,n]}if(u(r,Map)){let o=[],s=[];for(let[a,l]of r.entries())if(c(a)||c(l))s.push([a,l]);else{let m=await p(e,a),A=await p(e,l);o.push([m,A])}for(let[a,l]of s){let m=await p(e,a),A=await p(e,l);o.push([m,A])}return[5,o,n]}if(Array.isArray(r)){let o=new Array(r.length),s=new Array(r.length);for(let a in r){let l=r[a];c(l)?s[a]=l:o[a]=await p(e,l)}for(let a in s)o[a]=await p(e,s[a]);return[6,o,n]}if(r instanceof AggregateError){let o=h(r);return[11,{message:r.message,options:o?f(e,o):void 0,cause:"cause"in r?await p(e,{cause:r.cause}):void 0,errors:await p(e,r.errors)},n]}if(r instanceof Error){let o=h(r);return[10,{constructor:P(r),message:r.message,options:o?await p(e,o):void 0,cause:"cause"in r?await p(e,{cause:r.cause}):void 0},n]}if(c(r)){let o=D(r);return[12,{options:o?await p(e,o):void 0,items:await p(e,Array.from(r))},n]}let i=r.constructor==null;if(r.constructor===Object||i){let o={},s={};for(let[a,l]of Object.entries(r))c(l)?s[a]=l:o[a]=await p(e,l);for(let[a,l]of Object.entries(s))o[a]=await p(e,l);return[i?8:7,o,n]}throw new Error("Unsupported value")}function y(e,[r,n,t]){switch(r){case 0:return N(n);case 1:return d(e,n);case 9:{let i;if(g(e,n))i=`Promise.resolve().then(()=>${d(e,n[1])})`;else{e.stack.push(t);let o=y(e,n);e.stack.pop(),i=`Promise.resolve(${o})`}return S(e,t,i)}case 2:return S(e,t,`new Date("${n.toISOString()}")`);case 3:return S(e,t,String(n));case 13:{let o=`[${[...n.array].map(N).join(",")}]`;return n.array.byteOffset!==0&&(o+=`,${n.array.byteOffset}`),S(e,t,`new ${n.constructor}(${o})`)}case 4:{let i="new Set";if(n.length){let o=[];e.stack.push(t);for(let s of n)g(e,s)?x(e,t,d(e,s[1])):o.push(y(e,s));e.stack.pop(),o.length&&(i+=`([${o.join(",")}])`)}return S(e,t,i)}case 5:{let i="new Map";if(n.length){let o=[];e.stack.push(t);for(let[s,a]of n)if(g(e,s)){let l=d(e,s[1]);if(g(e,a)){let m=d(e,a[1]);V(e,t,l,m)}else{let m=e.stack;e.stack=[],V(e,t,l,y(e,a)),e.stack=m}}else if(g(e,a)){let l=d(e,a[1]),m=e.stack;e.stack=[],V(e,t,y(e,s),l),e.stack=m}else o.push(`[${y(e,s)},${y(e,a)}]`);e.stack.pop(),o.length&&(i+=`([${o.join(",")}])`)}return S(e,t,i)}case 6:{let i="";e.stack.push(t);for(let o=0,s=n.length;o<s;o++){let a=n[o];o in n?g(e,a)?(ee(e,t,o,d(e,a[1])),i+=","):(i+=y(e,a),o<n.length-1&&(i+=",")):i+=","}return e.stack.pop(),S(e,t,`[${i}]`)}case 11:{let i=[y(e,n.errors),v(n.message)];n.cause&&i.push(y(e,n.cause));let o=`new AggregateError(${i.join(",")})`;if(n.options){let s=y(e,n.options);o=`Object.assign(${o},${s})`}return S(e,t,o)}case 10:{let i=[v(n.message)];n.cause&&i.push(y(e,n.cause));let o=`new ${n.constructor}(${i.join(",")})`;if(n.options){let s=y(e,n.options);o=`Object.assign(${o},${s})`}return S(e,t,o)}case 12:{let i=e.stack;e.stack=[];let o=y(e,n.items);e.stack=i;let s=`{[Symbol.iterator]:()=>${o}.values()}`;if(n.options){e.stack.push(t);let a=y(e,n.options);e.stack.pop(),s=`Object.assign(${s},${a})`}return S(e,t,s)}case 8:case 7:{let i=[];e.stack.push(t);for(let[s,a]of Object.entries(n)){let l=Number(s);if(l>=0||Number.isNaN(l)&&/^([$A-Z_][0-9A-Z_$]*)$/i.test(s))if(g(e,a)){let m=d(e,a[1]);Number.isNaN(l)?re(e,t,s,m):U(e,t,s,m)}else i.push(`${s}:${y(e,a)}`);else if(g(e,a)){let m=d(e,a[1]);U(e,t,v(s),m)}else i.push(`${v(s)}:${y(e,a)}`)}e.stack.pop();let o=`{${i.join(",")}}`;return r===8&&(o=`Object.assign(Object.create(null),${o})`),S(e,t,o)}default:throw new Error("Unsupported type")}}function H(e,r,n){if(e.vars.length){let t=d(e,_(e,r)),i=M(e),o=e.vars.length>1?`(${e.vars.join(",")})`:e.vars[0];return n.startsWith(`${t}=`)?`(${o}=>(${n},${i}${t}))()`:`(${o}=>(${t}=${n},${i}${t}))()`}return r.constructor===Object?`(${n})`:n}function L(e){if(k(e))return N(e);let r=E(),n=f(r,e),t=y(r,n);return H(r,e,t)}async function oe(e){if(k(e))return N(e);let r=E(),n=await p(r,e),t=y(r,n);return H(r,e,t)}function te(e){return(0,eval)(e)}var se=L;