@aglyn/aglyn 1.0.0-beta.143

package/src/lib/app-utils/name-match.d.ts

@@ -0,0 +1,155 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * How a name is matched against what somebody typed, and how matches are
+ * ordered (AGL-2486).
+ *
+ * Shared by console global search AND by `useSwitcherCollection`, which backs
+ * the site and screen switchers. It lives here rather than in the console
+ * because those switchers are in `libs/tenant/feature/instance` and had the
+ * SAME defect: both surfaces matched by a Firestore prefix range, so both
+ * failed the "Main Layout" case, and both silently omitted any document
+ * missing the field they ordered by. One matcher means fixing it once.
+ *
+ * ## The defect this closes
+ *
+ * A Firestore PREFIX range over `nameLower` is anchored at the start of the
+ * whole string, so it finds "Main Layout" when you type `main` and never when
+ * you type `layout`. A footer that admits as much is honest and still
+ * unusable.
+ *
+ * ## Why the matching moved to the client, which is not a cop-out
+ *
+ * It is the same call `media-search.ts` already made for the DAM, and for the
+ * same reason, so this is the repo's existing doctrine rather than a new one:
+ *
+ * "rich matching is allowed only over a set the UI can truthfully describe"
+ *
+ * Firestore has no `LIKE` and no full-text index. A word-anywhere match has no
+ * server expression at all. The only server-side shape available is the prefix
+ * range, and buying it for the eleven collections this now searches would cost
+ * a schema field, a backfill of every existing document, and — for the ones
+ * that also carry a `where` — a composite index each. `media-search.ts:36-49`
+ * declined exactly that trade; the index inventory shows the result, a single
+ * `nameLower` composite in the entire repo, on `hostMemberships`.
+ *
+ * So the set is bounded and named instead: `useGlobalSearch` reads a capped
+ * window per collection, this module matches over ALL of it, and
+ * `globalSearchScopeMessage` states the bound. The honesty is not decoration —
+ * an absent result must not read as "you do not have one" to somebody who is
+ * about to create a duplicate.
+ *
+ * ## What "matches" means, stated once so the caption can quote it
+ *
+ * A row matches when EVERY word of the query is found somewhere in the row's
+ * searchable text. Not a prefix of the whole string, and not a fuzzy distance:
+ * both extremes were rejected deliberately.
+ *
+ * * A prefix of the whole string is the defect above.
+ * * Fuzzy (`Fuse`, which the DAM does use) is right for filenames, where a
+ *   typo in `mock-hero-noshadow.png` is common and the corpus is one field. It
+ *   is wrong here, because the corpus is eleven kinds of object and a loose
+ *   match across them produces a palette where the top hit is not the thing
+ *   you typed. Deterministic matching also means the caption is exactly true
+ *   rather than approximately true, and every case in this file is testable.
+ *
+ * Ranking then puts the strongest evidence first, because with eleven groups
+ * the reader sees perhaps three rows of any one kind.
+ */
+/**
+ * How well a row matched. Higher sorts first.
+ *
+ * The gaps are wide on purpose: they are ranks, not a tuned scale, and a
+ * later contributor adding a case in between should not have to renumber.
+ */
+export declare const MATCH_SCORE: {
+    /** The name IS the query. */
+    readonly exact: 1000;
+    /** The name starts with the query — the old prefix behaviour, kept top. */
+    readonly namePrefix: 800;
+    /** A word inside the name starts with the query: `layout` → "Main Layout". */
+    readonly wordPrefix: 600;
+    /** The query appears inside the name, mid-word: `ayou` → "Main Layout". */
+    readonly substring: 400;
+    /** Every query word matched somewhere, but not contiguously. */
+    readonly allWords: 200;
+    /** Matched only on a secondary field (a slug, a route, an email). */
+    readonly secondary: 100;
+};
+/**
+ * Lowercase and strip diacritics.
+ *
+ * `nameSearchKey` (the Firestore write-side key) deliberately PRESERVES
+ * diacritics, because a range query must compare against exactly what was
+ * stored. This is the client-side matcher and has no such constraint, so it
+ * folds them: somebody searching for `Cafe` should find "Café", and on a US
+ * keyboard that is the common direction. Folding here cannot desynchronise
+ * anything, because nothing normalised by this function is ever written.
+ */
+export declare function foldForSearch(value: string | null | undefined): string;
+/** The query's words, folded. An empty query yields an empty list. */
+export declare function searchWords(query: string | null | undefined): string[];
+/**
+ * The text a row is matched against.
+ *
+ * `name` is what the reader sees and what ranking is computed from. `extra`
+ * is everything else that may legitimately be searched for — a page's route,
+ * a product's slug, a contact's email — and can only ever produce a
+ * `secondary` score, so a slug hit never outranks a name hit.
+ */
+export interface SearchableText {
+    name: string;
+    extra?: Array<string | null | undefined>;
+}
+/**
+ * Score one row against one query, or `null` when it does not match.
+ *
+ * Total and pure. Every branch is reachable from a real query, which is what
+ * makes the caption in `globalSearchScopeMessage` checkable rather than
+ * aspirational.
+ */
+export declare function scoreMatch(text: SearchableText, query: string): number | null;
+/**
+ * Rank two scored rows.
+ *
+ * Score first, then the shorter name, then alphabetical. The length tiebreak
+ * is the one that earns its place: at equal score "Blog" and
+ * "Blog post archive template" are both word-prefix hits for `blog`, and the
+ * shorter name is nearly always the thing meant.
+ *
+ * Deterministic to the last comparison on purpose — a palette whose row order
+ * changes between two identical queries teaches the reader not to trust the
+ * first row, which is the row this whole feature exists to put there.
+ */
+export declare function compareScored(a: {
+    score: number;
+    label: string;
+}, b: {
+    score: number;
+    label: string;
+}): number;
+/**
+ * The shortest query that is allowed to reach Firestore.
+ *
+ * Read cost, and it is the single cheapest control here. One character
+ * matches a large fraction of any collection, so it spends a read in every
+ * group to render a list nobody can use. Two is where a query starts carrying
+ * information.
+ */
+export declare const MIN_QUERY_LENGTH = 2;
+/** Is this query worth spending reads on? */
+export declare function isSearchableQuery(query: string | null | undefined): boolean;

package/src/lib/app-utils/name-match.js

