cry-search 2.1.0 → 2.2.0

package/CLAUDE.md

@@ -387,6 +387,7 @@ src/
 │   │   ├── searchAndRank.ts           # Wrapper w/ exactKeysFn boost + fallback
 │   │   ├── scoring.ts                 # scoreOne, scoreOrderAndPresence, scoreBag
 │   │   ├── syncSearchArrayMetadata.ts
+│   │   ├── matchMany.ts                # Mass matching (matchMany / matchManySync)
 │   │   └── AugmentedMetadata.ts
 │   └── SearchUniverse.ts              # Multi-collection manager
 ├── utils/
@@ -399,11 +400,29 @@ src/
 │   ├── sanitiseString.ts
 │   ├── tokenize.ts
 │   └── compareTokenized.ts          # Jaccard token-set similarity (0..1)
+├── vet/                               # Domain extension, published as `cry-search/vet`
+│   ├── index.ts                       # Public API of the subpath
+│   ├── spec.ts                        # vetArtikelSpec / vetQueryOpts (field normalizers)
+│   ├── normalizatorji.ts              # Units, decimals, brands, quantities, sizes, species
+│   ├── ocena.ts                       # oceniPar: score + acceptance rule + reason
+│   ├── uparjanje.ts                   # pripraviVetIndeks, upariArtikle/upariVse(Sync)
+│   └── data/                          # Generated tables (enote.ts, znamke.gen.ts)
 ├── types/
 │   └── index.ts
 └── index.ts                           # Public API
 ```
 
+The core stays domain-free. It only exposes narrow seams for domain modules:
+`SearchableObjectSpec.valueNormalizers` (index side, may return `{ text, classes }`),
+`SearchOpts.queryNormalizers` + `normalizeQueryWithOpts` (query side) and `matchMany` /
+`matchManySync` (mass matching with optional domain `rank`/`accept`). Soft domain data lives
+in `metadata.classes` (never in the token stream, so retrieval speed is unaffected) and is
+read back with `itemClasses(metadata, id)`. Domain rules belong in `src/vet/` (see `VET.md`).
+
+Build note: `cry-vetzdravila` is an optional peer dependency and is marked external in the
+bundles (`bun build --external cry-vetzdravila`), so core consumers do not pull in its
+`xlsx`/`pdfjs-dist` dependencies.
+
 ## Coding rules
 
 1. each function is in separate file
@@ -415,6 +434,13 @@ src/
 
 ## Testing
 
+0. Quality first: `bun test` — thresholds for `cry-search/vet` live in
+   `test/vet/pari.test.ts` (recall@1/3, precision@1 per group) and the golden output in
+   `test/vet/zlati-gw.json`.
+0b. Speed separately: `bun run bench` (not part of `bun test`, not in CI) measures index build
+   and mass-pairing throughput against the stored baseline `test/vet/bench-osnova.json` and
+   fails only when latency grows > 20 % or `uspeh@1` drops > 2 pp. Refresh the baseline
+   deliberately with `bun run bench --zapisi-osnovo`.
 1. Large real-life datasets are in ./test-data (arikli, stranke, pacienti).
 2. tests are in ./test
 3. tests per implementation are in ./test/(IMPLEMENTATION)

package/README.md

@@ -532,6 +532,19 @@ See [CLAUDE.md](./CLAUDE.md) for the complete technical specification including:
 
 See [LICENSE.md](./LICENSE.md) for license terms.
 
+### Measuring performance
+
+Quality thresholds live in the test suite; performance is measured separately (it depends on
+machine load, so it must not fail the quality tests):
+
+```bash
+bun run bench                   # measure and compare against test/vet/bench-osnova.json
+bun run bench --zapisi-osnovo   # deliberately refresh the baseline
+```
+
+The bench fails only when latency grows by more than 20 % or `uspeh@1` drops by more than
+2 percentage points.
+
 ## Domain extensions and the `cry-search/vet` entry point
 
 The core exposes a narrow seam for domain logic (all optional, no behaviour change when unused):
@@ -545,6 +558,19 @@ The core exposes a narrow seam for domain logic (all optional, no behaviour chan
   collection as queries; asynchronous iterator (chunked), top-K candidates per item with scores,
   optional `samoEnolicno` (greedy 1:1), optional domain `rank`/`accept`, and
   `alternativnePoizvedbe` (retry with a narrowed query).
+- `matchManySync(prepared, queries, opts)` — the same in one shot, for callers whose API is not
+  async (no I/O happen in the hot path, so the sync variant is equivalent).
+
+The veterinary module also ships a **bilingual SI↔EN lexicon** (`data/prevodi.ts`, normalizer
+`prevodiNormalizator`): English catalogue names (`Monge dog rabbit rice&potatoes 2,5kg`) pair with
+Slovenian Pantheon names (`MONGE DOG ADULT zajec, riž, krompir 2,5kg`). The same table is applied
+to index values and queries (symmetry is required — one-sided translation makes results worse),
+brand names are never translated, and marketing/connector words (`care`, `for`, `with` …) are
+dropped. `razdeljevalciNormalizator` splits `&`/`+`/`/` inside names, and life stages
+(`puppy`/`kitten`/`adult`/`senior`) become the soft class `starost`.
+
+With `vrniNesprejete: true` the domain module keeps candidates that fail the acceptance rule and
+marks them (`sprejeto: false`) instead of dropping them — useful in UIs where the user decides.
 
 A ready-made veterinary implementation ships as a subpath (optional peer dependency on
 `cry-vetzdravila`):

package/dist/common/numeric/matchMany.d.ts

@@ -89,23 +89,21 @@ export interface PreparedCollection<T extends SearchableObject> {
     data: SearchableData<T>;
     metadata: NumericSearchMetadata;
 }
+/**
+ * Masovno uparjanje v enem kosu (sinhrono, brez I/O). Enaki rezultati kot
+ * `matchMany`; uporabno tam, kjer klicoči API ni async (npr. predpomnilnik
+ * gatewaya) ali iteracija po kosih ni potrebna.
+ */
+export declare function matchManySync<T extends SearchableObject, TQuery>(prepared: PreparedCollection<T>, queries: readonly TQuery[], options: MatchManyOptions<T, TQuery>): MatchManyRezultat<T>[];
 /**
  * Masovno uparjanje: indeks ene strani, elementi druge strani kot poizvedbe.
  *
  * Vrne async iterator, ki teče po kosih (`kos`, privzeto 50), tako da rezultat
- * velikega uparjanja (npr. 40k × 25k) ne gre v celoti v pomnilnik. Za vsak
- * element vrne največ `limit` kandidatov nad `minScore`, urejenih padajoče.
+ * velikega uparjanja (npr. 40k × 25k) ne gre v celoti v pomnilnik. Za vsak element
+ * vrne največ `limit` kandidatov, urejenih padajoče po oceni.
  *
- * Uporablja isto iskalno logiko kot `searchAndRank` (retrieval po `metadata.sorted`
- * z AND-ujemanjem + ocena po `metadata.unsorted`), zato so rezultati skladni z
+ * Uporablja isto iskalno logiko kot `searchAndRank`, zato so rezultati skladni z
  * navadnim iskanjem. Domenski modul lahko oceno in sprejem zamenja z `rank`/`accept`.
- *
- * @example
- * ```typescript
- * for await (const kos of matchMany(prepared, levi, { queryOf: (a) => a.naziv })) {
- *   console.log(kos.id, kos.kandidati[0]?.item.naziv);
- * }
- * ```
  */
 export declare function matchMany<T extends SearchableObject, TQuery>(prepared: PreparedCollection<T>, queries: readonly TQuery[], options: MatchManyOptions<T, TQuery>): AsyncGenerator<MatchManyRezultat<T>[], void, void>;
 //# sourceMappingURL=matchMany.d.ts.map

package/dist/common/numeric/matchMany.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"matchMany.d.ts","sourceRoot":"","sources":["../../../src/common/numeric/matchMany.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,EAAE,EACF,eAAe,EACf,qBAAqB,EACrB,cAAc,EACd,gBAAgB,EAChB,UAAU,EACX,MAAM,aAAa,CAAC;AAIrB;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,gBAAgB;IAC3D,EAAE,EAAE,EAAE,CAAC;IACP,IAAI,EAAE,CAAC,CAAC;IACR,wEAAwE;IACxE,KAAK,EAAE,MAAM,CAAC;IACd,mEAAmE;IACnE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CACpC;AAED,0CAA0C;AAC1C,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,gBAAgB;IAC3D,oDAAoD;IACpD,EAAE,EAAE,MAAM,CAAC;IACX,oDAAoD;IACpD,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACxC,6DAA6D;IAC7D,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;CACnC;AAED,sCAAsC;AACtC,MAAM,WAAW,gBAAgB,CAAC,CAAC,SAAS,gBAAgB,EAAE,MAAM;IAClE;;;OAGG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,eAAe,CAAC;IACrD,wFAAwF;IACxF,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;IACjD,iDAAiD;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,uCAAuC;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,uEAAuE;IACvE,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,SAAS,CAAC;IAChD,sEAAsE;IACtE,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,GAAG,SAAS,CAAC;IACzD,uDAAuD;IACvD,IAAI,CAAC,EAAE,CACL,QAAQ,EAAE;QAAE,EAAE,EAAE,EAAE,CAAC;QAAC,IAAI,EAAE,CAAC,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,EACjE,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,KAC5D,MAAM,CAAC;IACZ,qEAAqE;IACrE,MAAM,CAAC,EAAE,CACP,QAAQ,EAAE;QAAE,EAAE,EAAE,EAAE,CAAC;QAAC,IAAI,EAAE,CAAC,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,EACjE,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,KAC5D,OAAO,CAAC;IACb,8EAA8E;IAC9E,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB;;;;;OAKG;IACH,qBAAqB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC;IACjF;;;;OAIG;IACH,0BAA0B,CAAC,EAAE,OAAO,CAAC;CACtC;AAED,2DAA2D;AAC3D,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,gBAAgB;IAC5D,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACxB,QAAQ,EAAE,qBAAqB,CAAC;CACjC;AAeD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAuB,SAAS,CAAC,CAAC,SAAS,gBAAgB,EAAE,MAAM,EACjE,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAC/B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,GACnC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CA4FpD"}
+{"version":3,"file":"matchMany.d.ts","sourceRoot":"","sources":["../../../src/common/numeric/matchMany.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,EAAE,EACF,eAAe,EACf,qBAAqB,EACrB,cAAc,EACd,gBAAgB,EAChB,UAAU,EACX,MAAM,aAAa,CAAC;AAIrB;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,gBAAgB;IAC3D,EAAE,EAAE,EAAE,CAAC;IACP,IAAI,EAAE,CAAC,CAAC;IACR,wEAAwE;IACxE,KAAK,EAAE,MAAM,CAAC;IACd,mEAAmE;IACnE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CACpC;AAED,0CAA0C;AAC1C,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,gBAAgB;IAC3D,oDAAoD;IACpD,EAAE,EAAE,MAAM,CAAC;IACX,oDAAoD;IACpD,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACxC,6DAA6D;IAC7D,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;CACnC;AAED,sCAAsC;AACtC,MAAM,WAAW,gBAAgB,CAAC,CAAC,SAAS,gBAAgB,EAAE,MAAM;IAClE;;;OAGG;IACH,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,eAAe,CAAC;IACrD,wFAAwF;IACxF,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;IACjD,iDAAiD;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,uCAAuC;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,kEAAkE;IAClE,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,uEAAuE;IACvE,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,SAAS,CAAC;IAChD,sEAAsE;IACtE,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,MAAM,EAAE,GAAG,SAAS,CAAC;IACzD,uDAAuD;IACvD,IAAI,CAAC,EAAE,CACL,QAAQ,EAAE;QAAE,EAAE,EAAE,EAAE,CAAC;QAAC,IAAI,EAAE,CAAC,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,EACjE,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,KAC5D,MAAM,CAAC;IACZ,qEAAqE;IACrE,MAAM,CAAC,EAAE,CACP,QAAQ,EAAE;QAAE,EAAE,EAAE,EAAE,CAAC;QAAC,IAAI,EAAE,CAAC,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,EACjE,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;KAAE,KAC5D,OAAO,CAAC;IACb,8EAA8E;IAC9E,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB;;;;;OAKG;IACH,qBAAqB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC;IACjF;;;;OAIG;IACH,0BAA0B,CAAC,EAAE,OAAO,CAAC;CACtC;AAED,2DAA2D;AAC3D,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,gBAAgB;IAC5D,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACxB,QAAQ,EAAE,qBAAqB,CAAC;CACjC;AA6HD;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,SAAS,gBAAgB,EAAE,MAAM,EAC9D,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAC/B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,GACnC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAOxB;AAED;;;;;;;;;GASG;AACH,wBAAuB,SAAS,CAAC,CAAC,SAAS,gBAAgB,EAAE,MAAM,EACjE,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAC/B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,GACnC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAYpD"}

package/dist/index.cjs

@@ -70,6 +70,7 @@ __export(exports_src, {
   isDeletedOrBlocked: () => isDeletedOrBlocked,
   itemClasses: () => itemClasses,
   matchMany: () => matchMany,
+  matchManySync: () => matchManySync,
   matchPreparedTokenInSortedList: () => matchPreparedTokenInSortedList,
   matchTokenInSortedListNumeric: () => matchTokenInSortedListNumeric,
   normalizeDates: () => normalizeDates,
@@ -1761,76 +1762,87 @@ function naSezname(classes) {
   }
   return Object.keys(out).length ? out : undefined;
 }
-async function* matchMany(prepared, queries, options) {
-  const { queryOf, idOf, limit = 3, minScore = 0, kos = 50, samoEnolicno, rank, accept, opts } = options;
+function matchOne(prepared, query, indeks, options, porabljeni) {
+  const { queryOf, idOf, limit = 3, minScore = 0, rank, accept, opts } = options;
   const retrievalLimit = options.retrievalLimit ?? Math.max(20, limit * 4);
   const primaryTextOf = options.primaryTextOf ?? ((item) => item["naziv"]);
-  const porabljeni = samoEnolicno ? new Set : undefined;
-  let kosZbirka = [];
-  for (let indeks = 0;indeks < queries.length; indeks++) {
-    const query = queries[indeks];
-    const vhod = queryOf(query);
-    const text = typeof vhod === "string" ? vhod : vhod.text;
-    const queryClasses = typeof vhod === "string" ? undefined : naSezname(vhod.classes);
-    const id = idOf ? idOf(query, indeks) : String(query["_id"] ?? query["id"] ?? indeks);
-    const poisciKandidate = (besedilo, razredi) => {
-      if (!besedilo.trim())
-        return { kandidati: [], zadetkov: 0 };
-      const zadetki = searchAndRankNumeric(besedilo, prepared.data, prepared.metadata, {
-        primaryTextFn: primaryTextOf,
-        ...options.exactKeysOf ? { exactKeysFn: options.exactKeysOf } : {},
-        ...opts ? { opts } : {},
-        limit: retrievalLimit
-      });
-      const poizvedbaZaDomeno = { text: besedilo, ...razredi ? { classes: razredi } : {} };
-      const najdeni = [];
-      for (const zadetek of zadetki) {
-        const classes = itemClasses(prepared.metadata, zadetek.id);
-        const kandidat = {
-          id: zadetek.id,
-          item: zadetek.item,
-          ...classes ? { classes } : {}
-        };
-        if (accept && !accept(kandidat, poizvedbaZaDomeno))
-          continue;
-        const ocena = rank ? rank(kandidat, poizvedbaZaDomeno) : zadetek.score;
-        if (ocena < minScore)
-          continue;
-        if (porabljeni?.has(zadetek.id))
-          continue;
-        najdeni.push({ id: zadetek.id, item: zadetek.item, score: ocena, ...classes ? { classes } : {} });
-      }
-      najdeni.sort((a, b) => {
-        if (b.score !== a.score)
-          return b.score - a.score;
-        return (primaryTextOf(a.item) ?? "").localeCompare(primaryTextOf(b.item) ?? "");
-      });
-      if (najdeni.length > limit)
-        najdeni.length = limit;
-      return { kandidati: najdeni, zadetkov: zadetki.length };
-    };
-    let { kandidati, zadetkov } = poisciKandidate(text, queryClasses);
-    const poskusiAlternative = kandidati.length === 0 && (options.alternativneLeCeNiZadetkov ? zadetkov === 0 : true);
-    if (poskusiAlternative && options.alternativnePoizvedbe) {
-      for (const alternativa of options.alternativnePoizvedbe(query)) {
-        const altBesedilo = typeof alternativa === "string" ? alternativa : alternativa.text;
-        if (!altBesedilo?.trim() || altBesedilo === text)
-          continue;
-        const altRazredi = typeof alternativa === "string" ? undefined : naSezname(alternativa.classes);
-        ({ kandidati } = poisciKandidate(altBesedilo, altRazredi));
-        if (kandidati.length)
-          break;
-      }
-    }
-    if (porabljeni) {
-      for (const kandidat of kandidati)
-        porabljeni.add(kandidat.id);
+  const vhod = queryOf(query);
+  const text = typeof vhod === "string" ? vhod : vhod.text;
+  const queryClasses = typeof vhod === "string" ? undefined : naSezname(vhod.classes);
+  const id = idOf ? idOf(query, indeks) : String(query["_id"] ?? query["id"] ?? indeks);
+  const poisciKandidate = (besedilo, razredi) => {
+    if (!besedilo.trim())
+      return { kandidati: [], zadetkov: 0 };
+    const zadetki = searchAndRankNumeric(besedilo, prepared.data, prepared.metadata, {
+      primaryTextFn: primaryTextOf,
+      ...options.exactKeysOf ? { exactKeysFn: options.exactKeysOf } : {},
+      ...opts ? { opts } : {},
+      limit: retrievalLimit
+    });
+    const poizvedbaZaDomeno = { text: besedilo, ...razredi ? { classes: razredi } : {} };
+    const najdeni = [];
+    for (const zadetek of zadetki) {
+      const classes = itemClasses(prepared.metadata, zadetek.id);
+      const kandidat = {
+        id: zadetek.id,
+        item: zadetek.item,
+        ...classes ? { classes } : {}
+      };
+      if (accept && !accept(kandidat, poizvedbaZaDomeno))
+        continue;
+      const ocena = rank ? rank(kandidat, poizvedbaZaDomeno) : zadetek.score;
+      if (ocena < minScore)
+        continue;
+      if (porabljeni?.has(zadetek.id))
+        continue;
+      najdeni.push({ id: zadetek.id, item: zadetek.item, score: ocena, ...classes ? { classes } : {} });
     }
-    kosZbirka.push({
-      id,
-      ...queryClasses ? { queryClasses } : {},
-      kandidati
+    najdeni.sort((a, b) => {
+      if (b.score !== a.score)
+        return b.score - a.score;
+      return (primaryTextOf(a.item) ?? "").localeCompare(primaryTextOf(b.item) ?? "");
     });
+    if (najdeni.length > limit)
+      najdeni.length = limit;
+    return { kandidati: najdeni, zadetkov: zadetki.length };
+  };
+  let { kandidati, zadetkov } = poisciKandidate(text, queryClasses);
+  const poskusiAlternative = kandidati.length === 0 && (options.alternativneLeCeNiZadetkov ? zadetkov === 0 : true);
+  if (poskusiAlternative && options.alternativnePoizvedbe) {
+    for (const alternativa of options.alternativnePoizvedbe(query)) {
+      const altBesedilo = typeof alternativa === "string" ? alternativa : alternativa.text;
+      if (!altBesedilo?.trim() || altBesedilo === text)
+        continue;
+      const altRazredi = typeof alternativa === "string" ? undefined : naSezname(alternativa.classes);
+      ({ kandidati } = poisciKandidate(altBesedilo, altRazredi));
+      if (kandidati.length)
+        break;
+    }
+  }
+  if (porabljeni) {
+    for (const kandidat of kandidati)
+      porabljeni.add(kandidat.id);
+  }
+  return {
+    id,
+    ...queryClasses ? { queryClasses } : {},
+    kandidati
+  };
+}
+function matchManySync(prepared, queries, options) {
+  const porabljeni = options.samoEnolicno ? new Set : undefined;
+  const izhod = new Array(queries.length);
+  for (let indeks = 0;indeks < queries.length; indeks++) {
+    izhod[indeks] = matchOne(prepared, queries[indeks], indeks, options, porabljeni);
+  }
+  return izhod;
+}
+async function* matchMany(prepared, queries, options) {
+  const kos = options.kos ?? 50;
+  const porabljeni = options.samoEnolicno ? new Set : undefined;
+  let kosZbirka = [];
+  for (let indeks = 0;indeks < queries.length; indeks++) {
+    kosZbirka.push(matchOne(prepared, queries[indeks], indeks, options, porabljeni));
     if (kosZbirka.length >= kos) {
       yield kosZbirka;
       kosZbirka = [];

package/dist/index.d.cts

@@ -24,7 +24,7 @@ export { findInLinkedArraysNumeric, findInLinkedArraysSimpleNumeric, } from './c
 export { AugmentedMetadata } from './common/numeric/AugmentedMetadata';
 export { syncSearchArrayMetadataNumeric as syncSearchArrayMetadata, syncSearchArrayMetadataNumericWithPrevious as syncSearchArrayMetadataWithPrevious, } from './common/numeric/syncSearchArrayMetadata';
 export { normalizeQueryWithOpts } from './common/numeric/prepareQueryVariants';
-export { matchMany, type MatchManyKandidat, type MatchManyOptions, type MatchManyRezultat, type PreparedCollection, } from './common/numeric/matchMany';
+export { matchMany, matchManySync, type MatchManyKandidat, type MatchManyOptions, type MatchManyRezultat, type PreparedCollection, } from './common/numeric/matchMany';
 export { upsertPrimaryItemNumeric as upsertPrimaryItem, removePrimaryItemNumeric as removePrimaryItem, upsertLinkedItemNumeric as upsertLinkedItem, removeLinkedItemNumeric as removeLinkedItem, syncLinkedItemsForPrimaryNumeric as syncLinkedItemsForPrimary, } from './common/numeric/updateSearchLinkedMetadata';
 export { matchTokenInSortedListNumeric, allTokensMatchNumeric, binarySearchUint32, prepareQueryTokens, matchPreparedTokenInSortedList, allPreparedTokensMatch, type PreparedQueryToken, } from './utils/matchTokenNumeric';
 export { searchAndRankNumeric as searchAndRank, searchAndRankNumeric, scoreOne, scoreOrderAndPresence, scoreBag, orderedTokenize, type ScoredResult, type SearchAndRankOptions, type OrderAndPresenceWeights, } from './common/numeric/searchAndRank';

package/dist/index.d.ts

@@ -24,7 +24,7 @@ export { findInLinkedArraysNumeric, findInLinkedArraysSimpleNumeric, } from './c
 export { AugmentedMetadata } from './common/numeric/AugmentedMetadata';
 export { syncSearchArrayMetadataNumeric as syncSearchArrayMetadata, syncSearchArrayMetadataNumericWithPrevious as syncSearchArrayMetadataWithPrevious, } from './common/numeric/syncSearchArrayMetadata';
 export { normalizeQueryWithOpts } from './common/numeric/prepareQueryVariants';
-export { matchMany, type MatchManyKandidat, type MatchManyOptions, type MatchManyRezultat, type PreparedCollection, } from './common/numeric/matchMany';
+export { matchMany, matchManySync, type MatchManyKandidat, type MatchManyOptions, type MatchManyRezultat, type PreparedCollection, } from './common/numeric/matchMany';
 export { upsertPrimaryItemNumeric as upsertPrimaryItem, removePrimaryItemNumeric as removePrimaryItem, upsertLinkedItemNumeric as upsertLinkedItem, removeLinkedItemNumeric as removeLinkedItem, syncLinkedItemsForPrimaryNumeric as syncLinkedItemsForPrimary, } from './common/numeric/updateSearchLinkedMetadata';
 export { matchTokenInSortedListNumeric, allTokensMatchNumeric, binarySearchUint32, prepareQueryTokens, matchPreparedTokenInSortedList, allPreparedTokensMatch, type PreparedQueryToken, } from './utils/matchTokenNumeric';
 export { searchAndRankNumeric as searchAndRank, searchAndRankNumeric, scoreOne, scoreOrderAndPresence, scoreBag, orderedTokenize, type ScoredResult, type SearchAndRankOptions, type OrderAndPresenceWeights, } from './common/numeric/searchAndRank';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA;;;GAGG;AAKH,YAAY,EAEV,EAAE,EACF,WAAW,EACX,qBAAqB,EACrB,cAAc,EAEd,YAAY,EACZ,sBAAsB,EACtB,qBAAqB,EAErB,gBAAgB,EAChB,SAAS,EACT,eAAe,EACf,oBAAoB,EACpB,oBAAoB,EAEpB,UAAU,EAEV,2BAA2B,EAC3B,kBAAkB,EAClB,0BAA0B,EAE1B,oBAAoB,EAEpB,UAAU,EACV,WAAW,EACX,gBAAgB,EAChB,YAAY,EACZ,6BAA6B,EAE7B,mBAAmB,EACnB,gBAAgB,EAChB,YAAY,EACZ,iBAAiB,GAClB,MAAM,SAAS,CAAC;AAGjB,YAAY,EAAE,qBAAqB,IAAI,cAAc,EAAE,MAAM,SAAS,CAAC;AAGvE,OAAO,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AAGpE,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,SAAS,CAAC;AAKvE,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EACL,sBAAsB,EACtB,2BAA2B,EAC3B,2BAA2B,GAC5B,MAAM,4BAA4B,CAAC;AAKpC,OAAO,EACL,MAAM,EACN,aAAa,EACb,YAAY,EACZ,WAAW,EACX,aAAa,EACb,kBAAkB,EAClB,eAAe,EACf,cAAc,EACd,kBAAkB,GACnB,MAAM,uBAAuB,CAAC;AAO/B,OAAO,EACL,gCAAgC,IAAI,yBAAyB,EAC7D,6BAA6B,IAAI,sBAAsB,EACvD,mBAAmB,EACnB,aAAa,EACb,eAAe,EACf,aAAa,EACb,eAAe,EACf,mBAAmB,EACnB,oBAAoB,EACpB,kBAAkB;AAClB,2DAA2D;AAC3D,WAAW,GACZ,MAAM,4CAA4C,CAAC;AAEpD,OAAO,EACL,iCAAiC,IAAI,0BAA0B,EAC/D,KAAK,mCAAmC,GACzC,MAAM,6CAA6C,CAAC;AAGrD,OAAO,EACL,2BAA2B,IAAI,oBAAoB,EACnD,gCAAgC,IAAI,yBAAyB,EAC7D,+BAA+B,IAAI,wBAAwB,EAC3D,oCAAoC,IAAI,6BAA6B,GACtE,MAAM,uCAAuC,CAAC;AAG/C,OAAO,EACL,4BAA4B,IAAI,YAAY,EAC5C,4BAA4B,IAAI,qBAAqB,EACrD,gCAAgC,IAAI,yBAAyB,EAC7D,qCAAqC,IAAI,qBAAqB,GAC/D,MAAM,+BAA+B,CAAC;AAGvC,OAAO,EACL,yBAAyB,EACzB,+BAA+B,GAChC,MAAM,qCAAqC,CAAC;AAG7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAGvE,OAAO,EACL,8BAA8B,IAAI,uBAAuB,EACzD,0CAA0C,IAAI,mCAAmC,GAClF,MAAM,0CAA0C,CAAC;AAGlD,OAAO,EAAE,sBAAsB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,EACL,SAAS,EACT,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,GACxB,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,wBAAwB,IAAI,iBAAiB,EAC7C,wBAAwB,IAAI,iBAAiB,EAC7C,uBAAuB,IAAI,gBAAgB,EAC3C,uBAAuB,IAAI,gBAAgB,EAC3C,gCAAgC,IAAI,yBAAyB,GAC9D,MAAM,6CAA6C,CAAC;AAGrD,OAAO,EACL,6BAA6B,EAC7B,qBAAqB,EACrB,kBAAkB,EAElB,kBAAkB,EAClB,8BAA8B,EAC9B,sBAAsB,EACtB,KAAK,kBAAkB,GACxB,MAAM,2BAA2B,CAAC;AAGnC,OAAO,EACL,oBAAoB,IAAI,aAAa,EACrC,oBAAoB,EACpB,QAAQ,EACR,qBAAqB,EACrB,QAAQ,EACR,eAAe,EACf,KAAK,YAAY,EACjB,KAAK,oBAAoB,EACzB,KAAK,uBAAuB,GAC7B,MAAM,gCAAgC,CAAC;AAKxC,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA;;;GAGG;AAKH,YAAY,EAEV,EAAE,EACF,WAAW,EACX,qBAAqB,EACrB,cAAc,EAEd,YAAY,EACZ,sBAAsB,EACtB,qBAAqB,EAErB,gBAAgB,EAChB,SAAS,EACT,eAAe,EACf,oBAAoB,EACpB,oBAAoB,EAEpB,UAAU,EAEV,2BAA2B,EAC3B,kBAAkB,EAClB,0BAA0B,EAE1B,oBAAoB,EAEpB,UAAU,EACV,WAAW,EACX,gBAAgB,EAChB,YAAY,EACZ,6BAA6B,EAE7B,mBAAmB,EACnB,gBAAgB,EAChB,YAAY,EACZ,iBAAiB,GAClB,MAAM,SAAS,CAAC;AAGjB,YAAY,EAAE,qBAAqB,IAAI,cAAc,EAAE,MAAM,SAAS,CAAC;AAGvE,OAAO,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AAGpE,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,SAAS,CAAC;AAKvE,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EACL,sBAAsB,EACtB,2BAA2B,EAC3B,2BAA2B,GAC5B,MAAM,4BAA4B,CAAC;AAKpC,OAAO,EACL,MAAM,EACN,aAAa,EACb,YAAY,EACZ,WAAW,EACX,aAAa,EACb,kBAAkB,EAClB,eAAe,EACf,cAAc,EACd,kBAAkB,GACnB,MAAM,uBAAuB,CAAC;AAO/B,OAAO,EACL,gCAAgC,IAAI,yBAAyB,EAC7D,6BAA6B,IAAI,sBAAsB,EACvD,mBAAmB,EACnB,aAAa,EACb,eAAe,EACf,aAAa,EACb,eAAe,EACf,mBAAmB,EACnB,oBAAoB,EACpB,kBAAkB;AAClB,2DAA2D;AAC3D,WAAW,GACZ,MAAM,4CAA4C,CAAC;AAEpD,OAAO,EACL,iCAAiC,IAAI,0BAA0B,EAC/D,KAAK,mCAAmC,GACzC,MAAM,6CAA6C,CAAC;AAGrD,OAAO,EACL,2BAA2B,IAAI,oBAAoB,EACnD,gCAAgC,IAAI,yBAAyB,EAC7D,+BAA+B,IAAI,wBAAwB,EAC3D,oCAAoC,IAAI,6BAA6B,GACtE,MAAM,uCAAuC,CAAC;AAG/C,OAAO,EACL,4BAA4B,IAAI,YAAY,EAC5C,4BAA4B,IAAI,qBAAqB,EACrD,gCAAgC,IAAI,yBAAyB,EAC7D,qCAAqC,IAAI,qBAAqB,GAC/D,MAAM,+BAA+B,CAAC;AAGvC,OAAO,EACL,yBAAyB,EACzB,+BAA+B,GAChC,MAAM,qCAAqC,CAAC;AAG7C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AAGvE,OAAO,EACL,8BAA8B,IAAI,uBAAuB,EACzD,0CAA0C,IAAI,mCAAmC,GAClF,MAAM,0CAA0C,CAAC;AAGlD,OAAO,EAAE,sBAAsB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,EACL,SAAS,EACT,aAAa,EACb,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,GACxB,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,wBAAwB,IAAI,iBAAiB,EAC7C,wBAAwB,IAAI,iBAAiB,EAC7C,uBAAuB,IAAI,gBAAgB,EAC3C,uBAAuB,IAAI,gBAAgB,EAC3C,gCAAgC,IAAI,yBAAyB,GAC9D,MAAM,6CAA6C,CAAC;AAGrD,OAAO,EACL,6BAA6B,EAC7B,qBAAqB,EACrB,kBAAkB,EAElB,kBAAkB,EAClB,8BAA8B,EAC9B,sBAAsB,EACtB,KAAK,kBAAkB,GACxB,MAAM,2BAA2B,CAAC;AAGnC,OAAO,EACL,oBAAoB,IAAI,aAAa,EACrC,oBAAoB,EACpB,QAAQ,EACR,qBAAqB,EACrB,QAAQ,EACR,eAAe,EACf,KAAK,YAAY,EACjB,KAAK,oBAAoB,EACzB,KAAK,uBAAuB,GAC7B,MAAM,gCAAgC,CAAC;AAKxC,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC"}

package/dist/index.js

@@ -1650,76 +1650,87 @@ function naSezname(classes) {
   }
   return Object.keys(out).length ? out : undefined;
 }
-async function* matchMany(prepared, queries, options) {
-  const { queryOf, idOf, limit = 3, minScore = 0, kos = 50, samoEnolicno, rank, accept, opts } = options;
+function matchOne(prepared, query, indeks, options, porabljeni) {
+  const { queryOf, idOf, limit = 3, minScore = 0, rank, accept, opts } = options;
   const retrievalLimit = options.retrievalLimit ?? Math.max(20, limit * 4);
   const primaryTextOf = options.primaryTextOf ?? ((item) => item["naziv"]);
-  const porabljeni = samoEnolicno ? new Set : undefined;
-  let kosZbirka = [];
-  for (let indeks = 0;indeks < queries.length; indeks++) {
-    const query = queries[indeks];
-    const vhod = queryOf(query);
-    const text = typeof vhod === "string" ? vhod : vhod.text;
-    const queryClasses = typeof vhod === "string" ? undefined : naSezname(vhod.classes);
-    const id = idOf ? idOf(query, indeks) : String(query["_id"] ?? query["id"] ?? indeks);
-    const poisciKandidate = (besedilo, razredi) => {
-      if (!besedilo.trim())
-        return { kandidati: [], zadetkov: 0 };
-      const zadetki = searchAndRankNumeric(besedilo, prepared.data, prepared.metadata, {
-        primaryTextFn: primaryTextOf,
-        ...options.exactKeysOf ? { exactKeysFn: options.exactKeysOf } : {},
-        ...opts ? { opts } : {},
-        limit: retrievalLimit
-      });
-      const poizvedbaZaDomeno = { text: besedilo, ...razredi ? { classes: razredi } : {} };
-      const najdeni = [];
-      for (const zadetek of zadetki) {
-        const classes = itemClasses(prepared.metadata, zadetek.id);
-        const kandidat = {
-          id: zadetek.id,
-          item: zadetek.item,
-          ...classes ? { classes } : {}
-        };
-        if (accept && !accept(kandidat, poizvedbaZaDomeno))
-          continue;
-        const ocena = rank ? rank(kandidat, poizvedbaZaDomeno) : zadetek.score;
-        if (ocena < minScore)
-          continue;
-        if (porabljeni?.has(zadetek.id))
-          continue;
-        najdeni.push({ id: zadetek.id, item: zadetek.item, score: ocena, ...classes ? { classes } : {} });
-      }
-      najdeni.sort((a, b) => {
-        if (b.score !== a.score)
-          return b.score - a.score;
-        return (primaryTextOf(a.item) ?? "").localeCompare(primaryTextOf(b.item) ?? "");
-      });
-      if (najdeni.length > limit)
-        najdeni.length = limit;
-      return { kandidati: najdeni, zadetkov: zadetki.length };
-    };
-    let { kandidati, zadetkov } = poisciKandidate(text, queryClasses);
-    const poskusiAlternative = kandidati.length === 0 && (options.alternativneLeCeNiZadetkov ? zadetkov === 0 : true);
-    if (poskusiAlternative && options.alternativnePoizvedbe) {
-      for (const alternativa of options.alternativnePoizvedbe(query)) {
-        const altBesedilo = typeof alternativa === "string" ? alternativa : alternativa.text;
-        if (!altBesedilo?.trim() || altBesedilo === text)
-          continue;
-        const altRazredi = typeof alternativa === "string" ? undefined : naSezname(alternativa.classes);
-        ({ kandidati } = poisciKandidate(altBesedilo, altRazredi));
-        if (kandidati.length)
-          break;
-      }
-    }
-    if (porabljeni) {
-      for (const kandidat of kandidati)
-        porabljeni.add(kandidat.id);
+  const vhod = queryOf(query);
+  const text = typeof vhod === "string" ? vhod : vhod.text;
+  const queryClasses = typeof vhod === "string" ? undefined : naSezname(vhod.classes);
+  const id = idOf ? idOf(query, indeks) : String(query["_id"] ?? query["id"] ?? indeks);
+  const poisciKandidate = (besedilo, razredi) => {
+    if (!besedilo.trim())
+      return { kandidati: [], zadetkov: 0 };
+    const zadetki = searchAndRankNumeric(besedilo, prepared.data, prepared.metadata, {
+      primaryTextFn: primaryTextOf,
+      ...options.exactKeysOf ? { exactKeysFn: options.exactKeysOf } : {},
+      ...opts ? { opts } : {},
+      limit: retrievalLimit
+    });
+    const poizvedbaZaDomeno = { text: besedilo, ...razredi ? { classes: razredi } : {} };
+    const najdeni = [];
+    for (const zadetek of zadetki) {
+      const classes = itemClasses(prepared.metadata, zadetek.id);
+      const kandidat = {
+        id: zadetek.id,
+        item: zadetek.item,
+        ...classes ? { classes } : {}
+      };
+      if (accept && !accept(kandidat, poizvedbaZaDomeno))
+        continue;
+      const ocena = rank ? rank(kandidat, poizvedbaZaDomeno) : zadetek.score;
+      if (ocena < minScore)
+        continue;
+      if (porabljeni?.has(zadetek.id))
+        continue;
+      najdeni.push({ id: zadetek.id, item: zadetek.item, score: ocena, ...classes ? { classes } : {} });
     }
-    kosZbirka.push({
-      id,
-      ...queryClasses ? { queryClasses } : {},
-      kandidati
+    najdeni.sort((a, b) => {
+      if (b.score !== a.score)
+        return b.score - a.score;
+      return (primaryTextOf(a.item) ?? "").localeCompare(primaryTextOf(b.item) ?? "");
     });
+    if (najdeni.length > limit)
+      najdeni.length = limit;
+    return { kandidati: najdeni, zadetkov: zadetki.length };
+  };
+  let { kandidati, zadetkov } = poisciKandidate(text, queryClasses);
+  const poskusiAlternative = kandidati.length === 0 && (options.alternativneLeCeNiZadetkov ? zadetkov === 0 : true);
+  if (poskusiAlternative && options.alternativnePoizvedbe) {
+    for (const alternativa of options.alternativnePoizvedbe(query)) {
+      const altBesedilo = typeof alternativa === "string" ? alternativa : alternativa.text;
+      if (!altBesedilo?.trim() || altBesedilo === text)
+        continue;
+      const altRazredi = typeof alternativa === "string" ? undefined : naSezname(alternativa.classes);
+      ({ kandidati } = poisciKandidate(altBesedilo, altRazredi));
+      if (kandidati.length)
+        break;
+    }
+  }
+  if (porabljeni) {
+    for (const kandidat of kandidati)
+      porabljeni.add(kandidat.id);
+  }
+  return {
+    id,
+    ...queryClasses ? { queryClasses } : {},
+    kandidati
+  };
+}
+function matchManySync(prepared, queries, options) {
+  const porabljeni = options.samoEnolicno ? new Set : undefined;
+  const izhod = new Array(queries.length);
+  for (let indeks = 0;indeks < queries.length; indeks++) {
+    izhod[indeks] = matchOne(prepared, queries[indeks], indeks, options, porabljeni);
+  }
+  return izhod;
+}
+async function* matchMany(prepared, queries, options) {
+  const kos = options.kos ?? 50;
+  const porabljeni = options.samoEnolicno ? new Set : undefined;
+  let kosZbirka = [];
+  for (let indeks = 0;indeks < queries.length; indeks++) {
+    kosZbirka.push(matchOne(prepared, queries[indeks], indeks, options, porabljeni));
     if (kosZbirka.length >= kos) {
       yield kosZbirka;
       kosZbirka = [];
@@ -2352,6 +2363,7 @@ export {
   isDeletedOrBlocked,
   itemClasses,
   matchMany,
+  matchManySync,
   matchPreparedTokenInSortedList,
   matchTokenInSortedListNumeric,
   normalizeDates,

package/dist/vet/data/prevodi.d.ts

@@ -0,0 +1,64 @@
+/**
+ * Dvojezični leksikon SI↔EN za veterinarske nazive artikelov (živila + zdravila).
+ *
+ * Zakaj: isti artikel ima v klik.vetu pogosto **angleški** naziv (vnesen po
+ * dobaviteljskem katalogu), v Pantheonu pa **slovenskega** (ali obratno — pri
+ * znamkah N&D/Hills je pantheonov naziv pogosto v angleščini, klik.vetov pa
+ * slovenski). Brez preslikave iskalnik takih parov NE NAJDE, ker se ključne besede
+ * (`rabbit`/`zajec`, `rice`/`riž`, `codfish`/`polenovka`) ne ujemajo:
+ *
+ *   „Monge dog rabbit rice&potatoes 2,5kg“ ↔ „MONGE DOG ADULT zajec, riž, krompir 2,5kg“
+ *   → brez leksikona 0 kandidatov, z leksikonom pravi par prvi (`sprejeto: true`).
+ *
+ * Pravila (izmerjeno na podatkih tackakp + SI_TACKA, 2026-10-04):
+ *   - preslikava je **simetrična**: ista tabela se uporabi na INDEKSU in na
+ *     POIZVEDBI (normalizator + ocenjevalec), zato sta obe strani vedno v kanonični
+ *     obliki — tudi kadar sta obe angleški ali obe slovenski;
+ *   - ključi so normalizirani (male črke, brez šumnikov, brez ločil), kanonične
+ *     vrednosti so prav tako brez šumnikov (jedro jih itak normalizira);
+ *   - **znamk in učinkovin ne prevajamo** (Monge, Royal Canin, N&D, Hills, Brit,
+ *     Flamingo, Trixie, Kong, Kerbl, Rogz, Ferplast, Flexi, JBL, Rinti, Dubex, Sera,
+ *     Oasy, Vetlife, Dingo, Matis, Besta, Ferribella, MEDROL …) — zanje skrbi
+ *     `znamkaNormalizator`; v tem seznamu jih namenoma NI;
+ *   - besed, ki so v obeh jezikih enake (`light`, `mini`, `maxi`, `gel`, `spot`,
+ *     `tuna`, `premium`, `hairball` …), NI na seznamu — preslikava bi bila odveč;
+ *   - okrajšava `MED` (= „medium“) je namenoma izven te tabele: `med` je v slovenščini
+ *     tudi „honey“ („z medom“ je v tackakp 497 artikelov), zato jo rešuje ciljno
+ *     pravilo v `razdeljevalciNormalizator` (`MED&MAXI` → `MEDIUM MAXI`).
+ *
+ * Vzdrževanje: kandidate za dodajanje izlušči diagnostični skript
+ * `panthenImport/src/debug/besedisceZaLeksikon.ts` (`--kandidati`).
+ */
+/**
+ * Angleške (in okrajšane) besede → kanonična slovenska oblika (brez šumnikov).
+ *
+ * Vrednost je lahko tudi večbesedna (`granatno jabolko`), tako se „POMEG“ in
+ * „granatno jabolko“ ujameta kot ista dva žetona.
+ */
+export declare const PREVODI: Record<string, string>;
+/**
+ * Vezniki in marketinške besede, ki ne nosijo pomena izdelka — iz besedila se
+ * ODSTRANIJO (brez razreda). Merjeno: par „urinary care“ ↔ „urinarne“ je imel
+ * zaradi `care` pokritost kandidata 50 % namesto 100 %.
+ */
+export declare const STOP_BESEDE: string[];
+/**
+ * Življenjska stopnja → kanonična oblika, ki postane RAZRED `starost`.
+ *
+ * Stopnja je močan razločevalnik (mladič proti odraslemu je drug izdelek), a jo
+ * nazivi navajajo nedosledno, zato razred (kazen ob nasprotju), ne trdi žeton.
+ * Zajema tudi angleške zapise in okrajšave, ker so v podatkih pogosti.
+ */
+export declare const STAROSTI: Record<string, string>;
+/**
+ * Angleške velikosti → kanonična velikost (isti ključi kot `VELIKOSTI_SINONIMI`).
+ *
+ * `mini` in `maxi` namenoma OSTAJAJO besede: uporablja jih obe strani enako, v
+ * linijah RC/N&D pa pomenita razred velikosti. V razred gredo le nedvoumne.
+ */
+export declare const VELIKOSTI_EN: Record<string, string>;
+/** Okrajšave velikosti, ki se v Pantheonu pojavljajo s `&` (`MED&MAXI`) — ciljno pravilo. */
+export declare const VELIKOSTI_OKRAJSAVE: Record<string, string>;
+/** Izvoz za teste in diagnostične skripte. */
+export declare const PREVODI_VIR = "ro\u010Dno kurirano 2026-10-04 (besedi\u0161\u010De izmerjeno v tackakp + SI_TACKA)";
+//# sourceMappingURL=prevodi.d.ts.map

package/dist/vet/data/prevodi.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prevodi.d.ts","sourceRoot":"","sources":["../../../src/vet/data/prevodi.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH;;;;;GAKG;AACH,eAAO,MAAM,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CA0T1C,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,WAAW,EAAE,MAAM,EAiB/B,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAqB3C,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAO/C,CAAC;AAEF,6FAA6F;AAC7F,eAAO,MAAM,mBAAmB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAItD,CAAC;AAEF,8CAA8C;AAC9C,eAAO,MAAM,WAAW,wFAAyE,CAAC"}