@tinacms/search 0.0.0-00f6525-20241015065741

package/LICENSE

@@ -0,0 +1,184 @@
+Copyright (c) 2023-present Forestry.io Holdings Inc.
+
+Portions of the TinaCMS software are licensed as follows:
+
+* All software that resides under the "packages/@tinacms/datalayer/" and the "packages/@tinacms/graphql/" directories (the "Tina Data Layer"), is licensed under the license defined in "packages/@tinacms/datalayer/LICENSE".
+
+* All software outside of the above-mentioned directories is available under the "Apache 2.0" license as set forth below.
+
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS

package/dist/client/index.d.ts

@@ -0,0 +1,39 @@
+import type { SearchClient } from '../types';
+import { MemoryLevel } from 'memory-level';
+type TinaSearchIndexerClientOptions = {
+    stopwordLanguages?: string[];
+    tokenSplitRegex?: string;
+};
+type TinaCloudSearchIndexerClientOptions = {
+    apiUrl: string;
+    branch: string;
+    indexerToken: string;
+} & TinaSearchIndexerClientOptions;
+export declare class LocalSearchIndexClient implements SearchClient {
+    searchIndex: any;
+    protected readonly memoryLevel: MemoryLevel;
+    private readonly stopwords;
+    private readonly tokenSplitRegex;
+    constructor(options: TinaSearchIndexerClientOptions);
+    onStartIndexing(): Promise<void>;
+    put(docs: any[]): Promise<any>;
+    del(ids: string[]): Promise<any>;
+    query(query: string, options: {
+        cursor?: string;
+        limit?: number;
+    } | undefined): Promise<{
+        results: any[];
+        total: number;
+        nextCursor: string | null;
+        prevCursor: string | null;
+    }>;
+    export(filename: string): Promise<void>;
+}
+export declare class TinaCMSSearchIndexClient extends LocalSearchIndexClient {
+    private readonly apiUrl;
+    private readonly branch;
+    private readonly indexerToken;
+    constructor(options: TinaCloudSearchIndexerClientOptions);
+    onFinishIndexing(): Promise<void>;
+}
+export {};

package/dist/index-client.d.ts

@@ -0,0 +1,16 @@
+export type { SearchClient } from './types';
+export { processDocumentForIndexing } from './indexer/utils';
+export declare const queryToSearchIndexQuery: (query: string, stopwordLanguages?: string[]) => any;
+export declare const optionsToSearchIndexOptions: (options?: {
+    limit?: number;
+    cursor?: string;
+}) => {};
+export declare const parseSearchIndexResponse: (data: any, options?: {
+    limit?: number;
+    cursor?: string;
+}) => {
+    results: any;
+    total: any;
+    prevCursor: any;
+    nextCursor: string;
+};

package/dist/index-client.js

