@anvia/core 1.0.2 → 1.0.3

package/README.md

@@ -538,6 +538,32 @@ slice. PDF pages are one-based, and the parser task is disposed before extractio
 If parsing or abort handling fails together with parser cleanup, extraction rejects with an
 `AggregateError` containing the operation failure first and the cleanup failure second.
 
+For the common vector ingestion path, embed and upsert raw text with one call:
+
+```ts
+import { ingestVectorText } from "@anvia/core/vector-store";
+
+await ingestVectorText({
+  store,
+  document: {
+    id: "incident-42",
+    text,
+    metadata: { tenant: "acme" },
+  },
+  embeddingModel,
+  chunking: {
+    strategy: "recursive",
+    maxSize: 1_000,
+    overlap: 100,
+    separators: ["\n\n", "\n", " "],
+  },
+});
+```
+
+`ingestVectorDocuments()` accepts the same document shape for batches. Without `chunking`, each
+source document is embedded as one chunk. Chunk embeddings remain grouped under the source document
+ID so re-ingestion replaces its complete vector representation instead of leaving stale chunks.
+
 ## Media
 
 Media helpers follow the same one-object API and share `providerOptions`, `retries`, and

package/dist/agent/index.js

@@ -2,14 +2,15 @@ import {
   Agent,
   createVectorContext,
   isVectorContext
-} from "../chunk-PH6OTIPZ.js";
+} from "../chunk-5TIXGU5U.js";
 import "../chunk-OJBFDBLG.js";
 import "../chunk-J6LVLV6P.js";
 import "../chunk-XMVOBX43.js";
 import "../chunk-AR2K73CJ.js";
 import "../chunk-YK4WAAS4.js";
