@smthrs/std 0.0.0-stage → 1.0.0-rc.12

package/dist/cjs/NodeLanguageServer.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/NodeLanguageServer.ts"],
+  "sourcesContent": ["/**\n * Host-backed Language Server Protocol client over the permission-checked\n * process spawner.\n *\n * LSP is framed JSON-RPC over ordinary stdio pipes, so the client spawns\n * through `@smthrs/kernel`'s `ChildProcessSpawner`; a terminal is never\n * involved.\n *\n * @since 1.0.0\n */\n\nimport * as ChildProcessEnvironment from \"@smthrs/kernel/ChildProcessEnvironment\"\nimport * as ChildProcessSpawner from \"@smthrs/kernel/ChildProcessSpawner\"\nimport { Clock, Deferred, Effect, Fiber, Layer, Option, Queue, type Scope, Semaphore, Stream } from \"effect\"\nimport * as ChildProcess from \"effect/process/ChildProcess\"\nimport { createHash } from \"node:crypto\"\nimport * as NodeFs from \"node:fs\"\nimport * as NodePath from \"node:path\"\nimport { fileURLToPath, pathToFileURL } from \"node:url\"\nimport * as LanguageServer from \"./LanguageServer.ts\"\nimport * as StdError from \"./StdError.ts\"\n\n/**\n * Maximum frames buffered for a language server's standard input.\n *\n * Bounded offers apply backpressure, and each offer uses the request timeout\n * so a server that stops reading produces a typed timeout instead of an\n * unbounded queue or a new hang.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_QUEUED_FRAMES = 256\n\n/**\n * Maximum concurrent JSON-RPC requests awaiting a response.\n *\n * Every entry already has a timeout, and process exit or stdout closure fails\n * all entries. This cap is the last-resort bound for a host that fans out\n * requests without limit.\n *\n * @category constants\n * @since 1.0.0\n */\nexport const MAX_PENDING_REQUESTS = 512\n\nconst DEFAULT_SETTLE_MS = 5_000\nconst DEFAULT_QUIET_MS = 300\n\n/**\n * A request every server must refuse at once: the specification has a server\n * answer an unknown `$/` request with MethodNotFound.\n */\nconst BARRIER_METHOD = \"$/smithers/barrier\"\n/** A server that has not answered the barrier in this long is not asked again. */\nconst BARRIER_TIMEOUT_MS = 1_000\n\n/**\n * One host language-server process.\n *\n * Response headers may contain at most 8 KiB, and response bodies may contain\n * at most 8 MiB.\n *\n * @category models\n * @since 1.0.0\n */\nexport interface Config {\n  /**\n   * The file extensions this server answers for, such as `[\".ts\", \".tsx\"]`.\n   * A server without `extensions` answers every file no other server claims.\n   */\n  readonly extensions?: ReadonlyArray<string> | undefined\n  readonly command: string\n  readonly args?: ReadonlyArray<string> | undefined\n  readonly cwd: string\n  readonly environment?: Readonly<Record<string, string>> | undefined\n  /**\n   * Sent as `initializationOptions` on `initialize`. A host pins where the\n   * server loads its own code from here, for example\n   * `{ tsserver: { path: \"<host copy>/tsserver.js\" } }` for\n   * typescript-language-server, which otherwise runs the workspace's own\n   * `node_modules/typescript`.\n   */\n  readonly initializationOptions?: unknown\n  readonly timeoutMs?: number | undefined\n  /**\n   * How long `diagnostics` waits for a server without pull diagnostics to\n   * publish for the latest synced text, then fails with `timeout`. Defaults to\n   * 5 seconds. typescript-language-server publishes nothing for a change that\n   * leaves a file with no problems, so such a change always waits this long.\n   */\n  readonly settleMs?: number | undefined\n  /**\n   * After a publish, how long `diagnostics` waits for a later one before\n   * answering, within `settleMs`. A server may publish syntax errors before\n   * semantic ones: typescript-language-server does on the first open of a\n   * file. Defaults to 300 milliseconds.\n   */\n  readonly quietMs?: number | undefined\n}\n\ninterface JsonRpcMessage {\n  readonly id?: unknown\n  readonly method?: unknown\n  readonly params?: unknown\n  readonly result?: unknown\n  readonly error?: unknown\n}\n\n/** JSON-RPC's code for a method the server does not implement. */\nconst METHOD_NOT_FOUND = -32601\n\nconst LANGUAGE_IDS: Readonly<Record<string, string>> = {\n  \".ts\": \"typescript\",\n  \".mts\": \"typescript\",\n  \".cts\": \"typescript\",\n  \".tsx\": \"typescriptreact\",\n  \".js\": \"javascript\",\n  \".mjs\": \"javascript\",\n  \".cjs\": \"javascript\",\n  \".jsx\": \"javascriptreact\",\n  \".py\": \"python\",\n  \".rs\": \"rust\",\n  \".go\": \"go\",\n  \".rb\": \"ruby\",\n  \".sh\": \"shellscript\",\n  \".md\": \"markdown\",\n  \".yml\": \"yaml\",\n  \".cc\": \"cpp\",\n  \".cpp\": \"cpp\",\n  \".hpp\": \"cpp\",\n  \".cs\": \"csharp\"\n}\n\nconst extensionOf = (path: string): string => NodePath.extname(path).toLowerCase()\n\nconst languageId = (path: string): string => {\n  const extension = extensionOf(path)\n  return LANGUAGE_IDS[extension] ?? (extension.slice(1) || \"plaintext\")\n}\n\ninterface FrameDecoder {\n  readonly push: (chunk: Uint8Array) => ReadonlyArray<FrameEvent>\n}\n\ntype FrameEvent =\n  | { readonly _tag: \"Message\"; readonly value: unknown }\n  | { readonly _tag: \"Failure\"; readonly error: StdError.StdError; readonly id?: number | undefined }\n\nconst failure = (code: StdError.Code, message: string): StdError.StdError => new StdError.StdError({ code, message })\n\nconst maximumHeaderBytes = 8 * 1024\nconst maximumFrameBytes = 8 * 1024 * 1024\nconst headerEnd = new Uint8Array([13, 10, 13, 10])\nconst contentLengthPrefix = new TextEncoder().encode(\"Content-Length:\")\n\nconst concatenate = (left: Uint8Array, right: Uint8Array): Uint8Array => {\n  const combined = new Uint8Array(left.length + right.length)\n  combined.set(left)\n  combined.set(right, left.length)\n  return combined\n}\n\ninterface ChunkBuffer {\n  readonly length: number\n  readonly push: (chunk: Uint8Array) => void\n  readonly indexOf: (needle: Uint8Array) => number\n  // Counts come from delimiter offsets or validated Content-Length values.\n  // A reader can only be acquired for an available, nonnegative prefix.\n  readonly prefix: (length: number) => {\n    readonly take: () => Uint8Array\n    readonly discard: () => void\n  } | undefined\n}\n\nconst makeChunkBuffer = (): ChunkBuffer => {\n  let chunks: Array<Uint8Array> = []\n  let head = 0\n  let headOffset = 0\n  let length = 0\n\n  const compact = (): void => {\n    if (head === chunks.length) {\n      chunks = []\n      head = 0\n      headOffset = 0\n    } else if (head >= 64 && head * 2 >= chunks.length) {\n      chunks = chunks.slice(head)\n      head = 0\n    }\n  }\n\n  const consume = (count: number, output?: Uint8Array): void => {\n    let remaining = count\n    let outputOffset = 0\n    for (const chunk of chunks.slice(head)) {\n      if (remaining === 0) break\n      const available = chunk.byteLength - headOffset\n      const consumed = Math.min(available, remaining)\n      if (output !== undefined) {\n        output.set(chunk.subarray(headOffset, headOffset + consumed), outputOffset)\n        outputOffset += consumed\n      }\n      headOffset += consumed\n      length -= consumed\n      remaining -= consumed\n      if (headOffset === chunk.byteLength) {\n        head++\n        headOffset = 0\n      }\n    }\n    compact()\n  }\n\n  return {\n    get length() {\n      return length\n    },\n    push: (chunk) => {\n      if (chunk.byteLength === 0) return\n      // Own the bytes so caller mutation or resizing cannot change buffered lengths.\n      chunks.push(chunk.slice())\n      length += chunk.byteLength\n    },\n    indexOf: (needle) => {\n      let absolute = 0\n      let matched = 0\n      for (let chunkIndex = head; chunkIndex < chunks.length; chunkIndex++) {\n        const chunk = chunks[chunkIndex]!\n        const start = chunkIndex === head ? headOffset : 0\n        for (let index = start; index < chunk.byteLength; index++) {\n          const byte = chunk[index]\n          if (byte === needle[matched]) matched++\n          else matched = byte === needle[0] ? 1 : 0\n          if (matched === needle.byteLength) return absolute - needle.byteLength + 1\n          absolute++\n        }\n      }\n      return -1\n    },\n    prefix: (count) => {\n      if (count > length) return undefined\n      return {\n        take: () => {\n          const output = new Uint8Array(count)\n          consume(count, output)\n          return output\n        },\n        discard: () => consume(count)\n      }\n    }\n  }\n}\n\nconst malformedId = (body: string): number | undefined => {\n  const match = /\"id\"\\s*:\\s*(\\d+)/.exec(body)\n  if (match === null) return undefined\n  const id = Number(match[1])\n  return Number.isSafeInteger(id) ? id : undefined\n}\n\nconst makeFrameDecoder = (): FrameDecoder => {\n  const pending = makeChunkBuffer()\n  let bodyLength: number | undefined\n  let resynchronizing = false\n  return {\n    push: (chunk) => {\n      pending.push(chunk)\n      const events: Array<FrameEvent> = []\n      while (pending.length > 0 || bodyLength === 0) {\n        if (resynchronizing) {\n          const nextHeader = pending.indexOf(contentLengthPrefix)\n          if (nextHeader < 0) {\n            pending.prefix(Math.max(0, pending.length - contentLengthPrefix.byteLength + 1))!.discard()\n            break\n          }\n          pending.prefix(nextHeader)!.discard()\n          resynchronizing = false\n        }\n        if (bodyLength !== undefined) {\n          const reader = pending.prefix(bodyLength)\n          if (reader === undefined) break\n          const body = new TextDecoder().decode(reader.take())\n          bodyLength = undefined\n          try {\n            events.push({ _tag: \"Message\", value: JSON.parse(body) as unknown })\n          } catch {\n            events.push({\n              _tag: \"Failure\",\n              error: failure(\"request_failed\", \"Language server returned malformed JSON\"),\n              id: malformedId(body)\n            })\n          }\n          continue\n        }\n        const delimiter = pending.indexOf(headerEnd)\n        if (delimiter < 0) {\n          if (pending.length > maximumHeaderBytes) {\n            events.push({\n              _tag: \"Failure\",\n              error: failure(\n                \"request_failed\",\n                `Language server frame header exceeded ${maximumHeaderBytes} bytes`\n              )\n            })\n            pending.prefix(1)!.discard()\n            resynchronizing = true\n            continue\n          }\n          break\n        }\n        if (delimiter > maximumHeaderBytes) {\n          events.push({\n            _tag: \"Failure\",\n            error: failure(\"request_failed\", `Language server frame header exceeded ${maximumHeaderBytes} bytes`)\n          })\n          pending.prefix(delimiter + headerEnd.byteLength)!.discard()\n          resynchronizing = true\n          continue\n        }\n        const header = new TextDecoder().decode(pending.prefix(delimiter)!.take())\n        pending.prefix(headerEnd.byteLength)!.discard()\n        const match = /(?:^|\\r\\n)Content-Length:\\s*(\\d+)(?:\\r\\n|$)/i.exec(header)\n        if (match === null) {\n          events.push({\n            _tag: \"Failure\",\n            error: failure(\"request_failed\", \"Language server frame omitted Content-Length\")\n          })\n          resynchronizing = true\n          continue\n        }\n        const length = Number(match[1])\n        if (!Number.isSafeInteger(length) || length < 0 || length > maximumFrameBytes) {\n          events.push({\n            _tag: \"Failure\",\n            error: failure(\"request_failed\", `Language server frame exceeded ${maximumFrameBytes} bytes`)\n          })\n          resynchronizing = true\n          continue\n        }\n        bodyLength = length\n      }\n      return events\n    }\n  }\n}\n\nconst asMessage = (value: unknown): JsonRpcMessage | undefined =>\n  typeof value === \"object\" && value !== null && !Array.isArray(value)\n    ? value\n    : undefined\n\nconst frame = (message: unknown): Uint8Array => {\n  const body = new TextEncoder().encode(JSON.stringify(message))\n  const header = new TextEncoder().encode(`Content-Length: ${body.byteLength}\\r\\n\\r\\n`)\n  return concatenate(header, body)\n}\n\nconst firstCallHierarchyItem = (value: unknown): unknown | undefined => Array.isArray(value) ? value[0] : undefined\n\nconst isFile = (path: string): boolean => {\n  try {\n    return NodeFs.statSync(path, { throwIfNoEntry: false })?.isFile() === true\n  } catch {\n    return false\n  }\n}\n\n/** Whether anything, a file or a directory, exists at `path`. */\nconst exists = (path: string): boolean => {\n  try {\n    return NodeFs.statSync(path, { throwIfNoEntry: false }) !== undefined\n  } catch {\n    return false\n  }\n}\n\nconst realPath = (path: string): string => {\n  try {\n    return NodeFs.realpathSync(path)\n  } catch {\n    return NodePath.resolve(path)\n  }\n}\n\nconst isWithin = (root: string, path: string): boolean => {\n  const relative = NodePath.relative(root, path)\n  return relative === \"\" || (relative !== \"..\" && !relative.startsWith(`..${NodePath.sep}`) &&\n    !NodePath.isAbsolute(relative))\n}\n\n/**\n * Resolves the program a spawn would execute: a command containing a path\n * separator against `cwd`, a bare name through the child's `PATH`, where an\n * empty or relative entry is relative to `cwd`.\n */\nconst resolveCommand = (command: string, cwd: string, path: string | undefined): string | undefined => {\n  if (command.includes(\"/\") || command.includes(NodePath.sep)) {\n    const candidate = NodePath.resolve(cwd, command)\n    return isFile(candidate) ? candidate : undefined\n  }\n  for (const entry of (path ?? \"\").split(NodePath.delimiter)) {\n    const candidate = NodePath.resolve(cwd, entry, command)\n    if (!isFile(candidate)) continue\n    try {\n      NodeFs.accessSync(candidate, NodeFs.constants.X_OK)\n      return candidate\n    } catch {\n      continue\n    }\n  }\n  return undefined\n}\n\n/**\n * Refuses a server whose program or any file-naming argument lies in the\n * workspace. The server runs on the host as the host user, so a program the\n * workspace supplies (its `node_modules/.bin`, a `./` script, a symlink it\n * planted) would let workspace files choose what the host executes.\n */\n/**\n * Programs whose job is to run another program named in their arguments or\n * found in the working directory: shells, `env`, and package runners. Their\n * arguments are code or package names, not files, so the workspace check below\n * cannot see what they would execute (`sh -c node_modules/.bin/x`, `npx x`).\n */\nconst LAUNCHERS = new Set([\n  \"sh\",\n  \"bash\",\n  \"zsh\",\n  \"dash\",\n  \"ksh\",\n  \"fish\",\n  \"csh\",\n  \"tcsh\",\n  \"env\",\n  \"npx\",\n  \"pnpx\",\n  \"npm\",\n  \"pnpm\",\n  \"yarn\",\n  \"bunx\",\n  \"deno\",\n  \"cmd\",\n  \"powershell\",\n  \"pwsh\"\n])\n\n/** Interpreter flags that take code or a module to load instead of a file path. */\nconst CODE_FLAGS = new Set([\"-e\", \"--eval\", \"-p\", \"--print\", \"-r\", \"--require\", \"--import\", \"--loader\"])\n\nconst launcher = (config: Config): string | undefined => {\n  const name = NodePath.basename(config.command).toLowerCase().replace(/\\.(?:exe|cmd|bat|ps1)$/, \"\")\n  if (LAUNCHERS.has(name)) return name\n  if (name !== \"node\" && name !== \"bun\" && name !== \"nodejs\") return undefined\n  const args = config.args ?? []\n  if (name === \"bun\" && [\"x\", \"run\", \"exec\"].includes(args[0] ?? \"\")) return `bun ${args[0]}`\n  const flag = args.find((argument) => CODE_FLAGS.has(argument.split(\"=\")[0]!) || argument === \"--experimental-loader\")\n  return flag === undefined ? undefined : `${name} ${flag.split(\"=\")[0]}`\n}\n\nconst workspaceProgram = (\n  config: Config,\n  path: string | undefined\n): StdError.StdError | undefined => {\n  const launching = launcher(config)\n  if (launching !== undefined) {\n    return failure(\n      \"permission_denied\",\n      `Language server command runs ${launching}, which executes a program its arguments or the workspace choose; name the server's own host binary instead`\n    )\n  }\n  const lexicalRoot = NodePath.resolve(config.cwd)\n  const realRoot = realPath(lexicalRoot)\n  const inWorkspace = (file: string): boolean =>\n    isWithin(lexicalRoot, file) || isWithin(realRoot, file) || isWithin(realRoot, realPath(file)) ||\n    isWithin(lexicalRoot, realPath(file))\n  const program = resolveCommand(config.command, lexicalRoot, path)\n  if (program !== undefined && inWorkspace(program)) {\n    return failure(\n      \"permission_denied\",\n      `Language server program ${program} is inside the workspace ${lexicalRoot}; run a host copy instead`\n    )\n  }\n  for (const argument of config.args ?? []) {\n    for (const value of [argument, argument.slice(argument.indexOf(\"=\") + 1)]) {\n      if (value === \"\") continue\n      const candidate = NodePath.resolve(lexicalRoot, value)\n      // A directory counts: `node <dir>` runs `<dir>/index.js` or its package main.\n      if (exists(candidate) && inWorkspace(candidate)) {\n        return failure(\n          \"permission_denied\",\n          `Language server argument names ${candidate}, a path inside the workspace ${lexicalRoot}`\n        )\n      }\n    }\n  }\n  return undefined\n}\n\ninterface PublishedDiagnostics {\n  readonly version: number | undefined\n  readonly sequence: number\n  readonly diagnostics: ReadonlyArray<unknown>\n}\n\ninterface OpenDocument {\n  readonly version: number\n  /** The publish sequence number when this version was sent. */\n  readonly sentAt: number\n  /** The SHA-256 of the text last sent, so `refresh` resends only changed files. */\n  readonly digest: string\n}\n\nconst digestOf = (text: string): string => createHash(\"sha256\").update(text).digest(\"hex\")\n\nconst makeClient = (\n  config: Config\n): Effect.Effect<\n  LanguageServer.LanguageServer,\n  StdError.StdError,\n  ChildProcessSpawner.ChildProcessSpawner | Scope.Scope\n> =>\n  Effect.gen(function*() {\n    const spawner = yield* ChildProcessSpawner.ChildProcessSpawner\n    const timeoutMs = config.timeoutMs ?? 30_000\n    const settleMs = config.settleMs ?? DEFAULT_SETTLE_MS\n    const quietMs = config.quietMs ?? DEFAULT_QUIET_MS\n    const env = ChildProcessEnvironment.make(process.env, config.environment)\n    const refused = yield* Effect.sync(() => workspaceProgram(config, env.PATH))\n    if (refused !== undefined) return yield* Effect.fail(refused)\n    // The process's stdin is fed from this queue for the client's lifetime, so\n    // each request is one offered frame and the pipe never closes between them.\n    const input = yield* Queue.bounded<Uint8Array>(MAX_QUEUED_FRAMES)\n    const handle = yield* spawner.spawn(\n      ChildProcess.make(config.command, config.args ?? [], {\n        cwd: config.cwd,\n        env,\n        extendEnv: false,\n        stdin: { stream: Stream.fromQueue(input), endOnDone: false }\n      })\n    ).pipe(\n      Effect.mapError((error) =>\n        failure(\"provider_unavailable\", `Language server process could not be started: ${error.message}`)\n      )\n    )\n    const pending = new Map<number, Deferred.Deferred<unknown, StdError.StdError>>()\n    const decoder = makeFrameDecoder()\n    let nextId = 1\n    let terminalError: StdError.StdError | undefined\n\n    // Keep draining stderr while requests run. Copy retained bytes so a small\n    // tail never holds a larger backing buffer alive.\n    const maximumStderrBytes = 64 * 1024\n    let stderrTail: Uint8Array = new Uint8Array(0)\n    const stderrFiber = yield* handle.stderr.pipe(\n      Stream.runForEach((chunk) =>\n        Effect.sync(() => {\n          stderrTail = chunk.byteLength >= maximumStderrBytes\n            ? chunk.slice(-maximumStderrBytes)\n            : concatenate(\n              stderrTail.slice(Math.max(0, stderrTail.byteLength + chunk.byteLength - maximumStderrBytes)),\n              chunk\n            )\n        })\n      ),\n      Effect.catch((cause) => Effect.logWarning(\"Language server stderr stream failed\", cause)),\n      Effect.forkScoped({ startImmediately: true })\n    )\n    const stderr = (): string => {\n      let start = 0\n      while (start < stderrTail.byteLength && start < 3 && (stderrTail[start]! & 0b1100_0000) === 0b1000_0000) start++\n      return new TextDecoder().decode(stderrTail.subarray(start))\n    }\n\n    const failPending = (error: StdError.StdError): Effect.Effect<void> =>\n      Effect.flatMap(\n        Effect.sync(() => {\n          const deferreds = [...pending.values()]\n          pending.clear()\n          return deferreds\n        }),\n        (deferreds) => Effect.forEach(deferreds, (deferred) => Deferred.fail(deferred, error), { discard: true })\n      )\n\n    const failRequest = (id: number, error: StdError.StdError): Effect.Effect<void> => {\n      const deferred = pending.get(id)\n      if (deferred === undefined) return Effect.void\n      pending.delete(id)\n      return Deferred.fail(deferred, error).pipe(Effect.asVoid)\n    }\n\n    const closeWith = (error: StdError.StdError): Effect.Effect<void> =>\n      Effect.gen(function*() {\n        // stdout EOF and process exit can arrive before the last stderr chunk.\n        // A bounded grace also handles servers that close stdout but stay alive.\n        yield* Fiber.await(stderrFiber).pipe(Effect.timeoutOption(100))\n        terminalError ??= error\n        yield* failPending(terminalError)\n      })\n\n    const uriOf = (path: string): string => pathToFileURL(NodePath.resolve(config.cwd, path)).href\n    const documents = new Map<string, OpenDocument>()\n    // Versions keep climbing across a close and reopen, so a late publish for\n    // the closed text never passes for the reopened one.\n    const versions = new Map<string, number>()\n    const published = new Map<string, PublishedDiagnostics>()\n    const listeners = new Map<string, Set<Deferred.Deferred<void>>>()\n    let publishSequence = 0\n    let pullUnsupported = false\n    let pullSupported = false\n    let versionedPublishes = false\n    let barrierAnswered = true\n\n    const publish = (params: unknown): Effect.Effect<void> => {\n      const notification = asMessage(params) as {\n        readonly uri?: unknown\n        readonly version?: unknown\n        readonly diagnostics?: unknown\n      } | undefined\n      if (typeof notification?.uri !== \"string\" || !Array.isArray(notification.diagnostics)) return Effect.void\n      const uri = notification.uri\n      const version = typeof notification.version === \"number\" ? notification.version : undefined\n      if (version !== undefined) versionedPublishes = true\n      const previous = published.get(uri)?.version\n      // A late publish for an older version never replaces a newer one.\n      if (version !== undefined && previous !== undefined && version < previous) return Effect.void\n      published.set(uri, {\n        version,\n        sequence: ++publishSequence,\n        diagnostics: notification.diagnostics\n      })\n      const waiting = listeners.get(uri)\n      if (waiting === undefined) return Effect.void\n      listeners.delete(uri)\n      return Effect.forEach(waiting, (listener) => Deferred.succeed(listener, undefined), { discard: true })\n    }\n\n    const receive = (value: unknown): Effect.Effect<void> => {\n      const message = asMessage(value)\n      if (message?.method === \"textDocument/publishDiagnostics\") return publish(message.params)\n      if (message === undefined || typeof message.id !== \"number\") return Effect.void\n      const deferred = pending.get(message.id)\n      if (deferred === undefined) return Effect.void\n      pending.delete(message.id)\n      if (message.error === undefined) return Deferred.succeed(deferred, message.result)\n      const error = asMessage(message.error) as {\n        readonly code?: unknown\n        readonly message?: unknown\n        readonly data?: unknown\n      } | undefined\n      return Deferred.fail(\n        deferred,\n        new StdError.StdError({\n          code: \"request_failed\",\n          message: typeof error?.message === \"string\" ? error.message : \"Language server returned a JSON-RPC error\",\n          ...(typeof error?.code === \"number\" && typeof error.message === \"string\"\n            ? {\n              rpcError: {\n                code: error.code,\n                message: error.message,\n                ...(error.data === undefined ? {} : { data: error.data })\n              }\n            }\n            : {})\n        })\n      )\n    }\n\n    const receiveFrame = (event: FrameEvent): Effect.Effect<void> =>\n      event._tag === \"Message\"\n        ? receive(event.value)\n        // A rejected frame has no trustworthy response id. Failing every\n        // waiter prevents another request from hanging behind corrupt framing.\n        : event.id === undefined\n        ? failPending(event.error)\n        : failRequest(event.id, event.error)\n\n    yield* handle.stdout.pipe(\n      Stream.runForEach((chunk) => Effect.forEach(decoder.push(chunk), receiveFrame, { discard: true })),\n      Effect.matchEffect({\n        onFailure: () => closeWith(failure(\"request_failed\", \"Language server output stream failed\")),\n        onSuccess: () => closeWith(failure(\"request_failed\", \"Language server output stream closed\"))\n      }),\n      Effect.forkScoped({ startImmediately: true })\n    )\n\n    yield* handle.exitCode.pipe(\n      Effect.flatMap((exitCode) =>\n        closeWith(failure(\"request_failed\", `Language server process exited with code ${exitCode}`))\n      ),\n      Effect.catch(() => closeWith(failure(\"request_failed\", \"Language server process exited\"))),\n      Effect.forkScoped({ startImmediately: true })\n    )\n\n    const send = (message: unknown): Effect.Effect<void, StdError.StdError> =>\n      Effect.suspend(() =>\n        terminalError === undefined\n          ? Queue.offer(input, frame(message)).pipe(\n            Effect.asVoid,\n            Effect.timeout(timeoutMs),\n            Effect.mapError(() =>\n              failure(\n                \"timeout\",\n                `Language server stdin is not being drained; frame offer exceeded ${timeoutMs}ms`\n              )\n            )\n          )\n          : Effect.fail(terminalError)\n      )\n\n    const request = (\n      method: string,\n      params: unknown\n    ): Effect.Effect<unknown, StdError.StdError> =>\n      Effect.gen(function*() {\n        const deferred = yield* Deferred.make<unknown, StdError.StdError>()\n        const registered = yield* Effect.sync((): number | StdError.StdError => {\n          if (terminalError !== undefined) return terminalError\n          if (pending.size >= MAX_PENDING_REQUESTS) {\n            return failure(\n              \"request_failed\",\n              `Language server reached the ${MAX_PENDING_REQUESTS} pending-request cap`\n            )\n          }\n          const id = nextId++\n          pending.set(id, deferred)\n          return id\n        })\n        if (registered instanceof StdError.StdError) return yield* Effect.fail(registered)\n        const id = registered\n        return yield* Effect.gen(function*() {\n          yield* send({ jsonrpc: \"2.0\", id, method, params })\n          return yield* Deferred.await(deferred).pipe(\n            Effect.timeout(timeoutMs),\n            Effect.mapError((cause) =>\n              cause instanceof StdError.StdError\n                ? cause\n                : failure(\"timeout\", `Language server request timed out: ${method}`)\n            )\n          )\n        }).pipe(\n          Effect.ensuring(\n            Effect.sync(() => {\n              pending.delete(id)\n            })\n          )\n        )\n      }).pipe(Effect.mapError((error) =>\n        new StdError.StdError({\n          ...error,\n          method,\n          message: error.rpcError === undefined ? error.message : `${method}: ${error.message}`,\n          ...(stderrTail.byteLength === 0 ? {} : { stderr: stderr() })\n        })\n      ))\n\n    const notify = (method: string, params: unknown): Effect.Effect<void, StdError.StdError> =>\n      send({ jsonrpc: \"2.0\", method, params })\n\n    yield* request(\"initialize\", {\n      processId: null,\n      rootUri: pathToFileURL(config.cwd).href,\n      capabilities: {\n        textDocument: {\n          synchronization: { dynamicRegistration: false },\n          publishDiagnostics: { versionSupport: true },\n          diagnostic: { dynamicRegistration: false }\n        }\n      },\n      ...(config.initializationOptions === undefined ? {} : { initializationOptions: config.initializationOptions })\n    })\n    yield* notify(\"initialized\", {})\n\n    const positionParams = (position: LanguageServer.Position) => ({\n      textDocument: { uri: uriOf(position.path) },\n      position: { line: position.line, character: position.character }\n    })\n\n    // A publish without a version is read by arrival: it counts for the text\n    // sent before it. Before each sync, a request the server answers at once\n    // drains what it wrote earlier, such as the empty report\n    // typescript-language-server publishes when a file closes, so that report\n    // never passes for the reopened text. Unneeded once the server has pulled\n    // or versioned a publish, and dropped if the server does not answer it.\n    const barrier: Effect.Effect<void> = Effect.suspend(() =>\n      pullSupported || versionedPublishes || !barrierAnswered\n        ? Effect.void\n        : request(BARRIER_METHOD, null).pipe(\n          Effect.timeoutOption(Math.min(BARRIER_TIMEOUT_MS, timeoutMs)),\n          Effect.flatMap((answer) =>\n            Effect.sync(() => {\n              if (Option.isNone(answer)) barrierAnswered = false\n            })\n          ),\n          // The answer is MethodNotFound; any answer drains what came before it.\n          Effect.ignore\n        )\n    )\n\n    // One sync at a time, so versions reach the server in the order they are numbered.\n    const syncLock = yield* Semaphore.make(1)\n    const sync = (path: string, text: string): Effect.Effect<void, StdError.StdError> =>\n      syncLock.withPermit(Effect.andThen(barrier, () => {\n        const uri = uriOf(path)\n        const open = documents.get(uri)\n        const version = (versions.get(uri) ?? 0) + 1\n        const sentAt = publishSequence\n        const message = open === undefined\n          ? notify(\"textDocument/didOpen\", {\n            textDocument: { uri, languageId: languageId(path), version, text }\n          })\n          : notify(\"textDocument/didChange\", { textDocument: { uri, version }, contentChanges: [{ text }] })\n        return message.pipe(\n          Effect.tap(() =>\n            Effect.sync(() => {\n              versions.set(uri, version)\n              documents.set(uri, { version, sentAt, digest: digestOf(text) })\n            })\n          )\n        )\n      }))\n\n    const closeUri = (uri: string): Effect.Effect<void, StdError.StdError> =>\n      Effect.suspend(() => {\n        if (!documents.has(uri)) return Effect.void\n        documents.delete(uri)\n        published.delete(uri)\n        return notify(\"textDocument/didClose\", { textDocument: { uri } })\n      })\n\n    const close = (path: string): Effect.Effect<void, StdError.StdError> => syncLock.withPermit(closeUri(uriOf(path)))\n\n    // Re-reads every open document: a file changed on disk is resent, and a\n    // file that is gone is closed. What changed it (a shell command, say) is\n    // not something the server can see.\n    const refresh: Effect.Effect<void, StdError.StdError> = Effect.suspend(() =>\n      Effect.forEach([...documents], ([uri, open]) => {\n        const path = fileURLToPath(uri)\n        let text: string | undefined\n        try {\n          text = NodeFs.readFileSync(path, \"utf8\")\n        } catch {\n          text = undefined\n        }\n        if (text === undefined) return syncLock.withPermit(closeUri(uri))\n        return digestOf(text) === open.digest ? Effect.void : sync(path, text)\n      }, { discard: true })\n    )\n\n    /** What the server published for the document's latest synced text, if it has. */\n    const current = (uri: string): PublishedDiagnostics | undefined => {\n      const entry = published.get(uri)\n      const open = documents.get(uri)\n      if (entry === undefined || open === undefined) return undefined\n      const fresh = entry.version === undefined ? entry.sequence > open.sentAt : entry.version >= open.version\n      return fresh ? entry : undefined\n    }\n\n    /** The first publish for the latest synced text whose sequence is past `after`. */\n    const awaitPublished = (uri: string, after = 0): Effect.Effect<PublishedDiagnostics> =>\n      Effect.suspend(() => {\n        const entry = current(uri)\n        if (entry !== undefined && entry.sequence > after) return Effect.succeed(entry)\n        return Effect.flatMap(Deferred.make<void>(), (listener) => {\n          const waiting = listeners.get(uri) ?? new Set()\n          waiting.add(listener)\n          listeners.set(uri, waiting)\n          return Deferred.await(listener).pipe(\n            Effect.ensuring(Effect.sync(() => {\n              listeners.get(uri)?.delete(listener)\n            })),\n            Effect.flatMap(() => awaitPublished(uri, after))\n          )\n        })\n      })\n\n    const pushedDiagnostics = (path: string): Effect.Effect<unknown, StdError.StdError> =>\n      Effect.gen(function*() {\n        const uri = uriOf(path)\n        if (!documents.has(uri)) {\n          // A push-only server publishes only for open documents.\n          const text = yield* Effect.try({\n            try: () => NodeFs.readFileSync(NodePath.resolve(config.cwd, path), \"utf8\"),\n            catch: () => new StdError.StdError({ code: \"not_found\", message: `File not found: ${path}`, path })\n          })\n          yield* sync(path, text)\n        }\n        const started = yield* Clock.currentTimeMillis\n        const entry = yield* awaitPublished(uri).pipe(Effect.timeoutOption(settleMs))\n        if (Option.isNone(entry)) {\n          return yield* Effect.fail(\n            new StdError.StdError({\n              code: \"timeout\",\n              message: `Language server published no diagnostics for ${path} within ${settleMs}ms`,\n              method: \"textDocument/publishDiagnostics\",\n              path\n            })\n          )\n        }\n        // A later publish within the quiet window supersedes this one.\n        let latest = entry.value\n        for (;;) {\n          const remaining = settleMs - ((yield* Clock.currentTimeMillis) - started)\n          if (remaining <= 0) break\n          const next = yield* awaitPublished(uri, latest.sequence).pipe(\n            Effect.timeoutOption(Math.min(quietMs, remaining))\n          )\n          if (Option.isNone(next)) break\n          latest = next.value\n        }\n        return { kind: \"full\", items: latest.diagnostics }\n      })\n\n    const diagnostics = (path: string): Effect.Effect<unknown, StdError.StdError> =>\n      pullUnsupported\n        ? pushedDiagnostics(path)\n        : request(\"textDocument/diagnostic\", { textDocument: { uri: uriOf(path) } }).pipe(\n          Effect.tap(() =>\n            Effect.sync(() => {\n              pullSupported = true\n            })\n          ),\n          Effect.catchIf(\n            (error) => error.rpcError?.code === METHOD_NOT_FOUND,\n            () => {\n              pullUnsupported = true\n              return pushedDiagnostics(path)\n            }\n          )\n        )\n\n    const prepareCallHierarchy = (position: LanguageServer.Position) =>\n      request(\"textDocument/prepareCallHierarchy\", positionParams(position))\n    const callHierarchy = (\n      method: \"callHierarchy/incomingCalls\" | \"callHierarchy/outgoingCalls\",\n      position: LanguageServer.Position\n    ): Effect.Effect<unknown, StdError.StdError> =>\n      prepareCallHierarchy(position).pipe(\n        Effect.flatMap((prepared) => {\n          const item = firstCallHierarchyItem(prepared)\n          return item === undefined ? Effect.succeed([]) : request(method, { item })\n        })\n      )\n\n    return LanguageServer.make({\n      hover: (position) => request(\"textDocument/hover\", positionParams(position)),\n      definition: (position) => request(\"textDocument/definition\", positionParams(position)),\n      references: (position) =>\n        request(\"textDocument/references\", {\n          ...positionParams(position),\n          context: { includeDeclaration: true }\n        }),\n      implementation: (position) => request(\"textDocument/implementation\", positionParams(position)),\n      documentSymbols: (path) => request(\"textDocument/documentSymbol\", { textDocument: { uri: uriOf(path) } }),\n      workspaceSymbols: (query) => request(\"workspace/symbol\", { query }),\n      prepareCallHierarchy,\n      callHierarchyIncoming: (position) => callHierarchy(\"callHierarchy/incomingCalls\", position),\n      callHierarchyOutgoing: (position) => callHierarchy(\"callHierarchy/outgoingCalls\", position),\n      diagnostics,\n      sync,\n      close,\n      refresh\n    })\n  })\n\nconst normalizeExtension = (extension: string): string =>\n  (extension.startsWith(\".\") ? extension : `.${extension}`).toLowerCase()\n\n/**\n * Routes each request to the client for its file's extension. `client`\n * starts, or returns, the client at an index; `started` is that client only\n * if it already runs, so `refresh` never starts a server.\n */\nconst routed = (\n  configs: ReadonlyArray<Config>,\n  client: (index: number) => Effect.Effect<LanguageServer.LanguageServer, StdError.StdError>,\n  started: (index: number) => LanguageServer.LanguageServer | undefined\n): LanguageServer.LanguageServer => {\n  const claims = configs.map((entry) => entry.extensions?.map(normalizeExtension))\n  const fallback = claims.findIndex((claimed) => claimed === undefined)\n  const indexOf = (path: string): Effect.Effect<number, StdError.StdError> => {\n    const extension = extensionOf(path)\n    const claimed = claims.findIndex((entry) => entry?.includes(extension) === true)\n    const index = claimed >= 0 ? claimed : fallback\n    return index >= 0\n      ? Effect.succeed(index)\n      : Effect.fail(\n        new StdError.StdError({\n          code: \"unsupported\",\n          message: `No language server is configured for ${extension || \"extensionless\"} files`,\n          path\n        })\n      )\n  }\n  const route = (path: string): Effect.Effect<LanguageServer.LanguageServer, StdError.StdError> =>\n    Effect.flatMap(indexOf(path), client)\n  const byPosition = (\n    method:\n      | \"hover\"\n      | \"definition\"\n      | \"references\"\n      | \"implementation\"\n      | \"prepareCallHierarchy\"\n      | \"callHierarchyIncoming\"\n      | \"callHierarchyOutgoing\"\n  ) =>\n  (position: LanguageServer.Position) => Effect.flatMap(route(position.path), (server) => server[method](position))\n  const indices = configs.map((_, index) => index)\n  return LanguageServer.make({\n    hover: byPosition(\"hover\"),\n    definition: byPosition(\"definition\"),\n    references: byPosition(\"references\"),\n    implementation: byPosition(\"implementation\"),\n    prepareCallHierarchy: byPosition(\"prepareCallHierarchy\"),\n    callHierarchyIncoming: byPosition(\"callHierarchyIncoming\"),\n    callHierarchyOutgoing: byPosition(\"callHierarchyOutgoing\"),\n    documentSymbols: (path) => Effect.flatMap(route(path), (server) => server.documentSymbols(path)),\n    diagnostics: (path) => Effect.flatMap(route(path), (server) => server.diagnostics(path)),\n    sync: (path, text) => Effect.flatMap(route(path), (server) => server.sync(path, text)),\n    // A server that never started holds no open file.\n    close: (path) => Effect.flatMap(indexOf(path), (index) => started(index)?.close(path) ?? Effect.void),\n    refresh: Effect.suspend(() =>\n      Effect.forEach(indices, (index) => started(index)?.refresh ?? Effect.void, { discard: true })\n    ),\n    workspaceSymbols: (query) =>\n      configs.length === 1 ?\n        Effect.flatMap(client(0), (server) => server.workspaceSymbols(query)) :\n        Effect.forEach(\n          indices,\n          (index) => Effect.flatMap(client(index), (server) => server.workspaceSymbols(query)),\n          { concurrency: \"unbounded\" }\n        ).pipe(\n          Effect.map((answers) =>\n            answers.flatMap((answer) => Array.isArray(answer) ? answer : answer == null ? [] : [answer])\n          )\n        )\n  })\n}\n\nconst configList = (\n  config: Config | ReadonlyArray<Config>\n): Effect.Effect<ReadonlyArray<Config>, StdError.StdError> => {\n  const configs: ReadonlyArray<Config> = Array.isArray(config) ? config : [config as Config]\n  return configs.length === 0\n    ? Effect.fail(failure(\"invalid_input\", \"At least one language server must be configured\"))\n    : Effect.succeed(configs)\n}\n\n/**\n * Constructs scoped host language-server clients, one process per config, and\n * routes each file to the server whose `extensions` include its extension, or\n * else to the server that declares none. `workspaceSymbols` asks every server\n * and concatenates their answers.\n *\n * Every client opens a file on its first `sync` and sends the full text on\n * each later one. `diagnostics` pulls `textDocument/diagnostic`; a server that\n * answers `MethodNotFound` is read from its `textDocument/publishDiagnostics`\n * notifications instead, waiting up to `settleMs` for the latest synced text.\n *\n * Fails with `permission_denied`, before spawning, when the resolved program or\n * a file or directory named by an argument lies under `config.cwd`, or when the command is a\n * launcher (a shell, `env`, a package runner such as `npx` or `pnpm`, or `node`\n * and `bun` given inline code or a preload) whose arguments choose what runs.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const make = (\n  config: Config | ReadonlyArray<Config>\n): Effect.Effect<\n  LanguageServer.LanguageServer,\n  StdError.StdError,\n  ChildProcessSpawner.ChildProcessSpawner | Scope.Scope\n> =>\n  Effect.gen(function*() {\n    const configs = yield* configList(config)\n    const clients = yield* Effect.forEach(configs, makeClient)\n    return routed(configs, (index) => Effect.succeed(clients[index]!), (index) => clients[index])\n  })\n\n/**\n * {@link make}, starting each server when the first request for one of its\n * files arrives rather than up front, so a host can bind servers it may never\n * need. A server starts with the services and authority of the fiber that\n * built this service, not those of the request that first needs it. A server\n * that fails to start fails that request and every later one for its files.\n * `refresh` and `close` never start a server.\n *\n * The workspace-program refusals of {@link make} still apply up front.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const makeLazy = (\n  config: Config | ReadonlyArray<Config>\n): Effect.Effect<\n  LanguageServer.LanguageServer,\n  StdError.StdError,\n  ChildProcessSpawner.ChildProcessSpawner | Scope.Scope\n> =>\n  Effect.gen(function*() {\n    const configs = yield* configList(config)\n    for (const entry of configs) {\n      const refused = workspaceProgram(entry, ChildProcessEnvironment.make(process.env, entry.environment).PATH)\n      if (refused !== undefined) return yield* Effect.fail(refused)\n    }\n    const clients: Array<LanguageServer.LanguageServer | undefined> = configs.map(() => undefined)\n    // Each server starts in a fiber forked here, so it starts with the\n    // services and authority of whoever built this service, never those of\n    // the request that first needs it, and lives as long as this scope.\n    const starts = yield* Effect.forEach(configs, (entry, index) =>\n      Effect.gen(function*() {\n        const wanted = yield* Deferred.make<void>()\n        const ready = yield* Deferred.make<LanguageServer.LanguageServer, StdError.StdError>()\n        yield* Deferred.await(wanted).pipe(\n          Effect.andThen(makeClient(entry)),\n          Effect.tap((client) => Effect.sync(() => void (clients[index] = client))),\n          Effect.exit,\n          Effect.flatMap((exit) => Deferred.done(ready, exit)),\n          Effect.forkScoped({ startImmediately: true })\n        )\n        return Deferred.succeed(wanted, undefined).pipe(Effect.andThen(Deferred.await(ready)))\n      }))\n    return routed(configs, (index) => starts[index]!, (index) => clients[index])\n  })\n\n/**\n * Provides a scoped host language-server implementation.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layer = (\n  config: Config | ReadonlyArray<Config>\n): Layer.Layer<LanguageServer.LanguageServer, StdError.StdError, ChildProcessSpawner.ChildProcessSpawner> =>\n  Layer.effect(LanguageServer.LanguageServer, make(config))\n\n/**\n * Provides {@link makeLazy}.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layerLazy = (\n  config: Config | ReadonlyArray<Config>\n): Layer.Layer<LanguageServer.LanguageServer, StdError.StdError, ChildProcessSpawner.ChildProcessSpawner> =>\n  Layer.effect(LanguageServer.LanguageServer, makeLazy(config))\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWA,8BAAyC;AACzC,0BAAqC;AACrC,oBAAoG;AACpG,mBAA8B;AAC9B,yBAA2B;AAC3B,aAAwB;AACxB,eAA0B;AAC1B,sBAA6C;AAC7C,qBAAgC;AAChC,eAA0B;AAYnB,MAAM,oBAAoB;AAY1B,MAAM,uBAAuB;AAEpC,MAAM,oBAAoB;AAC1B,MAAM,mBAAmB;AAMzB,MAAM,iBAAiB;AAEvB,MAAM,qBAAqB;AAuD3B,MAAM,mBAAmB;AAEzB,MAAM,eAAiD;AAAA,EACrD,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AACT;AAEA,MAAM,cAAc,CAAC,SAAyB,SAAS,QAAQ,IAAI,EAAE,YAAY;AAEjF,MAAM,aAAa,CAAC,SAAyB;AAC3C,QAAM,YAAY,YAAY,IAAI;AAClC,SAAO,aAAa,SAAS,MAAM,UAAU,MAAM,CAAC,KAAK;AAC3D;AAUA,MAAM,UAAU,CAAC,MAAqB,YAAuC,IAAI,SAAS,SAAS,EAAE,MAAM,QAAQ,CAAC;AAEpH,MAAM,qBAAqB,IAAI;AAC/B,MAAM,oBAAoB,IAAI,OAAO;AACrC,MAAM,YAAY,IAAI,WAAW,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;AACjD,MAAM,sBAAsB,IAAI,YAAY,EAAE,OAAO,iBAAiB;AAEtE,MAAM,cAAc,CAAC,MAAkB,UAAkC;AACvE,QAAM,WAAW,IAAI,WAAW,KAAK,SAAS,MAAM,MAAM;AAC1D,WAAS,IAAI,IAAI;AACjB,WAAS,IAAI,OAAO,KAAK,MAAM;AAC/B,SAAO;AACT;AAcA,MAAM,kBAAkB,MAAmB;AACzC,MAAI,SAA4B,CAAC;AACjC,MAAI,OAAO;AACX,MAAI,aAAa;AACjB,MAAI,SAAS;AAEb,QAAM,UAAU,MAAY;AAC1B,QAAI,SAAS,OAAO,QAAQ;AAC1B,eAAS,CAAC;AACV,aAAO;AACP,mBAAa;AAAA,IACf,WAAW,QAAQ,MAAM,OAAO,KAAK,OAAO,QAAQ;AAClD,eAAS,OAAO,MAAM,IAAI;AAC1B,aAAO;AAAA,IACT;AAAA,EACF;AAEA,QAAM,UAAU,CAAC,OAAe,WAA8B;AAC5D,QAAI,YAAY;AAChB,QAAI,eAAe;AACnB,eAAW,SAAS,OAAO,MAAM,IAAI,GAAG;AACtC,UAAI,cAAc,EAAG;AACrB,YAAM,YAAY,MAAM,aAAa;AACrC,YAAM,WAAW,KAAK,IAAI,WAAW,SAAS;AAC9C,UAAI,WAAW,QAAW;AACxB,eAAO,IAAI,MAAM,SAAS,YAAY,aAAa,QAAQ,GAAG,YAAY;AAC1E,wBAAgB;AAAA,MAClB;AACA,oBAAc;AACd,gBAAU;AACV,mBAAa;AACb,UAAI,eAAe,MAAM,YAAY;AACnC;AACA,qBAAa;AAAA,MACf;AAAA,IACF;AACA,YAAQ;AAAA,EACV;AAEA,SAAO;AAAA,IACL,IAAI,SAAS;AACX,aAAO;AAAA,IACT;AAAA,IACA,MAAM,CAAC,UAAU;AACf,UAAI,MAAM,eAAe,EAAG;AAE5B,aAAO,KAAK,MAAM,MAAM,CAAC;AACzB,gBAAU,MAAM;AAAA,IAClB;AAAA,IACA,SAAS,CAAC,WAAW;AACnB,UAAI,WAAW;AACf,UAAI,UAAU;AACd,eAAS,aAAa,MAAM,aAAa,OAAO,QAAQ,cAAc;AACpE,cAAM,QAAQ,OAAO,UAAU;AAC/B,cAAM,QAAQ,eAAe,OAAO,aAAa;AACjD,iBAAS,QAAQ,OAAO,QAAQ,MAAM,YAAY,SAAS;AACzD,gBAAM,OAAO,MAAM,KAAK;AACxB,cAAI,SAAS,OAAO,OAAO,EAAG;AAAA,cACzB,WAAU,SAAS,OAAO,CAAC,IAAI,IAAI;AACxC,cAAI,YAAY,OAAO,WAAY,QAAO,WAAW,OAAO,aAAa;AACzE;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,QAAQ,CAAC,UAAU;AACjB,UAAI,QAAQ,OAAQ,QAAO;AAC3B,aAAO;AAAA,QACL,MAAM,MAAM;AACV,gBAAM,SAAS,IAAI,WAAW,KAAK;AACnC,kBAAQ,OAAO,MAAM;AACrB,iBAAO;AAAA,QACT;AAAA,QACA,SAAS,MAAM,QAAQ,KAAK;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACF;AAEA,MAAM,cAAc,CAAC,SAAqC;AACxD,QAAM,QAAQ,mBAAmB,KAAK,IAAI;AAC1C,MAAI,UAAU,KAAM,QAAO;AAC3B,QAAM,KAAK,OAAO,MAAM,CAAC,CAAC;AAC1B,SAAO,OAAO,cAAc,EAAE,IAAI,KAAK;AACzC;AAEA,MAAM,mBAAmB,MAAoB;AAC3C,QAAM,UAAU,gBAAgB;AAChC,MAAI;AACJ,MAAI,kBAAkB;AACtB,SAAO;AAAA,IACL,MAAM,CAAC,UAAU;AACf,cAAQ,KAAK,KAAK;AAClB,YAAM,SAA4B,CAAC;AACnC,aAAO,QAAQ,SAAS,KAAK,eAAe,GAAG;AAC7C,YAAI,iBAAiB;AACnB,gBAAM,aAAa,QAAQ,QAAQ,mBAAmB;AACtD,cAAI,aAAa,GAAG;AAClB,oBAAQ,OAAO,KAAK,IAAI,GAAG,QAAQ,SAAS,oBAAoB,aAAa,CAAC,CAAC,EAAG,QAAQ;AAC1F;AAAA,UACF;AACA,kBAAQ,OAAO,UAAU,EAAG,QAAQ;AACpC,4BAAkB;AAAA,QACpB;AACA,YAAI,eAAe,QAAW;AAC5B,gBAAM,SAAS,QAAQ,OAAO,UAAU;AACxC,cAAI,WAAW,OAAW;AAC1B,gBAAM,OAAO,IAAI,YAAY,EAAE,OAAO,OAAO,KAAK,CAAC;AACnD,uBAAa;AACb,cAAI;AACF,mBAAO,KAAK,EAAE,MAAM,WAAW,OAAO,KAAK,MAAM,IAAI,EAAa,CAAC;AAAA,UACrE,QAAQ;AACN,mBAAO,KAAK;AAAA,cACV,MAAM;AAAA,cACN,OAAO,QAAQ,kBAAkB,yCAAyC;AAAA,cAC1E,IAAI,YAAY,IAAI;AAAA,YACtB,CAAC;AAAA,UACH;AACA;AAAA,QACF;AACA,cAAM,YAAY,QAAQ,QAAQ,SAAS;AAC3C,YAAI,YAAY,GAAG;AACjB,cAAI,QAAQ,SAAS,oBAAoB;AACvC,mBAAO,KAAK;AAAA,cACV,MAAM;AAAA,cACN,OAAO;AAAA,gBACL;AAAA,gBACA,yCAAyC,kBAAkB;AAAA,cAC7D;AAAA,YACF,CAAC;AACD,oBAAQ,OAAO,CAAC,EAAG,QAAQ;AAC3B,8BAAkB;AAClB;AAAA,UACF;AACA;AAAA,QACF;AACA,YAAI,YAAY,oBAAoB;AAClC,iBAAO,KAAK;AAAA,YACV,MAAM;AAAA,YACN,OAAO,QAAQ,kBAAkB,yCAAyC,kBAAkB,QAAQ;AAAA,UACtG,CAAC;AACD,kBAAQ,OAAO,YAAY,UAAU,UAAU,EAAG,QAAQ;AAC1D,4BAAkB;AAClB;AAAA,QACF;AACA,cAAM,SAAS,IAAI,YAAY,EAAE,OAAO,QAAQ,OAAO,SAAS,EAAG,KAAK,CAAC;AACzE,gBAAQ,OAAO,UAAU,UAAU,EAAG,QAAQ;AAC9C,cAAM,QAAQ,+CAA+C,KAAK,MAAM;AACxE,YAAI,UAAU,MAAM;AAClB,iBAAO,KAAK;AAAA,YACV,MAAM;AAAA,YACN,OAAO,QAAQ,kBAAkB,8CAA8C;AAAA,UACjF,CAAC;AACD,4BAAkB;AAClB;AAAA,QACF;AACA,cAAM,SAAS,OAAO,MAAM,CAAC,CAAC;AAC9B,YAAI,CAAC,OAAO,cAAc,MAAM,KAAK,SAAS,KAAK,SAAS,mBAAmB;AAC7E,iBAAO,KAAK;AAAA,YACV,MAAM;AAAA,YACN,OAAO,QAAQ,kBAAkB,kCAAkC,iBAAiB,QAAQ;AAAA,UAC9F,CAAC;AACD,4BAAkB;AAClB;AAAA,QACF;AACA,qBAAa;AAAA,MACf;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,MAAM,YAAY,CAAC,UACjB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,IAC/D,QACA;AAEN,MAAM,QAAQ,CAAC,YAAiC;AAC9C,QAAM,OAAO,IAAI,YAAY,EAAE,OAAO,KAAK,UAAU,OAAO,CAAC;AAC7D,QAAM,SAAS,IAAI,YAAY,EAAE,OAAO,mBAAmB,KAAK,UAAU;AAAA;AAAA,CAAU;AACpF,SAAO,YAAY,QAAQ,IAAI;AACjC;AAEA,MAAM,yBAAyB,CAAC,UAAwC,MAAM,QAAQ,KAAK,IAAI,MAAM,CAAC,IAAI;AAE1G,MAAM,SAAS,CAAC,SAA0B;AACxC,MAAI;AACF,WAAO,OAAO,SAAS,MAAM,EAAE,gBAAgB,MAAM,CAAC,GAAG,OAAO,MAAM;AAAA,EACxE,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,MAAM,SAAS,CAAC,SAA0B;AACxC,MAAI;AACF,WAAO,OAAO,SAAS,MAAM,EAAE,gBAAgB,MAAM,CAAC,MAAM;AAAA,EAC9D,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,MAAM,WAAW,CAAC,SAAyB;AACzC,MAAI;AACF,WAAO,OAAO,aAAa,IAAI;AAAA,EACjC,QAAQ;AACN,WAAO,SAAS,QAAQ,IAAI;AAAA,EAC9B;AACF;AAEA,MAAM,WAAW,CAAC,MAAc,SAA0B;AACxD,QAAM,WAAW,SAAS,SAAS,MAAM,IAAI;AAC7C,SAAO,aAAa,MAAO,aAAa,QAAQ,CAAC,SAAS,WAAW,KAAK,SAAS,GAAG,EAAE,KACtF,CAAC,SAAS,WAAW,QAAQ;AACjC;AAOA,MAAM,iBAAiB,CAAC,SAAiB,KAAa,SAAiD;AACrG,MAAI,QAAQ,SAAS,GAAG,KAAK,QAAQ,SAAS,SAAS,GAAG,GAAG;AAC3D,UAAM,YAAY,SAAS,QAAQ,KAAK,OAAO;AAC/C,WAAO,OAAO,SAAS,IAAI,YAAY;AAAA,EACzC;AACA,aAAW,UAAU,QAAQ,IAAI,MAAM,SAAS,SAAS,GAAG;AAC1D,UAAM,YAAY,SAAS,QAAQ,KAAK,OAAO,OAAO;AACtD,QAAI,CAAC,OAAO,SAAS,EAAG;AACxB,QAAI;AACF,aAAO,WAAW,WAAW,OAAO,UAAU,IAAI;AAClD,aAAO;AAAA,IACT,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAcA,MAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,MAAM,aAAa,oBAAI,IAAI,CAAC,MAAM,UAAU,MAAM,WAAW,MAAM,aAAa,YAAY,UAAU,CAAC;AAEvG,MAAM,WAAW,CAAC,WAAuC;AACvD,QAAM,OAAO,SAAS,SAAS,OAAO,OAAO,EAAE,YAAY,EAAE,QAAQ,0BAA0B,EAAE;AACjG,MAAI,UAAU,IAAI,IAAI,EAAG,QAAO;AAChC,MAAI,SAAS,UAAU,SAAS,SAAS,SAAS,SAAU,QAAO;AACnE,QAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,MAAI,SAAS,SAAS,CAAC,KAAK,OAAO,MAAM,EAAE,SAAS,KAAK,CAAC,KAAK,EAAE,EAAG,QAAO,OAAO,KAAK,CAAC,CAAC;AACzF,QAAM,OAAO,KAAK,KAAK,CAAC,aAAa,WAAW,IAAI,SAAS,MAAM,GAAG,EAAE,CAAC,CAAE,KAAK,aAAa,uBAAuB;AACpH,SAAO,SAAS,SAAY,SAAY,GAAG,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC;AACvE;AAEA,MAAM,mBAAmB,CACvB,QACA,SACkC;AAClC,QAAM,YAAY,SAAS,MAAM;AACjC,MAAI,cAAc,QAAW;AAC3B,WAAO;AAAA,MACL;AAAA,MACA,gCAAgC,SAAS;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,cAAc,SAAS,QAAQ,OAAO,GAAG;AAC/C,QAAM,WAAW,SAAS,WAAW;AACrC,QAAM,cAAc,CAAC,SACnB,SAAS,aAAa,IAAI,KAAK,SAAS,UAAU,IAAI,KAAK,SAAS,UAAU,SAAS,IAAI,CAAC,KAC5F,SAAS,aAAa,SAAS,IAAI,CAAC;AACtC,QAAM,UAAU,eAAe,OAAO,SAAS,aAAa,IAAI;AAChE,MAAI,YAAY,UAAa,YAAY,OAAO,GAAG;AACjD,WAAO;AAAA,MACL;AAAA,MACA,2BAA2B,OAAO,4BAA4B,WAAW;AAAA,IAC3E;AAAA,EACF;AACA,aAAW,YAAY,OAAO,QAAQ,CAAC,GAAG;AACxC,eAAW,SAAS,CAAC,UAAU,SAAS,MAAM,SAAS,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG;AACzE,UAAI,UAAU,GAAI;AAClB,YAAM,YAAY,SAAS,QAAQ,aAAa,KAAK;AAErD,UAAI,OAAO,SAAS,KAAK,YAAY,SAAS,GAAG;AAC/C,eAAO;AAAA,UACL;AAAA,UACA,kCAAkC,SAAS,iCAAiC,WAAW;AAAA,QACzF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAgBA,MAAM,WAAW,CAAC,aAAyB,+BAAW,QAAQ,EAAE,OAAO,IAAI,EAAE,OAAO,KAAK;AAEzF,MAAM,aAAa,CACjB,WAMA,qBAAO,IAAI,aAAY;AACrB,QAAM,UAAU,OAAO,oBAAoB;AAC3C,QAAM,YAAY,OAAO,aAAa;AACtC,QAAM,WAAW,OAAO,YAAY;AACpC,QAAM,UAAU,OAAO,WAAW;AAClC,QAAM,MAAM,wBAAwB,KAAK,QAAQ,KAAK,OAAO,WAAW;AACxE,QAAM,UAAU,OAAO,qBAAO,KAAK,MAAM,iBAAiB,QAAQ,IAAI,IAAI,CAAC;AAC3E,MAAI,YAAY,OAAW,QAAO,OAAO,qBAAO,KAAK,OAAO;AAG5D,QAAM,QAAQ,OAAO,oBAAM,QAAoB,iBAAiB;AAChE,QAAM,SAAS,OAAO,QAAQ;AAAA,IAC5B,aAAa,KAAK,OAAO,SAAS,OAAO,QAAQ,CAAC,GAAG;AAAA,MACnD,KAAK,OAAO;AAAA,MACZ;AAAA,MACA,WAAW;AAAA,MACX,OAAO,EAAE,QAAQ,qBAAO,UAAU,KAAK,GAAG,WAAW,MAAM;AAAA,IAC7D,CAAC;AAAA,EACH,EAAE;AAAA,IACA,qBAAO;AAAA,MAAS,CAAC,UACf,QAAQ,wBAAwB,iDAAiD,MAAM,OAAO,EAAE;AAAA,IAClG;AAAA,EACF;AACA,QAAM,UAAU,oBAAI,IAA2D;AAC/E,QAAM,UAAU,iBAAiB;AACjC,MAAI,SAAS;AACb,MAAI;AAIJ,QAAM,qBAAqB,KAAK;AAChC,MAAI,aAAyB,IAAI,WAAW,CAAC;AAC7C,QAAM,cAAc,OAAO,OAAO,OAAO;AAAA,IACvC,qBAAO;AAAA,MAAW,CAAC,UACjB,qBAAO,KAAK,MAAM;AAChB,qBAAa,MAAM,cAAc,qBAC7B,MAAM,MAAM,CAAC,kBAAkB,IAC/B;AAAA,UACA,WAAW,MAAM,KAAK,IAAI,GAAG,WAAW,aAAa,MAAM,aAAa,kBAAkB,CAAC;AAAA,UAC3F;AAAA,QACF;AAAA,MACJ,CAAC;AAAA,IACH;AAAA,IACA,qBAAO,MAAM,CAAC,UAAU,qBAAO,WAAW,wCAAwC,KAAK,CAAC;AAAA,IACxF,qBAAO,WAAW,EAAE,kBAAkB,KAAK,CAAC;AAAA,EAC9C;AACA,QAAM,SAAS,MAAc;AAC3B,QAAI,QAAQ;AACZ,WAAO,QAAQ,WAAW,cAAc,QAAQ,MAAM,WAAW,KAAK,IAAK,SAAiB,IAAa;AACzG,WAAO,IAAI,YAAY,EAAE,OAAO,WAAW,SAAS,KAAK,CAAC;AAAA,EAC5D;AAEA,QAAM,cAAc,CAAC,UACnB,qBAAO;AAAA,IACL,qBAAO,KAAK,MAAM;AAChB,YAAM,YAAY,CAAC,GAAG,QAAQ,OAAO,CAAC;AACtC,cAAQ,MAAM;AACd,aAAO;AAAA,IACT,CAAC;AAAA,IACD,CAAC,cAAc,qBAAO,QAAQ,WAAW,CAAC,aAAa,uBAAS,KAAK,UAAU,KAAK,GAAG,EAAE,SAAS,KAAK,CAAC;AAAA,EAC1G;AAEF,QAAM,cAAc,CAAC,IAAY,UAAkD;AACjF,UAAM,WAAW,QAAQ,IAAI,EAAE;AAC/B,QAAI,aAAa,OAAW,QAAO,qBAAO;AAC1C,YAAQ,OAAO,EAAE;AACjB,WAAO,uBAAS,KAAK,UAAU,KAAK,EAAE,KAAK,qBAAO,MAAM;AAAA,EAC1D;AAEA,QAAM,YAAY,CAAC,UACjB,qBAAO,IAAI,aAAY;AAGrB,WAAO,oBAAM,MAAM,WAAW,EAAE,KAAK,qBAAO,cAAc,GAAG,CAAC;AAC9D,sBAAkB;AAClB,WAAO,YAAY,aAAa;AAAA,EAClC,CAAC;AAEH,QAAM,QAAQ,CAAC,aAAyB,+BAAc,SAAS,QAAQ,OAAO,KAAK,IAAI,CAAC,EAAE;AAC1F,QAAM,YAAY,oBAAI,IAA0B;AAGhD,QAAM,WAAW,oBAAI,IAAoB;AACzC,QAAM,YAAY,oBAAI,IAAkC;AACxD,QAAM,YAAY,oBAAI,IAA0C;AAChE,MAAI,kBAAkB;AACtB,MAAI,kBAAkB;AACtB,MAAI,gBAAgB;AACpB,MAAI,qBAAqB;AACzB,MAAI,kBAAkB;AAEtB,QAAM,UAAU,CAAC,WAAyC;AACxD,UAAM,eAAe,UAAU,MAAM;AAKrC,QAAI,OAAO,cAAc,QAAQ,YAAY,CAAC,MAAM,QAAQ,aAAa,WAAW,EAAG,QAAO,qBAAO;AACrG,UAAM,MAAM,aAAa;AACzB,UAAM,UAAU,OAAO,aAAa,YAAY,WAAW,aAAa,UAAU;AAClF,QAAI,YAAY,OAAW,sBAAqB;AAChD,UAAM,WAAW,UAAU,IAAI,GAAG,GAAG;AAErC,QAAI,YAAY,UAAa,aAAa,UAAa,UAAU,SAAU,QAAO,qBAAO;AACzF,cAAU,IAAI,KAAK;AAAA,MACjB;AAAA,MACA,UAAU,EAAE;AAAA,MACZ,aAAa,aAAa;AAAA,IAC5B,CAAC;AACD,UAAM,UAAU,UAAU,IAAI,GAAG;AACjC,QAAI,YAAY,OAAW,QAAO,qBAAO;AACzC,cAAU,OAAO,GAAG;AACpB,WAAO,qBAAO,QAAQ,SAAS,CAAC,aAAa,uBAAS,QAAQ,UAAU,MAAS,GAAG,EAAE,SAAS,KAAK,CAAC;AAAA,EACvG;AAEA,QAAM,UAAU,CAAC,UAAwC;AACvD,UAAM,UAAU,UAAU,KAAK;AAC/B,QAAI,SAAS,WAAW,kCAAmC,QAAO,QAAQ,QAAQ,MAAM;AACxF,QAAI,YAAY,UAAa,OAAO,QAAQ,OAAO,SAAU,QAAO,qBAAO;AAC3E,UAAM,WAAW,QAAQ,IAAI,QAAQ,EAAE;AACvC,QAAI,aAAa,OAAW,QAAO,qBAAO;AAC1C,YAAQ,OAAO,QAAQ,EAAE;AACzB,QAAI,QAAQ,UAAU,OAAW,QAAO,uBAAS,QAAQ,UAAU,QAAQ,MAAM;AACjF,UAAM,QAAQ,UAAU,QAAQ,KAAK;AAKrC,WAAO,uBAAS;AAAA,MACd;AAAA,MACA,IAAI,SAAS,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,SAAS,OAAO,OAAO,YAAY,WAAW,MAAM,UAAU;AAAA,QAC9D,GAAI,OAAO,OAAO,SAAS,YAAY,OAAO,MAAM,YAAY,WAC5D;AAAA,UACA,UAAU;AAAA,YACR,MAAM,MAAM;AAAA,YACZ,SAAS,MAAM;AAAA,YACf,GAAI,MAAM,SAAS,SAAY,CAAC,IAAI,EAAE,MAAM,MAAM,KAAK;AAAA,UACzD;AAAA,QACF,IACE,CAAC;AAAA,MACP,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,eAAe,CAAC,UACpB,MAAM,SAAS,YACX,QAAQ,MAAM,KAAK,IAGnB,MAAM,OAAO,SACb,YAAY,MAAM,KAAK,IACvB,YAAY,MAAM,IAAI,MAAM,KAAK;AAEvC,SAAO,OAAO,OAAO;AAAA,IACnB,qBAAO,WAAW,CAAC,UAAU,qBAAO,QAAQ,QAAQ,KAAK,KAAK,GAAG,cAAc,EAAE,SAAS,KAAK,CAAC,CAAC;AAAA,IACjG,qBAAO,YAAY;AAAA,MACjB,WAAW,MAAM,UAAU,QAAQ,kBAAkB,sCAAsC,CAAC;AAAA,MAC5F,WAAW,MAAM,UAAU,QAAQ,kBAAkB,sCAAsC,CAAC;AAAA,IAC9F,CAAC;AAAA,IACD,qBAAO,WAAW,EAAE,kBAAkB,KAAK,CAAC;AAAA,EAC9C;AAEA,SAAO,OAAO,SAAS;AAAA,IACrB,qBAAO;AAAA,MAAQ,CAAC,aACd,UAAU,QAAQ,kBAAkB,4CAA4C,QAAQ,EAAE,CAAC;AAAA,IAC7F;AAAA,IACA,qBAAO,MAAM,MAAM,UAAU,QAAQ,kBAAkB,gCAAgC,CAAC,CAAC;AAAA,IACzF,qBAAO,WAAW,EAAE,kBAAkB,KAAK,CAAC;AAAA,EAC9C;AAEA,QAAM,OAAO,CAAC,YACZ,qBAAO;AAAA,IAAQ,MACb,kBAAkB,SACd,oBAAM,MAAM,OAAO,MAAM,OAAO,CAAC,EAAE;AAAA,MACnC,qBAAO;AAAA,MACP,qBAAO,QAAQ,SAAS;AAAA,MACxB,qBAAO;AAAA,QAAS,MACd;AAAA,UACE;AAAA,UACA,oEAAoE,SAAS;AAAA,QAC/E;AAAA,MACF;AAAA,IACF,IACE,qBAAO,KAAK,aAAa;AAAA,EAC/B;AAEF,QAAM,UAAU,CACd,QACA,WAEA,qBAAO,IAAI,aAAY;AACrB,UAAM,WAAW,OAAO,uBAAS,KAAiC;AAClE,UAAM,aAAa,OAAO,qBAAO,KAAK,MAAkC;AACtE,UAAI,kBAAkB,OAAW,QAAO;AACxC,UAAI,QAAQ,QAAQ,sBAAsB;AACxC,eAAO;AAAA,UACL;AAAA,UACA,+BAA+B,oBAAoB;AAAA,QACrD;AAAA,MACF;AACA,YAAMA,MAAK;AACX,cAAQ,IAAIA,KAAI,QAAQ;AACxB,aAAOA;AAAA,IACT,CAAC;AACD,QAAI,sBAAsB,SAAS,SAAU,QAAO,OAAO,qBAAO,KAAK,UAAU;AACjF,UAAM,KAAK;AACX,WAAO,OAAO,qBAAO,IAAI,aAAY;AACnC,aAAO,KAAK,EAAE,SAAS,OAAO,IAAI,QAAQ,OAAO,CAAC;AAClD,aAAO,OAAO,uBAAS,MAAM,QAAQ,EAAE;AAAA,QACrC,qBAAO,QAAQ,SAAS;AAAA,QACxB,qBAAO;AAAA,UAAS,CAAC,UACf,iBAAiB,SAAS,WACtB,QACA,QAAQ,WAAW,sCAAsC,MAAM,EAAE;AAAA,QACvE;AAAA,MACF;AAAA,IACF,CAAC,EAAE;AAAA,MACD,qBAAO;AAAA,QACL,qBAAO,KAAK,MAAM;AAChB,kBAAQ,OAAO,EAAE;AAAA,QACnB,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,CAAC,EAAE,KAAK,qBAAO;AAAA,IAAS,CAAC,UACvB,IAAI,SAAS,SAAS;AAAA,MACpB,GAAG;AAAA,MACH;AAAA,MACA,SAAS,MAAM,aAAa,SAAY,MAAM,UAAU,GAAG,MAAM,KAAK,MAAM,OAAO;AAAA,MACnF,GAAI,WAAW,eAAe,IAAI,CAAC,IAAI,EAAE,QAAQ,OAAO,EAAE;AAAA,IAC5D,CAAC;AAAA,EACH,CAAC;AAEH,QAAM,SAAS,CAAC,QAAgB,WAC9B,KAAK,EAAE,SAAS,OAAO,QAAQ,OAAO,CAAC;AAEzC,SAAO,QAAQ,cAAc;AAAA,IAC3B,WAAW;AAAA,IACX,aAAS,+BAAc,OAAO,GAAG,EAAE;AAAA,IACnC,cAAc;AAAA,MACZ,cAAc;AAAA,QACZ,iBAAiB,EAAE,qBAAqB,MAAM;AAAA,QAC9C,oBAAoB,EAAE,gBAAgB,KAAK;AAAA,QAC3C,YAAY,EAAE,qBAAqB,MAAM;AAAA,MAC3C;AAAA,IACF;AAAA,IACA,GAAI,OAAO,0BAA0B,SAAY,CAAC,IAAI,EAAE,uBAAuB,OAAO,sBAAsB;AAAA,EAC9G,CAAC;AACD,SAAO,OAAO,eAAe,CAAC,CAAC;AAE/B,QAAM,iBAAiB,CAAC,cAAuC;AAAA,IAC7D,cAAc,EAAE,KAAK,MAAM,SAAS,IAAI,EAAE;AAAA,IAC1C,UAAU,EAAE,MAAM,SAAS,MAAM,WAAW,SAAS,UAAU;AAAA,EACjE;AAQA,QAAM,UAA+B,qBAAO;AAAA,IAAQ,MAClD,iBAAiB,sBAAsB,CAAC,kBACpC,qBAAO,OACP,QAAQ,gBAAgB,IAAI,EAAE;AAAA,MAC9B,qBAAO,cAAc,KAAK,IAAI,oBAAoB,SAAS,CAAC;AAAA,MAC5D,qBAAO;AAAA,QAAQ,CAAC,WACd,qBAAO,KAAK,MAAM;AAChB,cAAI,qBAAO,OAAO,MAAM,EAAG,mBAAkB;AAAA,QAC/C,CAAC;AAAA,MACH;AAAA;AAAA,MAEA,qBAAO;AAAA,IACT;AAAA,EACJ;AAGA,QAAM,WAAW,OAAO,wBAAU,KAAK,CAAC;AACxC,QAAM,OAAO,CAAC,MAAc,SAC1B,SAAS,WAAW,qBAAO,QAAQ,SAAS,MAAM;AAChD,UAAM,MAAM,MAAM,IAAI;AACtB,UAAM,OAAO,UAAU,IAAI,GAAG;AAC9B,UAAM,WAAW,SAAS,IAAI,GAAG,KAAK,KAAK;AAC3C,UAAM,SAAS;AACf,UAAM,UAAU,SAAS,SACrB,OAAO,wBAAwB;AAAA,MAC/B,cAAc,EAAE,KAAK,YAAY,WAAW,IAAI,GAAG,SAAS,KAAK;AAAA,IACnE,CAAC,IACC,OAAO,0BAA0B,EAAE,cAAc,EAAE,KAAK,QAAQ,GAAG,gBAAgB,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;AACnG,WAAO,QAAQ;AAAA,MACb,qBAAO;AAAA,QAAI,MACT,qBAAO,KAAK,MAAM;AAChB,mBAAS,IAAI,KAAK,OAAO;AACzB,oBAAU,IAAI,KAAK,EAAE,SAAS,QAAQ,QAAQ,SAAS,IAAI,EAAE,CAAC;AAAA,QAChE,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,CAAC,CAAC;AAEJ,QAAM,WAAW,CAAC,QAChB,qBAAO,QAAQ,MAAM;AACnB,QAAI,CAAC,UAAU,IAAI,GAAG,EAAG,QAAO,qBAAO;AACvC,cAAU,OAAO,GAAG;AACpB,cAAU,OAAO,GAAG;AACpB,WAAO,OAAO,yBAAyB,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;AAAA,EAClE,CAAC;AAEH,QAAM,QAAQ,CAAC,SAAyD,SAAS,WAAW,SAAS,MAAM,IAAI,CAAC,CAAC;AAKjH,QAAM,UAAkD,qBAAO;AAAA,IAAQ,MACrE,qBAAO,QAAQ,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,KAAK,IAAI,MAAM;AAC9C,YAAM,WAAO,+BAAc,GAAG;AAC9B,UAAI;AACJ,UAAI;AACF,eAAO,OAAO,aAAa,MAAM,MAAM;AAAA,MACzC,QAAQ;AACN,eAAO;AAAA,MACT;AACA,UAAI,SAAS,OAAW,QAAO,SAAS,WAAW,SAAS,GAAG,CAAC;AAChE,aAAO,SAAS,IAAI,MAAM,KAAK,SAAS,qBAAO,OAAO,KAAK,MAAM,IAAI;AAAA,IACvE,GAAG,EAAE,SAAS,KAAK,CAAC;AAAA,EACtB;AAGA,QAAM,UAAU,CAAC,QAAkD;AACjE,UAAM,QAAQ,UAAU,IAAI,GAAG;AAC/B,UAAM,OAAO,UAAU,IAAI,GAAG;AAC9B,QAAI,UAAU,UAAa,SAAS,OAAW,QAAO;AACtD,UAAM,QAAQ,MAAM,YAAY,SAAY,MAAM,WAAW,KAAK,SAAS,MAAM,WAAW,KAAK;AACjG,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAGA,QAAM,iBAAiB,CAAC,KAAa,QAAQ,MAC3C,qBAAO,QAAQ,MAAM;AACnB,UAAM,QAAQ,QAAQ,GAAG;AACzB,QAAI,UAAU,UAAa,MAAM,WAAW,MAAO,QAAO,qBAAO,QAAQ,KAAK;AAC9E,WAAO,qBAAO,QAAQ,uBAAS,KAAW,GAAG,CAAC,aAAa;AACzD,YAAM,UAAU,UAAU,IAAI,GAAG,KAAK,oBAAI,IAAI;AAC9C,cAAQ,IAAI,QAAQ;AACpB,gBAAU,IAAI,KAAK,OAAO;AAC1B,aAAO,uBAAS,MAAM,QAAQ,EAAE;AAAA,QAC9B,qBAAO,SAAS,qBAAO,KAAK,MAAM;AAChC,oBAAU,IAAI,GAAG,GAAG,OAAO,QAAQ;AAAA,QACrC,CAAC,CAAC;AAAA,QACF,qBAAO,QAAQ,MAAM,eAAe,KAAK,KAAK,CAAC;AAAA,MACjD;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAEH,QAAM,oBAAoB,CAAC,SACzB,qBAAO,IAAI,aAAY;AACrB,UAAM,MAAM,MAAM,IAAI;AACtB,QAAI,CAAC,UAAU,IAAI,GAAG,GAAG;AAEvB,YAAM,OAAO,OAAO,qBAAO,IAAI;AAAA,QAC7B,KAAK,MAAM,OAAO,aAAa,SAAS,QAAQ,OAAO,KAAK,IAAI,GAAG,MAAM;AAAA,QACzE,OAAO,MAAM,IAAI,SAAS,SAAS,EAAE,MAAM,aAAa,SAAS,mBAAmB,IAAI,IAAI,KAAK,CAAC;AAAA,MACpG,CAAC;AACD,aAAO,KAAK,MAAM,IAAI;AAAA,IACxB;AACA,UAAM,UAAU,OAAO,oBAAM;AAC7B,UAAM,QAAQ,OAAO,eAAe,GAAG,EAAE,KAAK,qBAAO,cAAc,QAAQ,CAAC;AAC5E,QAAI,qBAAO,OAAO,KAAK,GAAG;AACxB,aAAO,OAAO,qBAAO;AAAA,QACnB,IAAI,SAAS,SAAS;AAAA,UACpB,MAAM;AAAA,UACN,SAAS,gDAAgD,IAAI,WAAW,QAAQ;AAAA,UAChF,QAAQ;AAAA,UACR;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,QAAI,SAAS,MAAM;AACnB,eAAS;AACP,YAAM,YAAY,aAAa,OAAO,oBAAM,qBAAqB;AACjE,UAAI,aAAa,EAAG;AACpB,YAAM,OAAO,OAAO,eAAe,KAAK,OAAO,QAAQ,EAAE;AAAA,QACvD,qBAAO,cAAc,KAAK,IAAI,SAAS,SAAS,CAAC;AAAA,MACnD;AACA,UAAI,qBAAO,OAAO,IAAI,EAAG;AACzB,eAAS,KAAK;AAAA,IAChB;AACA,WAAO,EAAE,MAAM,QAAQ,OAAO,OAAO,YAAY;AAAA,EACnD,CAAC;AAEH,QAAM,cAAc,CAAC,SACnB,kBACI,kBAAkB,IAAI,IACtB,QAAQ,2BAA2B,EAAE,cAAc,EAAE,KAAK,MAAM,IAAI,EAAE,EAAE,CAAC,EAAE;AAAA,IAC3E,qBAAO;AAAA,MAAI,MACT,qBAAO,KAAK,MAAM;AAChB,wBAAgB;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,IACA,qBAAO;AAAA,MACL,CAAC,UAAU,MAAM,UAAU,SAAS;AAAA,MACpC,MAAM;AACJ,0BAAkB;AAClB,eAAO,kBAAkB,IAAI;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAEJ,QAAM,uBAAuB,CAAC,aAC5B,QAAQ,qCAAqC,eAAe,QAAQ,CAAC;AACvE,QAAM,gBAAgB,CACpB,QACA,aAEA,qBAAqB,QAAQ,EAAE;AAAA,IAC7B,qBAAO,QAAQ,CAAC,aAAa;AAC3B,YAAM,OAAO,uBAAuB,QAAQ;AAC5C,aAAO,SAAS,SAAY,qBAAO,QAAQ,CAAC,CAAC,IAAI,QAAQ,QAAQ,EAAE,KAAK,CAAC;AAAA,IAC3E,CAAC;AAAA,EACH;AAEF,SAAO,eAAe,KAAK;AAAA,IACzB,OAAO,CAAC,aAAa,QAAQ,sBAAsB,eAAe,QAAQ,CAAC;AAAA,IAC3E,YAAY,CAAC,aAAa,QAAQ,2BAA2B,eAAe,QAAQ,CAAC;AAAA,IACrF,YAAY,CAAC,aACX,QAAQ,2BAA2B;AAAA,MACjC,GAAG,eAAe,QAAQ;AAAA,MAC1B,SAAS,EAAE,oBAAoB,KAAK;AAAA,IACtC,CAAC;AAAA,IACH,gBAAgB,CAAC,aAAa,QAAQ,+BAA+B,eAAe,QAAQ,CAAC;AAAA,IAC7F,iBAAiB,CAAC,SAAS,QAAQ,+BAA+B,EAAE,cAAc,EAAE,KAAK,MAAM,IAAI,EAAE,EAAE,CAAC;AAAA,IACxG,kBAAkB,CAAC,UAAU,QAAQ,oBAAoB,EAAE,MAAM,CAAC;AAAA,IAClE;AAAA,IACA,uBAAuB,CAAC,aAAa,cAAc,+BAA+B,QAAQ;AAAA,IAC1F,uBAAuB,CAAC,aAAa,cAAc,+BAA+B,QAAQ;AAAA,IAC1F;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACH,CAAC;AAEH,MAAM,qBAAqB,CAAC,eACzB,UAAU,WAAW,GAAG,IAAI,YAAY,IAAI,SAAS,IAAI,YAAY;AAOxE,MAAM,SAAS,CACb,SACA,QACA,YACkC;AAClC,QAAM,SAAS,QAAQ,IAAI,CAAC,UAAU,MAAM,YAAY,IAAI,kBAAkB,CAAC;AAC/E,QAAM,WAAW,OAAO,UAAU,CAAC,YAAY,YAAY,MAAS;AACpE,QAAM,UAAU,CAAC,SAA2D;AAC1E,UAAM,YAAY,YAAY,IAAI;AAClC,UAAM,UAAU,OAAO,UAAU,CAAC,UAAU,OAAO,SAAS,SAAS,MAAM,IAAI;AAC/E,UAAM,QAAQ,WAAW,IAAI,UAAU;AACvC,WAAO,SAAS,IACZ,qBAAO,QAAQ,KAAK,IACpB,qBAAO;AAAA,MACP,IAAI,SAAS,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,SAAS,wCAAwC,aAAa,eAAe;AAAA,QAC7E;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACJ;AACA,QAAM,QAAQ,CAAC,SACb,qBAAO,QAAQ,QAAQ,IAAI,GAAG,MAAM;AACtC,QAAM,aAAa,CACjB,WASF,CAAC,aAAsC,qBAAO,QAAQ,MAAM,SAAS,IAAI,GAAG,CAAC,WAAW,OAAO,MAAM,EAAE,QAAQ,CAAC;AAChH,QAAM,UAAU,QAAQ,IAAI,CAAC,GAAG,UAAU,KAAK;AAC/C,SAAO,eAAe,KAAK;AAAA,IACzB,OAAO,WAAW,OAAO;AAAA,IACzB,YAAY,WAAW,YAAY;AAAA,IACnC,YAAY,WAAW,YAAY;AAAA,IACnC,gBAAgB,WAAW,gBAAgB;AAAA,IAC3C,sBAAsB,WAAW,sBAAsB;AAAA,IACvD,uBAAuB,WAAW,uBAAuB;AAAA,IACzD,uBAAuB,WAAW,uBAAuB;AAAA,IACzD,iBAAiB,CAAC,SAAS,qBAAO,QAAQ,MAAM,IAAI,GAAG,CAAC,WAAW,OAAO,gBAAgB,IAAI,CAAC;AAAA,IAC/F,aAAa,CAAC,SAAS,qBAAO,QAAQ,MAAM,IAAI,GAAG,CAAC,WAAW,OAAO,YAAY,IAAI,CAAC;AAAA,IACvF,MAAM,CAAC,MAAM,SAAS,qBAAO,QAAQ,MAAM,IAAI,GAAG,CAAC,WAAW,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA;AAAA,IAErF,OAAO,CAAC,SAAS,qBAAO,QAAQ,QAAQ,IAAI,GAAG,CAAC,UAAU,QAAQ,KAAK,GAAG,MAAM,IAAI,KAAK,qBAAO,IAAI;AAAA,IACpG,SAAS,qBAAO;AAAA,MAAQ,MACtB,qBAAO,QAAQ,SAAS,CAAC,UAAU,QAAQ,KAAK,GAAG,WAAW,qBAAO,MAAM,EAAE,SAAS,KAAK,CAAC;AAAA,IAC9F;AAAA,IACA,kBAAkB,CAAC,UACjB,QAAQ,WAAW,IACjB,qBAAO,QAAQ,OAAO,CAAC,GAAG,CAAC,WAAW,OAAO,iBAAiB,KAAK,CAAC,IACpE,qBAAO;AAAA,MACL;AAAA,MACA,CAAC,UAAU,qBAAO,QAAQ,OAAO,KAAK,GAAG,CAAC,WAAW,OAAO,iBAAiB,KAAK,CAAC;AAAA,MACnF,EAAE,aAAa,YAAY;AAAA,IAC7B,EAAE;AAAA,MACA,qBAAO;AAAA,QAAI,CAAC,YACV,QAAQ,QAAQ,CAAC,WAAW,MAAM,QAAQ,MAAM,IAAI,SAAS,UAAU,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;AAAA,MAC7F;AAAA,IACF;AAAA,EACN,CAAC;AACH;AAEA,MAAM,aAAa,CACjB,WAC4D;AAC5D,QAAM,UAAiC,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAgB;AACzF,SAAO,QAAQ,WAAW,IACtB,qBAAO,KAAK,QAAQ,iBAAiB,iDAAiD,CAAC,IACvF,qBAAO,QAAQ,OAAO;AAC5B;AAqBO,MAAM,OAAO,CAClB,WAMA,qBAAO,IAAI,aAAY;AACrB,QAAM,UAAU,OAAO,WAAW,MAAM;AACxC,QAAM,UAAU,OAAO,qBAAO,QAAQ,SAAS,UAAU;AACzD,SAAO,OAAO,SAAS,CAAC,UAAU,qBAAO,QAAQ,QAAQ,KAAK,CAAE,GAAG,CAAC,UAAU,QAAQ,KAAK,CAAC;AAC9F,CAAC;AAeI,MAAM,WAAW,CACtB,WAMA,qBAAO,IAAI,aAAY;AACrB,QAAM,UAAU,OAAO,WAAW,MAAM;AACxC,aAAW,SAAS,SAAS;AAC3B,UAAM,UAAU,iBAAiB,OAAO,wBAAwB,KAAK,QAAQ,KAAK,MAAM,WAAW,EAAE,IAAI;AACzG,QAAI,YAAY,OAAW,QAAO,OAAO,qBAAO,KAAK,OAAO;AAAA,EAC9D;AACA,QAAM,UAA4D,QAAQ,IAAI,MAAM,MAAS;AAI7F,QAAM,SAAS,OAAO,qBAAO,QAAQ,SAAS,CAAC,OAAO,UACpD,qBAAO,IAAI,aAAY;AACrB,UAAM,SAAS,OAAO,uBAAS,KAAW;AAC1C,UAAM,QAAQ,OAAO,uBAAS,KAAuD;AACrF,WAAO,uBAAS,MAAM,MAAM,EAAE;AAAA,MAC5B,qBAAO,QAAQ,WAAW,KAAK,CAAC;AAAA,MAChC,qBAAO,IAAI,CAAC,WAAW,qBAAO,KAAK,MAAM,MAAM,QAAQ,KAAK,IAAI,OAAO,CAAC;AAAA,MACxE,qBAAO;AAAA,MACP,qBAAO,QAAQ,CAAC,SAAS,uBAAS,KAAK,OAAO,IAAI,CAAC;AAAA,MACnD,qBAAO,WAAW,EAAE,kBAAkB,KAAK,CAAC;AAAA,IAC9C;AACA,WAAO,uBAAS,QAAQ,QAAQ,MAAS,EAAE,KAAK,qBAAO,QAAQ,uBAAS,MAAM,KAAK,CAAC,CAAC;AAAA,EACvF,CAAC,CAAC;AACJ,SAAO,OAAO,SAAS,CAAC,UAAU,OAAO,KAAK,GAAI,CAAC,UAAU,QAAQ,KAAK,CAAC;AAC7E,CAAC;AAQI,MAAM,QAAQ,CACnB,WAEA,oBAAM,OAAO,eAAe,gBAAgB,KAAK,MAAM,CAAC;AAQnD,MAAM,YAAY,CACvB,WAEA,oBAAM,OAAO,eAAe,gBAAgB,SAAS,MAAM,CAAC;",
+  "names": ["id"]
+}