@@ -0,0 +1,215 @@
+(function(global, factory) {
+  typeof exports === "object" && typeof module !== "undefined" ? factory(exports, require("stopword")) : typeof define === "function" && define.amd ? define(["exports", "stopword"], factory) : (global = typeof globalThis !== "undefined" ? globalThis : global || self, factory(global["@tinacms/search"] = {}, global.NOOP));
+})(this, function(exports2, sw) {
+  "use strict";
+  function _interopNamespaceDefault(e) {
+    const n = Object.create(null, { [Symbol.toStringTag]: { value: "Module" } });
+    if (e) {
+      for (const k in e) {
+        if (k !== "default") {
+          const d = Object.getOwnPropertyDescriptor(e, k);
+          Object.defineProperty(n, k, d.get ? d : {
+            enumerable: true,
+            get: () => e[k]
+          });
+        }
+      }
+    }
+    n.default = e;
+    return Object.freeze(n);
+  }
+  const sw__namespace = /* @__PURE__ */ _interopNamespaceDefault(sw);
+  class StringBuilder {
+    constructor(limit) {
+      this.length = 0;
+      this.buffer = [];
+      this.limit = limit;
+    }
+    append(str) {
+      if (this.length + str.length > this.limit) {
+        return true;
+      } else {
+        this.buffer.push(str);
+        this.length += str.length;
+        if (this.length > this.limit) {
+          return true;
+        }
+        return false;
+      }
+    }
+    toString() {
+      return this.buffer.join(" ");
+    }
+  }
+  const extractText = (data, acc, indexableNodeTypes) => {
+    var _a, _b;
+    if (data) {
+      if (indexableNodeTypes.indexOf(data.type) !== -1 && (data.text || data.value)) {
+        const tokens = tokenizeString(data.text || data.value);
+        for (const token of tokens) {
+          if (acc.append(token)) {
+            return;
+          }
+        }
+      }
+      (_b = (_a = data.children) == null ? void 0 : _a.forEach) == null ? void 0 : _b.call(
+        _a,
+        (child) => extractText(child, acc, indexableNodeTypes)
+      );
+    }
+  };
+  const relativePath = (path, collection) => {
+    return path.replace(/\\/g, "/").replace(collection.path, "").replace(/^\/|\/$/g, "");
+  };
+  const tokenizeString = (str) => {
+    return str.split(/[\s\.,]+/).map((s) => s.toLowerCase()).filter((s) => s);
+  };
+  const processTextFieldValue = (value, maxLen) => {
+    const tokens = tokenizeString(value);
+    const builder = new StringBuilder(maxLen);
+    for (const part of tokens) {
+      if (builder.append(part)) {
+        break;
+      }
+    }
+    return builder.toString();
+  };
+  const processDocumentForIndexing = (data, path, collection, textIndexLength, field) => {
+    if (!field) {
+      const relPath = relativePath(path, collection);
+      data["_id"] = `${collection.name}:${relPath}`;
+      data["_relativePath"] = relPath;
+    }
+    for (const f of (field == null ? void 0 : field.fields) || collection.fields || []) {
+      if (!f.searchable) {
+        delete data[f.name];
+        continue;
+      }
+      const isList = f.list;
+      if (data[f.name]) {
+        if (f.type === "object") {
+          if (isList) {
+            data[f.name] = data[f.name].map(
+              (obj) => processDocumentForIndexing(
+                obj,
+                path,
+                collection,
+                textIndexLength,
+                f
+              )
+            );
+          } else {
+            data[f.name] = processDocumentForIndexing(
+              data[f.name],
+              path,
+              collection,
+              textIndexLength,
+              f
+            );
+          }
+        } else if (f.type === "string") {
+          const fieldTextIndexLength = f.maxSearchIndexFieldLength || textIndexLength;
+          if (isList) {
+            data[f.name] = data[f.name].map(
+              (value) => processTextFieldValue(value, fieldTextIndexLength)
+            );
+          } else {
+            data[f.name] = processTextFieldValue(
+              data[f.name],
+              fieldTextIndexLength
+            );
+          }
+        } else if (f.type === "rich-text") {
+          const fieldTextIndexLength = f.maxSearchIndexFieldLength || textIndexLength;
+          if (isList) {
+            data[f.name] = data[f.name].map((value) => {
+              const acc = new StringBuilder(fieldTextIndexLength);
+              extractText(value, acc, ["text", "code_block", "html"]);
+              return acc.toString();
+            });
+          } else {
+            const acc = new StringBuilder(fieldTextIndexLength);
+            extractText(data[f.name], acc, ["text", "code_block", "html"]);
+            data[f.name] = acc.toString();
+          }
+        }
+      }
+    }
+    return data;
+  };
+  const memo = {};
+  const lookupStopwords = (keys, defaultStopWords = sw__namespace.eng) => {
+    let stopwords = defaultStopWords;
+    if (keys) {
+      if (memo[keys.join(",")]) {
+        return memo[keys.join(",")];
+      }
+      stopwords = [];
+      for (const key of keys) {
+        stopwords.push(...sw__namespace[key]);
+      }
+      memo[keys.join(",")] = stopwords;
+    }
+    return stopwords;
+  };
+  const queryToSearchIndexQuery = (query, stopwordLanguages) => {
+    let q;
+    const parts = query.split(" ");
+    const stopwords = lookupStopwords(stopwordLanguages);
+    if (parts.length === 1) {
+      q = { AND: [parts[0]] };
+    } else {
+      q = {
+        AND: parts.filter(
+          (part) => part.toLowerCase() !== "and" && stopwords.indexOf(part.toLowerCase()) === -1
+        )
+      };
+    }
+    return q;
+  };
+  const optionsToSearchIndexOptions = (options) => {
+    const opt = {};
+    if (options == null ? void 0 : options.limit) {
+      opt["PAGE"] = {
+        SIZE: options.limit,
+        NUMBER: (options == null ? void 0 : options.cursor) ? parseInt(options.cursor) : 0
+      };
+    }
+    return opt;
+  };
+  const parseSearchIndexResponse = (data, options) => {
+    const results = data["RESULT"];
+    const total = data["RESULT_LENGTH"];
+    if ((options == null ? void 0 : options.cursor) && (options == null ? void 0 : options.limit)) {
+      const prevCursor = options.cursor === "0" ? null : (parseInt(options.cursor) - 1).toString();
+      const nextCursor = total <= (parseInt(options.cursor) + 1) * options.limit ? null : (parseInt(options.cursor) + 1).toString();
+      return {
+        results,
+        total,
+        prevCursor,
+        nextCursor
+      };
+    } else if (!(options == null ? void 0 : options.cursor) && (options == null ? void 0 : options.limit)) {
+      const prevCursor = null;
+      const nextCursor = total <= options.limit ? null : "1";
+      return {
+        results,
+        total,
+        prevCursor,
+        nextCursor
+      };
+    } else {
+      return {
+        results,
+        total,
+        prevCursor: null,
+        nextCursor: null
+      };
+    }
+  };
+  exports2.optionsToSearchIndexOptions = optionsToSearchIndexOptions;
+  exports2.parseSearchIndexResponse = parseSearchIndexResponse;
+  exports2.processDocumentForIndexing = processDocumentForIndexing;
+  exports2.queryToSearchIndexQuery = queryToSearchIndexQuery;
+  Object.defineProperty(exports2, Symbol.toStringTag, { value: "Module" });
+});

