@vielzeug/scout 2.2.0 → 2.2.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (7) hide show
  1. package/dist/scout.cjs +1 -1
  2. package/dist/scout.cjs.map +1 -1
  3. package/dist/scout.iife.js +1 -1
  4. package/dist/scout.iife.js.map +1 -1
  5. package/dist/scout.js +1 -1
  6. package/dist/scout.js.map +1 -1
  7. package/package.json +2 -2
package/dist/scout.cjs CHANGED
@@ -1,2 +1,2 @@
1
- Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});function e(e,t){let n,r=-1,i=new Set;return(a,o)=>((o!==n||e.revision!==r)&&(n=o,r=e.revision,i=new Set(e.search(o,t).map(e=>e.item))),i.has(a))}function t(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var n=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},r=class extends n{},i=class extends n{};function a(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function o(e){return e==null?``:typeof e==`string`?e:typeof e==`number`||typeof e==`boolean`?String(e):Array.isArray(e)?e.filter(e=>typeof e==`string`||typeof e==`number`||typeof e==`boolean`).join(` `):``}function s(e,t){let n=e.toLowerCase(),r=a(t).split(` `).filter(Boolean),i=[];for(let e of r){let t=0;for(;t<n.length;){let r=n.indexOf(e,t);if(r===-1)break;i.push([r,r+e.length]),t=r+1}}i.sort((e,t)=>e[0]-t[0]);let o=[];for(let e of i){let t=o[o.length-1];t&&e[0]<=t[1]?t[1]=Math.max(t[1],e[1]):o.push([e[0],e[1]])}return o}function c(e,t){if(!e)return[];if(!t.length)return[{highlighted:!1,text:e}];let n=[],r=0;for(let[i,a]of t)i>r&&n.push({highlighted:!1,text:e.slice(r,i)}),a>i&&n.push({highlighted:!0,text:e.slice(i,a)}),r=a;return r<e.length&&n.push({highlighted:!1,text:e.slice(r)}),n}function l(e,t,n){return c(n,e.matches.find(e=>e.field===t)?.ranges??[])}var u=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},d=class extends u{},f=class extends u{},p=class extends u{},m=class extends u{},h=Symbol.for(`@vielzeug/ripple/reactive`),g=100,_=Symbol(`ripple.unset`),v=class{[h]=!0;dependents=new Set;name;runtime;constructor(e,t){this.runtime=e,this.name=t}subscribe(e){this.runtime.assertActive(),this.peek();let t={dependencies:new Set,onDependencyChanged:()=>this.runtime.enqueueListener(e)};return this.dependents.add(t),()=>this.dependents.delete(t)}notify(){for(let e of[...this.dependents])e.onDependencyChanged()}},y=class extends v{current;equals;constructor(e,t,n){super(e,n?.name),this.current=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.current}set value(e){if(this.runtime.assertActive(),this.equals(this.current,e))return;let t=this.current;this.current=e,this.runtime.emit({kind:`write`,name:this.name,next:e,previous:t}),this.runtime.propagate(()=>this.notify())}peek(){return this.current}update(e){this.value=e(this.current)}},b=class extends v{dependencies=new Set;computing=!1;disposed=!1;dirty=!0;current=_;derive;equals;constructor(e,t,n){super(e,n?.name),this.derive=t,this.equals=n?.equals??Object.is}get value(){return this.refresh(),this.runtime.track(this),this.current}peek(){return this.refresh(),this.current}onDependencyChanged(){this.disposed||(this.dirty||=!0,this.dependents.size>0&&this.refresh()&&this.notify())}dispose(){this.disposed||(this.disposed=!0,this.runtime.clearDependencies(this),this.dependents.clear())}refresh(){if(!this.dirty||this.disposed)return!1;if(this.computing)throw new d(`computed cycle detected${this.name===void 0?``:` "${this.name}"`}`);this.computing=!0,this.runtime.emit({kind:`compute`,name:this.name});try{let e=this.runtime.collect(this,this.derive),t=this.current===_||!this.equals(this.current,e);return this.current=e,this.dirty=!1,t}finally{this.computing=!1}}},x=class{disposalController=new AbortController;owned=new Set;name;isDisposed=!1;runtime;constructor(e,t){this.runtime=e,this.name=t}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}run(e){if(this.isDisposed)throw new p(`Cannot run a disposed scope.`);return this.runtime.withScope(this,e)}dispose(){if(!this.isDisposed){this.isDisposed=!0;for(let e of[...this.owned].reverse())e.dispose();this.owned.clear(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.name,node:`scope`})}}[Symbol.dispose](){this.dispose()}},S=class{dependencies=new Set;disposalController=new AbortController;cleanup;isDisposed=!1;owner;scheduled=!1;callback;options;runtime;constructor(e,t,n){this.runtime=e,this.callback=t,this.options=n}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}onDependencyChanged(){if(!this.isDisposed){if(this.options?.scheduler===`microtask`){if(this.scheduled)return;this.scheduled=!0,queueMicrotask(()=>{this.scheduled=!1,this.isDisposed||this.runtime.enqueue(this)});return}this.runtime.enqueue(this)}}run(){if(this.isDisposed)return;this.owner?.dispose(),this.owner=void 0,this.runCleanup(),this.runtime.emit({kind:`effect`,name:this.options?.name});let e=new x(this.runtime);try{let t=this.runtime.withEffectScope(e,()=>this.runtime.collectEffect(this,this.callback));this.owner=e,this.cleanup=typeof t==`function`?t:void 0}catch(t){e.dispose(),this.runtime.report(t,{kind:`effect`,name:this.options?.name})}}dispose(){this.isDisposed||(this.isDisposed=!0,this.owner?.dispose(),this.owner=void 0,this.runtime.clearDependencies(this),this.runCleanup(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.options?.name,node:`effect`}))}[Symbol.dispose](){this.dispose()}runCleanup(){let e=this.cleanup;if(this.cleanup=void 0,e!==void 0)try{e()}catch(e){this.runtime.report(e,{kind:`cleanup`,name:this.options?.name})}}},C=class{activeEffectScope;activeObserver;activeScope;isDisposed=!1;flushDepth=0;flushing=!1;pending=new Set;listeners=new Set;rootScope;observer;onError;constructor(e){this.observer=e?.observer,this.onError=e?.onError??(e=>{queueMicrotask(()=>{throw e})}),this.rootScope=new x(this,`runtime`),this.activeScope=this.rootScope}get disposed(){return this.isDisposed}signal=(e,t)=>(this.assertActive(),new y(this,e,t));computed=(e,t)=>{this.assertActive();let n=new b(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n};effect=(e,t)=>{this.assertActive();let n=new S(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n.run(),n};createScope=e=>{this.assertActive();let t=new x(this,e);return this.activeScope.owned.add(t),t};batch=e=>(this.assertActive(),this.propagate(e));untrack=e=>(this.assertActive(),this.withObserver(void 0,e));dispose(){this.isDisposed||(this.isDisposed=!0,this.rootScope.dispose())}assertActive(){if(this.isDisposed)throw new f(`Cannot use a disposed Ripple runtime.`)}track(e){let t=this.activeObserver;t?.collecting!==void 0&&t.collecting.add(e)}clearDependencies(e){for(let t of e.dependencies)t.dependents.delete(e);e.dependencies.clear()}collect(e,t){return this.collectWith(e,t,!1)}collectEffect(e,t){return this.collectWith(e,t,!0)}withEffectScope(e,t){let n=this.activeEffectScope;this.activeEffectScope=e;try{return t()}finally{this.activeEffectScope=n}}withObserver(e,t){let n=this.activeObserver;this.activeObserver=e;try{return t()}finally{this.activeObserver=n}}withScope(e,t){let n=this.activeEffectScope,r=this.activeScope;this.activeEffectScope=void 0,this.activeScope=e;try{return t()}finally{this.activeEffectScope=n,this.activeScope=r}}enqueue(e){this.pending.add(e),this.flushDepth===0&&this.flush()}enqueueListener(e){this.listeners.add(e),this.flushDepth===0&&this.flush()}propagate(e){this.flushDepth++;try{return e()}finally{this.flushDepth--,this.flushDepth===0&&this.flush()}}emit(e){try{this.observer?.(e)}catch(t){this.report(t,{kind:`observer`,name:e.name})}}report(e,t){try{this.onError(e,t)}catch(e){queueMicrotask(()=>{throw e})}}collectWith(e,t,n){let r=this.activeObserver,i=new Set;e.collecting=i,this.activeObserver=e;try{let n=t();return this.commitDependencies(e,i),n}catch(t){throw n&&this.commitDependencies(e,i),t}finally{e.collecting=void 0,this.activeObserver=r}}commitDependencies(e,t){for(let n of e.dependencies)t.has(n)||n.dependents.delete(e);for(let n of t)e.dependencies.has(n)||n.dependents.add(e);e.dependencies.clear();for(let n of t)e.dependencies.add(n)}flush(){if(this.flushing)return;this.flushing=!0;let e=0;try{for(;this.pending.size>0||this.listeners.size>0;){if(++e>g)throw new m(`infinite reactive flush (>${g} iterations)`);let t=[...this.pending],n=[...this.listeners];this.pending.clear(),this.listeners.clear();for(let e of t)e.run();for(let e of n)try{e()}catch(e){this.report(e,{kind:`listener`})}}}finally{this.flushing=!1}}},w=e=>(t,n,r)=>{let i=e.signal({status:`pending`},{name:r?.name}),a=e.signal(0),o,s=!1,c=()=>{a.value,o?.abort();let e=i.peek(),r=e.status===`success`?e.value:`previous`in e?e.previous:void 0,c;try{c=t()}catch(e){i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`};return}let l=new AbortController;o=l,i.value=r===void 0?{status:`pending`}:{previous:r,status:`pending`};let u;try{u=Promise.resolve(n(c,{signal:l.signal}))}catch(e){u=Promise.reject(e)}u.then(e=>{!s&&!l.signal.aborted&&(i.value={status:`success`,value:e})},e=>{!s&&!l.signal.aborted&&(i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`})})},l=e.effect(()=>(c(),()=>o?.abort()),{name:r?.name});l.disposalSignal.addEventListener(`abort`,()=>{s=!0},{once:!0});let u={get disposalSignal(){return l.disposalSignal},dispose:()=>l.dispose(),get disposed(){return s},get name(){return i.name},peek:()=>i.peek(),reload:()=>{s||(a.value=a.peek()+1)},subscribe:e=>i.subscribe(e),[Symbol.dispose](){this.dispose()},get value(){return i.value}};return Object.defineProperty(u,h,{value:!0}),u},T=e=>(t,n,r)=>{let i=typeof t==`function`?t:()=>t.value,a=r?.equals??Object.is,o=!0,s,c=!1,l=e.effect(()=>{let e=i();if(o){o=!1,s=e,r?.immediate&&(n(e,void 0),r?.once&&(c=!0));return}if(a(s,e))return;let t=s;s=e,n(e,t),r?.once&&l.dispose()},{name:r?.name});return c&&l.dispose(),l},E=(e=>{let t=new C(e),n=w(t);return{batch:t.batch,computed:t.computed,createScope:t.createScope,dispose:()=>t.dispose(),get disposed(){return t.disposed},effect:t.effect,resource:n,signal:t.signal,untrack:t.untrack,watch:T(t)}})(),D=E.signal,O=E.computed;E.effect;var k=E.batch;E.createScope,E.untrack,E.watch,E.resource;function A(e){let t=new Set,n=` ${e} `;for(let e=0;e<n.length-2;e++)t.add(n.slice(e,e+3));return t}function j(e,t){if(e.size===0||t.size===0)return 0;let n=0;for(let r of e)t.has(r)&&n++;return n<2&&n<e.size?0:n/Math.min(e.size,t.size)}function M(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new i(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function N(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new i(`${t} must be a finite number between ${n} and ${r}.`);return e}function P(e){return e.map(e=>typeof e==`string`?{field:e,stringify:o,weight:1}:{field:e.field,stringify:e.stringify??o,weight:N(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function F(e,t){if(t.fields.length===0)throw new i(`createIndex: at least one field is required.`);let n=P(t.fields),r=n.reduce((e,t)=>Math.max(e,t.weight),1),o=N(t.threshold??.2,`threshold`,0,1),c=M(t.limit??50,`limit`,0),l=M(t.minQueryLength??3,`minQueryLength`,1),u=new Map,d=new Map,f=new Set,p=0;function m(){p++;for(let e of f)e()}let h=null,g=null;function _(e){return e===h&&g!==null?g:(h=e,g=A(e),g)}function v(e,t){for(let n of t){let t=d.get(n);t||(t=new Set,d.set(n,t)),t.add(e)}}function y(e,t){for(let n of t){let t=d.get(n);t&&(t.delete(e),t.size===0&&d.delete(n))}}function b(e){let t=new Map,r=new Map;for(let{field:i,stringify:o}of n){let n=e[i],s=o(n),c=a(s),l=c.length>=1?A(c):new Set;t.set(i,l),r.set(i,s),v(e,l)}u.set(e,{trigrams:t,values:r})}function x(e){let t=new Set;for(let[n,r]of u)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function S(e){let t=new Set;for(let n of e){let e=d.get(n);if(e)for(let n of e)t.add(n)}return t}function C(e,t,i){let a=0;for(let{field:o,weight:s}of n){let n;if(t===null)n=+!!(i.values.get(o)??``).toLowerCase().includes(e);else{let e=i.trigrams.get(o);if(!e||e.size===0)continue;n=j(t,e)}let c=s/r*n;c>a&&(a=c)}return a}function w(e,t){let r=[];for(let{field:i}of n){let n=t.get(i);if(!n)continue;let a=s(n,e);a.length>0&&r.push({field:i,ranges:a})}return r}function T(e){let t=u.get(e);if(!t)return!1;let r=!1;for(let{field:i,stringify:o}of n){let n=o(e[i]);if(n===t.values.get(i))continue;r=!0;let s=t.trigrams.get(i);s&&y(e,s);let c=a(n),l=c.length>=1?A(c):new Set;t.trigrams.set(i,l),t.values.set(i,n),v(e,l)}return r}function E(e){let t=u.get(e);if(!t)return!1;for(let n of t.trigrams.values())y(e,n);return u.delete(e),!0}for(let t of e)u.has(t)||b(t);return{add(e){u.has(e)||(b(e),m())},get items(){return[...u.keys()]},onMutate(e){return f.add(e),()=>{f.delete(e)}},reindex(e){T(e)&&m()},remove(e){E(e)&&m()},get revision(){return p},search(e,t){let n=N(t?.threshold??o,`threshold`,0,1),r=M(t?.limit??c,`limit`,0),i=M(t?.minQueryLength??l,`minQueryLength`,1);if(!e.trim())return[...u.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let s=a(e);if(!s)return[];let d=s.length<i?null:_(s),f=d===null?x(s):S(d),p=[];for(let e of f){let t=u.get(e);if(!t)continue;let r=C(s,d,t);if(r>=n){let n=w(s,t.values);p.push({item:e,matches:n,score:r})}}return p.sort((e,t)=>t.score-e.score).slice(0,r)},setItems(e){let t=new Set(e),n=[...t],r=!1;for(let e of[...u.keys()])t.has(e)||(E(e),r=!0);for(let e of n)u.has(e)?T(e)&&(r=!0):(b(e),r=!0);let i=[...u.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,u.get(e)]));u.clear();for(let[t,n]of e)u.set(t,n);r=!0}r&&m()},get size(){return u.size}}}var I=200;function L(e,t={}){let{debounce:n=I,limit:a,minQueryLength:o,threshold:s}=t;if(!Number.isFinite(n)||!Number.isInteger(n)||n<0)throw new i(`debounce must be a finite non-negative integer.`);let c=D(``,{name:`scout:query`}),l=D(``,{name:`scout:committedQuery`}),u=D(0,{name:`scout:indexVersion`}),d=e.onMutate(()=>{u.value++}),f=O(()=>c.value!==l.value,{name:`scout:isSearching`}),p=O(()=>(u.value,e.search(l.value,{limit:a,minQueryLength:o,threshold:s})),{name:`scout:results`}),m=null;function h(){m!==null&&(clearTimeout(m),m=null)}let g=c.subscribe(()=>{let e=c.peek();if(h(),e!==l.peek()){if(n===0){l.value=e;return}m=setTimeout(()=>{l.value=e,m=null},n)}});function _(){if(v)throw new r(`SearchState.clear() called after dispose()`);h(),k(()=>{c.value=``,l.value=``})}let v=!1,y=new AbortController;function b(){v=!0,y.abort(),h(),g(),d()}return{clear:_,get disposalSignal(){return y.signal},dispose:b,get disposed(){return v},isSearching:f,query:c,results:p,[Symbol.dispose](){b()}}}function R(e,t){let n=F(e,{fields:t.fields,limit:t.limit,minQueryLength:t.minQueryLength,threshold:t.threshold}),r=L(n,{debounce:t.debounce});return Object.assign(Object.create(r),{index:n})}function z(e){let t=V();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var B;function V(){return B===void 0&&(B=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),B}exports.ScoutConfigurationError=i,exports.ScoutDisposedError=r,exports.ScoutError=n,exports.createIndex=F,exports.createReactiveSearch=R,exports.createSearch=L,exports.findMatchRanges=s,exports.highlight=c,exports.highlightField=l,exports.segmentWords=z,exports.toFilterPredicate=t,exports.toSearchMatcher=e;
1
+ Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});function e(e,t){let n,r=-1,i=new Set;return(a,o)=>((o!==n||e.revision!==r)&&(n=o,r=e.revision,i=new Set(e.search(o,t).map(e=>e.item))),i.has(a))}function t(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var n=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},r=class extends n{},i=class extends n{};function a(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function o(e){return e==null?``:typeof e==`string`?e:typeof e==`number`||typeof e==`boolean`?String(e):Array.isArray(e)?e.filter(e=>typeof e==`string`||typeof e==`number`||typeof e==`boolean`).join(` `):``}function s(e,t){let n=e.toLowerCase(),r=a(t).split(` `).filter(Boolean),i=[];for(let e of r){let t=0;for(;t<n.length;){let r=n.indexOf(e,t);if(r===-1)break;i.push([r,r+e.length]),t=r+1}}i.sort((e,t)=>e[0]-t[0]);let o=[];for(let e of i){let t=o[o.length-1];t&&e[0]<=t[1]?t[1]=Math.max(t[1],e[1]):o.push([e[0],e[1]])}return o}function c(e,t){if(!e)return[];if(!t.length)return[{highlighted:!1,text:e}];let n=[],r=0;for(let[i,a]of t)i>r&&n.push({highlighted:!1,text:e.slice(r,i)}),a>i&&n.push({highlighted:!0,text:e.slice(i,a)}),r=a;return r<e.length&&n.push({highlighted:!1,text:e.slice(r)}),n}function l(e,t,n){return c(n,e.matches.find(e=>e.field===t)?.ranges??[])}var u=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},d=class extends u{},f=class extends u{},p=class extends u{},m=class extends u{},h=Symbol.for(`@vielzeug/ripple/reactive`),g=100,_=Symbol(`ripple.unset`),v=class{[h]=!0;dependents=new Set;name;runtime;constructor(e,t){this.runtime=e,this.name=t}subscribe(e){this.runtime.assertActive(),this.peek();let t={dependencies:new Set,onDependencyChanged:()=>this.runtime.enqueueListener(e)};return this.dependents.add(t),()=>this.dependents.delete(t)}notify(){for(let e of[...this.dependents])e.onDependencyChanged()}},y=class extends v{current;equals;constructor(e,t,n){super(e,n?.name),this.current=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.current}set value(e){if(this.runtime.assertActive(),this.equals(this.current,e))return;let t=this.current;this.current=e,this.runtime.emit({kind:`write`,name:this.name,next:e,previous:t}),this.runtime.propagate(()=>this.notify())}peek(){return this.current}update(e){this.value=e(this.current)}},b=class extends v{dependencies=new Set;computing=!1;disposed=!1;dirty=!0;current=_;derive;equals;constructor(e,t,n){super(e,n?.name),this.derive=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.refresh(),this.current}peek(){return this.refresh(),this.current}onDependencyChanged(){this.disposed||(this.dirty||=!0,this.dependents.size>0&&this.refresh()&&this.notify())}dispose(){this.disposed||(this.disposed=!0,this.runtime.clearDependencies(this),this.dependents.clear())}refresh(){if(!this.dirty||this.disposed)return!1;if(this.computing)throw new d(`computed cycle detected${this.name===void 0?``:` "${this.name}"`}`);this.computing=!0,this.runtime.emit({kind:`compute`,name:this.name});try{let e=this.runtime.collect(this,this.derive),t=this.current===_||!this.equals(this.current,e);return this.current=e,this.dirty=!1,t}finally{this.computing=!1}}},x=class{disposalController=new AbortController;owned=new Set;name;isDisposed=!1;runtime;constructor(e,t){this.runtime=e,this.name=t}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}run(e){if(this.isDisposed)throw new p(`Cannot run a disposed scope.`);return this.runtime.withScope(this,e)}dispose(){if(!this.isDisposed){this.isDisposed=!0;for(let e of[...this.owned].reverse())e.dispose();this.owned.clear(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.name,node:`scope`})}}[Symbol.dispose](){this.dispose()}},S=class{dependencies=new Set;disposalController=new AbortController;cleanup;isDisposed=!1;owner;scheduled=!1;callback;options;runtime;constructor(e,t,n){this.runtime=e,this.callback=t,this.options=n}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}onDependencyChanged(){if(!this.isDisposed){if(this.options?.scheduler===`microtask`){if(this.scheduled)return;this.scheduled=!0,queueMicrotask(()=>{this.scheduled=!1,this.isDisposed||this.runtime.enqueue(this)});return}this.runtime.enqueue(this)}}run(){if(this.isDisposed)return;this.owner?.dispose(),this.owner=void 0,this.runCleanup(),this.runtime.emit({kind:`effect`,name:this.options?.name});let e=new x(this.runtime);try{let t=this.runtime.withEffectScope(e,()=>this.runtime.collectEffect(this,this.callback));this.owner=e,this.cleanup=typeof t==`function`?t:void 0}catch(t){e.dispose(),this.runtime.report(t,{kind:`effect`,name:this.options?.name})}}dispose(){this.isDisposed||(this.isDisposed=!0,this.owner?.dispose(),this.owner=void 0,this.runtime.clearDependencies(this),this.runCleanup(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.options?.name,node:`effect`}))}[Symbol.dispose](){this.dispose()}runCleanup(){let e=this.cleanup;if(this.cleanup=void 0,e!==void 0)try{e()}catch(e){this.runtime.report(e,{kind:`cleanup`,name:this.options?.name})}}},C=class{activeEffectScope;activeObserver;activeScope;isDisposed=!1;flushDepth=0;flushing=!1;pending=new Set;listeners=new Set;rootScope;observer;onError;constructor(e){this.observer=e?.observer,this.onError=e?.onError??(e=>{queueMicrotask(()=>{throw e})}),this.rootScope=new x(this,`runtime`),this.activeScope=this.rootScope}get disposed(){return this.isDisposed}signal=(e,t)=>(this.assertActive(),new y(this,e,t));computed=(e,t)=>{this.assertActive();let n=new b(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n};effect=(e,t)=>{this.assertActive();let n=new S(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n.run(),n};createScope=e=>{this.assertActive();let t=new x(this,e);return this.activeScope.owned.add(t),t};batch=e=>(this.assertActive(),this.propagate(e));untrack=e=>(this.assertActive(),this.withObserver(void 0,e));dispose(){this.isDisposed||(this.isDisposed=!0,this.rootScope.dispose())}assertActive(){if(this.isDisposed)throw new f(`Cannot use a disposed Ripple runtime.`)}track(e){let t=this.activeObserver;t?.collecting!==void 0&&t.collecting.add(e)}clearDependencies(e){for(let t of e.dependencies)t.dependents.delete(e);e.dependencies.clear()}collect(e,t){return this.collectWith(e,t,e.dependencies.size===0)}collectEffect(e,t){return this.collectWith(e,t,!0)}withEffectScope(e,t){let n=this.activeEffectScope;this.activeEffectScope=e;try{return t()}finally{this.activeEffectScope=n}}withObserver(e,t){let n=this.activeObserver;this.activeObserver=e;try{return t()}finally{this.activeObserver=n}}withScope(e,t){let n=this.activeEffectScope,r=this.activeScope;this.activeEffectScope=void 0,this.activeScope=e;try{return t()}finally{this.activeEffectScope=n,this.activeScope=r}}enqueue(e){this.pending.add(e),this.flushDepth===0&&this.flush()}enqueueListener(e){this.listeners.add(e),this.flushDepth===0&&this.flush()}propagate(e){this.flushDepth++;try{return e()}finally{this.flushDepth--,this.flushDepth===0&&this.flush()}}emit(e){try{this.observer?.(e)}catch(t){this.report(t,{kind:`observer`,name:e.name})}}report(e,t){try{this.onError(e,t)}catch(e){queueMicrotask(()=>{throw e})}}collectWith(e,t,n){let r=this.activeObserver,i=new Set;e.collecting=i,this.activeObserver=e;try{let n=t();return this.commitDependencies(e,i),n}catch(t){throw n&&this.commitDependencies(e,i),t}finally{e.collecting=void 0,this.activeObserver=r}}commitDependencies(e,t){for(let n of e.dependencies)t.has(n)||n.dependents.delete(e);for(let n of t)e.dependencies.has(n)||n.dependents.add(e);e.dependencies.clear();for(let n of t)e.dependencies.add(n)}flush(){if(this.flushing)return;this.flushing=!0;let e=0;try{for(;this.pending.size>0||this.listeners.size>0;){if(++e>g)throw new m(`infinite reactive flush (>${g} iterations)`);let t=[...this.pending],n=[...this.listeners];this.pending.clear(),this.listeners.clear();for(let e of t)e.run();for(let e of n)try{e()}catch(e){this.report(e,{kind:`listener`})}}}finally{this.flushing=!1}}},w=e=>(t,n,r)=>{let i=e.signal({status:`pending`},{name:r?.name}),a=e.signal(0),o,s=!1,c=()=>{a.value,o?.abort();let e=i.peek(),r=e.status===`success`?e.value:`previous`in e?e.previous:void 0,c;try{c=t()}catch(e){i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`};return}let l=new AbortController;o=l,i.value=r===void 0?{status:`pending`}:{previous:r,status:`pending`};let u;try{u=Promise.resolve(n(c,{signal:l.signal}))}catch(e){u=Promise.reject(e)}u.then(e=>{!s&&!l.signal.aborted&&(i.value={status:`success`,value:e})},e=>{!s&&!l.signal.aborted&&(i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`})})},l=e.effect(()=>(c(),()=>o?.abort()),{name:r?.name});l.disposalSignal.addEventListener(`abort`,()=>{s=!0},{once:!0});let u={get disposalSignal(){return l.disposalSignal},dispose:()=>l.dispose(),get disposed(){return s},get name(){return i.name},peek:()=>i.peek(),reload:()=>{s||(a.value=a.peek()+1)},subscribe:e=>i.subscribe(e),[Symbol.dispose](){this.dispose()},get value(){return i.value}};return Object.defineProperty(u,h,{value:!0}),u},T=e=>(t,n,r)=>{let i=typeof t==`function`?t:()=>t.value,a=r?.equals??Object.is,o=!0,s,c=!1,l=e.effect(()=>{let e=i();if(o){o=!1,s=e,r?.immediate&&(n(e,void 0),r?.once&&(c=!0));return}if(a(s,e))return;let t=s;s=e,n(e,t),r?.once&&l.dispose()},{name:r?.name});return c&&l.dispose(),l},E=(e=>{let t=new C(e),n=w(t);return{batch:t.batch,computed:t.computed,createScope:t.createScope,dispose:()=>t.dispose(),get disposed(){return t.disposed},effect:t.effect,resource:n,signal:t.signal,untrack:t.untrack,watch:T(t)}})(),D=E.signal,O=E.computed;E.effect;var k=E.batch;E.createScope,E.untrack,E.watch,E.resource;function A(e){let t=new Set,n=` ${e} `;for(let e=0;e<n.length-2;e++)t.add(n.slice(e,e+3));return t}function j(e,t){if(e.size===0||t.size===0)return 0;let n=0;for(let r of e)t.has(r)&&n++;return n<2&&n<e.size?0:n/Math.min(e.size,t.size)}function M(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new i(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function N(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new i(`${t} must be a finite number between ${n} and ${r}.`);return e}function P(e){return e.map(e=>typeof e==`string`?{field:e,stringify:o,weight:1}:{field:e.field,stringify:e.stringify??o,weight:N(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function F(e,t){if(t.fields.length===0)throw new i(`createIndex: at least one field is required.`);let n=P(t.fields),r=n.reduce((e,t)=>Math.max(e,t.weight),1),o=N(t.threshold??.2,`threshold`,0,1),c=M(t.limit??50,`limit`,0),l=M(t.minQueryLength??3,`minQueryLength`,1),u=new Map,d=new Map,f=new Set,p=0;function m(){p++;for(let e of f)e()}let h=null,g=null;function _(e){return e===h&&g!==null?g:(h=e,g=A(e),g)}function v(e,t){for(let n of t){let t=d.get(n);t||(t=new Set,d.set(n,t)),t.add(e)}}function y(e,t){for(let n of t){let t=d.get(n);t&&(t.delete(e),t.size===0&&d.delete(n))}}function b(e){let t=new Map,r=new Map;for(let{field:i,stringify:o}of n){let n=e[i],s=o(n),c=a(s),l=c.length>=1?A(c):new Set;t.set(i,l),r.set(i,s),v(e,l)}u.set(e,{trigrams:t,values:r})}function x(e){let t=new Set;for(let[n,r]of u)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function S(e){let t=new Set;for(let n of e){let e=d.get(n);if(e)for(let n of e)t.add(n)}return t}function C(e,t,i){let a=0;for(let{field:o,weight:s}of n){let n;if(t===null)n=+!!(i.values.get(o)??``).toLowerCase().includes(e);else{let e=i.trigrams.get(o);if(!e||e.size===0)continue;n=j(t,e)}let c=s/r*n;c>a&&(a=c)}return a}function w(e,t){let r=[];for(let{field:i}of n){let n=t.get(i);if(!n)continue;let a=s(n,e);a.length>0&&r.push({field:i,ranges:a})}return r}function T(e){let t=u.get(e);if(!t)return!1;let r=!1;for(let{field:i,stringify:o}of n){let n=o(e[i]);if(n===t.values.get(i))continue;r=!0;let s=t.trigrams.get(i);s&&y(e,s);let c=a(n),l=c.length>=1?A(c):new Set;t.trigrams.set(i,l),t.values.set(i,n),v(e,l)}return r}function E(e){let t=u.get(e);if(!t)return!1;for(let n of t.trigrams.values())y(e,n);return u.delete(e),!0}for(let t of e)u.has(t)||b(t);return{add(e){u.has(e)||(b(e),m())},get items(){return[...u.keys()]},onMutate(e){return f.add(e),()=>{f.delete(e)}},reindex(e){T(e)&&m()},remove(e){E(e)&&m()},get revision(){return p},search(e,t){let n=N(t?.threshold??o,`threshold`,0,1),r=M(t?.limit??c,`limit`,0),i=M(t?.minQueryLength??l,`minQueryLength`,1);if(!e.trim())return[...u.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let s=a(e);if(!s)return[];let d=s.length<i?null:_(s),f=d===null?x(s):S(d),p=[];for(let e of f){let t=u.get(e);if(!t)continue;let r=C(s,d,t);if(r>=n){let n=w(s,t.values);p.push({item:e,matches:n,score:r})}}return p.sort((e,t)=>t.score-e.score).slice(0,r)},setItems(e){let t=new Set(e),n=[...t],r=!1;for(let e of[...u.keys()])t.has(e)||(E(e),r=!0);for(let e of n)u.has(e)?T(e)&&(r=!0):(b(e),r=!0);let i=[...u.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,u.get(e)]));u.clear();for(let[t,n]of e)u.set(t,n);r=!0}r&&m()},get size(){return u.size}}}var I=200;function L(e,t={}){let{debounce:n=I,limit:a,minQueryLength:o,threshold:s}=t;if(!Number.isFinite(n)||!Number.isInteger(n)||n<0)throw new i(`debounce must be a finite non-negative integer.`);let c=D(``,{name:`scout:query`}),l=D(``,{name:`scout:committedQuery`}),u=D(0,{name:`scout:indexVersion`}),d=e.onMutate(()=>{u.value++}),f=O(()=>c.value!==l.value,{name:`scout:isSearching`}),p=O(()=>(u.value,e.search(l.value,{limit:a,minQueryLength:o,threshold:s})),{name:`scout:results`}),m=null;function h(){m!==null&&(clearTimeout(m),m=null)}let g=c.subscribe(()=>{let e=c.peek();if(h(),e!==l.peek()){if(n===0){l.value=e;return}m=setTimeout(()=>{l.value=e,m=null},n)}});function _(){if(v)throw new r(`SearchState.clear() called after dispose()`);h(),k(()=>{c.value=``,l.value=``})}let v=!1,y=new AbortController;function b(){v=!0,y.abort(),h(),g(),d()}return{clear:_,get disposalSignal(){return y.signal},dispose:b,get disposed(){return v},isSearching:f,query:c,results:p,[Symbol.dispose](){b()}}}function R(e,t){let n=F(e,{fields:t.fields,limit:t.limit,minQueryLength:t.minQueryLength,threshold:t.threshold}),r=L(n,{debounce:t.debounce});return Object.assign(Object.create(r),{index:n})}function z(e){let t=V();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var B;function V(){return B===void 0&&(B=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),B}exports.ScoutConfigurationError=i,exports.ScoutDisposedError=r,exports.ScoutError=n,exports.createIndex=F,exports.createReactiveSearch=R,exports.createSearch=L,exports.findMatchRanges=s,exports.highlight=c,exports.highlightField=l,exports.segmentWords=z,exports.toFilterPredicate=t,exports.toSearchMatcher=e;
2
2
  //# sourceMappingURL=scout.cjs.map
package/dist/scout.cjs.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"scout.cjs","names":["e","t","r","i","i","c","l","e","u","n","d","f","t","r","e","e","n","s"],"sources":["../src/adapters.ts","../src/errors.ts","../src/_dev.ts","../src/tokenize.ts","../src/highlight.ts","../../ripple/dist/errors.js","../../ripple/dist/runtime.js","../../ripple/dist/_async.js","../../ripple/dist/_watch.js","../../ripple/dist/_default.js","../../ripple/dist/index.js","../src/trigram.ts","../src/scout-index.ts","../src/reactive.ts","../src/segment.ts"],"sourcesContent":["import type { ScoutIndex } from './scout-index';\nimport type { SearchConstraints } from './types';\n\n/**\n * Adapts a `ScoutIndex` to sourcerer's explicit local `match` callback.\n * Caches one match set per query so local filtering does not repeat index work per item.\n */\nexport function toSearchMatcher<T>(\n index: ScoutIndex<T>,\n options?: SearchConstraints,\n): (item: T, query: string) => boolean {\n let lastQuery: string | undefined;\n let lastRevision = -1;\n let matches = new Set<T>();\n\n return (item, query) => {\n if (query !== lastQuery || index.revision !== lastRevision) {\n lastQuery = query;\n lastRevision = index.revision;\n matches = new Set(index.search(query, options).map((result) => result.item));\n }\n\n return matches.has(item);\n };\n}\n\n/**\n * Returns a predicate that returns `true` for items matching `query` in the given index.\n *\n * The predicate is computed once at call time — call `toFilterPredicate` again if the\n * query or corpus changes.\n *\n * Compatible with `Array.filter`, `vault`'s `query.filter()`, or any predicate pipeline.\n */\nexport function toFilterPredicate<T>(\n index: ScoutIndex<T>,\n query: string,\n options?: SearchConstraints,\n): (item: T) => boolean {\n const matchSet = new Set(index.search(query, options).map((result) => result.item));\n\n return (item) => matchSet.has(item);\n}\n","/** Base class for all scout errors. Use `instanceof ScoutError` to catch any scout-originated error. */\nexport class ScoutError extends Error {\n constructor(message: string, opts?: ErrorOptions) {\n super(message, opts);\n this.name = new.target.name;\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\n/** Thrown when a method is called on a disposed search state instance. */\nexport class ScoutDisposedError extends ScoutError {}\n\n/** Thrown when an index, search, or reactive search receives an invalid configuration. */\nexport class ScoutConfigurationError extends ScoutError {}\n","const isDev = !(globalThis as { __SCOUT_PROD__?: boolean }).__SCOUT_PROD__;\n\n/** @internal */\nexport function warn(msg: string): void {\n if (isDev) console.warn(`[@vielzeug/scout] ${msg}`);\n}\n","import { warn } from './_dev';\n\n/**\n * Normalizes a string for indexing or querying.\n * Lowercases, replaces punctuation (except apostrophes) with spaces,\n * trims, and collapses runs of whitespace to a single space.\n * @internal\n */\nexport function tokenize(text: string): string {\n return text\n .toLowerCase()\n .replace(/[^\\p{L}\\p{N}\\s']/gu, ' ')\n .trim()\n .replace(/\\s+/g, ' ');\n}\n\n/**\n * Converts an unknown field value to an indexable string.\n * Returns an empty string for `null`, `undefined`, objects, or symbols.\n * @internal\n */\nexport function defaultStringify(value: unknown): string {\n if (value == null) return '';\n\n if (typeof value === 'string') return value;\n\n if (typeof value === 'number' || typeof value === 'boolean') return String(value);\n\n if (Array.isArray(value)) {\n warn(\n 'defaultStringify: received an array value — provide a custom `stringify` on the FieldDef to control array indexing.\\n' +\n 'Falling back to joining string/number/boolean elements with a space.',\n );\n\n return value.filter((v) => typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean').join(' ');\n }\n\n return '';\n}\n","import { tokenize } from './tokenize';\nimport type { HighlightPart, SearchResult } from './types';\n\n/**\n * Finds character ranges within `text` where `query` words appear.\n * Ranges are sorted and overlapping ranges are merged.\n *\n * Useful when you need to apply match ranges to a different string than the\n * indexed field value (e.g. a truncated preview or a differently formatted display string).\n *\n * @param text - The string to search within.\n * @param query - Raw query text. It is normalized with Scout's tokenizer before literal lookup.\n * @returns Sorted, non-overlapping `[start, end]` character ranges.\n */\nexport function findMatchRanges(text: string, query: string): [number, number][] {\n const lower = text.toLowerCase();\n const words = tokenize(query).split(' ').filter(Boolean);\n const ranges: [number, number][] = [];\n\n for (const word of words) {\n let pos = 0;\n\n while (pos < lower.length) {\n const idx = lower.indexOf(word, pos);\n\n if (idx === -1) break;\n\n ranges.push([idx, idx + word.length]);\n pos = idx + 1;\n }\n }\n\n ranges.sort((a, b) => a[0] - b[0]);\n\n const merged: [number, number][] = [];\n\n for (const range of ranges) {\n const last = merged[merged.length - 1];\n\n if (last && range[0] <= last[1]) {\n last[1] = Math.max(last[1], range[1]);\n } else {\n merged.push([range[0], range[1]]);\n }\n }\n\n return merged;\n}\n\n/**\n * Splits `text` into highlighted and unhighlighted fragments using match `ranges`.\n *\n * Ranges must be sorted and non-overlapping (as produced by `SearchResult.matches[n].ranges`).\n * Use the returned parts to render highlighted text in a UI component.\n *\n * **`part.text` is the original, unescaped field value** (e.g. a user's name, bio, or\n * product title) — this function does no HTML escaping. Render each part via safe DOM APIs\n * (`textContent`, a framework's text binding) and wrap `highlighted` parts in your own\n * element (e.g. `<mark>`); never concatenate `part.text` into an HTML string for\n * `innerHTML` — that reintroduces the XSS risk this structured return shape avoids.\n *\n * @example\n * ```ts\n * highlight('Hello World', [[0, 5]]);\n * // [{ text: 'Hello', highlighted: true }, { text: ' World', highlighted: false }]\n *\n * highlight('Hello World', [[0, 5], [6, 11]]);\n * // [\n * // { text: 'Hello', highlighted: true },\n * // { text: ' ', highlighted: false },\n * // { text: 'World', highlighted: true },\n * // ]\n * ```\n *\n * @param text - The original field value to split.\n * @param ranges - Sorted, non-overlapping `[start, end]` ranges from `FieldMatch.ranges`.\n * @returns An array of `HighlightPart` objects. Returns an empty array for an empty `text`.\n */\nexport function highlight(text: string, ranges: [number, number][]): HighlightPart[] {\n if (!text) return [];\n\n if (!ranges.length) return [{ highlighted: false, text }];\n\n const parts: HighlightPart[] = [];\n let cursor = 0;\n\n for (const [start, end] of ranges) {\n if (start > cursor) {\n parts.push({ highlighted: false, text: text.slice(cursor, start) });\n }\n\n if (end > start) {\n parts.push({ highlighted: true, text: text.slice(start, end) });\n }\n\n cursor = end;\n }\n\n if (cursor < text.length) {\n parts.push({ highlighted: false, text: text.slice(cursor) });\n }\n\n return parts;\n}\n\n/**\n * Finds the match ranges for `field` in `result` and splits `text` into\n * highlighted and unhighlighted fragments in one step.\n *\n * This is the ergonomic shorthand for the common pattern:\n * ```ts\n * const match = result.matches.find(m => m.field === 'name');\n * const parts = highlight(item.name, match?.ranges ?? []);\n * ```\n *\n * @example\n * ```ts\n * for (const result of index.search('alice')) {\n * const parts = highlightField(result, 'name', result.item.name);\n * console.log(parts.map(p => p.highlighted ? `[${p.text}]` : p.text).join(''));\n * }\n * ```\n *\n * @param result - A `SearchResult` from `ScoutIndex.search()`.\n * @param field - The field name to look up in `result.matches`.\n * @param text - The original field value string to split.\n * @returns An array of `HighlightPart` objects.\n */\nexport function highlightField<T>(result: SearchResult<T>, field: keyof T & string, text: string): HighlightPart[] {\n const match = result.matches.find((m) => m.field === field);\n\n return highlight(text, match?.ranges ?? []);\n}\n","//#region src/errors.ts\nvar e = class extends Error {\n\tconstructor(e, t) {\n\t\tsuper(e, t), this.name = new.target.name, Object.setPrototypeOf(this, new.target.prototype);\n\t}\n}, t = class extends e {}, n = class extends e {}, r = class extends e {}, i = class extends e {};\n//#endregion\nexport { t as RippleComputedCycleError, n as RippleDisposedRuntimeError, r as RippleDisposedScopeError, e as RippleError, i as RippleInfiniteLoopError };\n\n//# sourceMappingURL=errors.js.map","import { RippleComputedCycleError as e, RippleDisposedRuntimeError as t, RippleDisposedScopeError as n, RippleInfiniteLoopError as r } from \"./errors.js\";\n//#region src/runtime.ts\nvar i = Symbol.for(\"@vielzeug/ripple/reactive\"), a = 100, o = Symbol(\"ripple.unset\"), s = class {\n\t[i] = !0;\n\tdependents = /* @__PURE__ */ new Set();\n\tname;\n\truntime;\n\tconstructor(e, t) {\n\t\tthis.runtime = e, this.name = t;\n\t}\n\tsubscribe(e) {\n\t\tthis.runtime.assertActive(), this.peek();\n\t\tlet t = {\n\t\t\tdependencies: /* @__PURE__ */ new Set(),\n\t\t\tonDependencyChanged: () => this.runtime.enqueueListener(e)\n\t\t};\n\t\treturn this.dependents.add(t), () => this.dependents.delete(t);\n\t}\n\tnotify() {\n\t\tfor (let e of [...this.dependents]) e.onDependencyChanged();\n\t}\n}, c = class extends s {\n\tcurrent;\n\tequals;\n\tconstructor(e, t, n) {\n\t\tsuper(e, n?.name), this.current = t, this.equals = n?.equals ?? Object.is;\n\t}\n\tget value() {\n\t\treturn this.runtime.track(this), this.current;\n\t}\n\tset value(e) {\n\t\tif (this.runtime.assertActive(), this.equals(this.current, e)) return;\n\t\tlet t = this.current;\n\t\tthis.current = e, this.runtime.emit({\n\t\t\tkind: \"write\",\n\t\t\tname: this.name,\n\t\t\tnext: e,\n\t\t\tprevious: t\n\t\t}), this.runtime.propagate(() => this.notify());\n\t}\n\tpeek() {\n\t\treturn this.current;\n\t}\n\tupdate(e) {\n\t\tthis.value = e(this.current);\n\t}\n}, l = class extends s {\n\tdependencies = /* @__PURE__ */ new Set();\n\tcomputing = !1;\n\tdisposed = !1;\n\tdirty = !0;\n\tcurrent = o;\n\tderive;\n\tequals;\n\tconstructor(e, t, n) {\n\t\tsuper(e, n?.name), this.derive = t, this.equals = n?.equals ?? Object.is;\n\t}\n\tget value() {\n\t\treturn this.refresh(), this.runtime.track(this), this.current;\n\t}\n\tpeek() {\n\t\treturn this.refresh(), this.current;\n\t}\n\tonDependencyChanged() {\n\t\tthis.disposed || (this.dirty ||= !0, this.dependents.size > 0 && this.refresh() && this.notify());\n\t}\n\tdispose() {\n\t\tthis.disposed || (this.disposed = !0, this.runtime.clearDependencies(this), this.dependents.clear());\n\t}\n\trefresh() {\n\t\tif (!this.dirty || this.disposed) return !1;\n\t\tif (this.computing) {\n\t\t\tlet t = this.name === void 0 ? \"\" : ` \"${this.name}\"`;\n\t\t\tthrow new e(`computed cycle detected${t}`);\n\t\t}\n\t\tthis.computing = !0, this.runtime.emit({\n\t\t\tkind: \"compute\",\n\t\t\tname: this.name\n\t\t});\n\t\ttry {\n\t\t\tlet e = this.runtime.collect(this, this.derive), t = this.current === o || !this.equals(this.current, e);\n\t\t\treturn this.current = e, this.dirty = !1, t;\n\t\t} finally {\n\t\t\tthis.computing = !1;\n\t\t}\n\t}\n}, u = class {\n\tdisposalController = new AbortController();\n\towned = /* @__PURE__ */ new Set();\n\tname;\n\tisDisposed = !1;\n\truntime;\n\tconstructor(e, t) {\n\t\tthis.runtime = e, this.name = t;\n\t}\n\tget disposed() {\n\t\treturn this.isDisposed;\n\t}\n\tget disposalSignal() {\n\t\treturn this.disposalController.signal;\n\t}\n\trun(e) {\n\t\tif (this.isDisposed) throw new n(\"Cannot run a disposed scope.\");\n\t\treturn this.runtime.withScope(this, e);\n\t}\n\tdispose() {\n\t\tif (!this.isDisposed) {\n\t\t\tthis.isDisposed = !0;\n\t\t\tfor (let e of [...this.owned].reverse()) e.dispose();\n\t\t\tthis.owned.clear(), this.disposalController.abort(), this.runtime.emit({\n\t\t\t\tkind: \"dispose\",\n\t\t\t\tname: this.name,\n\t\t\t\tnode: \"scope\"\n\t\t\t});\n\t\t}\n\t}\n\t[Symbol.dispose]() {\n\t\tthis.dispose();\n\t}\n}, d = class {\n\tdependencies = /* @__PURE__ */ new Set();\n\tdisposalController = new AbortController();\n\tcleanup;\n\tisDisposed = !1;\n\towner;\n\tscheduled = !1;\n\tcallback;\n\toptions;\n\truntime;\n\tconstructor(e, t, n) {\n\t\tthis.runtime = e, this.callback = t, this.options = n;\n\t}\n\tget disposed() {\n\t\treturn this.isDisposed;\n\t}\n\tget disposalSignal() {\n\t\treturn this.disposalController.signal;\n\t}\n\tonDependencyChanged() {\n\t\tif (!this.isDisposed) {\n\t\t\tif (this.options?.scheduler === \"microtask\") {\n\t\t\t\tif (this.scheduled) return;\n\t\t\t\tthis.scheduled = !0, queueMicrotask(() => {\n\t\t\t\t\tthis.scheduled = !1, this.isDisposed || this.runtime.enqueue(this);\n\t\t\t\t});\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.runtime.enqueue(this);\n\t\t}\n\t}\n\trun() {\n\t\tif (this.isDisposed) return;\n\t\tthis.owner?.dispose(), this.owner = void 0, this.runCleanup(), this.runtime.emit({\n\t\t\tkind: \"effect\",\n\t\t\tname: this.options?.name\n\t\t});\n\t\tlet e = new u(this.runtime);\n\t\ttry {\n\t\t\tlet t = this.runtime.withEffectScope(e, () => this.runtime.collectEffect(this, this.callback));\n\t\t\tthis.owner = e, this.cleanup = typeof t == \"function\" ? t : void 0;\n\t\t} catch (t) {\n\t\t\te.dispose(), this.runtime.report(t, {\n\t\t\t\tkind: \"effect\",\n\t\t\t\tname: this.options?.name\n\t\t\t});\n\t\t}\n\t}\n\tdispose() {\n\t\tthis.isDisposed || (this.isDisposed = !0, this.owner?.dispose(), this.owner = void 0, this.runtime.clearDependencies(this), this.runCleanup(), this.disposalController.abort(), this.runtime.emit({\n\t\t\tkind: \"dispose\",\n\t\t\tname: this.options?.name,\n\t\t\tnode: \"effect\"\n\t\t}));\n\t}\n\t[Symbol.dispose]() {\n\t\tthis.dispose();\n\t}\n\trunCleanup() {\n\t\tlet e = this.cleanup;\n\t\tif (this.cleanup = void 0, e !== void 0) try {\n\t\t\te();\n\t\t} catch (e) {\n\t\t\tthis.runtime.report(e, {\n\t\t\t\tkind: \"cleanup\",\n\t\t\t\tname: this.options?.name\n\t\t\t});\n\t\t}\n\t}\n}, f = class {\n\tactiveEffectScope;\n\tactiveObserver;\n\tactiveScope;\n\tisDisposed = !1;\n\tflushDepth = 0;\n\tflushing = !1;\n\tpending = /* @__PURE__ */ new Set();\n\tlisteners = /* @__PURE__ */ new Set();\n\trootScope;\n\tobserver;\n\tonError;\n\tconstructor(e) {\n\t\tthis.observer = e?.observer, this.onError = e?.onError ?? ((e) => {\n\t\t\tqueueMicrotask(() => {\n\t\t\t\tthrow e;\n\t\t\t});\n\t\t}), this.rootScope = new u(this, \"runtime\"), this.activeScope = this.rootScope;\n\t}\n\tget disposed() {\n\t\treturn this.isDisposed;\n\t}\n\tsignal = (e, t) => (this.assertActive(), new c(this, e, t));\n\tcomputed = (e, t) => {\n\t\tthis.assertActive();\n\t\tlet n = new l(this, e, t);\n\t\treturn (this.activeEffectScope ?? this.activeScope).owned.add(n), n;\n\t};\n\teffect = (e, t) => {\n\t\tthis.assertActive();\n\t\tlet n = new d(this, e, t);\n\t\treturn (this.activeEffectScope ?? this.activeScope).owned.add(n), n.run(), n;\n\t};\n\tcreateScope = (e) => {\n\t\tthis.assertActive();\n\t\tlet t = new u(this, e);\n\t\treturn this.activeScope.owned.add(t), t;\n\t};\n\tbatch = (e) => (this.assertActive(), this.propagate(e));\n\tuntrack = (e) => (this.assertActive(), this.withObserver(void 0, e));\n\tdispose() {\n\t\tthis.isDisposed || (this.isDisposed = !0, this.rootScope.dispose());\n\t}\n\tassertActive() {\n\t\tif (this.isDisposed) throw new t(\"Cannot use a disposed Ripple runtime.\");\n\t}\n\ttrack(e) {\n\t\tlet t = this.activeObserver;\n\t\tt?.collecting !== void 0 && t.collecting.add(e);\n\t}\n\tclearDependencies(e) {\n\t\tfor (let t of e.dependencies) t.dependents.delete(e);\n\t\te.dependencies.clear();\n\t}\n\tcollect(e, t) {\n\t\treturn this.collectWith(e, t, !1);\n\t}\n\tcollectEffect(e, t) {\n\t\treturn this.collectWith(e, t, !0);\n\t}\n\twithEffectScope(e, t) {\n\t\tlet n = this.activeEffectScope;\n\t\tthis.activeEffectScope = e;\n\t\ttry {\n\t\t\treturn t();\n\t\t} finally {\n\t\t\tthis.activeEffectScope = n;\n\t\t}\n\t}\n\twithObserver(e, t) {\n\t\tlet n = this.activeObserver;\n\t\tthis.activeObserver = e;\n\t\ttry {\n\t\t\treturn t();\n\t\t} finally {\n\t\t\tthis.activeObserver = n;\n\t\t}\n\t}\n\twithScope(e, t) {\n\t\tlet n = this.activeEffectScope, r = this.activeScope;\n\t\tthis.activeEffectScope = void 0, this.activeScope = e;\n\t\ttry {\n\t\t\treturn t();\n\t\t} finally {\n\t\t\tthis.activeEffectScope = n, this.activeScope = r;\n\t\t}\n\t}\n\tenqueue(e) {\n\t\tthis.pending.add(e), this.flushDepth === 0 && this.flush();\n\t}\n\tenqueueListener(e) {\n\t\tthis.listeners.add(e), this.flushDepth === 0 && this.flush();\n\t}\n\tpropagate(e) {\n\t\tthis.flushDepth++;\n\t\ttry {\n\t\t\treturn e();\n\t\t} finally {\n\t\t\tthis.flushDepth--, this.flushDepth === 0 && this.flush();\n\t\t}\n\t}\n\temit(e) {\n\t\ttry {\n\t\t\tthis.observer?.(e);\n\t\t} catch (t) {\n\t\t\tthis.report(t, {\n\t\t\t\tkind: \"observer\",\n\t\t\t\tname: e.name\n\t\t\t});\n\t\t}\n\t}\n\treport(e, t) {\n\t\ttry {\n\t\t\tthis.onError(e, t);\n\t\t} catch (e) {\n\t\t\tqueueMicrotask(() => {\n\t\t\t\tthrow e;\n\t\t\t});\n\t\t}\n\t}\n\tcollectWith(e, t, n) {\n\t\tlet r = this.activeObserver, i = /* @__PURE__ */ new Set();\n\t\te.collecting = i, this.activeObserver = e;\n\t\ttry {\n\t\t\tlet n = t();\n\t\t\treturn this.commitDependencies(e, i), n;\n\t\t} catch (t) {\n\t\t\tthrow n && this.commitDependencies(e, i), t;\n\t\t} finally {\n\t\t\te.collecting = void 0, this.activeObserver = r;\n\t\t}\n\t}\n\tcommitDependencies(e, t) {\n\t\tfor (let n of e.dependencies) t.has(n) || n.dependents.delete(e);\n\t\tfor (let n of t) e.dependencies.has(n) || n.dependents.add(e);\n\t\te.dependencies.clear();\n\t\tfor (let n of t) e.dependencies.add(n);\n\t}\n\tflush() {\n\t\tif (this.flushing) return;\n\t\tthis.flushing = !0;\n\t\tlet e = 0;\n\t\ttry {\n\t\t\tfor (; this.pending.size > 0 || this.listeners.size > 0;) {\n\t\t\t\tif (++e > a) throw new r(`infinite reactive flush (>${a} iterations)`);\n\t\t\t\tlet t = [...this.pending], n = [...this.listeners];\n\t\t\t\tthis.pending.clear(), this.listeners.clear();\n\t\t\t\tfor (let e of t) e.run();\n\t\t\t\tfor (let e of n) try {\n\t\t\t\t\te();\n\t\t\t\t} catch (e) {\n\t\t\t\t\tthis.report(e, { kind: \"listener\" });\n\t\t\t\t}\n\t\t\t}\n\t\t} finally {\n\t\t\tthis.flushing = !1;\n\t\t}\n\t}\n}, p = (e) => {\n\tif (typeof e != \"object\" || !e || !(i in e)) return !1;\n\tlet t = e;\n\treturn typeof t.peek == \"function\" && typeof t.subscribe == \"function\";\n};\n//#endregion\nexport { i as REACTIVE, f as ReactiveRuntime, p as isReactive };\n\n//# sourceMappingURL=runtime.js.map","import { REACTIVE as e } from \"./runtime.js\";\n//#region src/_async.ts\nvar t = (t) => (n, r, i) => {\n\tlet a = t.signal({ status: \"pending\" }, { name: i?.name }), o = t.signal(0), s, c = !1, l = () => {\n\t\to.value, s?.abort();\n\t\tlet e = a.peek(), t = e.status === \"success\" ? e.value : \"previous\" in e ? e.previous : void 0, i;\n\t\ttry {\n\t\t\ti = n();\n\t\t} catch (e) {\n\t\t\ta.value = t === void 0 ? {\n\t\t\t\terror: e,\n\t\t\t\tstatus: \"error\"\n\t\t\t} : {\n\t\t\t\terror: e,\n\t\t\t\tprevious: t,\n\t\t\t\tstatus: \"error\"\n\t\t\t};\n\t\t\treturn;\n\t\t}\n\t\tlet l = new AbortController();\n\t\ts = l, a.value = t === void 0 ? { status: \"pending\" } : {\n\t\t\tprevious: t,\n\t\t\tstatus: \"pending\"\n\t\t};\n\t\tlet u;\n\t\ttry {\n\t\t\tu = Promise.resolve(r(i, { signal: l.signal }));\n\t\t} catch (e) {\n\t\t\tu = Promise.reject(e);\n\t\t}\n\t\tu.then((e) => {\n\t\t\t!c && !l.signal.aborted && (a.value = {\n\t\t\t\tstatus: \"success\",\n\t\t\t\tvalue: e\n\t\t\t});\n\t\t}, (e) => {\n\t\t\t!c && !l.signal.aborted && (a.value = t === void 0 ? {\n\t\t\t\terror: e,\n\t\t\t\tstatus: \"error\"\n\t\t\t} : {\n\t\t\t\terror: e,\n\t\t\t\tprevious: t,\n\t\t\t\tstatus: \"error\"\n\t\t\t});\n\t\t});\n\t}, u = t.effect(() => (l(), () => s?.abort()), { name: i?.name });\n\tu.disposalSignal.addEventListener(\"abort\", () => {\n\t\tc = !0;\n\t}, { once: !0 });\n\tlet d = {\n\t\tget disposalSignal() {\n\t\t\treturn u.disposalSignal;\n\t\t},\n\t\tdispose: () => u.dispose(),\n\t\tget disposed() {\n\t\t\treturn c;\n\t\t},\n\t\tget name() {\n\t\t\treturn a.name;\n\t\t},\n\t\tpeek: () => a.peek(),\n\t\treload: () => {\n\t\t\tc || (o.value = o.peek() + 1);\n\t\t},\n\t\tsubscribe: (e) => a.subscribe(e),\n\t\t[Symbol.dispose]() {\n\t\t\tthis.dispose();\n\t\t},\n\t\tget value() {\n\t\t\treturn a.value;\n\t\t}\n\t};\n\treturn Object.defineProperty(d, e, { value: !0 }), d;\n};\n//#endregion\nexport { t as createResource };\n\n//# sourceMappingURL=_async.js.map","//#region src/_watch.ts\nvar e = (e) => (t, n, r) => {\n\tlet i = typeof t == \"function\" ? t : () => t.value, a = r?.equals ?? Object.is, o = !0, s, c = !1, l = e.effect(() => {\n\t\tlet e = i();\n\t\tif (o) {\n\t\t\to = !1, s = e, r?.immediate && (n(e, void 0), r?.once && (c = !0));\n\t\t\treturn;\n\t\t}\n\t\tif (a(s, e)) return;\n\t\tlet t = s;\n\t\ts = e, n(e, t), r?.once && l.dispose();\n\t}, { name: r?.name });\n\treturn c && l.dispose(), l;\n};\n//#endregion\nexport { e as createWatch };\n\n//# sourceMappingURL=_watch.js.map","import { ReactiveRuntime as e } from \"./runtime.js\";\nimport { createResource as t } from \"./_async.js\";\nimport { createWatch as n } from \"./_watch.js\";\n//#region src/_default.ts\nvar r = (r) => {\n\tlet i = new e(r), a = t(i);\n\treturn {\n\t\tbatch: i.batch,\n\t\tcomputed: i.computed,\n\t\tcreateScope: i.createScope,\n\t\tdispose: () => i.dispose(),\n\t\tget disposed() {\n\t\t\treturn i.disposed;\n\t\t},\n\t\teffect: i.effect,\n\t\tresource: a,\n\t\tsignal: i.signal,\n\t\tuntrack: i.untrack,\n\t\twatch: n(i)\n\t};\n}, i = r();\n//#endregion\nexport { r as createRipple, i as defaultRipple };\n\n//# sourceMappingURL=_default.js.map","import { RippleComputedCycleError as e, RippleDisposedRuntimeError as t, RippleDisposedScopeError as n, RippleError as r, RippleInfiniteLoopError as i } from \"./errors.js\";\nimport { isReactive as a } from \"./runtime.js\";\nimport { createRipple as o, defaultRipple as s } from \"./_default.js\";\n//#region src/index.ts\nvar c = s.signal, l = s.computed, u = s.effect, d = s.batch, f = s.createScope, p = s.untrack, m = s.watch, h = s.resource;\n//#endregion\nexport { e as RippleComputedCycleError, t as RippleDisposedRuntimeError, n as RippleDisposedScopeError, r as RippleError, i as RippleInfiniteLoopError, d as batch, l as computed, o as createRipple, f as createScope, u as effect, a as isReactive, h as resource, c as signal, p as untrack, m as watch };\n\n//# sourceMappingURL=index.js.map","/**\n * Generates padded trigrams from a pre-normalized (lowercased, trimmed) string.\n *\n * The string is padded with a single leading and trailing space so that prefix\n * and suffix characters form complete trigrams.\n *\n * @example\n * `\"hello\"` → `{ \" he\", \"hel\", \"ell\", \"llo\", \"lo \" }`\n *\n * @internal\n */\nexport function generateTrigrams(text: string): Set<string> {\n const trigrams = new Set<string>();\n const padded = ` ${text} `;\n\n for (let i = 0; i < padded.length - 2; i++) {\n trigrams.add(padded.slice(i, i + 3));\n }\n\n return trigrams;\n}\n\n/**\n * Computes the Szymkiewicz–Simpson overlap coefficient between two trigram sets.\n * Returns `0` when either set is empty; `1` when the smaller set is fully contained in the\n * larger one (including when the sets are identical).\n *\n * Formula: `|A ∩ B| / min(|A|, |B|)`\n *\n * Deliberately *not* the more common Sørensen–Dice coefficient (`2·|A∩B| / (|A|+|B|)`): Dice's\n * denominator grows with the *combined* size of both sets, so a short query fully contained in a\n * much longer target field is unfairly penalized purely for the target's length — e.g. querying\n * `\"fin\"` against a field containing `\"finalize project budget\"` shares 2 of the query's 3\n * trigrams under Dice (`2·2/(3+~24) ≈ 0.15`, likely below a typical `0.2` threshold) even though\n * the query is a clean prefix match. The overlap coefficient instead asks \"what fraction of the\n * *smaller* set (almost always the query, for autocomplete/command-palette use) was found?\" —\n * the same example scores `2/min(3,~24) ≈ 0.67`. Overlap is always `>= Dice` for the same inputs\n * (by the AM ≥ min inequality), so this can only ever include *more* legitimate matches, never\n * fewer, than the previous Dice-based scoring.\n *\n * A single shared trigram is treated as `0` (no match), not folded into the ratio above — for\n * any query of 4+ characters (the overwhelmingly common case: `generateTrigrams` yields\n * `length + 1` trigrams once padded), one incidental boundary trigram already clears the\n * `min(|A|,|B|) `-based ratio far enough to pass the library's own default `threshold` (`0.2`,\n * `1/4`), regardless of how unrelated the two strings actually are — e.g. `\"x300\"` and `\"a200\"`\n * share nothing but the trailing `\"00 \"` boundary trigram (both end in a round hundred) yet\n * would otherwise score `0.25`. A real fuzzy/typo match almost always shares *several*\n * consecutive trigrams, not one; requiring `>= 2` (or a full match, for the rare query short\n * enough to normalize to a single trigram) filters out this class of false positive without\n * weakening genuine partial matches — see `scout-index.ts`'s `search()` tests for both cases.\n *\n * @internal\n */\nexport function overlapSimilarity(a: Set<string>, b: Set<string>): number {\n if (a.size === 0 || b.size === 0) return 0;\n\n let shared = 0;\n\n for (const trigram of a) {\n if (b.has(trigram)) shared++;\n }\n\n if (shared < 2 && shared < a.size) return 0;\n\n return shared / Math.min(a.size, b.size);\n}\n","import { ScoutConfigurationError } from './errors';\nimport { findMatchRanges } from './highlight';\nimport { defaultStringify, tokenize } from './tokenize';\nimport { generateTrigrams, overlapSimilarity } from './trigram';\nimport type { FieldDef, FieldMatch, ScoutIndexOptions, SearchConstraints, SearchResult } from './types';\n\ntype FieldConfig<T> = {\n field: keyof T & string;\n stringify: (v: unknown) => string;\n weight: number;\n};\n\ntype ItemRecord = {\n /** Per-field trigrams for scoring. */\n trigrams: Map<string, Set<string>>;\n /** Per-field original text for highlighting. */\n values: Map<string, string>;\n};\n\n/**\n * A stateful, indexed search corpus. Created via `createIndex()`.\n *\n * Supports incremental `add()`, `remove()`, and `reindex()` operations — each patches\n * the trigram index in O(field_length) without a full rebuild.\n */\nexport interface ScoutIndex<T> {\n /** Adds `item` to the index. No-op if the item is already indexed (by reference). */\n add(item: T): void;\n /** All items currently in the index, in insertion order. */\n readonly items: readonly T[];\n /**\n * Subscribes `listener` to be called after every changed `add()` / `remove()` / `reindex()`\n * / `setItems()` operation. No-ops — e.g. removing an unindexed item or reconciling an\n * unchanged corpus — do not fire it. Each changed `setItems()` reconciliation fires once.\n * Returns an unsubscribe function.\n *\n * Framework-agnostic extension point: `createSearch()` uses this internally to keep\n * reactive `results` in sync with index mutations. Most callers won't need this directly.\n */\n onMutate(listener: () => void): () => void;\n /**\n * Re-reads the item's current field values and rebuilds its index entry in-place,\n * only updating fields whose values have changed. Preserves insertion order.\n * No-op if the item is not in the index.\n */\n reindex(item: T): void;\n /**\n * Removes `item` from the index by reference equality.\n * No-op if the item is not in the index.\n */\n remove(item: T): void;\n /**\n * Monotonically increasing counter, incremented after every changed `add()` / `remove()` /\n * `reindex()` / `setItems()` operation. Use as a cache-busting token when caching search\n * results outside the index — `toSearchMatcher()` uses it for this purpose.\n */\n readonly revision: number;\n /**\n * Searches the index for `query` and returns results sorted by score descending.\n *\n * An empty (or whitespace-only) `query` returns all indexed items with `score = 1`.\n * A `query` with no indexable content after normalization (e.g. punctuation-only) returns\n * no results. Results below `threshold` are excluded. At most `limit` results are returned.\n */\n search(query: string, options?: SearchConstraints): SearchResult<T>[];\n /**\n * Reconciles the index to `items` by reference identity. Retained items are reindexed,\n * new items are added, missing items are removed, and one mutation notification fires\n * when indexed corpus or field values change. Duplicate references collapse to one item.\n */\n setItems(items: readonly T[]): void;\n /** Number of items currently in the index. */\n readonly size: number;\n}\n\nfunction requireFiniteInteger(value: number, name: string, minimum: number): number {\n if (!Number.isFinite(value) || !Number.isInteger(value) || value < minimum) {\n throw new ScoutConfigurationError(`${name} must be a finite integer greater than or equal to ${minimum}.`);\n }\n\n return value;\n}\n\nfunction requireFiniteNumber(value: number, name: string, minimum: number, maximum = Number.POSITIVE_INFINITY): number {\n if (!Number.isFinite(value) || value < minimum || value > maximum) {\n throw new ScoutConfigurationError(`${name} must be a finite number between ${minimum} and ${maximum}.`);\n }\n\n return value;\n}\n\nfunction resolveFields<T>(defs: ReadonlyArray<FieldDef<T>>): FieldConfig<T>[] {\n return defs.map((def) => {\n if (typeof def === 'string') {\n return { field: def, stringify: defaultStringify, weight: 1 };\n }\n\n return {\n field: def.field,\n stringify: def.stringify ?? defaultStringify,\n weight: requireFiniteNumber(def.weight ?? 1, `weight for field \"${def.field}\"`, Number.MIN_VALUE),\n };\n });\n}\n\n/**\n * Builds a trigram inverted index over `items` for fast fuzzy search.\n *\n * Construction is O(corpus × field_length). Subsequent `search()` calls are\n * O(candidates) — far faster than per-query Levenshtein for large corpora.\n *\n * @example\n * ```ts\n * const index = createIndex(users, {\n * fields: [{ field: 'name', weight: 2 }, 'email'],\n * threshold: 0.3,\n * limit: 20,\n * });\n *\n * const results = index.search('alice');\n * ```\n *\n * @throws {ScoutConfigurationError} If options use an invalid field or numeric configuration.\n */\nexport function createIndex<T>(items: T[], options: ScoutIndexOptions<T>): ScoutIndex<T> {\n if (options.fields.length === 0) {\n throw new ScoutConfigurationError('createIndex: at least one field is required.');\n }\n\n const fields = resolveFields(options.fields);\n const maxWeight = fields.reduce((max, f) => Math.max(max, f.weight), 1);\n const defaultThreshold = requireFiniteNumber(options.threshold ?? 0.2, 'threshold', 0, 1);\n const defaultLimit = requireFiniteInteger(options.limit ?? 50, 'limit', 0);\n const defaultMinQueryLength = requireFiniteInteger(options.minQueryLength ?? 3, 'minQueryLength', 1);\n\n /** item → per-item record, preserves insertion order for `items` getter */\n const itemData = new Map<T, ItemRecord>();\n /** trigram → set of items that contain it */\n const invertedIndex = new Map<string, Set<T>>();\n const mutationListeners = new Set<() => void>();\n let revision = 0;\n\n function notifyMutation(): void {\n revision++;\n\n for (const listener of mutationListeners) listener();\n }\n\n /** Single-entry cache for the most recent normalized query's trigrams (F2). */\n let cachedNormalized: string | null = null;\n let cachedTrigrams: Set<string> | null = null;\n\n function getQueryTrigrams(normalized: string): Set<string> {\n if (normalized === cachedNormalized && cachedTrigrams !== null) return cachedTrigrams;\n\n cachedNormalized = normalized;\n cachedTrigrams = generateTrigrams(normalized);\n\n return cachedTrigrams;\n }\n\n function addFieldToIndex(item: T, fieldTrigrams: Set<string>): void {\n for (const trigram of fieldTrigrams) {\n let bucket = invertedIndex.get(trigram);\n\n if (!bucket) {\n bucket = new Set<T>();\n invertedIndex.set(trigram, bucket);\n }\n\n bucket.add(item);\n }\n }\n\n function removeFieldFromIndex(item: T, fieldTrigrams: Set<string>): void {\n for (const trigram of fieldTrigrams) {\n const bucket = invertedIndex.get(trigram);\n\n if (bucket) {\n bucket.delete(item);\n\n if (bucket.size === 0) invertedIndex.delete(trigram);\n }\n }\n }\n\n function addItem(item: T): void {\n const trigrams = new Map<string, Set<string>>();\n const values = new Map<string, string>();\n\n for (const { field, stringify } of fields) {\n const raw = item[field];\n const text = stringify(raw);\n const normalized = tokenize(text);\n const fieldTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n trigrams.set(field, fieldTrigrams);\n values.set(field, text);\n addFieldToIndex(item, fieldTrigrams);\n }\n\n itemData.set(item, { trigrams, values });\n }\n\n /**\n * Performs a full linear scan over all items for short queries.\n * O(n × field_count) — acceptable for small corpora; consider raising\n * `minQueryLength` on large datasets to avoid triggering this path.\n */\n function containmentScan(query: string): Set<T> {\n const result = new Set<T>();\n\n for (const [item, record] of itemData) {\n for (const value of record.values.values()) {\n if (value.toLowerCase().includes(query)) {\n result.add(item);\n break;\n }\n }\n }\n\n return result;\n }\n\n function trigramCandidates(queryTrigrams: Set<string>): Set<T> {\n const candidates = new Set<T>();\n\n for (const trigram of queryTrigrams) {\n const items = invertedIndex.get(trigram);\n\n if (items) {\n for (const item of items) candidates.add(item);\n }\n }\n\n return candidates;\n }\n\n function scoreCandidate(normalized: string, queryTrigrams: Set<string> | null, record: ItemRecord): number {\n let bestScore = 0;\n\n for (const { field, weight } of fields) {\n let fieldScore: number;\n\n if (queryTrigrams === null) {\n const raw = record.values.get(field) ?? '';\n\n fieldScore = raw.toLowerCase().includes(normalized) ? 1.0 : 0;\n } else {\n const itemTrigrams = record.trigrams.get(field);\n\n if (!itemTrigrams || itemTrigrams.size === 0) continue;\n\n fieldScore = overlapSimilarity(queryTrigrams, itemTrigrams);\n }\n\n const weighted = fieldScore * (weight / maxWeight);\n\n if (weighted > bestScore) bestScore = weighted;\n }\n\n return bestScore;\n }\n\n function computeMatches(query: string, values: Map<string, string>): FieldMatch<keyof T & string>[] {\n const matches: FieldMatch<keyof T & string>[] = [];\n\n for (const { field } of fields) {\n const text = values.get(field);\n\n if (!text) continue;\n\n const ranges = findMatchRanges(text, query);\n\n if (ranges.length > 0) matches.push({ field, ranges });\n }\n\n return matches;\n }\n\n function reindexItem(item: T): boolean {\n const record = itemData.get(item);\n\n if (!record) return false;\n\n let changed = false;\n\n for (const { field, stringify } of fields) {\n const newText = stringify(item[field]);\n const oldText = record.values.get(field);\n\n if (newText === oldText) continue;\n\n changed = true;\n\n const oldTrigrams = record.trigrams.get(field);\n\n if (oldTrigrams) removeFieldFromIndex(item, oldTrigrams);\n\n const normalized = tokenize(newText);\n const newTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n record.trigrams.set(field, newTrigrams);\n record.values.set(field, newText);\n addFieldToIndex(item, newTrigrams);\n }\n\n return changed;\n }\n\n function removeItem(item: T): boolean {\n const record = itemData.get(item);\n\n if (!record) return false;\n\n for (const fieldTrigrams of record.trigrams.values()) {\n removeFieldFromIndex(item, fieldTrigrams);\n }\n\n itemData.delete(item);\n\n return true;\n }\n\n for (const item of items) {\n if (!itemData.has(item)) addItem(item);\n }\n\n const index: ScoutIndex<T> = {\n add(item: T): void {\n if (itemData.has(item)) return;\n\n addItem(item);\n notifyMutation();\n },\n\n get items(): readonly T[] {\n return [...itemData.keys()];\n },\n\n onMutate(listener: () => void): () => void {\n mutationListeners.add(listener);\n\n return () => {\n mutationListeners.delete(listener);\n };\n },\n\n reindex(item: T): void {\n if (reindexItem(item)) notifyMutation();\n },\n\n remove(item: T): void {\n if (removeItem(item)) notifyMutation();\n },\n\n get revision(): number {\n return revision;\n },\n\n search(query: string, options?: SearchConstraints): SearchResult<T>[] {\n const threshold = requireFiniteNumber(options?.threshold ?? defaultThreshold, 'threshold', 0, 1);\n const limit = requireFiniteInteger(options?.limit ?? defaultLimit, 'limit', 0);\n const minQueryLength = requireFiniteInteger(\n options?.minQueryLength ?? defaultMinQueryLength,\n 'minQueryLength',\n 1,\n );\n\n if (!query.trim()) {\n return [...itemData.keys()].slice(0, limit).map((item) => ({ item, matches: [], score: 1 }));\n }\n\n const normalized = tokenize(query);\n\n // Query had no indexable content (e.g. punctuation-only) — no match, not \"match all\".\n if (!normalized) return [];\n\n const isShort = normalized.length < minQueryLength;\n const queryTrigrams = isShort ? null : getQueryTrigrams(normalized);\n const candidates = queryTrigrams === null ? containmentScan(normalized) : trigramCandidates(queryTrigrams);\n const results: SearchResult<T>[] = [];\n\n for (const item of candidates) {\n const record = itemData.get(item);\n\n if (!record) continue;\n\n const score = scoreCandidate(normalized, queryTrigrams, record);\n\n if (score >= threshold) {\n const matches = computeMatches(normalized, record.values);\n\n results.push({ item, matches, score });\n }\n }\n\n return results.sort((a, b) => b.score - a.score).slice(0, limit);\n },\n\n setItems(items: readonly T[]): void {\n const incoming = new Set(items);\n const next = [...incoming];\n let changed = false;\n\n for (const item of [...itemData.keys()]) {\n if (incoming.has(item)) continue;\n\n removeItem(item);\n changed = true;\n }\n\n for (const item of next) {\n if (!itemData.has(item)) {\n addItem(item);\n changed = true;\n } else if (reindexItem(item)) {\n changed = true;\n }\n }\n\n const current = [...itemData.keys()];\n const orderChanged = current.length !== next.length || current.some((item, index) => item !== next[index]);\n\n if (orderChanged) {\n const records = new Map(next.map((item) => [item, itemData.get(item)!]));\n\n itemData.clear();\n\n for (const [item, record] of records) itemData.set(item, record);\n\n changed = true;\n }\n\n if (changed) notifyMutation();\n },\n\n get size(): number {\n return itemData.size;\n },\n };\n\n return index;\n}\n","import { batch, computed, signal } from '@vielzeug/ripple';\nimport { ScoutConfigurationError, ScoutDisposedError } from './errors';\nimport { createIndex, type ScoutIndex } from './scout-index';\nimport type { CreateSearchOptions, ScoutIndexOptions, SearchResult, SearchState } from './types';\n\n/**\n * Combined index + reactive search state returned by `createReactiveSearch()`.\n * Exposes the underlying `ScoutIndex` for incremental mutations (`add`, `remove`, `reindex`).\n */\nexport type ReactiveSearch<T> = SearchState<T> & {\n readonly index: ScoutIndex<T>;\n};\n\nconst DEFAULT_DEBOUNCE = 200;\n\n/**\n * Creates a reactive search state backed by a `ScoutIndex`.\n *\n * - Set `state.query.value` to trigger a (debounced) search.\n * - Read `state.results.value` inside an `effect` or `computed` to consume results reactively.\n * - `state.isSearching.value` is `true` while debouncing, `false` otherwise.\n * - Call `state.dispose()` (or `using state = createSearch(...)`) to release subscriptions.\n *\n * @example\n * ```ts\n * const index = createIndex(users, { fields: ['name', 'email'] });\n * const search = createSearch(index, { debounce: 150 });\n *\n * effect(() => {\n * const results = search.results.value;\n * renderList(results.map(r => r.item));\n * });\n *\n * // Wire to an input\n * input.addEventListener('input', e => {\n * search.query.value = e.currentTarget.value;\n * });\n *\n * // Clean up\n * search.dispose();\n * ```\n *\n * `results` also updates when the index is mutated directly via `index.add()` / `.remove()`\n * / `.reindex()` / `.setItems()` (not just when `query` changes), by subscribing to `index.onMutate()`.\n *\n * @param index - A `ScoutIndex` built with `createIndex()`.\n * @param options.debounce - Milliseconds to wait before committing query changes. Default: `200`.\n * @param options.limit - Override the index-level result limit.\n * @param options.minQueryLength - Override the index-level minimum query length.\n * @param options.threshold - Override the index-level score threshold.\n */\nexport function createSearch<T>(index: ScoutIndex<T>, options: CreateSearchOptions = {}): SearchState<T> {\n const { debounce: debounceMs = DEFAULT_DEBOUNCE, limit, minQueryLength, threshold } = options;\n\n if (!Number.isFinite(debounceMs) || !Number.isInteger(debounceMs) || debounceMs < 0) {\n throw new ScoutConfigurationError('debounce must be a finite non-negative integer.');\n }\n\n const query = signal<string>('', { name: 'scout:query' });\n const committedQuery = signal<string>('', { name: 'scout:committedQuery' });\n const indexVersion = signal(0, { name: 'scout:indexVersion' });\n\n const unsubscribeMutations = index.onMutate(() => {\n indexVersion.value++;\n });\n\n const isSearching = computed(() => query.value !== committedQuery.value, { name: 'scout:isSearching' });\n\n const results = computed<SearchResult<T>[]>(\n () => {\n // Reading .value establishes a dependency so index mutations trigger a recompute.\n void indexVersion.value;\n\n return index.search(committedQuery.value, { limit, minQueryLength, threshold });\n },\n { name: 'scout:results' },\n );\n\n let timer: ReturnType<typeof setTimeout> | null = null;\n\n function cancelTimer(): void {\n if (timer !== null) {\n clearTimeout(timer);\n timer = null;\n }\n }\n\n const subscription = query.subscribe(() => {\n const q = query.peek();\n\n cancelTimer();\n\n if (q === committedQuery.peek()) return;\n\n if (debounceMs === 0) {\n committedQuery.value = q;\n\n return;\n }\n\n timer = setTimeout(() => {\n committedQuery.value = q;\n timer = null;\n }, debounceMs);\n });\n\n function clear(): void {\n if (isDisposed) throw new ScoutDisposedError('SearchState.clear() called after dispose()');\n\n cancelTimer();\n\n batch(() => {\n query.value = '';\n committedQuery.value = '';\n });\n }\n\n let isDisposed = false;\n const ac = new AbortController();\n\n function dispose(): void {\n isDisposed = true;\n ac.abort();\n cancelTimer();\n subscription();\n unsubscribeMutations();\n }\n\n return {\n clear,\n get disposalSignal(): AbortSignal {\n return ac.signal;\n },\n dispose,\n get disposed(): boolean {\n return isDisposed;\n },\n isSearching,\n query,\n results,\n [Symbol.dispose](): void {\n dispose();\n },\n };\n}\n\n/**\n * Creates a `ScoutIndex` and a reactive search state in one call — the shorthand\n * for the common pattern of `createIndex` + `createSearch`.\n *\n * The returned `ReactiveSearch` exposes the underlying index via `.index` for\n * incremental mutations (`add`, `remove`, `reindex`, `setItems`) after construction.\n *\n * @example\n * ```ts\n * const search = createReactiveSearch(users, {\n * fields: [{ field: 'name', weight: 2 }, 'email'],\n * debounce: 150,\n * });\n *\n * effect(() => renderList(search.results.value.map(r => r.item)));\n *\n * // Wire to an input\n * input.addEventListener('input', e => { search.query.value = e.currentTarget.value; });\n *\n * // Add a new item at runtime\n * search.index.add(newUser);\n * ```\n *\n * @param items - Initial corpus to index.\n * @param options - Index options (`fields`, `limit`, `minQueryLength`, `threshold`) plus optional `debounce`.\n */\nexport function createReactiveSearch<T>(\n items: T[],\n options: ScoutIndexOptions<T> & Pick<CreateSearchOptions, 'debounce'>,\n): ReactiveSearch<T> {\n const index = createIndex(items, {\n fields: options.fields,\n limit: options.limit,\n minQueryLength: options.minQueryLength,\n threshold: options.threshold,\n });\n const state = createSearch(index, { debounce: options.debounce });\n\n return Object.assign(Object.create(state), { index }) as ReactiveSearch<T>;\n}\n","/**\n * Splits `text` into whitespace-joined word segments using the runtime's native\n * `Intl.Segmenter` — no dependency, no bundle cost beyond this file.\n *\n * `tokenize()`'s trigram-based scoring works on unsegmented scripts (Chinese, Japanese,\n * Thai, ...) without this — trigrams are generated per-character, not per-word — but\n * `findMatchRanges()` / highlighting and the multi-word query semantics documented on\n * `SearchConstraints` assume space-separated words. Corpora in those scripts benefit from\n * pre-segmenting via a custom `stringify` so word boundaries exist for those features too.\n *\n * Not applied inside `tokenize()` itself: benchmarked at ~15x slower than the plain regex\n * path for the common whitespace-delimited case, which would regress `createIndex()`'s\n * O(corpus × field_length) construction cost for every caller, not just those indexing\n * unsegmented scripts. Opt in per-field instead.\n *\n * Returns `text` unchanged where `Intl.Segmenter` isn't available in the current runtime.\n *\n * @example\n * ```ts\n * const index = createIndex(documents, {\n * fields: [{ field: 'title', stringify: (v) => segmentWords(String(v)) }],\n * });\n * ```\n */\nexport function segmentWords(text: string): string {\n const segmenter = getSegmenter();\n\n if (!segmenter) return text;\n\n return [...segmenter.segment(text)]\n .filter((segment) => segment.isWordLike)\n .map((segment) => segment.segment)\n .join(' ');\n}\n\n// Constructing an `Intl.Segmenter` costs roughly as much as a `segment()` call itself\n// (both are called from `stringify`, once per field per item during `createIndex()`) — cache\n// the single stateless instance instead of rebuilding it on every `segmentWords()` call.\nlet cachedSegmenter: Intl.Segmenter | null | undefined;\n\nfunction getSegmenter(): Intl.Segmenter | null {\n if (cachedSegmenter === undefined) {\n cachedSegmenter =\n typeof Intl === 'undefined' || typeof Intl.Segmenter !== 'function'\n ? null\n : new Intl.Segmenter(undefined, { granularity: 'word' });\n }\n\n return cachedSegmenter;\n}\n"],"mappings":"mEAOA,SAAgB,EACd,EACA,EACqC,CACrC,IAAI,EACA,EAAe,GACf,EAAU,IAAI,IAElB,OAAQ,EAAM,MACR,IAAU,GAAa,EAAM,WAAa,KAC5C,EAAY,EACZ,EAAe,EAAM,SACrB,EAAU,IAAI,IAAI,EAAM,OAAO,EAAO,CAAO,CAAC,CAAC,IAAK,GAAW,EAAO,IAAI,CAAC,GAGtE,EAAQ,IAAI,CAAI,EAE3B,CAUA,SAAgB,EACd,EACA,EACA,EACsB,CACtB,IAAM,EAAW,IAAI,IAAI,EAAM,OAAO,EAAO,CAAO,CAAC,CAAC,IAAK,GAAW,EAAO,IAAI,CAAC,EAElF,MAAQ,IAAS,EAAS,IAAI,CAAI,CACpC,CCzCA,IAAa,EAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAGa,EAAb,cAAwC,CAAW,CAAC,EAGvC,EAAb,cAA6C,CAAW,CAAC,EELzD,SAAgB,EAAS,EAAsB,CAC7C,OAAO,EACJ,YAAY,CAAC,CACb,QAAQ,qBAAsB,GAAG,CAAC,CAClC,KAAK,CAAC,CACN,QAAQ,OAAQ,GAAG,CACxB,CAOA,SAAgB,EAAiB,EAAwB,CAgBvD,OAfI,GAAS,KAAa,GAEtB,OAAO,GAAU,SAAiB,EAElC,OAAO,GAAU,UAAY,OAAO,GAAU,UAAkB,OAAO,CAAK,EAE5E,MAAM,QAAQ,CAAK,EAMd,EAAM,OAAQ,GAAM,OAAO,GAAM,UAAY,OAAO,GAAM,UAAY,OAAO,GAAM,SAAS,CAAC,CAAC,KAAK,GAAG,EAGxG,EACT,CCxBA,SAAgB,EAAgB,EAAc,EAAmC,CAC/E,IAAM,EAAQ,EAAK,YAAY,EACzB,EAAQ,EAAS,CAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,EACjD,EAA6B,CAAC,EAEpC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAI,EAAM,EAEV,KAAO,EAAM,EAAM,QAAQ,CACzB,IAAM,EAAM,EAAM,QAAQ,EAAM,CAAG,EAEnC,GAAI,IAAQ,GAAI,MAEhB,EAAO,KAAK,CAAC,EAAK,EAAM,EAAK,MAAM,CAAC,EACpC,EAAM,EAAM,CACd,CACF,CAEA,EAAO,MAAM,EAAG,IAAM,EAAE,GAAK,EAAE,EAAE,EAEjC,IAAM,EAA6B,CAAC,EAEpC,IAAK,IAAM,KAAS,EAAQ,CAC1B,IAAM,EAAO,EAAO,EAAO,OAAS,GAEhC,GAAQ,EAAM,IAAM,EAAK,GAC3B,EAAK,GAAK,KAAK,IAAI,EAAK,GAAI,EAAM,EAAE,EAEpC,EAAO,KAAK,CAAC,EAAM,GAAI,EAAM,EAAE,CAAC,CAEpC,CAEA,OAAO,CACT,CA+BA,SAAgB,EAAU,EAAc,EAA6C,CACnF,GAAI,CAAC,EAAM,MAAO,CAAC,EAEnB,GAAI,CAAC,EAAO,OAAQ,MAAO,CAAC,CAAE,YAAa,GAAO,MAAK,CAAC,EAExD,IAAM,EAAyB,CAAC,EAC5B,EAAS,EAEb,IAAK,GAAM,CAAC,EAAO,KAAQ,EACrB,EAAQ,GACV,EAAM,KAAK,CAAE,YAAa,GAAO,KAAM,EAAK,MAAM,EAAQ,CAAK,CAAE,CAAC,EAGhE,EAAM,GACR,EAAM,KAAK,CAAE,YAAa,GAAM,KAAM,EAAK,MAAM,EAAO,CAAG,CAAE,CAAC,EAGhE,EAAS,EAOX,OAJI,EAAS,EAAK,QAChB,EAAM,KAAK,CAAE,YAAa,GAAO,KAAM,EAAK,MAAM,CAAM,CAAE,CAAC,EAGtD,CACT,CAyBA,SAAgB,EAAkB,EAAyB,EAAyB,EAA+B,CAGjH,OAAO,EAAU,EAFH,EAAO,QAAQ,KAAM,GAAM,EAAE,QAAU,CAE9B,CAAA,EAAO,QAAU,CAAC,CAAC,CAC5C,CCnIA,IAAIA,EAAI,cAAc,KAAM,CAC3B,YAAY,EAAG,EAAG,CACjB,MAAM,EAAG,CAAC,EAAG,KAAK,KAAO,WAAW,KAAM,OAAO,eAAe,KAAM,WAAW,SAAS,CAC3F,CACD,EAAGC,EAAI,cAAcD,CAAE,CAAC,EAAG,EAAI,cAAcA,CAAE,CAAC,EAAGE,EAAI,cAAcF,CAAE,CAAC,EAAGG,EAAI,cAAcH,CAAE,CAAC,ECH5FI,EAAI,OAAO,IAAI,2BAA2B,EAAG,EAAI,IAAK,EAAI,OAAO,cAAc,EAAG,EAAI,KAAM,CAC/F,CAACA,GAAK,CAAC,EACP,WAA6B,IAAI,IACjC,KACA,QACA,YAAY,EAAG,EAAG,CACjB,KAAK,QAAU,EAAG,KAAK,KAAO,CAC/B,CACA,UAAU,EAAG,CACZ,KAAK,QAAQ,aAAa,EAAG,KAAK,KAAK,EACvC,IAAI,EAAI,CACP,aAA8B,IAAI,IAClC,wBAA2B,KAAK,QAAQ,gBAAgB,CAAC,CAC1D,EACA,OAAO,KAAK,WAAW,IAAI,CAAC,MAAS,KAAK,WAAW,OAAO,CAAC,CAC9D,CACA,QAAS,CACR,IAAK,IAAI,IAAK,CAAC,GAAG,KAAK,UAAU,EAAG,EAAE,oBAAoB,CAC3D,CACD,EAAGC,EAAI,cAAc,CAAE,CACtB,QACA,OACA,YAAY,EAAG,EAAG,EAAG,CACpB,MAAM,EAAG,GAAG,IAAI,EAAG,KAAK,QAAU,EAAG,KAAK,OAAS,GAAG,QAAU,OAAO,EACxE,CACA,IAAI,OAAQ,CACX,OAAO,KAAK,QAAQ,MAAM,IAAI,EAAG,KAAK,OACvC,CACA,IAAI,MAAM,EAAG,CACZ,GAAI,KAAK,QAAQ,aAAa,EAAG,KAAK,OAAO,KAAK,QAAS,CAAC,EAAG,OAC/D,IAAI,EAAI,KAAK,QACb,KAAK,QAAU,EAAG,KAAK,QAAQ,KAAK,CACnC,KAAM,QACN,KAAM,KAAK,KACX,KAAM,EACN,SAAU,CACX,CAAC,EAAG,KAAK,QAAQ,cAAgB,KAAK,OAAO,CAAC,CAC/C,CACA,MAAO,CACN,OAAO,KAAK,OACb,CACA,OAAO,EAAG,CACT,KAAK,MAAQ,EAAE,KAAK,OAAO,CAC5B,CACD,EAAGC,EAAI,cAAc,CAAE,CACtB,aAA+B,IAAI,IACnC,UAAY,CAAC,EACb,SAAW,CAAC,EACZ,MAAQ,CAAC,EACT,QAAU,EACV,OACA,OACA,YAAY,EAAG,EAAG,EAAG,CACpB,MAAM,EAAG,GAAG,IAAI,EAAG,KAAK,OAAS,EAAG,KAAK,OAAS,GAAG,QAAU,OAAO,EACvE,CACA,IAAI,OAAQ,CACX,OAAO,KAAK,QAAQ,EAAG,KAAK,QAAQ,MAAM,IAAI,EAAG,KAAK,OACvD,CACA,MAAO,CACN,OAAO,KAAK,QAAQ,EAAG,KAAK,OAC7B,CACA,qBAAsB,CACrB,KAAK,WAAa,KAAK,QAAU,CAAC,EAAG,KAAK,WAAW,KAAO,GAAK,KAAK,QAAQ,GAAK,KAAK,OAAO,EAChG,CACA,SAAU,CACT,KAAK,WAAa,KAAK,SAAW,CAAC,EAAG,KAAK,QAAQ,kBAAkB,IAAI,EAAG,KAAK,WAAW,MAAM,EACnG,CACA,SAAU,CACT,GAAI,CAAC,KAAK,OAAS,KAAK,SAAU,MAAO,CAAC,EAC1C,GAAI,KAAK,UAER,MAAM,IAAIC,EAAE,0BADJ,KAAK,OAAS,IAAK,GAAI,GAAK,KAAK,KAAK,KAAK,IACV,EAE1C,KAAK,UAAY,CAAC,EAAG,KAAK,QAAQ,KAAK,CACtC,KAAM,UACN,KAAM,KAAK,IACZ,CAAC,EACD,GAAI,CACH,IAAI,EAAI,KAAK,QAAQ,QAAQ,KAAM,KAAK,MAAM,EAAG,EAAI,KAAK,UAAY,GAAK,CAAC,KAAK,OAAO,KAAK,QAAS,CAAC,EACvG,MAAO,MAAK,QAAU,EAAG,KAAK,MAAQ,CAAC,EAAG,CAC3C,QAAU,CACT,KAAK,UAAY,CAAC,CACnB,CACD,CACD,EAAGC,EAAI,KAAM,CACZ,mBAAqB,IAAI,gBACzB,MAAwB,IAAI,IAC5B,KACA,WAAa,CAAC,EACd,QACA,YAAY,EAAG,EAAG,CACjB,KAAK,QAAU,EAAG,KAAK,KAAO,CAC/B,CACA,IAAI,UAAW,CACd,OAAO,KAAK,UACb,CACA,IAAI,gBAAiB,CACpB,OAAO,KAAK,mBAAmB,MAChC,CACA,IAAI,EAAG,CACN,GAAI,KAAK,WAAY,MAAM,IAAIC,EAAE,8BAA8B,EAC/D,OAAO,KAAK,QAAQ,UAAU,KAAM,CAAC,CACtC,CACA,SAAU,CACT,GAAI,CAAC,KAAK,WAAY,CACrB,KAAK,WAAa,CAAC,EACnB,IAAK,IAAI,IAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,QAAQ,EAAG,EAAE,QAAQ,EACnD,KAAK,MAAM,MAAM,EAAG,KAAK,mBAAmB,MAAM,EAAG,KAAK,QAAQ,KAAK,CACtE,KAAM,UACN,KAAM,KAAK,KACX,KAAM,OACP,CAAC,CACF,CACD,CACA,CAAC,OAAO,UAAW,CAClB,KAAK,QAAQ,CACd,CACD,EAAGC,EAAI,KAAM,CACZ,aAA+B,IAAI,IACnC,mBAAqB,IAAI,gBACzB,QACA,WAAa,CAAC,EACd,MACA,UAAY,CAAC,EACb,SACA,QACA,QACA,YAAY,EAAG,EAAG,EAAG,CACpB,KAAK,QAAU,EAAG,KAAK,SAAW,EAAG,KAAK,QAAU,CACrD,CACA,IAAI,UAAW,CACd,OAAO,KAAK,UACb,CACA,IAAI,gBAAiB,CACpB,OAAO,KAAK,mBAAmB,MAChC,CACA,qBAAsB,CACrB,GAAI,CAAC,KAAK,WAAY,CACrB,GAAI,KAAK,SAAS,YAAc,YAAa,CAC5C,GAAI,KAAK,UAAW,OACpB,KAAK,UAAY,CAAC,EAAG,mBAAqB,CACzC,KAAK,UAAY,CAAC,EAAG,KAAK,YAAc,KAAK,QAAQ,QAAQ,IAAI,CAClE,CAAC,EACD,MACD,CACA,KAAK,QAAQ,QAAQ,IAAI,CAC1B,CACD,CACA,KAAM,CACL,GAAI,KAAK,WAAY,OACrB,KAAK,OAAO,QAAQ,EAAG,KAAK,MAAQ,IAAK,GAAG,KAAK,WAAW,EAAG,KAAK,QAAQ,KAAK,CAChF,KAAM,SACN,KAAM,KAAK,SAAS,IACrB,CAAC,EACD,IAAI,EAAI,IAAIF,EAAE,KAAK,OAAO,EAC1B,GAAI,CACH,IAAI,EAAI,KAAK,QAAQ,gBAAgB,MAAS,KAAK,QAAQ,cAAc,KAAM,KAAK,QAAQ,CAAC,EAC7F,KAAK,MAAQ,EAAG,KAAK,QAAU,OAAO,GAAK,WAAa,EAAI,IAAK,EAClE,OAAS,EAAG,CACX,EAAE,QAAQ,EAAG,KAAK,QAAQ,OAAO,EAAG,CACnC,KAAM,SACN,KAAM,KAAK,SAAS,IACrB,CAAC,CACF,CACD,CACA,SAAU,CACT,KAAK,aAAe,KAAK,WAAa,CAAC,EAAG,KAAK,OAAO,QAAQ,EAAG,KAAK,MAAQ,IAAK,GAAG,KAAK,QAAQ,kBAAkB,IAAI,EAAG,KAAK,WAAW,EAAG,KAAK,mBAAmB,MAAM,EAAG,KAAK,QAAQ,KAAK,CACjM,KAAM,UACN,KAAM,KAAK,SAAS,KACpB,KAAM,QACP,CAAC,EACF,CACA,CAAC,OAAO,UAAW,CAClB,KAAK,QAAQ,CACd,CACA,YAAa,CACZ,IAAI,EAAI,KAAK,QACb,GAAI,KAAK,QAAU,IAAK,GAAG,IAAM,IAAK,GAAG,GAAI,CAC5C,EAAE,CACH,OAAS,EAAG,CACX,KAAK,QAAQ,OAAO,EAAG,CACtB,KAAM,UACN,KAAM,KAAK,SAAS,IACrB,CAAC,CACF,CACD,CACD,EAAGG,EAAI,KAAM,CACZ,kBACA,eACA,YACA,WAAa,CAAC,EACd,WAAa,EACb,SAAW,CAAC,EACZ,QAA0B,IAAI,IAC9B,UAA4B,IAAI,IAChC,UACA,SACA,QACA,YAAY,EAAG,CACd,KAAK,SAAW,GAAG,SAAU,KAAK,QAAU,GAAG,UAAa,GAAM,CACjE,mBAAqB,CACpB,MAAM,CACP,CAAC,CACF,GAAI,KAAK,UAAY,IAAIH,EAAE,KAAM,SAAS,EAAG,KAAK,YAAc,KAAK,SACtE,CACA,IAAI,UAAW,CACd,OAAO,KAAK,UACb,CACA,QAAU,EAAG,KAAO,KAAK,aAAa,EAAG,IAAIH,EAAE,KAAM,EAAG,CAAC,GACzD,UAAY,EAAG,IAAM,CACpB,KAAK,aAAa,EAClB,IAAI,EAAI,IAAIC,EAAE,KAAM,EAAG,CAAC,EACxB,OAAQ,KAAK,mBAAqB,KAAK,YAAA,CAAa,MAAM,IAAI,CAAC,EAAG,CACnE,EACA,QAAU,EAAG,IAAM,CAClB,KAAK,aAAa,EAClB,IAAI,EAAI,IAAII,EAAE,KAAM,EAAG,CAAC,EACxB,OAAQ,KAAK,mBAAqB,KAAK,YAAA,CAAa,MAAM,IAAI,CAAC,EAAG,EAAE,IAAI,EAAG,CAC5E,EACA,YAAe,GAAM,CACpB,KAAK,aAAa,EAClB,IAAI,EAAI,IAAIF,EAAE,KAAM,CAAC,EACrB,OAAO,KAAK,YAAY,MAAM,IAAI,CAAC,EAAG,CACvC,EACA,MAAS,IAAO,KAAK,aAAa,EAAG,KAAK,UAAU,CAAC,GACrD,QAAW,IAAO,KAAK,aAAa,EAAG,KAAK,aAAa,IAAK,GAAG,CAAC,GAClE,SAAU,CACT,KAAK,aAAe,KAAK,WAAa,CAAC,EAAG,KAAK,UAAU,QAAQ,EAClE,CACA,cAAe,CACd,GAAI,KAAK,WAAY,MAAM,IAAII,EAAE,uCAAuC,CACzE,CACA,MAAM,EAAG,CACR,IAAI,EAAI,KAAK,eACb,GAAG,aAAe,IAAK,IAAK,EAAE,WAAW,IAAI,CAAC,CAC/C,CACA,kBAAkB,EAAG,CACpB,IAAK,IAAI,KAAK,EAAE,aAAc,EAAE,WAAW,OAAO,CAAC,EACnD,EAAE,aAAa,MAAM,CACtB,CACA,QAAQ,EAAG,EAAG,CACb,OAAO,KAAK,YAAY,EAAG,EAAG,CAAC,CAAC,CACjC,CACA,cAAc,EAAG,EAAG,CACnB,OAAO,KAAK,YAAY,EAAG,EAAG,CAAC,CAAC,CACjC,CACA,gBAAgB,EAAG,EAAG,CACrB,IAAI,EAAI,KAAK,kBACb,KAAK,kBAAoB,EACzB,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,kBAAoB,CAC1B,CACD,CACA,aAAa,EAAG,EAAG,CAClB,IAAI,EAAI,KAAK,eACb,KAAK,eAAiB,EACtB,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,eAAiB,CACvB,CACD,CACA,UAAU,EAAG,EAAG,CACf,IAAI,EAAI,KAAK,kBAAmB,EAAI,KAAK,YACzC,KAAK,kBAAoB,IAAK,GAAG,KAAK,YAAc,EACpD,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,kBAAoB,EAAG,KAAK,YAAc,CAChD,CACD,CACA,QAAQ,EAAG,CACV,KAAK,QAAQ,IAAI,CAAC,EAAG,KAAK,aAAe,GAAK,KAAK,MAAM,CAC1D,CACA,gBAAgB,EAAG,CAClB,KAAK,UAAU,IAAI,CAAC,EAAG,KAAK,aAAe,GAAK,KAAK,MAAM,CAC5D,CACA,UAAU,EAAG,CACZ,KAAK,aACL,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,aAAc,KAAK,aAAe,GAAK,KAAK,MAAM,CACxD,CACD,CACA,KAAK,EAAG,CACP,GAAI,CACH,KAAK,WAAW,CAAC,CAClB,OAAS,EAAG,CACX,KAAK,OAAO,EAAG,CACd,KAAM,WACN,KAAM,EAAE,IACT,CAAC,CACF,CACD,CACA,OAAO,EAAG,EAAG,CACZ,GAAI,CACH,KAAK,QAAQ,EAAG,CAAC,CAClB,OAAS,EAAG,CACX,mBAAqB,CACpB,MAAM,CACP,CAAC,CACF,CACD,CACA,YAAY,EAAG,EAAG,EAAG,CACpB,IAAI,EAAI,KAAK,eAAgB,EAAoB,IAAI,IACrD,EAAE,WAAa,EAAG,KAAK,eAAiB,EACxC,GAAI,CACH,IAAI,EAAI,EAAE,EACV,OAAO,KAAK,mBAAmB,EAAG,CAAC,EAAG,CACvC,OAAS,EAAG,CACX,MAAM,GAAK,KAAK,mBAAmB,EAAG,CAAC,EAAG,CAC3C,QAAU,CACT,EAAE,WAAa,IAAK,GAAG,KAAK,eAAiB,CAC9C,CACD,CACA,mBAAmB,EAAG,EAAG,CACxB,IAAK,IAAI,KAAK,EAAE,aAAc,EAAE,IAAI,CAAC,GAAK,EAAE,WAAW,OAAO,CAAC,EAC/D,IAAK,IAAI,KAAK,EAAG,EAAE,aAAa,IAAI,CAAC,GAAK,EAAE,WAAW,IAAI,CAAC,EAC5D,EAAE,aAAa,MAAM,EACrB,IAAK,IAAI,KAAK,EAAG,EAAE,aAAa,IAAI,CAAC,CACtC,CACA,OAAQ,CACP,GAAI,KAAK,SAAU,OACnB,KAAK,SAAW,CAAC,EACjB,IAAI,EAAI,EACR,GAAI,CACH,KAAO,KAAK,QAAQ,KAAO,GAAK,KAAK,UAAU,KAAO,GAAI,CACzD,GAAI,EAAE,EAAI,EAAG,MAAM,IAAIC,EAAE,6BAA6B,EAAE,aAAa,EACrE,IAAI,EAAI,CAAC,GAAG,KAAK,OAAO,EAAG,EAAI,CAAC,GAAG,KAAK,SAAS,EACjD,KAAK,QAAQ,MAAM,EAAG,KAAK,UAAU,MAAM,EAC3C,IAAK,IAAI,KAAK,EAAG,EAAE,IAAI,EACvB,IAAK,IAAI,KAAK,EAAG,GAAI,CACpB,EAAE,CACH,OAAS,EAAG,CACX,KAAK,OAAO,EAAG,CAAE,KAAM,UAAW,CAAC,CACpC,CACD,CACD,QAAU,CACT,KAAK,SAAW,CAAC,CAClB,CACD,CACD,ECxVI,EAAK,IAAO,EAAG,EAAG,IAAM,CAC3B,IAAI,EAAI,EAAE,OAAO,CAAE,OAAQ,SAAU,EAAG,CAAE,KAAM,GAAG,IAAK,CAAC,EAAG,EAAI,EAAE,OAAO,CAAC,EAAG,EAAG,EAAI,CAAC,EAAG,MAAU,CACjG,EAAE,MAAO,GAAG,MAAM,EAClB,IAAI,EAAI,EAAE,KAAK,EAAG,EAAI,EAAE,SAAW,UAAY,EAAE,MAAQ,aAAc,EAAI,EAAE,SAAW,IAAK,GAAG,EAChG,GAAI,CACH,EAAI,EAAE,CACP,OAAS,EAAG,CACX,EAAE,MAAQ,IAAM,IAAK,GAAI,CACxB,MAAO,EACP,OAAQ,OACT,EAAI,CACH,MAAO,EACP,SAAU,EACV,OAAQ,OACT,EACA,MACD,CACA,IAAI,EAAI,IAAI,gBACZ,EAAI,EAAG,EAAE,MAAQ,IAAM,IAAK,GAAI,CAAE,OAAQ,SAAU,EAAI,CACvD,SAAU,EACV,OAAQ,SACT,EACA,IAAI,EACJ,GAAI,CACH,EAAI,QAAQ,QAAQ,EAAE,EAAG,CAAE,OAAQ,EAAE,MAAO,CAAC,CAAC,CAC/C,OAAS,EAAG,CACX,EAAI,QAAQ,OAAO,CAAC,CACrB,CACA,EAAE,KAAM,GAAM,CACb,CAAC,GAAK,CAAC,EAAE,OAAO,UAAY,EAAE,MAAQ,CACrC,OAAQ,UACR,MAAO,CACR,EACD,EAAI,GAAM,CACT,CAAC,GAAK,CAAC,EAAE,OAAO,UAAY,EAAE,MAAQ,IAAM,IAAK,GAAI,CACpD,MAAO,EACP,OAAQ,OACT,EAAI,CACH,MAAO,EACP,SAAU,EACV,OAAQ,OACT,EACD,CAAC,CACF,EAAG,EAAI,EAAE,YAAc,EAAE,MAAS,GAAG,MAAM,GAAI,CAAE,KAAM,GAAG,IAAK,CAAC,EAChE,EAAE,eAAe,iBAAiB,YAAe,CAChD,EAAI,CAAC,CACN,EAAG,CAAE,KAAM,CAAC,CAAE,CAAC,EACf,IAAI,EAAI,CACP,IAAI,gBAAiB,CACpB,OAAO,EAAE,cACV,EACA,YAAe,EAAE,QAAQ,EACzB,IAAI,UAAW,CACd,OAAO,CACR,EACA,IAAI,MAAO,CACV,OAAO,EAAE,IACV,EACA,SAAY,EAAE,KAAK,EACnB,WAAc,CACb,IAAM,EAAE,MAAQ,EAAE,KAAK,EAAI,EAC5B,EACA,UAAY,GAAM,EAAE,UAAU,CAAC,EAC/B,CAAC,OAAO,UAAW,CAClB,KAAK,QAAQ,CACd,EACA,IAAI,OAAQ,CACX,OAAO,EAAE,KACV,CACD,EACA,OAAO,OAAO,eAAe,EAAGC,EAAG,CAAE,MAAO,CAAC,CAAE,CAAC,EAAG,CACpD,ECxEI,EAAK,IAAO,EAAG,EAAG,IAAM,CAC3B,IAAI,EAAI,OAAO,GAAK,WAAa,MAAU,EAAE,MAAO,EAAI,GAAG,QAAU,OAAO,GAAI,EAAI,CAAC,EAAG,EAAG,EAAI,CAAC,EAAG,EAAI,EAAE,WAAa,CACrH,IAAI,EAAI,EAAE,EACV,GAAI,EAAG,CACN,EAAI,CAAC,EAAG,EAAI,EAAG,GAAG,YAAc,EAAE,EAAG,IAAK,EAAC,EAAG,GAAG,OAAS,EAAI,CAAC,IAC/D,MACD,CACA,GAAI,EAAE,EAAG,CAAC,EAAG,OACb,IAAI,EAAI,EACR,EAAI,EAAG,EAAE,EAAG,CAAC,EAAG,GAAG,MAAQ,EAAE,QAAQ,CACtC,EAAG,CAAE,KAAM,GAAG,IAAK,CAAC,EACpB,OAAO,GAAK,EAAE,QAAQ,EAAG,CAC1B,ECOG,GAhBM,GAAM,CACd,IAAI,EAAI,IAAIC,EAAE,CAAC,EAAG,EAAI,EAAE,CAAC,EACzB,MAAO,CACN,MAAO,EAAE,MACT,SAAU,EAAE,SACZ,YAAa,EAAE,YACf,YAAe,EAAE,QAAQ,EACzB,IAAI,UAAW,CACd,OAAO,EAAE,QACV,EACA,OAAQ,EAAE,OACV,SAAU,EACV,OAAQ,EAAE,OACV,QAAS,EAAE,QACX,MAAOC,EAAE,CAAC,CACX,CACD,EAAO,CAAE,EChBL,EAAIC,EAAE,OAAQ,EAAIA,EAAE,SAAcA,EAAE,OAAQ,IAAA,EAAIA,EAAE,MAAWA,EAAE,YAAiBA,EAAE,QAAaA,EAAE,MAAWA,EAAE,SCOlH,SAAgB,EAAiB,EAA2B,CAC1D,IAAM,EAAW,IAAI,IACf,EAAS,IAAI,EAAK,GAExB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAS,EAAG,IACrC,EAAS,IAAI,EAAO,MAAM,EAAG,EAAI,CAAC,CAAC,EAGrC,OAAO,CACT,CAiCA,SAAgB,EAAkB,EAAgB,EAAwB,CACxE,GAAI,EAAE,OAAS,GAAK,EAAE,OAAS,EAAG,MAAO,GAEzC,IAAI,EAAS,EAEb,IAAK,IAAM,KAAW,EAChB,EAAE,IAAI,CAAO,GAAG,IAKtB,OAFI,EAAS,GAAK,EAAS,EAAE,KAAa,EAEnC,EAAS,KAAK,IAAI,EAAE,KAAM,EAAE,IAAI,CACzC,CCUA,SAAS,EAAqB,EAAe,EAAc,EAAyB,CAClF,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,CAAC,OAAO,UAAU,CAAK,GAAK,EAAQ,EACjE,MAAM,IAAI,EAAwB,GAAG,EAAK,qDAAqD,EAAQ,EAAE,EAG3G,OAAO,CACT,CAEA,SAAS,EAAoB,EAAe,EAAc,EAAiB,EAAU,IAAkC,CACrH,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,GAAW,EAAQ,EACxD,MAAM,IAAI,EAAwB,GAAG,EAAK,mCAAmC,EAAQ,OAAO,EAAQ,EAAE,EAGxG,OAAO,CACT,CAEA,SAAS,EAAiB,EAAoD,CAC5E,OAAO,EAAK,IAAK,GACX,OAAO,GAAQ,SACV,CAAE,MAAO,EAAK,UAAW,EAAkB,OAAQ,CAAE,EAGvD,CACL,MAAO,EAAI,MACX,UAAW,EAAI,WAAa,EAC5B,OAAQ,EAAoB,EAAI,QAAU,EAAG,qBAAqB,EAAI,MAAM,GAAI,OAAO,SAAS,CAClG,CACD,CACH,CAqBA,SAAgB,EAAe,EAAY,EAA8C,CACvF,GAAI,EAAQ,OAAO,SAAW,EAC5B,MAAM,IAAI,EAAwB,8CAA8C,EAGlF,IAAM,EAAS,EAAc,EAAQ,MAAM,EACrC,EAAY,EAAO,QAAQ,EAAK,IAAM,KAAK,IAAI,EAAK,EAAE,MAAM,EAAG,CAAC,EAChE,EAAmB,EAAoB,EAAQ,WAAa,GAAK,YAAa,EAAG,CAAC,EAClF,EAAe,EAAqB,EAAQ,OAAS,GAAI,QAAS,CAAC,EACnE,EAAwB,EAAqB,EAAQ,gBAAkB,EAAG,iBAAkB,CAAC,EAG7F,EAAW,IAAI,IAEf,EAAgB,IAAI,IACpB,EAAoB,IAAI,IAC1B,EAAW,EAEf,SAAS,GAAuB,CAC9B,IAEA,IAAK,IAAM,KAAY,EAAmB,EAAS,CACrD,CAGA,IAAI,EAAkC,KAClC,EAAqC,KAEzC,SAAS,EAAiB,EAAiC,CAMzD,OALI,IAAe,GAAoB,IAAmB,KAAa,GAEvE,EAAmB,EACnB,EAAiB,EAAiB,CAAU,EAErC,EACT,CAEA,SAAS,EAAgB,EAAS,EAAkC,CAClE,IAAK,IAAM,KAAW,EAAe,CACnC,IAAI,EAAS,EAAc,IAAI,CAAO,EAEjC,IACH,EAAS,IAAI,IACb,EAAc,IAAI,EAAS,CAAM,GAGnC,EAAO,IAAI,CAAI,CACjB,CACF,CAEA,SAAS,EAAqB,EAAS,EAAkC,CACvE,IAAK,IAAM,KAAW,EAAe,CACnC,IAAM,EAAS,EAAc,IAAI,CAAO,EAEpC,IACF,EAAO,OAAO,CAAI,EAEd,EAAO,OAAS,GAAG,EAAc,OAAO,CAAO,EAEvD,CACF,CAEA,SAAS,EAAQ,EAAe,CAC9B,IAAM,EAAW,IAAI,IACf,EAAS,IAAI,IAEnB,IAAK,GAAM,CAAE,QAAO,eAAe,EAAQ,CACzC,IAAM,EAAM,EAAK,GACX,EAAO,EAAU,CAAG,EACpB,EAAa,EAAS,CAAI,EAC1B,EAAgB,EAAW,QAAU,EAAI,EAAiB,CAAU,EAAI,IAAI,IAElF,EAAS,IAAI,EAAO,CAAa,EACjC,EAAO,IAAI,EAAO,CAAI,EACtB,EAAgB,EAAM,CAAa,CACrC,CAEA,EAAS,IAAI,EAAM,CAAE,WAAU,QAAO,CAAC,CACzC,CAOA,SAAS,EAAgB,EAAuB,CAC9C,IAAM,EAAS,IAAI,IAEnB,IAAK,GAAM,CAAC,EAAM,KAAW,EAC3B,IAAK,IAAM,KAAS,EAAO,OAAO,OAAO,EACvC,GAAI,EAAM,YAAY,CAAC,CAAC,SAAS,CAAK,EAAG,CACvC,EAAO,IAAI,CAAI,EACf,KACF,CAIJ,OAAO,CACT,CAEA,SAAS,EAAkB,EAAoC,CAC7D,IAAM,EAAa,IAAI,IAEvB,IAAK,IAAM,KAAW,EAAe,CACnC,IAAM,EAAQ,EAAc,IAAI,CAAO,EAEvC,GAAI,EACF,IAAK,IAAM,KAAQ,EAAO,EAAW,IAAI,CAAI,CAEjD,CAEA,OAAO,CACT,CAEA,SAAS,EAAe,EAAoB,EAAmC,EAA4B,CACzG,IAAI,EAAY,EAEhB,IAAK,GAAM,CAAE,QAAO,YAAY,EAAQ,CACtC,IAAI,EAEJ,GAAI,IAAkB,KAGpB,EAAA,IAFY,EAAO,OAAO,IAAI,CAAK,GAAK,GAAA,CAEvB,YAAY,CAAC,CAAC,SAAS,CAAU,MAC7C,CACL,IAAM,EAAe,EAAO,SAAS,IAAI,CAAK,EAE9C,GAAI,CAAC,GAAgB,EAAa,OAAS,EAAG,SAE9C,EAAa,EAAkB,EAAe,CAAY,CAC5D,CAEA,IAAM,EAAyB,EAAS,EAAvB,EAEb,EAAW,IAAW,EAAY,EACxC,CAEA,OAAO,CACT,CAEA,SAAS,EAAe,EAAe,EAA6D,CAClG,IAAM,EAA0C,CAAC,EAEjD,IAAK,GAAM,CAAE,WAAW,EAAQ,CAC9B,IAAM,EAAO,EAAO,IAAI,CAAK,EAE7B,GAAI,CAAC,EAAM,SAEX,IAAM,EAAS,EAAgB,EAAM,CAAK,EAEtC,EAAO,OAAS,GAAG,EAAQ,KAAK,CAAE,QAAO,QAAO,CAAC,CACvD,CAEA,OAAO,CACT,CAEA,SAAS,EAAY,EAAkB,CACrC,IAAM,EAAS,EAAS,IAAI,CAAI,EAEhC,GAAI,CAAC,EAAQ,MAAO,GAEpB,IAAI,EAAU,GAEd,IAAK,GAAM,CAAE,QAAO,eAAe,EAAQ,CACzC,IAAM,EAAU,EAAU,EAAK,EAAM,EAGrC,GAAI,IAFY,EAAO,OAAO,IAAI,CAElB,EAAS,SAEzB,EAAU,GAEV,IAAM,EAAc,EAAO,SAAS,IAAI,CAAK,EAEzC,GAAa,EAAqB,EAAM,CAAW,EAEvD,IAAM,EAAa,EAAS,CAAO,EAC7B,EAAc,EAAW,QAAU,EAAI,EAAiB,CAAU,EAAI,IAAI,IAEhF,EAAO,SAAS,IAAI,EAAO,CAAW,EACtC,EAAO,OAAO,IAAI,EAAO,CAAO,EAChC,EAAgB,EAAM,CAAW,CACnC,CAEA,OAAO,CACT,CAEA,SAAS,EAAW,EAAkB,CACpC,IAAM,EAAS,EAAS,IAAI,CAAI,EAEhC,GAAI,CAAC,EAAQ,MAAO,GAEpB,IAAK,IAAM,KAAiB,EAAO,SAAS,OAAO,EACjD,EAAqB,EAAM,CAAa,EAK1C,OAFA,EAAS,OAAO,CAAI,EAEb,EACT,CAEA,IAAK,IAAM,KAAQ,EACZ,EAAS,IAAI,CAAI,GAAG,EAAQ,CAAI,EAqHvC,MAAO,CAjHL,IAAI,EAAe,CACb,EAAS,IAAI,CAAI,IAErB,EAAQ,CAAI,EACZ,EAAe,EACjB,EAEA,IAAI,OAAsB,CACxB,MAAO,CAAC,GAAG,EAAS,KAAK,CAAC,CAC5B,EAEA,SAAS,EAAkC,CAGzC,OAFA,EAAkB,IAAI,CAAQ,MAEjB,CACX,EAAkB,OAAO,CAAQ,CACnC,CACF,EAEA,QAAQ,EAAe,CACjB,EAAY,CAAI,GAAG,EAAe,CACxC,EAEA,OAAO,EAAe,CAChB,EAAW,CAAI,GAAG,EAAe,CACvC,EAEA,IAAI,UAAmB,CACrB,OAAO,CACT,EAEA,OAAO,EAAe,EAAgD,CACpE,IAAM,EAAY,EAAoB,GAAS,WAAa,EAAkB,YAAa,EAAG,CAAC,EACzF,EAAQ,EAAqB,GAAS,OAAS,EAAc,QAAS,CAAC,EACvE,EAAiB,EACrB,GAAS,gBAAkB,EAC3B,iBACA,CACF,EAEA,GAAI,CAAC,EAAM,KAAK,EACd,MAAO,CAAC,GAAG,EAAS,KAAK,CAAC,CAAC,CAAC,MAAM,EAAG,CAAK,CAAC,CAAC,IAAK,IAAU,CAAE,OAAM,QAAS,CAAC,EAAG,MAAO,CAAE,EAAE,EAG7F,IAAM,EAAa,EAAS,CAAK,EAGjC,GAAI,CAAC,EAAY,MAAO,CAAC,EAGzB,IAAM,EADU,EAAW,OAAS,EACJ,KAAO,EAAiB,CAAU,EAC5D,EAAa,IAAkB,KAAO,EAAgB,CAAU,EAAI,EAAkB,CAAa,EACnG,EAA6B,CAAC,EAEpC,IAAK,IAAM,KAAQ,EAAY,CAC7B,IAAM,EAAS,EAAS,IAAI,CAAI,EAEhC,GAAI,CAAC,EAAQ,SAEb,IAAM,EAAQ,EAAe,EAAY,EAAe,CAAM,EAE9D,GAAI,GAAS,EAAW,CACtB,IAAM,EAAU,EAAe,EAAY,EAAO,MAAM,EAExD,EAAQ,KAAK,CAAE,OAAM,UAAS,OAAM,CAAC,CACvC,CACF,CAEA,OAAO,EAAQ,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,EAAG,CAAK,CACjE,EAEA,SAAS,EAA2B,CAClC,IAAM,EAAW,IAAI,IAAI,CAAK,EACxB,EAAO,CAAC,GAAG,CAAQ,EACrB,EAAU,GAEd,IAAK,IAAM,IAAQ,CAAC,GAAG,EAAS,KAAK,CAAC,EAChC,EAAS,IAAI,CAAI,IAErB,EAAW,CAAI,EACf,EAAU,IAGZ,IAAK,IAAM,KAAQ,EACZ,EAAS,IAAI,CAAI,EAGX,EAAY,CAAI,IACzB,EAAU,KAHV,EAAQ,CAAI,EACZ,EAAU,IAMd,IAAM,EAAU,CAAC,GAAG,EAAS,KAAK,CAAC,EAGnC,GAFqB,EAAQ,SAAW,EAAK,QAAU,EAAQ,MAAM,EAAM,IAAU,IAAS,EAAK,EAAM,EAEvF,CAChB,IAAM,EAAU,IAAI,IAAI,EAAK,IAAK,GAAS,CAAC,EAAM,EAAS,IAAI,CAAI,CAAE,CAAC,CAAC,EAEvE,EAAS,MAAM,EAEf,IAAK,GAAM,CAAC,EAAM,KAAW,EAAS,EAAS,IAAI,EAAM,CAAM,EAE/D,EAAU,EACZ,CAEI,GAAS,EAAe,CAC9B,EAEA,IAAI,MAAe,CACjB,OAAO,EAAS,IAClB,CAGK,CACT,CC9aA,IAAM,EAAmB,IAsCzB,SAAgB,EAAgB,EAAsB,EAA+B,CAAC,EAAmB,CACvG,GAAM,CAAE,SAAU,EAAa,EAAkB,QAAO,iBAAgB,aAAc,EAEtF,GAAI,CAAC,OAAO,SAAS,CAAU,GAAK,CAAC,OAAO,UAAU,CAAU,GAAK,EAAa,EAChF,MAAM,IAAI,EAAwB,iDAAiD,EAGrF,IAAM,EAAQ,EAAe,GAAI,CAAE,KAAM,aAAc,CAAC,EAClD,EAAiB,EAAe,GAAI,CAAE,KAAM,sBAAuB,CAAC,EACpE,EAAe,EAAO,EAAG,CAAE,KAAM,oBAAqB,CAAC,EAEvD,EAAuB,EAAM,aAAe,CAChD,EAAa,OACf,CAAC,EAEK,EAAc,MAAe,EAAM,QAAU,EAAe,MAAO,CAAE,KAAM,mBAAoB,CAAC,EAEhG,EAAU,OAGZ,EAAkB,MAEX,EAAM,OAAO,EAAe,MAAO,CAAE,QAAO,iBAAgB,WAAU,CAAC,GAEhF,CAAE,KAAM,eAAgB,CAC1B,EAEI,EAA8C,KAElD,SAAS,GAAoB,CACvB,IAAU,OACZ,aAAa,CAAK,EAClB,EAAQ,KAEZ,CAEA,IAAM,EAAe,EAAM,cAAgB,CACzC,IAAM,EAAI,EAAM,KAAK,EAErB,KAAY,EAER,IAAM,EAAe,KAAK,EAE9B,IAAI,IAAe,EAAG,CACpB,EAAe,MAAQ,EAEvB,MACF,CAEA,EAAQ,eAAiB,CACvB,EAAe,MAAQ,EACvB,EAAQ,IACV,EAAG,CAAU,CALb,CAMF,CAAC,EAED,SAAS,GAAc,CACrB,GAAI,EAAY,MAAM,IAAI,EAAmB,4CAA4C,EAEzF,EAAY,EAEZ,MAAY,CACV,EAAM,MAAQ,GACd,EAAe,MAAQ,EACzB,CAAC,CACH,CAEA,IAAI,EAAa,GACX,EAAK,IAAI,gBAEf,SAAS,GAAgB,CACvB,EAAa,GACb,EAAG,MAAM,EACT,EAAY,EACZ,EAAa,EACb,EAAqB,CACvB,CAEA,MAAO,CACL,QACA,IAAI,gBAA8B,CAChC,OAAO,EAAG,MACZ,EACA,UACA,IAAI,UAAoB,CACtB,OAAO,CACT,EACA,cACA,QACA,UACA,CAAC,OAAO,UAAiB,CACvB,EAAQ,CACV,CACF,CACF,CA4BA,SAAgB,EACd,EACA,EACmB,CACnB,IAAM,EAAQ,EAAY,EAAO,CAC/B,OAAQ,EAAQ,OAChB,MAAO,EAAQ,MACf,eAAgB,EAAQ,eACxB,UAAW,EAAQ,SACrB,CAAC,EACK,EAAQ,EAAa,EAAO,CAAE,SAAU,EAAQ,QAAS,CAAC,EAEhE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAK,EAAG,CAAE,OAAM,CAAC,CACtD,CCjKA,SAAgB,EAAa,EAAsB,CACjD,IAAM,EAAY,EAAa,EAI/B,OAFK,EAEE,CAAC,GAAG,EAAU,QAAQ,CAAI,CAAC,CAAC,CAChC,OAAQ,GAAY,EAAQ,UAAU,CAAC,CACvC,IAAK,GAAY,EAAQ,OAAO,CAAC,CACjC,KAAK,GAAG,EALY,CAMzB,CAKA,IAAI,EAEJ,SAAS,GAAsC,CAQ7C,OAPI,IAAoB,IAAA,KACtB,EACE,OAAO,KAAS,KAAe,OAAO,KAAK,WAAc,WACrD,KACA,IAAI,KAAK,UAAU,IAAA,GAAW,CAAE,YAAa,MAAO,CAAC,GAGtD,CACT"}
1
+ {"version":3,"file":"scout.cjs","names":["e","t","r","i","i","c","l","e","u","n","d","f","t","r","e","e","n","s"],"sources":["../src/adapters.ts","../src/errors.ts","../src/_dev.ts","../src/tokenize.ts","../src/highlight.ts","../../ripple/dist/errors.js","../../ripple/dist/runtime.js","../../ripple/dist/_async.js","../../ripple/dist/_watch.js","../../ripple/dist/_default.js","../../ripple/dist/index.js","../src/trigram.ts","../src/scout-index.ts","../src/reactive.ts","../src/segment.ts"],"sourcesContent":["import type { ScoutIndex } from './scout-index';\nimport type { SearchConstraints } from './types';\n\n/**\n * Adapts a `ScoutIndex` to sourcerer's explicit local `match` callback.\n * Caches one match set per query so local filtering does not repeat index work per item.\n */\nexport function toSearchMatcher<T>(\n index: ScoutIndex<T>,\n options?: SearchConstraints,\n): (item: T, query: string) => boolean {\n let lastQuery: string | undefined;\n let lastRevision = -1;\n let matches = new Set<T>();\n\n return (item, query) => {\n if (query !== lastQuery || index.revision !== lastRevision) {\n lastQuery = query;\n lastRevision = index.revision;\n matches = new Set(index.search(query, options).map((result) => result.item));\n }\n\n return matches.has(item);\n };\n}\n\n/**\n * Returns a predicate that returns `true` for items matching `query` in the given index.\n *\n * The predicate is computed once at call time — call `toFilterPredicate` again if the\n * query or corpus changes.\n *\n * Compatible with `Array.filter`, `vault`'s `query.filter()`, or any predicate pipeline.\n */\nexport function toFilterPredicate<T>(\n index: ScoutIndex<T>,\n query: string,\n options?: SearchConstraints,\n): (item: T) => boolean {\n const matchSet = new Set(index.search(query, options).map((result) => result.item));\n\n return (item) => matchSet.has(item);\n}\n","/** Base class for all scout errors. Use `instanceof ScoutError` to catch any scout-originated error. */\nexport class ScoutError extends Error {\n constructor(message: string, opts?: ErrorOptions) {\n super(message, opts);\n this.name = new.target.name;\n Object.setPrototypeOf(this, new.target.prototype);\n }\n}\n\n/** Thrown when a method is called on a disposed search state instance. */\nexport class ScoutDisposedError extends ScoutError {}\n\n/** Thrown when an index, search, or reactive search receives an invalid configuration. */\nexport class ScoutConfigurationError extends ScoutError {}\n","const isDev = !(globalThis as { __SCOUT_PROD__?: boolean }).__SCOUT_PROD__;\n\n/** @internal */\nexport function warn(msg: string): void {\n if (isDev) console.warn(`[@vielzeug/scout] ${msg}`);\n}\n","import { warn } from './_dev';\n\n/**\n * Normalizes a string for indexing or querying.\n * Lowercases, replaces punctuation (except apostrophes) with spaces,\n * trims, and collapses runs of whitespace to a single space.\n * @internal\n */\nexport function tokenize(text: string): string {\n return text\n .toLowerCase()\n .replace(/[^\\p{L}\\p{N}\\s']/gu, ' ')\n .trim()\n .replace(/\\s+/g, ' ');\n}\n\n/**\n * Converts an unknown field value to an indexable string.\n * Returns an empty string for `null`, `undefined`, objects, or symbols.\n * @internal\n */\nexport function defaultStringify(value: unknown): string {\n if (value == null) return '';\n\n if (typeof value === 'string') return value;\n\n if (typeof value === 'number' || typeof value === 'boolean') return String(value);\n\n if (Array.isArray(value)) {\n warn(\n 'defaultStringify: received an array value — provide a custom `stringify` on the FieldDef to control array indexing.\\n' +\n 'Falling back to joining string/number/boolean elements with a space.',\n );\n\n return value.filter((v) => typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean').join(' ');\n }\n\n return '';\n}\n","import { tokenize } from './tokenize';\nimport type { HighlightPart, SearchResult } from './types';\n\n/**\n * Finds character ranges within `text` where `query` words appear.\n * Ranges are sorted and overlapping ranges are merged.\n *\n * Useful when you need to apply match ranges to a different string than the\n * indexed field value (e.g. a truncated preview or a differently formatted display string).\n *\n * @param text - The string to search within.\n * @param query - Raw query text. It is normalized with Scout's tokenizer before literal lookup.\n * @returns Sorted, non-overlapping `[start, end]` character ranges.\n */\nexport function findMatchRanges(text: string, query: string): [number, number][] {\n const lower = text.toLowerCase();\n const words = tokenize(query).split(' ').filter(Boolean);\n const ranges: [number, number][] = [];\n\n for (const word of words) {\n let pos = 0;\n\n while (pos < lower.length) {\n const idx = lower.indexOf(word, pos);\n\n if (idx === -1) break;\n\n ranges.push([idx, idx + word.length]);\n pos = idx + 1;\n }\n }\n\n ranges.sort((a, b) => a[0] - b[0]);\n\n const merged: [number, number][] = [];\n\n for (const range of ranges) {\n const last = merged[merged.length - 1];\n\n if (last && range[0] <= last[1]) {\n last[1] = Math.max(last[1], range[1]);\n } else {\n merged.push([range[0], range[1]]);\n }\n }\n\n return merged;\n}\n\n/**\n * Splits `text` into highlighted and unhighlighted fragments using match `ranges`.\n *\n * Ranges must be sorted and non-overlapping (as produced by `SearchResult.matches[n].ranges`).\n * Use the returned parts to render highlighted text in a UI component.\n *\n * **`part.text` is the original, unescaped field value** (e.g. a user's name, bio, or\n * product title) — this function does no HTML escaping. Render each part via safe DOM APIs\n * (`textContent`, a framework's text binding) and wrap `highlighted` parts in your own\n * element (e.g. `<mark>`); never concatenate `part.text` into an HTML string for\n * `innerHTML` — that reintroduces the XSS risk this structured return shape avoids.\n *\n * @example\n * ```ts\n * highlight('Hello World', [[0, 5]]);\n * // [{ text: 'Hello', highlighted: true }, { text: ' World', highlighted: false }]\n *\n * highlight('Hello World', [[0, 5], [6, 11]]);\n * // [\n * // { text: 'Hello', highlighted: true },\n * // { text: ' ', highlighted: false },\n * // { text: 'World', highlighted: true },\n * // ]\n * ```\n *\n * @param text - The original field value to split.\n * @param ranges - Sorted, non-overlapping `[start, end]` ranges from `FieldMatch.ranges`.\n * @returns An array of `HighlightPart` objects. Returns an empty array for an empty `text`.\n */\nexport function highlight(text: string, ranges: [number, number][]): HighlightPart[] {\n if (!text) return [];\n\n if (!ranges.length) return [{ highlighted: false, text }];\n\n const parts: HighlightPart[] = [];\n let cursor = 0;\n\n for (const [start, end] of ranges) {\n if (start > cursor) {\n parts.push({ highlighted: false, text: text.slice(cursor, start) });\n }\n\n if (end > start) {\n parts.push({ highlighted: true, text: text.slice(start, end) });\n }\n\n cursor = end;\n }\n\n if (cursor < text.length) {\n parts.push({ highlighted: false, text: text.slice(cursor) });\n }\n\n return parts;\n}\n\n/**\n * Finds the match ranges for `field` in `result` and splits `text` into\n * highlighted and unhighlighted fragments in one step.\n *\n * This is the ergonomic shorthand for the common pattern:\n * ```ts\n * const match = result.matches.find(m => m.field === 'name');\n * const parts = highlight(item.name, match?.ranges ?? []);\n * ```\n *\n * @example\n * ```ts\n * for (const result of index.search('alice')) {\n * const parts = highlightField(result, 'name', result.item.name);\n * console.log(parts.map(p => p.highlighted ? `[${p.text}]` : p.text).join(''));\n * }\n * ```\n *\n * @param result - A `SearchResult` from `ScoutIndex.search()`.\n * @param field - The field name to look up in `result.matches`.\n * @param text - The original field value string to split.\n * @returns An array of `HighlightPart` objects.\n */\nexport function highlightField<T>(result: SearchResult<T>, field: keyof T & string, text: string): HighlightPart[] {\n const match = result.matches.find((m) => m.field === field);\n\n return highlight(text, match?.ranges ?? []);\n}\n","//#region src/errors.ts\nvar e = class extends Error {\n\tconstructor(e, t) {\n\t\tsuper(e, t), this.name = new.target.name, Object.setPrototypeOf(this, new.target.prototype);\n\t}\n}, t = class extends e {}, n = class extends e {}, r = class extends e {}, i = class extends e {};\n//#endregion\nexport { t as RippleComputedCycleError, n as RippleDisposedRuntimeError, r as RippleDisposedScopeError, e as RippleError, i as RippleInfiniteLoopError };\n\n//# sourceMappingURL=errors.js.map","import { RippleComputedCycleError as e, RippleDisposedRuntimeError as t, RippleDisposedScopeError as n, RippleInfiniteLoopError as r } from \"./errors.js\";\n//#region src/runtime.ts\nvar i = Symbol.for(\"@vielzeug/ripple/reactive\"), a = 100, o = Symbol(\"ripple.unset\"), s = class {\n\t[i] = !0;\n\tdependents = /* @__PURE__ */ new Set();\n\tname;\n\truntime;\n\tconstructor(e, t) {\n\t\tthis.runtime = e, this.name = t;\n\t}\n\tsubscribe(e) {\n\t\tthis.runtime.assertActive(), this.peek();\n\t\tlet t = {\n\t\t\tdependencies: /* @__PURE__ */ new Set(),\n\t\t\tonDependencyChanged: () => this.runtime.enqueueListener(e)\n\t\t};\n\t\treturn this.dependents.add(t), () => this.dependents.delete(t);\n\t}\n\tnotify() {\n\t\tfor (let e of [...this.dependents]) e.onDependencyChanged();\n\t}\n}, c = class extends s {\n\tcurrent;\n\tequals;\n\tconstructor(e, t, n) {\n\t\tsuper(e, n?.name), this.current = t, this.equals = n?.equals ?? Object.is;\n\t}\n\tget value() {\n\t\treturn this.runtime.track(this), this.current;\n\t}\n\tset value(e) {\n\t\tif (this.runtime.assertActive(), this.equals(this.current, e)) return;\n\t\tlet t = this.current;\n\t\tthis.current = e, this.runtime.emit({\n\t\t\tkind: \"write\",\n\t\t\tname: this.name,\n\t\t\tnext: e,\n\t\t\tprevious: t\n\t\t}), this.runtime.propagate(() => this.notify());\n\t}\n\tpeek() {\n\t\treturn this.current;\n\t}\n\tupdate(e) {\n\t\tthis.value = e(this.current);\n\t}\n}, l = class extends s {\n\tdependencies = /* @__PURE__ */ new Set();\n\tcomputing = !1;\n\tdisposed = !1;\n\tdirty = !0;\n\tcurrent = o;\n\tderive;\n\tequals;\n\tconstructor(e, t, n) {\n\t\tsuper(e, n?.name), this.derive = t, this.equals = n?.equals ?? Object.is;\n\t}\n\tget value() {\n\t\treturn this.runtime.track(this), this.refresh(), this.current;\n\t}\n\tpeek() {\n\t\treturn this.refresh(), this.current;\n\t}\n\tonDependencyChanged() {\n\t\tthis.disposed || (this.dirty ||= !0, this.dependents.size > 0 && this.refresh() && this.notify());\n\t}\n\tdispose() {\n\t\tthis.disposed || (this.disposed = !0, this.runtime.clearDependencies(this), this.dependents.clear());\n\t}\n\trefresh() {\n\t\tif (!this.dirty || this.disposed) return !1;\n\t\tif (this.computing) {\n\t\t\tlet t = this.name === void 0 ? \"\" : ` \"${this.name}\"`;\n\t\t\tthrow new e(`computed cycle detected${t}`);\n\t\t}\n\t\tthis.computing = !0, this.runtime.emit({\n\t\t\tkind: \"compute\",\n\t\t\tname: this.name\n\t\t});\n\t\ttry {\n\t\t\tlet e = this.runtime.collect(this, this.derive), t = this.current === o || !this.equals(this.current, e);\n\t\t\treturn this.current = e, this.dirty = !1, t;\n\t\t} finally {\n\t\t\tthis.computing = !1;\n\t\t}\n\t}\n}, u = class {\n\tdisposalController = new AbortController();\n\towned = /* @__PURE__ */ new Set();\n\tname;\n\tisDisposed = !1;\n\truntime;\n\tconstructor(e, t) {\n\t\tthis.runtime = e, this.name = t;\n\t}\n\tget disposed() {\n\t\treturn this.isDisposed;\n\t}\n\tget disposalSignal() {\n\t\treturn this.disposalController.signal;\n\t}\n\trun(e) {\n\t\tif (this.isDisposed) throw new n(\"Cannot run a disposed scope.\");\n\t\treturn this.runtime.withScope(this, e);\n\t}\n\tdispose() {\n\t\tif (!this.isDisposed) {\n\t\t\tthis.isDisposed = !0;\n\t\t\tfor (let e of [...this.owned].reverse()) e.dispose();\n\t\t\tthis.owned.clear(), this.disposalController.abort(), this.runtime.emit({\n\t\t\t\tkind: \"dispose\",\n\t\t\t\tname: this.name,\n\t\t\t\tnode: \"scope\"\n\t\t\t});\n\t\t}\n\t}\n\t[Symbol.dispose]() {\n\t\tthis.dispose();\n\t}\n}, d = class {\n\tdependencies = /* @__PURE__ */ new Set();\n\tdisposalController = new AbortController();\n\tcleanup;\n\tisDisposed = !1;\n\towner;\n\tscheduled = !1;\n\tcallback;\n\toptions;\n\truntime;\n\tconstructor(e, t, n) {\n\t\tthis.runtime = e, this.callback = t, this.options = n;\n\t}\n\tget disposed() {\n\t\treturn this.isDisposed;\n\t}\n\tget disposalSignal() {\n\t\treturn this.disposalController.signal;\n\t}\n\tonDependencyChanged() {\n\t\tif (!this.isDisposed) {\n\t\t\tif (this.options?.scheduler === \"microtask\") {\n\t\t\t\tif (this.scheduled) return;\n\t\t\t\tthis.scheduled = !0, queueMicrotask(() => {\n\t\t\t\t\tthis.scheduled = !1, this.isDisposed || this.runtime.enqueue(this);\n\t\t\t\t});\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.runtime.enqueue(this);\n\t\t}\n\t}\n\trun() {\n\t\tif (this.isDisposed) return;\n\t\tthis.owner?.dispose(), this.owner = void 0, this.runCleanup(), this.runtime.emit({\n\t\t\tkind: \"effect\",\n\t\t\tname: this.options?.name\n\t\t});\n\t\tlet e = new u(this.runtime);\n\t\ttry {\n\t\t\tlet t = this.runtime.withEffectScope(e, () => this.runtime.collectEffect(this, this.callback));\n\t\t\tthis.owner = e, this.cleanup = typeof t == \"function\" ? t : void 0;\n\t\t} catch (t) {\n\t\t\te.dispose(), this.runtime.report(t, {\n\t\t\t\tkind: \"effect\",\n\t\t\t\tname: this.options?.name\n\t\t\t});\n\t\t}\n\t}\n\tdispose() {\n\t\tthis.isDisposed || (this.isDisposed = !0, this.owner?.dispose(), this.owner = void 0, this.runtime.clearDependencies(this), this.runCleanup(), this.disposalController.abort(), this.runtime.emit({\n\t\t\tkind: \"dispose\",\n\t\t\tname: this.options?.name,\n\t\t\tnode: \"effect\"\n\t\t}));\n\t}\n\t[Symbol.dispose]() {\n\t\tthis.dispose();\n\t}\n\trunCleanup() {\n\t\tlet e = this.cleanup;\n\t\tif (this.cleanup = void 0, e !== void 0) try {\n\t\t\te();\n\t\t} catch (e) {\n\t\t\tthis.runtime.report(e, {\n\t\t\t\tkind: \"cleanup\",\n\t\t\t\tname: this.options?.name\n\t\t\t});\n\t\t}\n\t}\n}, f = class {\n\tactiveEffectScope;\n\tactiveObserver;\n\tactiveScope;\n\tisDisposed = !1;\n\tflushDepth = 0;\n\tflushing = !1;\n\tpending = /* @__PURE__ */ new Set();\n\tlisteners = /* @__PURE__ */ new Set();\n\trootScope;\n\tobserver;\n\tonError;\n\tconstructor(e) {\n\t\tthis.observer = e?.observer, this.onError = e?.onError ?? ((e) => {\n\t\t\tqueueMicrotask(() => {\n\t\t\t\tthrow e;\n\t\t\t});\n\t\t}), this.rootScope = new u(this, \"runtime\"), this.activeScope = this.rootScope;\n\t}\n\tget disposed() {\n\t\treturn this.isDisposed;\n\t}\n\tsignal = (e, t) => (this.assertActive(), new c(this, e, t));\n\tcomputed = (e, t) => {\n\t\tthis.assertActive();\n\t\tlet n = new l(this, e, t);\n\t\treturn (this.activeEffectScope ?? this.activeScope).owned.add(n), n;\n\t};\n\teffect = (e, t) => {\n\t\tthis.assertActive();\n\t\tlet n = new d(this, e, t);\n\t\treturn (this.activeEffectScope ?? this.activeScope).owned.add(n), n.run(), n;\n\t};\n\tcreateScope = (e) => {\n\t\tthis.assertActive();\n\t\tlet t = new u(this, e);\n\t\treturn this.activeScope.owned.add(t), t;\n\t};\n\tbatch = (e) => (this.assertActive(), this.propagate(e));\n\tuntrack = (e) => (this.assertActive(), this.withObserver(void 0, e));\n\tdispose() {\n\t\tthis.isDisposed || (this.isDisposed = !0, this.rootScope.dispose());\n\t}\n\tassertActive() {\n\t\tif (this.isDisposed) throw new t(\"Cannot use a disposed Ripple runtime.\");\n\t}\n\ttrack(e) {\n\t\tlet t = this.activeObserver;\n\t\tt?.collecting !== void 0 && t.collecting.add(e);\n\t}\n\tclearDependencies(e) {\n\t\tfor (let t of e.dependencies) t.dependents.delete(e);\n\t\te.dependencies.clear();\n\t}\n\tcollect(e, t) {\n\t\treturn this.collectWith(e, t, e.dependencies.size === 0);\n\t}\n\tcollectEffect(e, t) {\n\t\treturn this.collectWith(e, t, !0);\n\t}\n\twithEffectScope(e, t) {\n\t\tlet n = this.activeEffectScope;\n\t\tthis.activeEffectScope = e;\n\t\ttry {\n\t\t\treturn t();\n\t\t} finally {\n\t\t\tthis.activeEffectScope = n;\n\t\t}\n\t}\n\twithObserver(e, t) {\n\t\tlet n = this.activeObserver;\n\t\tthis.activeObserver = e;\n\t\ttry {\n\t\t\treturn t();\n\t\t} finally {\n\t\t\tthis.activeObserver = n;\n\t\t}\n\t}\n\twithScope(e, t) {\n\t\tlet n = this.activeEffectScope, r = this.activeScope;\n\t\tthis.activeEffectScope = void 0, this.activeScope = e;\n\t\ttry {\n\t\t\treturn t();\n\t\t} finally {\n\t\t\tthis.activeEffectScope = n, this.activeScope = r;\n\t\t}\n\t}\n\tenqueue(e) {\n\t\tthis.pending.add(e), this.flushDepth === 0 && this.flush();\n\t}\n\tenqueueListener(e) {\n\t\tthis.listeners.add(e), this.flushDepth === 0 && this.flush();\n\t}\n\tpropagate(e) {\n\t\tthis.flushDepth++;\n\t\ttry {\n\t\t\treturn e();\n\t\t} finally {\n\t\t\tthis.flushDepth--, this.flushDepth === 0 && this.flush();\n\t\t}\n\t}\n\temit(e) {\n\t\ttry {\n\t\t\tthis.observer?.(e);\n\t\t} catch (t) {\n\t\t\tthis.report(t, {\n\t\t\t\tkind: \"observer\",\n\t\t\t\tname: e.name\n\t\t\t});\n\t\t}\n\t}\n\treport(e, t) {\n\t\ttry {\n\t\t\tthis.onError(e, t);\n\t\t} catch (e) {\n\t\t\tqueueMicrotask(() => {\n\t\t\t\tthrow e;\n\t\t\t});\n\t\t}\n\t}\n\tcollectWith(e, t, n) {\n\t\tlet r = this.activeObserver, i = /* @__PURE__ */ new Set();\n\t\te.collecting = i, this.activeObserver = e;\n\t\ttry {\n\t\t\tlet n = t();\n\t\t\treturn this.commitDependencies(e, i), n;\n\t\t} catch (t) {\n\t\t\tthrow n && this.commitDependencies(e, i), t;\n\t\t} finally {\n\t\t\te.collecting = void 0, this.activeObserver = r;\n\t\t}\n\t}\n\tcommitDependencies(e, t) {\n\t\tfor (let n of e.dependencies) t.has(n) || n.dependents.delete(e);\n\t\tfor (let n of t) e.dependencies.has(n) || n.dependents.add(e);\n\t\te.dependencies.clear();\n\t\tfor (let n of t) e.dependencies.add(n);\n\t}\n\tflush() {\n\t\tif (this.flushing) return;\n\t\tthis.flushing = !0;\n\t\tlet e = 0;\n\t\ttry {\n\t\t\tfor (; this.pending.size > 0 || this.listeners.size > 0;) {\n\t\t\t\tif (++e > a) throw new r(`infinite reactive flush (>${a} iterations)`);\n\t\t\t\tlet t = [...this.pending], n = [...this.listeners];\n\t\t\t\tthis.pending.clear(), this.listeners.clear();\n\t\t\t\tfor (let e of t) e.run();\n\t\t\t\tfor (let e of n) try {\n\t\t\t\t\te();\n\t\t\t\t} catch (e) {\n\t\t\t\t\tthis.report(e, { kind: \"listener\" });\n\t\t\t\t}\n\t\t\t}\n\t\t} finally {\n\t\t\tthis.flushing = !1;\n\t\t}\n\t}\n}, p = (e) => {\n\tif (typeof e != \"object\" || !e || !(i in e)) return !1;\n\tlet t = e;\n\treturn typeof t.peek == \"function\" && typeof t.subscribe == \"function\";\n};\n//#endregion\nexport { i as REACTIVE, f as ReactiveRuntime, p as isReactive };\n\n//# sourceMappingURL=runtime.js.map","import { REACTIVE as e } from \"./runtime.js\";\n//#region src/_async.ts\nvar t = (t) => (n, r, i) => {\n\tlet a = t.signal({ status: \"pending\" }, { name: i?.name }), o = t.signal(0), s, c = !1, l = () => {\n\t\to.value, s?.abort();\n\t\tlet e = a.peek(), t = e.status === \"success\" ? e.value : \"previous\" in e ? e.previous : void 0, i;\n\t\ttry {\n\t\t\ti = n();\n\t\t} catch (e) {\n\t\t\ta.value = t === void 0 ? {\n\t\t\t\terror: e,\n\t\t\t\tstatus: \"error\"\n\t\t\t} : {\n\t\t\t\terror: e,\n\t\t\t\tprevious: t,\n\t\t\t\tstatus: \"error\"\n\t\t\t};\n\t\t\treturn;\n\t\t}\n\t\tlet l = new AbortController();\n\t\ts = l, a.value = t === void 0 ? { status: \"pending\" } : {\n\t\t\tprevious: t,\n\t\t\tstatus: \"pending\"\n\t\t};\n\t\tlet u;\n\t\ttry {\n\t\t\tu = Promise.resolve(r(i, { signal: l.signal }));\n\t\t} catch (e) {\n\t\t\tu = Promise.reject(e);\n\t\t}\n\t\tu.then((e) => {\n\t\t\t!c && !l.signal.aborted && (a.value = {\n\t\t\t\tstatus: \"success\",\n\t\t\t\tvalue: e\n\t\t\t});\n\t\t}, (e) => {\n\t\t\t!c && !l.signal.aborted && (a.value = t === void 0 ? {\n\t\t\t\terror: e,\n\t\t\t\tstatus: \"error\"\n\t\t\t} : {\n\t\t\t\terror: e,\n\t\t\t\tprevious: t,\n\t\t\t\tstatus: \"error\"\n\t\t\t});\n\t\t});\n\t}, u = t.effect(() => (l(), () => s?.abort()), { name: i?.name });\n\tu.disposalSignal.addEventListener(\"abort\", () => {\n\t\tc = !0;\n\t}, { once: !0 });\n\tlet d = {\n\t\tget disposalSignal() {\n\t\t\treturn u.disposalSignal;\n\t\t},\n\t\tdispose: () => u.dispose(),\n\t\tget disposed() {\n\t\t\treturn c;\n\t\t},\n\t\tget name() {\n\t\t\treturn a.name;\n\t\t},\n\t\tpeek: () => a.peek(),\n\t\treload: () => {\n\t\t\tc || (o.value = o.peek() + 1);\n\t\t},\n\t\tsubscribe: (e) => a.subscribe(e),\n\t\t[Symbol.dispose]() {\n\t\t\tthis.dispose();\n\t\t},\n\t\tget value() {\n\t\t\treturn a.value;\n\t\t}\n\t};\n\treturn Object.defineProperty(d, e, { value: !0 }), d;\n};\n//#endregion\nexport { t as createResource };\n\n//# sourceMappingURL=_async.js.map","//#region src/_watch.ts\nvar e = (e) => (t, n, r) => {\n\tlet i = typeof t == \"function\" ? t : () => t.value, a = r?.equals ?? Object.is, o = !0, s, c = !1, l = e.effect(() => {\n\t\tlet e = i();\n\t\tif (o) {\n\t\t\to = !1, s = e, r?.immediate && (n(e, void 0), r?.once && (c = !0));\n\t\t\treturn;\n\t\t}\n\t\tif (a(s, e)) return;\n\t\tlet t = s;\n\t\ts = e, n(e, t), r?.once && l.dispose();\n\t}, { name: r?.name });\n\treturn c && l.dispose(), l;\n};\n//#endregion\nexport { e as createWatch };\n\n//# sourceMappingURL=_watch.js.map","import { ReactiveRuntime as e } from \"./runtime.js\";\nimport { createResource as t } from \"./_async.js\";\nimport { createWatch as n } from \"./_watch.js\";\n//#region src/_default.ts\nvar r = (r) => {\n\tlet i = new e(r), a = t(i);\n\treturn {\n\t\tbatch: i.batch,\n\t\tcomputed: i.computed,\n\t\tcreateScope: i.createScope,\n\t\tdispose: () => i.dispose(),\n\t\tget disposed() {\n\t\t\treturn i.disposed;\n\t\t},\n\t\teffect: i.effect,\n\t\tresource: a,\n\t\tsignal: i.signal,\n\t\tuntrack: i.untrack,\n\t\twatch: n(i)\n\t};\n}, i = r();\n//#endregion\nexport { r as createRipple, i as defaultRipple };\n\n//# sourceMappingURL=_default.js.map","import { RippleComputedCycleError as e, RippleDisposedRuntimeError as t, RippleDisposedScopeError as n, RippleError as r, RippleInfiniteLoopError as i } from \"./errors.js\";\nimport { isReactive as a } from \"./runtime.js\";\nimport { createRipple as o, defaultRipple as s } from \"./_default.js\";\n//#region src/index.ts\nvar c = s.signal, l = s.computed, u = s.effect, d = s.batch, f = s.createScope, p = s.untrack, m = s.watch, h = s.resource;\n//#endregion\nexport { e as RippleComputedCycleError, t as RippleDisposedRuntimeError, n as RippleDisposedScopeError, r as RippleError, i as RippleInfiniteLoopError, d as batch, l as computed, o as createRipple, f as createScope, u as effect, a as isReactive, h as resource, c as signal, p as untrack, m as watch };\n\n//# sourceMappingURL=index.js.map","/**\n * Generates padded trigrams from a pre-normalized (lowercased, trimmed) string.\n *\n * The string is padded with a single leading and trailing space so that prefix\n * and suffix characters form complete trigrams.\n *\n * @example\n * `\"hello\"` → `{ \" he\", \"hel\", \"ell\", \"llo\", \"lo \" }`\n *\n * @internal\n */\nexport function generateTrigrams(text: string): Set<string> {\n const trigrams = new Set<string>();\n const padded = ` ${text} `;\n\n for (let i = 0; i < padded.length - 2; i++) {\n trigrams.add(padded.slice(i, i + 3));\n }\n\n return trigrams;\n}\n\n/**\n * Computes the Szymkiewicz–Simpson overlap coefficient between two trigram sets.\n * Returns `0` when either set is empty; `1` when the smaller set is fully contained in the\n * larger one (including when the sets are identical).\n *\n * Formula: `|A ∩ B| / min(|A|, |B|)`\n *\n * Deliberately *not* the more common Sørensen–Dice coefficient (`2·|A∩B| / (|A|+|B|)`): Dice's\n * denominator grows with the *combined* size of both sets, so a short query fully contained in a\n * much longer target field is unfairly penalized purely for the target's length — e.g. querying\n * `\"fin\"` against a field containing `\"finalize project budget\"` shares 2 of the query's 3\n * trigrams under Dice (`2·2/(3+~24) ≈ 0.15`, likely below a typical `0.2` threshold) even though\n * the query is a clean prefix match. The overlap coefficient instead asks \"what fraction of the\n * *smaller* set (almost always the query, for autocomplete/command-palette use) was found?\" —\n * the same example scores `2/min(3,~24) ≈ 0.67`. Overlap is always `>= Dice` for the same inputs\n * (by the AM ≥ min inequality), so this can only ever include *more* legitimate matches, never\n * fewer, than the previous Dice-based scoring.\n *\n * A single shared trigram is treated as `0` (no match), not folded into the ratio above — for\n * any query of 4+ characters (the overwhelmingly common case: `generateTrigrams` yields\n * `length + 1` trigrams once padded), one incidental boundary trigram already clears the\n * `min(|A|,|B|) `-based ratio far enough to pass the library's own default `threshold` (`0.2`,\n * `1/4`), regardless of how unrelated the two strings actually are — e.g. `\"x300\"` and `\"a200\"`\n * share nothing but the trailing `\"00 \"` boundary trigram (both end in a round hundred) yet\n * would otherwise score `0.25`. A real fuzzy/typo match almost always shares *several*\n * consecutive trigrams, not one; requiring `>= 2` (or a full match, for the rare query short\n * enough to normalize to a single trigram) filters out this class of false positive without\n * weakening genuine partial matches — see `scout-index.ts`'s `search()` tests for both cases.\n *\n * @internal\n */\nexport function overlapSimilarity(a: Set<string>, b: Set<string>): number {\n if (a.size === 0 || b.size === 0) return 0;\n\n let shared = 0;\n\n for (const trigram of a) {\n if (b.has(trigram)) shared++;\n }\n\n if (shared < 2 && shared < a.size) return 0;\n\n return shared / Math.min(a.size, b.size);\n}\n","import { ScoutConfigurationError } from './errors';\nimport { findMatchRanges } from './highlight';\nimport { defaultStringify, tokenize } from './tokenize';\nimport { generateTrigrams, overlapSimilarity } from './trigram';\nimport type { FieldDef, FieldMatch, ScoutIndexOptions, SearchConstraints, SearchResult } from './types';\n\ntype FieldConfig<T> = {\n field: keyof T & string;\n stringify: (v: unknown) => string;\n weight: number;\n};\n\ntype ItemRecord = {\n /** Per-field trigrams for scoring. */\n trigrams: Map<string, Set<string>>;\n /** Per-field original text for highlighting. */\n values: Map<string, string>;\n};\n\n/**\n * A stateful, indexed search corpus. Created via `createIndex()`.\n *\n * Supports incremental `add()`, `remove()`, and `reindex()` operations — each patches\n * the trigram index in O(field_length) without a full rebuild.\n */\nexport interface ScoutIndex<T> {\n /** Adds `item` to the index. No-op if the item is already indexed (by reference). */\n add(item: T): void;\n /** All items currently in the index, in insertion order. */\n readonly items: readonly T[];\n /**\n * Subscribes `listener` to be called after every changed `add()` / `remove()` / `reindex()`\n * / `setItems()` operation. No-ops — e.g. removing an unindexed item or reconciling an\n * unchanged corpus — do not fire it. Each changed `setItems()` reconciliation fires once.\n * Returns an unsubscribe function.\n *\n * Framework-agnostic extension point: `createSearch()` uses this internally to keep\n * reactive `results` in sync with index mutations. Most callers won't need this directly.\n */\n onMutate(listener: () => void): () => void;\n /**\n * Re-reads the item's current field values and rebuilds its index entry in-place,\n * only updating fields whose values have changed. Preserves insertion order.\n * No-op if the item is not in the index.\n */\n reindex(item: T): void;\n /**\n * Removes `item` from the index by reference equality.\n * No-op if the item is not in the index.\n */\n remove(item: T): void;\n /**\n * Monotonically increasing counter, incremented after every changed `add()` / `remove()` /\n * `reindex()` / `setItems()` operation. Use as a cache-busting token when caching search\n * results outside the index — `toSearchMatcher()` uses it for this purpose.\n */\n readonly revision: number;\n /**\n * Searches the index for `query` and returns results sorted by score descending.\n *\n * An empty (or whitespace-only) `query` returns all indexed items with `score = 1`.\n * A `query` with no indexable content after normalization (e.g. punctuation-only) returns\n * no results. Results below `threshold` are excluded. At most `limit` results are returned.\n */\n search(query: string, options?: SearchConstraints): SearchResult<T>[];\n /**\n * Reconciles the index to `items` by reference identity. Retained items are reindexed,\n * new items are added, missing items are removed, and one mutation notification fires\n * when indexed corpus or field values change. Duplicate references collapse to one item.\n */\n setItems(items: readonly T[]): void;\n /** Number of items currently in the index. */\n readonly size: number;\n}\n\nfunction requireFiniteInteger(value: number, name: string, minimum: number): number {\n if (!Number.isFinite(value) || !Number.isInteger(value) || value < minimum) {\n throw new ScoutConfigurationError(`${name} must be a finite integer greater than or equal to ${minimum}.`);\n }\n\n return value;\n}\n\nfunction requireFiniteNumber(value: number, name: string, minimum: number, maximum = Number.POSITIVE_INFINITY): number {\n if (!Number.isFinite(value) || value < minimum || value > maximum) {\n throw new ScoutConfigurationError(`${name} must be a finite number between ${minimum} and ${maximum}.`);\n }\n\n return value;\n}\n\nfunction resolveFields<T>(defs: ReadonlyArray<FieldDef<T>>): FieldConfig<T>[] {\n return defs.map((def) => {\n if (typeof def === 'string') {\n return { field: def, stringify: defaultStringify, weight: 1 };\n }\n\n return {\n field: def.field,\n stringify: def.stringify ?? defaultStringify,\n weight: requireFiniteNumber(def.weight ?? 1, `weight for field \"${def.field}\"`, Number.MIN_VALUE),\n };\n });\n}\n\n/**\n * Builds a trigram inverted index over `items` for fast fuzzy search.\n *\n * Construction is O(corpus × field_length). Subsequent `search()` calls are\n * O(candidates) — far faster than per-query Levenshtein for large corpora.\n *\n * @example\n * ```ts\n * const index = createIndex(users, {\n * fields: [{ field: 'name', weight: 2 }, 'email'],\n * threshold: 0.3,\n * limit: 20,\n * });\n *\n * const results = index.search('alice');\n * ```\n *\n * @throws {ScoutConfigurationError} If options use an invalid field or numeric configuration.\n */\nexport function createIndex<T>(items: T[], options: ScoutIndexOptions<T>): ScoutIndex<T> {\n if (options.fields.length === 0) {\n throw new ScoutConfigurationError('createIndex: at least one field is required.');\n }\n\n const fields = resolveFields(options.fields);\n const maxWeight = fields.reduce((max, f) => Math.max(max, f.weight), 1);\n const defaultThreshold = requireFiniteNumber(options.threshold ?? 0.2, 'threshold', 0, 1);\n const defaultLimit = requireFiniteInteger(options.limit ?? 50, 'limit', 0);\n const defaultMinQueryLength = requireFiniteInteger(options.minQueryLength ?? 3, 'minQueryLength', 1);\n\n /** item → per-item record, preserves insertion order for `items` getter */\n const itemData = new Map<T, ItemRecord>();\n /** trigram → set of items that contain it */\n const invertedIndex = new Map<string, Set<T>>();\n const mutationListeners = new Set<() => void>();\n let revision = 0;\n\n function notifyMutation(): void {\n revision++;\n\n for (const listener of mutationListeners) listener();\n }\n\n /** Single-entry cache for the most recent normalized query's trigrams (F2). */\n let cachedNormalized: string | null = null;\n let cachedTrigrams: Set<string> | null = null;\n\n function getQueryTrigrams(normalized: string): Set<string> {\n if (normalized === cachedNormalized && cachedTrigrams !== null) return cachedTrigrams;\n\n cachedNormalized = normalized;\n cachedTrigrams = generateTrigrams(normalized);\n\n return cachedTrigrams;\n }\n\n function addFieldToIndex(item: T, fieldTrigrams: Set<string>): void {\n for (const trigram of fieldTrigrams) {\n let bucket = invertedIndex.get(trigram);\n\n if (!bucket) {\n bucket = new Set<T>();\n invertedIndex.set(trigram, bucket);\n }\n\n bucket.add(item);\n }\n }\n\n function removeFieldFromIndex(item: T, fieldTrigrams: Set<string>): void {\n for (const trigram of fieldTrigrams) {\n const bucket = invertedIndex.get(trigram);\n\n if (bucket) {\n bucket.delete(item);\n\n if (bucket.size === 0) invertedIndex.delete(trigram);\n }\n }\n }\n\n function addItem(item: T): void {\n const trigrams = new Map<string, Set<string>>();\n const values = new Map<string, string>();\n\n for (const { field, stringify } of fields) {\n const raw = item[field];\n const text = stringify(raw);\n const normalized = tokenize(text);\n const fieldTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n trigrams.set(field, fieldTrigrams);\n values.set(field, text);\n addFieldToIndex(item, fieldTrigrams);\n }\n\n itemData.set(item, { trigrams, values });\n }\n\n /**\n * Performs a full linear scan over all items for short queries.\n * O(n × field_count) — acceptable for small corpora; consider raising\n * `minQueryLength` on large datasets to avoid triggering this path.\n */\n function containmentScan(query: string): Set<T> {\n const result = new Set<T>();\n\n for (const [item, record] of itemData) {\n for (const value of record.values.values()) {\n if (value.toLowerCase().includes(query)) {\n result.add(item);\n break;\n }\n }\n }\n\n return result;\n }\n\n function trigramCandidates(queryTrigrams: Set<string>): Set<T> {\n const candidates = new Set<T>();\n\n for (const trigram of queryTrigrams) {\n const items = invertedIndex.get(trigram);\n\n if (items) {\n for (const item of items) candidates.add(item);\n }\n }\n\n return candidates;\n }\n\n function scoreCandidate(normalized: string, queryTrigrams: Set<string> | null, record: ItemRecord): number {\n let bestScore = 0;\n\n for (const { field, weight } of fields) {\n let fieldScore: number;\n\n if (queryTrigrams === null) {\n const raw = record.values.get(field) ?? '';\n\n fieldScore = raw.toLowerCase().includes(normalized) ? 1.0 : 0;\n } else {\n const itemTrigrams = record.trigrams.get(field);\n\n if (!itemTrigrams || itemTrigrams.size === 0) continue;\n\n fieldScore = overlapSimilarity(queryTrigrams, itemTrigrams);\n }\n\n const weighted = fieldScore * (weight / maxWeight);\n\n if (weighted > bestScore) bestScore = weighted;\n }\n\n return bestScore;\n }\n\n function computeMatches(query: string, values: Map<string, string>): FieldMatch<keyof T & string>[] {\n const matches: FieldMatch<keyof T & string>[] = [];\n\n for (const { field } of fields) {\n const text = values.get(field);\n\n if (!text) continue;\n\n const ranges = findMatchRanges(text, query);\n\n if (ranges.length > 0) matches.push({ field, ranges });\n }\n\n return matches;\n }\n\n function reindexItem(item: T): boolean {\n const record = itemData.get(item);\n\n if (!record) return false;\n\n let changed = false;\n\n for (const { field, stringify } of fields) {\n const newText = stringify(item[field]);\n const oldText = record.values.get(field);\n\n if (newText === oldText) continue;\n\n changed = true;\n\n const oldTrigrams = record.trigrams.get(field);\n\n if (oldTrigrams) removeFieldFromIndex(item, oldTrigrams);\n\n const normalized = tokenize(newText);\n const newTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n record.trigrams.set(field, newTrigrams);\n record.values.set(field, newText);\n addFieldToIndex(item, newTrigrams);\n }\n\n return changed;\n }\n\n function removeItem(item: T): boolean {\n const record = itemData.get(item);\n\n if (!record) return false;\n\n for (const fieldTrigrams of record.trigrams.values()) {\n removeFieldFromIndex(item, fieldTrigrams);\n }\n\n itemData.delete(item);\n\n return true;\n }\n\n for (const item of items) {\n if (!itemData.has(item)) addItem(item);\n }\n\n const index: ScoutIndex<T> = {\n add(item: T): void {\n if (itemData.has(item)) return;\n\n addItem(item);\n notifyMutation();\n },\n\n get items(): readonly T[] {\n return [...itemData.keys()];\n },\n\n onMutate(listener: () => void): () => void {\n mutationListeners.add(listener);\n\n return () => {\n mutationListeners.delete(listener);\n };\n },\n\n reindex(item: T): void {\n if (reindexItem(item)) notifyMutation();\n },\n\n remove(item: T): void {\n if (removeItem(item)) notifyMutation();\n },\n\n get revision(): number {\n return revision;\n },\n\n search(query: string, options?: SearchConstraints): SearchResult<T>[] {\n const threshold = requireFiniteNumber(options?.threshold ?? defaultThreshold, 'threshold', 0, 1);\n const limit = requireFiniteInteger(options?.limit ?? defaultLimit, 'limit', 0);\n const minQueryLength = requireFiniteInteger(\n options?.minQueryLength ?? defaultMinQueryLength,\n 'minQueryLength',\n 1,\n );\n\n if (!query.trim()) {\n return [...itemData.keys()].slice(0, limit).map((item) => ({ item, matches: [], score: 1 }));\n }\n\n const normalized = tokenize(query);\n\n // Query had no indexable content (e.g. punctuation-only) — no match, not \"match all\".\n if (!normalized) return [];\n\n const isShort = normalized.length < minQueryLength;\n const queryTrigrams = isShort ? null : getQueryTrigrams(normalized);\n const candidates = queryTrigrams === null ? containmentScan(normalized) : trigramCandidates(queryTrigrams);\n const results: SearchResult<T>[] = [];\n\n for (const item of candidates) {\n const record = itemData.get(item);\n\n if (!record) continue;\n\n const score = scoreCandidate(normalized, queryTrigrams, record);\n\n if (score >= threshold) {\n const matches = computeMatches(normalized, record.values);\n\n results.push({ item, matches, score });\n }\n }\n\n return results.sort((a, b) => b.score - a.score).slice(0, limit);\n },\n\n setItems(items: readonly T[]): void {\n const incoming = new Set(items);\n const next = [...incoming];\n let changed = false;\n\n for (const item of [...itemData.keys()]) {\n if (incoming.has(item)) continue;\n\n removeItem(item);\n changed = true;\n }\n\n for (const item of next) {\n if (!itemData.has(item)) {\n addItem(item);\n changed = true;\n } else if (reindexItem(item)) {\n changed = true;\n }\n }\n\n const current = [...itemData.keys()];\n const orderChanged = current.length !== next.length || current.some((item, index) => item !== next[index]);\n\n if (orderChanged) {\n const records = new Map(next.map((item) => [item, itemData.get(item)!]));\n\n itemData.clear();\n\n for (const [item, record] of records) itemData.set(item, record);\n\n changed = true;\n }\n\n if (changed) notifyMutation();\n },\n\n get size(): number {\n return itemData.size;\n },\n };\n\n return index;\n}\n","import { batch, computed, signal } from '@vielzeug/ripple';\nimport { ScoutConfigurationError, ScoutDisposedError } from './errors';\nimport { createIndex, type ScoutIndex } from './scout-index';\nimport type { CreateSearchOptions, ScoutIndexOptions, SearchResult, SearchState } from './types';\n\n/**\n * Combined index + reactive search state returned by `createReactiveSearch()`.\n * Exposes the underlying `ScoutIndex` for incremental mutations (`add`, `remove`, `reindex`).\n */\nexport type ReactiveSearch<T> = SearchState<T> & {\n readonly index: ScoutIndex<T>;\n};\n\nconst DEFAULT_DEBOUNCE = 200;\n\n/**\n * Creates a reactive search state backed by a `ScoutIndex`.\n *\n * - Set `state.query.value` to trigger a (debounced) search.\n * - Read `state.results.value` inside an `effect` or `computed` to consume results reactively.\n * - `state.isSearching.value` is `true` while debouncing, `false` otherwise.\n * - Call `state.dispose()` (or `using state = createSearch(...)`) to release subscriptions.\n *\n * @example\n * ```ts\n * const index = createIndex(users, { fields: ['name', 'email'] });\n * const search = createSearch(index, { debounce: 150 });\n *\n * effect(() => {\n * const results = search.results.value;\n * renderList(results.map(r => r.item));\n * });\n *\n * // Wire to an input\n * input.addEventListener('input', e => {\n * search.query.value = e.currentTarget.value;\n * });\n *\n * // Clean up\n * search.dispose();\n * ```\n *\n * `results` also updates when the index is mutated directly via `index.add()` / `.remove()`\n * / `.reindex()` / `.setItems()` (not just when `query` changes), by subscribing to `index.onMutate()`.\n *\n * @param index - A `ScoutIndex` built with `createIndex()`.\n * @param options.debounce - Milliseconds to wait before committing query changes. Default: `200`.\n * @param options.limit - Override the index-level result limit.\n * @param options.minQueryLength - Override the index-level minimum query length.\n * @param options.threshold - Override the index-level score threshold.\n */\nexport function createSearch<T>(index: ScoutIndex<T>, options: CreateSearchOptions = {}): SearchState<T> {\n const { debounce: debounceMs = DEFAULT_DEBOUNCE, limit, minQueryLength, threshold } = options;\n\n if (!Number.isFinite(debounceMs) || !Number.isInteger(debounceMs) || debounceMs < 0) {\n throw new ScoutConfigurationError('debounce must be a finite non-negative integer.');\n }\n\n const query = signal<string>('', { name: 'scout:query' });\n const committedQuery = signal<string>('', { name: 'scout:committedQuery' });\n const indexVersion = signal(0, { name: 'scout:indexVersion' });\n\n const unsubscribeMutations = index.onMutate(() => {\n indexVersion.value++;\n });\n\n const isSearching = computed(() => query.value !== committedQuery.value, { name: 'scout:isSearching' });\n\n const results = computed<SearchResult<T>[]>(\n () => {\n // Reading .value establishes a dependency so index mutations trigger a recompute.\n void indexVersion.value;\n\n return index.search(committedQuery.value, { limit, minQueryLength, threshold });\n },\n { name: 'scout:results' },\n );\n\n let timer: ReturnType<typeof setTimeout> | null = null;\n\n function cancelTimer(): void {\n if (timer !== null) {\n clearTimeout(timer);\n timer = null;\n }\n }\n\n const subscription = query.subscribe(() => {\n const q = query.peek();\n\n cancelTimer();\n\n if (q === committedQuery.peek()) return;\n\n if (debounceMs === 0) {\n committedQuery.value = q;\n\n return;\n }\n\n timer = setTimeout(() => {\n committedQuery.value = q;\n timer = null;\n }, debounceMs);\n });\n\n function clear(): void {\n if (isDisposed) throw new ScoutDisposedError('SearchState.clear() called after dispose()');\n\n cancelTimer();\n\n batch(() => {\n query.value = '';\n committedQuery.value = '';\n });\n }\n\n let isDisposed = false;\n const ac = new AbortController();\n\n function dispose(): void {\n isDisposed = true;\n ac.abort();\n cancelTimer();\n subscription();\n unsubscribeMutations();\n }\n\n return {\n clear,\n get disposalSignal(): AbortSignal {\n return ac.signal;\n },\n dispose,\n get disposed(): boolean {\n return isDisposed;\n },\n isSearching,\n query,\n results,\n [Symbol.dispose](): void {\n dispose();\n },\n };\n}\n\n/**\n * Creates a `ScoutIndex` and a reactive search state in one call — the shorthand\n * for the common pattern of `createIndex` + `createSearch`.\n *\n * The returned `ReactiveSearch` exposes the underlying index via `.index` for\n * incremental mutations (`add`, `remove`, `reindex`, `setItems`) after construction.\n *\n * @example\n * ```ts\n * const search = createReactiveSearch(users, {\n * fields: [{ field: 'name', weight: 2 }, 'email'],\n * debounce: 150,\n * });\n *\n * effect(() => renderList(search.results.value.map(r => r.item)));\n *\n * // Wire to an input\n * input.addEventListener('input', e => { search.query.value = e.currentTarget.value; });\n *\n * // Add a new item at runtime\n * search.index.add(newUser);\n * ```\n *\n * @param items - Initial corpus to index.\n * @param options - Index options (`fields`, `limit`, `minQueryLength`, `threshold`) plus optional `debounce`.\n */\nexport function createReactiveSearch<T>(\n items: T[],\n options: ScoutIndexOptions<T> & Pick<CreateSearchOptions, 'debounce'>,\n): ReactiveSearch<T> {\n const index = createIndex(items, {\n fields: options.fields,\n limit: options.limit,\n minQueryLength: options.minQueryLength,\n threshold: options.threshold,\n });\n const state = createSearch(index, { debounce: options.debounce });\n\n return Object.assign(Object.create(state), { index }) as ReactiveSearch<T>;\n}\n","/**\n * Splits `text` into whitespace-joined word segments using the runtime's native\n * `Intl.Segmenter` — no dependency, no bundle cost beyond this file.\n *\n * `tokenize()`'s trigram-based scoring works on unsegmented scripts (Chinese, Japanese,\n * Thai, ...) without this — trigrams are generated per-character, not per-word — but\n * `findMatchRanges()` / highlighting and the multi-word query semantics documented on\n * `SearchConstraints` assume space-separated words. Corpora in those scripts benefit from\n * pre-segmenting via a custom `stringify` so word boundaries exist for those features too.\n *\n * Not applied inside `tokenize()` itself: benchmarked at ~15x slower than the plain regex\n * path for the common whitespace-delimited case, which would regress `createIndex()`'s\n * O(corpus × field_length) construction cost for every caller, not just those indexing\n * unsegmented scripts. Opt in per-field instead.\n *\n * Returns `text` unchanged where `Intl.Segmenter` isn't available in the current runtime.\n *\n * @example\n * ```ts\n * const index = createIndex(documents, {\n * fields: [{ field: 'title', stringify: (v) => segmentWords(String(v)) }],\n * });\n * ```\n */\nexport function segmentWords(text: string): string {\n const segmenter = getSegmenter();\n\n if (!segmenter) return text;\n\n return [...segmenter.segment(text)]\n .filter((segment) => segment.isWordLike)\n .map((segment) => segment.segment)\n .join(' ');\n}\n\n// Constructing an `Intl.Segmenter` costs roughly as much as a `segment()` call itself\n// (both are called from `stringify`, once per field per item during `createIndex()`) — cache\n// the single stateless instance instead of rebuilding it on every `segmentWords()` call.\nlet cachedSegmenter: Intl.Segmenter | null | undefined;\n\nfunction getSegmenter(): Intl.Segmenter | null {\n if (cachedSegmenter === undefined) {\n cachedSegmenter =\n typeof Intl === 'undefined' || typeof Intl.Segmenter !== 'function'\n ? null\n : new Intl.Segmenter(undefined, { granularity: 'word' });\n }\n\n return cachedSegmenter;\n}\n"],"mappings":"mEAOA,SAAgB,EACd,EACA,EACqC,CACrC,IAAI,EACA,EAAe,GACf,EAAU,IAAI,IAElB,OAAQ,EAAM,MACR,IAAU,GAAa,EAAM,WAAa,KAC5C,EAAY,EACZ,EAAe,EAAM,SACrB,EAAU,IAAI,IAAI,EAAM,OAAO,EAAO,CAAO,CAAC,CAAC,IAAK,GAAW,EAAO,IAAI,CAAC,GAGtE,EAAQ,IAAI,CAAI,EAE3B,CAUA,SAAgB,EACd,EACA,EACA,EACsB,CACtB,IAAM,EAAW,IAAI,IAAI,EAAM,OAAO,EAAO,CAAO,CAAC,CAAC,IAAK,GAAW,EAAO,IAAI,CAAC,EAElF,MAAQ,IAAS,EAAS,IAAI,CAAI,CACpC,CCzCA,IAAa,EAAb,cAAgC,KAAM,CACpC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,WAAW,KACvB,OAAO,eAAe,KAAM,WAAW,SAAS,CAClD,CACF,EAGa,EAAb,cAAwC,CAAW,CAAC,EAGvC,EAAb,cAA6C,CAAW,CAAC,EELzD,SAAgB,EAAS,EAAsB,CAC7C,OAAO,EACJ,YAAY,CAAC,CACb,QAAQ,qBAAsB,GAAG,CAAC,CAClC,KAAK,CAAC,CACN,QAAQ,OAAQ,GAAG,CACxB,CAOA,SAAgB,EAAiB,EAAwB,CAgBvD,OAfI,GAAS,KAAa,GAEtB,OAAO,GAAU,SAAiB,EAElC,OAAO,GAAU,UAAY,OAAO,GAAU,UAAkB,OAAO,CAAK,EAE5E,MAAM,QAAQ,CAAK,EAMd,EAAM,OAAQ,GAAM,OAAO,GAAM,UAAY,OAAO,GAAM,UAAY,OAAO,GAAM,SAAS,CAAC,CAAC,KAAK,GAAG,EAGxG,EACT,CCxBA,SAAgB,EAAgB,EAAc,EAAmC,CAC/E,IAAM,EAAQ,EAAK,YAAY,EACzB,EAAQ,EAAS,CAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO,EACjD,EAA6B,CAAC,EAEpC,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAI,EAAM,EAEV,KAAO,EAAM,EAAM,QAAQ,CACzB,IAAM,EAAM,EAAM,QAAQ,EAAM,CAAG,EAEnC,GAAI,IAAQ,GAAI,MAEhB,EAAO,KAAK,CAAC,EAAK,EAAM,EAAK,MAAM,CAAC,EACpC,EAAM,EAAM,CACd,CACF,CAEA,EAAO,MAAM,EAAG,IAAM,EAAE,GAAK,EAAE,EAAE,EAEjC,IAAM,EAA6B,CAAC,EAEpC,IAAK,IAAM,KAAS,EAAQ,CAC1B,IAAM,EAAO,EAAO,EAAO,OAAS,GAEhC,GAAQ,EAAM,IAAM,EAAK,GAC3B,EAAK,GAAK,KAAK,IAAI,EAAK,GAAI,EAAM,EAAE,EAEpC,EAAO,KAAK,CAAC,EAAM,GAAI,EAAM,EAAE,CAAC,CAEpC,CAEA,OAAO,CACT,CA+BA,SAAgB,EAAU,EAAc,EAA6C,CACnF,GAAI,CAAC,EAAM,MAAO,CAAC,EAEnB,GAAI,CAAC,EAAO,OAAQ,MAAO,CAAC,CAAE,YAAa,GAAO,MAAK,CAAC,EAExD,IAAM,EAAyB,CAAC,EAC5B,EAAS,EAEb,IAAK,GAAM,CAAC,EAAO,KAAQ,EACrB,EAAQ,GACV,EAAM,KAAK,CAAE,YAAa,GAAO,KAAM,EAAK,MAAM,EAAQ,CAAK,CAAE,CAAC,EAGhE,EAAM,GACR,EAAM,KAAK,CAAE,YAAa,GAAM,KAAM,EAAK,MAAM,EAAO,CAAG,CAAE,CAAC,EAGhE,EAAS,EAOX,OAJI,EAAS,EAAK,QAChB,EAAM,KAAK,CAAE,YAAa,GAAO,KAAM,EAAK,MAAM,CAAM,CAAE,CAAC,EAGtD,CACT,CAyBA,SAAgB,EAAkB,EAAyB,EAAyB,EAA+B,CAGjH,OAAO,EAAU,EAFH,EAAO,QAAQ,KAAM,GAAM,EAAE,QAAU,CAE9B,CAAA,EAAO,QAAU,CAAC,CAAC,CAC5C,CCnIA,IAAIA,EAAI,cAAc,KAAM,CAC3B,YAAY,EAAG,EAAG,CACjB,MAAM,EAAG,CAAC,EAAG,KAAK,KAAO,WAAW,KAAM,OAAO,eAAe,KAAM,WAAW,SAAS,CAC3F,CACD,EAAGC,EAAI,cAAcD,CAAE,CAAC,EAAG,EAAI,cAAcA,CAAE,CAAC,EAAGE,EAAI,cAAcF,CAAE,CAAC,EAAGG,EAAI,cAAcH,CAAE,CAAC,ECH5FI,EAAI,OAAO,IAAI,2BAA2B,EAAG,EAAI,IAAK,EAAI,OAAO,cAAc,EAAG,EAAI,KAAM,CAC/F,CAACA,GAAK,CAAC,EACP,WAA6B,IAAI,IACjC,KACA,QACA,YAAY,EAAG,EAAG,CACjB,KAAK,QAAU,EAAG,KAAK,KAAO,CAC/B,CACA,UAAU,EAAG,CACZ,KAAK,QAAQ,aAAa,EAAG,KAAK,KAAK,EACvC,IAAI,EAAI,CACP,aAA8B,IAAI,IAClC,wBAA2B,KAAK,QAAQ,gBAAgB,CAAC,CAC1D,EACA,OAAO,KAAK,WAAW,IAAI,CAAC,MAAS,KAAK,WAAW,OAAO,CAAC,CAC9D,CACA,QAAS,CACR,IAAK,IAAI,IAAK,CAAC,GAAG,KAAK,UAAU,EAAG,EAAE,oBAAoB,CAC3D,CACD,EAAGC,EAAI,cAAc,CAAE,CACtB,QACA,OACA,YAAY,EAAG,EAAG,EAAG,CACpB,MAAM,EAAG,GAAG,IAAI,EAAG,KAAK,QAAU,EAAG,KAAK,OAAS,GAAG,QAAU,OAAO,EACxE,CACA,IAAI,OAAQ,CACX,OAAO,KAAK,QAAQ,MAAM,IAAI,EAAG,KAAK,OACvC,CACA,IAAI,MAAM,EAAG,CACZ,GAAI,KAAK,QAAQ,aAAa,EAAG,KAAK,OAAO,KAAK,QAAS,CAAC,EAAG,OAC/D,IAAI,EAAI,KAAK,QACb,KAAK,QAAU,EAAG,KAAK,QAAQ,KAAK,CACnC,KAAM,QACN,KAAM,KAAK,KACX,KAAM,EACN,SAAU,CACX,CAAC,EAAG,KAAK,QAAQ,cAAgB,KAAK,OAAO,CAAC,CAC/C,CACA,MAAO,CACN,OAAO,KAAK,OACb,CACA,OAAO,EAAG,CACT,KAAK,MAAQ,EAAE,KAAK,OAAO,CAC5B,CACD,EAAGC,EAAI,cAAc,CAAE,CACtB,aAA+B,IAAI,IACnC,UAAY,CAAC,EACb,SAAW,CAAC,EACZ,MAAQ,CAAC,EACT,QAAU,EACV,OACA,OACA,YAAY,EAAG,EAAG,EAAG,CACpB,MAAM,EAAG,GAAG,IAAI,EAAG,KAAK,OAAS,EAAG,KAAK,OAAS,GAAG,QAAU,OAAO,EACvE,CACA,IAAI,OAAQ,CACX,OAAO,KAAK,QAAQ,MAAM,IAAI,EAAG,KAAK,QAAQ,EAAG,KAAK,OACvD,CACA,MAAO,CACN,OAAO,KAAK,QAAQ,EAAG,KAAK,OAC7B,CACA,qBAAsB,CACrB,KAAK,WAAa,KAAK,QAAU,CAAC,EAAG,KAAK,WAAW,KAAO,GAAK,KAAK,QAAQ,GAAK,KAAK,OAAO,EAChG,CACA,SAAU,CACT,KAAK,WAAa,KAAK,SAAW,CAAC,EAAG,KAAK,QAAQ,kBAAkB,IAAI,EAAG,KAAK,WAAW,MAAM,EACnG,CACA,SAAU,CACT,GAAI,CAAC,KAAK,OAAS,KAAK,SAAU,MAAO,CAAC,EAC1C,GAAI,KAAK,UAER,MAAM,IAAIC,EAAE,0BADJ,KAAK,OAAS,IAAK,GAAI,GAAK,KAAK,KAAK,KAAK,IACV,EAE1C,KAAK,UAAY,CAAC,EAAG,KAAK,QAAQ,KAAK,CACtC,KAAM,UACN,KAAM,KAAK,IACZ,CAAC,EACD,GAAI,CACH,IAAI,EAAI,KAAK,QAAQ,QAAQ,KAAM,KAAK,MAAM,EAAG,EAAI,KAAK,UAAY,GAAK,CAAC,KAAK,OAAO,KAAK,QAAS,CAAC,EACvG,MAAO,MAAK,QAAU,EAAG,KAAK,MAAQ,CAAC,EAAG,CAC3C,QAAU,CACT,KAAK,UAAY,CAAC,CACnB,CACD,CACD,EAAGC,EAAI,KAAM,CACZ,mBAAqB,IAAI,gBACzB,MAAwB,IAAI,IAC5B,KACA,WAAa,CAAC,EACd,QACA,YAAY,EAAG,EAAG,CACjB,KAAK,QAAU,EAAG,KAAK,KAAO,CAC/B,CACA,IAAI,UAAW,CACd,OAAO,KAAK,UACb,CACA,IAAI,gBAAiB,CACpB,OAAO,KAAK,mBAAmB,MAChC,CACA,IAAI,EAAG,CACN,GAAI,KAAK,WAAY,MAAM,IAAIC,EAAE,8BAA8B,EAC/D,OAAO,KAAK,QAAQ,UAAU,KAAM,CAAC,CACtC,CACA,SAAU,CACT,GAAI,CAAC,KAAK,WAAY,CACrB,KAAK,WAAa,CAAC,EACnB,IAAK,IAAI,IAAK,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,QAAQ,EAAG,EAAE,QAAQ,EACnD,KAAK,MAAM,MAAM,EAAG,KAAK,mBAAmB,MAAM,EAAG,KAAK,QAAQ,KAAK,CACtE,KAAM,UACN,KAAM,KAAK,KACX,KAAM,OACP,CAAC,CACF,CACD,CACA,CAAC,OAAO,UAAW,CAClB,KAAK,QAAQ,CACd,CACD,EAAGC,EAAI,KAAM,CACZ,aAA+B,IAAI,IACnC,mBAAqB,IAAI,gBACzB,QACA,WAAa,CAAC,EACd,MACA,UAAY,CAAC,EACb,SACA,QACA,QACA,YAAY,EAAG,EAAG,EAAG,CACpB,KAAK,QAAU,EAAG,KAAK,SAAW,EAAG,KAAK,QAAU,CACrD,CACA,IAAI,UAAW,CACd,OAAO,KAAK,UACb,CACA,IAAI,gBAAiB,CACpB,OAAO,KAAK,mBAAmB,MAChC,CACA,qBAAsB,CACrB,GAAI,CAAC,KAAK,WAAY,CACrB,GAAI,KAAK,SAAS,YAAc,YAAa,CAC5C,GAAI,KAAK,UAAW,OACpB,KAAK,UAAY,CAAC,EAAG,mBAAqB,CACzC,KAAK,UAAY,CAAC,EAAG,KAAK,YAAc,KAAK,QAAQ,QAAQ,IAAI,CAClE,CAAC,EACD,MACD,CACA,KAAK,QAAQ,QAAQ,IAAI,CAC1B,CACD,CACA,KAAM,CACL,GAAI,KAAK,WAAY,OACrB,KAAK,OAAO,QAAQ,EAAG,KAAK,MAAQ,IAAK,GAAG,KAAK,WAAW,EAAG,KAAK,QAAQ,KAAK,CAChF,KAAM,SACN,KAAM,KAAK,SAAS,IACrB,CAAC,EACD,IAAI,EAAI,IAAIF,EAAE,KAAK,OAAO,EAC1B,GAAI,CACH,IAAI,EAAI,KAAK,QAAQ,gBAAgB,MAAS,KAAK,QAAQ,cAAc,KAAM,KAAK,QAAQ,CAAC,EAC7F,KAAK,MAAQ,EAAG,KAAK,QAAU,OAAO,GAAK,WAAa,EAAI,IAAK,EAClE,OAAS,EAAG,CACX,EAAE,QAAQ,EAAG,KAAK,QAAQ,OAAO,EAAG,CACnC,KAAM,SACN,KAAM,KAAK,SAAS,IACrB,CAAC,CACF,CACD,CACA,SAAU,CACT,KAAK,aAAe,KAAK,WAAa,CAAC,EAAG,KAAK,OAAO,QAAQ,EAAG,KAAK,MAAQ,IAAK,GAAG,KAAK,QAAQ,kBAAkB,IAAI,EAAG,KAAK,WAAW,EAAG,KAAK,mBAAmB,MAAM,EAAG,KAAK,QAAQ,KAAK,CACjM,KAAM,UACN,KAAM,KAAK,SAAS,KACpB,KAAM,QACP,CAAC,EACF,CACA,CAAC,OAAO,UAAW,CAClB,KAAK,QAAQ,CACd,CACA,YAAa,CACZ,IAAI,EAAI,KAAK,QACb,GAAI,KAAK,QAAU,IAAK,GAAG,IAAM,IAAK,GAAG,GAAI,CAC5C,EAAE,CACH,OAAS,EAAG,CACX,KAAK,QAAQ,OAAO,EAAG,CACtB,KAAM,UACN,KAAM,KAAK,SAAS,IACrB,CAAC,CACF,CACD,CACD,EAAGG,EAAI,KAAM,CACZ,kBACA,eACA,YACA,WAAa,CAAC,EACd,WAAa,EACb,SAAW,CAAC,EACZ,QAA0B,IAAI,IAC9B,UAA4B,IAAI,IAChC,UACA,SACA,QACA,YAAY,EAAG,CACd,KAAK,SAAW,GAAG,SAAU,KAAK,QAAU,GAAG,UAAa,GAAM,CACjE,mBAAqB,CACpB,MAAM,CACP,CAAC,CACF,GAAI,KAAK,UAAY,IAAIH,EAAE,KAAM,SAAS,EAAG,KAAK,YAAc,KAAK,SACtE,CACA,IAAI,UAAW,CACd,OAAO,KAAK,UACb,CACA,QAAU,EAAG,KAAO,KAAK,aAAa,EAAG,IAAIH,EAAE,KAAM,EAAG,CAAC,GACzD,UAAY,EAAG,IAAM,CACpB,KAAK,aAAa,EAClB,IAAI,EAAI,IAAIC,EAAE,KAAM,EAAG,CAAC,EACxB,OAAQ,KAAK,mBAAqB,KAAK,YAAA,CAAa,MAAM,IAAI,CAAC,EAAG,CACnE,EACA,QAAU,EAAG,IAAM,CAClB,KAAK,aAAa,EAClB,IAAI,EAAI,IAAII,EAAE,KAAM,EAAG,CAAC,EACxB,OAAQ,KAAK,mBAAqB,KAAK,YAAA,CAAa,MAAM,IAAI,CAAC,EAAG,EAAE,IAAI,EAAG,CAC5E,EACA,YAAe,GAAM,CACpB,KAAK,aAAa,EAClB,IAAI,EAAI,IAAIF,EAAE,KAAM,CAAC,EACrB,OAAO,KAAK,YAAY,MAAM,IAAI,CAAC,EAAG,CACvC,EACA,MAAS,IAAO,KAAK,aAAa,EAAG,KAAK,UAAU,CAAC,GACrD,QAAW,IAAO,KAAK,aAAa,EAAG,KAAK,aAAa,IAAK,GAAG,CAAC,GAClE,SAAU,CACT,KAAK,aAAe,KAAK,WAAa,CAAC,EAAG,KAAK,UAAU,QAAQ,EAClE,CACA,cAAe,CACd,GAAI,KAAK,WAAY,MAAM,IAAII,EAAE,uCAAuC,CACzE,CACA,MAAM,EAAG,CACR,IAAI,EAAI,KAAK,eACb,GAAG,aAAe,IAAK,IAAK,EAAE,WAAW,IAAI,CAAC,CAC/C,CACA,kBAAkB,EAAG,CACpB,IAAK,IAAI,KAAK,EAAE,aAAc,EAAE,WAAW,OAAO,CAAC,EACnD,EAAE,aAAa,MAAM,CACtB,CACA,QAAQ,EAAG,EAAG,CACb,OAAO,KAAK,YAAY,EAAG,EAAG,EAAE,aAAa,OAAS,CAAC,CACxD,CACA,cAAc,EAAG,EAAG,CACnB,OAAO,KAAK,YAAY,EAAG,EAAG,CAAC,CAAC,CACjC,CACA,gBAAgB,EAAG,EAAG,CACrB,IAAI,EAAI,KAAK,kBACb,KAAK,kBAAoB,EACzB,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,kBAAoB,CAC1B,CACD,CACA,aAAa,EAAG,EAAG,CAClB,IAAI,EAAI,KAAK,eACb,KAAK,eAAiB,EACtB,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,eAAiB,CACvB,CACD,CACA,UAAU,EAAG,EAAG,CACf,IAAI,EAAI,KAAK,kBAAmB,EAAI,KAAK,YACzC,KAAK,kBAAoB,IAAK,GAAG,KAAK,YAAc,EACpD,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,kBAAoB,EAAG,KAAK,YAAc,CAChD,CACD,CACA,QAAQ,EAAG,CACV,KAAK,QAAQ,IAAI,CAAC,EAAG,KAAK,aAAe,GAAK,KAAK,MAAM,CAC1D,CACA,gBAAgB,EAAG,CAClB,KAAK,UAAU,IAAI,CAAC,EAAG,KAAK,aAAe,GAAK,KAAK,MAAM,CAC5D,CACA,UAAU,EAAG,CACZ,KAAK,aACL,GAAI,CACH,OAAO,EAAE,CACV,QAAU,CACT,KAAK,aAAc,KAAK,aAAe,GAAK,KAAK,MAAM,CACxD,CACD,CACA,KAAK,EAAG,CACP,GAAI,CACH,KAAK,WAAW,CAAC,CAClB,OAAS,EAAG,CACX,KAAK,OAAO,EAAG,CACd,KAAM,WACN,KAAM,EAAE,IACT,CAAC,CACF,CACD,CACA,OAAO,EAAG,EAAG,CACZ,GAAI,CACH,KAAK,QAAQ,EAAG,CAAC,CAClB,OAAS,EAAG,CACX,mBAAqB,CACpB,MAAM,CACP,CAAC,CACF,CACD,CACA,YAAY,EAAG,EAAG,EAAG,CACpB,IAAI,EAAI,KAAK,eAAgB,EAAoB,IAAI,IACrD,EAAE,WAAa,EAAG,KAAK,eAAiB,EACxC,GAAI,CACH,IAAI,EAAI,EAAE,EACV,OAAO,KAAK,mBAAmB,EAAG,CAAC,EAAG,CACvC,OAAS,EAAG,CACX,MAAM,GAAK,KAAK,mBAAmB,EAAG,CAAC,EAAG,CAC3C,QAAU,CACT,EAAE,WAAa,IAAK,GAAG,KAAK,eAAiB,CAC9C,CACD,CACA,mBAAmB,EAAG,EAAG,CACxB,IAAK,IAAI,KAAK,EAAE,aAAc,EAAE,IAAI,CAAC,GAAK,EAAE,WAAW,OAAO,CAAC,EAC/D,IAAK,IAAI,KAAK,EAAG,EAAE,aAAa,IAAI,CAAC,GAAK,EAAE,WAAW,IAAI,CAAC,EAC5D,EAAE,aAAa,MAAM,EACrB,IAAK,IAAI,KAAK,EAAG,EAAE,aAAa,IAAI,CAAC,CACtC,CACA,OAAQ,CACP,GAAI,KAAK,SAAU,OACnB,KAAK,SAAW,CAAC,EACjB,IAAI,EAAI,EACR,GAAI,CACH,KAAO,KAAK,QAAQ,KAAO,GAAK,KAAK,UAAU,KAAO,GAAI,CACzD,GAAI,EAAE,EAAI,EAAG,MAAM,IAAIC,EAAE,6BAA6B,EAAE,aAAa,EACrE,IAAI,EAAI,CAAC,GAAG,KAAK,OAAO,EAAG,EAAI,CAAC,GAAG,KAAK,SAAS,EACjD,KAAK,QAAQ,MAAM,EAAG,KAAK,UAAU,MAAM,EAC3C,IAAK,IAAI,KAAK,EAAG,EAAE,IAAI,EACvB,IAAK,IAAI,KAAK,EAAG,GAAI,CACpB,EAAE,CACH,OAAS,EAAG,CACX,KAAK,OAAO,EAAG,CAAE,KAAM,UAAW,CAAC,CACpC,CACD,CACD,QAAU,CACT,KAAK,SAAW,CAAC,CAClB,CACD,CACD,ECxVI,EAAK,IAAO,EAAG,EAAG,IAAM,CAC3B,IAAI,EAAI,EAAE,OAAO,CAAE,OAAQ,SAAU,EAAG,CAAE,KAAM,GAAG,IAAK,CAAC,EAAG,EAAI,EAAE,OAAO,CAAC,EAAG,EAAG,EAAI,CAAC,EAAG,MAAU,CACjG,EAAE,MAAO,GAAG,MAAM,EAClB,IAAI,EAAI,EAAE,KAAK,EAAG,EAAI,EAAE,SAAW,UAAY,EAAE,MAAQ,aAAc,EAAI,EAAE,SAAW,IAAK,GAAG,EAChG,GAAI,CACH,EAAI,EAAE,CACP,OAAS,EAAG,CACX,EAAE,MAAQ,IAAM,IAAK,GAAI,CACxB,MAAO,EACP,OAAQ,OACT,EAAI,CACH,MAAO,EACP,SAAU,EACV,OAAQ,OACT,EACA,MACD,CACA,IAAI,EAAI,IAAI,gBACZ,EAAI,EAAG,EAAE,MAAQ,IAAM,IAAK,GAAI,CAAE,OAAQ,SAAU,EAAI,CACvD,SAAU,EACV,OAAQ,SACT,EACA,IAAI,EACJ,GAAI,CACH,EAAI,QAAQ,QAAQ,EAAE,EAAG,CAAE,OAAQ,EAAE,MAAO,CAAC,CAAC,CAC/C,OAAS,EAAG,CACX,EAAI,QAAQ,OAAO,CAAC,CACrB,CACA,EAAE,KAAM,GAAM,CACb,CAAC,GAAK,CAAC,EAAE,OAAO,UAAY,EAAE,MAAQ,CACrC,OAAQ,UACR,MAAO,CACR,EACD,EAAI,GAAM,CACT,CAAC,GAAK,CAAC,EAAE,OAAO,UAAY,EAAE,MAAQ,IAAM,IAAK,GAAI,CACpD,MAAO,EACP,OAAQ,OACT,EAAI,CACH,MAAO,EACP,SAAU,EACV,OAAQ,OACT,EACD,CAAC,CACF,EAAG,EAAI,EAAE,YAAc,EAAE,MAAS,GAAG,MAAM,GAAI,CAAE,KAAM,GAAG,IAAK,CAAC,EAChE,EAAE,eAAe,iBAAiB,YAAe,CAChD,EAAI,CAAC,CACN,EAAG,CAAE,KAAM,CAAC,CAAE,CAAC,EACf,IAAI,EAAI,CACP,IAAI,gBAAiB,CACpB,OAAO,EAAE,cACV,EACA,YAAe,EAAE,QAAQ,EACzB,IAAI,UAAW,CACd,OAAO,CACR,EACA,IAAI,MAAO,CACV,OAAO,EAAE,IACV,EACA,SAAY,EAAE,KAAK,EACnB,WAAc,CACb,IAAM,EAAE,MAAQ,EAAE,KAAK,EAAI,EAC5B,EACA,UAAY,GAAM,EAAE,UAAU,CAAC,EAC/B,CAAC,OAAO,UAAW,CAClB,KAAK,QAAQ,CACd,EACA,IAAI,OAAQ,CACX,OAAO,EAAE,KACV,CACD,EACA,OAAO,OAAO,eAAe,EAAGC,EAAG,CAAE,MAAO,CAAC,CAAE,CAAC,EAAG,CACpD,ECxEI,EAAK,IAAO,EAAG,EAAG,IAAM,CAC3B,IAAI,EAAI,OAAO,GAAK,WAAa,MAAU,EAAE,MAAO,EAAI,GAAG,QAAU,OAAO,GAAI,EAAI,CAAC,EAAG,EAAG,EAAI,CAAC,EAAG,EAAI,EAAE,WAAa,CACrH,IAAI,EAAI,EAAE,EACV,GAAI,EAAG,CACN,EAAI,CAAC,EAAG,EAAI,EAAG,GAAG,YAAc,EAAE,EAAG,IAAK,EAAC,EAAG,GAAG,OAAS,EAAI,CAAC,IAC/D,MACD,CACA,GAAI,EAAE,EAAG,CAAC,EAAG,OACb,IAAI,EAAI,EACR,EAAI,EAAG,EAAE,EAAG,CAAC,EAAG,GAAG,MAAQ,EAAE,QAAQ,CACtC,EAAG,CAAE,KAAM,GAAG,IAAK,CAAC,EACpB,OAAO,GAAK,EAAE,QAAQ,EAAG,CAC1B,ECOG,GAhBM,GAAM,CACd,IAAI,EAAI,IAAIC,EAAE,CAAC,EAAG,EAAI,EAAE,CAAC,EACzB,MAAO,CACN,MAAO,EAAE,MACT,SAAU,EAAE,SACZ,YAAa,EAAE,YACf,YAAe,EAAE,QAAQ,EACzB,IAAI,UAAW,CACd,OAAO,EAAE,QACV,EACA,OAAQ,EAAE,OACV,SAAU,EACV,OAAQ,EAAE,OACV,QAAS,EAAE,QACX,MAAOC,EAAE,CAAC,CACX,CACD,EAAO,CAAE,EChBL,EAAIC,EAAE,OAAQ,EAAIA,EAAE,SAAcA,EAAE,OAAQ,IAAA,EAAIA,EAAE,MAAWA,EAAE,YAAiBA,EAAE,QAAaA,EAAE,MAAWA,EAAE,SCOlH,SAAgB,EAAiB,EAA2B,CAC1D,IAAM,EAAW,IAAI,IACf,EAAS,IAAI,EAAK,GAExB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAS,EAAG,IACrC,EAAS,IAAI,EAAO,MAAM,EAAG,EAAI,CAAC,CAAC,EAGrC,OAAO,CACT,CAiCA,SAAgB,EAAkB,EAAgB,EAAwB,CACxE,GAAI,EAAE,OAAS,GAAK,EAAE,OAAS,EAAG,MAAO,GAEzC,IAAI,EAAS,EAEb,IAAK,IAAM,KAAW,EAChB,EAAE,IAAI,CAAO,GAAG,IAKtB,OAFI,EAAS,GAAK,EAAS,EAAE,KAAa,EAEnC,EAAS,KAAK,IAAI,EAAE,KAAM,EAAE,IAAI,CACzC,CCUA,SAAS,EAAqB,EAAe,EAAc,EAAyB,CAClF,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,CAAC,OAAO,UAAU,CAAK,GAAK,EAAQ,EACjE,MAAM,IAAI,EAAwB,GAAG,EAAK,qDAAqD,EAAQ,EAAE,EAG3G,OAAO,CACT,CAEA,SAAS,EAAoB,EAAe,EAAc,EAAiB,EAAU,IAAkC,CACrH,GAAI,CAAC,OAAO,SAAS,CAAK,GAAK,EAAQ,GAAW,EAAQ,EACxD,MAAM,IAAI,EAAwB,GAAG,EAAK,mCAAmC,EAAQ,OAAO,EAAQ,EAAE,EAGxG,OAAO,CACT,CAEA,SAAS,EAAiB,EAAoD,CAC5E,OAAO,EAAK,IAAK,GACX,OAAO,GAAQ,SACV,CAAE,MAAO,EAAK,UAAW,EAAkB,OAAQ,CAAE,EAGvD,CACL,MAAO,EAAI,MACX,UAAW,EAAI,WAAa,EAC5B,OAAQ,EAAoB,EAAI,QAAU,EAAG,qBAAqB,EAAI,MAAM,GAAI,OAAO,SAAS,CAClG,CACD,CACH,CAqBA,SAAgB,EAAe,EAAY,EAA8C,CACvF,GAAI,EAAQ,OAAO,SAAW,EAC5B,MAAM,IAAI,EAAwB,8CAA8C,EAGlF,IAAM,EAAS,EAAc,EAAQ,MAAM,EACrC,EAAY,EAAO,QAAQ,EAAK,IAAM,KAAK,IAAI,EAAK,EAAE,MAAM,EAAG,CAAC,EAChE,EAAmB,EAAoB,EAAQ,WAAa,GAAK,YAAa,EAAG,CAAC,EAClF,EAAe,EAAqB,EAAQ,OAAS,GAAI,QAAS,CAAC,EACnE,EAAwB,EAAqB,EAAQ,gBAAkB,EAAG,iBAAkB,CAAC,EAG7F,EAAW,IAAI,IAEf,EAAgB,IAAI,IACpB,EAAoB,IAAI,IAC1B,EAAW,EAEf,SAAS,GAAuB,CAC9B,IAEA,IAAK,IAAM,KAAY,EAAmB,EAAS,CACrD,CAGA,IAAI,EAAkC,KAClC,EAAqC,KAEzC,SAAS,EAAiB,EAAiC,CAMzD,OALI,IAAe,GAAoB,IAAmB,KAAa,GAEvE,EAAmB,EACnB,EAAiB,EAAiB,CAAU,EAErC,EACT,CAEA,SAAS,EAAgB,EAAS,EAAkC,CAClE,IAAK,IAAM,KAAW,EAAe,CACnC,IAAI,EAAS,EAAc,IAAI,CAAO,EAEjC,IACH,EAAS,IAAI,IACb,EAAc,IAAI,EAAS,CAAM,GAGnC,EAAO,IAAI,CAAI,CACjB,CACF,CAEA,SAAS,EAAqB,EAAS,EAAkC,CACvE,IAAK,IAAM,KAAW,EAAe,CACnC,IAAM,EAAS,EAAc,IAAI,CAAO,EAEpC,IACF,EAAO,OAAO,CAAI,EAEd,EAAO,OAAS,GAAG,EAAc,OAAO,CAAO,EAEvD,CACF,CAEA,SAAS,EAAQ,EAAe,CAC9B,IAAM,EAAW,IAAI,IACf,EAAS,IAAI,IAEnB,IAAK,GAAM,CAAE,QAAO,eAAe,EAAQ,CACzC,IAAM,EAAM,EAAK,GACX,EAAO,EAAU,CAAG,EACpB,EAAa,EAAS,CAAI,EAC1B,EAAgB,EAAW,QAAU,EAAI,EAAiB,CAAU,EAAI,IAAI,IAElF,EAAS,IAAI,EAAO,CAAa,EACjC,EAAO,IAAI,EAAO,CAAI,EACtB,EAAgB,EAAM,CAAa,CACrC,CAEA,EAAS,IAAI,EAAM,CAAE,WAAU,QAAO,CAAC,CACzC,CAOA,SAAS,EAAgB,EAAuB,CAC9C,IAAM,EAAS,IAAI,IAEnB,IAAK,GAAM,CAAC,EAAM,KAAW,EAC3B,IAAK,IAAM,KAAS,EAAO,OAAO,OAAO,EACvC,GAAI,EAAM,YAAY,CAAC,CAAC,SAAS,CAAK,EAAG,CACvC,EAAO,IAAI,CAAI,EACf,KACF,CAIJ,OAAO,CACT,CAEA,SAAS,EAAkB,EAAoC,CAC7D,IAAM,EAAa,IAAI,IAEvB,IAAK,IAAM,KAAW,EAAe,CACnC,IAAM,EAAQ,EAAc,IAAI,CAAO,EAEvC,GAAI,EACF,IAAK,IAAM,KAAQ,EAAO,EAAW,IAAI,CAAI,CAEjD,CAEA,OAAO,CACT,CAEA,SAAS,EAAe,EAAoB,EAAmC,EAA4B,CACzG,IAAI,EAAY,EAEhB,IAAK,GAAM,CAAE,QAAO,YAAY,EAAQ,CACtC,IAAI,EAEJ,GAAI,IAAkB,KAGpB,EAAA,IAFY,EAAO,OAAO,IAAI,CAAK,GAAK,GAAA,CAEvB,YAAY,CAAC,CAAC,SAAS,CAAU,MAC7C,CACL,IAAM,EAAe,EAAO,SAAS,IAAI,CAAK,EAE9C,GAAI,CAAC,GAAgB,EAAa,OAAS,EAAG,SAE9C,EAAa,EAAkB,EAAe,CAAY,CAC5D,CAEA,IAAM,EAAyB,EAAS,EAAvB,EAEb,EAAW,IAAW,EAAY,EACxC,CAEA,OAAO,CACT,CAEA,SAAS,EAAe,EAAe,EAA6D,CAClG,IAAM,EAA0C,CAAC,EAEjD,IAAK,GAAM,CAAE,WAAW,EAAQ,CAC9B,IAAM,EAAO,EAAO,IAAI,CAAK,EAE7B,GAAI,CAAC,EAAM,SAEX,IAAM,EAAS,EAAgB,EAAM,CAAK,EAEtC,EAAO,OAAS,GAAG,EAAQ,KAAK,CAAE,QAAO,QAAO,CAAC,CACvD,CAEA,OAAO,CACT,CAEA,SAAS,EAAY,EAAkB,CACrC,IAAM,EAAS,EAAS,IAAI,CAAI,EAEhC,GAAI,CAAC,EAAQ,MAAO,GAEpB,IAAI,EAAU,GAEd,IAAK,GAAM,CAAE,QAAO,eAAe,EAAQ,CACzC,IAAM,EAAU,EAAU,EAAK,EAAM,EAGrC,GAAI,IAFY,EAAO,OAAO,IAAI,CAElB,EAAS,SAEzB,EAAU,GAEV,IAAM,EAAc,EAAO,SAAS,IAAI,CAAK,EAEzC,GAAa,EAAqB,EAAM,CAAW,EAEvD,IAAM,EAAa,EAAS,CAAO,EAC7B,EAAc,EAAW,QAAU,EAAI,EAAiB,CAAU,EAAI,IAAI,IAEhF,EAAO,SAAS,IAAI,EAAO,CAAW,EACtC,EAAO,OAAO,IAAI,EAAO,CAAO,EAChC,EAAgB,EAAM,CAAW,CACnC,CAEA,OAAO,CACT,CAEA,SAAS,EAAW,EAAkB,CACpC,IAAM,EAAS,EAAS,IAAI,CAAI,EAEhC,GAAI,CAAC,EAAQ,MAAO,GAEpB,IAAK,IAAM,KAAiB,EAAO,SAAS,OAAO,EACjD,EAAqB,EAAM,CAAa,EAK1C,OAFA,EAAS,OAAO,CAAI,EAEb,EACT,CAEA,IAAK,IAAM,KAAQ,EACZ,EAAS,IAAI,CAAI,GAAG,EAAQ,CAAI,EAqHvC,MAAO,CAjHL,IAAI,EAAe,CACb,EAAS,IAAI,CAAI,IAErB,EAAQ,CAAI,EACZ,EAAe,EACjB,EAEA,IAAI,OAAsB,CACxB,MAAO,CAAC,GAAG,EAAS,KAAK,CAAC,CAC5B,EAEA,SAAS,EAAkC,CAGzC,OAFA,EAAkB,IAAI,CAAQ,MAEjB,CACX,EAAkB,OAAO,CAAQ,CACnC,CACF,EAEA,QAAQ,EAAe,CACjB,EAAY,CAAI,GAAG,EAAe,CACxC,EAEA,OAAO,EAAe,CAChB,EAAW,CAAI,GAAG,EAAe,CACvC,EAEA,IAAI,UAAmB,CACrB,OAAO,CACT,EAEA,OAAO,EAAe,EAAgD,CACpE,IAAM,EAAY,EAAoB,GAAS,WAAa,EAAkB,YAAa,EAAG,CAAC,EACzF,EAAQ,EAAqB,GAAS,OAAS,EAAc,QAAS,CAAC,EACvE,EAAiB,EACrB,GAAS,gBAAkB,EAC3B,iBACA,CACF,EAEA,GAAI,CAAC,EAAM,KAAK,EACd,MAAO,CAAC,GAAG,EAAS,KAAK,CAAC,CAAC,CAAC,MAAM,EAAG,CAAK,CAAC,CAAC,IAAK,IAAU,CAAE,OAAM,QAAS,CAAC,EAAG,MAAO,CAAE,EAAE,EAG7F,IAAM,EAAa,EAAS,CAAK,EAGjC,GAAI,CAAC,EAAY,MAAO,CAAC,EAGzB,IAAM,EADU,EAAW,OAAS,EACJ,KAAO,EAAiB,CAAU,EAC5D,EAAa,IAAkB,KAAO,EAAgB,CAAU,EAAI,EAAkB,CAAa,EACnG,EAA6B,CAAC,EAEpC,IAAK,IAAM,KAAQ,EAAY,CAC7B,IAAM,EAAS,EAAS,IAAI,CAAI,EAEhC,GAAI,CAAC,EAAQ,SAEb,IAAM,EAAQ,EAAe,EAAY,EAAe,CAAM,EAE9D,GAAI,GAAS,EAAW,CACtB,IAAM,EAAU,EAAe,EAAY,EAAO,MAAM,EAExD,EAAQ,KAAK,CAAE,OAAM,UAAS,OAAM,CAAC,CACvC,CACF,CAEA,OAAO,EAAQ,MAAM,EAAG,IAAM,EAAE,MAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,EAAG,CAAK,CACjE,EAEA,SAAS,EAA2B,CAClC,IAAM,EAAW,IAAI,IAAI,CAAK,EACxB,EAAO,CAAC,GAAG,CAAQ,EACrB,EAAU,GAEd,IAAK,IAAM,IAAQ,CAAC,GAAG,EAAS,KAAK,CAAC,EAChC,EAAS,IAAI,CAAI,IAErB,EAAW,CAAI,EACf,EAAU,IAGZ,IAAK,IAAM,KAAQ,EACZ,EAAS,IAAI,CAAI,EAGX,EAAY,CAAI,IACzB,EAAU,KAHV,EAAQ,CAAI,EACZ,EAAU,IAMd,IAAM,EAAU,CAAC,GAAG,EAAS,KAAK,CAAC,EAGnC,GAFqB,EAAQ,SAAW,EAAK,QAAU,EAAQ,MAAM,EAAM,IAAU,IAAS,EAAK,EAAM,EAEvF,CAChB,IAAM,EAAU,IAAI,IAAI,EAAK,IAAK,GAAS,CAAC,EAAM,EAAS,IAAI,CAAI,CAAE,CAAC,CAAC,EAEvE,EAAS,MAAM,EAEf,IAAK,GAAM,CAAC,EAAM,KAAW,EAAS,EAAS,IAAI,EAAM,CAAM,EAE/D,EAAU,EACZ,CAEI,GAAS,EAAe,CAC9B,EAEA,IAAI,MAAe,CACjB,OAAO,EAAS,IAClB,CAGK,CACT,CC9aA,IAAM,EAAmB,IAsCzB,SAAgB,EAAgB,EAAsB,EAA+B,CAAC,EAAmB,CACvG,GAAM,CAAE,SAAU,EAAa,EAAkB,QAAO,iBAAgB,aAAc,EAEtF,GAAI,CAAC,OAAO,SAAS,CAAU,GAAK,CAAC,OAAO,UAAU,CAAU,GAAK,EAAa,EAChF,MAAM,IAAI,EAAwB,iDAAiD,EAGrF,IAAM,EAAQ,EAAe,GAAI,CAAE,KAAM,aAAc,CAAC,EAClD,EAAiB,EAAe,GAAI,CAAE,KAAM,sBAAuB,CAAC,EACpE,EAAe,EAAO,EAAG,CAAE,KAAM,oBAAqB,CAAC,EAEvD,EAAuB,EAAM,aAAe,CAChD,EAAa,OACf,CAAC,EAEK,EAAc,MAAe,EAAM,QAAU,EAAe,MAAO,CAAE,KAAM,mBAAoB,CAAC,EAEhG,EAAU,OAGZ,EAAkB,MAEX,EAAM,OAAO,EAAe,MAAO,CAAE,QAAO,iBAAgB,WAAU,CAAC,GAEhF,CAAE,KAAM,eAAgB,CAC1B,EAEI,EAA8C,KAElD,SAAS,GAAoB,CACvB,IAAU,OACZ,aAAa,CAAK,EAClB,EAAQ,KAEZ,CAEA,IAAM,EAAe,EAAM,cAAgB,CACzC,IAAM,EAAI,EAAM,KAAK,EAErB,KAAY,EAER,IAAM,EAAe,KAAK,EAE9B,IAAI,IAAe,EAAG,CACpB,EAAe,MAAQ,EAEvB,MACF,CAEA,EAAQ,eAAiB,CACvB,EAAe,MAAQ,EACvB,EAAQ,IACV,EAAG,CAAU,CALb,CAMF,CAAC,EAED,SAAS,GAAc,CACrB,GAAI,EAAY,MAAM,IAAI,EAAmB,4CAA4C,EAEzF,EAAY,EAEZ,MAAY,CACV,EAAM,MAAQ,GACd,EAAe,MAAQ,EACzB,CAAC,CACH,CAEA,IAAI,EAAa,GACX,EAAK,IAAI,gBAEf,SAAS,GAAgB,CACvB,EAAa,GACb,EAAG,MAAM,EACT,EAAY,EACZ,EAAa,EACb,EAAqB,CACvB,CAEA,MAAO,CACL,QACA,IAAI,gBAA8B,CAChC,OAAO,EAAG,MACZ,EACA,UACA,IAAI,UAAoB,CACtB,OAAO,CACT,EACA,cACA,QACA,UACA,CAAC,OAAO,UAAiB,CACvB,EAAQ,CACV,CACF,CACF,CA4BA,SAAgB,EACd,EACA,EACmB,CACnB,IAAM,EAAQ,EAAY,EAAO,CAC/B,OAAQ,EAAQ,OAChB,MAAO,EAAQ,MACf,eAAgB,EAAQ,eACxB,UAAW,EAAQ,SACrB,CAAC,EACK,EAAQ,EAAa,EAAO,CAAE,SAAU,EAAQ,QAAS,CAAC,EAEhE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAK,EAAG,CAAE,OAAM,CAAC,CACtD,CCjKA,SAAgB,EAAa,EAAsB,CACjD,IAAM,EAAY,EAAa,EAI/B,OAFK,EAEE,CAAC,GAAG,EAAU,QAAQ,CAAI,CAAC,CAAC,CAChC,OAAQ,GAAY,EAAQ,UAAU,CAAC,CACvC,IAAK,GAAY,EAAQ,OAAO,CAAC,CACjC,KAAK,GAAG,EALY,CAMzB,CAKA,IAAI,EAEJ,SAAS,GAAsC,CAQ7C,OAPI,IAAoB,IAAA,KACtB,EACE,OAAO,KAAS,KAAe,OAAO,KAAK,WAAc,WACrD,KACA,IAAI,KAAK,UAAU,IAAA,GAAW,CAAE,YAAa,MAAO,CAAC,GAGtD,CACT"}
package/dist/scout.iife.js CHANGED
@@ -1,2 +1,2 @@
1
- var Scout=(function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});function t(e,t){let n,r=-1,i=new Set;return(a,o)=>((o!==n||e.revision!==r)&&(n=o,r=e.revision,i=new Set(e.search(o,t).map(e=>e.item))),i.has(a))}function n(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var r=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},i=class extends r{},a=class extends r{};function o(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function s(e){return e==null?``:typeof e==`string`?e:typeof e==`number`||typeof e==`boolean`?String(e):Array.isArray(e)?e.filter(e=>typeof e==`string`||typeof e==`number`||typeof e==`boolean`).join(` `):``}function c(e,t){let n=e.toLowerCase(),r=o(t).split(` `).filter(Boolean),i=[];for(let e of r){let t=0;for(;t<n.length;){let r=n.indexOf(e,t);if(r===-1)break;i.push([r,r+e.length]),t=r+1}}i.sort((e,t)=>e[0]-t[0]);let a=[];for(let e of i){let t=a[a.length-1];t&&e[0]<=t[1]?t[1]=Math.max(t[1],e[1]):a.push([e[0],e[1]])}return a}function l(e,t){if(!e)return[];if(!t.length)return[{highlighted:!1,text:e}];let n=[],r=0;for(let[i,a]of t)i>r&&n.push({highlighted:!1,text:e.slice(r,i)}),a>i&&n.push({highlighted:!0,text:e.slice(i,a)}),r=a;return r<e.length&&n.push({highlighted:!1,text:e.slice(r)}),n}function u(e,t,n){return l(n,e.matches.find(e=>e.field===t)?.ranges??[])}var d=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},f=class extends d{},p=class extends d{},m=class extends d{},h=class extends d{},g=Symbol.for(`@vielzeug/ripple/reactive`),_=100,v=Symbol(`ripple.unset`),y=class{[g]=!0;dependents=new Set;name;runtime;constructor(e,t){this.runtime=e,this.name=t}subscribe(e){this.runtime.assertActive(),this.peek();let t={dependencies:new Set,onDependencyChanged:()=>this.runtime.enqueueListener(e)};return this.dependents.add(t),()=>this.dependents.delete(t)}notify(){for(let e of[...this.dependents])e.onDependencyChanged()}},b=class extends y{current;equals;constructor(e,t,n){super(e,n?.name),this.current=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.current}set value(e){if(this.runtime.assertActive(),this.equals(this.current,e))return;let t=this.current;this.current=e,this.runtime.emit({kind:`write`,name:this.name,next:e,previous:t}),this.runtime.propagate(()=>this.notify())}peek(){return this.current}update(e){this.value=e(this.current)}},x=class extends y{dependencies=new Set;computing=!1;disposed=!1;dirty=!0;current=v;derive;equals;constructor(e,t,n){super(e,n?.name),this.derive=t,this.equals=n?.equals??Object.is}get value(){return this.refresh(),this.runtime.track(this),this.current}peek(){return this.refresh(),this.current}onDependencyChanged(){this.disposed||(this.dirty||=!0,this.dependents.size>0&&this.refresh()&&this.notify())}dispose(){this.disposed||(this.disposed=!0,this.runtime.clearDependencies(this),this.dependents.clear())}refresh(){if(!this.dirty||this.disposed)return!1;if(this.computing)throw new f(`computed cycle detected${this.name===void 0?``:` "${this.name}"`}`);this.computing=!0,this.runtime.emit({kind:`compute`,name:this.name});try{let e=this.runtime.collect(this,this.derive),t=this.current===v||!this.equals(this.current,e);return this.current=e,this.dirty=!1,t}finally{this.computing=!1}}},S=class{disposalController=new AbortController;owned=new Set;name;isDisposed=!1;runtime;constructor(e,t){this.runtime=e,this.name=t}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}run(e){if(this.isDisposed)throw new m(`Cannot run a disposed scope.`);return this.runtime.withScope(this,e)}dispose(){if(!this.isDisposed){this.isDisposed=!0;for(let e of[...this.owned].reverse())e.dispose();this.owned.clear(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.name,node:`scope`})}}[Symbol.dispose](){this.dispose()}},C=class{dependencies=new Set;disposalController=new AbortController;cleanup;isDisposed=!1;owner;scheduled=!1;callback;options;runtime;constructor(e,t,n){this.runtime=e,this.callback=t,this.options=n}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}onDependencyChanged(){if(!this.isDisposed){if(this.options?.scheduler===`microtask`){if(this.scheduled)return;this.scheduled=!0,queueMicrotask(()=>{this.scheduled=!1,this.isDisposed||this.runtime.enqueue(this)});return}this.runtime.enqueue(this)}}run(){if(this.isDisposed)return;this.owner?.dispose(),this.owner=void 0,this.runCleanup(),this.runtime.emit({kind:`effect`,name:this.options?.name});let e=new S(this.runtime);try{let t=this.runtime.withEffectScope(e,()=>this.runtime.collectEffect(this,this.callback));this.owner=e,this.cleanup=typeof t==`function`?t:void 0}catch(t){e.dispose(),this.runtime.report(t,{kind:`effect`,name:this.options?.name})}}dispose(){this.isDisposed||(this.isDisposed=!0,this.owner?.dispose(),this.owner=void 0,this.runtime.clearDependencies(this),this.runCleanup(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.options?.name,node:`effect`}))}[Symbol.dispose](){this.dispose()}runCleanup(){let e=this.cleanup;if(this.cleanup=void 0,e!==void 0)try{e()}catch(e){this.runtime.report(e,{kind:`cleanup`,name:this.options?.name})}}},w=class{activeEffectScope;activeObserver;activeScope;isDisposed=!1;flushDepth=0;flushing=!1;pending=new Set;listeners=new Set;rootScope;observer;onError;constructor(e){this.observer=e?.observer,this.onError=e?.onError??(e=>{queueMicrotask(()=>{throw e})}),this.rootScope=new S(this,`runtime`),this.activeScope=this.rootScope}get disposed(){return this.isDisposed}signal=(e,t)=>(this.assertActive(),new b(this,e,t));computed=(e,t)=>{this.assertActive();let n=new x(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n};effect=(e,t)=>{this.assertActive();let n=new C(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n.run(),n};createScope=e=>{this.assertActive();let t=new S(this,e);return this.activeScope.owned.add(t),t};batch=e=>(this.assertActive(),this.propagate(e));untrack=e=>(this.assertActive(),this.withObserver(void 0,e));dispose(){this.isDisposed||(this.isDisposed=!0,this.rootScope.dispose())}assertActive(){if(this.isDisposed)throw new p(`Cannot use a disposed Ripple runtime.`)}track(e){let t=this.activeObserver;t?.collecting!==void 0&&t.collecting.add(e)}clearDependencies(e){for(let t of e.dependencies)t.dependents.delete(e);e.dependencies.clear()}collect(e,t){return this.collectWith(e,t,!1)}collectEffect(e,t){return this.collectWith(e,t,!0)}withEffectScope(e,t){let n=this.activeEffectScope;this.activeEffectScope=e;try{return t()}finally{this.activeEffectScope=n}}withObserver(e,t){let n=this.activeObserver;this.activeObserver=e;try{return t()}finally{this.activeObserver=n}}withScope(e,t){let n=this.activeEffectScope,r=this.activeScope;this.activeEffectScope=void 0,this.activeScope=e;try{return t()}finally{this.activeEffectScope=n,this.activeScope=r}}enqueue(e){this.pending.add(e),this.flushDepth===0&&this.flush()}enqueueListener(e){this.listeners.add(e),this.flushDepth===0&&this.flush()}propagate(e){this.flushDepth++;try{return e()}finally{this.flushDepth--,this.flushDepth===0&&this.flush()}}emit(e){try{this.observer?.(e)}catch(t){this.report(t,{kind:`observer`,name:e.name})}}report(e,t){try{this.onError(e,t)}catch(e){queueMicrotask(()=>{throw e})}}collectWith(e,t,n){let r=this.activeObserver,i=new Set;e.collecting=i,this.activeObserver=e;try{let n=t();return this.commitDependencies(e,i),n}catch(t){throw n&&this.commitDependencies(e,i),t}finally{e.collecting=void 0,this.activeObserver=r}}commitDependencies(e,t){for(let n of e.dependencies)t.has(n)||n.dependents.delete(e);for(let n of t)e.dependencies.has(n)||n.dependents.add(e);e.dependencies.clear();for(let n of t)e.dependencies.add(n)}flush(){if(this.flushing)return;this.flushing=!0;let e=0;try{for(;this.pending.size>0||this.listeners.size>0;){if(++e>_)throw new h(`infinite reactive flush (>${_} iterations)`);let t=[...this.pending],n=[...this.listeners];this.pending.clear(),this.listeners.clear();for(let e of t)e.run();for(let e of n)try{e()}catch(e){this.report(e,{kind:`listener`})}}}finally{this.flushing=!1}}},T=e=>(t,n,r)=>{let i=e.signal({status:`pending`},{name:r?.name}),a=e.signal(0),o,s=!1,c=()=>{a.value,o?.abort();let e=i.peek(),r=e.status===`success`?e.value:`previous`in e?e.previous:void 0,c;try{c=t()}catch(e){i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`};return}let l=new AbortController;o=l,i.value=r===void 0?{status:`pending`}:{previous:r,status:`pending`};let u;try{u=Promise.resolve(n(c,{signal:l.signal}))}catch(e){u=Promise.reject(e)}u.then(e=>{!s&&!l.signal.aborted&&(i.value={status:`success`,value:e})},e=>{!s&&!l.signal.aborted&&(i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`})})},l=e.effect(()=>(c(),()=>o?.abort()),{name:r?.name});l.disposalSignal.addEventListener(`abort`,()=>{s=!0},{once:!0});let u={get disposalSignal(){return l.disposalSignal},dispose:()=>l.dispose(),get disposed(){return s},get name(){return i.name},peek:()=>i.peek(),reload:()=>{s||(a.value=a.peek()+1)},subscribe:e=>i.subscribe(e),[Symbol.dispose](){this.dispose()},get value(){return i.value}};return Object.defineProperty(u,g,{value:!0}),u},E=e=>(t,n,r)=>{let i=typeof t==`function`?t:()=>t.value,a=r?.equals??Object.is,o=!0,s,c=!1,l=e.effect(()=>{let e=i();if(o){o=!1,s=e,r?.immediate&&(n(e,void 0),r?.once&&(c=!0));return}if(a(s,e))return;let t=s;s=e,n(e,t),r?.once&&l.dispose()},{name:r?.name});return c&&l.dispose(),l},D=(e=>{let t=new w(e),n=T(t);return{batch:t.batch,computed:t.computed,createScope:t.createScope,dispose:()=>t.dispose(),get disposed(){return t.disposed},effect:t.effect,resource:n,signal:t.signal,untrack:t.untrack,watch:E(t)}})(),O=D.signal,k=D.computed;D.effect;var A=D.batch;D.createScope,D.untrack,D.watch,D.resource;function j(e){let t=new Set,n=` ${e} `;for(let e=0;e<n.length-2;e++)t.add(n.slice(e,e+3));return t}function M(e,t){if(e.size===0||t.size===0)return 0;let n=0;for(let r of e)t.has(r)&&n++;return n<2&&n<e.size?0:n/Math.min(e.size,t.size)}function N(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new a(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function P(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new a(`${t} must be a finite number between ${n} and ${r}.`);return e}function F(e){return e.map(e=>typeof e==`string`?{field:e,stringify:s,weight:1}:{field:e.field,stringify:e.stringify??s,weight:P(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function I(e,t){if(t.fields.length===0)throw new a(`createIndex: at least one field is required.`);let n=F(t.fields),r=n.reduce((e,t)=>Math.max(e,t.weight),1),i=P(t.threshold??.2,`threshold`,0,1),s=N(t.limit??50,`limit`,0),l=N(t.minQueryLength??3,`minQueryLength`,1),u=new Map,d=new Map,f=new Set,p=0;function m(){p++;for(let e of f)e()}let h=null,g=null;function _(e){return e===h&&g!==null?g:(h=e,g=j(e),g)}function v(e,t){for(let n of t){let t=d.get(n);t||(t=new Set,d.set(n,t)),t.add(e)}}function y(e,t){for(let n of t){let t=d.get(n);t&&(t.delete(e),t.size===0&&d.delete(n))}}function b(e){let t=new Map,r=new Map;for(let{field:i,stringify:a}of n){let n=e[i],s=a(n),c=o(s),l=c.length>=1?j(c):new Set;t.set(i,l),r.set(i,s),v(e,l)}u.set(e,{trigrams:t,values:r})}function x(e){let t=new Set;for(let[n,r]of u)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function S(e){let t=new Set;for(let n of e){let e=d.get(n);if(e)for(let n of e)t.add(n)}return t}function C(e,t,i){let a=0;for(let{field:o,weight:s}of n){let n;if(t===null)n=+!!(i.values.get(o)??``).toLowerCase().includes(e);else{let e=i.trigrams.get(o);if(!e||e.size===0)continue;n=M(t,e)}let c=s/r*n;c>a&&(a=c)}return a}function w(e,t){let r=[];for(let{field:i}of n){let n=t.get(i);if(!n)continue;let a=c(n,e);a.length>0&&r.push({field:i,ranges:a})}return r}function T(e){let t=u.get(e);if(!t)return!1;let r=!1;for(let{field:i,stringify:a}of n){let n=a(e[i]);if(n===t.values.get(i))continue;r=!0;let s=t.trigrams.get(i);s&&y(e,s);let c=o(n),l=c.length>=1?j(c):new Set;t.trigrams.set(i,l),t.values.set(i,n),v(e,l)}return r}function E(e){let t=u.get(e);if(!t)return!1;for(let n of t.trigrams.values())y(e,n);return u.delete(e),!0}for(let t of e)u.has(t)||b(t);return{add(e){u.has(e)||(b(e),m())},get items(){return[...u.keys()]},onMutate(e){return f.add(e),()=>{f.delete(e)}},reindex(e){T(e)&&m()},remove(e){E(e)&&m()},get revision(){return p},search(e,t){let n=P(t?.threshold??i,`threshold`,0,1),r=N(t?.limit??s,`limit`,0),a=N(t?.minQueryLength??l,`minQueryLength`,1);if(!e.trim())return[...u.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let c=o(e);if(!c)return[];let d=c.length<a?null:_(c),f=d===null?x(c):S(d),p=[];for(let e of f){let t=u.get(e);if(!t)continue;let r=C(c,d,t);if(r>=n){let n=w(c,t.values);p.push({item:e,matches:n,score:r})}}return p.sort((e,t)=>t.score-e.score).slice(0,r)},setItems(e){let t=new Set(e),n=[...t],r=!1;for(let e of[...u.keys()])t.has(e)||(E(e),r=!0);for(let e of n)u.has(e)?T(e)&&(r=!0):(b(e),r=!0);let i=[...u.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,u.get(e)]));u.clear();for(let[t,n]of e)u.set(t,n);r=!0}r&&m()},get size(){return u.size}}}var L=200;function R(e,t={}){let{debounce:n=L,limit:r,minQueryLength:o,threshold:s}=t;if(!Number.isFinite(n)||!Number.isInteger(n)||n<0)throw new a(`debounce must be a finite non-negative integer.`);let c=O(``,{name:`scout:query`}),l=O(``,{name:`scout:committedQuery`}),u=O(0,{name:`scout:indexVersion`}),d=e.onMutate(()=>{u.value++}),f=k(()=>c.value!==l.value,{name:`scout:isSearching`}),p=k(()=>(u.value,e.search(l.value,{limit:r,minQueryLength:o,threshold:s})),{name:`scout:results`}),m=null;function h(){m!==null&&(clearTimeout(m),m=null)}let g=c.subscribe(()=>{let e=c.peek();if(h(),e!==l.peek()){if(n===0){l.value=e;return}m=setTimeout(()=>{l.value=e,m=null},n)}});function _(){if(v)throw new i(`SearchState.clear() called after dispose()`);h(),A(()=>{c.value=``,l.value=``})}let v=!1,y=new AbortController;function b(){v=!0,y.abort(),h(),g(),d()}return{clear:_,get disposalSignal(){return y.signal},dispose:b,get disposed(){return v},isSearching:f,query:c,results:p,[Symbol.dispose](){b()}}}function z(e,t){let n=I(e,{fields:t.fields,limit:t.limit,minQueryLength:t.minQueryLength,threshold:t.threshold}),r=R(n,{debounce:t.debounce});return Object.assign(Object.create(r),{index:n})}function B(e){let t=H();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var V;function H(){return V===void 0&&(V=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),V}return e.ScoutConfigurationError=a,e.ScoutDisposedError=i,e.ScoutError=r,e.createIndex=I,e.createReactiveSearch=z,e.createSearch=R,e.findMatchRanges=c,e.highlight=l,e.highlightField=u,e.segmentWords=B,e.toFilterPredicate=n,e.toSearchMatcher=t,e})({});
1
+ var Scout=(function(e){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});function t(e,t){let n,r=-1,i=new Set;return(a,o)=>((o!==n||e.revision!==r)&&(n=o,r=e.revision,i=new Set(e.search(o,t).map(e=>e.item))),i.has(a))}function n(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var r=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},i=class extends r{},a=class extends r{};function o(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function s(e){return e==null?``:typeof e==`string`?e:typeof e==`number`||typeof e==`boolean`?String(e):Array.isArray(e)?e.filter(e=>typeof e==`string`||typeof e==`number`||typeof e==`boolean`).join(` `):``}function c(e,t){let n=e.toLowerCase(),r=o(t).split(` `).filter(Boolean),i=[];for(let e of r){let t=0;for(;t<n.length;){let r=n.indexOf(e,t);if(r===-1)break;i.push([r,r+e.length]),t=r+1}}i.sort((e,t)=>e[0]-t[0]);let a=[];for(let e of i){let t=a[a.length-1];t&&e[0]<=t[1]?t[1]=Math.max(t[1],e[1]):a.push([e[0],e[1]])}return a}function l(e,t){if(!e)return[];if(!t.length)return[{highlighted:!1,text:e}];let n=[],r=0;for(let[i,a]of t)i>r&&n.push({highlighted:!1,text:e.slice(r,i)}),a>i&&n.push({highlighted:!0,text:e.slice(i,a)}),r=a;return r<e.length&&n.push({highlighted:!1,text:e.slice(r)}),n}function u(e,t,n){return l(n,e.matches.find(e=>e.field===t)?.ranges??[])}var d=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},f=class extends d{},p=class extends d{},m=class extends d{},h=class extends d{},g=Symbol.for(`@vielzeug/ripple/reactive`),_=100,v=Symbol(`ripple.unset`),y=class{[g]=!0;dependents=new Set;name;runtime;constructor(e,t){this.runtime=e,this.name=t}subscribe(e){this.runtime.assertActive(),this.peek();let t={dependencies:new Set,onDependencyChanged:()=>this.runtime.enqueueListener(e)};return this.dependents.add(t),()=>this.dependents.delete(t)}notify(){for(let e of[...this.dependents])e.onDependencyChanged()}},b=class extends y{current;equals;constructor(e,t,n){super(e,n?.name),this.current=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.current}set value(e){if(this.runtime.assertActive(),this.equals(this.current,e))return;let t=this.current;this.current=e,this.runtime.emit({kind:`write`,name:this.name,next:e,previous:t}),this.runtime.propagate(()=>this.notify())}peek(){return this.current}update(e){this.value=e(this.current)}},x=class extends y{dependencies=new Set;computing=!1;disposed=!1;dirty=!0;current=v;derive;equals;constructor(e,t,n){super(e,n?.name),this.derive=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.refresh(),this.current}peek(){return this.refresh(),this.current}onDependencyChanged(){this.disposed||(this.dirty||=!0,this.dependents.size>0&&this.refresh()&&this.notify())}dispose(){this.disposed||(this.disposed=!0,this.runtime.clearDependencies(this),this.dependents.clear())}refresh(){if(!this.dirty||this.disposed)return!1;if(this.computing)throw new f(`computed cycle detected${this.name===void 0?``:` "${this.name}"`}`);this.computing=!0,this.runtime.emit({kind:`compute`,name:this.name});try{let e=this.runtime.collect(this,this.derive),t=this.current===v||!this.equals(this.current,e);return this.current=e,this.dirty=!1,t}finally{this.computing=!1}}},S=class{disposalController=new AbortController;owned=new Set;name;isDisposed=!1;runtime;constructor(e,t){this.runtime=e,this.name=t}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}run(e){if(this.isDisposed)throw new m(`Cannot run a disposed scope.`);return this.runtime.withScope(this,e)}dispose(){if(!this.isDisposed){this.isDisposed=!0;for(let e of[...this.owned].reverse())e.dispose();this.owned.clear(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.name,node:`scope`})}}[Symbol.dispose](){this.dispose()}},C=class{dependencies=new Set;disposalController=new AbortController;cleanup;isDisposed=!1;owner;scheduled=!1;callback;options;runtime;constructor(e,t,n){this.runtime=e,this.callback=t,this.options=n}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}onDependencyChanged(){if(!this.isDisposed){if(this.options?.scheduler===`microtask`){if(this.scheduled)return;this.scheduled=!0,queueMicrotask(()=>{this.scheduled=!1,this.isDisposed||this.runtime.enqueue(this)});return}this.runtime.enqueue(this)}}run(){if(this.isDisposed)return;this.owner?.dispose(),this.owner=void 0,this.runCleanup(),this.runtime.emit({kind:`effect`,name:this.options?.name});let e=new S(this.runtime);try{let t=this.runtime.withEffectScope(e,()=>this.runtime.collectEffect(this,this.callback));this.owner=e,this.cleanup=typeof t==`function`?t:void 0}catch(t){e.dispose(),this.runtime.report(t,{kind:`effect`,name:this.options?.name})}}dispose(){this.isDisposed||(this.isDisposed=!0,this.owner?.dispose(),this.owner=void 0,this.runtime.clearDependencies(this),this.runCleanup(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.options?.name,node:`effect`}))}[Symbol.dispose](){this.dispose()}runCleanup(){let e=this.cleanup;if(this.cleanup=void 0,e!==void 0)try{e()}catch(e){this.runtime.report(e,{kind:`cleanup`,name:this.options?.name})}}},w=class{activeEffectScope;activeObserver;activeScope;isDisposed=!1;flushDepth=0;flushing=!1;pending=new Set;listeners=new Set;rootScope;observer;onError;constructor(e){this.observer=e?.observer,this.onError=e?.onError??(e=>{queueMicrotask(()=>{throw e})}),this.rootScope=new S(this,`runtime`),this.activeScope=this.rootScope}get disposed(){return this.isDisposed}signal=(e,t)=>(this.assertActive(),new b(this,e,t));computed=(e,t)=>{this.assertActive();let n=new x(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n};effect=(e,t)=>{this.assertActive();let n=new C(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n.run(),n};createScope=e=>{this.assertActive();let t=new S(this,e);return this.activeScope.owned.add(t),t};batch=e=>(this.assertActive(),this.propagate(e));untrack=e=>(this.assertActive(),this.withObserver(void 0,e));dispose(){this.isDisposed||(this.isDisposed=!0,this.rootScope.dispose())}assertActive(){if(this.isDisposed)throw new p(`Cannot use a disposed Ripple runtime.`)}track(e){let t=this.activeObserver;t?.collecting!==void 0&&t.collecting.add(e)}clearDependencies(e){for(let t of e.dependencies)t.dependents.delete(e);e.dependencies.clear()}collect(e,t){return this.collectWith(e,t,e.dependencies.size===0)}collectEffect(e,t){return this.collectWith(e,t,!0)}withEffectScope(e,t){let n=this.activeEffectScope;this.activeEffectScope=e;try{return t()}finally{this.activeEffectScope=n}}withObserver(e,t){let n=this.activeObserver;this.activeObserver=e;try{return t()}finally{this.activeObserver=n}}withScope(e,t){let n=this.activeEffectScope,r=this.activeScope;this.activeEffectScope=void 0,this.activeScope=e;try{return t()}finally{this.activeEffectScope=n,this.activeScope=r}}enqueue(e){this.pending.add(e),this.flushDepth===0&&this.flush()}enqueueListener(e){this.listeners.add(e),this.flushDepth===0&&this.flush()}propagate(e){this.flushDepth++;try{return e()}finally{this.flushDepth--,this.flushDepth===0&&this.flush()}}emit(e){try{this.observer?.(e)}catch(t){this.report(t,{kind:`observer`,name:e.name})}}report(e,t){try{this.onError(e,t)}catch(e){queueMicrotask(()=>{throw e})}}collectWith(e,t,n){let r=this.activeObserver,i=new Set;e.collecting=i,this.activeObserver=e;try{let n=t();return this.commitDependencies(e,i),n}catch(t){throw n&&this.commitDependencies(e,i),t}finally{e.collecting=void 0,this.activeObserver=r}}commitDependencies(e,t){for(let n of e.dependencies)t.has(n)||n.dependents.delete(e);for(let n of t)e.dependencies.has(n)||n.dependents.add(e);e.dependencies.clear();for(let n of t)e.dependencies.add(n)}flush(){if(this.flushing)return;this.flushing=!0;let e=0;try{for(;this.pending.size>0||this.listeners.size>0;){if(++e>_)throw new h(`infinite reactive flush (>${_} iterations)`);let t=[...this.pending],n=[...this.listeners];this.pending.clear(),this.listeners.clear();for(let e of t)e.run();for(let e of n)try{e()}catch(e){this.report(e,{kind:`listener`})}}}finally{this.flushing=!1}}},T=e=>(t,n,r)=>{let i=e.signal({status:`pending`},{name:r?.name}),a=e.signal(0),o,s=!1,c=()=>{a.value,o?.abort();let e=i.peek(),r=e.status===`success`?e.value:`previous`in e?e.previous:void 0,c;try{c=t()}catch(e){i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`};return}let l=new AbortController;o=l,i.value=r===void 0?{status:`pending`}:{previous:r,status:`pending`};let u;try{u=Promise.resolve(n(c,{signal:l.signal}))}catch(e){u=Promise.reject(e)}u.then(e=>{!s&&!l.signal.aborted&&(i.value={status:`success`,value:e})},e=>{!s&&!l.signal.aborted&&(i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`})})},l=e.effect(()=>(c(),()=>o?.abort()),{name:r?.name});l.disposalSignal.addEventListener(`abort`,()=>{s=!0},{once:!0});let u={get disposalSignal(){return l.disposalSignal},dispose:()=>l.dispose(),get disposed(){return s},get name(){return i.name},peek:()=>i.peek(),reload:()=>{s||(a.value=a.peek()+1)},subscribe:e=>i.subscribe(e),[Symbol.dispose](){this.dispose()},get value(){return i.value}};return Object.defineProperty(u,g,{value:!0}),u},E=e=>(t,n,r)=>{let i=typeof t==`function`?t:()=>t.value,a=r?.equals??Object.is,o=!0,s,c=!1,l=e.effect(()=>{let e=i();if(o){o=!1,s=e,r?.immediate&&(n(e,void 0),r?.once&&(c=!0));return}if(a(s,e))return;let t=s;s=e,n(e,t),r?.once&&l.dispose()},{name:r?.name});return c&&l.dispose(),l},D=(e=>{let t=new w(e),n=T(t);return{batch:t.batch,computed:t.computed,createScope:t.createScope,dispose:()=>t.dispose(),get disposed(){return t.disposed},effect:t.effect,resource:n,signal:t.signal,untrack:t.untrack,watch:E(t)}})(),O=D.signal,k=D.computed;D.effect;var A=D.batch;D.createScope,D.untrack,D.watch,D.resource;function j(e){let t=new Set,n=` ${e} `;for(let e=0;e<n.length-2;e++)t.add(n.slice(e,e+3));return t}function M(e,t){if(e.size===0||t.size===0)return 0;let n=0;for(let r of e)t.has(r)&&n++;return n<2&&n<e.size?0:n/Math.min(e.size,t.size)}function N(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new a(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function P(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new a(`${t} must be a finite number between ${n} and ${r}.`);return e}function F(e){return e.map(e=>typeof e==`string`?{field:e,stringify:s,weight:1}:{field:e.field,stringify:e.stringify??s,weight:P(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function I(e,t){if(t.fields.length===0)throw new a(`createIndex: at least one field is required.`);let n=F(t.fields),r=n.reduce((e,t)=>Math.max(e,t.weight),1),i=P(t.threshold??.2,`threshold`,0,1),s=N(t.limit??50,`limit`,0),l=N(t.minQueryLength??3,`minQueryLength`,1),u=new Map,d=new Map,f=new Set,p=0;function m(){p++;for(let e of f)e()}let h=null,g=null;function _(e){return e===h&&g!==null?g:(h=e,g=j(e),g)}function v(e,t){for(let n of t){let t=d.get(n);t||(t=new Set,d.set(n,t)),t.add(e)}}function y(e,t){for(let n of t){let t=d.get(n);t&&(t.delete(e),t.size===0&&d.delete(n))}}function b(e){let t=new Map,r=new Map;for(let{field:i,stringify:a}of n){let n=e[i],s=a(n),c=o(s),l=c.length>=1?j(c):new Set;t.set(i,l),r.set(i,s),v(e,l)}u.set(e,{trigrams:t,values:r})}function x(e){let t=new Set;for(let[n,r]of u)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function S(e){let t=new Set;for(let n of e){let e=d.get(n);if(e)for(let n of e)t.add(n)}return t}function C(e,t,i){let a=0;for(let{field:o,weight:s}of n){let n;if(t===null)n=+!!(i.values.get(o)??``).toLowerCase().includes(e);else{let e=i.trigrams.get(o);if(!e||e.size===0)continue;n=M(t,e)}let c=s/r*n;c>a&&(a=c)}return a}function w(e,t){let r=[];for(let{field:i}of n){let n=t.get(i);if(!n)continue;let a=c(n,e);a.length>0&&r.push({field:i,ranges:a})}return r}function T(e){let t=u.get(e);if(!t)return!1;let r=!1;for(let{field:i,stringify:a}of n){let n=a(e[i]);if(n===t.values.get(i))continue;r=!0;let s=t.trigrams.get(i);s&&y(e,s);let c=o(n),l=c.length>=1?j(c):new Set;t.trigrams.set(i,l),t.values.set(i,n),v(e,l)}return r}function E(e){let t=u.get(e);if(!t)return!1;for(let n of t.trigrams.values())y(e,n);return u.delete(e),!0}for(let t of e)u.has(t)||b(t);return{add(e){u.has(e)||(b(e),m())},get items(){return[...u.keys()]},onMutate(e){return f.add(e),()=>{f.delete(e)}},reindex(e){T(e)&&m()},remove(e){E(e)&&m()},get revision(){return p},search(e,t){let n=P(t?.threshold??i,`threshold`,0,1),r=N(t?.limit??s,`limit`,0),a=N(t?.minQueryLength??l,`minQueryLength`,1);if(!e.trim())return[...u.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let c=o(e);if(!c)return[];let d=c.length<a?null:_(c),f=d===null?x(c):S(d),p=[];for(let e of f){let t=u.get(e);if(!t)continue;let r=C(c,d,t);if(r>=n){let n=w(c,t.values);p.push({item:e,matches:n,score:r})}}return p.sort((e,t)=>t.score-e.score).slice(0,r)},setItems(e){let t=new Set(e),n=[...t],r=!1;for(let e of[...u.keys()])t.has(e)||(E(e),r=!0);for(let e of n)u.has(e)?T(e)&&(r=!0):(b(e),r=!0);let i=[...u.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,u.get(e)]));u.clear();for(let[t,n]of e)u.set(t,n);r=!0}r&&m()},get size(){return u.size}}}var L=200;function R(e,t={}){let{debounce:n=L,limit:r,minQueryLength:o,threshold:s}=t;if(!Number.isFinite(n)||!Number.isInteger(n)||n<0)throw new a(`debounce must be a finite non-negative integer.`);let c=O(``,{name:`scout:query`}),l=O(``,{name:`scout:committedQuery`}),u=O(0,{name:`scout:indexVersion`}),d=e.onMutate(()=>{u.value++}),f=k(()=>c.value!==l.value,{name:`scout:isSearching`}),p=k(()=>(u.value,e.search(l.value,{limit:r,minQueryLength:o,threshold:s})),{name:`scout:results`}),m=null;function h(){m!==null&&(clearTimeout(m),m=null)}let g=c.subscribe(()=>{let e=c.peek();if(h(),e!==l.peek()){if(n===0){l.value=e;return}m=setTimeout(()=>{l.value=e,m=null},n)}});function _(){if(v)throw new i(`SearchState.clear() called after dispose()`);h(),A(()=>{c.value=``,l.value=``})}let v=!1,y=new AbortController;function b(){v=!0,y.abort(),h(),g(),d()}return{clear:_,get disposalSignal(){return y.signal},dispose:b,get disposed(){return v},isSearching:f,query:c,results:p,[Symbol.dispose](){b()}}}function z(e,t){let n=I(e,{fields:t.fields,limit:t.limit,minQueryLength:t.minQueryLength,threshold:t.threshold}),r=R(n,{debounce:t.debounce});return Object.assign(Object.create(r),{index:n})}function B(e){let t=H();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var V;function H(){return V===void 0&&(V=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),V}return e.ScoutConfigurationError=a,e.ScoutDisposedError=i,e.ScoutError=r,e.createIndex=I,e.createReactiveSearch=z,e.createSearch=R,e.findMatchRanges=c,e.highlight=l,e.highlightField=u,e.segmentWords=B,e.toFilterPredicate=n,e.toSearchMatcher=t,e})({});
2
2
  //# sourceMappingURL=scout.iife.js.map