package/dist/cjs/PortableSearch.d.ts

@@ -0,0 +1,36 @@
+/**
+ * The in-process implementation of the ripgrep search contract.
+ *
+ * @since 1.0.0
+ */
+import * as Path from "@smthrs/kernel/Path";
+import { type Context, Effect, Layer } from "effect";
+import * as FileSystem from "effect/FileSystem";
+import * as Search from "./Search.ts";
+import * as StdError from "./StdError.ts";
+/**
+ * The files this peer's `grep` reads for `input`, in the order it reads
+ * them: the walk under `input.root` with its `.gitignore` rules and
+ * `input.globs` applied and symbolic links left out, or the root itself when
+ * it names one file. A peer that has to bring a tree's bytes to this process
+ * before it can search them (`RemoteSearch`) fetches exactly these.
+ *
+ * @category queries
+ * @since 1.0.0-rc.8
+ */
+export declare const searched: (input: Pick<Search.GrepInput, "root" | "hidden" | "noIgnore" | "globs">) => Effect.Effect<ReadonlyArray<string>, StdError.StdError, FileSystem.FileSystem | Path.Path>;
+/**
+ * Captures filesystem and path services in the portable peer.
+ *
+ * @category constructors
+ * @since 1.0.0
+ */
+export declare const make: (services: Context.Context<FileSystem.FileSystem | Path.Path>) => Search.Search;
+/**
+ * Provides the in-process peer.
+ *
+ * @category layers
+ * @since 1.0.0
+ */
+export declare const layer: Layer.Layer<Search.Search, never, FileSystem.FileSystem | Path.Path>;
+//# sourceMappingURL=PortableSearch.d.ts.map