package/dist/index-client.mjs

@@ -0,0 +1,195 @@
+import * as sw from "stopword";
+class StringBuilder {
+  constructor(limit) {
+    this.length = 0;
+    this.buffer = [];
+    this.limit = limit;
+  }
+  append(str) {
+    if (this.length + str.length > this.limit) {
+      return true;
+    } else {
+      this.buffer.push(str);
+      this.length += str.length;
+      if (this.length > this.limit) {
+        return true;
+      }
+      return false;
+    }
+  }
+  toString() {
+    return this.buffer.join(" ");
+  }
+}
+const extractText = (data, acc, indexableNodeTypes) => {
+  var _a, _b;
+  if (data) {
+    if (indexableNodeTypes.indexOf(data.type) !== -1 && (data.text || data.value)) {
+      const tokens = tokenizeString(data.text || data.value);
+      for (const token of tokens) {
+        if (acc.append(token)) {
+          return;
+        }
+      }
+    }
+    (_b = (_a = data.children) == null ? void 0 : _a.forEach) == null ? void 0 : _b.call(
+      _a,
+      (child) => extractText(child, acc, indexableNodeTypes)
+    );
+  }
+};
+const relativePath = (path, collection) => {
+  return path.replace(/\\/g, "/").replace(collection.path, "").replace(/^\/|\/$/g, "");
+};
+const tokenizeString = (str) => {
+  return str.split(/[\s\.,]+/).map((s) => s.toLowerCase()).filter((s) => s);
+};
+const processTextFieldValue = (value, maxLen) => {
+  const tokens = tokenizeString(value);
+  const builder = new StringBuilder(maxLen);
+  for (const part of tokens) {
+    if (builder.append(part)) {
+      break;
+    }
+  }
+  return builder.toString();
+};
+const processDocumentForIndexing = (data, path, collection, textIndexLength, field) => {
+  if (!field) {
+    const relPath = relativePath(path, collection);
+    data["_id"] = `${collection.name}:${relPath}`;
+    data["_relativePath"] = relPath;
+  }
+  for (const f of (field == null ? void 0 : field.fields) || collection.fields || []) {
+    if (!f.searchable) {
+      delete data[f.name];
+      continue;
+    }
+    const isList = f.list;
+    if (data[f.name]) {
+      if (f.type === "object") {
+        if (isList) {
+          data[f.name] = data[f.name].map(
+            (obj) => processDocumentForIndexing(
+              obj,
+              path,
+              collection,
+              textIndexLength,
+              f
+            )
+          );
+        } else {
+          data[f.name] = processDocumentForIndexing(
+            data[f.name],
+            path,
+            collection,
+            textIndexLength,
+            f
+          );
+        }
+      } else if (f.type === "string") {
+        const fieldTextIndexLength = f.maxSearchIndexFieldLength || textIndexLength;
+        if (isList) {
+          data[f.name] = data[f.name].map(
+            (value) => processTextFieldValue(value, fieldTextIndexLength)
+          );
+        } else {
+          data[f.name] = processTextFieldValue(
+            data[f.name],
+            fieldTextIndexLength
+          );
+        }
+      } else if (f.type === "rich-text") {
+        const fieldTextIndexLength = f.maxSearchIndexFieldLength || textIndexLength;
+        if (isList) {
+          data[f.name] = data[f.name].map((value) => {
+            const acc = new StringBuilder(fieldTextIndexLength);
+            extractText(value, acc, ["text", "code_block", "html"]);
+            return acc.toString();
+          });
+        } else {
+          const acc = new StringBuilder(fieldTextIndexLength);
+          extractText(data[f.name], acc, ["text", "code_block", "html"]);
+          data[f.name] = acc.toString();
+        }
+      }
+    }
+  }
+  return data;
+};
+const memo = {};
+const lookupStopwords = (keys, defaultStopWords = sw.eng) => {
+  let stopwords = defaultStopWords;
+  if (keys) {
+    if (memo[keys.join(",")]) {
+      return memo[keys.join(",")];
+    }
+    stopwords = [];
+    for (const key of keys) {
+      stopwords.push(...sw[key]);
+    }
+    memo[keys.join(",")] = stopwords;
+  }
+  return stopwords;
+};
+const queryToSearchIndexQuery = (query, stopwordLanguages) => {
+  let q;
+  const parts = query.split(" ");
+  const stopwords = lookupStopwords(stopwordLanguages);
+  if (parts.length === 1) {
+    q = { AND: [parts[0]] };
+  } else {
+    q = {
+      AND: parts.filter(
+        (part) => part.toLowerCase() !== "and" && stopwords.indexOf(part.toLowerCase()) === -1
+      )
+    };
+  }
+  return q;
+};
+const optionsToSearchIndexOptions = (options) => {
+  const opt = {};
+  if (options == null ? void 0 : options.limit) {
+    opt["PAGE"] = {
+      SIZE: options.limit,
+      NUMBER: (options == null ? void 0 : options.cursor) ? parseInt(options.cursor) : 0
+    };
+  }
+  return opt;
+};
+const parseSearchIndexResponse = (data, options) => {
+  const results = data["RESULT"];
+  const total = data["RESULT_LENGTH"];
+  if ((options == null ? void 0 : options.cursor) && (options == null ? void 0 : options.limit)) {
+    const prevCursor = options.cursor === "0" ? null : (parseInt(options.cursor) - 1).toString();
+    const nextCursor = total <= (parseInt(options.cursor) + 1) * options.limit ? null : (parseInt(options.cursor) + 1).toString();
+    return {
+      results,
+      total,
+      prevCursor,
+      nextCursor
+    };
+  } else if (!(options == null ? void 0 : options.cursor) && (options == null ? void 0 : options.limit)) {
+    const prevCursor = null;
+    const nextCursor = total <= options.limit ? null : "1";
+    return {
+      results,
+      total,
+      prevCursor,
+      nextCursor
+    };
+  } else {
+    return {
+      results,
+      total,
+      prevCursor: null,
+      nextCursor: null
+    };
+  }
+};
+export {
+  optionsToSearchIndexOptions,
+  parseSearchIndexResponse,
+  processDocumentForIndexing,
+  queryToSearchIndexQuery
+};

