@selvajs/selva 4.20.0-beta.1 → 4.20.0-beta.11

package/build/server/chunks/chunks/dom-typeahead.svelte.js-BkbekRwa.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dom-typeahead.svelte.js-BkbekRwa.js","sources":["../../../../.svelte-kit/output/server/chunks/dom-typeahead.svelte.js"],"sourcesContent":["import { a as derived } from \"./server.js\";\nimport { y as boxWith } from \"./create-id.js\";\nimport { p as noop } from \"./scroll-lock.js\";\n//#region ../../node_modules/.pnpm/bits-ui@2.19.3_@internationalized+date@3.12.4_@sveltejs+kit@2.70.3_@opentelemetry+api@1_30b4406f5b6bd5e3091453cbf522c8c6/node_modules/bits-ui/dist/internal/arrays.js\n/**\n* Checks if the given index is valid for the given array.\n*\n* @param index - The index to check\n* @param arr - The array to check\n*/\nfunction isValidIndex(index, arr) {\n\treturn index >= 0 && index < arr.length;\n}\n/**\n* Returns the array element after the given index, or undefined for out-of-bounds or empty arrays.\n* @param array the array.\n* @param index the index of the current element.\n* @param loop loop to the beginning of the array if the next index is out of bounds?\n*/\n/**\n* Returns the array element after the given index, or undefined for out-of-bounds or empty arrays.\n* For single-element arrays, returns the element if the index is 0.\n* @param array the array.\n* @param index the index of the current element.\n* @param loop loop to the beginning of the array if the next index is out of bounds?\n*/\nfunction next(array, index, loop = true) {\n\tif (array.length === 0 || index < 0 || index >= array.length) return;\n\tif (array.length === 1 && index === 0) return array[0];\n\tif (index === array.length - 1) return loop ? array[0] : void 0;\n\treturn array[index + 1];\n}\n/**\n* Returns the array element prior to the given index, or undefined for out-of-bounds or empty arrays.\n* For single-element arrays, returns the element if the index is 0.\n* @param array the array.\n* @param index the index of the current element.\n* @param loop loop to the end of the array if the previous index is out of bounds?\n*/\nfunction prev(array, index, loop = true) {\n\tif (array.length === 0 || index < 0 || index >= array.length) return;\n\tif (array.length === 1 && index === 0) return array[0];\n\tif (index === 0) return loop ? array[array.length - 1] : void 0;\n\treturn array[index - 1];\n}\n/**\n* Returns the element some number after the given index. If the target index is out of bounds:\n*   - If looping is disabled, the first or last element will be returned.\n*   - If looping is enabled, it will wrap around the array.\n* Returns undefined for empty arrays or out-of-bounds initial indices.\n* @param array the array.\n* @param index the index of the current element.\n* @param increment the number of elements to move forward (can be negative).\n* @param loop loop around the array if the target index is out of bounds?\n*/\nfunction forward(array, index, increment, loop = true) {\n\tif (array.length === 0 || index < 0 || index >= array.length) return;\n\tlet targetIndex = index + increment;\n\tif (loop) targetIndex = (targetIndex % array.length + array.length) % array.length;\n\telse targetIndex = Math.max(0, Math.min(targetIndex, array.length - 1));\n\treturn array[targetIndex];\n}\n/**\n* Returns the element some number before the given index. If the target index is out of bounds:\n*   - If looping is disabled, the first or last element will be returned.\n*   - If looping is enabled, it will wrap around the array.\n* Returns undefined for empty arrays or out-of-bounds initial indices.\n* @param array the array.\n* @param index the index of the current element.\n* @param decrement the number of elements to move backward (can be negative).\n* @param loop loop around the array if the target index is out of bounds?\n*/\nfunction backward(array, index, decrement, loop = true) {\n\tif (array.length === 0 || index < 0 || index >= array.length) return;\n\tlet targetIndex = index - decrement;\n\tif (loop) targetIndex = (targetIndex % array.length + array.length) % array.length;\n\telse targetIndex = Math.max(0, Math.min(targetIndex, array.length - 1));\n\treturn array[targetIndex];\n}\n/**\n* Finds the next matching item from a list of values based on a search string.\n*\n* This function handles several special cases in typeahead behavior:\n*\n* 1. Space handling: When a search string ends with a space, it handles it specially:\n*    - If there's only one match for the text before the space, it ignores the space\n*    - If there are multiple matches and the current match already starts with the search prefix\n*      followed by a space, it keeps the current match (doesn't change selection on space)\n*    - Only after typing characters beyond the space will it move to a more specific match\n*\n* 2. Repeated character handling: If a search consists of repeated characters (e.g., \"aaa\"),\n*    it treats it as a single character for matching purposes\n*\n* 3. Cycling behavior: The function wraps around the values array starting from the current match\n*    to find the next appropriate match, creating a cycling selection behavior\n*\n* @param values - Array of string values to search through (e.g., the text content of menu items)\n* @param search - The current search string typed by the user\n* @param currentMatch - The currently selected/matched item, if any\n* @returns The next matching value that should be selected, or undefined if no match is found\n*/\nfunction getNextMatch(values, search, currentMatch) {\n\tconst lowerSearch = search.toLowerCase();\n\tif (lowerSearch.endsWith(\" \")) {\n\t\tconst searchWithoutSpace = lowerSearch.slice(0, -1);\n\t\t/**\n\t\t* If there's only one match for the prefix without space, we don't\n\t\t* watch to match with space.\n\t\t*/\n\t\tif (values.filter((value) => value.toLowerCase().startsWith(searchWithoutSpace)).length <= 1) return getNextMatch(values, searchWithoutSpace, currentMatch);\n\t\tconst currentMatchLowercase = currentMatch?.toLowerCase();\n\t\t/**\n\t\t* If the current match already starts with the search prefix and has a space afterward,\n\t\t* and the user has only typed up to that space, keep the current match until they\n\t\t* disambiguate.\n\t\t*/\n\t\tif (currentMatchLowercase && currentMatchLowercase.startsWith(searchWithoutSpace) && currentMatchLowercase.charAt(searchWithoutSpace.length) === \" \" && search.trim() === searchWithoutSpace) return currentMatch;\n\t\t/**\n\t\t* With multiple matches, find items that match the full search string with space\n\t\t*/\n\t\tconst spacedMatches = values.filter((value) => value.toLowerCase().startsWith(lowerSearch));\n\t\t/**\n\t\t* If we found matches with the space, use the first one that's not the current match\n\t\t*/\n\t\tif (spacedMatches.length > 0) {\n\t\t\tconst currentMatchIndex = currentMatch ? values.indexOf(currentMatch) : -1;\n\t\t\treturn wrapArray(spacedMatches, Math.max(currentMatchIndex, 0)).find((match) => match !== currentMatch) || currentMatch;\n\t\t}\n\t}\n\tconst normalizedSearch = search.length > 1 && Array.from(search).every((char) => char === search[0]) ? search[0] : search;\n\tconst normalizedLowerSearch = normalizedSearch.toLowerCase();\n\tconst currentMatchIndex = currentMatch ? values.indexOf(currentMatch) : -1;\n\tlet wrappedValues = wrapArray(values, Math.max(currentMatchIndex, 0));\n\tif (normalizedSearch.length === 1) wrappedValues = wrappedValues.filter((v) => v !== currentMatch);\n\tconst nextMatch = wrappedValues.find((value) => value?.toLowerCase().startsWith(normalizedLowerSearch));\n\treturn nextMatch !== currentMatch ? nextMatch : void 0;\n}\n/**\n* Wraps an array around itself at a given start index\n* Example: `wrapArray(['a', 'b', 'c', 'd'], 2) === ['c', 'd', 'a', 'b']`\n*/\nfunction wrapArray(array, startIndex) {\n\treturn array.map((_, index) => array[(startIndex + index) % array.length]);\n}\n//#endregion\n//#region ../../node_modules/.pnpm/bits-ui@2.19.3_@internationalized+date@3.12.4_@sveltejs+kit@2.70.3_@opentelemetry+api@1_30b4406f5b6bd5e3091453cbf522c8c6/node_modules/bits-ui/dist/internal/box-auto-reset.svelte.js\nvar defaultOptions = {\n\tafterMs: 1e4,\n\tonChange: noop\n};\nfunction boxAutoReset(defaultValue, options) {\n\tconst { afterMs, onChange, getWindow } = {\n\t\t...defaultOptions,\n\t\t...options\n\t};\n\tlet timeout = null;\n\tlet value = defaultValue;\n\tfunction resetAfter() {\n\t\treturn getWindow().setTimeout(() => {\n\t\t\tvalue = defaultValue;\n\t\t\tonChange?.(defaultValue);\n\t\t}, afterMs);\n\t}\n\treturn boxWith(() => value, (v) => {\n\t\tvalue = v;\n\t\tonChange?.(v);\n\t\tif (timeout) getWindow().clearTimeout(timeout);\n\t\ttimeout = resetAfter();\n\t});\n}\n//#endregion\n//#region ../../node_modules/.pnpm/bits-ui@2.19.3_@internationalized+date@3.12.4_@sveltejs+kit@2.70.3_@opentelemetry+api@1_30b4406f5b6bd5e3091453cbf522c8c6/node_modules/bits-ui/dist/internal/dom-typeahead.svelte.js\nvar DOMTypeahead = class {\n\t#opts;\n\t#search;\n\t#onMatch = derived(() => {\n\t\tif (this.#opts.onMatch) return this.#opts.onMatch;\n\t\treturn (node) => node.focus();\n\t});\n\t#getCurrentItem = derived(() => {\n\t\tif (this.#opts.getCurrentItem) return this.#opts.getCurrentItem;\n\t\treturn this.#opts.getActiveElement;\n\t});\n\tconstructor(opts) {\n\t\tthis.#opts = opts;\n\t\tthis.#search = boxAutoReset(\"\", {\n\t\t\tafterMs: 1e3,\n\t\t\tgetWindow: opts.getWindow\n\t\t});\n\t\tthis.handleTypeaheadSearch = this.handleTypeaheadSearch.bind(this);\n\t\tthis.resetTypeahead = this.resetTypeahead.bind(this);\n\t}\n\thandleTypeaheadSearch(key, candidates) {\n\t\tif (!candidates.length) return;\n\t\tthis.#search.current = this.#search.current + key;\n\t\tconst currentItem = this.#getCurrentItem()();\n\t\tconst currentMatch = candidates.find((item) => item === currentItem)?.textContent?.trim() ?? \"\";\n\t\tconst nextMatch = getNextMatch(candidates.map((item) => item.textContent?.trim() ?? \"\"), this.#search.current, currentMatch);\n\t\tconst newItem = candidates.find((item) => item.textContent?.trim() === nextMatch);\n\t\tif (newItem) this.#onMatch()(newItem);\n\t\treturn newItem;\n\t}\n\tresetTypeahead() {\n\t\tthis.#search.current = \"\";\n\t}\n\tget search() {\n\t\treturn this.#search.current;\n\t}\n};\n//#endregion\nexport { getNextMatch as a, prev as c, forward as i, boxAutoReset as n, isValidIndex as o, backward as r, next as s, DOMTypeahead as t };\n"],"names":[],"mappings":";;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;AAClC,CAAC,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE;AACzC,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;AAC/D,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC;AACvD,CAAC,IAAI,KAAK,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM;AAChE,CAAC,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE;AACzC,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;AAC/D,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC;AACvD,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,OAAO,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM;AAChE,CAAC,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,GAAG,IAAI,EAAE;AACvD,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;AAC/D,CAAC,IAAI,WAAW,GAAG,KAAK,GAAG,SAAS;AACpC,CAAC,IAAI,IAAI,EAAE,WAAW,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM;AACnF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACxE,CAAC,OAAO,KAAK,CAAC,WAAW,CAAC;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,GAAG,IAAI,EAAE;AACxD,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;AAC/D,CAAC,IAAI,WAAW,GAAG,KAAK,GAAG,SAAS;AACpC,CAAC,IAAI,IAAI,EAAE,WAAW,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM;AACnF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACxE,CAAC,OAAO,KAAK,CAAC,WAAW,CAAC;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE;AACpD,CAAC,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,EAAE;AACzC,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;AAChC,EAAE,MAAM,kBAAkB,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;AACrD;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,OAAO,YAAY,CAAC,MAAM,EAAE,kBAAkB,EAAE,YAAY,CAAC;AAC7J,EAAE,MAAM,qBAAqB,GAAG,YAAY,EAAE,WAAW,EAAE;AAC3D;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,qBAAqB,IAAI,qBAAqB,CAAC,UAAU,CAAC,kBAAkB,CAAC,IAAI,qBAAqB,CAAC,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,kBAAkB,EAAE,OAAO,YAAY;AACnN;AACA;AACA;AACA,EAAE,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AAC7F;AACA;AACA;AACA,EAAE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE;AAChC,GAAG,MAAM,iBAAiB,GAAG,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE;AAC7E,GAAG,OAAO,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,KAAK,YAAY,CAAC,IAAI,YAAY;AAC1H,EAAE;AACF,CAAC;AACD,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM;AAC1H,CAAC,MAAM,qBAAqB,GAAG,gBAAgB,CAAC,WAAW,EAAE;AAC7D,CAAC,MAAM,iBAAiB,GAAG,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE;AAC3E,CAAC,IAAI,aAAa,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;AACtE,CAAC,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC;AACnG,CAAC,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,WAAW,EAAE,CAAC,UAAU,CAAC,qBAAqB,CAAC,CAAC;AACxG,CAAC,OAAO,SAAS,KAAK,YAAY,GAAG,SAAS,GAAG,MAAM;AACvD;AACA;AACA;AACA;AACA;AACA,SAAS,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE;AACtC,CAAC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,KAAK,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;AAC3E;AACA;AACA;AACA,IAAI,cAAc,GAAG;AACrB,CAAC,OAAO,EAAE,GAAG;AACb,CAAC,QAAQ,EAAE;AACX,CAAC;AACD,SAAS,YAAY,CAAC,YAAY,EAAE,OAAO,EAAE;AAC7C,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG;AAC1C,EAAE,GAAG,cAAc;AACnB,EAAE,GAAG;AACL,EAAE;AACF,CAAC,IAAI,OAAO,GAAG,IAAI;AACnB,CAAC,IAAI,KAAK,GAAG,YAAY;AACzB,CAAC,SAAS,UAAU,GAAG;AACvB,EAAE,OAAO,SAAS,EAAE,CAAC,UAAU,CAAC,MAAM;AACtC,GAAG,KAAK,GAAG,YAAY;AACvB,GAAG,QAAQ,GAAG,YAAY,CAAC;AAC3B,EAAE,CAAC,EAAE,OAAO,CAAC;AACb,CAAC;AACD,CAAC,OAAO,OAAO,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,KAAK;AACpC,EAAE,KAAK,GAAG,CAAC;AACX,EAAE,QAAQ,GAAG,CAAC,CAAC;AACf,EAAE,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC;AAChD,EAAE,OAAO,GAAG,UAAU,EAAE;AACxB,CAAC,CAAC,CAAC;AACH;AACA;AACA;AACG,IAAC,YAAY,GAAG,MAAM;AACzB,CAAC,KAAK;AACN,CAAC,OAAO;AACR,CAAC,QAAQ,GAAG,OAAO,CAAC,MAAM;AAC1B,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO;AACnD,EAAE,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;AAC/B,CAAC,CAAC,CAAC;AACH,CAAC,eAAe,GAAG,OAAO,CAAC,MAAM;AACjC,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc;AACjE,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB;AACpC,CAAC,CAAC,CAAC;AACH,CAAC,WAAW,CAAC,IAAI,EAAE;AACnB,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI;AACnB,EAAE,IAAI,CAAC,OAAO,GAAG,YAAY,CAAC,EAAE,EAAE;AAClC,GAAG,OAAO,EAAE,GAAG;AACf,GAAG,SAAS,EAAE,IAAI,CAAC;AACnB,GAAG,CAAC;AACJ,EAAE,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC;AACpE,EAAE,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC;AACtD,CAAC;AACD,CAAC,qBAAqB,CAAC,GAAG,EAAE,UAAU,EAAE;AACxC,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE;AAC1B,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,GAAG,GAAG;AACnD,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,EAAE,EAAE;AAC9C,EAAE,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,KAAK,WAAW,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,IAAI,EAAE;AACjG,EAAE,MAAM,SAAS,GAAG,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC;AAC9H,EAAE,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,KAAK,SAAS,CAAC;AACnF,EAAE,IAAI,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC;AACvC,EAAE,OAAO,OAAO;AAChB,CAAC;AACD,CAAC,cAAc,GAAG;AAClB,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,GAAG,EAAE;AAC3B,CAAC;AACD,CAAC,IAAI,MAAM,GAAG;AACd,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO;AAC7B,CAAC;AACD;;;;"}

