@digigov/text-search 1.1.3-rc.16 → 1.2.0-85c27c19

package/cjs/search/search-index/index.js

@@ -1,139 +1,106 @@
 "use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-var _typeof = require("@babel/runtime/helpers/typeof");
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+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 __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var search_index_exports = {};
+__export(search_index_exports, {
+  SearchIndex: () => SearchIndex
 });
-exports.SearchIndex = void 0;
-var _asyncToGenerator2 = _interopRequireDefault(require("@babel/runtime/helpers/asyncToGenerator"));
-var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
-var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-var _flexsearch = require("flexsearch");
-var _encoder = require("./lang/gr/encoder");
-var _utils = require("./utils");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, "catch": function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
-/**
- * Wrapper class around third party index and search library
- *
- * @typeParam T - The type of the data that will be indexed
- */
-var SearchIndex = exports.SearchIndex = /*#__PURE__*/function () {
-  function SearchIndex(items, options) {
-    var _this = this;
-    (0, _classCallCheck2["default"])(this, SearchIndex);
-    /**
-     * Instance of the third party library's index
-     */
-    this.index = void 0;
-    this.idKey = void 0;
-    this.idKey = 'id';
+module.exports = __toCommonJS(search_index_exports);
+var import_flexsearch = require("flexsearch");
+var import_encoder = require("./lang/gr/encoder");
+var import_utils = require("./utils");
+class SearchIndex {
+  constructor(items, options) {
+    this.idKey = "id";
     if (options && options.idKey) {
-      this.idKey = options.idKey.replace('.', ':');
-    } else if (!(items[0] && 'id' in items[0])) {
-      items = items.map(function (item, index) {
-        return (0, _extends2["default"])({}, item, {
-          id: index
-        });
-      });
+      this.idKey = options.idKey.replace(".", ":");
+    } else if (!(items[0] && "id" in items[0])) {
+      items = items.map((item, index) => ({ ...item, id: index }));
     }
-    var fields = [];
+    let fields = [];
     if (options && options.fields) {
       fields = options.fields;
     } else if (items[0]) {
-      fields = (0, _utils.getAllItemKeys)(items[0]);
+      fields = (0, import_utils.getAllItemKeys)(items[0]);
     }
-    fields = fields.filter(function (field) {
-      return field !== _this.idKey;
-    }).map(function (field) {
-      return field.replace('.', ':');
-    });
-    this.index = new _flexsearch.Document({
+    fields = fields.filter((field) => field !== this.idKey).map((field) => field.replace(".", ":"));
+    this.index = new import_flexsearch.Document({
       document: {
         id: this.idKey,
         index: fields
       },
-      tokenize: 'forward',
-      worker: options === null || options === void 0 ? void 0 : options.enableWorker,
-      encode: _encoder.encodeGreek
+      tokenize: "forward",
+      worker: options?.enableWorker,
+      encode: import_encoder.encodeGreek
     });
     this.addAll(items);
   }
-
   /**
    * Add an item to the index
    *
    * @param item - The item to add to the index
    */
-  (0, _createClass2["default"])(SearchIndex, [{
-    key: "add",
-    value: function add(item) {
-      this.index.add(item);
-      return this;
-    }
-
-    /**
-     * Add multiple items to the index
-     *
-     * @param items - The list of items to add to the index
-     */
-  }, {
-    key: "addAll",
-    value: function addAll(items) {
-      var _this2 = this;
-      items.forEach(function (item) {
-        return _this2.index.add(item);
-      });
-      return this;
-    }
-
-    /**
-     * Search the index for the given term
-     *
-     * @param documents - The list of documents to search
-     * @param searchTerm - The term to search for
-     * @returns The list of items that match the search term
-     */
-  }, {
-    key: "search",
-    value: function search(documents, searchTerm) {
-      var res = this.index.search(searchTerm);
-      var ids = (0, _utils.getResultIds)(res);
-      return (0, _utils.findItemsByIds)(documents, ids, this.idKey);
-    }
-
-    /**
-     * Asynchronously search the index for the given term
-     *
-     * @param documents - The list of documents to search
-     * @param searchTerm - The term to search for
-     * @returns The list of items that match the search term
-     */
-  }, {
-    key: "searchAsync",
-    value: (function () {
-      var _searchAsync = (0, _asyncToGenerator2["default"])( /*#__PURE__*/_regeneratorRuntime().mark(function _callee(documents, searchTerm) {
-        var _this3 = this;
-        return _regeneratorRuntime().wrap(function _callee$(_context) {
-          while (1) switch (_context.prev = _context.next) {
-            case 0:
-              return _context.abrupt("return", this.index.searchAsync(searchTerm).then(function (res) {
-                return (0, _utils.getResultIds)(res);
-              }).then(function (res) {
-                return (0, _utils.findItemsByIds)(documents, res, _this3.idKey);
-              }));
-            case 1:
-            case "end":
-              return _context.stop();
-          }
-        }, _callee, this);
-      }));
-      function searchAsync(_x, _x2) {
-        return _searchAsync.apply(this, arguments);
-      }
-      return searchAsync;
-    }())
-  }]);
-  return SearchIndex;
-}();
+  add(item) {
+    this.index.add(item);
+    return this;
+  }
+  /**
+   * Add multiple items to the index
+   *
+   * @param items - The list of items to add to the index
+   */
+  addAll(items) {
+    items.forEach((item) => this.index.add(item));
+    return this;
+  }
+  /**
+   * Search the index for the given term
+   *
+   * @param documents - The list of documents to search
+   * @param searchTerm - The term to search for
+   * @returns The list of items that match the search term
+   */
+  search(documents, searchTerm) {
+    const res = this.index.search(searchTerm);
+    const ids = (0, import_utils.getResultIds)(res);
+    return (0, import_utils.findItemsByIds)(
+      documents,
+      ids,
+      this.idKey
+    );
+  }
+  /**
+   * Asynchronously search the index for the given term
+   *
+   * @param documents - The list of documents to search
+   * @param searchTerm - The term to search for
+   * @returns The list of items that match the search term
+   */
+  async searchAsync(documents, searchTerm) {
+    return this.index.searchAsync(searchTerm).then((res) => {
+      return (0, import_utils.getResultIds)(res);
+    }).then(
+      (res) => (0, import_utils.findItemsByIds)(documents, res, this.idKey)
+    );
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  SearchIndex
+});
+//# sourceMappingURL=search-index.js.map

package/cjs/search/search-index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/search/search-index.ts"],
+  "sourcesContent": ["import { Document } from 'flexsearch';\nimport type { SearchIndexOptions } from '../types';\nimport { encodeGreek } from './lang/gr/encoder';\nimport { findItemsByIds, getAllItemKeys, getResultIds } from './utils';\n\n/**\n * Wrapper class around third party index and search library\n *\n * @typeParam T - The type of the data that will be indexed\n */\nexport class SearchIndex<T extends Record<string, any>> {\n  /**\n   * Instance of the third party library's index\n   */\n  private index: Document<T>;\n  private idKey: string;\n\n  constructor(items: T[], options?: SearchIndexOptions<T>) {\n    this.idKey = 'id';\n    if (options && options.idKey) {\n      this.idKey = options.idKey.replace('.', ':');\n    } else if (!(items[0] && 'id' in items[0])) {\n      items = items.map((item, index) => ({ ...item, id: index }));\n    }\n\n    let fields: string[] = [];\n    if (options && options.fields) {\n      fields = options.fields;\n    } else if (items[0]) {\n      fields = getAllItemKeys(items[0]);\n    }\n    fields = fields\n      .filter((field) => field !== this.idKey)\n      .map((field) => field.replace('.', ':'));\n\n    this.index = new Document<T>({\n      document: {\n        id: this.idKey,\n        index: fields,\n      },\n      tokenize: 'forward',\n      worker: options?.enableWorker,\n      encode: encodeGreek,\n    });\n\n    this.addAll(items);\n  }\n\n  /**\n   * Add an item to the index\n   *\n   * @param item - The item to add to the index\n   */\n  public add(item: T) {\n    this.index.add(item);\n    return this;\n  }\n\n  /**\n   * Add multiple items to the index\n   *\n   * @param items - The list of items to add to the index\n   */\n  public addAll(items: T[]) {\n    items.forEach((item) => this.index.add(item));\n    return this;\n  }\n\n  /**\n   * Search the index for the given term\n   *\n   * @param documents - The list of documents to search\n   * @param searchTerm - The term to search for\n   * @returns The list of items that match the search term\n   */\n  public search(documents: T[], searchTerm: string) {\n    const res = this.index.search(searchTerm);\n    const ids = getResultIds(res);\n    return findItemsByIds(\n      documents,\n      ids,\n      this.idKey as Extract<keyof T, string>\n    );\n  }\n\n  /**\n   * Asynchronously search the index for the given term\n   *\n   * @param documents - The list of documents to search\n   * @param searchTerm - The term to search for\n   * @returns The list of items that match the search term\n   */\n  public async searchAsync(documents: T[], searchTerm: string) {\n    return this.index\n      .searchAsync(searchTerm)\n      .then((res) => {\n        return getResultIds(res);\n      })\n      .then((res) =>\n        findItemsByIds(documents, res, this.idKey as Extract<keyof T, string>)\n      );\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,wBAAyB;AAEzB,qBAA4B;AAC5B,mBAA6D;AAOtD,MAAM,YAA2C;AAAA,EAOtD,YAAY,OAAY,SAAiC;AACvD,SAAK,QAAQ;AACb,QAAI,WAAW,QAAQ,OAAO;AAC5B,WAAK,QAAQ,QAAQ,MAAM,QAAQ,KAAK,GAAG;AAAA,IAC7C,WAAW,EAAE,MAAM,CAAC,KAAK,QAAQ,MAAM,CAAC,IAAI;AAC1C,cAAQ,MAAM,IAAI,CAAC,MAAM,WAAW,EAAE,GAAG,MAAM,IAAI,MAAM,EAAE;AAAA,IAC7D;AAEA,QAAI,SAAmB,CAAC;AACxB,QAAI,WAAW,QAAQ,QAAQ;AAC7B,eAAS,QAAQ;AAAA,IACnB,WAAW,MAAM,CAAC,GAAG;AACnB,mBAAS,6BAAe,MAAM,CAAC,CAAC;AAAA,IAClC;AACA,aAAS,OACN,OAAO,CAAC,UAAU,UAAU,KAAK,KAAK,EACtC,IAAI,CAAC,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC;AAEzC,SAAK,QAAQ,IAAI,2BAAY;AAAA,MAC3B,UAAU;AAAA,QACR,IAAI,KAAK;AAAA,QACT,OAAO;AAAA,MACT;AAAA,MACA,UAAU;AAAA,MACV,QAAQ,SAAS;AAAA,MACjB,QAAQ;AAAA,IACV,CAAC;AAED,SAAK,OAAO,KAAK;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,IAAI,MAAS;AAClB,SAAK,MAAM,IAAI,IAAI;AACnB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOO,OAAO,OAAY;AACxB,UAAM,QAAQ,CAAC,SAAS,KAAK,MAAM,IAAI,IAAI,CAAC;AAC5C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASO,OAAO,WAAgB,YAAoB;AAChD,UAAM,MAAM,KAAK,MAAM,OAAO,UAAU;AACxC,UAAM,UAAM,2BAAa,GAAG;AAC5B,eAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,KAAK;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAa,YAAY,WAAgB,YAAoB;AAC3D,WAAO,KAAK,MACT,YAAY,UAAU,EACtB,KAAK,CAAC,QAAQ;AACb,iBAAO,2BAAa,GAAG;AAAA,IACzB,CAAC,EACA;AAAA,MAAK,CAAC,YACL,6BAAe,WAAW,KAAK,KAAK,KAAiC;AAAA,IACvE;AAAA,EACJ;AACF;",
+  "names": []
+}

package/cjs/search/utils/index.js

@@ -1,79 +1,56 @@
 "use strict";
-
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-Object.defineProperty(exports, "__esModule", {
-  value: true
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+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 __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var utils_exports = {};
+__export(utils_exports, {
+  findItemsByIds: () => findItemsByIds,
+  getAllItemKeys: () => getAllItemKeys,
+  getResultIds: () => getResultIds
 });
-exports.findItemsByIds = findItemsByIds;
-exports.getAllItemKeys = getAllItemKeys;
-exports.getResultIds = getResultIds;
-var _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof"));
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
-/**
- * Extracts the unique item IDs from the result set
- *
- * @param result - The result set to extract the IDs from
- */
+module.exports = __toCommonJS(utils_exports);
 function getResultIds(result) {
-  var set = new Set();
-  result.forEach(function (item) {
-    item.result.forEach(function (id) {
-      return set.add(id);
-    });
+  const set = /* @__PURE__ */ new Set();
+  result.forEach((item) => {
+    item.result.forEach((id) => set.add(id));
   });
   return Array.from(set);
 }
-
-/**
- * Get the items from the list that match the given IDs
- *
- * @param items - The list of items to search through
- * @param ids - The list of IDs to search for
- * @param idKey - The key to use to find the IDs in the items
- */
 function findItemsByIds(items, ids, idKey) {
-  return items.filter(function (item) {
-    return item && ids.includes(getValueFromNestedKey(item, idKey));
-  });
+  return items.filter(
+    (item) => item && ids.includes(getValueFromNestedKey(item, idKey))
+  );
 }
 function getValueFromNestedKey(object, nestedKey) {
-  var keys = nestedKey.split(':');
-  var result = object;
-  var _iterator = _createForOfIteratorHelper(keys),
-    _step;
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var keySegment = _step.value;
-      if (result.hasOwnProperty(keySegment)) {
-        result = result[keySegment];
-      }
+  const keys = nestedKey.split(":");
+  let result = object;
+  for (const keySegment of keys) {
+    if (result.hasOwnProperty(keySegment)) {
+      result = result[keySegment];
     }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
   }
   return result;
 }
-
-/**
- * Recursively get all the keys from an object
- *
- * The keys are returned in the format `parentKey.childKey` for nested objects
- * and `key` for top level objects (objects that are not nested inside another object).
- *
- * @param object - The item to get the keys from
- * @param parentKey - The parent key to which the current key should be appended
- */
-function getAllItemKeys(object) {
-  var parentKey = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
-  var keys = [];
-  for (var key in object) {
+function getAllItemKeys(object, parentKey = "") {
+  let keys = [];
+  for (const key in object) {
     if (object.hasOwnProperty(key)) {
-      var currentKey = parentKey ? "".concat(parentKey, ".").concat(key) : key;
-      if ((0, _typeof2["default"])(object[key]) === 'object' && object[key] !== null) {
+      const currentKey = parentKey ? `${parentKey}.${key}` : key;
+      if (typeof object[key] === "object" && object[key] !== null) {
         keys = keys.concat(getAllItemKeys(object[key], currentKey));
       } else {
         keys.push(currentKey);
@@ -81,4 +58,11 @@ function getAllItemKeys(object) {
     }
   }
   return keys;
-}
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  findItemsByIds,
+  getAllItemKeys,
+  getResultIds
+});
+//# sourceMappingURL=utils.js.map

package/cjs/search/utils.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/search/utils.ts"],
+  "sourcesContent": ["import { SimpleDocumentSearchResultSetUnit } from 'flexsearch';\n\n/**\n * Extracts the unique item IDs from the result set\n *\n * @param result - The result set to extract the IDs from\n */\nexport function getResultIds(result: SimpleDocumentSearchResultSetUnit[]) {\n  const set = new Set<number | string>();\n  result.forEach((item) => {\n    item.result.forEach((id) => set.add(id));\n  });\n  return Array.from(set);\n}\n\n/**\n * Get the items from the list that match the given IDs\n *\n * @param items - The list of items to search through\n * @param ids - The list of IDs to search for\n * @param idKey - The key to use to find the IDs in the items\n */\nexport function findItemsByIds<T extends Record<string, any>>(\n  items: T[],\n  ids: (string | number)[],\n  idKey: Extract<keyof T, string>\n) {\n  return items.filter(\n    (item) => item && ids.includes(getValueFromNestedKey(item, idKey))\n  );\n}\n\nfunction getValueFromNestedKey(object: Record<string, any>, nestedKey: string) {\n  const keys = nestedKey.split(':');\n\n  let result = object;\n  for (const keySegment of keys) {\n    if (result.hasOwnProperty(keySegment)) {\n      result = result[keySegment];\n    }\n  }\n  return (result as unknown) as string;\n}\n\n/**\n * Recursively get all the keys from an object\n *\n * The keys are returned in the format `parentKey.childKey` for nested objects\n * and `key` for top level objects (objects that are not nested inside another object).\n *\n * @param object - The item to get the keys from\n * @param parentKey - The parent key to which the current key should be appended\n */\nexport function getAllItemKeys(\n  object: Record<string, any>,\n  parentKey: string = ''\n): string[] {\n  let keys: string[] = [];\n  for (const key in object) {\n    if (object.hasOwnProperty(key)) {\n      const currentKey = parentKey ? `${parentKey}.${key}` : key;\n\n      if (typeof object[key] === 'object' && object[key] !== null) {\n        keys = keys.concat(getAllItemKeys(object[key], currentKey));\n      } else {\n        keys.push(currentKey);\n      }\n    }\n  }\n\n  return keys;\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAOO,SAAS,aAAa,QAA6C;AACxE,QAAM,MAAM,oBAAI,IAAqB;AACrC,SAAO,QAAQ,CAAC,SAAS;AACvB,SAAK,OAAO,QAAQ,CAAC,OAAO,IAAI,IAAI,EAAE,CAAC;AAAA,EACzC,CAAC;AACD,SAAO,MAAM,KAAK,GAAG;AACvB;AASO,SAAS,eACd,OACA,KACA,OACA;AACA,SAAO,MAAM;AAAA,IACX,CAAC,SAAS,QAAQ,IAAI,SAAS,sBAAsB,MAAM,KAAK,CAAC;AAAA,EACnE;AACF;AAEA,SAAS,sBAAsB,QAA6B,WAAmB;AAC7E,QAAM,OAAO,UAAU,MAAM,GAAG;AAEhC,MAAI,SAAS;AACb,aAAW,cAAc,MAAM;AAC7B,QAAI,OAAO,eAAe,UAAU,GAAG;AACrC,eAAS,OAAO,UAAU;AAAA,IAC5B;AAAA,EACF;AACA,SAAQ;AACV;AAWO,SAAS,eACd,QACA,YAAoB,IACV;AACV,MAAI,OAAiB,CAAC;AACtB,aAAW,OAAO,QAAQ;AACxB,QAAI,OAAO,eAAe,GAAG,GAAG;AAC9B,YAAM,aAAa,YAAY,GAAG,SAAS,IAAI,GAAG,KAAK;AAEvD,UAAI,OAAO,OAAO,GAAG,MAAM,YAAY,OAAO,GAAG,MAAM,MAAM;AAC3D,eAAO,KAAK,OAAO,eAAe,OAAO,GAAG,GAAG,UAAU,CAAC;AAAA,MAC5D,OAAO;AACL,aAAK,KAAK,UAAU;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;",
+  "names": []
+}

package/cjs/types/index.js

@@ -1,5 +1,17 @@
 "use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+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 __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var types_exports = {};
+module.exports = __toCommonJS(types_exports);
+//# sourceMappingURL=types.js.map

package/cjs/types.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/types.ts"],
+  "sourcesContent": ["/**\n * Options for configuring the useSearch hook\n */\nexport interface UseSearchOptions<T extends Record<string, any>> {\n  indexing: SearchIndexOptions<T>;\n}\n\n/**\n * Options for configuring the search index\n *\n * @typeParam T - The type of the data that will be indexed\n */\nexport interface SearchIndexOptions<T> {\n  /**\n   * Describes where to find the unique ID for each item in the data\n   *\n   * This can also be a nested key, e.g. `address.street`. If not specified, the search index will\n   * create an 'id' field on each item, with the value being the index of the item in the array.\n   */\n  idKey?: NestedKeyOf<T>;\n  /**\n   * List of fields to index\n   *\n   * Contains a list of fields from the document, that should be indexed. The fields can be nested.\n   *\n   * @example Using nested keys\n   * ```\n   * {\n   *   id: 1,\n   *   name: 'John',\n   *   address: {\n   *     street: '123 Main St',\n   *     city: 'New York'\n   *   }\n   * }\n   * ```\n   * To search against the `street` key, add `address.street` to the fields array.\n   */\n  fields?: NestedKeyOf<T>[];\n  /**\n   * Whether to use a web worker for indexing\n   */\n  enableWorker?: boolean;\n}\n\n/**\n * Any key of an object that has nested objects.\n *\n * This utility type is used to get all the primitive keys of an object, including the keys of any nested objects.\n *\n * @typeParam ObjectType - The type of the object to get the keys of\n */\nexport type NestedKeyOf<T> = T extends Primitive\n  ? never\n  :\n      | (keyof T & string)\n      | { [P in keyof T & string]: DeepSubKeys<T, P> }[keyof T & string];\n\ntype DeepSubKeys<T, P extends keyof T & string> = T[P] extends (infer Inner)[]\n  ? `${P}.${NestedKeyOf<Inner>}`\n  : T[P] extends object\n  ? `${P}.${NestedKeyOf<T[P]>}`\n  : never;\n\ntype Primitive = null | undefined | string | number | boolean | symbol | bigint;\n"],
+  "mappings": ";;;;;;;;;;;;;;AAAA;AAAA;",
+  "names": []
+}

package/hook/index.js

@@ -1,51 +1,28 @@
-import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
-import { useCallback, useMemo, useState } from 'react';
+import { useCallback, useMemo, useState } from "react";
 import SearchIndex from "./search";
-/**
- * Hook for searching through a list of documents
- *
- * Returns a list of documents that match the search query.
- * If no query is provided, it returns the original list of documents.
- *
- * @param documents - The list of documents to search through
- * @param options - Options for configuring the search index
- * @param query - The search query
- *
- * @typeParam T - The type of the data in the documents list
- */
-export default function useSearch(documents, query, options) {
-  var _useState = useState(false),
-    _useState2 = _slicedToArray(_useState, 2),
-    loading = _useState2[0],
-    setLoading = _useState2[1];
-  var _useState3 = useState(documents),
-    _useState4 = _slicedToArray(_useState3, 2),
-    data = _useState4[0],
-    setData = _useState4[1];
-  var indexing = options === null || options === void 0 ? void 0 : options.indexing;
-  var index = useMemo(function () {
-    return new SearchIndex(documents, indexing);
-  }, [documents, indexing]);
-  var search = useCallback(function () {
+function useSearch(documents, query, options) {
+  const [loading, setLoading] = useState(false);
+  const [data, setData] = useState(documents);
+  const indexing = options?.indexing;
+  const index = useMemo(() => new SearchIndex(documents, indexing), [
+    documents,
+    indexing
+  ]);
+  const search = useCallback(() => {
     if (query) {
       setLoading(true);
-      index.searchAsync(documents, query).then(function (data) {
-        return setData(data);
-      })["finally"](function () {
-        return setLoading(false);
-      });
+      index.searchAsync(documents, query).then((data2) => setData(data2)).finally(() => setLoading(false));
     } else {
       setData(documents);
     }
   }, [query, index, documents]);
-  var reset = useCallback(function () {
+  const reset = useCallback(() => {
     setData(documents);
     setLoading(false);
   }, [documents]);
-  return {
-    data: data,
-    loading: loading,
-    search: search,
-    reset: reset
-  };
-}
+  return { data, loading, search, reset };
+}
+export {
+  useSearch as default
+};
+//# sourceMappingURL=hook.js.map

package/hook.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/hook.ts"],
+  "sourcesContent": ["import { useCallback, useMemo, useState } from 'react';\nimport SearchIndex from './search';\nimport { UseSearchOptions } from './types';\n\n/**\n * Hook for searching through a list of documents\n *\n * Returns a list of documents that match the search query.\n * If no query is provided, it returns the original list of documents.\n *\n * @param documents - The list of documents to search through\n * @param options - Options for configuring the search index\n * @param query - The search query\n *\n * @typeParam T - The type of the data in the documents list\n */\nexport default function useSearch<T extends Record<string, any>>(\n  documents: T[],\n  query?: string,\n  options?: UseSearchOptions<T>\n) {\n  const [loading, setLoading] = useState(false);\n  const [data, setData] = useState(documents);\n\n  const indexing = options?.indexing;\n\n  const index = useMemo(() => new SearchIndex(documents, indexing), [\n    documents,\n    indexing,\n  ]);\n\n  const search = useCallback(() => {\n    if (query) {\n      setLoading(true);\n      index\n        .searchAsync(documents, query)\n        .then((data) => setData(data))\n        .finally(() => setLoading(false));\n    } else {\n      setData(documents);\n    }\n  }, [query, index, documents]);\n\n  const reset = useCallback(() => {\n    setData(documents);\n    setLoading(false);\n  }, [documents]);\n\n  return { data, loading, search, reset };\n}\n"],
+  "mappings": "AAAA,SAAS,aAAa,SAAS,gBAAgB;AAC/C,OAAO,iBAAiB;AAeT,SAAR,UACL,WACA,OACA,SACA;AACA,QAAM,CAAC,SAAS,UAAU,IAAI,SAAS,KAAK;AAC5C,QAAM,CAAC,MAAM,OAAO,IAAI,SAAS,SAAS;AAE1C,QAAM,WAAW,SAAS;AAE1B,QAAM,QAAQ,QAAQ,MAAM,IAAI,YAAY,WAAW,QAAQ,GAAG;AAAA,IAChE;AAAA,IACA;AAAA,EACF,CAAC;AAED,QAAM,SAAS,YAAY,MAAM;AAC/B,QAAI,OAAO;AACT,iBAAW,IAAI;AACf,YACG,YAAY,WAAW,KAAK,EAC5B,KAAK,CAACA,UAAS,QAAQA,KAAI,CAAC,EAC5B,QAAQ,MAAM,WAAW,KAAK,CAAC;AAAA,IACpC,OAAO;AACL,cAAQ,SAAS;AAAA,IACnB;AAAA,EACF,GAAG,CAAC,OAAO,OAAO,SAAS,CAAC;AAE5B,QAAM,QAAQ,YAAY,MAAM;AAC9B,YAAQ,SAAS;AACjB,eAAW,KAAK;AAAA,EAClB,GAAG,CAAC,SAAS,CAAC;AAEd,SAAO,EAAE,MAAM,SAAS,QAAQ,MAAM;AACxC;",
+  "names": ["data"]
+}

package/index.js

@@ -1,8 +1,12 @@
-/** @license Digigov v1.1.3-rc.16
+/** @license Digigov v1.2.0-85c27c19
  *
  * This source code is licensed under the BSD-2-Clause license found in the
  * LICENSE file in the root directory of this source tree.
  */
 import useSearch from "./hook";
-export default useSearch;
-export * from "./search";
+var src_default = useSearch;
+export * from "./search";
+export {
+  src_default as default
+};
+//# sourceMappingURL=index.js.map

package/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/index.ts"],
+  "sourcesContent": ["import useSearch from './hook';\n\nexport default useSearch;\nexport * from './search';\n"],
+  "mappings": "AAAA,OAAO,eAAe;AAEtB,IAAO,cAAQ;AACf,cAAc;",
+  "names": []
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@digigov/text-search",
-  "version": "1.1.3-rc.16",
+  "version": "1.2.0-85c27c19",
   "description": "@digigov text-search",
   "author": "GRNET Developers <devs@lists.grnet.gr>",
   "license": "BSD-2-Clause",
@@ -14,8 +14,8 @@
     "flexsearch": "0.7.31"
   },
   "peerDependencies": {
-    "react": "^16.8.0 || ^17.0.0",
-    "react-dom": "^16.8.0 || ^17.0.0"
+    "react": ">=16.8.0 <19.0.0",
+    "react-dom": ">=16.8.0 <19.0.0"
   },
   "typings": "./index.d.ts"
 }

package/search/index.js

@@ -1,2 +1,6 @@
 import { SearchIndex } from "./search-index";
-export default SearchIndex;
+var search_default = SearchIndex;
+export {
+  search_default as default
+};
+//# sourceMappingURL=index.js.map

package/search/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/search/index.ts"],
+  "sourcesContent": ["import { SearchIndex } from './search-index';\n\nexport default SearchIndex;\n"],
+  "mappings": "AAAA,SAAS,mBAAmB;AAE5B,IAAO,iBAAQ;",
+  "names": []
+}