package/dist/index.d.ts

@@ -0,0 +1,5 @@
+import si from 'search-index';
+export { SearchIndexer } from './indexer';
+export { LocalSearchIndexClient, TinaCMSSearchIndexClient } from './client';
+export type { SearchClient } from './types';
+export { si };

package/dist/index.js

@@ -0,0 +1,364 @@
+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(
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var src_exports = {};
+__export(src_exports, {
+  LocalSearchIndexClient: () => LocalSearchIndexClient,
+  SearchIndexer: () => SearchIndexer,
+  TinaCMSSearchIndexClient: () => TinaCMSSearchIndexClient,
+  si: () => import_search_index2.default
+});
+module.exports = __toCommonJS(src_exports);
+var import_search_index2 = __toESM(require("search-index"));
+
+// src/indexer/index.ts
+var import_graphql = require("@tinacms/graphql");
+
+// src/indexer/utils.ts
+var sw = __toESM(require("stopword"));
+var StringBuilder = class {
+  constructor(limit) {
+    this.length = 0;
+    this.buffer = [];
+    this.limit = limit;
+  }
+  append(str) {
+    if (this.length + str.length > this.limit) {
+      return true;
+    } else {
+      this.buffer.push(str);
+      this.length += str.length;
+      if (this.length > this.limit) {
+        return true;
+      }
+      return false;
+    }
+  }
+  toString() {
+    return this.buffer.join(" ");
+  }
+};
+var extractText = (data, acc, indexableNodeTypes) => {
+  var _a, _b;
+  if (data) {
+    if (indexableNodeTypes.indexOf(data.type) !== -1 && (data.text || data.value)) {
+      const tokens = tokenizeString(data.text || data.value);
+      for (const token of tokens) {
+        if (acc.append(token)) {
+          return;
+        }
+      }
+    }
+    (_b = (_a = data.children) == null ? void 0 : _a.forEach) == null ? void 0 : _b.call(
+      _a,
+      (child) => extractText(child, acc, indexableNodeTypes)
+    );
+  }
+};
+var relativePath = (path, collection) => {
+  return path.replace(/\\/g, "/").replace(collection.path, "").replace(/^\/|\/$/g, "");
+};
+var tokenizeString = (str) => {
+  return str.split(/[\s\.,]+/).map((s) => s.toLowerCase()).filter((s) => s);
+};
+var processTextFieldValue = (value, maxLen) => {
+  const tokens = tokenizeString(value);
+  const builder = new StringBuilder(maxLen);
+  for (const part of tokens) {
+    if (builder.append(part)) {
+      break;
+    }
+  }
+  return builder.toString();
+};
+var processDocumentForIndexing = (data, path, collection, textIndexLength, field) => {
+  if (!field) {
+    const relPath = relativePath(path, collection);
+    data["_id"] = `${collection.name}:${relPath}`;
+    data["_relativePath"] = relPath;
+  }
+  for (const f of (field == null ? void 0 : field.fields) || collection.fields || []) {
+    if (!f.searchable) {
+      delete data[f.name];
+      continue;
+    }
+    const isList = f.list;
+    if (data[f.name]) {
+      if (f.type === "object") {
+        if (isList) {
+          data[f.name] = data[f.name].map(
+            (obj) => processDocumentForIndexing(
+              obj,
+              path,
+              collection,
+              textIndexLength,
+              f
+            )
+          );
+        } else {
+          data[f.name] = processDocumentForIndexing(
+            data[f.name],
+            path,
+            collection,
+            textIndexLength,
+            f
+          );
+        }
+      } else if (f.type === "string") {
+        const fieldTextIndexLength = f.maxSearchIndexFieldLength || textIndexLength;
+        if (isList) {
+          data[f.name] = data[f.name].map(
+            (value) => processTextFieldValue(value, fieldTextIndexLength)
+          );
+        } else {
+          data[f.name] = processTextFieldValue(
+            data[f.name],
+            fieldTextIndexLength
+          );
+        }
+      } else if (f.type === "rich-text") {
+        const fieldTextIndexLength = f.maxSearchIndexFieldLength || textIndexLength;
+        if (isList) {
+          data[f.name] = data[f.name].map((value) => {
+            const acc = new StringBuilder(fieldTextIndexLength);
+            extractText(value, acc, ["text", "code_block", "html"]);
+            return acc.toString();
+          });
+        } else {
+          const acc = new StringBuilder(fieldTextIndexLength);
+          extractText(data[f.name], acc, ["text", "code_block", "html"]);
+          data[f.name] = acc.toString();
+        }
+      }
+    }
+  }
+  return data;
+};
+var memo = {};
+var lookupStopwords = (keys, defaultStopWords = sw.eng) => {
+  let stopwords = defaultStopWords;
+  if (keys) {
+    if (memo[keys.join(",")]) {
+      return memo[keys.join(",")];
+    }
+    stopwords = [];
+    for (const key of keys) {
+      stopwords.push(...sw[key]);
+    }
+    memo[keys.join(",")] = stopwords;
+  }
+  return stopwords;
+};
+
+// src/indexer/index.ts
+var SearchIndexer = class {
+  constructor(options) {
+    this.client = options.client;
+    this.bridge = options.bridge;
+    this.schema = options.schema;
+    this.batchSize = options.batchSize || 100;
+    this.textIndexLength = options.textIndexLength || 500;
+  }
+  makeIndexerCallback(itemCallback) {
+    return async (collection, contentPaths) => {
+      const templateInfo = this.schema.getTemplatesForCollectable(collection);
+      await (0, import_graphql.sequential)(contentPaths, async (path) => {
+        const data = await (0, import_graphql.transformDocumentIntoPayload)(
+          `${collection.path}/${path}`,
+          (0, import_graphql.transformDocument)(
+            path,
+            await (0, import_graphql.loadAndParseWithAliases)(
+              this.bridge,
+              path,
+              collection,
+              templateInfo
+            ),
+            this.schema
+          ),
+          this.schema
+        );
+        await itemCallback(
+          processDocumentForIndexing(
+            data["_values"],
+            path,
+            collection,
+            this.textIndexLength
+          )
+        );
+      });
+    };
+  }
+  async indexContentByPaths(documentPaths) {
+    var _a, _b, _c, _d;
+    let batch = [];
+    const itemCallback = async (item) => {
+      batch.push(item);
+      if (batch.length > this.batchSize) {
+        await this.client.put(batch);
+        batch = [];
+      }
+    };
+    await ((_b = (_a = this.client).onStartIndexing) == null ? void 0 : _b.call(_a));
+    await (0, import_graphql.scanContentByPaths)(
+      this.schema,
+      documentPaths,
+      this.makeIndexerCallback(itemCallback)
+    );
+    if (batch.length > 0) {
+      await this.client.put(batch);
+    }
+    await ((_d = (_c = this.client).onFinishIndexing) == null ? void 0 : _d.call(_c));
+  }
+  async indexAllContent() {
+    var _a, _b, _c, _d;
+    await ((_b = (_a = this.client).onStartIndexing) == null ? void 0 : _b.call(_a));
+    let batch = [];
+    const itemCallback = async (item) => {
+      batch.push(item);
+      if (batch.length > this.batchSize) {
+        await this.client.put(batch);
+        batch = [];
+      }
+    };
+    const warnings = await (0, import_graphql.scanAllContent)(
+      this.schema,
+      this.bridge,
+      this.makeIndexerCallback(itemCallback)
+    );
+    if (batch.length > 0) {
+      await this.client.put(batch);
+    }
+    await ((_d = (_c = this.client).onFinishIndexing) == null ? void 0 : _d.call(_c));
+    return { warnings };
+  }
+  async deleteIndexContent(documentPaths) {
+    var _a, _b, _c, _d;
+    await ((_b = (_a = this.client).onStartIndexing) == null ? void 0 : _b.call(_a));
+    await this.client.del(documentPaths);
+    await ((_d = (_c = this.client).onFinishIndexing) == null ? void 0 : _d.call(_c));
+  }
+};
+
+// src/client/index.ts
+var import_sqlite_level = require("sqlite-level");
+var import_search_index = __toESM(require("search-index"));
+var import_memory_level = require("memory-level");
+var zlib = __toESM(require("zlib"));
+var DEFAULT_TOKEN_SPLIT_REGEX = /[\p{L}\d_]+/gu;
+var LocalSearchIndexClient = class {
+  constructor(options) {
+    this.memoryLevel = new import_memory_level.MemoryLevel();
+    this.stopwords = lookupStopwords(options.stopwordLanguages);
+    this.tokenSplitRegex = options.tokenSplitRegex ? new RegExp(options.tokenSplitRegex, "gu") : DEFAULT_TOKEN_SPLIT_REGEX;
+  }
+  async onStartIndexing() {
+    this.searchIndex = await (0, import_search_index.default)({
+      db: this.memoryLevel,
+      stopwords: this.stopwords,
+      tokenSplitRegex: this.tokenSplitRegex
+    });
+  }
+  async put(docs) {
+    if (!this.searchIndex) {
+      throw new Error("onStartIndexing must be called first");
+    }
+    return this.searchIndex.PUT(docs);
+  }
+  async del(ids) {
+    if (!this.searchIndex) {
+      throw new Error("onStartIndexing must be called first");
+    }
+    return this.searchIndex.DELETE(ids);
+  }
+  query(query, options) {
+    return Promise.resolve({
+      nextCursor: void 0,
+      prevCursor: void 0,
+      results: [],
+      total: 0
+    });
+  }
+  async export(filename) {
+    const sqliteLevel = new import_sqlite_level.SqliteLevel({ filename });
+    const iterator = this.memoryLevel.iterator();
+    for await (const [key, value] of iterator) {
+      await sqliteLevel.put(key, value);
+    }
+    await sqliteLevel.close();
+  }
+};
+var TinaCMSSearchIndexClient = class extends LocalSearchIndexClient {
+  constructor(options) {
+    super(options);
+    this.apiUrl = options.apiUrl;
+    this.branch = options.branch;
+    this.indexerToken = options.indexerToken;
+  }
+  async onFinishIndexing() {
+    const headers = new Headers();
+    headers.append("x-api-key", this.indexerToken || "bogus");
+    headers.append("Content-Type", "application/json");
+    let res = await fetch(`${this.apiUrl}/upload/${this.branch}`, {
+      method: "GET",
+      headers
+    });
+    if (res.status !== 200) {
+      let json;
+      try {
+        json = await res.json();
+      } catch (e) {
+        console.error("Failed to parse error response", e);
+      }
+      throw new Error(
+        `Failed to get upload url. Status: ${res.status}${(json == null ? void 0 : json.message) ? ` - ${json.message}` : ``}`
+      );
+    }
+    const { signedUrl } = await res.json();
+    const sqliteLevel = new import_sqlite_level.SqliteLevel({ filename: ":memory:" });
+    const iterator = this.memoryLevel.iterator();
+    for await (const [key, value] of iterator) {
+      await sqliteLevel.put(key, value);
+    }
+    const buffer = sqliteLevel.db.serialize();
+    await sqliteLevel.close();
+    res = await fetch(signedUrl, {
+      method: "PUT",
+      body: zlib.gzipSync(buffer)
+    });
+    if (res.status !== 200) {
+      throw new Error(
+        `Failed to upload search index. Status: ${res.status}
+${await res.text()}`
+      );
+    }
+  }
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  LocalSearchIndexClient,
+  SearchIndexer,
+  TinaCMSSearchIndexClient,
+  si
+});