@@ -0,0 +1,175 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /**
+ * How a name is matched against what somebody typed, and how matches are
+ * ordered (AGL-2486).
+ *
+ * Shared by console global search AND by `useSwitcherCollection`, which backs
+ * the site and screen switchers. It lives here rather than in the console
+ * because those switchers are in `libs/tenant/feature/instance` and had the
+ * SAME defect: both surfaces matched by a Firestore prefix range, so both
+ * failed the "Main Layout" case, and both silently omitted any document
+ * missing the field they ordered by. One matcher means fixing it once.
+ *
+ * ## The defect this closes
+ *
+ * A Firestore PREFIX range over `nameLower` is anchored at the start of the
+ * whole string, so it finds "Main Layout" when you type `main` and never when
+ * you type `layout`. A footer that admits as much is honest and still
+ * unusable.
+ *
+ * ## Why the matching moved to the client, which is not a cop-out
+ *
+ * It is the same call `media-search.ts` already made for the DAM, and for the
+ * same reason, so this is the repo's existing doctrine rather than a new one:
+ *
+ * "rich matching is allowed only over a set the UI can truthfully describe"
+ *
+ * Firestore has no `LIKE` and no full-text index. A word-anywhere match has no
+ * server expression at all. The only server-side shape available is the prefix
+ * range, and buying it for the eleven collections this now searches would cost
+ * a schema field, a backfill of every existing document, and — for the ones
+ * that also carry a `where` — a composite index each. `media-search.ts:36-49`
+ * declined exactly that trade; the index inventory shows the result, a single
+ * `nameLower` composite in the entire repo, on `hostMemberships`.
+ *
+ * So the set is bounded and named instead: `useGlobalSearch` reads a capped
+ * window per collection, this module matches over ALL of it, and
+ * `globalSearchScopeMessage` states the bound. The honesty is not decoration —
+ * an absent result must not read as "you do not have one" to somebody who is
+ * about to create a duplicate.
+ *
+ * ## What "matches" means, stated once so the caption can quote it
+ *
+ * A row matches when EVERY word of the query is found somewhere in the row's
+ * searchable text. Not a prefix of the whole string, and not a fuzzy distance:
+ * both extremes were rejected deliberately.
+ *
+ * * A prefix of the whole string is the defect above.
+ * * Fuzzy (`Fuse`, which the DAM does use) is right for filenames, where a
+ *   typo in `mock-hero-noshadow.png` is common and the corpus is one field. It
+ *   is wrong here, because the corpus is eleven kinds of object and a loose
+ *   match across them produces a palette where the top hit is not the thing
+ *   you typed. Deterministic matching also means the caption is exactly true
+ *   rather than approximately true, and every case in this file is testable.
+ *
+ * Ranking then puts the strongest evidence first, because with eleven groups
+ * the reader sees perhaps three rows of any one kind.
+ */ /**
+ * How well a row matched. Higher sorts first.
+ *
+ * The gaps are wide on purpose: they are ranks, not a tuned scale, and a
+ * later contributor adding a case in between should not have to renumber.
+ */ export const MATCH_SCORE = {
+    /** The name IS the query. */ exact: 1000,
+    /** The name starts with the query — the old prefix behaviour, kept top. */ namePrefix: 800,
+    /** A word inside the name starts with the query: `layout` → "Main Layout". */ wordPrefix: 600,
+    /** The query appears inside the name, mid-word: `ayou` → "Main Layout". */ substring: 400,
+    /** Every query word matched somewhere, but not contiguously. */ allWords: 200,
+    /** Matched only on a secondary field (a slug, a route, an email). */ secondary: 100
+};
+/** A word-splitting normaliser shared by the corpus and the query. */ const WORD_SPLIT = RegExp("[^\\u0041-\\u005A\\u0061-\\u007A\\u00AA\\u00B5\\u00BA\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376-\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E-\\u066F\\u0671-\\u06D3\\u06D5\\u06E5-\\u06E6\\u06EE-\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4-\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088F\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F-\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC-\\u09DD\\u09DF-\\u09E1\\u09F0-\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F-\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32-\\u0A33\\u0A35-\\u0A36\\u0A38-\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2-\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0-\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F-\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32-\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C-\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99-\\u0B9A\\u0B9C\\u0B9E-\\u0B9F\\u0BA3-\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5C-\\u0C5D\\u0C60-\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDC-\\u0CDE\\u0CE0-\\u0CE1\\u0CF1-\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32-\\u0E33\\u0E40-\\u0E46\\u0E81-\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2-\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065-\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE-\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5-\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183-\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2-\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005-\\u3006\\u3031-\\u3035\\u303B-\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A-\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7DC\\uA7F1-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD-\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5-\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40-\\uFB41\\uFB43-\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC\\u{10000}-\\u{1000B}\\u{1000D}-\\u{10026}\\u{10028}-\\u{1003A}\\u{1003C}-\\u{1003D}\\u{1003F}-\\u{1004D}\\u{10050}-\\u{1005D}\\u{10080}-\\u{100FA}\\u{10280}-\\u{1029C}\\u{102A0}-\\u{102D0}\\u{10300}-\\u{1031F}\\u{1032D}-\\u{10340}\\u{10342}-\\u{10349}\\u{10350}-\\u{10375}\\u{10380}-\\u{1039D}\\u{103A0}-\\u{103C3}\\u{103C8}-\\u{103CF}\\u{10400}-\\u{1049D}\\u{104B0}-\\u{104D3}\\u{104D8}-\\u{104FB}\\u{10500}-\\u{10527}\\u{10530}-\\u{10563}\\u{10570}-\\u{1057A}\\u{1057C}-\\u{1058A}\\u{1058C}-\\u{10592}\\u{10594}-\\u{10595}\\u{10597}-\\u{105A1}\\u{105A3}-\\u{105B1}\\u{105B3}-\\u{105B9}\\u{105BB}-\\u{105BC}\\u{105C0}-\\u{105F3}\\u{10600}-\\u{10736}\\u{10740}-\\u{10755}\\u{10760}-\\u{10767}\\u{10780}-\\u{10785}\\u{10787}-\\u{107B0}\\u{107B2}-\\u{107BA}\\u{10800}-\\u{10805}\\u{10808}\\u{1080A}-\\u{10835}\\u{10837}-\\u{10838}\\u{1083C}\\u{1083F}-\\u{10855}\\u{10860}-\\u{10876}\\u{10880}-\\u{1089E}\\u{108E0}-\\u{108F2}\\u{108F4}-\\u{108F5}\\u{10900}-\\u{10915}\\u{10920}-\\u{10939}\\u{10940}-\\u{10959}\\u{10980}-\\u{109B7}\\u{109BE}-\\u{109BF}\\u{10A00}\\u{10A10}-\\u{10A13}\\u{10A15}-\\u{10A17}\\u{10A19}-\\u{10A35}\\u{10A60}-\\u{10A7C}\\u{10A80}-\\u{10A9C}\\u{10AC0}-\\u{10AC7}\\u{10AC9}-\\u{10AE4}\\u{10B00}-\\u{10B35}\\u{10B40}-\\u{10B55}\\u{10B60}-\\u{10B72}\\u{10B80}-\\u{10B91}\\u{10C00}-\\u{10C48}\\u{10C80}-\\u{10CB2}\\u{10CC0}-\\u{10CF2}\\u{10D00}-\\u{10D23}\\u{10D4A}-\\u{10D65}\\u{10D6F}-\\u{10D85}\\u{10E80}-\\u{10EA9}\\u{10EB0}-\\u{10EB1}\\u{10EC2}-\\u{10EC7}\\u{10F00}-\\u{10F1C}\\u{10F27}\\u{10F30}-\\u{10F45}\\u{10F70}-\\u{10F81}\\u{10FB0}-\\u{10FC4}\\u{10FE0}-\\u{10FF6}\\u{11003}-\\u{11037}\\u{11071}-\\u{11072}\\u{11075}\\u{11083}-\\u{110AF}\\u{110D0}-\\u{110E8}\\u{11103}-\\u{11126}\\u{11144}\\u{11147}\\u{11150}-\\u{11172}\\u{11176}\\u{11183}-\\u{111B2}\\u{111C1}-\\u{111C4}\\u{111DA}\\u{111DC}\\u{11200}-\\u{11211}\\u{11213}-\\u{1122B}\\u{1123F}-\\u{11240}\\u{11280}-\\u{11286}\\u{11288}\\u{1128A}-\\u{1128D}\\u{1128F}-\\u{1129D}\\u{1129F}-\\u{112A8}\\u{112B0}-\\u{112DE}\\u{11305}-\\u{1130C}\\u{1130F}-\\u{11310}\\u{11313}-\\u{11328}\\u{1132A}-\\u{11330}\\u{11332}-\\u{11333}\\u{11335}-\\u{11339}\\u{1133D}\\u{11350}\\u{1135D}-\\u{11361}\\u{11380}-\\u{11389}\\u{1138B}\\u{1138E}\\u{11390}-\\u{113B5}\\u{113B7}\\u{113D1}\\u{113D3}\\u{11400}-\\u{11434}\\u{11447}-\\u{1144A}\\u{1145F}-\\u{11461}\\u{11480}-\\u{114AF}\\u{114C4}-\\u{114C5}\\u{114C7}\\u{11580}-\\u{115AE}\\u{115D8}-\\u{115DB}\\u{11600}-\\u{1162F}\\u{11644}\\u{11680}-\\u{116AA}\\u{116B8}\\u{11700}-\\u{1171A}\\u{11740}-\\u{11746}\\u{11800}-\\u{1182B}\\u{118A0}-\\u{118DF}\\u{118FF}-\\u{11906}\\u{11909}\\u{1190C}-\\u{11913}\\u{11915}-\\u{11916}\\u{11918}-\\u{1192F}\\u{1193F}\\u{11941}\\u{119A0}-\\u{119A7}\\u{119AA}-\\u{119D0}\\u{119E1}\\u{119E3}\\u{11A00}\\u{11A0B}-\\u{11A32}\\u{11A3A}\\u{11A50}\\u{11A5C}-\\u{11A89}\\u{11A9D}\\u{11AB0}-\\u{11AF8}\\u{11BC0}-\\u{11BE0}\\u{11C00}-\\u{11C08}\\u{11C0A}-\\u{11C2E}\\u{11C40}\\u{11C72}-\\u{11C8F}\\u{11D00}-\\u{11D06}\\u{11D08}-\\u{11D09}\\u{11D0B}-\\u{11D30}\\u{11D46}\\u{11D60}-\\u{11D65}\\u{11D67}-\\u{11D68}\\u{11D6A}-\\u{11D89}\\u{11D98}\\u{11DB0}-\\u{11DDB}\\u{11EE0}-\\u{11EF2}\\u{11F02}\\u{11F04}-\\u{11F10}\\u{11F12}-\\u{11F33}\\u{11FB0}\\u{12000}-\\u{12399}\\u{12480}-\\u{12543}\\u{12F90}-\\u{12FF0}\\u{13000}-\\u{1342F}\\u{13441}-\\u{13446}\\u{13460}-\\u{143FA}\\u{14400}-\\u{14646}\\u{16100}-\\u{1611D}\\u{16800}-\\u{16A38}\\u{16A40}-\\u{16A5E}\\u{16A70}-\\u{16ABE}\\u{16AD0}-\\u{16AED}\\u{16B00}-\\u{16B2F}\\u{16B40}-\\u{16B43}\\u{16B63}-\\u{16B77}\\u{16B7D}-\\u{16B8F}\\u{16D40}-\\u{16D6C}\\u{16E40}-\\u{16E7F}\\u{16EA0}-\\u{16EB8}\\u{16EBB}-\\u{16ED3}\\u{16F00}-\\u{16F4A}\\u{16F50}\\u{16F93}-\\u{16F9F}\\u{16FE0}-\\u{16FE1}\\u{16FE3}\\u{16FF2}-\\u{16FF3}\\u{17000}-\\u{18CD5}\\u{18CFF}-\\u{18D1E}\\u{18D80}-\\u{18DF2}\\u{1AFF0}-\\u{1AFF3}\\u{1AFF5}-\\u{1AFFB}\\u{1AFFD}-\\u{1AFFE}\\u{1B000}-\\u{1B122}\\u{1B132}\\u{1B150}-\\u{1B152}\\u{1B155}\\u{1B164}-\\u{1B167}\\u{1B170}-\\u{1B2FB}\\u{1BC00}-\\u{1BC6A}\\u{1BC70}-\\u{1BC7C}\\u{1BC80}-\\u{1BC88}\\u{1BC90}-\\u{1BC99}\\u{1D400}-\\u{1D454}\\u{1D456}-\\u{1D49C}\\u{1D49E}-\\u{1D49F}\\u{1D4A2}\\u{1D4A5}-\\u{1D4A6}\\u{1D4A9}-\\u{1D4AC}\\u{1D4AE}-\\u{1D4B9}\\u{1D4BB}\\u{1D4BD}-\\u{1D4C3}\\u{1D4C5}-\\u{1D505}\\u{1D507}-\\u{1D50A}\\u{1D50D}-\\u{1D514}\\u{1D516}-\\u{1D51C}\\u{1D51E}-\\u{1D539}\\u{1D53B}-\\u{1D53E}\\u{1D540}-\\u{1D544}\\u{1D546}\\u{1D54A}-\\u{1D550}\\u{1D552}-\\u{1D6A5}\\u{1D6A8}-\\u{1D6C0}\\u{1D6C2}-\\u{1D6DA}\\u{1D6DC}-\\u{1D6FA}\\u{1D6FC}-\\u{1D714}\\u{1D716}-\\u{1D734}\\u{1D736}-\\u{1D74E}\\u{1D750}-\\u{1D76E}\\u{1D770}-\\u{1D788}\\u{1D78A}-\\u{1D7A8}\\u{1D7AA}-\\u{1D7C2}\\u{1D7C4}-\\u{1D7CB}\\u{1DF00}-\\u{1DF1E}\\u{1DF25}-\\u{1DF2A}\\u{1E030}-\\u{1E06D}\\u{1E100}-\\u{1E12C}\\u{1E137}-\\u{1E13D}\\u{1E14E}\\u{1E290}-\\u{1E2AD}\\u{1E2C0}-\\u{1E2EB}\\u{1E4D0}-\\u{1E4EB}\\u{1E5D0}-\\u{1E5ED}\\u{1E5F0}\\u{1E6C0}-\\u{1E6DE}\\u{1E6E0}-\\u{1E6E2}\\u{1E6E4}-\\u{1E6E5}\\u{1E6E7}-\\u{1E6ED}\\u{1E6F0}-\\u{1E6F4}\\u{1E6FE}-\\u{1E6FF}\\u{1E7E0}-\\u{1E7E6}\\u{1E7E8}-\\u{1E7EB}\\u{1E7ED}-\\u{1E7EE}\\u{1E7F0}-\\u{1E7FE}\\u{1E800}-\\u{1E8C4}\\u{1E900}-\\u{1E943}\\u{1E94B}\\u{1EE00}-\\u{1EE03}\\u{1EE05}-\\u{1EE1F}\\u{1EE21}-\\u{1EE22}\\u{1EE24}\\u{1EE27}\\u{1EE29}-\\u{1EE32}\\u{1EE34}-\\u{1EE37}\\u{1EE39}\\u{1EE3B}\\u{1EE42}\\u{1EE47}\\u{1EE49}\\u{1EE4B}\\u{1EE4D}-\\u{1EE4F}\\u{1EE51}-\\u{1EE52}\\u{1EE54}\\u{1EE57}\\u{1EE59}\\u{1EE5B}\\u{1EE5D}\\u{1EE5F}\\u{1EE61}-\\u{1EE62}\\u{1EE64}\\u{1EE67}-\\u{1EE6A}\\u{1EE6C}-\\u{1EE72}\\u{1EE74}-\\u{1EE77}\\u{1EE79}-\\u{1EE7C}\\u{1EE7E}\\u{1EE80}-\\u{1EE89}\\u{1EE8B}-\\u{1EE9B}\\u{1EEA1}-\\u{1EEA3}\\u{1EEA5}-\\u{1EEA9}\\u{1EEAB}-\\u{1EEBB}\\u{20000}-\\u{2A6DF}\\u{2A700}-\\u{2B81D}\\u{2B820}-\\u{2CEAD}\\u{2CEB0}-\\u{2EBE0}\\u{2EBF0}-\\u{2EE5D}\\u{2F800}-\\u{2FA1D}\\u{30000}-\\u{3134A}\\u{31350}-\\u{33479}\\u0030-\\u0039\\u00B2-\\u00B3\\u00B9\\u00BC-\\u00BE\\u0660-\\u0669\\u06F0-\\u06F9\\u07C0-\\u07C9\\u0966-\\u096F\\u09E6-\\u09EF\\u09F4-\\u09F9\\u0A66-\\u0A6F\\u0AE6-\\u0AEF\\u0B66-\\u0B6F\\u0B72-\\u0B77\\u0BE6-\\u0BF2\\u0C66-\\u0C6F\\u0C78-\\u0C7E\\u0CE6-\\u0CEF\\u0D58-\\u0D5E\\u0D66-\\u0D78\\u0DE6-\\u0DEF\\u0E50-\\u0E59\\u0ED0-\\u0ED9\\u0F20-\\u0F33\\u1040-\\u1049\\u1090-\\u1099\\u1369-\\u137C\\u16EE-\\u16F0\\u17E0-\\u17E9\\u17F0-\\u17F9\\u1810-\\u1819\\u1946-\\u194F\\u19D0-\\u19DA\\u1A80-\\u1A89\\u1A90-\\u1A99\\u1B50-\\u1B59\\u1BB0-\\u1BB9\\u1C40-\\u1C49\\u1C50-\\u1C59\\u2070\\u2074-\\u2079\\u2080-\\u2089\\u2150-\\u2182\\u2185-\\u2189\\u2460-\\u249B\\u24EA-\\u24FF\\u2776-\\u2793\\u2CFD\\u3007\\u3021-\\u3029\\u3038-\\u303A\\u3192-\\u3195\\u3220-\\u3229\\u3248-\\u324F\\u3251-\\u325F\\u3280-\\u3289\\u32B1-\\u32BF\\uA620-\\uA629\\uA6E6-\\uA6EF\\uA830-\\uA835\\uA8D0-\\uA8D9\\uA900-\\uA909\\uA9D0-\\uA9D9\\uA9F0-\\uA9F9\\uAA50-\\uAA59\\uABF0-\\uABF9\\uFF10-\\uFF19\\u{10107}-\\u{10133}\\u{10140}-\\u{10178}\\u{1018A}-\\u{1018B}\\u{102E1}-\\u{102FB}\\u{10320}-\\u{10323}\\u{10341}\\u{1034A}\\u{103D1}-\\u{103D5}\\u{104A0}-\\u{104A9}\\u{10858}-\\u{1085F}\\u{10879}-\\u{1087F}\\u{108A7}-\\u{108AF}\\u{108FB}-\\u{108FF}\\u{10916}-\\u{1091B}\\u{109BC}-\\u{109BD}\\u{109C0}-\\u{109CF}\\u{109D2}-\\u{109FF}\\u{10A40}-\\u{10A48}\\u{10A7D}-\\u{10A7E}\\u{10A9D}-\\u{10A9F}\\u{10AEB}-\\u{10AEF}\\u{10B58}-\\u{10B5F}\\u{10B78}-\\u{10B7F}\\u{10BA9}-\\u{10BAF}\\u{10CFA}-\\u{10CFF}\\u{10D30}-\\u{10D39}\\u{10D40}-\\u{10D49}\\u{10E60}-\\u{10E7E}\\u{10F1D}-\\u{10F26}\\u{10F51}-\\u{10F54}\\u{10FC5}-\\u{10FCB}\\u{11052}-\\u{1106F}\\u{110F0}-\\u{110F9}\\u{11136}-\\u{1113F}\\u{111D0}-\\u{111D9}\\u{111E1}-\\u{111F4}\\u{112F0}-\\u{112F9}\\u{11450}-\\u{11459}\\u{114D0}-\\u{114D9}\\u{11650}-\\u{11659}\\u{116C0}-\\u{116C9}\\u{116D0}-\\u{116E3}\\u{11730}-\\u{1173B}\\u{118E0}-\\u{118F2}\\u{11950}-\\u{11959}\\u{11BF0}-\\u{11BF9}\\u{11C50}-\\u{11C6C}\\u{11D50}-\\u{11D59}\\u{11DA0}-\\u{11DA9}\\u{11DE0}-\\u{11DE9}\\u{11F50}-\\u{11F59}\\u{11FC0}-\\u{11FD4}\\u{12400}-\\u{1246E}\\u{16130}-\\u{16139}\\u{16A60}-\\u{16A69}\\u{16AC0}-\\u{16AC9}\\u{16B50}-\\u{16B59}\\u{16B5B}-\\u{16B61}\\u{16D70}-\\u{16D79}\\u{16E80}-\\u{16E96}\\u{16FF4}-\\u{16FF6}\\u{1CCF0}-\\u{1CCF9}\\u{1D2C0}-\\u{1D2D3}\\u{1D2E0}-\\u{1D2F3}\\u{1D360}-\\u{1D378}\\u{1D7CE}-\\u{1D7FF}\\u{1E140}-\\u{1E149}\\u{1E2F0}-\\u{1E2F9}\\u{1E4F0}-\\u{1E4F9}\\u{1E5F1}-\\u{1E5FA}\\u{1E8C7}-\\u{1E8CF}\\u{1E950}-\\u{1E959}\\u{1EC71}-\\u{1ECAB}\\u{1ECAD}-\\u{1ECAF}\\u{1ECB1}-\\u{1ECB4}\\u{1ED01}-\\u{1ED2D}\\u{1ED2F}-\\u{1ED3D}\\u{1F100}-\\u{1F10C}\\u{1FBF0}-\\u{1FBF9}]+", "u");
+/**
+ * Lowercase and strip diacritics.
+ *
+ * `nameSearchKey` (the Firestore write-side key) deliberately PRESERVES
+ * diacritics, because a range query must compare against exactly what was
+ * stored. This is the client-side matcher and has no such constraint, so it
+ * folds them: somebody searching for `Cafe` should find "Café", and on a US
+ * keyboard that is the common direction. Folding here cannot desynchronise
+ * anything, because nothing normalised by this function is ever written.
+ */ export function foldForSearch(value) {
+    return String(value != null ? value : '').normalize('NFD').replace(RegExp("[\\u005E\\u0060\\u00A8\\u00AF\\u00B4\\u00B7-\\u00B8\\u02B0-\\u034E\\u0350-\\u0357\\u035D-\\u0362\\u0374-\\u0375\\u037A\\u0384-\\u0385\\u0483-\\u0487\\u0559\\u0591-\\u05BD\\u05BF\\u05C1-\\u05C2\\u05C4-\\u05C5\\u05C7\\u064B-\\u0652\\u0657-\\u0658\\u06DF-\\u06E0\\u06E5-\\u06E6\\u06EA-\\u06EC\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F5\\u0818-\\u0819\\u0898-\\u089F\\u08C9-\\u08D2\\u08E3-\\u08FE\\u093C\\u094D\\u0951-\\u0954\\u0971\\u09BC\\u09CD\\u0A3C\\u0A4D\\u0ABC\\u0ACD\\u0AFD-\\u0AFF\\u0B3C\\u0B4D\\u0B55\\u0BCD\\u0C3C\\u0C4D\\u0CBC\\u0CCD\\u0D3B-\\u0D3C\\u0D4D\\u0DCA\\u0E3A\\u0E47-\\u0E4C\\u0E4E\\u0EBA\\u0EC8-\\u0ECC\\u0F18-\\u0F19\\u0F35\\u0F37\\u0F39\\u0F3E-\\u0F3F\\u0F82-\\u0F84\\u0F86-\\u0F87\\u0FC6\\u1037\\u1039-\\u103A\\u1063-\\u1064\\u1069-\\u106D\\u1087-\\u108D\\u108F\\u109A-\\u109B\\u135D-\\u135F\\u1714-\\u1715\\u1734\\u17C9-\\u17D3\\u17DD\\u1939-\\u193B\\u1A60\\u1A75-\\u1A7C\\u1A7F\\u1AB0-\\u1ABE\\u1AC1-\\u1ACB\\u1ACF-\\u1ADD\\u1AE0-\\u1AEB\\u1B34\\u1B44\\u1B6B-\\u1B73\\u1BAA-\\u1BAB\\u1BE6\\u1BF2-\\u1BF3\\u1C36-\\u1C37\\u1C78-\\u1C7D\\u1CD0-\\u1CE8\\u1CED\\u1CF4\\u1CF7-\\u1CF9\\u1D2C-\\u1D6A\\u1D9B-\\u1DBE\\u1DC4-\\u1DCF\\u1DF5-\\u1DFF\\u1FBD\\u1FBF-\\u1FC1\\u1FCD-\\u1FCF\\u1FDD-\\u1FDF\\u1FED-\\u1FEF\\u1FFD-\\u1FFE\\u2CEF-\\u2CF1\\u2E2F\\u302A-\\u302F\\u3099-\\u309C\\u30FC\\uA66F\\uA67C-\\uA67D\\uA67F\\uA69C-\\uA69D\\uA6F0-\\uA6F1\\uA700-\\uA721\\uA788-\\uA78A\\uA7F1\\uA7F8-\\uA7F9\\uA806\\uA82C\\uA8C4\\uA8E0-\\uA8F1\\uA92B-\\uA92E\\uA953\\uA9B3\\uA9C0\\uA9E5\\uAA7B-\\uAA7D\\uAABF-\\uAAC2\\uAAF6\\uAB5B-\\uAB5F\\uAB69-\\uAB6B\\uABEC-\\uABED\\uFB1E\\uFE20-\\uFE2F\\uFF3E\\uFF40\\uFF70\\uFF9E-\\uFF9F\\uFFE3\\u{102E0}\\u{10780}-\\u{10785}\\u{10787}-\\u{107B0}\\u{107B2}-\\u{107BA}\\u{10A38}-\\u{10A3A}\\u{10A3F}\\u{10AE5}-\\u{10AE6}\\u{10D22}-\\u{10D27}\\u{10D4E}\\u{10D69}-\\u{10D6D}\\u{10EFA}\\u{10EFD}-\\u{10EFF}\\u{10F46}-\\u{10F50}\\u{10F82}-\\u{10F85}\\u{11046}\\u{11070}\\u{110B9}-\\u{110BA}\\u{11133}-\\u{11134}\\u{11173}\\u{111C0}\\u{111CA}-\\u{111CC}\\u{11235}-\\u{11236}\\u{112E9}-\\u{112EA}\\u{1133B}-\\u{1133C}\\u{1134D}\\u{11366}-\\u{1136C}\\u{11370}-\\u{11374}\\u{113CE}-\\u{113D0}\\u{113D2}-\\u{113D3}\\u{113E1}-\\u{113E2}\\u{11442}\\u{11446}\\u{114C2}-\\u{114C3}\\u{115BF}-\\u{115C0}\\u{1163F}\\u{116B6}-\\u{116B7}\\u{1172B}\\u{11839}-\\u{1183A}\\u{1193D}-\\u{1193E}\\u{11943}\\u{119E0}\\u{11A34}\\u{11A47}\\u{11A99}\\u{11C3F}\\u{11D42}\\u{11D44}-\\u{11D45}\\u{11D97}\\u{11DD9}\\u{11F41}-\\u{11F42}\\u{11F5A}\\u{13447}-\\u{13455}\\u{1612F}\\u{16AF0}-\\u{16AF4}\\u{16B30}-\\u{16B36}\\u{16D6B}-\\u{16D6C}\\u{16F8F}-\\u{16F9F}\\u{16FF0}-\\u{16FF1}\\u{1AFF0}-\\u{1AFF3}\\u{1AFF5}-\\u{1AFFB}\\u{1AFFD}-\\u{1AFFE}\\u{1CF00}-\\u{1CF2D}\\u{1CF30}-\\u{1CF46}\\u{1D167}-\\u{1D169}\\u{1D16D}-\\u{1D172}\\u{1D17B}-\\u{1D182}\\u{1D185}-\\u{1D18B}\\u{1D1AA}-\\u{1D1AD}\\u{1E030}-\\u{1E06D}\\u{1E130}-\\u{1E136}\\u{1E2AE}\\u{1E2EC}-\\u{1E2EF}\\u{1E5EE}-\\u{1E5EF}\\u{1E8D0}-\\u{1E8D6}\\u{1E944}-\\u{1E946}\\u{1E948}-\\u{1E94A}]", "gu"), '').toLowerCase().trim();
+}
+/** The query's words, folded. An empty query yields an empty list. */ export function searchWords(query) {
+    return foldForSearch(query).split(WORD_SPLIT).filter(Boolean);
+}
+/**
+ * Score one row against one query, or `null` when it does not match.
+ *
+ * Total and pure. Every branch is reachable from a real query, which is what
+ * makes the caption in `globalSearchScopeMessage` checkable rather than
+ * aspirational.
+ */ export function scoreMatch(text, query) {
+    var _text_extra;
+    const words = searchWords(query);
+    if (words.length === 0) return null;
+    const name = foldForSearch(text.name);
+    const nameWords = name.split(WORD_SPLIT).filter(Boolean);
+    // The whole query as one string, so a multi-word query can still be a
+    // contiguous phrase match: "main lay" against "Main Layout".
+    const phrase = words.join(' ');
+    if (name === phrase) return MATCH_SCORE.exact;
+    if (name.startsWith(phrase)) return MATCH_SCORE.namePrefix;
+    if (nameWords.some((word)=>word.startsWith(phrase))) {
+        return MATCH_SCORE.wordPrefix;
+    }
+    if (name.includes(phrase)) return MATCH_SCORE.substring;
+    // Every word has to land somewhere in the name, which is what stops
+    // `layout home` matching "Main Layout" — the reader typed two words and
+    // meant both. Word-prefix rather than equality so `lay hom` still works.
+    //
+    // Note this SUBSUMES the `wordPrefix` branch above for a single-word query:
+    // both ask whether some name word starts with the query. That is not
+    // redundancy, it is the ordering — a single word reaching here would score
+    // `allWords` and sort below genuine word-prefix hits, so the earlier branch
+    // is what keeps `layout` → "Main Layout" ranked where a reader expects it.
+    // Worth stating because it is a real trap: removing only the `wordPrefix`
+    // branch changes RANKING and not matching, so a test asserting merely "this
+    // matches" would stay green through it.
+    const everyWordInName = words.every((word)=>nameWords.some((nameWord)=>nameWord.startsWith(word)));
+    if (everyWordInName) return MATCH_SCORE.allWords;
+    // Secondary fields are matched as a flat haystack: they are identifiers
+    // (routes, slugs, emails) where the reader is pasting a fragment rather
+    // than typing words, so a substring is the right test.
+    const extra = ((_text_extra = text.extra) != null ? _text_extra : []).map((value)=>foldForSearch(value)).filter(Boolean);
+    if (extra.length > 0) {
+        const haystack = extra.join(' ');
+        if (words.every((word)=>haystack.includes(word))) {
+            return MATCH_SCORE.secondary;
+        }
+    }
+    return null;
+}
+/**
+ * Rank two scored rows.
+ *
+ * Score first, then the shorter name, then alphabetical. The length tiebreak
+ * is the one that earns its place: at equal score "Blog" and
+ * "Blog post archive template" are both word-prefix hits for `blog`, and the
+ * shorter name is nearly always the thing meant.
+ *
+ * Deterministic to the last comparison on purpose — a palette whose row order
+ * changes between two identical queries teaches the reader not to trust the
+ * first row, which is the row this whole feature exists to put there.
+ */ export function compareScored(a, b) {
+    if (a.score !== b.score) return b.score - a.score;
+    if (a.label.length !== b.label.length) return a.label.length - b.label.length;
+    return a.label.localeCompare(b.label);
+}
+/**
+ * The shortest query that is allowed to reach Firestore.
+ *
+ * Read cost, and it is the single cheapest control here. One character
+ * matches a large fraction of any collection, so it spends a read in every
+ * group to render a list nobody can use. Two is where a query starts carrying
+ * information.
+ */ export const MIN_QUERY_LENGTH = 2;
+/** Is this query worth spending reads on? */ export function isSearchableQuery(query) {
+    return foldForSearch(query).length >= MIN_QUERY_LENGTH;
+}
+
+//# sourceMappingURL=name-match.js.map