package/dist/cjs/PortableSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortableSearch.d.ts","sourceRoot":"","sources":["../../src/PortableSearch.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,IAAI,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,KAAK,OAAO,EAAE,MAAM,EAAE,KAAK,EAAU,MAAM,QAAQ,CAAA;AAC5D,OAAO,KAAK,UAAU,MAAM,mBAAmB,CAAA;AAM/C,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAA;AAkOzC;;;;;;;;;GASG;AACH,eAAO,MAAM,QAAQ,GACnB,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,QAAQ,GAAG,UAAU,GAAG,OAAO,CAAC,KACtE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,CAMxF,CAAA;AAEJ;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,UAAU,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAG,MAAM,CAAC,MAIvF,CAAA;AAEJ;;;;;GAKG;AACH,eAAO,MAAM,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC,IAAI,CAGtF,CAAA"}

package/dist/cjs/PortableSearch.js

@@ -0,0 +1,240 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var PortableSearch_exports = {};
+__export(PortableSearch_exports, {
+  layer: () => layer,
+  make: () => make,
+  searched: () => searched
+});
+module.exports = __toCommonJS(PortableSearch_exports);
+var Path = __toESM(require("@smthrs/kernel/Path"), 1);
+var import_effect = require("effect");
+var FileSystem = __toESM(require("effect/FileSystem"), 1);
+var Grouping = __toESM(require("./internal/Grouping.js"), 1);
+var LinearRegex = __toESM(require("./internal/LinearRegex.js"), 1);
+var import_SearchContract = require("./internal/SearchContract.js");
+var import_Text = require("./internal/Text.js");
+var Walk = __toESM(require("./internal/Walk.js"), 1);
+var Search = __toESM(require("./Search.js"), 1);
+var Contract = __toESM(require("./SearchContract.js"), 1);
+var StdError = __toESM(require("./StdError.js"), 1);
+const candidates = (fileSystem, path, walked, root, globs) => import_effect.Effect.gen(function* () {
+  if (walked.explicitFile) return walked.files;
+  const included = walked.files.filter(
+    (file) => Contract.includedByGlobs(globs, Walk.relativeForPattern(path, root, file), path.basename(file))
+  );
+  const links = yield* Walk.symbolicLinks(fileSystem, included);
+  return included.filter((_, index) => links[index] !== true);
+});
+const preview = (line) => {
+  let head = "";
+  let length = 0;
+  for (const character of line) {
+    if (length++ === 500) break;
+    head += character;
+  }
+  return (0, import_Text.truncateBytes)(head, 500, { keep: "head" }).text;
+};
+const grep = (input) => import_effect.Effect.gen(function* () {
+  const fileSystem = yield* FileSystem.FileSystem;
+  const path = yield* Path.Path;
+  const includedByGlobs = (relative, basename) => Contract.includedByGlobs(input.globs, relative, basename);
+  const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs);
+  const insensitive = input.ignoreCase || input.smartCase && !/[A-Z]/.test(input.pattern);
+  const regex = LinearRegex.compile(
+    input.fixedStrings ? (0, import_SearchContract.escapeRegex)(input.pattern) : input.pattern,
+    insensitive
+  );
+  const shownMatches = [];
+  const shownFiles = [];
+  let total = 0;
+  let filesSearched = 0;
+  let skippedBinary = 0;
+  const included = yield* candidates(fileSystem, path, walked, input.root, input.globs);
+  for (const file of included) {
+    filesSearched++;
+    const remaining = input.filesWithMatches ? 0 : input.limit - shownMatches.length;
+    const matched = [];
+    const selected = /* @__PURE__ */ new Map();
+    const recent = /* @__PURE__ */ new Map();
+    let count = 0;
+    let lineNumber = 0;
+    let through = 0;
+    const scanLine = (text) => import_effect.Effect.gen(function* () {
+      lineNumber++;
+      let matches = false;
+      if (input.maxCount === void 0 || count < input.maxCount) {
+        const evaluation = regex.test(text);
+        let step = evaluation.next();
+        while (!step.done) {
+          yield* import_effect.Effect.yieldNow;
+          step = evaluation.next();
+        }
+        matches = step.value;
+      }
+      if (matches) count++;
+      if (remaining <= 0) return;
+      const retain = matches && matched.length < remaining + 1;
+      const awaiting = matched.length < remaining + 1;
+      if (retain || lineNumber <= through || awaiting && input.beforeContext > 0) {
+        const row = {
+          file,
+          line: lineNumber,
+          text: preview(text),
+          kind: retain ? "match" : "context"
+        };
+        if (retain) {
+          matched.push(lineNumber);
+          for (const [number, context] of recent) selected.set(number, context);
+          through = lineNumber + input.afterContext;
+        }
+        if (retain || lineNumber <= through) selected.set(lineNumber, row);
+        if (awaiting && input.beforeContext > 0) recent.set(lineNumber, row);
+      }
+      recent.delete(lineNumber - input.beforeContext);
+      if (matched.length >= remaining + 1) recent.clear();
+    });
+    const decoder = new TextDecoder();
+    let fragments = [];
+    const consume = (chunk) => import_effect.Effect.gen(function* () {
+      let from = 0;
+      let newline = chunk.indexOf("\n");
+      while (newline >= 0) {
+        fragments.push(chunk.slice(from, newline));
+        const line = fragments.join("");
+        fragments = [];
+        yield* scanLine(line.endsWith("\r") ? line.slice(0, -1) : line);
+        from = newline + 1;
+        newline = chunk.indexOf("\n", from);
+      }
+      if (from < chunk.length) fragments.push(chunk.slice(from));
+    });
+    const scanned = yield* import_effect.Effect.gen(function* () {
+      let started = false;
+      yield* fileSystem.stream(file).pipe(
+        import_effect.Stream.catch((error) => started ? import_effect.Stream.fail(error) : import_effect.Stream.fromEffect(fileSystem.readFile(file))),
+        import_effect.Stream.runForEach((bytes) => {
+          started = true;
+          if (bytes.includes(0)) {
+            return import_effect.Effect.fail(
+              new StdError.StdError({
+                code: "binary_file",
+                message: `Cannot search binary file: ${file}`,
+                path: file
+              })
+            );
+          }
+          return consume(decoder.decode(bytes, { stream: true }));
+        })
+      );
+      yield* consume(decoder.decode());
+      if (fragments.length > 0) yield* scanLine(fragments.join(""));
+      return true;
+    }).pipe(import_effect.Effect.catch((error) => {
+      if (error instanceof StdError.StdError) {
+        if (walked.explicitFile) return import_effect.Effect.fail(error);
+        skippedBinary++;
+      }
+      return import_effect.Effect.succeed(false);
+    }));
+    if (!scanned || count === 0) continue;
+    total += input.filesWithMatches ? 1 : count;
+    if (input.filesWithMatches) {
+      if (shownFiles.length < input.limit) shownFiles.push(file);
+      continue;
+    }
+    if (matched.length === 0) continue;
+    const grouped = Grouping.group([...selected.values()].sort((left, right) => left.line - right.line)).slice(0, remaining);
+    const contents = /* @__PURE__ */ new Map();
+    if (input.symbols) {
+      const source = yield* fileSystem.readFileString(file).pipe(import_effect.Effect.orElseSucceed(() => void 0));
+      if (source !== void 0) contents.set(file, Grouping.sourceLines(source));
+    }
+    shownMatches.push(...Grouping.annotate(grouped, contents));
+  }
+  const truncated = total > input.limit;
+  const unsatisfiable = total > 0 ? void 0 : yield* Contract.unsatisfiableNotice({
+    fileSystem,
+    path,
+    root: input.root,
+    globs: input.globs,
+    hidden: input.hidden,
+    noIgnore: input.noIgnore,
+    ignored: walked.ignored
+  });
+  return {
+    matches: shownMatches,
+    files: shownFiles,
+    filesSearched,
+    skippedBinary,
+    truncated,
+    ...truncated ? { notice: (0, import_Text.notice)(input.filesWithMatches ? "files" : "matches", input.limit, total) } : {},
+    ...unsatisfiable === void 0 ? {} : { notice: unsatisfiable }
+  };
+});
+const glob = (input) => import_effect.Effect.gen(function* () {
+  const fileSystem = yield* FileSystem.FileSystem;
+  const path = yield* Path.Path;
+  const includedByGlobs = (relative, basename) => Contract.includedByGlobs([input.pattern], relative, basename);
+  const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs);
+  const included = yield* candidates(fileSystem, path, walked, input.root, [input.pattern]);
+  const matching = [...included].sort();
+  const paths = matching.slice(0, input.limit);
+  const unsatisfiable = matching.length > 0 ? void 0 : yield* Contract.unsatisfiableNotice({
+    fileSystem,
+    path,
+    root: input.root,
+    globs: [input.pattern],
+    hidden: input.hidden,
+    noIgnore: input.noIgnore,
+    ignored: walked.ignored
+  });
+  return {
+    paths,
+    total: matching.length,
+    truncated: matching.length > input.limit,
+    ...matching.length > input.limit ? { notice: (0, import_Text.notice)("entries", paths.length, matching.length) } : {},
+    ...unsatisfiable === void 0 ? {} : { notice: unsatisfiable }
+  };
+});
+const searched = (input) => import_effect.Effect.gen(function* () {
+  const fileSystem = yield* FileSystem.FileSystem;
+  const path = yield* Path.Path;
+  const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore);
+  return yield* candidates(fileSystem, path, walked, input.root, input.globs);
+});
+const make = (services) => Search.make({
+  grep: (input) => import_effect.Effect.provide(grep(input), services),
+  glob: (input) => import_effect.Effect.provide(glob(input), services)
+});
+const layer = import_effect.Layer.effect(
+  Search.Search,
+  import_effect.Effect.map(import_effect.Effect.context(), make)
+);
+//# sourceMappingURL=PortableSearch.js.map