-import "../chunk-EO2GECYH.js";
-import "../chunk-YFJ4NHV6.js";
+import "../chunk-OIB3URVG.js";
+import "../chunk-LZD36ZAP.js";
+import "../chunk-4EWTDOLR.js";
 import {
   AgentRunBlockedError,
   AgentRunCancelledError,

package/dist/chunk-4EWTDOLR.js

@@ -0,0 +1,412 @@
+// src/documents/chunk-text.ts
+function chunkText(options) {
+  const validated = validateOptions(options);
+  if (validated.text.length === 0) {
+    return [];
+  }
+  if (validated.strategy === "fixed") {
+    return chunkFixed(validated.text, validated.maxSize, validated.overlap);
+  }
+  const ranges = resolveRecursiveRanges(
+    validated.text,
+    { start: 0, end: validated.text.length },
+    validated.maxSize,
+    validated.separators
+  );
+  return applyRecursiveOverlap(validated.text, ranges, validated.maxSize, validated.overlap);
+}
+function validateOptions(options) {
+  if (typeof options !== "object" || options === null) {
+    throw new TypeError("chunkText options must be an object");
+  }
+  const value = options;
+  if (typeof value.text !== "string") {
+    throw new TypeError("chunkText text must be a string");
+  }
+  if (!Number.isSafeInteger(value.maxSize) || value.maxSize <= 0) {
+    throw new RangeError("chunkText maxSize must be a positive safe integer");
+  }
+  const maxSize = value.maxSize;
+  const overlap = value.overlap === void 0 ? 0 : value.overlap;
+  if (!Number.isSafeInteger(overlap) || overlap < 0 || overlap >= maxSize) {
+    throw new RangeError(
+      "chunkText overlap must be a non-negative safe integer smaller than maxSize"
+    );
+  }
+  if (value.strategy === "fixed") {
+    if ("separators" in value) {
+      throw new TypeError("chunkText fixed strategy does not accept separators");
+    }
+    return {
+      text: value.text,
+      strategy: "fixed",
+      maxSize,
+      overlap
+    };
+  }
+  if (value.strategy !== "recursive") {
+    throw new TypeError('chunkText strategy must be either "fixed" or "recursive"');
+  }
+  if (!Array.isArray(value.separators) || value.separators.length === 0) {
+    throw new TypeError("chunkText recursive separators must be a non-empty array");
+  }
+  const separators = value.separators;
+  const seen = /* @__PURE__ */ new Set();
+  for (const separator of separators) {
+    if (typeof separator !== "string" || separator.length === 0) {
+      throw new TypeError("chunkText recursive separators must contain non-empty strings");
+    }
+    if (seen.has(separator)) {
+      throw new TypeError("chunkText recursive separators must not contain duplicates");
+    }
+    seen.add(separator);
+  }
+  return {
+    text: value.text,
+    strategy: "recursive",
+    maxSize,
+    overlap,
+    separators
+  };
+}
+function chunkFixed(text, maxSize, overlap) {
+  const chunks = [];
+  let start = 0;
+  while (start < text.length) {
+    const end = Math.min(start + maxSize, text.length);
+    chunks.push(createChunk(text, chunks.length, start, end));
+    if (end === text.length) {
+      break;
+    }
+    start = end - overlap;
+  }
+  return chunks;
+}
+function resolveRecursiveRanges(text, initialRange, maxSize, separators) {
+  const resolved = [];
+  const pending = [
+    { range: initialRange, separatorIndex: 0 }
+  ];
+  while (pending.length > 0) {
+    const current = pending.pop();
+    if (current === void 0) {
+      break;
+    }
+    if (current.range.end - current.range.start <= maxSize) {
+      resolved.push(current.range);
+      continue;
+    }
+    let pieces;
+    let nextSeparatorIndex = separators.length;
+    for (let index = current.separatorIndex; index < separators.length; index += 1) {
+      const candidate = splitAfterSeparator(text, current.range, separators[index]);
+      if (candidate.length > 1) {
+        pieces = candidate;
+        nextSeparatorIndex = index + 1;
+        break;
+      }
+    }
+    if (pieces === void 0) {
+      resolved.push(...hardSplit(current.range, maxSize));
+      continue;
+    }
+    for (let index = pieces.length - 1; index >= 0; index -= 1) {
+      pending.push({ range: pieces[index], separatorIndex: nextSeparatorIndex });
+    }
+  }
+  return resolved;
+}
+function splitAfterSeparator(text, range, separator) {
+  const ranges = [];
+  let start = range.start;
+  let searchFrom = range.start;
+  while (searchFrom < range.end) {
+    const separatorStart = text.indexOf(separator, searchFrom);
+    if (separatorStart < 0 || separatorStart + separator.length > range.end) {
+      break;
+    }
+    const end = separatorStart + separator.length;
+    if (end > start) {
+      ranges.push({ start, end });
+    }
+    start = end;
+    searchFrom = end;
+  }
+  if (start < range.end) {
+    ranges.push({ start, end: range.end });
+  }
+  return ranges;
+}
+function hardSplit(range, maxSize) {
+  const ranges = [];
+  for (let start = range.start; start < range.end; start += maxSize) {
+    ranges.push({ start, end: Math.min(start + maxSize, range.end) });
+  }
+  return ranges;
+}
+function applyRecursiveOverlap(text, ranges, maxSize, overlap) {
+  const boundaries = ranges.map((range) => range.end);
+  const chunks = [];
+  let start = 0;
+  let previousEnd = 0;
+  while (start < text.length) {
+    const limit = Math.min(start + maxSize, text.length);
+    const boundary = findLastBoundaryAtMost(boundaries, limit);
+    const end = boundary !== void 0 && boundary > previousEnd ? boundary : limit;
+    chunks.push(createChunk(text, chunks.length, start, end));
+    if (end === text.length) {
+      break;
+    }
+    previousEnd = end;
+    start = Math.max(0, end - overlap);
+  }
+  return chunks;
+}
+function findLastBoundaryAtMost(boundaries, limit) {
+  let low = 0;
+  let high = boundaries.length;
+  while (low < high) {
+    const middle = low + Math.floor((high - low) / 2);
+    if (boundaries[middle] <= limit) {
+      low = middle + 1;
+    } else {
+      high = middle;
+    }
+  }
+  return boundaries[low - 1];
+}
+function createChunk(text, index, start, end) {
+  return { index, text: text.slice(start, end), start, end };
+}
+
+// src/documents/pdf.ts
+async function extractPdfText(options) {
+  if (typeof options !== "object" || options === null) {
+    throw new TypeError("extractPdfText options must be an object");
+  }
+  if (!(options.data instanceof Uint8Array)) {
+    throw new TypeError("extractPdfText data must be a Uint8Array");
+  }
+  if (options.abortSignal !== void 0 && !isAbortSignal(options.abortSignal)) {
+    throw new TypeError("extractPdfText abortSignal must be an AbortSignal");
+  }
+  const { abortSignal } = options;
+  abortSignal?.throwIfAborted();
+  const data = new Uint8Array(options.data);
+  const pdfjs = await loadPdfjs();
+  abortSignal?.throwIfAborted();
+  const loadingTask = pdfjs.getDocument({ data });
+  let destroyPromise;
+  const destroy = () => {
+    destroyPromise ??= loadingTask.destroy();
+    return destroyPromise;
+  };
+  const abort = createAbortPromise(abortSignal, destroy);
+  return runWithCleanup(
+    async () => {
+      const document = await abort.wait(loadingTask.promise);
+      const pages = [];
+      for (let pageNumber = 1; pageNumber <= document.numPages; pageNumber += 1) {
+        abortSignal?.throwIfAborted();
+        const page = await abort.wait(document.getPage(pageNumber));
+        const content = await abort.wait(page.getTextContent());
+        pages.push({ pageNumber, text: extractPageText(content.items) });
+      }
+      return { pages };
+    },
+    async () => {
+      abort.dispose();
+      await destroy();
+    }
+  );
+}
+async function loadPdfjs() {
+  try {
+    return await import("pdfjs-dist/legacy/build/pdf.mjs");
+  } catch (cause) {
+    if (!isMissingPdfjsDependency(cause)) {
+      throw cause;
+    }
+    throw new Error(
+      'PDF extraction requires the optional "pdfjs-dist" package. Install it in your application to use extractPdfText().',
+      { cause }
+    );
+  }
+}
+function isMissingPdfjsDependency(error) {
+  const seen = /* @__PURE__ */ new Set();
+  let current = error;
+  while (current instanceof Error && !seen.has(current)) {
+    seen.add(current);
+    if (current.message.includes("pdfjs-dist") && "code" in current && current.code === "ERR_MODULE_NOT_FOUND") {
+      return true;
+    }
+    current = "cause" in current ? current.cause : void 0;
+  }
+  return false;
+}
+async function runWithCleanup(operation, cleanup) {
+  let outcome;
+  try {
+    outcome = { ok: true, value: await operation() };
+  } catch (error) {
+    outcome = { ok: false, error };
+  }
+  let cleanupError;
+  let cleanupFailed = false;
+  try {
+    await cleanup();
+  } catch (error) {
+    cleanupFailed = true;
+    cleanupError = error;
+  }
+  if (!outcome.ok) {
+    if (cleanupFailed) {
+      throw new AggregateError(
+        [outcome.error, cleanupError],
+        "PDF extraction and cleanup both failed",
+        { cause: outcome.error }
+      );
+    }
+    throw outcome.error;
+  }
+  if (cleanupFailed) {
+    throw cleanupError;
+  }
+  return outcome.value;
+}
+function isAbortSignal(value) {
+  if (typeof value !== "object" || value === null) {
+    return false;
+  }
+  const candidate = value;
+  return typeof candidate.aborted === "boolean" && typeof candidate.addEventListener === "function" && typeof candidate.removeEventListener === "function" && typeof candidate.throwIfAborted === "function";
+}
+function extractPageText(items) {
+  let text = "";
+  for (const item of items) {
+    if (typeof item !== "object" || item === null) {
+      throw new TypeError("PDF text content contains a malformed item");
+    }
+    if (!("str" in item)) {
+      if ("type" in item && (item.type === "beginMarkedContent" || item.type === "beginMarkedContentProps" || item.type === "endMarkedContent")) {
+        continue;
+      }
+      throw new TypeError("PDF text content contains an unknown non-text item");
+    }
+    if (typeof item.str !== "string") {
+      throw new TypeError("PDF text content item str must be a string");
+    }
+    if (!("hasEOL" in item) || typeof item.hasEOL !== "boolean") {
+      throw new TypeError("PDF text content item hasEOL must be a boolean");
+    }
+    text += item.str;
+    if (item.hasEOL) {
+      text += "\n";
+    }
+  }
+  return text;
+}
+function createAbortPromise(abortSignal, destroy) {
+  if (abortSignal === void 0) {
+    return {
+      wait: (promise) => promise,
+      dispose: () => void 0
+    };
+  }
+  let rejectAbort;
+  const aborted = new Promise((_resolve, reject) => {
+    rejectAbort = reject;
+  });
+  const onAbort = () => {
+    void destroy();
+    rejectAbort?.(
+      abortSignal.reason ?? new DOMException("The operation was aborted", "AbortError")
+    );
+  };
+  abortSignal.addEventListener("abort", onAbort, { once: true });
+  if (abortSignal.aborted) {
+    onAbort();
+  }
+  return {
+    wait: (promise) => Promise.race([promise, aborted]),
+    dispose: () => abortSignal.removeEventListener("abort", onAbort)
+  };
+}
+
+// src/documents/text-document.ts
+function chunkTextDocuments(options) {
+  if (typeof options !== "object" || options === null) {
+    throw new TypeError("chunkTextDocuments options must contain a documents array");
+  }
+  const documents = options.documents;
+  if (!Array.isArray(documents)) {
+    throw new TypeError("chunkTextDocuments options must contain a documents array");
+  }
+  const ids = /* @__PURE__ */ new Set();
+  const chunks = [];
+  for (const document of documents) {
+    validateDocument(document, ids);
+    chunks.push(...chunkDocument(document, options.chunking));
+  }
+  return chunks;
+}
+function validateDocument(document, ids) {
+  if (typeof document !== "object" || document === null) {
+    throw new TypeError("Text documents must be objects");
+  }
+  if (typeof document.id !== "string" || document.id.length === 0) {
+    throw new TypeError("Text document ids must be non-empty strings");
+  }
+  if (ids.has(document.id)) {
+    throw new TypeError(`Duplicate text document id: ${document.id}`);
+  }
+  if (typeof document.text !== "string" || document.text.length === 0) {
+    throw new TypeError(`Text document ${document.id} must contain non-empty text`);
+  }
+  ids.add(document.id);
+}
+function chunkDocument(document, chunking) {
+  if (chunking === void 0 || chunking.strategy === "none") {
+    return [createDocumentChunk(document, 0, document.text)];
+  }
+  const textChunks = chunkDocumentText(document.text, chunking);
+  return textChunks.map((chunk) => createDocumentChunk(document, chunk.index, chunk.text));
+}
+function chunkDocumentText(text, chunking) {
+  const overlap = chunking.overlap ?? 0;
+  if (chunking.strategy === "fixed") {
+    return chunkText({
+      text,
+      strategy: "fixed",
+      maxSize: chunking.maxSize,
+      overlap
+    });
+  }
+  return chunkText({
+    text,
+    strategy: "recursive",
+    maxSize: chunking.maxSize,
+    overlap,
+    separators: chunking.separators
+  });
+}
+function createDocumentChunk(document, index, text) {
+  const chunk = {
+    id: `${document.id}:chunk:${index}`,
+    documentId: document.id,
+    index,
+    text
+  };
+  if (document.metadata === void 0) {
+    return chunk;
+  }
+  return { ...chunk, metadata: document.metadata };
+}
+
+export {
+  chunkText,
+  extractPdfText,
+  chunkTextDocuments
+};
+//# sourceMappingURL=chunk-4EWTDOLR.js.map

package/dist/chunk-4EWTDOLR.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/documents/chunk-text.ts","../src/documents/pdf.ts","../src/documents/text-document.ts"],"sourcesContent":["export type TextChunk = Readonly<{\n  index: number;\n  text: string;\n  start: number;\n  end: number;\n}>;\n\nexport type ChunkTextOptions =\n  | Readonly<{\n      text: string;\n      strategy: \"fixed\";\n      maxSize: number;\n      overlap?: number;\n    }>\n  | Readonly<{\n      text: string;\n      strategy: \"recursive\";\n      maxSize: number;\n      overlap?: number;\n      separators: readonly string[];\n    }>;\n\ntype TextRange = Readonly<{\n  start: number;\n  end: number;\n}>;\n\nexport function chunkText(options: ChunkTextOptions): readonly TextChunk[] {\n  const validated = validateOptions(options);\n  if (validated.text.length === 0) {\n    return [];\n  }\n\n  if (validated.strategy === \"fixed\") {\n    return chunkFixed(validated.text, validated.maxSize, validated.overlap);\n  }\n\n  const ranges = resolveRecursiveRanges(\n    validated.text,\n    { start: 0, end: validated.text.length },\n    validated.maxSize,\n    validated.separators,\n  );\n  return applyRecursiveOverlap(validated.text, ranges, validated.maxSize, validated.overlap);\n}\n\nfunction validateOptions(options: ChunkTextOptions):\n  | Readonly<{\n      text: string;\n      strategy: \"fixed\";\n      maxSize: number;\n      overlap: number;\n    }>\n  | Readonly<{\n      text: string;\n      strategy: \"recursive\";\n      maxSize: number;\n      overlap: number;\n      separators: readonly string[];\n    }> {\n  if (typeof options !== \"object\" || options === null) {\n    throw new TypeError(\"chunkText options must be an object\");\n  }\n\n  const value = options as unknown as Record<string, unknown>;\n  if (typeof value.text !== \"string\") {\n    throw new TypeError(\"chunkText text must be a string\");\n  }\n  if (!Number.isSafeInteger(value.maxSize) || (value.maxSize as number) <= 0) {\n    throw new RangeError(\"chunkText maxSize must be a positive safe integer\");\n  }\n\n  const maxSize = value.maxSize as number;\n  const overlap = value.overlap === undefined ? 0 : value.overlap;\n  if (!Number.isSafeInteger(overlap) || (overlap as number) < 0 || (overlap as number) >= maxSize) {\n    throw new RangeError(\n      \"chunkText overlap must be a non-negative safe integer smaller than maxSize\",\n    );\n  }\n\n  if (value.strategy === \"fixed\") {\n    if (\"separators\" in value) {\n      throw new TypeError(\"chunkText fixed strategy does not accept separators\");\n    }\n    return {\n      text: value.text,\n      strategy: \"fixed\",\n      maxSize,\n      overlap: overlap as number,\n    };\n  }\n\n  if (value.strategy !== \"recursive\") {\n    throw new TypeError('chunkText strategy must be either \"fixed\" or \"recursive\"');\n  }\n  if (!Array.isArray(value.separators) || value.separators.length === 0) {\n    throw new TypeError(\"chunkText recursive separators must be a non-empty array\");\n  }\n\n  const separators = value.separators as unknown[];\n  const seen = new Set<string>();\n  for (const separator of separators) {\n    if (typeof separator !== \"string\" || separator.length === 0) {\n      throw new TypeError(\"chunkText recursive separators must contain non-empty strings\");\n    }\n    if (seen.has(separator)) {\n      throw new TypeError(\"chunkText recursive separators must not contain duplicates\");\n    }\n    seen.add(separator);\n  }\n\n  return {\n    text: value.text,\n    strategy: \"recursive\",\n    maxSize,\n    overlap: overlap as number,\n    separators: separators as string[],\n  };\n}\n\nfunction chunkFixed(text: string, maxSize: number, overlap: number): readonly TextChunk[] {\n  const chunks: TextChunk[] = [];\n  let start = 0;\n\n  while (start < text.length) {\n    const end = Math.min(start + maxSize, text.length);\n    chunks.push(createChunk(text, chunks.length, start, end));\n    if (end === text.length) {\n      break;\n    }\n    start = end - overlap;\n  }\n\n  return chunks;\n}\n\nfunction resolveRecursiveRanges(\n  text: string,\n  initialRange: TextRange,\n  maxSize: number,\n  separators: readonly string[],\n): readonly TextRange[] {\n  const resolved: TextRange[] = [];\n  const pending: Array<Readonly<{ range: TextRange; separatorIndex: number }>> = [\n    { range: initialRange, separatorIndex: 0 },\n  ];\n\n  while (pending.length > 0) {\n    const current = pending.pop();\n    if (current === undefined) {\n      break;\n    }\n    if (current.range.end - current.range.start <= maxSize) {\n      resolved.push(current.range);\n      continue;\n    }\n\n    let pieces: readonly TextRange[] | undefined;\n    let nextSeparatorIndex = separators.length;\n    for (let index = current.separatorIndex; index < separators.length; index += 1) {\n      const candidate = splitAfterSeparator(text, current.range, separators[index] as string);\n      if (candidate.length > 1) {\n        pieces = candidate;\n        nextSeparatorIndex = index + 1;\n        break;\n      }\n    }\n\n    if (pieces === undefined) {\n      resolved.push(...hardSplit(current.range, maxSize));\n      continue;\n    }\n\n    for (let index = pieces.length - 1; index >= 0; index -= 1) {\n      pending.push({ range: pieces[index] as TextRange, separatorIndex: nextSeparatorIndex });\n    }\n  }\n\n  return resolved;\n}\n\nfunction splitAfterSeparator(text: string, range: TextRange, separator: string): TextRange[] {\n  const ranges: TextRange[] = [];\n  let start = range.start;\n  let searchFrom = range.start;\n\n  while (searchFrom < range.end) {\n    const separatorStart = text.indexOf(separator, searchFrom);\n    if (separatorStart < 0 || separatorStart + separator.length > range.end) {\n      break;\n    }\n    const end = separatorStart + separator.length;\n    if (end > start) {\n      ranges.push({ start, end });\n    }\n    start = end;\n    searchFrom = end;\n  }\n\n  if (start < range.end) {\n    ranges.push({ start, end: range.end });\n  }\n  return ranges;\n}\n\nfunction hardSplit(range: TextRange, maxSize: number): readonly TextRange[] {\n  const ranges: TextRange[] = [];\n  for (let start = range.start; start < range.end; start += maxSize) {\n    ranges.push({ start, end: Math.min(start + maxSize, range.end) });\n  }\n  return ranges;\n}\n\nfunction applyRecursiveOverlap(\n  text: string,\n  ranges: readonly TextRange[],\n  maxSize: number,\n  overlap: number,\n): readonly TextChunk[] {\n  const boundaries = ranges.map((range) => range.end);\n  const chunks: TextChunk[] = [];\n  let start = 0;\n  let previousEnd = 0;\n\n  while (start < text.length) {\n    const limit = Math.min(start + maxSize, text.length);\n    const boundary = findLastBoundaryAtMost(boundaries, limit);\n    const end = boundary !== undefined && boundary > previousEnd ? boundary : limit;\n\n    chunks.push(createChunk(text, chunks.length, start, end));\n    if (end === text.length) {\n      break;\n    }\n    previousEnd = end;\n    start = Math.max(0, end - overlap);\n  }\n\n  return chunks;\n}\n\nfunction findLastBoundaryAtMost(boundaries: readonly number[], limit: number): number | undefined {\n  let low = 0;\n  let high = boundaries.length;\n  while (low < high) {\n    const middle = low + Math.floor((high - low) / 2);\n    if ((boundaries[middle] as number) <= limit) {\n      low = middle + 1;\n    } else {\n      high = middle;\n    }\n  }\n  return boundaries[low - 1];\n}\n\nfunction createChunk(text: string, index: number, start: number, end: number): TextChunk {\n  return { index, text: text.slice(start, end), start, end };\n}\n","export type PdfTextPage = Readonly<{\n  pageNumber: number;\n  text: string;\n}>;\n\nexport type ExtractPdfTextOptions = Readonly<{\n  data: Uint8Array;\n  abortSignal?: AbortSignal;\n}>;\n\nexport type ExtractPdfTextResult = Readonly<{\n  pages: readonly PdfTextPage[];\n}>;\n\nexport async function extractPdfText(\n  options: ExtractPdfTextOptions,\n): Promise<ExtractPdfTextResult> {\n  if (typeof options !== \"object\" || options === null) {\n    throw new TypeError(\"extractPdfText options must be an object\");\n  }\n  if (!(options.data instanceof Uint8Array)) {\n    throw new TypeError(\"extractPdfText data must be a Uint8Array\");\n  }\n  if (options.abortSignal !== undefined && !isAbortSignal(options.abortSignal)) {\n    throw new TypeError(\"extractPdfText abortSignal must be an AbortSignal\");\n  }\n\n  const { abortSignal } = options;\n  abortSignal?.throwIfAborted();\n  const data = new Uint8Array(options.data);\n  const pdfjs = await loadPdfjs();\n  abortSignal?.throwIfAborted();\n\n  const loadingTask = pdfjs.getDocument({ data });\n  let destroyPromise: Promise<void> | undefined;\n  const destroy = (): Promise<void> => {\n    destroyPromise ??= loadingTask.destroy();\n    return destroyPromise;\n  };\n  const abort = createAbortPromise(abortSignal, destroy);\n\n  return runWithCleanup(\n    async () => {\n      const document = await abort.wait(loadingTask.promise);\n      const pages: PdfTextPage[] = [];\n      for (let pageNumber = 1; pageNumber <= document.numPages; pageNumber += 1) {\n        abortSignal?.throwIfAborted();\n        const page = await abort.wait(document.getPage(pageNumber));\n        const content = await abort.wait(page.getTextContent());\n        pages.push({ pageNumber, text: extractPageText(content.items) });\n      }\n      return { pages };\n    },\n    async () => {\n      abort.dispose();\n      await destroy();\n    },\n  );\n}\n\nasync function loadPdfjs(): Promise<typeof import(\"pdfjs-dist/legacy/build/pdf.mjs\")> {\n  try {\n    return await import(\"pdfjs-dist/legacy/build/pdf.mjs\");\n  } catch (cause) {\n    if (!isMissingPdfjsDependency(cause)) {\n      throw cause;\n    }\n    throw new Error(\n      'PDF extraction requires the optional \"pdfjs-dist\" package. Install it in your application to use extractPdfText().',\n      { cause },\n    );\n  }\n}\n\nfunction isMissingPdfjsDependency(error: unknown): boolean {\n  const seen = new Set<unknown>();\n  let current = error;\n  while (current instanceof Error && !seen.has(current)) {\n    seen.add(current);\n    if (\n      current.message.includes(\"pdfjs-dist\") &&\n      \"code\" in current &&\n      current.code === \"ERR_MODULE_NOT_FOUND\"\n    ) {\n      return true;\n    }\n    current = \"cause\" in current ? current.cause : undefined;\n  }\n  return false;\n}\n\nasync function runWithCleanup<Result>(\n  operation: () => Promise<Result>,\n  cleanup: () => Promise<void>,\n): Promise<Result> {\n  let outcome: { ok: true; value: Result } | { ok: false; error: unknown };\n  try {\n    outcome = { ok: true, value: await operation() };\n  } catch (error) {\n    outcome = { ok: false, error };\n  }\n\n  let cleanupError: unknown;\n  let cleanupFailed = false;\n  try {\n    await cleanup();\n  } catch (error) {\n    cleanupFailed = true;\n    cleanupError = error;\n  }\n\n  if (!outcome.ok) {\n    if (cleanupFailed) {\n      throw new AggregateError(\n        [outcome.error, cleanupError],\n        \"PDF extraction and cleanup both failed\",\n        { cause: outcome.error },\n      );\n    }\n    throw outcome.error;\n  }\n  if (cleanupFailed) {\n    throw cleanupError;\n  }\n  return outcome.value;\n}\n\nfunction isAbortSignal(value: unknown): value is AbortSignal {\n  if (typeof value !== \"object\" || value === null) {\n    return false;\n  }\n  const candidate = value as Partial<AbortSignal>;\n  return (\n    typeof candidate.aborted === \"boolean\" &&\n    typeof candidate.addEventListener === \"function\" &&\n    typeof candidate.removeEventListener === \"function\" &&\n    typeof candidate.throwIfAborted === \"function\"\n  );\n}\n\nfunction extractPageText(items: readonly unknown[]): string {\n  let text = \"\";\n  for (const item of items) {\n    if (typeof item !== \"object\" || item === null) {\n      throw new TypeError(\"PDF text content contains a malformed item\");\n    }\n    if (!(\"str\" in item)) {\n      if (\n        \"type\" in item &&\n        (item.type === \"beginMarkedContent\" ||\n          item.type === \"beginMarkedContentProps\" ||\n          item.type === \"endMarkedContent\")\n      ) {\n        continue;\n      }\n      throw new TypeError(\"PDF text content contains an unknown non-text item\");\n    }\n    if (typeof item.str !== \"string\") {\n      throw new TypeError(\"PDF text content item str must be a string\");\n    }\n    if (!(\"hasEOL\" in item) || typeof item.hasEOL !== \"boolean\") {\n      throw new TypeError(\"PDF text content item hasEOL must be a boolean\");\n    }\n    text += item.str;\n    if (item.hasEOL) {\n      text += \"\\n\";\n    }\n  }\n  return text;\n}\n\nfunction createAbortPromise(\n  abortSignal: AbortSignal | undefined,\n  destroy: () => Promise<void>,\n): {\n  wait<T>(promise: Promise<T>): Promise<T>;\n  dispose(): void;\n} {\n  if (abortSignal === undefined) {\n    return {\n      wait: (promise) => promise,\n      dispose: () => undefined,\n    };\n  }\n\n  let rejectAbort: ((reason?: unknown) => void) | undefined;\n  const aborted = new Promise<never>((_resolve, reject) => {\n    rejectAbort = reject;\n  });\n  const onAbort = () => {\n    void destroy();\n    rejectAbort?.(\n      abortSignal.reason ?? new DOMException(\"The operation was aborted\", \"AbortError\"),\n    );\n  };\n  abortSignal.addEventListener(\"abort\", onAbort, { once: true });\n  if (abortSignal.aborted) {\n    onAbort();\n  }\n\n  return {\n    wait: (promise) => Promise.race([promise, aborted]),\n    dispose: () => abortSignal.removeEventListener(\"abort\", onAbort),\n  };\n}\n","import { chunkText } from \"./chunk-text\";\n\nexport type TextDocumentMetadata = Record<string, string | number | boolean>;\n\nexport type TextDocument<Metadata = TextDocumentMetadata> = Readonly<{\n  id: string;\n  text: string;\n  metadata?: Metadata | undefined;\n}>;\n\nexport type TextDocumentChunk<Metadata = TextDocumentMetadata> = Readonly<{\n  id: string;\n  documentId: string;\n  index: number;\n  text: string;\n  metadata?: Metadata | undefined;\n}>;\n\nexport type TextDocumentChunkingOptions =\n  | Readonly<{ strategy: \"none\" }>\n  | Readonly<{\n      strategy: \"fixed\";\n      maxSize: number;\n      overlap?: number | undefined;\n    }>\n  | Readonly<{\n      strategy: \"recursive\";\n      maxSize: number;\n      overlap?: number | undefined;\n      separators: readonly string[];\n    }>;\n\nexport type ChunkTextDocumentsOptions<Metadata = TextDocumentMetadata> = Readonly<{\n  documents: readonly TextDocument<Metadata>[];\n  chunking?: TextDocumentChunkingOptions | undefined;\n}>;\n\nexport function chunkTextDocuments<Metadata>(\n  options: ChunkTextDocumentsOptions<Metadata>,\n): readonly TextDocumentChunk<Metadata>[] {\n  if (typeof options !== \"object\" || options === null) {\n    throw new TypeError(\"chunkTextDocuments options must contain a documents array\");\n  }\n  const documents = options.documents;\n  if (!Array.isArray(documents)) {\n    throw new TypeError(\"chunkTextDocuments options must contain a documents array\");\n  }\n\n  const ids = new Set<string>();\n  const chunks: TextDocumentChunk<Metadata>[] = [];\n  for (const document of documents as readonly TextDocument<Metadata>[]) {\n    validateDocument(document, ids);\n    chunks.push(...chunkDocument(document, options.chunking));\n  }\n  return chunks;\n}\n\nfunction validateDocument<Metadata>(document: TextDocument<Metadata>, ids: Set<string>): void {\n  if (typeof document !== \"object\" || document === null) {\n    throw new TypeError(\"Text documents must be objects\");\n  }\n  if (typeof document.id !== \"string\" || document.id.length === 0) {\n    throw new TypeError(\"Text document ids must be non-empty strings\");\n  }\n  if (ids.has(document.id)) {\n    throw new TypeError(`Duplicate text document id: ${document.id}`);\n  }\n  if (typeof document.text !== \"string\" || document.text.length === 0) {\n    throw new TypeError(`Text document ${document.id} must contain non-empty text`);\n  }\n  ids.add(document.id);\n}\n\nfunction chunkDocument<Metadata>(\n  document: TextDocument<Metadata>,\n  chunking: TextDocumentChunkingOptions | undefined,\n): readonly TextDocumentChunk<Metadata>[] {\n  if (chunking === undefined || chunking.strategy === \"none\") {\n    return [createDocumentChunk(document, 0, document.text)];\n  }\n\n  const textChunks = chunkDocumentText(document.text, chunking);\n  return textChunks.map((chunk) => createDocumentChunk(document, chunk.index, chunk.text));\n}\n\nfunction chunkDocumentText(\n  text: string,\n  chunking: Exclude<TextDocumentChunkingOptions, Readonly<{ strategy: \"none\" }>>,\n) {\n  const overlap = chunking.overlap ?? 0;\n  if (chunking.strategy === \"fixed\") {\n    return chunkText({\n      text,\n      strategy: \"fixed\",\n      maxSize: chunking.maxSize,\n      overlap,\n    });\n  }\n  return chunkText({\n    text,\n    strategy: \"recursive\",\n    maxSize: chunking.maxSize,\n    overlap,\n    separators: chunking.separators,\n  });\n}\n\nfunction createDocumentChunk<Metadata>(\n  document: TextDocument<Metadata>,\n  index: number,\n  text: string,\n): TextDocumentChunk<Metadata> {\n  const chunk = {\n    id: `${document.id}:chunk:${index}`,\n    documentId: document.id,\n    index,\n    text,\n  };\n  if (document.metadata === undefined) {\n    return chunk;\n  }\n  return { ...chunk, metadata: document.metadata };\n}\n"],"mappings":";AA2BO,SAAS,UAAU,SAAiD;AACzE,QAAM,YAAY,gBAAgB,OAAO;AACzC,MAAI,UAAU,KAAK,WAAW,GAAG;AAC/B,WAAO,CAAC;AAAA,EACV;AAEA,MAAI,UAAU,aAAa,SAAS;AAClC,WAAO,WAAW,UAAU,MAAM,UAAU,SAAS,UAAU,OAAO;AAAA,EACxE;AAEA,QAAM,SAAS;AAAA,IACb,UAAU;AAAA,IACV,EAAE,OAAO,GAAG,KAAK,UAAU,KAAK,OAAO;AAAA,IACvC,UAAU;AAAA,IACV,UAAU;AAAA,EACZ;AACA,SAAO,sBAAsB,UAAU,MAAM,QAAQ,UAAU,SAAS,UAAU,OAAO;AAC3F;AAEA,SAAS,gBAAgB,SAalB;AACL,MAAI,OAAO,YAAY,YAAY,YAAY,MAAM;AACnD,UAAM,IAAI,UAAU,qCAAqC;AAAA,EAC3D;AAEA,QAAM,QAAQ;AACd,MAAI,OAAO,MAAM,SAAS,UAAU;AAClC,UAAM,IAAI,UAAU,iCAAiC;AAAA,EACvD;AACA,MAAI,CAAC,OAAO,cAAc,MAAM,OAAO,KAAM,MAAM,WAAsB,GAAG;AAC1E,UAAM,IAAI,WAAW,mDAAmD;AAAA,EAC1E;AAEA,QAAM,UAAU,MAAM;AACtB,QAAM,UAAU,MAAM,YAAY,SAAY,IAAI,MAAM;AACxD,MAAI,CAAC,OAAO,cAAc,OAAO,KAAM,UAAqB,KAAM,WAAsB,SAAS;AAC/F,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,aAAa,SAAS;AAC9B,QAAI,gBAAgB,OAAO;AACzB,YAAM,IAAI,UAAU,qDAAqD;AAAA,IAC3E;AACA,WAAO;AAAA,MACL,MAAM,MAAM;AAAA,MACZ,UAAU;AAAA,MACV;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,aAAa,aAAa;AAClC,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAChF;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,UAAU,KAAK,MAAM,WAAW,WAAW,GAAG;AACrE,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAChF;AAEA,QAAM,aAAa,MAAM;AACzB,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,aAAa,YAAY;AAClC,QAAI,OAAO,cAAc,YAAY,UAAU,WAAW,GAAG;AAC3D,YAAM,IAAI,UAAU,+DAA+D;AAAA,IACrF;AACA,QAAI,KAAK,IAAI,SAAS,GAAG;AACvB,YAAM,IAAI,UAAU,4DAA4D;AAAA,IAClF;AACA,SAAK,IAAI,SAAS;AAAA,EACpB;AAEA,SAAO;AAAA,IACL,MAAM,MAAM;AAAA,IACZ,UAAU;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,WAAW,MAAc,SAAiB,SAAuC;AACxF,QAAM,SAAsB,CAAC;AAC7B,MAAI,QAAQ;AAEZ,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,MAAM,KAAK,IAAI,QAAQ,SAAS,KAAK,MAAM;AACjD,WAAO,KAAK,YAAY,MAAM,OAAO,QAAQ,OAAO,GAAG,CAAC;AACxD,QAAI,QAAQ,KAAK,QAAQ;AACvB;AAAA,IACF;AACA,YAAQ,MAAM;AAAA,EAChB;AAEA,SAAO;AACT;AAEA,SAAS,uBACP,MACA,cACA,SACA,YACsB;AACtB,QAAM,WAAwB,CAAC;AAC/B,QAAM,UAAyE;AAAA,IAC7E,EAAE,OAAO,cAAc,gBAAgB,EAAE;AAAA,EAC3C;AAEA,SAAO,QAAQ,SAAS,GAAG;AACzB,UAAM,UAAU,QAAQ,IAAI;AAC5B,QAAI,YAAY,QAAW;AACzB;AAAA,IACF;AACA,QAAI,QAAQ,MAAM,MAAM,QAAQ,MAAM,SAAS,SAAS;AACtD,eAAS,KAAK,QAAQ,KAAK;AAC3B;AAAA,IACF;AAEA,QAAI;AACJ,QAAI,qBAAqB,WAAW;AACpC,aAAS,QAAQ,QAAQ,gBAAgB,QAAQ,WAAW,QAAQ,SAAS,GAAG;AAC9E,YAAM,YAAY,oBAAoB,MAAM,QAAQ,OAAO,WAAW,KAAK,CAAW;AACtF,UAAI,UAAU,SAAS,GAAG;AACxB,iBAAS;AACT,6BAAqB,QAAQ;AAC7B;AAAA,MACF;AAAA,IACF;AAEA,QAAI,WAAW,QAAW;AACxB,eAAS,KAAK,GAAG,UAAU,QAAQ,OAAO,OAAO,CAAC;AAClD;AAAA,IACF;AAEA,aAAS,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC1D,cAAQ,KAAK,EAAE,OAAO,OAAO,KAAK,GAAgB,gBAAgB,mBAAmB,CAAC;AAAA,IACxF;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,oBAAoB,MAAc,OAAkB,WAAgC;AAC3F,QAAM,SAAsB,CAAC;AAC7B,MAAI,QAAQ,MAAM;AAClB,MAAI,aAAa,MAAM;AAEvB,SAAO,aAAa,MAAM,KAAK;AAC7B,UAAM,iBAAiB,KAAK,QAAQ,WAAW,UAAU;AACzD,QAAI,iBAAiB,KAAK,iBAAiB,UAAU,SAAS,MAAM,KAAK;AACvE;AAAA,IACF;AACA,UAAM,MAAM,iBAAiB,UAAU;AACvC,QAAI,MAAM,OAAO;AACf,aAAO,KAAK,EAAE,OAAO,IAAI,CAAC;AAAA,IAC5B;AACA,YAAQ;AACR,iBAAa;AAAA,EACf;AAEA,MAAI,QAAQ,MAAM,KAAK;AACrB,WAAO,KAAK,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,EACvC;AACA,SAAO;AACT;AAEA,SAAS,UAAU,OAAkB,SAAuC;AAC1E,QAAM,SAAsB,CAAC;AAC7B,WAAS,QAAQ,MAAM,OAAO,QAAQ,MAAM,KAAK,SAAS,SAAS;AACjE,WAAO,KAAK,EAAE,OAAO,KAAK,KAAK,IAAI,QAAQ,SAAS,MAAM,GAAG,EAAE,CAAC;AAAA,EAClE;AACA,SAAO;AACT;AAEA,SAAS,sBACP,MACA,QACA,SACA,SACsB;AACtB,QAAM,aAAa,OAAO,IAAI,CAAC,UAAU,MAAM,GAAG;AAClD,QAAM,SAAsB,CAAC;AAC7B,MAAI,QAAQ;AACZ,MAAI,cAAc;AAElB,SAAO,QAAQ,KAAK,QAAQ;AAC1B,UAAM,QAAQ,KAAK,IAAI,QAAQ,SAAS,KAAK,MAAM;AACnD,UAAM,WAAW,uBAAuB,YAAY,KAAK;AACzD,UAAM,MAAM,aAAa,UAAa,WAAW,cAAc,WAAW;AAE1E,WAAO,KAAK,YAAY,MAAM,OAAO,QAAQ,OAAO,GAAG,CAAC;AACxD,QAAI,QAAQ,KAAK,QAAQ;AACvB;AAAA,IACF;AACA,kBAAc;AACd,YAAQ,KAAK,IAAI,GAAG,MAAM,OAAO;AAAA,EACnC;AAEA,SAAO;AACT;AAEA,SAAS,uBAAuB,YAA+B,OAAmC;AAChG,MAAI,MAAM;AACV,MAAI,OAAO,WAAW;AACtB,SAAO,MAAM,MAAM;AACjB,UAAM,SAAS,MAAM,KAAK,OAAO,OAAO,OAAO,CAAC;AAChD,QAAK,WAAW,MAAM,KAAgB,OAAO;AAC3C,YAAM,SAAS;AAAA,IACjB,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,WAAW,MAAM,CAAC;AAC3B;AAEA,SAAS,YAAY,MAAc,OAAe,OAAe,KAAwB;AACvF,SAAO,EAAE,OAAO,MAAM,KAAK,MAAM,OAAO,GAAG,GAAG,OAAO,IAAI;AAC3D;;;AClPA,eAAsB,eACpB,SAC+B;AAC/B,MAAI,OAAO,YAAY,YAAY,YAAY,MAAM;AACnD,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAChE;AACA,MAAI,EAAE,QAAQ,gBAAgB,aAAa;AACzC,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAChE;AACA,MAAI,QAAQ,gBAAgB,UAAa,CAAC,cAAc,QAAQ,WAAW,GAAG;AAC5E,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACzE;AAEA,QAAM,EAAE,YAAY,IAAI;AACxB,eAAa,eAAe;AAC5B,QAAM,OAAO,IAAI,WAAW,QAAQ,IAAI;AACxC,QAAM,QAAQ,MAAM,UAAU;AAC9B,eAAa,eAAe;AAE5B,QAAM,cAAc,MAAM,YAAY,EAAE,KAAK,CAAC;AAC9C,MAAI;AACJ,QAAM,UAAU,MAAqB;AACnC,uBAAmB,YAAY,QAAQ;AACvC,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,mBAAmB,aAAa,OAAO;AAErD,SAAO;AAAA,IACL,YAAY;AACV,YAAM,WAAW,MAAM,MAAM,KAAK,YAAY,OAAO;AACrD,YAAM,QAAuB,CAAC;AAC9B,eAAS,aAAa,GAAG,cAAc,SAAS,UAAU,cAAc,GAAG;AACzE,qBAAa,eAAe;AAC5B,cAAM,OAAO,MAAM,MAAM,KAAK,SAAS,QAAQ,UAAU,CAAC;AAC1D,cAAM,UAAU,MAAM,MAAM,KAAK,KAAK,eAAe,CAAC;AACtD,cAAM,KAAK,EAAE,YAAY,MAAM,gBAAgB,QAAQ,KAAK,EAAE,CAAC;AAAA,MACjE;AACA,aAAO,EAAE,MAAM;AAAA,IACjB;AAAA,IACA,YAAY;AACV,YAAM,QAAQ;AACd,YAAM,QAAQ;AAAA,IAChB;AAAA,EACF;AACF;AAEA,eAAe,YAAuE;AACpF,MAAI;AACF,WAAO,MAAM,OAAO,iCAAiC;AAAA,EACvD,SAAS,OAAO;AACd,QAAI,CAAC,yBAAyB,KAAK,GAAG;AACpC,YAAM;AAAA,IACR;AACA,UAAM,IAAI;AAAA,MACR;AAAA,MACA,EAAE,MAAM;AAAA,IACV;AAAA,EACF;AACF;AAEA,SAAS,yBAAyB,OAAyB;AACzD,QAAM,OAAO,oBAAI,IAAa;AAC9B,MAAI,UAAU;AACd,SAAO,mBAAmB,SAAS,CAAC,KAAK,IAAI,OAAO,GAAG;AACrD,SAAK,IAAI,OAAO;AAChB,QACE,QAAQ,QAAQ,SAAS,YAAY,KACrC,UAAU,WACV,QAAQ,SAAS,wBACjB;AACA,aAAO;AAAA,IACT;AACA,cAAU,WAAW,UAAU,QAAQ,QAAQ;AAAA,EACjD;AACA,SAAO;AACT;AAEA,eAAe,eACb,WACA,SACiB;AACjB,MAAI;AACJ,MAAI;AACF,cAAU,EAAE,IAAI,MAAM,OAAO,MAAM,UAAU,EAAE;AAAA,EACjD,SAAS,OAAO;AACd,cAAU,EAAE,IAAI,OAAO,MAAM;AAAA,EAC/B;AAEA,MAAI;AACJ,MAAI,gBAAgB;AACpB,MAAI;AACF,UAAM,QAAQ;AAAA,EAChB,SAAS,OAAO;AACd,oBAAgB;AAChB,mBAAe;AAAA,EACjB;AAEA,MAAI,CAAC,QAAQ,IAAI;AACf,QAAI,eAAe;AACjB,YAAM,IAAI;AAAA,QACR,CAAC,QAAQ,OAAO,YAAY;AAAA,QAC5B;AAAA,QACA,EAAE,OAAO,QAAQ,MAAM;AAAA,MACzB;AAAA,IACF;AACA,UAAM,QAAQ;AAAA,EAChB;AACA,MAAI,eAAe;AACjB,UAAM;AAAA,EACR;AACA,SAAO,QAAQ;AACjB;AAEA,SAAS,cAAc,OAAsC;AAC3D,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAC/C,WAAO;AAAA,EACT;AACA,QAAM,YAAY;AAClB,SACE,OAAO,UAAU,YAAY,aAC7B,OAAO,UAAU,qBAAqB,cACtC,OAAO,UAAU,wBAAwB,cACzC,OAAO,UAAU,mBAAmB;AAExC;AAEA,SAAS,gBAAgB,OAAmC;AAC1D,MAAI,OAAO;AACX,aAAW,QAAQ,OAAO;AACxB,QAAI,OAAO,SAAS,YAAY,SAAS,MAAM;AAC7C,YAAM,IAAI,UAAU,4CAA4C;AAAA,IAClE;AACA,QAAI,EAAE,SAAS,OAAO;AACpB,UACE,UAAU,SACT,KAAK,SAAS,wBACb,KAAK,SAAS,6BACd,KAAK,SAAS,qBAChB;AACA;AAAA,MACF;AACA,YAAM,IAAI,UAAU,oDAAoD;AAAA,IAC1E;AACA,QAAI,OAAO,KAAK,QAAQ,UAAU;AAChC,YAAM,IAAI,UAAU,4CAA4C;AAAA,IAClE;AACA,QAAI,EAAE,YAAY,SAAS,OAAO,KAAK,WAAW,WAAW;AAC3D,YAAM,IAAI,UAAU,gDAAgD;AAAA,IACtE;AACA,YAAQ,KAAK;AACb,QAAI,KAAK,QAAQ;AACf,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBACP,aACA,SAIA;AACA,MAAI,gBAAgB,QAAW;AAC7B,WAAO;AAAA,MACL,MAAM,CAAC,YAAY;AAAA,MACnB,SAAS,MAAM;AAAA,IACjB;AAAA,EACF;AAEA,MAAI;AACJ,QAAM,UAAU,IAAI,QAAe,CAAC,UAAU,WAAW;AACvD,kBAAc;AAAA,EAChB,CAAC;AACD,QAAM,UAAU,MAAM;AACpB,SAAK,QAAQ;AACb;AAAA,MACE,YAAY,UAAU,IAAI,aAAa,6BAA6B,YAAY;AAAA,IAClF;AAAA,EACF;AACA,cAAY,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC7D,MAAI,YAAY,SAAS;AACvB,YAAQ;AAAA,EACV;AAEA,SAAO;AAAA,IACL,MAAM,CAAC,YAAY,QAAQ,KAAK,CAAC,SAAS,OAAO,CAAC;AAAA,IAClD,SAAS,MAAM,YAAY,oBAAoB,SAAS,OAAO;AAAA,EACjE;AACF;;;ACvKO,SAAS,mBACd,SACwC;AACxC,MAAI,OAAO,YAAY,YAAY,YAAY,MAAM;AACnD,UAAM,IAAI,UAAU,2DAA2D;AAAA,EACjF;AACA,QAAM,YAAY,QAAQ;AAC1B,MAAI,CAAC,MAAM,QAAQ,SAAS,GAAG;AAC7B,UAAM,IAAI,UAAU,2DAA2D;AAAA,EACjF;AAEA,QAAM,MAAM,oBAAI,IAAY;AAC5B,QAAM,SAAwC,CAAC;AAC/C,aAAW,YAAY,WAAgD;AACrE,qBAAiB,UAAU,GAAG;AAC9B,WAAO,KAAK,GAAG,cAAc,UAAU,QAAQ,QAAQ,CAAC;AAAA,EAC1D;AACA,SAAO;AACT;AAEA,SAAS,iBAA2B,UAAkC,KAAwB;AAC5F,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACrD,UAAM,IAAI,UAAU,gCAAgC;AAAA,EACtD;AACA,MAAI,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,WAAW,GAAG;AAC/D,UAAM,IAAI,UAAU,6CAA6C;AAAA,EACnE;AACA,MAAI,IAAI,IAAI,SAAS,EAAE,GAAG;AACxB,UAAM,IAAI,UAAU,+BAA+B,SAAS,EAAE,EAAE;AAAA,EAClE;AACA,MAAI,OAAO,SAAS,SAAS,YAAY,SAAS,KAAK,WAAW,GAAG;AACnE,UAAM,IAAI,UAAU,iBAAiB,SAAS,EAAE,8BAA8B;AAAA,EAChF;AACA,MAAI,IAAI,SAAS,EAAE;AACrB;AAEA,SAAS,cACP,UACA,UACwC;AACxC,MAAI,aAAa,UAAa,SAAS,aAAa,QAAQ;AAC1D,WAAO,CAAC,oBAAoB,UAAU,GAAG,SAAS,IAAI,CAAC;AAAA,EACzD;AAEA,QAAM,aAAa,kBAAkB,SAAS,MAAM,QAAQ;AAC5D,SAAO,WAAW,IAAI,CAAC,UAAU,oBAAoB,UAAU,MAAM,OAAO,MAAM,IAAI,CAAC;AACzF;AAEA,SAAS,kBACP,MACA,UACA;AACA,QAAM,UAAU,SAAS,WAAW;AACpC,MAAI,SAAS,aAAa,SAAS;AACjC,WAAO,UAAU;AAAA,MACf;AAAA,MACA,UAAU;AAAA,MACV,SAAS,SAAS;AAAA,MAClB;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO,UAAU;AAAA,IACf;AAAA,IACA,UAAU;AAAA,IACV,SAAS,SAAS;AAAA,IAClB;AAAA,IACA,YAAY,SAAS;AAAA,EACvB,CAAC;AACH;AAEA,SAAS,oBACP,UACA,OACA,MAC6B;AAC7B,QAAM,QAAQ;AAAA,IACZ,IAAI,GAAG,SAAS,EAAE,UAAU,KAAK;AAAA,IACjC,YAAY,SAAS;AAAA,IACrB;AAAA,IACA;AAAA,EACF;AACA,MAAI,SAAS,aAAa,QAAW;AACnC,WAAO;AAAA,EACT;AACA,SAAO,EAAE,GAAG,OAAO,UAAU,SAAS,SAAS;AACjD;","names":[]}