package/dist/indexer/index.d.ts

@@ -0,0 +1,25 @@
+import { TinaSchema } from '@tinacms/schema-tools';
+import { Bridge } from '@tinacms/graphql';
+import { SearchClient } from '../types';
+type SearchIndexOptions = {
+    batchSize?: number;
+    bridge: Bridge;
+    client: SearchClient;
+    schema: TinaSchema;
+    textIndexLength?: number;
+};
+export declare class SearchIndexer {
+    private readonly batchSize;
+    private readonly client;
+    private readonly bridge;
+    private readonly schema;
+    private readonly textIndexLength;
+    constructor(options: SearchIndexOptions);
+    private makeIndexerCallback;
+    indexContentByPaths(documentPaths: string[]): Promise<void>;
+    indexAllContent(): Promise<{
+        warnings: string[];
+    }>;
+    deleteIndexContent(documentPaths: string[]): Promise<void>;
+}
+export {};

package/dist/indexer/utils.d.ts

@@ -0,0 +1,3 @@
+import { Collection, ObjectField } from '@tinacms/schema-tools';
+export declare const processDocumentForIndexing: (data: any, path: string, collection: Collection, textIndexLength: number, field?: ObjectField) => any;
+export declare const lookupStopwords: (keys?: string[], defaultStopWords?: string[]) => string[];