package/build/server/chunks/chunks/engine.server.js-DlfvB835.js

@@ -0,0 +1,585 @@
+import { b as private_env } from './shared-server.js-BGs15m2r.js';
+import './src.js-CkFJvvTE.js';
+import { k as lazyLogger, g as getLogger } from './providers.server.js-CzinZrUx.js';
+import { N as NoopLogger } from './access.js-BataxwA1.js';
+import { U, g as ge$1, o, m as mt, t, e, G as Ge } from './grasshopper.js-julMp0aw.js';
+import { c as computeLimits } from './computeLimits.js-sJYSzVht.js';
+import { gunzipSync, gzip } from 'node:zlib';
+import { promisify } from 'node:util';
+
+//#region ../solve/dist/server.js
+function f(e, n) {
+	return mt.fromValues(e.filter((e) => e.paramType).map((e) => ({
+		paramName: e.nickname,
+		paramType: e.paramType,
+		value: n[e.id] ?? e.default,
+		minimum: e.minimum,
+		maximum: e.maximum
+	})));
+}
+var p = promisify(gzip);
+var h = `X-Selva-Compute-Version`;
+async function g(e$1) {
+	let { client: t$2, signal: n } = e$1, a = performance.now(), o = e$1.inputTree ?? f(e$1.inputs, e$1.values), s = performance.now() - a, c = null, l, u, d = performance.now();
+	try {
+		let r = await t$2.scheduler.solveDetailed(e$1.definitionSource, o, {
+			signal: n,
+			selvaevents: e$1.selvaEvents,
+			onServerTiming: (e) => {
+				c = {
+					decode: e.decode ?? 0,
+					solve: e.solve ?? 0,
+					encode: e.encode ?? 0
+				};
+			}
+		});
+		l = r.response, u = {
+			fromCache: r.fromCache,
+			definitionReuploaded: r.definitionReuploaded
+		};
+	} catch (t$1) {
+		let a = performance.now() - d, o = t$1 instanceof Error && t$1.name === `AbortError` || t$1 instanceof t && t$1.code === e.ABORTED, s = t$1 instanceof t && t$1.code === e.TIMEOUT_ERROR;
+		if (o || s) return o && n.aborted ? {
+			kind: `client_abort`,
+			durationMs: a
+		} : {
+			kind: `timeout`,
+			durationMs: a,
+			message: `Solve exceeded the ${Math.round(e$1.solveDeadlineMs / 1e3)}s deadline.`
+		};
+		if (t$1 instanceof t) {
+			if (t$1.code === e.RESPONSE_TOO_LARGE) return { kind: `too_large` };
+			if (t$1.code === e.QUEUE_FULL) return {
+				kind: `shed`,
+				durationMs: a,
+				reason: `queue_full`,
+				retryAfterSeconds: 1,
+				message: `Compute server is at capacity. Retry shortly.`
+			};
+			if (t$1.code === e.QUEUE_TIMEOUT) return {
+				kind: `shed`,
+				durationMs: a,
+				reason: `queue_timeout`,
+				retryAfterSeconds: 1,
+				message: `Compute request waited too long in the queue. Retry shortly.`
+			};
+		}
+		return {
+			kind: `compute_error`,
+			durationMs: a,
+			error: t$1
+		};
+	}
+	let m = performance.now() - d, g = performance.now(), _;
+	try {
+		_ = JSON.stringify(l);
+	} catch (e) {
+		if (e instanceof RangeError) return { kind: `too_large` };
+		throw e;
+	}
+	if (_.length > e$1.responseMaxBytes) return { kind: `too_large` };
+	let y = performance.now() - g, b = /\bgzip\b/i.test(e$1.acceptEncoding) && _.length > 1024, x = null, S = 0;
+	if (b) {
+		let e = performance.now();
+		x = await p(Buffer.from(_)), S = performance.now() - e;
+	}
+	let C = performance.now() - e$1.loadStartMs, w = {
+		"Content-Type": `application/json`,
+		"Server-Timing": v({
+			defLoadMs: e$1.defLoadMs,
+			treeBuildMs: s,
+			solveMs: m,
+			serializeMs: y,
+			gzipMs: S,
+			serverTotalMs: C,
+			rhino: c,
+			settle: u,
+			byteRefOutcome: e$1.byteRefOutcome,
+			prepMarks: e$1.prepMarks ?? []
+		}),
+		[h]: `1`,
+		Vary: `Accept-Encoding`
+	}, T = {
+		treeBuildMs: s,
+		solveMs: m,
+		serializeMs: y,
+		gzipMs: S,
+		serverTotalMs: C,
+		serializedBytes: _.length,
+		compressedBytes: x?.byteLength ?? null
+	}, E;
+	return x ? (w[`Content-Encoding`] = `gzip`, w[`Content-Length`] = String(x.byteLength), E = {
+		body: new Uint8Array(x),
+		encoding: `gzip`,
+		headers: w,
+		result: l,
+		metrics: T
+	}) : (w[`Content-Length`] = String(Buffer.byteLength(_)), E = {
+		body: _,
+		headers: w,
+		result: l,
+		metrics: T
+	}), {
+		kind: `ok`,
+		envelope: E,
+		solveMs: m,
+		errorCount: l.errors?.length ?? 0,
+		warningCount: l.warnings?.length ?? 0
+	};
+}
+function _(e, t) {
+	let n = /\bgzip\b/i.test(t);
+	if (e.encoding === `gzip` && !n) {
+		let t = gunzipSync(e.body instanceof Uint8Array ? e.body : Buffer.from(e.body)).toString(`utf8`), n = { ...e.headers };
+		return delete n[`Content-Encoding`], n[`Content-Length`] = String(Buffer.byteLength(t)), {
+			body: t,
+			headers: n
+		};
+	}
+	return {
+		body: e.body,
+		headers: e.headers
+	};
+}
+function v(e) {
+	let t = `load;dur=${e.defLoadMs.toFixed(1)}, tree;dur=${e.treeBuildMs.toFixed(1)}, solve;dur=${e.solveMs.toFixed(1)}, serialize;dur=${e.serializeMs.toFixed(1)}, gzip;dur=${e.gzipMs.toFixed(1)}, total;dur=${e.serverTotalMs.toFixed(1)}`, n = e.rhino;
+	if (n) {
+		let r = n.decode + n.solve + n.encode, i = Math.max(0, e.solveMs - r);
+		t += `, rhino_decode;dur=${n.decode.toFixed(1)}, rhino_solve;dur=${n.solve.toFixed(1)}, rhino_encode;dur=${n.encode.toFixed(1)}, compute_link;dur=${i.toFixed(1)}`;
+	}
+	for (let [n, r] of e.prepMarks) t += `, p_${n};dur=${r.toFixed(1)}`;
+	let r = e.settle;
+	t += `, selva_cache;dur=${+!!r.fromCache}`, r.definitionReuploaded !== void 0 && (t += `, def_reupload;dur=${+!!r.definitionReuploaded}`);
+	let i = e.byteRefOutcome;
+	if (i) {
+		let e = i.loaded ? i.fromCache ? `hit` : `miss` : `skipped`;
+		t += `, def_bytes;desc=${e}`;
+	}
+	return t;
+}
+var b = 5e3;
+function x(t) {
+	let n = t.maxWarmComputeServers ?? 16, r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), o$1 = /* @__PURE__ */ new Map();
+	t.debug === `verbose` && o();
+	let s = (e) => {
+		t.debug && t.onDebugLog?.(e);
+	};
+	async function c(n, r) {
+		let i = t.debug === `verbose`, a = {
+			serverUrl: n.serverUrl,
+			apiKey: n.apiKey,
+			debug: i,
+			cachesolve: t.cachesolve,
+			cacheerroredsolves: t.cacheerroredsolves,
+			maxResponseBytes: t.maxResponseBytes
+		};
+		t.debug && (a.onServerTiming = (e) => {
+			let n = e.decode ?? 0, r = e.solve ?? 0, i = e.encode ?? 0, a = n <= 1 ? `HIT (definition reused, no re-upload/parse)` : `miss (full parse)`, o = t.cachesolve && r <= 1 ? `HIT (cached result, solve skipped)` : t.cachesolve ? `miss (solved fresh)` : `off`;
+			s(`[Compute/rhino-cache] decode=${n}ms solve=${r}ms encode=${i}ms | definition-cache: ${a} | solve-cache (cachesolve): ${o}`);
+		}), r && (a.headers = { "X-Selva-Definition": r });
+		let o = await Ge.create(a), c = 1, l = 0, u = false;
+		async function d(e) {
+			if (!u) {
+				u = true;
+				try {
+					let t = await Promise.resolve(o.serverStats?.getActiveChildren({ initialize: !1 })).catch(() => null);
+					l = Date.now();
+					let n = !t || t <= 0 ? 1 : t;
+					if (n === c) return;
+					s(`[Compute/client-cache] concurrency ${c} → ${n} (server child count)`), c = n, e?.setMaxConcurrent(n);
+				} finally {
+					u = false;
+				}
+			}
+		}
+		await d();
+		let f = o.createScheduler({
+			mode: `queue`,
+			maxConcurrent: c,
+			maxQueueDepth: t.maxQueueDepth || void 0,
+			queueWaitMs: t.queueWaitMs || void 0,
+			timeoutMs: t.solveDeadlineMs,
+			cache: t.responseCacheMaxBytes > 0 && { maxBytes: t.responseCacheMaxBytes },
+			reuseServerDefinitionCache: t.reuseServerDefinitionCache,
+			onSettle: (e, n) => {
+				if (n.status === `success` && (n.fromCache !== true && Date.now() - l >= 3e5 && d(f), t.debug && (s(`[Compute/selva-cache] ${n.fromCache ? `HIT  — served from cache (no compute call)` : `miss — went to Rhino.Compute`} (${Math.round(n.durationMs)}ms)`), n.fromCache || s(n.definitionReuploaded === true ? `[Compute/def-cache] miss — definition RE-UPLOADED (pointer was cold/stale)` : n.definitionReuploaded === false ? `[Compute/def-cache] HIT  — definition reused from server cache (no upload)` : `[Compute/def-cache] n/a — reuse disabled or non-reusable definition`), !n.fromCache))) {
+					let e = n.response?.errors, r = Array.isArray(e) ? e.length : 0;
+					if (r > 0) {
+						let n = t.cacheerroredsolves ? `cached (cacheerroredsolves on)` : `not cached (cacheerroredsolves off) — re-run until fixed`;
+						s(`[Compute/rhino-cache] ${r} GH error(s); ${n}. First: ${JSON.stringify(e[0])}`);
+					}
+				}
+			}
+		});
+		return {
+			client: o,
+			scheduler: f
+		};
+	}
+	return {
+		async getClient(e, t) {
+			let a = e.id, l = r.get(a);
+			if (l) return r.delete(a), r.set(a, l), l;
+			let u = i.get(a);
+			if (u) return u;
+			let d = o$1.get(a);
+			if (d) {
+				if (Date.now() - d.at < b) throw s(`[Compute/client-cache] server ${a} failed to build <${b}ms ago — replaying error`), d.error;
+				o$1.delete(a);
+			}
+			s(`[Compute/client-cache] miss — building warm client for server ${a}`);
+			let f = (async () => {
+				let i;
+				try {
+					i = await c(e, t?.definitionGuid);
+				} catch (e) {
+					throw o$1.set(a, {
+						error: e,
+						at: Date.now()
+					}), e;
+				}
+				if (r.size >= n) {
+					let e = r.keys().next().value;
+					e !== void 0 && (s(`[Compute/client-cache] LRU evicted warm client for server ${e} (cap ${n})`), r.get(e)?.scheduler.dispose(), r.delete(e));
+				}
+				return r.set(a, i), i;
+			})().finally(() => i.delete(a));
+			return i.set(a, f), f;
+		},
+		evict(e) {
+			let t = e;
+			o$1.delete(t);
+			let n = r.get(t);
+			n && (s(`[Compute/client-cache] evicted warm client for server ${t} (config change)`), n.scheduler.dispose(), r.delete(t));
+		},
+		solveCacheStats() {
+			let e = {
+				warmClients: r.size,
+				entries: 0,
+				bytes: 0,
+				hits: 0,
+				misses: 0,
+				evictions: 0
+			};
+			for (let t of r.values()) {
+				let n = t.scheduler.cacheStats();
+				e.entries += n.entries, e.bytes += n.bytes, e.hits += n.hits, e.misses += n.misses, e.evictions += n.evictions;
+			}
+			return e;
+		},
+		clearSolveCaches() {
+			s(`[Compute/client-cache] cleared solve caches on ${r.size} warm client(s)`);
+			for (let e of r.values()) e.scheduler.clearCache();
+		},
+		disposeAll() {
+			s(`[Compute/client-cache] disposing all ${r.size} warm client(s)`);
+			for (let e of r.values()) e.scheduler.dispose();
+			r.clear(), o$1.clear();
+		}
+	};
+}
+function S(e) {
+	let t = Math.max(0, Math.floor(e)), n = /* @__PURE__ */ new Map(), r = 0, i = {
+		hits: 0,
+		misses: 0,
+		evictions: 0
+	};
+	function a(e, t) {
+		n.delete(e), n.set(e, t);
+	}
+	function o() {
+		for (; r > t && n.size > 0;) {
+			let e = n.keys().next().value, t = n.get(e);
+			n.delete(e), r -= t.bytes.byteLength, i.evictions += 1;
+		}
+	}
+	function s(e, i) {
+		if (t === 0 || i.byteLength > t) return;
+		let a = n.get(e);
+		a && (r -= a.bytes.byteLength), n.set(e, { bytes: i }), r += i.byteLength, o();
+	}
+	return {
+		getOrLoad(e, t) {
+			let r = {
+				loaded: false,
+				fromCache: false
+			};
+			return {
+				key: e,
+				outcome: r,
+				load: async () => {
+					let o = n.get(e);
+					if (o) return a(e, o), i.hits += 1, r.loaded = true, r.fromCache = true, o.bytes;
+					i.misses += 1, r.loaded = true, r.fromCache = false;
+					let c = await t();
+					return s(e, c), c;
+				}
+			};
+		},
+		stats() {
+			return {
+				hits: i.hits,
+				misses: i.misses,
+				evictions: i.evictions,
+				entries: n.size,
+				bytes: r
+			};
+		},
+		clear() {
+			n.clear(), r = 0;
+		}
+	};
+}
+function C(e = {}) {
+	let t = /* @__PURE__ */ new Map();
+	return {
+		run(n, r, i) {
+			let a = t.get(n);
+			if (a) return e.onJoin?.(n), a.notifyOwner?.(), a.promise;
+			let o = {
+				notifyOwner: i,
+				promise: void 0
+			}, s = (async () => r())().finally(() => {
+				o.notifyOwner = void 0, t.get(n) === o && t.delete(n);
+			});
+			return o.promise = s, t.set(n, o), s;
+		},
+		inFlight() {
+			return t.size;
+		}
+	};
+}
+function w(e) {
+	return typeof e == `object` && !!e && !(e instanceof Uint8Array) && `outcome` in e;
+}
+function T(e) {
+	return typeof e == `object` && !!e && !(e instanceof Uint8Array) && !(`outcome` in e) && !(`key` in e) && `versionId` in e;
+}
+var E = class {
+	limits;
+	clientCache;
+	byteCache;
+	singleFlight;
+	constructor(e) {
+		this.limits = e.limits;
+		let t = e.logger ?? new NoopLogger();
+		this.clientCache = x({
+			solveDeadlineMs: this.limits.solveDeadlineMs,
+			cachesolve: this.limits.computeServerCachesolve,
+			cacheerroredsolves: this.limits.computeCacheErroredSolves,
+			reuseServerDefinitionCache: this.limits.computeReuseDefinitionCache,
+			maxQueueDepth: this.limits.computeMaxQueueDepth,
+			queueWaitMs: this.limits.computeQueueWaitMs,
+			responseCacheMaxBytes: this.limits.computeSolveCacheBytes,
+			maxResponseBytes: this.limits.computeResponseMaxBytes,
+			debug: e.debug ?? false,
+			maxWarmComputeServers: e.maxWarmComputeServers,
+			onDebugLog: e.onDebugLog ?? ((e) => t.debug(e, { component: `Compute/client-cache` }))
+		}), this.byteCache = S(this.limits.computeDefinitionCacheBytes), this.singleFlight = C({ onJoin: e.onSolveCoalesced });
+	}
+	getClient(e, t) {
+		return this.clientCache.getClient(e, t);
+	}
+	definitionRef(e, t) {
+		return this.byteCache.getOrLoad(e, t);
+	}
+	evictServer(e) {
+		this.clientCache.evict(e);
+	}
+	clearSolveCaches() {
+		this.clientCache.clearSolveCaches();
+	}
+	clearDefinitionCache() {
+		this.byteCache.clear();
+	}
+	stats() {
+		return {
+			client: this.clientCache.solveCacheStats(),
+			definitionBytes: this.byteCache.stats(),
+			coalescing: { inFlight: this.singleFlight.inFlight() }
+		};
+	}
+	async solve(e) {
+		let { definitionSource: t, byteRefOutcome: r, identity: i } = this.resolveDefinitionSource(e), a = await this.clientCache.getClient(e.server, { definitionGuid: e.definitionGuid }), o = f(e.inputs, e.values), s = `${i}:${e.server.id}:${U(o)}`, c = new AbortController(), l = false, u = () => {
+			l || c.abort();
+		};
+		e.signal.addEventListener(`abort`, u, { once: true });
+		let d = e.acceptEncoding ?? ``, p;
+		try {
+			p = await this.singleFlight.run(s, () => g({
+				definitionSource: t,
+				byteRefOutcome: r,
+				inputs: e.inputs,
+				values: e.values,
+				inputTree: o,
+				client: a,
+				responseMaxBytes: this.limits.computeResponseMaxBytes,
+				solveDeadlineMs: this.limits.solveDeadlineMs,
+				acceptEncoding: d,
+				selvaEvents: e.selvaEvents,
+				signal: c.signal,
+				loadStartMs: e.loadStartMs ?? performance.now(),
+				defLoadMs: e.defLoadMs ?? 0,
+				prepMarks: e.prepMarks
+			}), () => {
+				l = !0;
+			});
+		} finally {
+			e.signal.removeEventListener(`abort`, u);
+		}
+		if (p.kind !== `ok`) return p;
+		let m = _(p.envelope, d);
+		return {
+			...p,
+			envelope: {
+				...p.envelope,
+				body: m.body,
+				headers: m.headers
+			}
+		};
+	}
+	toResponse(e, t) {
+		let n = (e, n) => {
+			t?.onError && t.onError(e, n);
+			let r = { "Content-Type": `application/json` };
+			return n.retryAfter !== void 0 && (r[`Retry-After`] = String(n.retryAfter)), {
+				status: e,
+				headers: r,
+				body: JSON.stringify(n)
+			};
+		};
+		switch (e.kind) {
+			case `ok`: return {
+				status: 200,
+				headers: e.envelope.headers,
+				body: e.envelope.body
+			};
+			case `timeout`: return n(504, { message: e.message });
+			case `client_abort`: return n(499, { message: `Client closed request` });
+			case `too_large`: return n(413, { message: `Solve result is too large to return. This usually means a file output exceeds the supported size.` });
+			case `shed`: return n(503, {
+				message: e.message,
+				retryAfter: e.retryAfterSeconds
+			});
+			case `compute_error`: throw e.error;
+		}
+	}
+	toWebResponse(e) {
+		let t = this.toResponse(e);
+		return new Response(typeof t.body == `string` ? t.body : new Uint8Array(t.body), {
+			status: t.status,
+			headers: t.headers
+		});
+	}
+	resolveDefinitionSource(e) {
+		let t = e.definitionSource;
+		if (T(t)) {
+			let e = this.byteCache.getOrLoad(t.versionId, t.load);
+			return {
+				definitionSource: e,
+				byteRefOutcome: e.outcome,
+				identity: e.key
+			};
+		}
+		if (w(t)) return {
+			definitionSource: t,
+			byteRefOutcome: t.outcome,
+			identity: t.key
+		};
+		if (ge$1(t)) return {
+			definitionSource: t,
+			identity: t.key
+		};
+		if (!e.definitionKey) throw Error(`SolveEngine.solve(): definitionKey is required when definitionSource is raw bytes or a string.`);
+		return {
+			definitionSource: t,
+			identity: e.definitionKey
+		};
+	}
+};
+//#endregion
+//#region src/lib/server/compute/engine.server.ts
+/**
+* App-wide `SolveEngine` instance (`@selvajs/solve/server`) — backs the warm
+* client cache, the definition-byte cache, and solve coalescing for the whole app.
+*/
+/**
+* `SELVA_FLAG_COMPUTE_DEBUG` is a three-way knob, not a boolean: `off` (default),
+* `on` (concise cache/timing logs), or `verbose` (adds full lib-level request/
+* response dumps, incl. base64 geometry). `verbose` implies `on`.
+*
+* `SELVA_FLAG_COMPUTE_DEBUG_VERBOSE` still honoured (as `verbose`) so an
+* operator's existing `.env` degrades to a warning instead of silently losing
+* the verbose logging they asked for.
+*/
+var COMPUTE_DEBUG_MODE = (() => {
+	const raw = (private_env.SELVA_FLAG_COMPUTE_DEBUG ?? "").toLowerCase();
+	if (raw === "verbose") return "verbose";
+	const on = [
+		"true",
+		"1",
+		"yes",
+		"on"
+	].includes(raw);
+	if ([
+		"true",
+		"1",
+		"yes"
+	].includes((private_env.SELVA_FLAG_COMPUTE_DEBUG_VERBOSE ?? "").toLowerCase())) {
+		getLogger().warn("Deprecated env var: rename it", {
+			component: "selva",
+			envVar: "SELVA_FLAG_COMPUTE_DEBUG_VERBOSE",
+			renamedTo: "SELVA_FLAG_COMPUTE_DEBUG=verbose"
+		});
+		return "verbose";
+	}
+	return on ? "on" : "off";
+})();
+var COMPUTE_DEBUG = COMPUTE_DEBUG_MODE !== "off";
+var engine = new E({
+	limits: computeLimits,
+	logger: lazyLogger,
+	debug: COMPUTE_DEBUG ? COMPUTE_DEBUG_MODE === "verbose" ? "verbose" : true : false,
+	onDebugLog: (message) => getLogger().debug(message, { component: "Compute/client-cache" }),
+	onSolveCoalesced: (key) => {
+		if (COMPUTE_DEBUG) getLogger().debug("Coalesced onto in-flight solve", {
+			component: "Compute/single-flight",
+			key: `${key.slice(0, 96)}…`
+		});
+	}
+});
+/** Get (or create) the warm client + scheduler for a resolved compute server. */
+function getClient(serverConfig, opts) {
+	return engine.getClient({
+		id: serverConfig.id,
+		serverUrl: serverConfig.serverUrl,
+		apiKey: serverConfig.apiKey
+	}, opts);
+}
+/** Drop the warm client for a server whose config just changed (URL/key rotation or deletion). */
+function evictComputeClient(id) {
+	engine.evictServer(id);
+}
+/**
+* Drop cached solve results held by this Selva process (every warm client's
+* scheduler). Separate from the compute server's own `cache/purge`: that one
+* clears Rhino's `cachesolve`, this one clears the layer in front of it.
+*/
+function clearSolveResultCache() {
+	engine.clearSolveCaches();
+}
+/** Drop the `.gh` bytes this Selva process is holding. Costs a storage re-read, nothing more. */
+function clearDefinitionCache() {
+	engine.clearDefinitionCache();
+}
+/** Solve-cache counters for the admin panel's hit rate. */
+function solveCacheStats() {
+	return engine.stats().client;
+}
+/** Definition-byte-cache counters (hits/misses/evictions/entries/bytes) for admin/debug surfaces. */
+function definitionByteCacheStats() {
+	return engine.stats().definitionBytes;
+}
+
+export { COMPUTE_DEBUG as C, clearDefinitionCache as a, engine as b, clearSolveResultCache as c, definitionByteCacheStats as d, evictComputeClient as e, getClient as g, solveCacheStats as s };
+//# sourceMappingURL=engine.server.js-DlfvB835.js.map