experimental-a2 0.7.0 → 0.8.0

package/dist/store-redis-core-DEYO8Ryv.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"store-redis-core-DEYO8Ryv.js","names":[],"sources":["../src/store-redis-core.ts"],"sourcesContent":["/**\n * The shared Redis store core — every operation except `stream` and\n * `close`, expressed over one injected `call` function so both\n * transports reuse it: `store-redis` (Redis protocol via `ioredis`) and\n * `store-redis-http` (provider REST APIs).\n *\n * The stream IS the store: each event is a stream entry whose ID is its\n * dense a2 index (`${index}-0`), so `XRANGE` is the catch-up read.\n * Mutable drain/failure bookkeeping lives in a side hash (stream\n * entries are immutable); every write path is one atomic Lua script.\n * The conformance suite in test/conformance is the executable\n * contract, run against a real spawned `redis-server`.\n *\n * Timestamps and claim expiry come from the injected clock so tests\n * can time-travel against a real server. Cluster mode is out: the\n * atomic scripts span keys.\n */\n\nimport type { PresencePatch } from './contract.ts'\nimport { A2Error } from './errors.ts'\nimport { idempotentReplay } from './idempotent-replay.ts'\nimport { nullProtoRecord } from './internal.ts'\nimport { decodeReturnedEventIds } from './store-codec.ts'\nimport type {\n  A2Store,\n  Clock,\n  CompleteAttemptResult,\n  Event,\n  EventCause,\n  IdSource,\n  StoreClaimAvailableResult,\n  PresenceRow,\n  StoredEvent,\n} from './store.ts'\n\n/** Issues any Redis command; the seam both transports implement. */\nexport type RedisCall = (\n  command: string,\n  ...args: Array<string | number>\n) => Promise<unknown>\n\nexport type RedisStoreCoreOptions = {\n  call: RedisCall\n  clock: Clock\n  ids: IdSource\n  keyPrefix: string\n  /**\n   * Disposable wake-up fired after a write appends new events to a\n   * watched session — `count` is the session's new event count. The\n   * watched check runs inside the write script, so unwatched sessions\n   * cost no wake-up command at all. Losing one is harmless: live\n   * feeds re-read on a safety cadence, so notifications only affect\n   * latency, never delivery.\n   */\n  notify?: (sessionId: string, count: number) => void\n}\n\nexport type RedisStoreCore = Omit<A2Store, 'stream' | 'presence'> & {\n  /**\n   * The storage half of the presence capability, shared by both\n   * transports. `set` returns the applied patch — null when every\n   * field lost the LWW race — so a push-capable transport broadcasts\n   * exactly what `read` now reflects; delivery is its business.\n   */\n  presence: {\n    set(\n      ns: string,\n      participant: string,\n      values: Record<string, unknown | null>,\n      meta: { seen: number; at: Date; ttlMs: number },\n    ): Promise<PresencePatch | null>\n    read(ns: string): Promise<PresenceRow[]>\n  }\n  /** XRANGE + meta merge — the full-row catch-up read. */\n  readRange(\n    sessionId: string,\n    afterIndex: number,\n    throughIndex?: number,\n  ): Promise<StoredEvent[]>\n  /** XRANGE only — the light catch-up read live feeds use. */\n  readEvents(sessionId: string, afterIndex: number): Promise<Event[]>\n  /**\n   * Declare the session watched for `ttlMs` — writes publish wake-ups\n   * only while this presence marker lives. Live feeds refresh it\n   * ahead of expiry; an expired marker degrades latency to the safety\n   * cadence, never delivery.\n   */\n  markWatched(sessionId: string, ttlMs: number): Promise<void>\n}\n\nconst READ_PAGE_SIZE = 256\n\n// ── Lua scripts (each runs atomically) ───────────────────────────────\n\n/**\n * KEYS: store stream, counter, global id hash, metadata, pending, ready,\n * watched.\n * ARGV: sessionId, nowMs, n, then per event:\n * id, type, payloadJson, causeJson, lane, settled.\n * Returns ['empty', hasPending] | ['ok', firstIndex, hasPending, watched] |\n * ['dup', hasPending, ...indexes] | ['partial', count] |\n * ['foreign', eventId] | ['no_parent', idx] | ['superseded', idx].\n */\nconst APPEND_LUA = `\nlocal function lane_field(lane, suffix)\n  return '__lane:' .. tostring(string.len(lane)) .. ':' .. lane .. ':' .. suffix\nend\nlocal function enqueue(field, idx, lane)\n  redis.call('ZADD', KEYS[5], idx, field)\n  if lane == '' then\n    redis.call('ZADD', KEYS[6], idx, field)\n    return\n  end\n  local tail_key = lane_field(lane, 'tail')\n  local tail = redis.call('HGET', KEYS[4], tail_key)\n  if tail then\n    redis.call('HSET', KEYS[4], tail .. ':next', field)\n  else\n    redis.call('HSET', KEYS[4], lane_field(lane, 'head'), field)\n    redis.call('ZADD', KEYS[6], idx, field)\n  end\n  redis.call('HSET', KEYS[4], tail_key, field)\nend\nlocal n = tonumber(ARGV[3])\nlocal base = tonumber(redis.call('GET', KEYS[2]) or '0')\nlocal has_pending = redis.call('ZCARD', KEYS[5]) > 0 and '1' or '0'\nif n == 0 then return { 'empty', has_pending } end\nlocal dups = {}\nfor i = 1, n do\n  local id = ARGV[3 + (i - 1) * 6 + 1]\n  local existing = redis.call('HGET', KEYS[3], id)\n  if existing then\n    local rec = cjson.decode(existing)\n    if rec[1] ~= ARGV[1] then return { 'foreign', id } end\n    dups[#dups + 1] = tostring(rec[2])\n  end\nend\nif #dups == n then\n  local res = { 'dup', has_pending }\n  for i = 1, #dups do res[#res + 1] = dups[i] end\n  return res\nend\nif #dups > 0 then return { 'partial', tostring(#dups) } end\nfor i = 1, n do\n  local cause = ARGV[3 + (i - 1) * 6 + 4]\n  if cause ~= '' then\n    local parsed = cjson.decode(cause)\n    local pidx = tonumber(parsed.index)\n    if pidx < 1 or pidx > base then\n      return { 'no_parent', tostring(parsed.index) }\n    end\n    local field = tostring(pidx)\n    local dispatches = tonumber(redis.call('HGET', KEYS[4], field .. ':d') or '0')\n    if dispatches ~= tonumber(parsed.attempt) or\n       redis.call('HEXISTS', KEYS[4], field .. ':f') == 1 then\n      return { 'superseded', field }\n    end\n  end\nend\nfor i = 1, n do\n  local id = ARGV[3 + (i - 1) * 6 + 1]\n  local typ = ARGV[3 + (i - 1) * 6 + 2]\n  local payload = ARGV[3 + (i - 1) * 6 + 3]\n  local cause = ARGV[3 + (i - 1) * 6 + 4]\n  local lane = ARGV[3 + (i - 1) * 6 + 5]\n  local settled = ARGV[3 + (i - 1) * 6 + 6]\n  local idx = base + i\n  redis.call('XADD', KEYS[1], tostring(idx) .. '-0',\n    'id', id, 'type', typ, 'payload', payload, 'created_at', ARGV[2],\n    'cause', cause, 'lane', lane)\n  redis.call('HSET', KEYS[3], id, cjson.encode({ ARGV[1], idx }))\n  redis.call('HSET', KEYS[4], tostring(idx) .. ':l', lane)\n  if settled == '1' then\n    redis.call('HSET', KEYS[4], tostring(idx) .. ':p', ARGV[2])\n  else\n    enqueue(tostring(idx), idx, lane)\n  end\nend\nredis.call('SET', KEYS[2], tostring(base + n))\nhas_pending = redis.call('ZCARD', KEYS[5]) > 0 and '1' or '0'\nreturn { 'ok', tostring(base + 1), has_pending,\n  tostring(redis.call('EXISTS', KEYS[7])) }\n`\n\n/** KEYS: counter, meta, pending, ready. ARGV: idx, attempt, error, maxFailures, nowMs. */\nconst FAIL_ATTEMPT_LUA = `\nlocal function lane_field(lane, suffix)\n  return '__lane:' .. tostring(string.len(lane)) .. ':' .. lane .. ':' .. suffix\nend\nlocal function settle(field)\n  redis.call('ZREM', KEYS[3], field)\n  redis.call('ZREM', KEYS[4], field)\n  local lane = redis.call('HGET', KEYS[2], field .. ':l') or ''\n  if lane == '' then return end\n  local head_key = lane_field(lane, 'head')\n  if redis.call('HGET', KEYS[2], head_key) ~= field then return end\n  local next_field = redis.call('HGET', KEYS[2], field .. ':next')\n  while next_field and redis.call('HEXISTS', KEYS[2], next_field .. ':p') == 1 do\n    next_field = redis.call('HGET', KEYS[2], next_field .. ':next')\n  end\n  if next_field then\n    redis.call('HSET', KEYS[2], head_key, next_field)\n    if redis.call('HEXISTS', KEYS[2], next_field .. ':f') == 0 then\n      redis.call('ZADD', KEYS[4], tonumber(next_field), next_field)\n    end\n  else\n    redis.call('HDEL', KEYS[2], head_key, lane_field(lane, 'tail'))\n  end\nend\nlocal idx = tonumber(ARGV[1])\nif idx < 1 or idx > tonumber(redis.call('GET', KEYS[1]) or '0') then\n  return { 'missing', '0' }\nend\nlocal field = ARGV[1]\nlocal failures = tonumber(redis.call('HGET', KEYS[2], field .. ':a') or '0')\nlocal dispatches = tonumber(redis.call('HGET', KEYS[2], field .. ':d') or '0')\nif redis.call('HEXISTS', KEYS[2], field .. ':p') == 1 or dispatches ~= tonumber(ARGV[2]) then\n  return { 'superseded', tostring(failures) }\nend\nif redis.call('HEXISTS', KEYS[2], field .. ':f') == 1 then\n  return { 'dead_lettered', tostring(failures) }\nend\nif redis.call('HEXISTS', KEYS[2], field .. ':lfa') == 1 and\n   tonumber(redis.call('HGET', KEYS[2], field .. ':lfa')) == tonumber(ARGV[2]) and\n   redis.call('HEXISTS', KEYS[2], field .. ':ch') == 0 then\n  return { 'failed', tostring(failures) }\nend\nif redis.call('HEXISTS', KEYS[2], field .. ':ch') == 0 then\n  return { 'superseded', tostring(failures) }\nend\nfailures = redis.call('HINCRBY', KEYS[2], field .. ':a', 1)\nredis.call('HSET', KEYS[2],\n  field .. ':e', ARGV[3],\n  field .. ':lf', ARGV[5],\n  field .. ':lfa', ARGV[2])\nredis.call('HDEL', KEYS[2], field .. ':ch', field .. ':ce')\nif failures >= tonumber(ARGV[4]) then\n  redis.call('HSET', KEYS[2], field .. ':f', ARGV[5])\n  redis.call('ZREM', KEYS[4], field)\n  return { 'dead_lettered', tostring(failures) }\nend\nreturn { 'failed', tostring(failures) }\n`\n\n/**\n * KEYS: store, counter, meta, pending, ready.\n * ARGV: holder, nowMs, expiresAtMs, excludedCount, excluded indexes.\n */\nconst CLAIM_AVAILABLE_LUA = `\nif redis.call('ZCARD', KEYS[4]) == 0 then return { 'settled' } end\nlocal ready = redis.call('ZRANGE', KEYS[5], 0, -1)\nlocal excluded = {}\nfor i = 1, tonumber(ARGV[4]) do excluded[ARGV[4 + i]] = true end\nlocal claimed = {}\nlocal retry_at = nil\nfor _, field in ipairs(ready) do\n  if not excluded[field] then\n    local expires = tonumber(redis.call('HGET', KEYS[3], field .. ':ce') or '0')\n    if expires > tonumber(ARGV[2]) then\n      if not retry_at or expires < retry_at then retry_at = expires end\n    else\n      local entries = redis.call('XRANGE', KEYS[1], field .. '-0', field .. '-0')\n      if #entries == 0 then return { 'missing', field } end\n      local attempt = redis.call('HINCRBY', KEYS[3], field .. ':d', 1)\n      redis.call('HSETNX', KEYS[3], field .. ':fc', ARGV[2])\n      redis.call('HSET', KEYS[3],\n        field .. ':lc', ARGV[2],\n        field .. ':ch', ARGV[1],\n        field .. ':ce', ARGV[3])\n      claimed[#claimed + 1] = {\n        tostring(attempt),\n        redis.call('HGET', KEYS[3], field .. ':a') or '0',\n        redis.call('HGET', KEYS[3], field .. ':e') or false,\n        redis.call('HGET', KEYS[3], field .. ':fc') or false,\n        ARGV[2],\n        redis.call('HGET', KEYS[3], field .. ':lf') or false,\n        redis.call('HGET', KEYS[3], field .. ':lfa') or false,\n        ARGV[1],\n        ARGV[3],\n        entries[1]\n      }\n    end\n  end\nend\nif #claimed > 0 then\n  local result = { 'claimed', tostring(#claimed) }\n  for _, claim in ipairs(claimed) do\n    for _, value in ipairs(claim) do result[#result + 1] = value end\n  end\n  return result\nend\nif retry_at then return { 'busy', tostring(retry_at) } end\nreturn { 'settled' }\n`\n\n/**\n * KEYS: counter, meta.\n * ARGV: holder, nowMs, expiresAtMs, n, then per claim: index, attempt.\n * Returns [renewedCount, ...renewed, ...superseded].\n */\nconst RENEW_CLAIMS_LUA = `\nlocal total = tonumber(redis.call('GET', KEYS[1]) or '0')\nlocal renewed = {}\nlocal superseded = {}\nfor i = 1, tonumber(ARGV[4]) do\n  local field = ARGV[4 + (i - 1) * 2 + 1]\n  local attempt = tonumber(ARGV[4 + (i - 1) * 2 + 2])\n  local idx = tonumber(field)\n  if idx >= 1 and idx <= total then\n    local dispatches = tonumber(redis.call('HGET', KEYS[2], field .. ':d') or '0')\n    if dispatches > attempt then\n      superseded[#superseded + 1] = field\n    else\n      local expires = tonumber(redis.call('HGET', KEYS[2], field .. ':ce') or '0')\n      if tonumber(ARGV[3]) > tonumber(ARGV[2]) and\n         redis.call('HEXISTS', KEYS[2], field .. ':p') == 0 and\n         redis.call('HEXISTS', KEYS[2], field .. ':f') == 0 and\n         redis.call('HGET', KEYS[2], field .. ':ch') == ARGV[1] and\n         expires > tonumber(ARGV[2]) then\n        redis.call('HSET', KEYS[2], field .. ':ce', ARGV[3])\n        renewed[#renewed + 1] = field\n      end\n    end\n  end\nend\nlocal result = { tostring(#renewed) }\nfor i = 1, #renewed do result[#result + 1] = renewed[i] end\nfor i = 1, #superseded do result[#result + 1] = superseded[i] end\nreturn result\n`\n\n/**\n * KEYS: store, counter, ids, meta, pending, ready, watched.\n * ARGV: sessionId, nowMs, parent index, attempt, n, then per child:\n * id, type, payloadJson, lane, settled.\n */\nconst COMPLETE_ATTEMPT_LUA = `\nlocal function lane_field(lane, suffix)\n  return '__lane:' .. tostring(string.len(lane)) .. ':' .. lane .. ':' .. suffix\nend\nlocal function settle(field)\n  redis.call('ZREM', KEYS[5], field)\n  redis.call('ZREM', KEYS[6], field)\n  local lane = redis.call('HGET', KEYS[4], field .. ':l') or ''\n  if lane == '' then return end\n  local head_key = lane_field(lane, 'head')\n  if redis.call('HGET', KEYS[4], head_key) ~= field then return end\n  local next_field = redis.call('HGET', KEYS[4], field .. ':next')\n  while next_field and redis.call('HEXISTS', KEYS[4], next_field .. ':p') == 1 do\n    next_field = redis.call('HGET', KEYS[4], next_field .. ':next')\n  end\n  if next_field then\n    redis.call('HSET', KEYS[4], head_key, next_field)\n    if redis.call('HEXISTS', KEYS[4], next_field .. ':f') == 0 then\n      redis.call('ZADD', KEYS[6], tonumber(next_field), next_field)\n    end\n  else\n    redis.call('HDEL', KEYS[4], head_key, lane_field(lane, 'tail'))\n  end\nend\nlocal function enqueue(field, idx, lane)\n  redis.call('ZADD', KEYS[5], idx, field)\n  if lane == '' then\n    redis.call('ZADD', KEYS[6], idx, field)\n    return\n  end\n  local tail_key = lane_field(lane, 'tail')\n  local tail = redis.call('HGET', KEYS[4], tail_key)\n  if tail then\n    redis.call('HSET', KEYS[4], tail .. ':next', field)\n  else\n    redis.call('HSET', KEYS[4], lane_field(lane, 'head'), field)\n    redis.call('ZADD', KEYS[6], idx, field)\n  end\n  redis.call('HSET', KEYS[4], tail_key, field)\nend\nlocal parent = ARGV[3]\nlocal attempt = tonumber(ARGV[4])\nlocal n = tonumber(ARGV[5])\nlocal total = tonumber(redis.call('GET', KEYS[2]) or '0')\nif tonumber(parent) < 1 or tonumber(parent) > total then return { 'missing' } end\nlocal dispatches = tonumber(redis.call('HGET', KEYS[4], parent .. ':d') or '0')\nlocal processed = redis.call('HGET', KEYS[4], parent .. ':p')\nlocal processed_attempt = tonumber(redis.call('HGET', KEYS[4], parent .. ':pa') or '0')\nif processed then\n  if processed_attempt ~= attempt then return { 'superseded' } end\n  local raw_recorded_ids = redis.call('HGET', KEYS[4], parent .. ':ri')\n  if not raw_recorded_ids then return { 'partial' } end\n  local recorded_ids = cjson.decode(raw_recorded_ids)\n  if #recorded_ids ~= n then return { 'partial' } end\n  local indexes = {}\n  for i = 1, n do\n    local id = ARGV[5 + (i - 1) * 5 + 1]\n    if recorded_ids[i] ~= id then return { 'partial' } end\n    local existing = redis.call('HGET', KEYS[3], id)\n    if not existing then return { 'partial' } end\n    local rec = cjson.decode(existing)\n    if rec[1] ~= ARGV[1] then return { 'partial' } end\n    local entries = redis.call('XRANGE', KEYS[1], tostring(rec[2]) .. '-0', tostring(rec[2]) .. '-0')\n    if #entries == 0 then return { 'partial' } end\n    local values = entries[1][2]\n    local cause = nil\n    for j = 1, #values, 2 do\n      if values[j] == 'cause' then cause = values[j + 1] break end\n    end\n    if not cause or cause == '' then return { 'partial' } end\n    local decoded = cjson.decode(cause)\n    if tonumber(decoded['index']) ~= tonumber(parent) or\n       tonumber(decoded['attempt']) ~= attempt then return { 'partial' } end\n    indexes[#indexes + 1] = tostring(rec[2])\n  end\n  local result = { 'duplicate' }\n  for _, idx in ipairs(indexes) do result[#result + 1] = idx end\n  return result\nend\nif dispatches ~= attempt then return { 'superseded' } end\nif redis.call('HEXISTS', KEYS[4], parent .. ':ch') == 0 or\n   redis.call('HEXISTS', KEYS[4], parent .. ':f') == 1 or\n   tonumber(redis.call('HGET', KEYS[4], parent .. ':lfa') or '0') == attempt then\n  return { 'superseded' }\nend\nfor i = 1, n do\n  local id = ARGV[5 + (i - 1) * 5 + 1]\n  if redis.call('HEXISTS', KEYS[3], id) == 1 then return { 'partial' } end\nend\nlocal returned_ids = {}\nfor i = 1, n do returned_ids[i] = ARGV[5 + (i - 1) * 5 + 1] end\nlocal returned_json = '[]'\nif n > 0 then returned_json = cjson.encode(returned_ids) end\nredis.call('HSET', KEYS[4],\n  parent .. ':p', ARGV[2],\n  parent .. ':pa', ARGV[4],\n  parent .. ':ri', returned_json)\nredis.call('HDEL', KEYS[4], parent .. ':ch', parent .. ':ce')\nsettle(parent)\nlocal cause = cjson.encode({ index = tonumber(parent), attempt = attempt })\nfor i = 1, n do\n  local id = ARGV[5 + (i - 1) * 5 + 1]\n  local typ = ARGV[5 + (i - 1) * 5 + 2]\n  local payload = ARGV[5 + (i - 1) * 5 + 3]\n  local lane = ARGV[5 + (i - 1) * 5 + 4]\n  local settled = ARGV[5 + (i - 1) * 5 + 5]\n  local idx = total + i\n  redis.call('XADD', KEYS[1], tostring(idx) .. '-0',\n    'id', id, 'type', typ, 'payload', payload, 'created_at', ARGV[2],\n    'cause', cause, 'lane', lane)\n  redis.call('HSET', KEYS[3], id, cjson.encode({ ARGV[1], idx }))\n  redis.call('HSET', KEYS[4], tostring(idx) .. ':l', lane)\n  if settled == '1' then\n    redis.call('HSET', KEYS[4], tostring(idx) .. ':p', ARGV[2])\n  else\n    enqueue(tostring(idx), idx, lane)\n  end\nend\nredis.call('SET', KEYS[2], tostring(total + n))\nreturn { 'ok', tostring(total + 1),\n  tostring(redis.call('EXISTS', KEYS[7])) }\n`\n\n/** KEYS: snapshot. ARGV: upToIndex, json. Guarded: never move backward. */\nconst PUT_SNAPSHOT_LUA = `\nlocal cur = redis.call('GET', KEYS[1])\nif cur and tonumber(cjson.decode(cur)['index']) >= tonumber(ARGV[1]) then\n  return 0\nend\nredis.call('SET', KEYS[1], ARGV[2])\nreturn 1\n`\n\n/**\n * KEYS: presence hash. ARGV: atMs, ttlMs, n, then per entry:\n * hashField, valueJson ('' deletes). Field-wise LWW by the sender's\n * `at`: a stored entry with a strictly newer stamp survives; ties go\n * to the incoming write (memory-tier parity). Returns the applied\n * 1-based entry positions. The whole-key PEXPIRE is the coarse bound,\n * sound because core sends one uniform ttlMs; the per-entry `e` stamp\n * is the fine bound (the injected storage clock at the applied set\n * plus ttlMs — never the sender stamp), pruned on read against the\n * same clock.\n */\nconst PRESENCE_SET_LUA = `\nlocal at = tonumber(ARGV[1])\nlocal applied = {}\nfor i = 1, tonumber(ARGV[3]) do\n  local field = ARGV[3 + (i - 1) * 2 + 1]\n  local value = ARGV[3 + (i - 1) * 2 + 2]\n  local existing = redis.call('HGET', KEYS[1], field)\n  if not existing or tonumber(cjson.decode(existing)['a']) <= at then\n    if value == '' then\n      redis.call('HDEL', KEYS[1], field)\n    else\n      redis.call('HSET', KEYS[1], field, value)\n    end\n    applied[#applied + 1] = tostring(i)\n  end\nend\nif #applied > 0 then redis.call('PEXPIRE', KEYS[1], ARGV[2]) end\nreturn applied\n`\n\n/**\n * KEYS: presence hash. ARGV: nowMs (the injected clock, so tests can\n * time-travel expiry against a real server). Returns the live\n * [field, value, ...] pairs; entries at or past their fine-bound\n * expiry are HDELed in the same atomic step, so a stale reader can\n * never sweep a concurrently refreshed field.\n */\nconst PRESENCE_READ_LUA = `\nlocal now = tonumber(ARGV[1])\nlocal rows = redis.call('HGETALL', KEYS[1])\nlocal live = {}\nfor i = 1, #rows, 2 do\n  if tonumber(cjson.decode(rows[i + 1])['e']) <= now then\n    redis.call('HDEL', KEYS[1], rows[i])\n  else\n    live[#live + 1] = rows[i]\n    live[#live + 1] = rows[i + 1]\n  end\nend\nreturn live\n`\n\n/** KEYS: snapshot, event counter. Returns one atomic cache-plus-frontier read. */\nconst READ_STATE_LUA = `\nlocal snapshot = redis.call('GET', KEYS[1])\nlocal frontier = redis.call('GET', KEYS[2]) or '0'\nreturn { snapshot or '', frontier }\n`\n\n// ── wire helpers ─────────────────────────────────────────────────────\n\ntype StreamEntry = [id: string, fields: string[]]\n\nconst fieldMap = (fields: string[]): Record<string, string> => {\n  const map: Record<string, string> = {}\n  for (let i = 0; i + 1 < fields.length; i += 2) {\n    map[fields[i]!] = fields[i + 1]!\n  }\n  return map\n}\n\nconst STORED_EVENT_META_SUFFIXES = [\n  'p',\n  'pa',\n  'ri',\n  'ch',\n  'ce',\n  'f',\n  'fc',\n  'lc',\n  'lf',\n  'lfa',\n  'd',\n  'a',\n  'e',\n] as const\n\nconst entryIndex = (entryId: string): number =>\n  Number(entryId.slice(0, entryId.indexOf('-')))\n\nconst toEvent = (sessionId: string, entry: StreamEntry): Event => {\n  const fields = fieldMap(entry[1])\n  return {\n    id: fields['id']!,\n    type: fields['type']!,\n    payload: JSON.parse(fields['payload']!),\n    index: entryIndex(entry[0]),\n    sessionId,\n    createdAt: new Date(Number(fields['created_at'])),\n  }\n}\n\nconst json = (value: unknown): string => JSON.stringify(value) ?? 'null'\n\nconst toCause = (raw: string | undefined): EventCause | null => {\n  if (raw === '' || raw === undefined) return null\n  const value = JSON.parse(raw) as {\n    index?: unknown\n    attempt?: unknown\n    batchSize?: unknown\n  }\n  if (\n    !Number.isInteger(value.index) ||\n    Number(value.index) < 1 ||\n    !Number.isInteger(value.attempt) ||\n    Number(value.attempt) < 1\n  ) {\n    throw new TypeError('stored event has an invalid cause')\n  }\n  if (\n    value.batchSize !== undefined &&\n    (!Number.isInteger(value.batchSize) || Number(value.batchSize) < 1)\n  ) {\n    throw new TypeError('stored event has an invalid cause')\n  }\n  return {\n    index: Number(value.index),\n    attempt: Number(value.attempt),\n    ...(value.batchSize === undefined\n      ? {}\n      : { batchSize: Number(value.batchSize) }),\n  }\n}\n\nconst toClaimAvailableResult = (\n  sessionId: string,\n  reply: unknown[],\n): StoreClaimAvailableResult => {\n  const outcome = String(reply[0])\n  if (outcome === 'claimed') {\n    const count = Number(reply[1])\n    const events: StoredEvent[] = []\n    for (let i = 0; i < count; i++) {\n      const offset = 2 + i * 10\n      const entry = reply[offset + 9] as StreamEntry\n      const event = toEvent(sessionId, entry)\n      const fields = fieldMap(entry[1])\n      events.push(\n        Object.assign(event, {\n          cause: toCause(fields['cause']),\n          lane: fields['lane'] === '' ? null : fields['lane']!,\n          processedAt: null,\n          processedByAttempt: null,\n          returnedEventIds: null,\n          firstClaimedAt:\n            reply[offset + 3] === null\n              ? null\n              : new Date(Number(reply[offset + 3])),\n          lastClaimedAt: new Date(Number(reply[offset + 4])),\n          attemptCount: Number(reply[offset]),\n          claimHolder: String(reply[offset + 7]),\n          claimExpiresAt: new Date(Number(reply[offset + 8])),\n          failureCount: Number(reply[offset + 1]),\n          lastFailedAt:\n            reply[offset + 5] === null\n              ? null\n              : new Date(Number(reply[offset + 5])),\n          lastFailedAttempt:\n            reply[offset + 6] === null ? null : Number(reply[offset + 6]),\n          lastError:\n            reply[offset + 2] === null ? null : String(reply[offset + 2]),\n          failedAt: null,\n        }),\n      )\n    }\n    return {\n      outcome: 'claimed',\n      events,\n    }\n  }\n  if (outcome === 'busy') {\n    return { outcome, retryAt: new Date(Number(reply[1])) }\n  }\n  if (outcome === 'settled') return { outcome }\n  throw new TypeError(\n    `claim referenced a missing event in session '${sessionId}'`,\n  )\n}\n\nconst wrap = async <T>(fn: () => Promise<T>): Promise<T> => {\n  try {\n    return await fn()\n  } catch (err) {\n    if (err instanceof A2Error || err instanceof TypeError) throw err\n    throw new A2Error('STORE_UNAVAILABLE', 'redis store operation failed', {\n      cause: err,\n    })\n  }\n}\n\nexport function createRedisStoreCore(\n  options: RedisStoreCoreOptions,\n): RedisStoreCore {\n  const { call, clock, notify } = options\n  const generateId = options.ids\n  const prefix = options.keyPrefix\n\n  const storeKey = (s: string): string => `${prefix}:${s}:log`\n  const countKey = (s: string): string => `${prefix}:${s}:count`\n  const metaKey = (s: string): string => `${prefix}:${s}:meta`\n  const pendingKey = (s: string): string => `${prefix}:${s}:pending`\n  const readyKey = (s: string): string => `${prefix}:${s}:ready`\n  const snapKey = (s: string, r: string): string => `${prefix}:${s}:snap:${r}`\n  const watchedKey = (s: string): string => `${prefix}:${s}:watched`\n  const presenceKey = (s: string): string => `${prefix}:${s}:presence`\n  const idsKey = `${prefix}:ids`\n\n  const evalScript = (\n    script: string,\n    keys: string[],\n    args: Array<string | number>,\n  ): Promise<unknown> => call('EVAL', script, keys.length, ...keys, ...args)\n\n  const readFrontier = async (sessionId: string): Promise<number> => {\n    const frontier = Number((await call('GET', countKey(sessionId))) ?? 0)\n    if (!Number.isSafeInteger(frontier) || frontier < 0) {\n      throw new A2Error(\n        'STORE_UNAVAILABLE',\n        `redis event count for session '${sessionId}' is invalid`,\n      )\n    }\n    return frontier\n  }\n\n  const readRangePage = async (\n    sessionId: string,\n    afterIndex: number,\n    throughIndex: number,\n    limit: number,\n  ): Promise<StoredEvent[]> => {\n    if (throughIndex <= afterIndex) return []\n    const entries = (await call(\n      'XRANGE',\n      storeKey(sessionId),\n      `${afterIndex + 1}-0`,\n      `${throughIndex}-0`,\n      'COUNT',\n      limit,\n    )) as StreamEntry[]\n    if (entries.length === 0) return []\n\n    const metaFields = entries.flatMap((entry) => {\n      const index = entryIndex(entry[0])\n      return STORED_EVENT_META_SUFFIXES.map((suffix) => `${index}:${suffix}`)\n    })\n    const metaValues =\n      ((await call('HMGET', metaKey(sessionId), ...metaFields)) as Array<\n        string | null\n      > | null) ?? []\n    const meta: Record<string, string> = {}\n    for (let i = 0; i < metaFields.length; i += 1) {\n      const value = metaValues[i]\n      if (value !== null && value !== undefined) {\n        meta[metaFields[i]!] = value\n      }\n    }\n    return entries.map((entry) => {\n      const event = toEvent(sessionId, entry)\n      const idx = event.index\n      const fields = fieldMap(entry[1])\n      const processedAt = meta[`${idx}:p`]\n      const processedByAttempt = meta[`${idx}:pa`]\n      const returnedEventIds = meta[`${idx}:ri`]\n      const claimHolder = meta[`${idx}:ch`]\n      const claimExpiresAt = meta[`${idx}:ce`]\n      const failedAt = meta[`${idx}:f`]\n      const firstClaimedAt = meta[`${idx}:fc`]\n      const lastClaimedAt = meta[`${idx}:lc`]\n      const lastFailedAt = meta[`${idx}:lf`]\n      const lastFailedAttempt = meta[`${idx}:lfa`]\n      return Object.assign(event, {\n        cause: toCause(fields['cause']),\n        lane: fields['lane'] === '' ? null : fields['lane']!,\n        processedAt:\n          processedAt === undefined ? null : new Date(Number(processedAt)),\n        processedByAttempt:\n          processedByAttempt === undefined ? null : Number(processedByAttempt),\n        returnedEventIds:\n          returnedEventIds === undefined\n            ? null\n            : decodeReturnedEventIds(returnedEventIds),\n        firstClaimedAt:\n          firstClaimedAt === undefined\n            ? null\n            : new Date(Number(firstClaimedAt)),\n        lastClaimedAt:\n          lastClaimedAt === undefined ? null : new Date(Number(lastClaimedAt)),\n        attemptCount: Number(meta[`${idx}:d`] ?? 0),\n        claimHolder: claimHolder ?? null,\n        claimExpiresAt:\n          claimExpiresAt === undefined\n            ? null\n            : new Date(Number(claimExpiresAt)),\n        failureCount: Number(meta[`${idx}:a`] ?? 0),\n        lastFailedAt:\n          lastFailedAt === undefined ? null : new Date(Number(lastFailedAt)),\n        lastFailedAttempt:\n          lastFailedAttempt === undefined ? null : Number(lastFailedAttempt),\n        lastError: meta[`${idx}:e`] ?? null,\n        failedAt: failedAt === undefined ? null : new Date(Number(failedAt)),\n      })\n    })\n  }\n\n  const readEventRange = async (\n    sessionId: string,\n    afterIndex: number,\n    throughIndex: number,\n  ): Promise<Event[]> => {\n    if (throughIndex <= afterIndex) return []\n    const events: Event[] = []\n    let nextIndex = afterIndex + 1\n    while (nextIndex <= throughIndex) {\n      // oxlint-disable-next-line no-await-in-loop -- each page advances the dense frozen range\n      const entries = (await call(\n        'XRANGE',\n        storeKey(sessionId),\n        `${nextIndex}-0`,\n        `${throughIndex}-0`,\n        'COUNT',\n        READ_PAGE_SIZE,\n      )) as StreamEntry[]\n      if (entries.length === 0) {\n        throw new A2Error(\n          'STORE_UNAVAILABLE',\n          `redis event range for session '${sessionId}' ended before index ${throughIndex}`,\n        )\n      }\n      for (let position = 0; position < entries.length; position += 1) {\n        const index = entryIndex(entries[position]![0])\n        if (index !== nextIndex + position || index > throughIndex) {\n          throw new A2Error(\n            'STORE_UNAVAILABLE',\n            `redis event range for session '${sessionId}' is not contiguous`,\n          )\n        }\n      }\n      events.push(...entries.map((entry) => toEvent(sessionId, entry)))\n      nextIndex = events.at(-1)!.index + 1\n    }\n    return events\n  }\n\n  /** Bounded XRANGE pages restore the full-read contract on capped providers. */\n  const readRange = async (\n    sessionId: string,\n    afterIndex: number,\n    throughIndex?: number,\n  ): Promise<StoredEvent[]> => {\n    if (throughIndex !== undefined && throughIndex <= afterIndex) return []\n    const currentFrontier = await readFrontier(sessionId)\n    const frontier = Math.min(throughIndex ?? currentFrontier, currentFrontier)\n    if (frontier <= afterIndex) return []\n\n    const rows: StoredEvent[] = []\n    let nextIndex = afterIndex + 1\n    while (nextIndex <= frontier) {\n      // oxlint-disable-next-line no-await-in-loop -- each page advances the dense frozen range\n      const page = await readRangePage(\n        sessionId,\n        nextIndex - 1,\n        frontier,\n        READ_PAGE_SIZE,\n      )\n      if (page.length === 0) {\n        throw new A2Error(\n          'STORE_UNAVAILABLE',\n          `redis event range for session '${sessionId}' ended before index ${frontier}`,\n        )\n      }\n      for (let position = 0; position < page.length; position += 1) {\n        if (page[position]!.index !== nextIndex + position) {\n          throw new A2Error(\n            'STORE_UNAVAILABLE',\n            `redis event range for session '${sessionId}' is not contiguous`,\n          )\n        }\n      }\n      const lastIndex = page.at(-1)!.index\n      if (lastIndex < nextIndex || lastIndex > frontier) {\n        throw new A2Error(\n          'STORE_UNAVAILABLE',\n          `redis event range for session '${sessionId}' did not advance`,\n        )\n      }\n      rows.push(...page)\n      nextIndex = lastIndex + 1\n    }\n    return rows\n  }\n\n  return {\n    async append(sessionId, events) {\n      return wrap(async () => {\n        const supplied = events.filter((e) => e.id !== undefined)\n        const suppliedIds = supplied.map((e) => e.id as string)\n        if (new Set(suppliedIds).size !== suppliedIds.length) {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'batch contains the same event id more than once',\n          )\n        }\n        const now = clock.now().getTime()\n        const withIds = events.map((e) => ({\n          id: e.id ?? generateId(),\n          type: e.type,\n          payload: e.payload,\n          cause: e.cause ? { ...e.cause } : null,\n          lane: e.lane ?? null,\n          settled: e.settled === true,\n        }))\n        const args: Array<string | number> = [\n          sessionId,\n          now,\n          withIds.length,\n          ...withIds.flatMap((e) => [\n            e.id,\n            e.type,\n            json(e.payload),\n            e.cause ? json(e.cause) : '',\n            e.lane ?? '',\n            e.settled ? '1' : '0',\n          ]),\n        ]\n        const reply = (await evalScript(\n          APPEND_LUA,\n          [\n            storeKey(sessionId),\n            countKey(sessionId),\n            idsKey,\n            metaKey(sessionId),\n            pendingKey(sessionId),\n            readyKey(sessionId),\n            watchedKey(sessionId),\n          ],\n          args,\n        )) as string[]\n\n        const [verdict] = reply\n        if (verdict === 'empty') {\n          return { events: [], hasPending: reply[1] === '1' }\n        }\n        if (verdict === 'foreign') {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            `event id '${reply[1]}' already exists in another session`,\n          )\n        }\n        if (verdict === 'no_parent') {\n          throw new TypeError(\n            `no event at index ${reply[1]} in session '${sessionId}'`,\n          )\n        }\n        if (verdict === 'superseded') {\n          throw new A2Error(\n            'SUPERSEDED_ATTEMPT',\n            `a newer attempt owns event ${reply[1]} in session '${sessionId}'`,\n          )\n        }\n        if (verdict === 'partial') {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            `batch mixes ${reply[1]} already-appended and ${events.length - Number(reply[1])} fresh events`,\n          )\n        }\n        if (verdict === 'dup') {\n          // A retry of a committed batch whose ack was lost — return\n          // the original rows, ordered by index like every adapter.\n          const hasPending = reply[1] === '1'\n          const wanted = new Set(reply.slice(2).map(Number))\n          const min = Math.min(...wanted)\n          const rows = await readRange(sessionId, min - 1)\n          const existing = rows.filter((row) => wanted.has(row.index))\n          return {\n            events: idempotentReplay(events, existing),\n            hasPending,\n          }\n        }\n        const base = Number(reply[1]) - 1\n        if (reply[3] === '1') notify?.(sessionId, base + withIds.length)\n        return {\n          events: withIds.map((e, i) => ({\n            id: e.id,\n            type: e.type,\n            payload: structuredClone(e.payload),\n            index: base + 1 + i,\n            sessionId,\n            createdAt: new Date(now),\n            cause: e.cause,\n            lane: e.lane,\n            processedAt: e.settled ? new Date(now) : null,\n            processedByAttempt: null,\n            returnedEventIds: null,\n            firstClaimedAt: null,\n            lastClaimedAt: null,\n            attemptCount: 0,\n            claimHolder: null,\n            claimExpiresAt: null,\n            failureCount: 0,\n            lastFailedAt: null,\n            lastFailedAttempt: null,\n            lastError: null,\n            failedAt: null,\n          })),\n          hasPending: reply[2] === '1',\n        }\n      })\n    },\n\n    async read(sessionId, opts) {\n      return wrap(async () => {\n        const rows = await readRange(\n          sessionId,\n          opts?.afterIndex ?? 0,\n          opts?.throughIndex,\n        )\n        return rows\n      })\n    },\n\n    async claimAvailable({\n      sessionId,\n      holder,\n      ttlMs,\n      expiresAtMs,\n      excludeIndexes,\n    }) {\n      return wrap(async () => {\n        const now = clock.now().getTime()\n        const expiresAt = expiresAtMs ?? now + ttlMs\n        const excluded = excludeIndexes ?? []\n        const reply = (await evalScript(\n          CLAIM_AVAILABLE_LUA,\n          [\n            storeKey(sessionId),\n            countKey(sessionId),\n            metaKey(sessionId),\n            pendingKey(sessionId),\n            readyKey(sessionId),\n          ],\n          [holder, now, expiresAt, excluded.length, ...excluded],\n        )) as unknown[]\n        return toClaimAvailableResult(sessionId, reply)\n      })\n    },\n\n    async renewClaims({ sessionId, holder, claims, ttlMs, expiresAtMs }) {\n      return wrap(async () => {\n        const now = clock.now().getTime()\n        const expiresAt = expiresAtMs ?? now + ttlMs\n        const reply = (await evalScript(\n          RENEW_CLAIMS_LUA,\n          [countKey(sessionId), metaKey(sessionId)],\n          [\n            holder,\n            now,\n            expiresAt,\n            claims.length,\n            ...claims.flatMap((claim) => [claim.index, claim.attempt]),\n          ],\n        )) as string[]\n        const renewedCount = Number(reply[0])\n        const values = reply.slice(1).map(Number)\n        return {\n          renewed: values.slice(0, renewedCount).toSorted((a, b) => a - b),\n          superseded: values.slice(renewedCount).toSorted((a, b) => a - b),\n        }\n      })\n    },\n\n    async completeAttempt({ sessionId, index, attempt, events }) {\n      return wrap(async () => {\n        const ids = events.map((event) => event.id)\n        if (new Set(ids).size !== ids.length) {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'batch contains the same event id more than once',\n          )\n        }\n        const now = clock.now().getTime()\n        const reply = (await evalScript(\n          COMPLETE_ATTEMPT_LUA,\n          [\n            storeKey(sessionId),\n            countKey(sessionId),\n            idsKey,\n            metaKey(sessionId),\n            pendingKey(sessionId),\n            readyKey(sessionId),\n            watchedKey(sessionId),\n          ],\n          [\n            sessionId,\n            now,\n            index,\n            attempt,\n            events.length,\n            ...events.flatMap((event) => [\n              event.id,\n              event.type,\n              json(event.payload),\n              event.lane ?? '',\n              event.settled === true ? '1' : '0',\n            ]),\n          ],\n        )) as string[]\n        const outcome = reply[0]\n        if (outcome === 'missing') {\n          throw new TypeError(\n            `no event at index ${index} in session '${sessionId}'`,\n          )\n        }\n        if (outcome === 'partial') {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'returned event ids do not match the completed attempt',\n          )\n        }\n        if (outcome === 'superseded') return { outcome }\n\n        const cause = { index, attempt }\n        if (outcome === 'ok') {\n          const base = Number(reply[1]) - 1\n          if (events.length > 0 && reply[2] === '1') {\n            notify?.(sessionId, base + events.length)\n          }\n          return {\n            outcome: 'completed',\n            events: events.map((event, i) => ({\n              id: event.id,\n              type: event.type,\n              payload: structuredClone(event.payload),\n              index: base + 1 + i,\n              sessionId,\n              createdAt: new Date(now),\n              cause,\n              lane: event.lane ?? null,\n              processedAt: event.settled === true ? new Date(now) : null,\n              processedByAttempt: null,\n              returnedEventIds: null,\n              firstClaimedAt: null,\n              lastClaimedAt: null,\n              attemptCount: 0,\n              claimHolder: null,\n              claimExpiresAt: null,\n              failureCount: 0,\n              lastFailedAt: null,\n              lastFailedAttempt: null,\n              lastError: null,\n              failedAt: null,\n            })),\n          } satisfies CompleteAttemptResult\n        }\n        if (outcome === 'duplicate') {\n          if (events.length === 0) {\n            return { outcome: 'completed', events: [] }\n          }\n          const wanted = new Set(reply.slice(1).map(Number))\n          const min = Math.min(...wanted)\n          const rows = await readRange(sessionId, min - 1)\n          const byIndex = new Map(rows.map((row) => [row.index, row]))\n          const existing = reply\n            .slice(1)\n            .map((value) => byIndex.get(Number(value))!)\n          return {\n            outcome: 'completed',\n            events: idempotentReplay(events, existing),\n          }\n        }\n        throw new TypeError(`unexpected completion outcome '${outcome}'`)\n      })\n    },\n\n    async failAttempt({ sessionId, index, attempt, error, maxFailures }) {\n      return wrap(async () => {\n        const reply = (await evalScript(\n          FAIL_ATTEMPT_LUA,\n          [\n            countKey(sessionId),\n            metaKey(sessionId),\n            pendingKey(sessionId),\n            readyKey(sessionId),\n          ],\n          [index, attempt, error, maxFailures, clock.now().getTime()],\n        )) as string[]\n        const outcome = reply[0]\n        if (outcome === 'missing') {\n          throw new TypeError(\n            `no event at index ${index} in session '${sessionId}'`,\n          )\n        }\n        return {\n          outcome: outcome as 'failed' | 'dead_lettered' | 'superseded',\n          failureCount: Number(reply[1]),\n        }\n      })\n    },\n\n    async readState(sessionId, reducerName) {\n      return wrap(async () => {\n        const reply = (await evalScript(\n          READ_STATE_LUA,\n          [snapKey(sessionId, reducerName), countKey(sessionId)],\n          [],\n        )) as [string, string]\n        const raw = reply[0]\n        const parsed =\n          raw === ''\n            ? null\n            : (JSON.parse(raw) as { index: number; state: unknown })\n        const frontier = Number(reply[1])\n        if (\n          !Number.isSafeInteger(frontier) ||\n          frontier < 0 ||\n          (parsed !== null &&\n            (!Number.isSafeInteger(parsed.index) || parsed.index < 0))\n        ) {\n          throw new A2Error(\n            'STORE_UNAVAILABLE',\n            `redis state frontier for session '${sessionId}' is invalid`,\n          )\n        }\n        const events = await readEventRange(\n          sessionId,\n          parsed?.index ?? 0,\n          frontier,\n        )\n        return {\n          snapshot: parsed\n            ? { index: parsed.index, state: parsed.state }\n            : null,\n          events,\n        }\n      })\n    },\n\n    async putSnapshot(sessionId, reducerName, index, state) {\n      await wrap(async () => {\n        await evalScript(\n          PUT_SNAPSHOT_LUA,\n          [snapKey(sessionId, reducerName)],\n          [index, json({ index, state, updatedAt: clock.now().getTime() })],\n        )\n      })\n    },\n\n    presence: {\n      async set(ns, participant, values, meta) {\n        return wrap(async () => {\n          const entries = Object.entries(values)\n          if (entries.length === 0) return null\n          const atMs = meta.at.getTime()\n          // Expiry anchors on the injected storage clock — the sender's\n          // `a` stamp orders writes, the `e` stamp bounds their\n          // lifetime, and the two clocks never mix.\n          const expiresAtMs = clock.now().getTime() + meta.ttlMs\n          // The hash field is JSON `[participant, field]`: both are\n          // caller strings, so no separator character is\n          // collision-safe — the JSON array is.\n          const applied = (await evalScript(\n            PRESENCE_SET_LUA,\n            [presenceKey(ns)],\n            [\n              atMs,\n              meta.ttlMs,\n              entries.length,\n              ...entries.flatMap(([field, value]) => [\n                JSON.stringify([participant, field]),\n                value === null\n                  ? ''\n                  : json({\n                      v: value,\n                      s: meta.seen,\n                      a: atMs,\n                      e: expiresAtMs,\n                    }),\n              ]),\n            ],\n          )) as string[]\n          if (applied.length === 0) return null\n          // Field-keyed and caller-named — null-prototype, like every\n          // presence map (see `nullProtoRecord`).\n          const appliedValues: Record<string, unknown> = nullProtoRecord()\n          for (const position of applied) {\n            const [field, value] = entries[Number(position) - 1]!\n            appliedValues[field] = structuredClone(value)\n          }\n          return {\n            participant,\n            values: appliedValues,\n            seen: meta.seen,\n            at: new Date(atMs),\n          }\n        })\n      },\n\n      async read(ns) {\n        return wrap(async () => {\n          const reply = (await evalScript(\n            PRESENCE_READ_LUA,\n            [presenceKey(ns)],\n            [clock.now().getTime()],\n          )) as string[]\n          const rows: PresenceRow[] = []\n          for (let i = 0; i + 1 < reply.length; i += 2) {\n            const [participant, field] = JSON.parse(reply[i]!) as [\n              string,\n              string,\n            ]\n            const entry = JSON.parse(reply[i + 1]!) as {\n              v: unknown\n              s: number\n              a: number\n              e: number\n            }\n            rows.push({\n              participant,\n              field,\n              value: entry.v,\n              seen: entry.s,\n              at: new Date(entry.a),\n              expiresAt: new Date(entry.e),\n            })\n          }\n          return rows\n        })\n      },\n    },\n\n    async readRange(sessionId, afterIndex, throughIndex) {\n      return wrap(() => readRange(sessionId, afterIndex, throughIndex))\n    },\n\n    async readEvents(sessionId, afterIndex) {\n      return wrap(async () => {\n        const entries = (await call(\n          'XRANGE',\n          storeKey(sessionId),\n          `${afterIndex + 1}-0`,\n          '+',\n        )) as StreamEntry[]\n        return entries.map((entry) => toEvent(sessionId, entry))\n      })\n    },\n\n    async markWatched(sessionId, ttlMs) {\n      await wrap(() => call('SET', watchedKey(sessionId), '1', 'PX', ttlMs))\n    },\n  }\n}\n"],"mappings":";;;;;AA0FA,MAAM,iBAAiB;;;;;;;;;;AAavB,MAAM,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkFnB,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+DzB,MAAM,sBAAsB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoD5B,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCzB,MAAM,uBAAuB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4H7B,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;AAoBzB,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BzB,MAAM,oBAAoB;;;;;;;;;;;;;;;AAgB1B,MAAM,iBAAiB;;;;;AAUvB,MAAM,YAAY,WAA6C;CAC7D,MAAM,MAA8B,CAAC;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,KAAK,GAC1C,IAAI,OAAO,MAAO,OAAO,IAAI;CAE/B,OAAO;AACT;AAEA,MAAM,6BAA6B;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;AAEA,MAAM,cAAc,YAClB,OAAO,QAAQ,MAAM,GAAG,QAAQ,QAAQ,GAAG,CAAC,CAAC;AAE/C,MAAM,WAAW,WAAmB,UAA8B;CAChE,MAAM,SAAS,SAAS,MAAM,EAAE;CAChC,OAAO;EACL,IAAI,OAAO;EACX,MAAM,OAAO;EACb,SAAS,KAAK,MAAM,OAAO,UAAW;EACtC,OAAO,WAAW,MAAM,EAAE;EAC1B;EACA,WAAW,IAAI,KAAK,OAAO,OAAO,aAAa,CAAC;CAClD;AACF;AAEA,MAAM,QAAQ,UAA2B,KAAK,UAAU,KAAK,KAAK;AAElE,MAAM,WAAW,QAA+C;CAC9D,IAAI,QAAQ,MAAM,QAAQ,KAAA,GAAW,OAAO;CAC5C,MAAM,QAAQ,KAAK,MAAM,GAAG;CAK5B,IACE,CAAC,OAAO,UAAU,MAAM,KAAK,KAC7B,OAAO,MAAM,KAAK,IAAI,KACtB,CAAC,OAAO,UAAU,MAAM,OAAO,KAC/B,OAAO,MAAM,OAAO,IAAI,GAExB,MAAM,IAAI,UAAU,mCAAmC;CAEzD,IACE,MAAM,cAAc,KAAA,MACnB,CAAC,OAAO,UAAU,MAAM,SAAS,KAAK,OAAO,MAAM,SAAS,IAAI,IAEjE,MAAM,IAAI,UAAU,mCAAmC;CAEzD,OAAO;EACL,OAAO,OAAO,MAAM,KAAK;EACzB,SAAS,OAAO,MAAM,OAAO;EAC7B,GAAI,MAAM,cAAc,KAAA,IACpB,CAAC,IACD,EAAE,WAAW,OAAO,MAAM,SAAS,EAAE;CAC3C;AACF;AAEA,MAAM,0BACJ,WACA,UAC8B;CAC9B,MAAM,UAAU,OAAO,MAAM,EAAE;CAC/B,IAAI,YAAY,WAAW;EACzB,MAAM,QAAQ,OAAO,MAAM,EAAE;EAC7B,MAAM,SAAwB,CAAC;EAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC9B,MAAM,SAAS,IAAI,IAAI;GACvB,MAAM,QAAQ,MAAM,SAAS;GAC7B,MAAM,QAAQ,QAAQ,WAAW,KAAK;GACtC,MAAM,SAAS,SAAS,MAAM,EAAE;GAChC,OAAO,KACL,OAAO,OAAO,OAAO;IACnB,OAAO,QAAQ,OAAO,QAAQ;IAC9B,MAAM,OAAO,YAAY,KAAK,OAAO,OAAO;IAC5C,aAAa;IACb,oBAAoB;IACpB,kBAAkB;IAClB,gBACE,MAAM,SAAS,OAAO,OAClB,OACA,IAAI,KAAK,OAAO,MAAM,SAAS,EAAE,CAAC;IACxC,eAAe,IAAI,KAAK,OAAO,MAAM,SAAS,EAAE,CAAC;IACjD,cAAc,OAAO,MAAM,OAAO;IAClC,aAAa,OAAO,MAAM,SAAS,EAAE;IACrC,gBAAgB,IAAI,KAAK,OAAO,MAAM,SAAS,EAAE,CAAC;IAClD,cAAc,OAAO,MAAM,SAAS,EAAE;IACtC,cACE,MAAM,SAAS,OAAO,OAClB,OACA,IAAI,KAAK,OAAO,MAAM,SAAS,EAAE,CAAC;IACxC,mBACE,MAAM,SAAS,OAAO,OAAO,OAAO,OAAO,MAAM,SAAS,EAAE;IAC9D,WACE,MAAM,SAAS,OAAO,OAAO,OAAO,OAAO,MAAM,SAAS,EAAE;IAC9D,UAAU;GACZ,CAAC,CACH;EACF;EACA,OAAO;GACL,SAAS;GACT;EACF;CACF;CACA,IAAI,YAAY,QACd,OAAO;EAAE;EAAS,SAAS,IAAI,KAAK,OAAO,MAAM,EAAE,CAAC;CAAE;CAExD,IAAI,YAAY,WAAW,OAAO,EAAE,QAAQ;CAC5C,MAAM,IAAI,UACR,gDAAgD,UAAU,EAC5D;AACF;AAEA,MAAM,OAAO,OAAU,OAAqC;CAC1D,IAAI;EACF,OAAO,MAAM,GAAG;CAClB,SAAS,KAAK;EACZ,IAAI,eAAe,WAAW,eAAe,WAAW,MAAM;EAC9D,MAAM,IAAI,QAAQ,qBAAqB,gCAAgC,EACrE,OAAO,IACT,CAAC;CACH;AACF;AAEA,SAAgB,qBACd,SACgB;CAChB,MAAM,EAAE,MAAM,OAAO,WAAW;CAChC,MAAM,aAAa,QAAQ;CAC3B,MAAM,SAAS,QAAQ;CAEvB,MAAM,YAAY,MAAsB,GAAG,OAAO,GAAG,EAAE;CACvD,MAAM,YAAY,MAAsB,GAAG,OAAO,GAAG,EAAE;CACvD,MAAM,WAAW,MAAsB,GAAG,OAAO,GAAG,EAAE;CACtD,MAAM,cAAc,MAAsB,GAAG,OAAO,GAAG,EAAE;CACzD,MAAM,YAAY,MAAsB,GAAG,OAAO,GAAG,EAAE;CACvD,MAAM,WAAW,GAAW,MAAsB,GAAG,OAAO,GAAG,EAAE,QAAQ;CACzE,MAAM,cAAc,MAAsB,GAAG,OAAO,GAAG,EAAE;CACzD,MAAM,eAAe,MAAsB,GAAG,OAAO,GAAG,EAAE;CAC1D,MAAM,SAAS,GAAG,OAAO;CAEzB,MAAM,cACJ,QACA,MACA,SACqB,KAAK,QAAQ,QAAQ,KAAK,QAAQ,GAAG,MAAM,GAAG,IAAI;CAEzE,MAAM,eAAe,OAAO,cAAuC;EACjE,MAAM,WAAW,OAAQ,MAAM,KAAK,OAAO,SAAS,SAAS,CAAC,KAAM,CAAC;EACrE,IAAI,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,GAChD,MAAM,IAAI,QACR,qBACA,kCAAkC,UAAU,aAC9C;EAEF,OAAO;CACT;CAEA,MAAM,gBAAgB,OACpB,WACA,YACA,cACA,UAC2B;EAC3B,IAAI,gBAAgB,YAAY,OAAO,CAAC;EACxC,MAAM,UAAW,MAAM,KACrB,UACA,SAAS,SAAS,GAClB,GAAG,aAAa,EAAE,KAClB,GAAG,aAAa,KAChB,SACA,KACF;EACA,IAAI,QAAQ,WAAW,GAAG,OAAO,CAAC;EAElC,MAAM,aAAa,QAAQ,SAAS,UAAU;GAC5C,MAAM,QAAQ,WAAW,MAAM,EAAE;GACjC,OAAO,2BAA2B,KAAK,WAAW,GAAG,MAAM,GAAG,QAAQ;EACxE,CAAC;EACD,MAAM,aACF,MAAM,KAAK,SAAS,QAAQ,SAAS,GAAG,GAAG,UAAU,KAE1C,CAAC;EAChB,MAAM,OAA+B,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;GAC7C,MAAM,QAAQ,WAAW;GACzB,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,KAAK,WAAW,MAAO;EAE3B;EACA,OAAO,QAAQ,KAAK,UAAU;GAC5B,MAAM,QAAQ,QAAQ,WAAW,KAAK;GACtC,MAAM,MAAM,MAAM;GAClB,MAAM,SAAS,SAAS,MAAM,EAAE;GAChC,MAAM,cAAc,KAAK,GAAG,IAAI;GAChC,MAAM,qBAAqB,KAAK,GAAG,IAAI;GACvC,MAAM,mBAAmB,KAAK,GAAG,IAAI;GACrC,MAAM,cAAc,KAAK,GAAG,IAAI;GAChC,MAAM,iBAAiB,KAAK,GAAG,IAAI;GACnC,MAAM,WAAW,KAAK,GAAG,IAAI;GAC7B,MAAM,iBAAiB,KAAK,GAAG,IAAI;GACnC,MAAM,gBAAgB,KAAK,GAAG,IAAI;GAClC,MAAM,eAAe,KAAK,GAAG,IAAI;GACjC,MAAM,oBAAoB,KAAK,GAAG,IAAI;GACtC,OAAO,OAAO,OAAO,OAAO;IAC1B,OAAO,QAAQ,OAAO,QAAQ;IAC9B,MAAM,OAAO,YAAY,KAAK,OAAO,OAAO;IAC5C,aACE,gBAAgB,KAAA,IAAY,OAAO,IAAI,KAAK,OAAO,WAAW,CAAC;IACjE,oBACE,uBAAuB,KAAA,IAAY,OAAO,OAAO,kBAAkB;IACrE,kBACE,qBAAqB,KAAA,IACjB,OACA,uBAAuB,gBAAgB;IAC7C,gBACE,mBAAmB,KAAA,IACf,OACA,IAAI,KAAK,OAAO,cAAc,CAAC;IACrC,eACE,kBAAkB,KAAA,IAAY,OAAO,IAAI,KAAK,OAAO,aAAa,CAAC;IACrE,cAAc,OAAO,KAAK,GAAG,IAAI,QAAQ,CAAC;IAC1C,aAAa,eAAe;IAC5B,gBACE,mBAAmB,KAAA,IACf,OACA,IAAI,KAAK,OAAO,cAAc,CAAC;IACrC,cAAc,OAAO,KAAK,GAAG,IAAI,QAAQ,CAAC;IAC1C,cACE,iBAAiB,KAAA,IAAY,OAAO,IAAI,KAAK,OAAO,YAAY,CAAC;IACnE,mBACE,sBAAsB,KAAA,IAAY,OAAO,OAAO,iBAAiB;IACnE,WAAW,KAAK,GAAG,IAAI,QAAQ;IAC/B,UAAU,aAAa,KAAA,IAAY,OAAO,IAAI,KAAK,OAAO,QAAQ,CAAC;GACrE,CAAC;EACH,CAAC;CACH;CAEA,MAAM,iBAAiB,OACrB,WACA,YACA,iBACqB;EACrB,IAAI,gBAAgB,YAAY,OAAO,CAAC;EACxC,MAAM,SAAkB,CAAC;EACzB,IAAI,YAAY,aAAa;EAC7B,OAAO,aAAa,cAAc;GAEhC,MAAM,UAAW,MAAM,KACrB,UACA,SAAS,SAAS,GAClB,GAAG,UAAU,KACb,GAAG,aAAa,KAChB,SACA,cACF;GACA,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,QACR,qBACA,kCAAkC,UAAU,uBAAuB,cACrE;GAEF,KAAK,IAAI,WAAW,GAAG,WAAW,QAAQ,QAAQ,YAAY,GAAG;IAC/D,MAAM,QAAQ,WAAW,QAAQ,SAAS,CAAE,EAAE;IAC9C,IAAI,UAAU,YAAY,YAAY,QAAQ,cAC5C,MAAM,IAAI,QACR,qBACA,kCAAkC,UAAU,oBAC9C;GAEJ;GACA,OAAO,KAAK,GAAG,QAAQ,KAAK,UAAU,QAAQ,WAAW,KAAK,CAAC,CAAC;GAChE,YAAY,OAAO,GAAG,EAAE,CAAC,CAAE,QAAQ;EACrC;EACA,OAAO;CACT;;CAGA,MAAM,YAAY,OAChB,WACA,YACA,iBAC2B;EAC3B,IAAI,iBAAiB,KAAA,KAAa,gBAAgB,YAAY,OAAO,CAAC;EACtE,MAAM,kBAAkB,MAAM,aAAa,SAAS;EACpD,MAAM,WAAW,KAAK,IAAI,gBAAgB,iBAAiB,eAAe;EAC1E,IAAI,YAAY,YAAY,OAAO,CAAC;EAEpC,MAAM,OAAsB,CAAC;EAC7B,IAAI,YAAY,aAAa;EAC7B,OAAO,aAAa,UAAU;GAE5B,MAAM,OAAO,MAAM,cACjB,WACA,YAAY,GACZ,UACA,cACF;GACA,IAAI,KAAK,WAAW,GAClB,MAAM,IAAI,QACR,qBACA,kCAAkC,UAAU,uBAAuB,UACrE;GAEF,KAAK,IAAI,WAAW,GAAG,WAAW,KAAK,QAAQ,YAAY,GACzD,IAAI,KAAK,SAAS,CAAE,UAAU,YAAY,UACxC,MAAM,IAAI,QACR,qBACA,kCAAkC,UAAU,oBAC9C;GAGJ,MAAM,YAAY,KAAK,GAAG,EAAE,CAAC,CAAE;GAC/B,IAAI,YAAY,aAAa,YAAY,UACvC,MAAM,IAAI,QACR,qBACA,kCAAkC,UAAU,kBAC9C;GAEF,KAAK,KAAK,GAAG,IAAI;GACjB,YAAY,YAAY;EAC1B;EACA,OAAO;CACT;CAEA,OAAO;EACL,MAAM,OAAO,WAAW,QAAQ;GAC9B,OAAO,KAAK,YAAY;IAEtB,MAAM,cADW,OAAO,QAAQ,MAAM,EAAE,OAAO,KAAA,CACpB,CAAC,CAAC,KAAK,MAAM,EAAE,EAAY;IACtD,IAAI,IAAI,IAAI,WAAW,CAAC,CAAC,SAAS,YAAY,QAC5C,MAAM,IAAI,QACR,2BACA,iDACF;IAEF,MAAM,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ;IAChC,MAAM,UAAU,OAAO,KAAK,OAAO;KACjC,IAAI,EAAE,MAAM,WAAW;KACvB,MAAM,EAAE;KACR,SAAS,EAAE;KACX,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,IAAI;KAClC,MAAM,EAAE,QAAQ;KAChB,SAAS,EAAE,YAAY;IACzB,EAAE;IACF,MAAM,OAA+B;KACnC;KACA;KACA,QAAQ;KACR,GAAG,QAAQ,SAAS,MAAM;MACxB,EAAE;MACF,EAAE;MACF,KAAK,EAAE,OAAO;MACd,EAAE,QAAQ,KAAK,EAAE,KAAK,IAAI;MAC1B,EAAE,QAAQ;MACV,EAAE,UAAU,MAAM;KACpB,CAAC;IACH;IACA,MAAM,QAAS,MAAM,WACnB,YACA;KACE,SAAS,SAAS;KAClB,SAAS,SAAS;KAClB;KACA,QAAQ,SAAS;KACjB,WAAW,SAAS;KACpB,SAAS,SAAS;KAClB,WAAW,SAAS;IACtB,GACA,IACF;IAEA,MAAM,CAAC,WAAW;IAClB,IAAI,YAAY,SACd,OAAO;KAAE,QAAQ,CAAC;KAAG,YAAY,MAAM,OAAO;IAAI;IAEpD,IAAI,YAAY,WACd,MAAM,IAAI,QACR,2BACA,aAAa,MAAM,GAAG,oCACxB;IAEF,IAAI,YAAY,aACd,MAAM,IAAI,UACR,qBAAqB,MAAM,GAAG,eAAe,UAAU,EACzD;IAEF,IAAI,YAAY,cACd,MAAM,IAAI,QACR,sBACA,8BAA8B,MAAM,GAAG,eAAe,UAAU,EAClE;IAEF,IAAI,YAAY,WACd,MAAM,IAAI,QACR,2BACA,eAAe,MAAM,GAAG,wBAAwB,OAAO,SAAS,OAAO,MAAM,EAAE,EAAE,cACnF;IAEF,IAAI,YAAY,OAAO;KAGrB,MAAM,aAAa,MAAM,OAAO;KAChC,MAAM,SAAS,IAAI,IAAI,MAAM,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;KACjD,MAAM,MAAM,KAAK,IAAI,GAAG,MAAM;KAE9B,MAAM,YAAW,MADE,UAAU,WAAW,MAAM,CAAC,EAAA,CACzB,QAAQ,QAAQ,OAAO,IAAI,IAAI,KAAK,CAAC;KAC3D,OAAO;MACL,QAAQ,iBAAiB,QAAQ,QAAQ;MACzC;KACF;IACF;IACA,MAAM,OAAO,OAAO,MAAM,EAAE,IAAI;IAChC,IAAI,MAAM,OAAO,KAAK,SAAS,WAAW,OAAO,QAAQ,MAAM;IAC/D,OAAO;KACL,QAAQ,QAAQ,KAAK,GAAG,OAAO;MAC7B,IAAI,EAAE;MACN,MAAM,EAAE;MACR,SAAS,gBAAgB,EAAE,OAAO;MAClC,OAAO,OAAO,IAAI;MAClB;MACA,WAAW,IAAI,KAAK,GAAG;MACvB,OAAO,EAAE;MACT,MAAM,EAAE;MACR,aAAa,EAAE,UAAU,IAAI,KAAK,GAAG,IAAI;MACzC,oBAAoB;MACpB,kBAAkB;MAClB,gBAAgB;MAChB,eAAe;MACf,cAAc;MACd,aAAa;MACb,gBAAgB;MAChB,cAAc;MACd,cAAc;MACd,mBAAmB;MACnB,WAAW;MACX,UAAU;KACZ,EAAE;KACF,YAAY,MAAM,OAAO;IAC3B;GACF,CAAC;EACH;EAEA,MAAM,KAAK,WAAW,MAAM;GAC1B,OAAO,KAAK,YAAY;IAMtB,OAAO,MALY,UACjB,WACA,MAAM,cAAc,GACpB,MAAM,YACR;GAEF,CAAC;EACH;EAEA,MAAM,eAAe,EACnB,WACA,QACA,OACA,aACA,kBACC;GACD,OAAO,KAAK,YAAY;IACtB,MAAM,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ;IAChC,MAAM,YAAY,eAAe,MAAM;IACvC,MAAM,WAAW,kBAAkB,CAAC;IACpC,MAAM,QAAS,MAAM,WACnB,qBACA;KACE,SAAS,SAAS;KAClB,SAAS,SAAS;KAClB,QAAQ,SAAS;KACjB,WAAW,SAAS;KACpB,SAAS,SAAS;IACpB,GACA;KAAC;KAAQ;KAAK;KAAW,SAAS;KAAQ,GAAG;IAAQ,CACvD;IACA,OAAO,uBAAuB,WAAW,KAAK;GAChD,CAAC;EACH;EAEA,MAAM,YAAY,EAAE,WAAW,QAAQ,QAAQ,OAAO,eAAe;GACnE,OAAO,KAAK,YAAY;IACtB,MAAM,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ;IAChC,MAAM,YAAY,eAAe,MAAM;IACvC,MAAM,QAAS,MAAM,WACnB,kBACA,CAAC,SAAS,SAAS,GAAG,QAAQ,SAAS,CAAC,GACxC;KACE;KACA;KACA;KACA,OAAO;KACP,GAAG,OAAO,SAAS,UAAU,CAAC,MAAM,OAAO,MAAM,OAAO,CAAC;IAC3D,CACF;IACA,MAAM,eAAe,OAAO,MAAM,EAAE;IACpC,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM;IACxC,OAAO;KACL,SAAS,OAAO,MAAM,GAAG,YAAY,CAAC,CAAC,UAAU,GAAG,MAAM,IAAI,CAAC;KAC/D,YAAY,OAAO,MAAM,YAAY,CAAC,CAAC,UAAU,GAAG,MAAM,IAAI,CAAC;IACjE;GACF,CAAC;EACH;EAEA,MAAM,gBAAgB,EAAE,WAAW,OAAO,SAAS,UAAU;GAC3D,OAAO,KAAK,YAAY;IACtB,MAAM,MAAM,OAAO,KAAK,UAAU,MAAM,EAAE;IAC1C,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,QAC5B,MAAM,IAAI,QACR,2BACA,iDACF;IAEF,MAAM,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ;IAChC,MAAM,QAAS,MAAM,WACnB,sBACA;KACE,SAAS,SAAS;KAClB,SAAS,SAAS;KAClB;KACA,QAAQ,SAAS;KACjB,WAAW,SAAS;KACpB,SAAS,SAAS;KAClB,WAAW,SAAS;IACtB,GACA;KACE;KACA;KACA;KACA;KACA,OAAO;KACP,GAAG,OAAO,SAAS,UAAU;MAC3B,MAAM;MACN,MAAM;MACN,KAAK,MAAM,OAAO;MAClB,MAAM,QAAQ;MACd,MAAM,YAAY,OAAO,MAAM;KACjC,CAAC;IACH,CACF;IACA,MAAM,UAAU,MAAM;IACtB,IAAI,YAAY,WACd,MAAM,IAAI,UACR,qBAAqB,MAAM,eAAe,UAAU,EACtD;IAEF,IAAI,YAAY,WACd,MAAM,IAAI,QACR,2BACA,uDACF;IAEF,IAAI,YAAY,cAAc,OAAO,EAAE,QAAQ;IAE/C,MAAM,QAAQ;KAAE;KAAO;IAAQ;IAC/B,IAAI,YAAY,MAAM;KACpB,MAAM,OAAO,OAAO,MAAM,EAAE,IAAI;KAChC,IAAI,OAAO,SAAS,KAAK,MAAM,OAAO,KACpC,SAAS,WAAW,OAAO,OAAO,MAAM;KAE1C,OAAO;MACL,SAAS;MACT,QAAQ,OAAO,KAAK,OAAO,OAAO;OAChC,IAAI,MAAM;OACV,MAAM,MAAM;OACZ,SAAS,gBAAgB,MAAM,OAAO;OACtC,OAAO,OAAO,IAAI;OAClB;OACA,WAAW,IAAI,KAAK,GAAG;OACvB;OACA,MAAM,MAAM,QAAQ;OACpB,aAAa,MAAM,YAAY,OAAO,IAAI,KAAK,GAAG,IAAI;OACtD,oBAAoB;OACpB,kBAAkB;OAClB,gBAAgB;OAChB,eAAe;OACf,cAAc;OACd,aAAa;OACb,gBAAgB;OAChB,cAAc;OACd,cAAc;OACd,mBAAmB;OACnB,WAAW;OACX,UAAU;MACZ,EAAE;KACJ;IACF;IACA,IAAI,YAAY,aAAa;KAC3B,IAAI,OAAO,WAAW,GACpB,OAAO;MAAE,SAAS;MAAa,QAAQ,CAAC;KAAE;KAE5C,MAAM,SAAS,IAAI,IAAI,MAAM,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC;KACjD,MAAM,MAAM,KAAK,IAAI,GAAG,MAAM;KAC9B,MAAM,OAAO,MAAM,UAAU,WAAW,MAAM,CAAC;KAC/C,MAAM,UAAU,IAAI,IAAI,KAAK,KAAK,QAAQ,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;KAC3D,MAAM,WAAW,MACd,MAAM,CAAC,CAAC,CACR,KAAK,UAAU,QAAQ,IAAI,OAAO,KAAK,CAAC,CAAE;KAC7C,OAAO;MACL,SAAS;MACT,QAAQ,iBAAiB,QAAQ,QAAQ;KAC3C;IACF;IACA,MAAM,IAAI,UAAU,kCAAkC,QAAQ,EAAE;GAClE,CAAC;EACH;EAEA,MAAM,YAAY,EAAE,WAAW,OAAO,SAAS,OAAO,eAAe;GACnE,OAAO,KAAK,YAAY;IACtB,MAAM,QAAS,MAAM,WACnB,kBACA;KACE,SAAS,SAAS;KAClB,QAAQ,SAAS;KACjB,WAAW,SAAS;KACpB,SAAS,SAAS;IACpB,GACA;KAAC;KAAO;KAAS;KAAO;KAAa,MAAM,IAAI,CAAC,CAAC,QAAQ;IAAC,CAC5D;IACA,MAAM,UAAU,MAAM;IACtB,IAAI,YAAY,WACd,MAAM,IAAI,UACR,qBAAqB,MAAM,eAAe,UAAU,EACtD;IAEF,OAAO;KACI;KACT,cAAc,OAAO,MAAM,EAAE;IAC/B;GACF,CAAC;EACH;EAEA,MAAM,UAAU,WAAW,aAAa;GACtC,OAAO,KAAK,YAAY;IACtB,MAAM,QAAS,MAAM,WACnB,gBACA,CAAC,QAAQ,WAAW,WAAW,GAAG,SAAS,SAAS,CAAC,GACrD,CAAC,CACH;IACA,MAAM,MAAM,MAAM;IAClB,MAAM,SACJ,QAAQ,KACJ,OACC,KAAK,MAAM,GAAG;IACrB,MAAM,WAAW,OAAO,MAAM,EAAE;IAChC,IACE,CAAC,OAAO,cAAc,QAAQ,KAC9B,WAAW,KACV,WAAW,SACT,CAAC,OAAO,cAAc,OAAO,KAAK,KAAK,OAAO,QAAQ,IAEzD,MAAM,IAAI,QACR,qBACA,qCAAqC,UAAU,aACjD;IAEF,MAAM,SAAS,MAAM,eACnB,WACA,QAAQ,SAAS,GACjB,QACF;IACA,OAAO;KACL,UAAU,SACN;MAAE,OAAO,OAAO;MAAO,OAAO,OAAO;KAAM,IAC3C;KACJ;IACF;GACF,CAAC;EACH;EAEA,MAAM,YAAY,WAAW,aAAa,OAAO,OAAO;GACtD,MAAM,KAAK,YAAY;IACrB,MAAM,WACJ,kBACA,CAAC,QAAQ,WAAW,WAAW,CAAC,GAChC,CAAC,OAAO,KAAK;KAAE;KAAO;KAAO,WAAW,MAAM,IAAI,CAAC,CAAC,QAAQ;IAAE,CAAC,CAAC,CAClE;GACF,CAAC;EACH;EAEA,UAAU;GACR,MAAM,IAAI,IAAI,aAAa,QAAQ,MAAM;IACvC,OAAO,KAAK,YAAY;KACtB,MAAM,UAAU,OAAO,QAAQ,MAAM;KACrC,IAAI,QAAQ,WAAW,GAAG,OAAO;KACjC,MAAM,OAAO,KAAK,GAAG,QAAQ;KAI7B,MAAM,cAAc,MAAM,IAAI,CAAC,CAAC,QAAQ,IAAI,KAAK;KAIjD,MAAM,UAAW,MAAM,WACrB,kBACA,CAAC,YAAY,EAAE,CAAC,GAChB;MACE;MACA,KAAK;MACL,QAAQ;MACR,GAAG,QAAQ,SAAS,CAAC,OAAO,WAAW,CACrC,KAAK,UAAU,CAAC,aAAa,KAAK,CAAC,GACnC,UAAU,OACN,KACA,KAAK;OACH,GAAG;OACH,GAAG,KAAK;OACR,GAAG;OACH,GAAG;MACL,CAAC,CACP,CAAC;KACH,CACF;KACA,IAAI,QAAQ,WAAW,GAAG,OAAO;KAGjC,MAAM,gBAAyC,gBAAgB;KAC/D,KAAK,MAAM,YAAY,SAAS;MAC9B,MAAM,CAAC,OAAO,SAAS,QAAQ,OAAO,QAAQ,IAAI;MAClD,cAAc,SAAS,gBAAgB,KAAK;KAC9C;KACA,OAAO;MACL;MACA,QAAQ;MACR,MAAM,KAAK;MACX,IAAI,IAAI,KAAK,IAAI;KACnB;IACF,CAAC;GACH;GAEA,MAAM,KAAK,IAAI;IACb,OAAO,KAAK,YAAY;KACtB,MAAM,QAAS,MAAM,WACnB,mBACA,CAAC,YAAY,EAAE,CAAC,GAChB,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,CACxB;KACA,MAAM,OAAsB,CAAC;KAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,GAAG;MAC5C,MAAM,CAAC,aAAa,SAAS,KAAK,MAAM,MAAM,EAAG;MAIjD,MAAM,QAAQ,KAAK,MAAM,MAAM,IAAI,EAAG;MAMtC,KAAK,KAAK;OACR;OACA;OACA,OAAO,MAAM;OACb,MAAM,MAAM;OACZ,IAAI,IAAI,KAAK,MAAM,CAAC;OACpB,WAAW,IAAI,KAAK,MAAM,CAAC;MAC7B,CAAC;KACH;KACA,OAAO;IACT,CAAC;GACH;EACF;EAEA,MAAM,UAAU,WAAW,YAAY,cAAc;GACnD,OAAO,WAAW,UAAU,WAAW,YAAY,YAAY,CAAC;EAClE;EAEA,MAAM,WAAW,WAAW,YAAY;GACtC,OAAO,KAAK,YAAY;IAOtB,QAAO,MANgB,KACrB,UACA,SAAS,SAAS,GAClB,GAAG,aAAa,EAAE,KAClB,GACF,EAAA,CACe,KAAK,UAAU,QAAQ,WAAW,KAAK,CAAC;GACzD,CAAC;EACH;EAEA,MAAM,YAAY,WAAW,OAAO;GAClC,MAAM,WAAW,KAAK,OAAO,WAAW,SAAS,GAAG,KAAK,MAAM,KAAK,CAAC;EACvE;CACF;AACF"}