package/src/lib/app-utils/name-match.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/name-match.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * How a name is matched against what somebody typed, and how matches are\n * ordered (AGL-2486).\n *\n * Shared by console global search AND by `useSwitcherCollection`, which backs\n * the site and screen switchers. It lives here rather than in the console\n * because those switchers are in `libs/tenant/feature/instance` and had the\n * SAME defect: both surfaces matched by a Firestore prefix range, so both\n * failed the \"Main Layout\" case, and both silently omitted any document\n * missing the field they ordered by. One matcher means fixing it once.\n *\n * ## The defect this closes\n *\n * A Firestore PREFIX range over `nameLower` is anchored at the start of the\n * whole string, so it finds \"Main Layout\" when you type `main` and never when\n * you type `layout`. A footer that admits as much is honest and still\n * unusable.\n *\n * ## Why the matching moved to the client, which is not a cop-out\n *\n * It is the same call `media-search.ts` already made for the DAM, and for the\n * same reason, so this is the repo's existing doctrine rather than a new one:\n *\n * \"rich matching is allowed only over a set the UI can truthfully describe\"\n *\n * Firestore has no `LIKE` and no full-text index. A word-anywhere match has no\n * server expression at all. The only server-side shape available is the prefix\n * range, and buying it for the eleven collections this now searches would cost\n * a schema field, a backfill of every existing document, and — for the ones\n * that also carry a `where` — a composite index each. `media-search.ts:36-49`\n * declined exactly that trade; the index inventory shows the result, a single\n * `nameLower` composite in the entire repo, on `hostMemberships`.\n *\n * So the set is bounded and named instead: `useGlobalSearch` reads a capped\n * window per collection, this module matches over ALL of it, and\n * `globalSearchScopeMessage` states the bound. The honesty is not decoration —\n * an absent result must not read as \"you do not have one\" to somebody who is\n * about to create a duplicate.\n *\n * ## What \"matches\" means, stated once so the caption can quote it\n *\n * A row matches when EVERY word of the query is found somewhere in the row's\n * searchable text. Not a prefix of the whole string, and not a fuzzy distance:\n * both extremes were rejected deliberately.\n *\n * * A prefix of the whole string is the defect above.\n * * Fuzzy (`Fuse`, which the DAM does use) is right for filenames, where a\n *   typo in `mock-hero-noshadow.png` is common and the corpus is one field. It\n *   is wrong here, because the corpus is eleven kinds of object and a loose\n *   match across them produces a palette where the top hit is not the thing\n *   you typed. Deterministic matching also means the caption is exactly true\n *   rather than approximately true, and every case in this file is testable.\n *\n * Ranking then puts the strongest evidence first, because with eleven groups\n * the reader sees perhaps three rows of any one kind.\n */\n\n/**\n * How well a row matched. Higher sorts first.\n *\n * The gaps are wide on purpose: they are ranks, not a tuned scale, and a\n * later contributor adding a case in between should not have to renumber.\n */\nexport const MATCH_SCORE = {\n  /** The name IS the query. */\n  exact: 1000,\n  /** The name starts with the query — the old prefix behaviour, kept top. */\n  namePrefix: 800,\n  /** A word inside the name starts with the query: `layout` → \"Main Layout\". */\n  wordPrefix: 600,\n  /** The query appears inside the name, mid-word: `ayou` → \"Main Layout\". */\n  substring: 400,\n  /** Every query word matched somewhere, but not contiguously. */\n  allWords: 200,\n  /** Matched only on a secondary field (a slug, a route, an email). */\n  secondary: 100,\n} as const\n\n/** A word-splitting normaliser shared by the corpus and the query. */\nconst WORD_SPLIT = /[^\\p{L}\\p{N}]+/u\n\n/**\n * Lowercase and strip diacritics.\n *\n * `nameSearchKey` (the Firestore write-side key) deliberately PRESERVES\n * diacritics, because a range query must compare against exactly what was\n * stored. This is the client-side matcher and has no such constraint, so it\n * folds them: somebody searching for `Cafe` should find \"Café\", and on a US\n * keyboard that is the common direction. Folding here cannot desynchronise\n * anything, because nothing normalised by this function is ever written.\n */\nexport function foldForSearch(value: string | null | undefined): string {\n  return String(value ?? '')\n    .normalize('NFD')\n    .replace(/\\p{Diacritic}/gu, '')\n    .toLowerCase()\n    .trim()\n}\n\n/** The query's words, folded. An empty query yields an empty list. */\nexport function searchWords(query: string | null | undefined): string[] {\n  return foldForSearch(query).split(WORD_SPLIT).filter(Boolean)\n}\n\n/**\n * The text a row is matched against.\n *\n * `name` is what the reader sees and what ranking is computed from. `extra`\n * is everything else that may legitimately be searched for — a page's route,\n * a product's slug, a contact's email — and can only ever produce a\n * `secondary` score, so a slug hit never outranks a name hit.\n */\nexport interface SearchableText {\n  name: string\n  extra?: Array<string | null | undefined>\n}\n\n/**\n * Score one row against one query, or `null` when it does not match.\n *\n * Total and pure. Every branch is reachable from a real query, which is what\n * makes the caption in `globalSearchScopeMessage` checkable rather than\n * aspirational.\n */\nexport function scoreMatch(\n  text: SearchableText,\n  query: string,\n): number | null {\n  const words = searchWords(query)\n  if (words.length === 0) return null\n\n  const name = foldForSearch(text.name)\n  const nameWords = name.split(WORD_SPLIT).filter(Boolean)\n  // The whole query as one string, so a multi-word query can still be a\n  // contiguous phrase match: \"main lay\" against \"Main Layout\".\n  const phrase = words.join(' ')\n\n  if (name === phrase) return MATCH_SCORE.exact\n  if (name.startsWith(phrase)) return MATCH_SCORE.namePrefix\n  if (nameWords.some((word) => word.startsWith(phrase))) {\n    return MATCH_SCORE.wordPrefix\n  }\n  if (name.includes(phrase)) return MATCH_SCORE.substring\n\n  // Every word has to land somewhere in the name, which is what stops\n  // `layout home` matching \"Main Layout\" — the reader typed two words and\n  // meant both. Word-prefix rather than equality so `lay hom` still works.\n  //\n  // Note this SUBSUMES the `wordPrefix` branch above for a single-word query:\n  // both ask whether some name word starts with the query. That is not\n  // redundancy, it is the ordering — a single word reaching here would score\n  // `allWords` and sort below genuine word-prefix hits, so the earlier branch\n  // is what keeps `layout` → \"Main Layout\" ranked where a reader expects it.\n  // Worth stating because it is a real trap: removing only the `wordPrefix`\n  // branch changes RANKING and not matching, so a test asserting merely \"this\n  // matches\" would stay green through it.\n  const everyWordInName = words.every((word) =>\n    nameWords.some((nameWord) => nameWord.startsWith(word)),\n  )\n  if (everyWordInName) return MATCH_SCORE.allWords\n\n  // Secondary fields are matched as a flat haystack: they are identifiers\n  // (routes, slugs, emails) where the reader is pasting a fragment rather\n  // than typing words, so a substring is the right test.\n  const extra = (text.extra ?? [])\n    .map((value) => foldForSearch(value))\n    .filter(Boolean)\n  if (extra.length > 0) {\n    const haystack = extra.join(' ')\n    if (words.every((word) => haystack.includes(word))) {\n      return MATCH_SCORE.secondary\n    }\n  }\n\n  return null\n}\n\n/**\n * Rank two scored rows.\n *\n * Score first, then the shorter name, then alphabetical. The length tiebreak\n * is the one that earns its place: at equal score \"Blog\" and\n * \"Blog post archive template\" are both word-prefix hits for `blog`, and the\n * shorter name is nearly always the thing meant.\n *\n * Deterministic to the last comparison on purpose — a palette whose row order\n * changes between two identical queries teaches the reader not to trust the\n * first row, which is the row this whole feature exists to put there.\n */\nexport function compareScored(\n  a: { score: number; label: string },\n  b: { score: number; label: string },\n): number {\n  if (a.score !== b.score) return b.score - a.score\n  if (a.label.length !== b.label.length) return a.label.length - b.label.length\n  return a.label.localeCompare(b.label)\n}\n\n/**\n * The shortest query that is allowed to reach Firestore.\n *\n * Read cost, and it is the single cheapest control here. One character\n * matches a large fraction of any collection, so it spends a read in every\n * group to render a list nobody can use. Two is where a query starts carrying\n * information.\n */\nexport const MIN_QUERY_LENGTH = 2\n\n/** Is this query worth spending reads on? */\nexport function isSearchableQuery(query: string | null | undefined): boolean {\n  return foldForSearch(query).length >= MIN_QUERY_LENGTH\n}\n"],"names":["MATCH_SCORE","exact","namePrefix","wordPrefix","substring","allWords","secondary","WORD_SPLIT","foldForSearch","value","String","normalize","replace","toLowerCase","trim","searchWords","query","split","filter","Boolean","scoreMatch","text","words","length","name","nameWords","phrase","join","startsWith","some","word","includes","everyWordInName","every","nameWord","extra","map","haystack","compareScored","a","b","score","label","localeCompare","MIN_QUERY_LENGTH","isSearchableQuery"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAuDC,GAED;;;;;CAKC,GACD,OAAO,MAAMA,cAAc;IACzB,2BAA2B,GAC3BC,OAAO;IACP,yEAAyE,GACzEC,YAAY;IACZ,4EAA4E,GAC5EC,YAAY;IACZ,yEAAyE,GACzEC,WAAW;IACX,8DAA8D,GAC9DC,UAAU;IACV,mEAAmE,GACnEC,WAAW;AACb,EAAU;AAEV,oEAAoE,GACpE,MAAMC,aAAa;AAEnB;;;;;;;;;CASC,GACD,OAAO,SAASC,cAAcC,KAAgC;IAC5D,OAAOC,OAAOD,gBAAAA,QAAS,IACpBE,SAAS,CAAC,OACVC,OAAO,CAAC,q6FAAmB,IAC3BC,WAAW,GACXC,IAAI;AACT;AAEA,oEAAoE,GACpE,OAAO,SAASC,YAAYC,KAAgC;IAC1D,OAAOR,cAAcQ,OAAOC,KAAK,CAACV,YAAYW,MAAM,CAACC;AACvD;AAeA;;;;;;CAMC,GACD,OAAO,SAASC,WACdC,IAAoB,EACpBL,KAAa;QAsCEK;IApCf,MAAMC,QAAQP,YAAYC;IAC1B,IAAIM,MAAMC,MAAM,KAAK,GAAG,OAAO;IAE/B,MAAMC,OAAOhB,cAAca,KAAKG,IAAI;IACpC,MAAMC,YAAYD,KAAKP,KAAK,CAACV,YAAYW,MAAM,CAACC;IAChD,sEAAsE;IACtE,6DAA6D;IAC7D,MAAMO,SAASJ,MAAMK,IAAI,CAAC;IAE1B,IAAIH,SAASE,QAAQ,OAAO1B,YAAYC,KAAK;IAC7C,IAAIuB,KAAKI,UAAU,CAACF,SAAS,OAAO1B,YAAYE,UAAU;IAC1D,IAAIuB,UAAUI,IAAI,CAAC,CAACC,OAASA,KAAKF,UAAU,CAACF,UAAU;QACrD,OAAO1B,YAAYG,UAAU;IAC/B;IACA,IAAIqB,KAAKO,QAAQ,CAACL,SAAS,OAAO1B,YAAYI,SAAS;IAEvD,oEAAoE;IACpE,wEAAwE;IACxE,yEAAyE;IACzE,EAAE;IACF,4EAA4E;IAC5E,qEAAqE;IACrE,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,0EAA0E;IAC1E,4EAA4E;IAC5E,wCAAwC;IACxC,MAAM4B,kBAAkBV,MAAMW,KAAK,CAAC,CAACH,OACnCL,UAAUI,IAAI,CAAC,CAACK,WAAaA,SAASN,UAAU,CAACE;IAEnD,IAAIE,iBAAiB,OAAOhC,YAAYK,QAAQ;IAEhD,wEAAwE;IACxE,wEAAwE;IACxE,uDAAuD;IACvD,MAAM8B,QAAQ,EAACd,cAAAA,KAAKc,KAAK,YAAVd,cAAc,EAAE,EAC5Be,GAAG,CAAC,CAAC3B,QAAUD,cAAcC,QAC7BS,MAAM,CAACC;IACV,IAAIgB,MAAMZ,MAAM,GAAG,GAAG;QACpB,MAAMc,WAAWF,MAAMR,IAAI,CAAC;QAC5B,IAAIL,MAAMW,KAAK,CAAC,CAACH,OAASO,SAASN,QAAQ,CAACD,QAAQ;YAClD,OAAO9B,YAAYM,SAAS;QAC9B;IACF;IAEA,OAAO;AACT;AAEA;;;;;;;;;;;CAWC,GACD,OAAO,SAASgC,cACdC,CAAmC,EACnCC,CAAmC;IAEnC,IAAID,EAAEE,KAAK,KAAKD,EAAEC,KAAK,EAAE,OAAOD,EAAEC,KAAK,GAAGF,EAAEE,KAAK;IACjD,IAAIF,EAAEG,KAAK,CAACnB,MAAM,KAAKiB,EAAEE,KAAK,CAACnB,MAAM,EAAE,OAAOgB,EAAEG,KAAK,CAACnB,MAAM,GAAGiB,EAAEE,KAAK,CAACnB,MAAM;IAC7E,OAAOgB,EAAEG,KAAK,CAACC,aAAa,CAACH,EAAEE,KAAK;AACtC;AAEA;;;;;;;CAOC,GACD,OAAO,MAAME,mBAAmB,EAAC;AAEjC,2CAA2C,GAC3C,OAAO,SAASC,kBAAkB7B,KAAgC;IAChE,OAAOR,cAAcQ,OAAOO,MAAM,IAAIqB;AACxC"}

package/src/lib/app-utils/name-search.d.ts

@@ -0,0 +1,117 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * Normalized search key for a human display name (AGL-835).
+ *
+ * Firestore has no case-insensitive query, so name search is done by storing
+ * a normalized `nameLower` alongside the display name and running a prefix
+ * range query against it: `orderBy(nameLower) startAt(q) endAt(q + '')`.
+ * For that to match, the stored key and the typed query MUST be normalized the
+ * same way — so both the write paths (screen/host creates and renames) and the
+ * switcher's query builder run the raw text through this one function.
+ *
+ * Normalization is deliberately minimal and reversible-in-spirit: lower-case,
+ * trim, and collapse internal whitespace. Diacritics are intentionally NOT
+ * stripped — a user who types "café" should match the stored "café", and one
+ * who types "cafe" is doing a different search; folding accents here would make
+ * the prefix range silently disagree with the key. Returns '' for nullish or
+ * blank input, which callers treat as "no searchable name / skip the field".
+ */
+export declare function nameSearchKey(name: string | null | undefined): string;
+/**
+ * The longest word-prefix a token may be.
+ *
+ * Every prefix of every word is stored, so the token count grows with name
+ * LENGTH rather than word count. Twelve characters is past the point where a
+ * search box narrows anything — a reader who has typed twelve characters has
+ * already found it — and it keeps a long name from spending a hundred index
+ * entries on the tail of one word.
+ */
+export declare const NAME_TOKEN_MAX_PREFIX = 12;
+/** Ceiling on tokens per document, so a pathological name cannot bloat the index. */
+export declare const NAME_TOKEN_LIMIT = 120;
+/**
+ * Word-prefix tokens for `array-contains` search (AGL-2501).
+ *
+ * `nameSearchKey` supports a PREFIX range, which is anchored at the start of
+ * the whole name: "acme" finds "Acme Coffee" and "coffee" does not. That is
+ * the wrong shape for a search box, where the word a reader remembers is
+ * rarely the first one.
+ *
+ * Firestore cannot answer `contains` on a string, but it can answer
+ * `array-contains` on a field the write path prepared. Storing every prefix
+ * of every WORD turns "does this name contain a word starting with X" into a
+ * single indexed equality:
+ *
+ *   "Acme Coffee" → a, ac, acm, acme, c, co, cof, coff, coffe, coffee
+ *
+ * So "cof" finds it, and so does "acme". What it still cannot do is match
+ * mid-word — "offee" is not a prefix of any word — which is the honest edge
+ * of doing this without a search service.
+ *
+ * Normalized through `nameSearchKey` so the stored tokens and the typed query
+ * agree on case, trimming and internal whitespace; diacritics are kept, for
+ * the reason given there.
+ */
+export declare function nameSearchTokens(name: string | null | undefined): string[];
+/**
+ * The one token a typed query becomes.
+ *
+ * `array-contains` takes a single value, and Firestore allows only one such
+ * clause per query — so a multi-word query cannot be an AND on the server.
+ * The FIRST word is used, which is what a reader is narrowing by when they
+ * type "acme cof": they see the Acme results and read the rest themselves.
+ * Capped to the same prefix length the tokens were written at, or a longer
+ * query would match a token that was never stored.
+ */
+export declare function nameSearchToken(query: string | null | undefined): string;
+/**
+ * The normalized name, reversed, so "ends with" becomes a prefix range.
+ *
+ * Firestore has one string operator that is not equality: the range. That
+ * gives "starts with" directly — `>= q` and `<= q + ''` over
+ * `nameLower` — and gives "ends with" nothing at all, because a range is
+ * anchored at the front of the stored value.
+ *
+ * Reversing the stored key moves the end to the front. "Acme Coffee" is
+ * stored as "eeffoc emca", and a search for names ending "coffee" becomes a
+ * prefix range for "eeffoc" — the same query, on the same kind of index.
+ *
+ * Reversed by CODEPOINT (`[...key]`), not by UTF-16 unit: `split('')` cuts
+ * surrogate pairs in half, so an emoji or a non-BMP character in a workspace
+ * name would reverse into two lone surrogates and never match anything.
+ */
+export declare function nameSearchReversed(name: string | null | undefined): string;
+/**
+ * The three search fields that travel with a `name`, as one object.
+ *
+ * Every collection whose list is SEARCHED on the server carries them, and
+ * carrying only some is the failure mode worth designing against: `orderBy`
+ * drops a document missing the field it sorts by, and `array-contains` drops
+ * one missing the array. Either way the record still LISTS normally, so the
+ * gap shows up only as a search that quietly cannot find one row.
+ *
+ * ⚠️ Spread this at every write that sets `name`, and only where `name` is
+ * actually being written — a partial write that stamped an empty key over a
+ * real one would make the document unfindable by the name it still displays.
+ */
+export declare function nameSearchFields(name: string): {
+    name: string;
+    nameLower: string;
+    nameTokens: string[];
+    nameReversed: string;
+};

package/src/lib/app-utils/name-search.js

@@ -0,0 +1,145 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /**
+ * Normalized search key for a human display name (AGL-835).
+ *
+ * Firestore has no case-insensitive query, so name search is done by storing
+ * a normalized `nameLower` alongside the display name and running a prefix
+ * range query against it: `orderBy(nameLower) startAt(q) endAt(q + '')`.
+ * For that to match, the stored key and the typed query MUST be normalized the
+ * same way — so both the write paths (screen/host creates and renames) and the
+ * switcher's query builder run the raw text through this one function.
+ *
+ * Normalization is deliberately minimal and reversible-in-spirit: lower-case,
+ * trim, and collapse internal whitespace. Diacritics are intentionally NOT
+ * stripped — a user who types "café" should match the stored "café", and one
+ * who types "cafe" is doing a different search; folding accents here would make
+ * the prefix range silently disagree with the key. Returns '' for nullish or
+ * blank input, which callers treat as "no searchable name / skip the field".
+ */ export function nameSearchKey(name) {
+    return (name != null ? name : '').trim().replace(/\s+/g, ' ').toLowerCase();
+}
+/**
+ * The longest word-prefix a token may be.
+ *
+ * Every prefix of every word is stored, so the token count grows with name
+ * LENGTH rather than word count. Twelve characters is past the point where a
+ * search box narrows anything — a reader who has typed twelve characters has
+ * already found it — and it keeps a long name from spending a hundred index
+ * entries on the tail of one word.
+ */ export const NAME_TOKEN_MAX_PREFIX = 12;
+/** Ceiling on tokens per document, so a pathological name cannot bloat the index. */ export const NAME_TOKEN_LIMIT = 120;
+/**
+ * Word-prefix tokens for `array-contains` search (AGL-2501).
+ *
+ * `nameSearchKey` supports a PREFIX range, which is anchored at the start of
+ * the whole name: "acme" finds "Acme Coffee" and "coffee" does not. That is
+ * the wrong shape for a search box, where the word a reader remembers is
+ * rarely the first one.
+ *
+ * Firestore cannot answer `contains` on a string, but it can answer
+ * `array-contains` on a field the write path prepared. Storing every prefix
+ * of every WORD turns "does this name contain a word starting with X" into a
+ * single indexed equality:
+ *
+ *   "Acme Coffee" → a, ac, acm, acme, c, co, cof, coff, coffe, coffee
+ *
+ * So "cof" finds it, and so does "acme". What it still cannot do is match
+ * mid-word — "offee" is not a prefix of any word — which is the honest edge
+ * of doing this without a search service.
+ *
+ * Normalized through `nameSearchKey` so the stored tokens and the typed query
+ * agree on case, trimming and internal whitespace; diacritics are kept, for
+ * the reason given there.
+ */ export function nameSearchTokens(name) {
+    const key = nameSearchKey(name);
+    if (!key) return [];
+    const tokens = new Set();
+    for (const word of key.split(' ')){
+        if (!word) continue;
+        const capped = word.slice(0, NAME_TOKEN_MAX_PREFIX);
+        for(let end = 1; end <= capped.length; end += 1){
+            tokens.add(capped.slice(0, end));
+            if (tokens.size >= NAME_TOKEN_LIMIT) return [
+                ...tokens
+            ];
+        }
+    }
+    return [
+        ...tokens
+    ];
+}
+/**
+ * The one token a typed query becomes.
+ *
+ * `array-contains` takes a single value, and Firestore allows only one such
+ * clause per query — so a multi-word query cannot be an AND on the server.
+ * The FIRST word is used, which is what a reader is narrowing by when they
+ * type "acme cof": they see the Acme results and read the rest themselves.
+ * Capped to the same prefix length the tokens were written at, or a longer
+ * query would match a token that was never stored.
+ */ export function nameSearchToken(query) {
+    var _key_split_;
+    const key = nameSearchKey(query);
+    if (!key) return '';
+    return ((_key_split_ = key.split(' ')[0]) != null ? _key_split_ : '').slice(0, NAME_TOKEN_MAX_PREFIX);
+}
+/**
+ * The normalized name, reversed, so "ends with" becomes a prefix range.
+ *
+ * Firestore has one string operator that is not equality: the range. That
+ * gives "starts with" directly — `>= q` and `<= q + ''` over
+ * `nameLower` — and gives "ends with" nothing at all, because a range is
+ * anchored at the front of the stored value.
+ *
+ * Reversing the stored key moves the end to the front. "Acme Coffee" is
+ * stored as "eeffoc emca", and a search for names ending "coffee" becomes a
+ * prefix range for "eeffoc" — the same query, on the same kind of index.
+ *
+ * Reversed by CODEPOINT (`[...key]`), not by UTF-16 unit: `split('')` cuts
+ * surrogate pairs in half, so an emoji or a non-BMP character in a workspace
+ * name would reverse into two lone surrogates and never match anything.
+ */ export function nameSearchReversed(name) {
+    return [
+        ...nameSearchKey(name)
+    ].reverse().join('');
+}
+/**
+ * The three search fields that travel with a `name`, as one object.
+ *
+ * Every collection whose list is SEARCHED on the server carries them, and
+ * carrying only some is the failure mode worth designing against: `orderBy`
+ * drops a document missing the field it sorts by, and `array-contains` drops
+ * one missing the array. Either way the record still LISTS normally, so the
+ * gap shows up only as a search that quietly cannot find one row.
+ *
+ * ⚠️ Spread this at every write that sets `name`, and only where `name` is
+ * actually being written — a partial write that stamped an empty key over a
+ * real one would make the document unfindable by the name it still displays.
+ */ export function nameSearchFields(name) {
+    // `name` is INCLUDED so this is a drop-in replacement for writing `{ name }`.
+    // A helper that returned only the derived keys would be spread beside the
+    // name at four call sites, and the one that forgot would write search keys
+    // for a name it never stored.
+    return {
+        name,
+        nameLower: nameSearchKey(name),
+        nameTokens: nameSearchTokens(name),
+        nameReversed: nameSearchReversed(name)
+    };
+}
+
+//# sourceMappingURL=name-search.js.map