package/dist/cjs/PortableSearch.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/PortableSearch.ts"],
+  "sourcesContent": ["/**\n * The in-process implementation of the ripgrep search contract.\n *\n * @since 1.0.0\n */\n\nimport * as Path from \"@smthrs/kernel/Path\"\nimport { type Context, Effect, Layer, Stream } from \"effect\"\nimport * as FileSystem from \"effect/FileSystem\"\nimport * as Grouping from \"./internal/Grouping.ts\"\nimport * as LinearRegex from \"./internal/LinearRegex.ts\"\nimport { escapeRegex } from \"./internal/SearchContract.ts\"\nimport { notice, truncateBytes } from \"./internal/Text.ts\"\nimport * as Walk from \"./internal/Walk.ts\"\nimport * as Search from \"./Search.ts\"\nimport * as Contract from \"./SearchContract.ts\"\nimport * as StdError from \"./StdError.ts\"\n\n/**\n * Narrows a walk to the files a search reports.\n *\n * A root that names one file is that file: `rg` searches a path given on the\n * command line whatever `-g` says, and follows it even when it is a symlink.\n * Everything a walk found is filtered by the globs first and probed for\n * symlinks second, so the probe runs over the far smaller included set.\n */\nconst candidates = (\n  fileSystem: FileSystem.FileSystem,\n  path: Path.Path,\n  walked: Walk.Walked,\n  root: string,\n  globs: ReadonlyArray<string>\n): Effect.Effect<ReadonlyArray<string>> =>\n  Effect.gen(function*() {\n    if (walked.explicitFile) return walked.files\n    const included = walked.files.filter((file) =>\n      Contract.includedByGlobs(globs, Walk.relativeForPattern(path, root, file), path.basename(file))\n    )\n    const links = yield* Walk.symbolicLinks(fileSystem, included)\n    return included.filter((_, index) => links[index] !== true)\n  })\n\nconst preview = (line: string): string => {\n  let head = \"\"\n  let length = 0\n  for (const character of line) {\n    if (length++ === 500) break\n    head += character\n  }\n  return truncateBytes(head, 500, { keep: \"head\" }).text\n}\n\nconst grep = (\n  input: Search.GrepInput\n): Effect.Effect<Search.GrepOutput, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const includedByGlobs = (relative: string, basename: string) =>\n      Contract.includedByGlobs(input.globs, relative, basename)\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs)\n    const insensitive = input.ignoreCase || (input.smartCase && !/[A-Z]/.test(input.pattern))\n    const regex = LinearRegex.compile(\n      input.fixedStrings ? escapeRegex(input.pattern) : input.pattern,\n      insensitive\n    )\n    const shownMatches: Array<Search.GrepMatch> = []\n    const shownFiles: Array<string> = []\n    let total = 0\n    let filesSearched = 0\n    let skippedBinary = 0\n\n    const included = yield* candidates(fileSystem, path, walked, input.root, input.globs)\n    for (const file of included) {\n      // Count every admitted file, including unreadable files and binaries.\n      filesSearched++\n      const remaining = input.filesWithMatches ? 0 : input.limit - shownMatches.length\n      const matched: Array<number> = []\n      const selected = new Map<number, Search.GrepLine>()\n      const recent = new Map<number, Search.GrepLine>()\n      let count = 0\n      let lineNumber = 0\n      let through = 0\n      const scanLine = (text: string) =>\n        Effect.gen(function*() {\n          lineNumber++\n          let matches = false\n          if (input.maxCount === undefined || count < input.maxCount) {\n            const evaluation = regex.test(text)\n            let step = evaluation.next()\n            while (!step.done) {\n              yield* Effect.yieldNow\n              step = evaluation.next()\n            }\n            matches = step.value\n          }\n          if (matches) count++\n          if (remaining <= 0) return\n          // The first overflow hit is a boundary: context nearest to it must\n          // not migrate to the last retained hit when the limit is applied.\n          const retain = matches && matched.length < remaining + 1\n          const awaiting = matched.length < remaining + 1\n          if (retain || lineNumber <= through || (awaiting && input.beforeContext > 0)) {\n            const row: Search.GrepLine = {\n              file,\n              line: lineNumber,\n              text: preview(text),\n              kind: retain ? \"match\" : \"context\"\n            }\n            if (retain) {\n              matched.push(lineNumber)\n              for (const [number, context] of recent) selected.set(number, context)\n              through = lineNumber + input.afterContext\n            }\n            if (retain || lineNumber <= through) selected.set(lineNumber, row)\n            if (awaiting && input.beforeContext > 0) recent.set(lineNumber, row)\n          }\n          recent.delete(lineNumber - input.beforeContext)\n          if (matched.length >= remaining + 1) recent.clear()\n        })\n      // Split only on LF (stripping a preceding CR), just like sourceLines.\n      // Stream.splitLines also treats a standalone CR as a delimiter.\n      const decoder = new TextDecoder()\n      let fragments: Array<string> = []\n      const consume = (chunk: string) =>\n        Effect.gen(function*() {\n          let from = 0\n          let newline = chunk.indexOf(\"\\n\")\n          while (newline >= 0) {\n            fragments.push(chunk.slice(from, newline))\n            const line = fragments.join(\"\")\n            fragments = []\n            yield* scanLine(line.endsWith(\"\\r\") ? line.slice(0, -1) : line)\n            from = newline + 1\n            newline = chunk.indexOf(\"\\n\", from)\n          }\n          if (from < chunk.length) fragments.push(chunk.slice(from))\n        })\n      const scanned = yield* Effect.gen(function*() {\n        let started = false\n        // A guarded disk host can safely expose atomic reads while refusing\n        // open streaming handles. Retry through that same filesystem service\n        // only before any bytes arrive, so a failed partial stream is never\n        // combined with a second reading of a file that may have changed.\n        yield* fileSystem.stream(file).pipe(\n          Stream.catch((error) => started ? Stream.fail(error) : Stream.fromEffect(fileSystem.readFile(file))),\n          Stream.runForEach((bytes) => {\n            started = true\n            if (bytes.includes(0)) {\n              return Effect.fail(\n                new StdError.StdError({\n                  code: \"binary_file\",\n                  message: `Cannot search binary file: ${file}`,\n                  path: file\n                })\n              )\n            }\n            return consume(decoder.decode(bytes, { stream: true }))\n          })\n        )\n        yield* consume(decoder.decode())\n        if (fragments.length > 0) yield* scanLine(fragments.join(\"\"))\n        return true\n      }).pipe(Effect.catch((error) => {\n        if (error instanceof StdError.StdError) {\n          if (walked.explicitFile) return Effect.fail(error)\n          skippedBinary++\n        }\n        return Effect.succeed(false)\n      }))\n      if (!scanned || count === 0) continue\n      total += input.filesWithMatches ? 1 : count\n      if (input.filesWithMatches) {\n        if (shownFiles.length < input.limit) shownFiles.push(file)\n        continue\n      }\n      if (matched.length === 0) continue\n      const grouped = Grouping.group([...selected.values()].sort((left, right) => left.line - right.line))\n        .slice(0, remaining)\n      // Source is needed only for returned symbols, and is released before\n      // moving to the next file. Overflow files never load symbol source.\n      const contents = new Map<string, ReadonlyArray<string>>()\n      if (input.symbols) {\n        const source = yield* fileSystem.readFileString(file).pipe(Effect.orElseSucceed(() => undefined))\n        if (source !== undefined) contents.set(file, Grouping.sourceLines(source))\n      }\n      shownMatches.push(...Grouping.annotate(grouped, contents))\n    }\n\n    const truncated = total > input.limit\n    const unsatisfiable = total > 0 ? undefined : yield* Contract.unsatisfiableNotice({\n      fileSystem,\n      path,\n      root: input.root,\n      globs: input.globs,\n      hidden: input.hidden,\n      noIgnore: input.noIgnore,\n      ignored: walked.ignored\n    })\n    return {\n      matches: shownMatches,\n      files: shownFiles,\n      filesSearched,\n      skippedBinary,\n      truncated,\n      ...(truncated\n        ? { notice: notice(input.filesWithMatches ? \"files\" : \"matches\", input.limit, total) }\n        : {}),\n      ...(unsatisfiable === undefined ? {} : { notice: unsatisfiable })\n    }\n  })\n\nconst glob = (\n  input: Search.GlobInput\n): Effect.Effect<Search.GlobOutput, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const includedByGlobs = (relative: string, basename: string) =>\n      Contract.includedByGlobs([input.pattern], relative, basename)\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore, includedByGlobs)\n    const included = yield* candidates(fileSystem, path, walked, input.root, [input.pattern])\n    const matching = [...included].sort()\n    const paths = matching.slice(0, input.limit)\n    const unsatisfiable = matching.length > 0 ? undefined : yield* Contract.unsatisfiableNotice({\n      fileSystem,\n      path,\n      root: input.root,\n      globs: [input.pattern],\n      hidden: input.hidden,\n      noIgnore: input.noIgnore,\n      ignored: walked.ignored\n    })\n    return {\n      paths,\n      total: matching.length,\n      truncated: matching.length > input.limit,\n      ...(matching.length > input.limit ? { notice: notice(\"entries\", paths.length, matching.length) } : {}),\n      ...(unsatisfiable === undefined ? {} : { notice: unsatisfiable })\n    }\n  })\n\n/**\n * The files this peer's `grep` reads for `input`, in the order it reads\n * them: the walk under `input.root` with its `.gitignore` rules and\n * `input.globs` applied and symbolic links left out, or the root itself when\n * it names one file. A peer that has to bring a tree's bytes to this process\n * before it can search them (`RemoteSearch`) fetches exactly these.\n *\n * @category queries\n * @since 1.0.0-rc.8\n */\nexport const searched = (\n  input: Pick<Search.GrepInput, \"root\" | \"hidden\" | \"noIgnore\" | \"globs\">\n): Effect.Effect<ReadonlyArray<string>, StdError.StdError, FileSystem.FileSystem | Path.Path> =>\n  Effect.gen(function*() {\n    const fileSystem = yield* FileSystem.FileSystem\n    const path = yield* Path.Path\n    const walked = yield* Walk.files(fileSystem, path, input.root, input.hidden, input.noIgnore)\n    return yield* candidates(fileSystem, path, walked, input.root, input.globs)\n  })\n\n/**\n * Captures filesystem and path services in the portable peer.\n *\n * @category constructors\n * @since 1.0.0\n */\nexport const make = (services: Context.Context<FileSystem.FileSystem | Path.Path>): Search.Search =>\n  Search.make({\n    grep: (input) => Effect.provide(grep(input), services),\n    glob: (input) => Effect.provide(glob(input), services)\n  })\n\n/**\n * Provides the in-process peer.\n *\n * @category layers\n * @since 1.0.0\n */\nexport const layer: Layer.Layer<Search.Search, never, FileSystem.FileSystem | Path.Path> = Layer.effect(\n  Search.Search,\n  Effect.map(Effect.context<FileSystem.FileSystem | Path.Path>(), make)\n)\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAMA,WAAsB;AACtB,oBAAoD;AACpD,iBAA4B;AAC5B,eAA0B;AAC1B,kBAA6B;AAC7B,4BAA4B;AAC5B,kBAAsC;AACtC,WAAsB;AACtB,aAAwB;AACxB,eAA0B;AAC1B,eAA0B;AAU1B,MAAM,aAAa,CACjB,YACA,MACA,QACA,MACA,UAEA,qBAAO,IAAI,aAAY;AACrB,MAAI,OAAO,aAAc,QAAO,OAAO;AACvC,QAAM,WAAW,OAAO,MAAM;AAAA,IAAO,CAAC,SACpC,SAAS,gBAAgB,OAAO,KAAK,mBAAmB,MAAM,MAAM,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC;AAAA,EAChG;AACA,QAAM,QAAQ,OAAO,KAAK,cAAc,YAAY,QAAQ;AAC5D,SAAO,SAAS,OAAO,CAAC,GAAG,UAAU,MAAM,KAAK,MAAM,IAAI;AAC5D,CAAC;AAEH,MAAM,UAAU,CAAC,SAAyB;AACxC,MAAI,OAAO;AACX,MAAI,SAAS;AACb,aAAW,aAAa,MAAM;AAC5B,QAAI,aAAa,IAAK;AACtB,YAAQ;AAAA,EACV;AACA,aAAO,2BAAc,MAAM,KAAK,EAAE,MAAM,OAAO,CAAC,EAAE;AACpD;AAEA,MAAM,OAAO,CACX,UAEA,qBAAO,IAAI,aAAY;AACrB,QAAM,aAAa,OAAO,WAAW;AACrC,QAAM,OAAO,OAAO,KAAK;AACzB,QAAM,kBAAkB,CAAC,UAAkB,aACzC,SAAS,gBAAgB,MAAM,OAAO,UAAU,QAAQ;AAC1D,QAAM,SAAS,OAAO,KAAK,MAAM,YAAY,MAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU,eAAe;AAC5G,QAAM,cAAc,MAAM,cAAe,MAAM,aAAa,CAAC,QAAQ,KAAK,MAAM,OAAO;AACvF,QAAM,QAAQ,YAAY;AAAA,IACxB,MAAM,mBAAe,mCAAY,MAAM,OAAO,IAAI,MAAM;AAAA,IACxD;AAAA,EACF;AACA,QAAM,eAAwC,CAAC;AAC/C,QAAM,aAA4B,CAAC;AACnC,MAAI,QAAQ;AACZ,MAAI,gBAAgB;AACpB,MAAI,gBAAgB;AAEpB,QAAM,WAAW,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;AACpF,aAAW,QAAQ,UAAU;AAE3B;AACA,UAAM,YAAY,MAAM,mBAAmB,IAAI,MAAM,QAAQ,aAAa;AAC1E,UAAM,UAAyB,CAAC;AAChC,UAAM,WAAW,oBAAI,IAA6B;AAClD,UAAM,SAAS,oBAAI,IAA6B;AAChD,QAAI,QAAQ;AACZ,QAAI,aAAa;AACjB,QAAI,UAAU;AACd,UAAM,WAAW,CAAC,SAChB,qBAAO,IAAI,aAAY;AACrB;AACA,UAAI,UAAU;AACd,UAAI,MAAM,aAAa,UAAa,QAAQ,MAAM,UAAU;AAC1D,cAAM,aAAa,MAAM,KAAK,IAAI;AAClC,YAAI,OAAO,WAAW,KAAK;AAC3B,eAAO,CAAC,KAAK,MAAM;AACjB,iBAAO,qBAAO;AACd,iBAAO,WAAW,KAAK;AAAA,QACzB;AACA,kBAAU,KAAK;AAAA,MACjB;AACA,UAAI,QAAS;AACb,UAAI,aAAa,EAAG;AAGpB,YAAM,SAAS,WAAW,QAAQ,SAAS,YAAY;AACvD,YAAM,WAAW,QAAQ,SAAS,YAAY;AAC9C,UAAI,UAAU,cAAc,WAAY,YAAY,MAAM,gBAAgB,GAAI;AAC5E,cAAM,MAAuB;AAAA,UAC3B;AAAA,UACA,MAAM;AAAA,UACN,MAAM,QAAQ,IAAI;AAAA,UAClB,MAAM,SAAS,UAAU;AAAA,QAC3B;AACA,YAAI,QAAQ;AACV,kBAAQ,KAAK,UAAU;AACvB,qBAAW,CAAC,QAAQ,OAAO,KAAK,OAAQ,UAAS,IAAI,QAAQ,OAAO;AACpE,oBAAU,aAAa,MAAM;AAAA,QAC/B;AACA,YAAI,UAAU,cAAc,QAAS,UAAS,IAAI,YAAY,GAAG;AACjE,YAAI,YAAY,MAAM,gBAAgB,EAAG,QAAO,IAAI,YAAY,GAAG;AAAA,MACrE;AACA,aAAO,OAAO,aAAa,MAAM,aAAa;AAC9C,UAAI,QAAQ,UAAU,YAAY,EAAG,QAAO,MAAM;AAAA,IACpD,CAAC;AAGH,UAAM,UAAU,IAAI,YAAY;AAChC,QAAI,YAA2B,CAAC;AAChC,UAAM,UAAU,CAAC,UACf,qBAAO,IAAI,aAAY;AACrB,UAAI,OAAO;AACX,UAAI,UAAU,MAAM,QAAQ,IAAI;AAChC,aAAO,WAAW,GAAG;AACnB,kBAAU,KAAK,MAAM,MAAM,MAAM,OAAO,CAAC;AACzC,cAAM,OAAO,UAAU,KAAK,EAAE;AAC9B,oBAAY,CAAC;AACb,eAAO,SAAS,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI,IAAI;AAC9D,eAAO,UAAU;AACjB,kBAAU,MAAM,QAAQ,MAAM,IAAI;AAAA,MACpC;AACA,UAAI,OAAO,MAAM,OAAQ,WAAU,KAAK,MAAM,MAAM,IAAI,CAAC;AAAA,IAC3D,CAAC;AACH,UAAM,UAAU,OAAO,qBAAO,IAAI,aAAY;AAC5C,UAAI,UAAU;AAKd,aAAO,WAAW,OAAO,IAAI,EAAE;AAAA,QAC7B,qBAAO,MAAM,CAAC,UAAU,UAAU,qBAAO,KAAK,KAAK,IAAI,qBAAO,WAAW,WAAW,SAAS,IAAI,CAAC,CAAC;AAAA,QACnG,qBAAO,WAAW,CAAC,UAAU;AAC3B,oBAAU;AACV,cAAI,MAAM,SAAS,CAAC,GAAG;AACrB,mBAAO,qBAAO;AAAA,cACZ,IAAI,SAAS,SAAS;AAAA,gBACpB,MAAM;AAAA,gBACN,SAAS,8BAA8B,IAAI;AAAA,gBAC3C,MAAM;AAAA,cACR,CAAC;AAAA,YACH;AAAA,UACF;AACA,iBAAO,QAAQ,QAAQ,OAAO,OAAO,EAAE,QAAQ,KAAK,CAAC,CAAC;AAAA,QACxD,CAAC;AAAA,MACH;AACA,aAAO,QAAQ,QAAQ,OAAO,CAAC;AAC/B,UAAI,UAAU,SAAS,EAAG,QAAO,SAAS,UAAU,KAAK,EAAE,CAAC;AAC5D,aAAO;AAAA,IACT,CAAC,EAAE,KAAK,qBAAO,MAAM,CAAC,UAAU;AAC9B,UAAI,iBAAiB,SAAS,UAAU;AACtC,YAAI,OAAO,aAAc,QAAO,qBAAO,KAAK,KAAK;AACjD;AAAA,MACF;AACA,aAAO,qBAAO,QAAQ,KAAK;AAAA,IAC7B,CAAC,CAAC;AACF,QAAI,CAAC,WAAW,UAAU,EAAG;AAC7B,aAAS,MAAM,mBAAmB,IAAI;AACtC,QAAI,MAAM,kBAAkB;AAC1B,UAAI,WAAW,SAAS,MAAM,MAAO,YAAW,KAAK,IAAI;AACzD;AAAA,IACF;AACA,QAAI,QAAQ,WAAW,EAAG;AAC1B,UAAM,UAAU,SAAS,MAAM,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,OAAO,MAAM,IAAI,CAAC,EAChG,MAAM,GAAG,SAAS;AAGrB,UAAM,WAAW,oBAAI,IAAmC;AACxD,QAAI,MAAM,SAAS;AACjB,YAAM,SAAS,OAAO,WAAW,eAAe,IAAI,EAAE,KAAK,qBAAO,cAAc,MAAM,MAAS,CAAC;AAChG,UAAI,WAAW,OAAW,UAAS,IAAI,MAAM,SAAS,YAAY,MAAM,CAAC;AAAA,IAC3E;AACA,iBAAa,KAAK,GAAG,SAAS,SAAS,SAAS,QAAQ,CAAC;AAAA,EAC3D;AAEA,QAAM,YAAY,QAAQ,MAAM;AAChC,QAAM,gBAAgB,QAAQ,IAAI,SAAY,OAAO,SAAS,oBAAoB;AAAA,IAChF;AAAA,IACA;AAAA,IACA,MAAM,MAAM;AAAA,IACZ,OAAO,MAAM;AAAA,IACb,QAAQ,MAAM;AAAA,IACd,UAAU,MAAM;AAAA,IAChB,SAAS,OAAO;AAAA,EAClB,CAAC;AACD,SAAO;AAAA,IACL,SAAS;AAAA,IACT,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,YACA,EAAE,YAAQ,oBAAO,MAAM,mBAAmB,UAAU,WAAW,MAAM,OAAO,KAAK,EAAE,IACnF,CAAC;AAAA,IACL,GAAI,kBAAkB,SAAY,CAAC,IAAI,EAAE,QAAQ,cAAc;AAAA,EACjE;AACF,CAAC;AAEH,MAAM,OAAO,CACX,UAEA,qBAAO,IAAI,aAAY;AACrB,QAAM,aAAa,OAAO,WAAW;AACrC,QAAM,OAAO,OAAO,KAAK;AACzB,QAAM,kBAAkB,CAAC,UAAkB,aACzC,SAAS,gBAAgB,CAAC,MAAM,OAAO,GAAG,UAAU,QAAQ;AAC9D,QAAM,SAAS,OAAO,KAAK,MAAM,YAAY,MAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU,eAAe;AAC5G,QAAM,WAAW,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,MAAM,CAAC,MAAM,OAAO,CAAC;AACxF,QAAM,WAAW,CAAC,GAAG,QAAQ,EAAE,KAAK;AACpC,QAAM,QAAQ,SAAS,MAAM,GAAG,MAAM,KAAK;AAC3C,QAAM,gBAAgB,SAAS,SAAS,IAAI,SAAY,OAAO,SAAS,oBAAoB;AAAA,IAC1F;AAAA,IACA;AAAA,IACA,MAAM,MAAM;AAAA,IACZ,OAAO,CAAC,MAAM,OAAO;AAAA,IACrB,QAAQ,MAAM;AAAA,IACd,UAAU,MAAM;AAAA,IAChB,SAAS,OAAO;AAAA,EAClB,CAAC;AACD,SAAO;AAAA,IACL;AAAA,IACA,OAAO,SAAS;AAAA,IAChB,WAAW,SAAS,SAAS,MAAM;AAAA,IACnC,GAAI,SAAS,SAAS,MAAM,QAAQ,EAAE,YAAQ,oBAAO,WAAW,MAAM,QAAQ,SAAS,MAAM,EAAE,IAAI,CAAC;AAAA,IACpG,GAAI,kBAAkB,SAAY,CAAC,IAAI,EAAE,QAAQ,cAAc;AAAA,EACjE;AACF,CAAC;AAYI,MAAM,WAAW,CACtB,UAEA,qBAAO,IAAI,aAAY;AACrB,QAAM,aAAa,OAAO,WAAW;AACrC,QAAM,OAAO,OAAO,KAAK;AACzB,QAAM,SAAS,OAAO,KAAK,MAAM,YAAY,MAAM,MAAM,MAAM,MAAM,QAAQ,MAAM,QAAQ;AAC3F,SAAO,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,MAAM,MAAM,KAAK;AAC5E,CAAC;AAQI,MAAM,OAAO,CAAC,aACnB,OAAO,KAAK;AAAA,EACV,MAAM,CAAC,UAAU,qBAAO,QAAQ,KAAK,KAAK,GAAG,QAAQ;AAAA,EACrD,MAAM,CAAC,UAAU,qBAAO,QAAQ,KAAK,KAAK,GAAG,QAAQ;AACvD,CAAC;AAQI,MAAM,QAA8E,oBAAM;AAAA,EAC/F,OAAO;AAAA,EACP,qBAAO,IAAI,qBAAO,QAA2C,GAAG,IAAI;AACtE;",
+  "names": []
+}