package/dist/types.d.ts

@@ -0,0 +1,16 @@
+export type SearchClient = {
+    query: (query: string, options?: {
+        cursor?: string;
+        limit?: number;
+    }) => Promise<{
+        results: any[];
+        total: number;
+        nextCursor: string | null;
+        prevCursor: string | null;
+    }>;
+    put: (docs: any[]) => Promise<any>;
+    del: (ids: string[]) => Promise<any>;
+    onStartIndexing?: () => Promise<void>;
+    onFinishIndexing?: () => Promise<void>;
+    supportsClientSideIndexing?: () => boolean;
+};

package/package.json

@@ -0,0 +1,66 @@
+{
+  "name": "@tinacms/search",
+  "version": "0.0.0-00f6525-20241015065741",
+  "main": "dist/index.js",
+  "module": "dist/index-client.mjs",
+  "typings": "dist/index.d.ts",
+  "files": [
+    "package.json",
+    "dist"
+  ],
+  "exports": {
+    ".": {
+      "import": "./dist/index.mjs",
+      "require": "./dist/index.js"
+    },
+    "./dist/index-client": {
+      "import": "./dist/index-client.mjs",
+      "require": "./dist/index-client.js"
+    }
+  },
+  "license": "SEE LICENSE IN LICENSE",
+  "buildConfig": {
+    "entryPoints": [
+      {
+        "name": "src/index.ts",
+        "target": "node"
+      },
+      "src/index-client.ts"
+    ]
+  },
+  "dependencies": {
+    "memory-level": "^1.0.0",
+    "search-index": "4.0.0",
+    "sqlite-level": "^1.2.0",
+    "stopword": "^3.1.1",
+    "@tinacms/graphql": "0.0.0-00f6525-20241015065741",
+    "@tinacms/schema-tools": "0.0.0-00f6525-20241015065741"
+  },
+  "publishConfig": {
+    "registry": "https://registry.npmjs.org"
+  },
+  "repository": {
+    "url": "https://github.com/tinacms/tinacms.git",
+    "directory": "packages/@tinacms/search"
+  },
+  "devDependencies": {
+    "@types/jest": "^29.5.13",
+    "@types/micromatch": "^4.0.9",
+    "@types/node": "^22.7.4",
+    "@types/search-index": "^3.2.4",
+    "jest": "^29.7.0",
+    "jest-diff": "^29.7.0",
+    "jest-file-snapshot": "^0.7.0",
+    "jest-matcher-utils": "^29.7.0",
+    "typescript": "^5.6.2",
+    "@tinacms/scripts": "0.0.0-00f6525-20241015065741"
+  },
+  "scripts": {
+    "types": "pnpm tsc",
+    "build": "tinacms-scripts build",
+    "docs": "pnpm typedoc",
+    "serve": "pnpm nodemon dist/server.js",
+    "test": "jest",
+    "test-watch": "jest --watch"
+  }
+}