package/dist/{chunk-PH6OTIPZ.js → chunk-5TIXGU5U.js}

@@ -23,7 +23,7 @@ import {
 import {
   isQuestionTool,
   isToolIndex
-} from "./chunk-EO2GECYH.js";
+} from "./chunk-OIB3URVG.js";
 import {
   ToolNotFoundError,
   ToolOutput,
@@ -38,7 +38,7 @@ import {
   retrieveDocuments,
   toolMayRequireApproval,
   toolResultContentToText
-} from "./chunk-YFJ4NHV6.js";
+} from "./chunk-LZD36ZAP.js";
 import {
   AgentRunBlockedError,
   AgentRunCancelledError,
@@ -4772,4 +4772,4 @@ export {
   markResolvedAgentOptions,
   Agent
 };
-//# sourceMappingURL=chunk-PH6OTIPZ.js.map
+//# sourceMappingURL=chunk-5TIXGU5U.js.map

package/dist/{chunk-YFJ4NHV6.js → chunk-LZD36ZAP.js}

@@ -1,5 +1,9 @@
+import {
+  chunkTextDocuments
+} from "./chunk-4EWTDOLR.js";
 import {
   cosineSimilarity,
+  embedDocuments,
   embedSparseQuery,
   embedText
 } from "./chunk-K5L7R7XM.js";
@@ -432,6 +436,85 @@ function resolveRetries(setting) {
   return setting === void 0 || setting === false ? void 0 : resolveRetryOptions(setting);
 }
 
+// src/vector-store/ingest.ts
+async function ingestVectorText(options) {
+  return ingestVectorDocuments({
+    store: options.store,
+    documents: [options.document],
+    embeddingModel: options.embeddingModel,
+    chunking: options.chunking,
+    retries: options.retries,
+    concurrency: options.concurrency,
+    providerOptions: options.providerOptions,
+    abortSignal: options.abortSignal
+  });
+}
+async function ingestVectorDocuments(options) {
+  for (const document of options.documents) {
+    validateVectorMetadata(document.metadata, document.id);
+  }
+  const chunks = chunkTextDocuments({
+    documents: options.documents,
+    chunking: options.chunking
+  });
+  const chunksByDocument = groupChunksByDocument(chunks);
+  const embedded = await embedDocuments({
+    model: options.embeddingModel,
+    documents: [...options.documents],
+    id: (document) => document.id,
+    content: (document) => {
+      const documentChunks = chunksByDocument.get(document.id);
+      if (documentChunks === void 0) {
+        throw new TypeError(`Text document ${document.id} has no chunks`);
+      }
+      return documentChunks.map((chunk) => chunk.text);
+    },
+    metadata: (document) => document.metadata,
+    retries: options.retries,
+    concurrency: options.concurrency,
+    abortSignal: options.abortSignal
+  });
+  await options.store.upsert({
+    documents: embedded.documents,
+    providerOptions: options.providerOptions
+  });
+  return { documents: embedded.documents };
+}
+function validateVectorMetadata(metadata, documentId) {
+  if (metadata === void 0) {
+    return;
+  }
+  if (typeof metadata !== "object" || metadata === null || Array.isArray(metadata)) {
+    throw new TypeError(`Text document ${documentId} metadata must be an object`);
+  }
+  for (const [key, value] of Object.entries(metadata)) {
+    validateVectorMetadataValue(value, `Text document ${documentId} metadata.${key}`);
+  }
+}
+function validateVectorMetadataValue(value, label) {
+  if (value === null || typeof value === "string" || typeof value === "boolean") {
+    return;
+  }
+  if (typeof value !== "number" || !Number.isFinite(value)) {
+    throw new TypeError(`${label} must be a finite vector metadata value`);
+  }
+  if (Number.isInteger(value) && !Number.isSafeInteger(value)) {
+    throw new TypeError(`${label} must be a safe integer`);
+  }
+}
+function groupChunksByDocument(chunks) {
+  const grouped = /* @__PURE__ */ new Map();
+  for (const chunk of chunks) {
+    const documentChunks = grouped.get(chunk.documentId);
+    if (documentChunks === void 0) {
+      grouped.set(chunk.documentId, [chunk]);
+    } else {
+      documentChunks.push(chunk);
+    }
+  }
+  return grouped;
+}
+
 // src/vector-store/index.ts
 var InMemoryVectorStore = class _InMemoryVectorStore {
   documents = /* @__PURE__ */ new Map();
@@ -661,7 +744,9 @@ export {
   vectorFilter,
   matchesVectorFilter,
   retrieveDocuments,
+  ingestVectorText,
+  ingestVectorDocuments,
   InMemoryVectorStore,
   createVectorSearchTool
 };
-//# sourceMappingURL=chunk-YFJ4NHV6.js.map
+//# sourceMappingURL=chunk-LZD36ZAP.js.map