@devisfuture/mega-collection 2.4.3 → 2.4.4

package/dist/filter/index.mjs

@@ -1 +1,908 @@
-import {a,b}from'../chunk-MB56OSRQ.mjs';var v=class{constructor(e={indexes:new Map,itemPositions:new Map}){this.storage=e;}addItems(e){if(!(e.length===0||this.storage.indexes.size===0))for(let t=0;t<e.length;t++)this.addItem(e[t]);}buildIndex(e,t){let i=new Map,s=new Map;for(let n=0,r=e.length;n<r;n++){let l=e[n],a=l[t];if(a==null)continue;let d=i.get(a);if(d)d.push(l),s.get(a).set(l,d.length-1);else {i.set(a,[l]);let o=new WeakMap;o.set(l,0),s.set(a,o);}}this.storage.indexes.set(t,i),this.storage.itemPositions.set(t,s);}getByValue(e,t){let i=this.storage.indexes.get(e);return i?i.get(t)??[]:[]}getByValues(e,t){let i=this.storage.indexes.get(e);if(!i)return [];if(t.length===1)return i.get(t[0])??[];if(t.length===2){let n=i.get(t[0]),r=i.get(t[1]);return n?r?n.concat(r):n:r??[]}let s=[];for(let n=0;n<t.length;n++){let r=i.get(t[n]);if(r!==void 0)for(let l=0;l<r.length;l++)s.push(r[l]);}return s}hasIndex(e){return this.storage.indexes.has(e)}addItem(e){for(let t of this.storage.indexes.keys())this.addItemToField(t,e);}updateItem(e,t){for(let i of this.storage.indexes.keys())this.updateItemInField(i,e,t);}removeItem(e){for(let t of this.storage.indexes.keys())this.removeItemFromField(t,e);}clear(){this.storage.indexes.clear(),this.storage.itemPositions.clear();}getIndexMap(e){return this.storage.indexes.get(e)}removeItemFromField(e,t){let i=t[e];if(i==null)return;let s=this.storage.indexes.get(e),n=this.storage.itemPositions.get(e),r=s?.get(i),l=n?.get(i),a=l?.get(t);if(!s||!n||!r||!l||a===void 0)return;let d=r.length-1,o=r[d];a!==d&&(r[a]=o,l.set(o,a)),r.pop(),l.delete(t),r.length===0&&(s.delete(i),n.delete(i));}updateItemInField(e,t,i){let s=t[e],n=i[e];if(s===n){if(s==null)return;this.replaceItemReferenceInField(e,s,t,i);return}this.removeItemFromField(e,t),this.addItemToField(e,i);}replaceItemReferenceInField(e,t,i,s){let n=this.storage.indexes.get(e),r=this.storage.itemPositions.get(e),l=n?.get(t),a=r?.get(t),d=a?.get(i);!l||!a||d===void 0||(l[d]=s,a.delete(i),a.set(s,d));}addItemToField(e,t){let i=t[e];if(i==null)return;let s=this.storage.indexes.get(e),n=this.storage.itemPositions.get(e);if(!s||!n)return;let r=s.get(i),l=n.get(i);if(r&&l){r.push(t),l.set(t,r.length-1);return}s.set(i,[t]);let a=new WeakMap;a.set(t,0),n.set(i,a);}};var V=()=>({indexedFields:new Set,indexerStorage:{indexes:new Map,itemPositions:new Map},nestedStorage:{indexes:new Map,itemPositions:new Map},deferredMutationVersion:null,mutableExclude:{datasetPositions:new Map,valueCounts:new Map,duplicateValueCount:0,hasDuplicateValues:false},sequentialCache:{previousResult:null,previousCriteria:null,previousCriteriaKey:null,previousBaseData:null,previousResultsByCriteria:new Map,previousResultSet:null}});function x(h){return {value:h,enumerable:false,configurable:true,writable:true}}var T=class{constructor(e){this.callbacks=e;}create(e){let t=e;return Object.defineProperties(t,{filter:x((i,s)=>s===void 0?this.callbacks.filter(e,i):this.callbacks.filter(i,s)),add:x(i=>this.callbacks.add(i)),update:x(i=>this.callbacks.update(i)),clearIndexes:x(()=>this.callbacks.clearIndexes()),data:x(i=>this.callbacks.data(i)),getOriginData:x(()=>this.callbacks.getOriginData()),clearData:x(()=>this.callbacks.clearData()),resetFilterState:x(()=>this.callbacks.resetFilterState())}),t}};var m=class h extends Error{constructor(e){super(e),this.name="FilterEngineError";}static missingDatasetForBuildIndex(){return new h("FilterEngine: no dataset in memory. Call data() or add() before buildIndex().")}static missingDatasetForFilter(){return new h("FilterEngine: no dataset in memory. Call data() or add() before filter().")}static duplicateMutableExcludeField(e){return new h(`FilterEngine: cannot use mutable exclude on field \`${e}\` because it contains duplicate values.`)}};function y(h){let e=new Map;for(let i=0;i<h.length;i++){let s=h[i],n=Array.isArray(s.values),r=w(s.exclude),l=r!==null,a=n?P(s.values,r):null;if(!n&&!l)continue;let d=s.field,o=e.get(d);if(!o){e.set(d,{field:s.field,values:[],exclude:[],hasValues:n,hasExclude:l,includedValues:a?new Set(a):null,excludedValues:r?new Set(r):null,cacheKeySegment:""});continue}if(n)if(!o.hasValues)o.hasValues=true,o.includedValues=new Set(a);else for(let u of o.includedValues)a.has(u)||o.includedValues.delete(u);if(l)if(!o.hasExclude)o.hasExclude=true,o.excludedValues=new Set(r);else for(let u of r)o.excludedValues.add(u);}let t=[...e.values()].sort((i,s)=>i.field.localeCompare(s.field));for(let i=0;i<t.length;i++)D(t[i]);return t}function C(h,e){return !(h.hasValues&&!h.includedValues.has(e)||h.hasExclude&&h.excludedValues.has(e))}function M(h){return h.hasValues&&h.values.length===0}function w(h){return !Array.isArray(h)||h.length===0?null:new Set(h)}function P(h,e){let t=new Set;for(let i=0;i<h.length;i++){let s=h[i];e?.has(s)||t.add(s);}return t}function D(h){if(h.hasValues&&h.hasExclude)for(let e of h.excludedValues)h.includedValues.delete(e);h.values=h.includedValues?[...h.includedValues]:[],h.exclude=h.excludedValues?[...h.excludedValues]:[],h.cacheKeySegment=B(h);}function B(h){let e=h.field;return e+=`|hv:${h.hasValues?"1":"0"}|v:`,h.hasValues&&(e+=R(h.values)),e+=`|hx:${h.hasExclude?"1":"0"}|x:`,h.hasExclude&&(e+=R(h.exclude)),e}function R(h){return h.length===0?"":h.map(e=>q(e)).sort().join(",")}function q(h){if(h===null)return "null:null";let e=typeof h;return e==="object"?`object:${JSON.stringify(h)}`:`${e}:${String(h)}`}var k="deferFilterMutationIndexUpdates";var I=class{constructor(e={indexes:new Map,itemPositions:new Map}){this.storage=e;this.registeredFields=new Set;this.fieldDescriptors=new Map;}registerFields(e){if(e?.length)for(let t=0;t<e.length;t++)this.registerField(e[t]);}hasRegisteredFields(){return this.registeredFields.size>0}hasField(e){return this.registeredFields.has(e)}clearIndexes(){this.storage.indexes.clear(),this.storage.itemPositions.clear();}buildIndexes(e){this.storage.indexes.clear(),this.storage.itemPositions.clear();for(let t of this.registeredFields)this.buildIndex(e,t);}addItems(e){if(!(e.length===0||this.storage.indexes.size===0))for(let t=0;t<e.length;t++)this.addItem(e[t]);}removeItem(e){for(let t of this.storage.indexes.keys())this.removeItemFromIndex(t,e);}updateItem(e,t){for(let i of this.storage.indexes.keys())this.updateItemInIndex(i,e,t);}filter(e,t,i){let s=this.resolveCriteria(t);if(e.length===0||s.length===0)return e;let n=[],r=[];for(let a=0;a<s.length;a++){let d=s[a];if(this.storage.indexes.has(d.field)){n.push(d);continue}r.push(d);}let l=e;if(n.length>0&&(l=this.filterByIndexes(n,e,i),l.length===0))return l;for(let a=0;a<r.length;a++)if(l=this.filterLinearly(l,r[a]),l.length===0)return l;return l}resolveCriteria(e){if(e.length===0)return [];let t=e[0];return "hasValues"in t&&"hasExclude"in t&&"includedValues"in t?e:y(e)}registerField(e){let t=this.createDescriptor(e);t&&(this.registeredFields.add(e),this.fieldDescriptors.set(e,t));}createDescriptor(e){let t=e.indexOf(".");return t===-1?null:{collectionKey:e.substring(0,t),nestedKey:e.substring(t+1)}}buildIndex(e,t){let i=this.fieldDescriptors.get(t);if(!i)return;let{collectionKey:s,nestedKey:n}=i,r=new Map,l=new Map;for(let a=0,d=e.length;a<d;a++){let o=e[a],u=o[s];if(Array.isArray(u))for(let f=0;f<u.length;f++){let c=u[f][n];if(c==null)continue;let p=r.get(c);if(p){p[p.length-1]!==o&&(p.push(o),l.get(c).set(o,p.length-1));continue}r.set(c,[o]);let g=new WeakMap;g.set(o,0),l.set(c,g);}}this.storage.indexes.set(t,r),this.storage.itemPositions.set(t,l);}removeItemFromIndex(e,t){let i=this.fieldDescriptors.get(e),s=this.storage.indexes.get(e),n=this.storage.itemPositions.get(e);if(!i||!s||!n)return;let{collectionKey:r,nestedKey:l}=i,a=t[r];if(!Array.isArray(a)||a.length===0)return;let d=new Set;for(let o=0;o<a.length;o++){let u=a[o][l];u!=null&&d.add(u);}for(let o of d){let u=s.get(o),f=n.get(o),c=f?.get(t);if(!u||!f||c===void 0)continue;let p=u.length-1,g=u[p];c!==p&&(u[c]=g,f.set(g,c)),u.pop(),f.delete(t),u.length===0&&(s.delete(o),n.delete(o));}}addItem(e){for(let t of this.storage.indexes.keys())this.addItemToIndex(t,e);}addItemToIndex(e,t){let i=this.fieldDescriptors.get(e),s=this.storage.indexes.get(e),n=this.storage.itemPositions.get(e);if(!i||!s||!n)return;let{collectionKey:r,nestedKey:l}=i,a=t[r];if(!Array.isArray(a)||a.length===0)return;let d=new Set;for(let o=0;o<a.length;o++){let u=a[o][l];u!=null&&d.add(u);}for(let o of d){let u=s.get(o),f=n.get(o);if(u&&f){u.push(t),f.set(t,u.length-1);continue}s.set(o,[t]);let c=new WeakMap;c.set(t,0),n.set(o,c);}}updateItemInIndex(e,t,i){let s=this.fieldDescriptors.get(e),n=this.storage.indexes.get(e),r=this.storage.itemPositions.get(e);if(!s||!n||!r)return;let l=this.collectUniqueValues(i,s),a=this.collectUniqueValues(t,s);if(this.areValueSetsEqual(l,a)){for(let d of l){let o=n.get(d),u=r.get(d),f=u?.get(i);!o||!u||f===void 0||(o[f]=t,u.delete(i),u.set(t,f));}return}this.removeItemFromIndex(e,i),this.addItemToIndex(e,t);}collectUniqueValues(e,t){let{collectionKey:i,nestedKey:s}=t,n=e[i],r=new Set;if(!Array.isArray(n)||n.length===0)return r;for(let l=0;l<n.length;l++){let a=n[l][s];a!=null&&r.add(a);}return r}areValueSetsEqual(e,t){if(e.size!==t.size)return  false;for(let i of e)if(!t.has(i))return  false;return  true}filterByIndexes(e,t,i){let s=e.filter(o=>o.hasValues),n=e.filter(o=>o.hasExclude),r=t===i?null:new Set(t);if(s.length===0)return this.applyIndexedExclusions(t,n);if(s.length===1){let o=this.storage.indexes.get(s[0].field);if(!o)return [];let u=this.getItemsByValues(o,s[0].values);if(u.length===0)return [];let f=[];for(let c=0;c<u.length;c++){let p=u[c];r&&!r.has(p)||f.push(p);}return this.applyIndexedExclusions(f,n)}let l=s.map(o=>({criterion:o,size:this.estimateIndexSize(o)})).sort((o,u)=>o.size-u.size),a=r,d=[];for(let o=0;o<l.length;o++){let{criterion:u}=l[o],f=this.storage.indexes.get(u.field);if(!f)return [];let c=this.getItemsByValues(f,u.values);if(c.length===0)return [];if(a===null)d=c;else {d=[];for(let p=0;p<c.length;p++){let g=c[p];a.has(g)&&d.push(g);}}if(d.length===0)return [];a=new Set(d);}return this.applyIndexedExclusions(d,n)}getItemsByValues(e,t){if(t.length===1)return e.get(t[0])??[];let i=new Set,s=[];for(let n=0;n<t.length;n++){let r=e.get(t[n]);if(r)for(let l=0;l<r.length;l++){let a=r[l];i.has(a)||(i.add(a),s.push(a));}}return s}estimateIndexSize(e){let t=this.storage.indexes.get(e.field);return t?e.values.reduce((i,s)=>{let n=t.get(s);return n?i+n.length:i},0):1/0}filterLinearly(e,t){let i=this.fieldDescriptors.get(t.field);if(!i)return e;let{collectionKey:s,nestedKey:n}=i,r=[];for(let l=0;l<e.length;l++){let a=e[l],d=a[s];if(!Array.isArray(d))continue;let o=!t.hasValues,u=false;for(let f=0;f<d.length;f++){let c=d[f][n];if(t.hasExclude&&t.excludedValues.has(c)){u=true;break}t.hasValues&&t.includedValues.has(c)&&(o=true);}!u&&o&&r.push(a);}return r}applyIndexedExclusions(e,t){if(t.length===0||e.length===0)return e;let i=new Set;for(let n=0;n<t.length;n++){let r=t[n],l=this.storage.indexes.get(r.field);if(!l)continue;let a=this.getItemsByValues(l,r.exclude);for(let d=0;d<a.length;d++)i.add(a[d]);}if(i.size===0)return e;let s=[];for(let n=0;n<e.length;n++){let r=e[n];i.has(r)||s.push(r);}return s}};var F=class{constructor(e={}){this.chainBuilder=new T({filter:(e,t)=>t===void 0?this.filter(e):this.filter(e,t),getOriginData:()=>this.getOriginData(),add:e=>this.add(e),update:e=>this.update(e),data:e=>this.data(e),clearIndexes:()=>this.clearIndexes(),clearData:()=>this.clearData(),resetFilterState:()=>this.resetFilterState()});this.mutableExcludeField=e.mutableExcludeField??null,this.state=e.state??new a(e.data??[],{filterByPreviousResult:e.filterByPreviousResult??false}),e.state&&e.filterByPreviousResult&&this.state.setFilterByPreviousResult(true),this.filterByPreviousResult=this.state.isFilterByPreviousResultEnabled(),this.namespace=this.state.createNamespace("filter"),this.indexer=new v(this.runtime.indexerStorage),this.nestedCollection=new I(this.runtime.nestedStorage),this.nestedCollection.registerFields(e.nestedFields),this.state.subscribe(s=>this.handleStateMutation(s)),this.rebuildMutableExcludeState();let t=e.fields?.length,i=this.nestedCollection.hasRegisteredFields();if(t)for(let s of e.fields)this.indexedFields.add(s);this.dataset.length>0&&(t||i)&&this.rebuildConfiguredIndexes();}get dataset(){return this.state.getOriginData()}get runtime(){return this.state.getOrCreateScopedValue(this.namespace,"runtime",V)}get mutableExcludeState(){return this.runtime.mutableExclude}get indexedFields(){return this.runtime.indexedFields}get sequentialCache(){return this.runtime.sequentialCache}shouldDeferMutationIndexUpdates(){return this.state.getScopedValue(b,k)===true}markDeferredMutationState(){this.runtime.deferredMutationVersion=this.state.getMutationVersion(),this.indexer.clear(),this.nestedCollection.clearIndexes(),this.clearMutableExcludeState(),this.resetFilterState();}ensureRuntimeReady(){this.runtime.deferredMutationVersion!==null&&(this.runtime.deferredMutationVersion=null,this.rebuildMutableExcludeState(),this.dataset.length>0&&(this.indexedFields.size>0||this.nestedCollection.hasRegisteredFields())&&this.rebuildConfiguredIndexes());}rebuildConfiguredIndexes(){this.indexer.clear(),this.nestedCollection.clearIndexes();for(let e of this.indexedFields)this.buildIndex(this.dataset,e);this.nestedCollection.hasRegisteredFields()&&this.nestedCollection.buildIndexes(this.dataset);}buildIndex(e,t){if(!Array.isArray(e)){if(!this.dataset.length)throw m.missingDatasetForBuildIndex();return this.indexer.buildIndex(this.dataset,e),this}return this.resetFilterState(),this.rebuildMutableExcludeState(),this.indexer.buildIndex(e,t),this}clearIndexes(){return this.indexer.clear(),this.nestedCollection.clearIndexes(),this}resetFilterState(){return this.sequentialCache.previousResult=null,this.sequentialCache.previousCriteria=null,this.sequentialCache.previousCriteriaKey=null,this.sequentialCache.previousBaseData=null,this.sequentialCache.previousResultsByCriteria.clear(),this.sequentialCache.previousResultSet=null,this.state.clearPreviousResult(),this}clearData(){return this.state.clearData(),this}data(e){return this.state.data(e),this}add(e){return this.state.add(e),this}update(e){return this.state.update(e),this}applyAddedItems(e,t){return e.length===0?this:(this.updateMutableExcludeStateForAddedItems(e,t),this.resetFilterState(),this.indexer.addItems(e),this.nestedCollection.addItems(e),this)}getOriginData(){return this.state.getOriginData()}filter(e,t){return t===void 0?this.withChain(this.rawFilter(e)):this.withChain(this.rawFilter(e,t))}rawFilter(e,t){this.ensureRuntimeReady();let i=t===void 0;if(i&&!this.dataset.length)throw m.missingDatasetForFilter();let s=y(i?e:t),n=i?this.dataset:e;if(i){let c=this.applyMutableExclude(s);if(c!==void 0)return c}let r=n,l=s;if(this.filterByPreviousResult){let c=this.resolveWithSequentialCache(n,i,s);if(c.isFromCache)return c.result;r=c.sourceData,l=c.executionCriteria;}if(s.length===0)return this.filterByPreviousResult&&this.resetFilterState(),n;for(let c=0;c<l.length;c++)if(M(l[c]))return this.createEmptyResult(i,n,s);let a=[],d=[];for(let c=0;c<l.length;c++){let p=l[c];this.nestedCollection.hasField(p.field)?a.push(p):d.push(p);}if(a.length>0&&(r=this.nestedCollection.filter(r,a,this.dataset),r.length===0))return this.createEmptyResult(i,n,s);if(d.length===0)return this.storePreviousResult(r,i,n,s),r;let o=[],u=[];for(let c=0;c<d.length;c++){let p=d[c];this.indexer.hasIndex(p.field)?o.push(p):u.push(p);}let f;if(o.length>0&&u.length===0)return f=this.filterViaIndex(o,r),this.storePreviousResult(f,i,n,s),f;if(o.length>0&&u.length>0){let c=this.filterViaIndex(o,r);return f=this.linearFilter(c,u),this.storePreviousResult(f,i,n,s),f}return f=this.linearFilter(r,d),this.storePreviousResult(f,i,n,s),f}resolveWithSequentialCache(e,t,i){let{previousResult:s,previousCriteria:n,previousCriteriaKey:r,previousBaseData:l,previousResultsByCriteria:a}=this.sequentialCache;if(s===null||n===null||l!==e)return {isFromCache:false,sourceData:e,executionCriteria:i};let d=this.createCriteriaCacheKey(i),o=a.get(d);if(d===r)return {isFromCache:true,result:s};if(o!==void 0)return this.storePreviousResult(o.result,t,e,i,d,o.resultSet),{isFromCache:true,result:o.result};let u=this.hasCriteriaBacktrack(n,i)||s.length===0&&!this.canApplySequentiallyToEmptyResult(n,i);return {isFromCache:false,sourceData:u?e:s,executionCriteria:u?i:this.createSequentialExecutionCriteria(n,i)}}withChain(e){return this.chainBuilder.create(e)}handleStateMutation(e){if(this.shouldDeferMutationIndexUpdates()&&(e.type==="add"||e.type==="update")){this.markDeferredMutationState();return}switch(e.type){case "add":this.applyAddedItems(e.items,e.startIndex);return;case "update":this.applyUpdatedItem(e.index,e.previousItem,e.nextItem);return;case "data":this.runtime.deferredMutationVersion=null,this.rebuildMutableExcludeState(),this.resetFilterState(),this.rebuildConfiguredIndexes();return;case "clearData":this.runtime.deferredMutationVersion=null,this.clearMutableExcludeState(),this.indexer.clear(),this.nestedCollection.clearIndexes(),this.resetFilterState();return;case "remove":this.applyRemovedItem(e.field,e.value,e.removedItem,e.removedIndex,e.movedItem);return;case "removeMany":this.applyRemovedItems(e.field,e.entries);return}}rebuildMutableExcludeState(){if(this.clearMutableExcludeState(),this.mutableExcludeField!==null)for(let e=0;e<this.dataset.length;e++){let i=this.dataset[e][this.mutableExcludeField];i!=null&&this.registerMutableExcludeValue(i,e);}}updateMutableExcludeStateForAddedItems(e,t){if(this.mutableExcludeField!==null)for(let i=0;i<e.length;i++){let s=e[i][this.mutableExcludeField];s!=null&&this.registerMutableExcludeValue(s,t+i);}}applyMutableExclude(e){if(this.mutableExcludeField===null||e.length!==1)return;let t=e[0];if(!(t.field!==this.mutableExcludeField||t.hasValues||!t.hasExclude)){if(this.mutableExcludeState.hasDuplicateValues)throw m.duplicateMutableExcludeField(this.mutableExcludeField);return this.state.removeByFieldValues(this.mutableExcludeField,t.exclude),this.resetFilterState(),this.dataset}}applyUpdatedItem(e,t,i){this.updateMutableExcludeStateForUpdatedItem(e,t,i),this.resetFilterState(),this.indexer.updateItem(t,i),this.nestedCollection.updateItem(i,t);}applyRemovedItem(e,t,i,s,n){if(e===this.mutableExcludeField&&(this.unregisterMutableExcludeValue(t),this.mutableExcludeState.datasetPositions.delete(t),n!==null&&this.mutableExcludeField!==null)){let r=n[this.mutableExcludeField];r!=null&&this.mutableExcludeState.datasetPositions.set(r,s);}this.resetFilterState(),this.indexer.removeItem(i),this.nestedCollection.removeItem(i);}applyRemovedItems(e,t){for(let i=0;i<t.length;i++){let s=t[i];if(e===this.mutableExcludeField&&(this.unregisterMutableExcludeValue(s.value),this.mutableExcludeState.datasetPositions.delete(s.value),s.movedItem!==null&&this.mutableExcludeField!==null)){let n=s.movedItem[this.mutableExcludeField];n!=null&&this.mutableExcludeState.datasetPositions.set(n,s.removedIndex);}this.indexer.removeItem(s.removedItem),this.nestedCollection.removeItem(s.removedItem);}this.resetFilterState();}updateMutableExcludeStateForUpdatedItem(e,t,i){if(this.mutableExcludeField===null)return;let s=t[this.mutableExcludeField],n=i[this.mutableExcludeField];if(s===n){n!=null&&this.mutableExcludeState.datasetPositions.set(n,e);return}s!=null&&(this.unregisterMutableExcludeValue(s),this.mutableExcludeState.datasetPositions.get(s)===e&&this.mutableExcludeState.datasetPositions.delete(s)),n!=null&&this.registerMutableExcludeValue(n,e);}clearMutableExcludeState(){this.mutableExcludeState.datasetPositions.clear(),this.mutableExcludeState.valueCounts.clear(),this.mutableExcludeState.duplicateValueCount=0,this.mutableExcludeState.hasDuplicateValues=false;}registerMutableExcludeValue(e,t){let i=(this.mutableExcludeState.valueCounts.get(e)??0)+1;i===2&&this.mutableExcludeState.duplicateValueCount++,this.mutableExcludeState.valueCounts.set(e,i),this.mutableExcludeState.datasetPositions.set(e,t),this.mutableExcludeState.hasDuplicateValues=this.mutableExcludeState.duplicateValueCount>0;}unregisterMutableExcludeValue(e){let t=this.mutableExcludeState.valueCounts.get(e);t!==void 0&&(t===2&&this.mutableExcludeState.duplicateValueCount--,t<=1?this.mutableExcludeState.valueCounts.delete(e):this.mutableExcludeState.valueCounts.set(e,t-1),this.mutableExcludeState.hasDuplicateValues=this.mutableExcludeState.duplicateValueCount>0);}linearFilter(e,t){let i=[];for(let s=0;s<e.length;s++){let n=e[s],r=true;for(let l=0;l<t.length;l++){let a=t[l];if(!C(a,n[a.field])){r=false;break}}r&&i.push(n);}return i}filterViaIndex(e,t){let i=t!==this.dataset,s=null;if(i){if(t===this.sequentialCache.previousResult&&this.sequentialCache.previousResultSet!==null)s=this.sequentialCache.previousResultSet;else if(s=new Set(t),t===this.sequentialCache.previousResult){this.sequentialCache.previousResultSet=s;let u=this.sequentialCache.previousCriteriaKey;if(u!==null){let f=this.sequentialCache.previousResultsByCriteria.get(u);f&&(f.resultSet=s);}}}let n=[],r=[];for(let u=0;u<e.length;u++){let f=e[u];f.hasValues&&n.push(f),f.hasExclude&&r.push(f);}if(n.length===0)return this.applyIndexedExclusions(t,r);if(n.length===1){let u=n[0],f=false;for(let g=0;g<r.length;g++)if(r[g].field!==u.field){f=true;break}if(s===null&&!f)return u.values.length===1?this.indexer.getByValue(u.field,u.values[0]).slice():this.indexer.getByValues(u.field,u.values);let c=this.indexer.getByValues(u.field,u.values),p=[];for(let g=0;g<c.length;g++){let b=c[g];s&&!s.has(b)||p.push(b);}return this.applyIndexedExclusions(p,r)}let l=n[0],a=this.estimateIndexSize(l);for(let u=1;u<n.length;u++){let f=n[u],c=this.estimateIndexSize(f);c<a&&(l=f,a=c);}let d=this.indexer.getByValues(l.field,l.values);if(d.length===0)return [];let o=[];for(let u=0;u<d.length;u++){let f=d[u],c=true;if(!(s&&!s.has(f))){for(let p=0;p<n.length;p++){let g=n[p];if(g!==l&&!C(g,f[g.field])){c=false;break}}c&&o.push(f);}}return this.applyIndexedExclusions(o,r)}estimateIndexSize(e){let t=this.indexer.getIndexMap(e.field);if(!t)return 1/0;let i=0;for(let s=0;s<e.values.length;s++){let n=t.get(e.values[s]);n&&(i+=n.length);}return i}applyIndexedExclusions(e,t){if(t.length===0||e.length===0)return e;let i=new Set;for(let n=0;n<t.length;n++){let r=t[n],l=this.indexer.getIndexMap(r.field);if(l)for(let a=0;a<r.exclude.length;a++){let d=l.get(r.exclude[a]);if(d)for(let o=0;o<d.length;o++)i.add(d[o]);}}if(i.size===0)return e;let s=[];for(let n=0;n<e.length;n++){let r=e[n];i.has(r)||s.push(r);}return s}createEmptyResult(e,t,i){let s=[];return this.storePreviousResult(s,e,t,i),s}storePreviousResult(e,t,i,s,n=this.createCriteriaCacheKey(s),r){if(!this.filterByPreviousResult)return;let l=r===void 0?null:r;this.sequentialCache.previousResult=e,this.sequentialCache.previousCriteria=s,this.sequentialCache.previousCriteriaKey=n,this.sequentialCache.previousBaseData=t?this.dataset:i,this.sequentialCache.previousResultSet=l,this.state.setPreviousResult(e,t?this.dataset:i),this.sequentialCache.previousResultsByCriteria.set(n,this.createSequentialCacheEntry(e,l));}createCriteriaCacheKey(e){let t="";for(let i=0;i<e.length;i++)t+=e[i].cacheKeySegment,t+=";";return t}createSequentialCacheEntry(e,t){return {result:e,resultSet:t}}createSequentialExecutionCriteria(e,t){let i=new Map;for(let s=0;s<e.length;s++){let n=e[s];i.set(n.field,n);}return t.map(s=>{let n=i.get(s.field);if(!n||!n.hasValues||!s.hasValues||n.hasExclude||s.hasExclude||s.includedValues.size<=n.includedValues.size)return s;for(let l of n.includedValues)if(!s.includedValues.has(l))return s;let r=[];for(let l of s.includedValues)n.includedValues.has(l)||r.push(l);return r.length===0?s:{...s,values:r,includedValues:new Set(r)}})}hasCriteriaBacktrack(e,t){let i=this.createCriteriaStateMap(e),s=this.createCriteriaStateMap(t);for(let[n,r]of i){let l=s.get(n);if(!l||this.isCriterionBacktracked(r,l))return  true}return  false}canApplySequentiallyToEmptyResult(e,t){let i=this.createCriteriaStateMap(e),s=this.createCriteriaStateMap(t);for(let[n,r]of s){let l=i.get(n);if(l){if(l.hasValues!==r.hasValues&&(l.hasValues||!r.hasValues))return  false;if(l.hasValues&&r.hasValues){let a=l.includedValues,d=r.includedValues;if(!this.areSetsEqual(a,d)&&!this.isSubset(a,d))return  false}if(l.hasExclude!==r.hasExclude&&(l.hasExclude||!r.hasExclude))return  false;if(l.hasExclude&&r.hasExclude){let a=l.excludedValues,d=r.excludedValues;if(!this.areSetsEqual(a,d)&&!this.isSubset(a,d))return  false}}}return  true}createCriteriaStateMap(e){let t=new Map;for(let i=0;i<e.length;i++){let s=e[i];t.set(s.field,s);}return t}isCriterionBacktracked(e,t){if(e.hasValues&&!t.hasValues)return  true;if(e.hasValues&&t.hasValues){let i=e.includedValues,s=t.includedValues;if(!this.areSetsEqual(i,s))return this.isSubset(s,i)}if(!e.hasValues&&t.hasValues)return  false;if(e.hasExclude&&!t.hasExclude)return  true;if(!e.hasExclude&&t.hasExclude)return  false;if(e.hasExclude&&t.hasExclude){let i=e.excludedValues,s=t.excludedValues;if(!this.areSetsEqual(i,s))return this.isSubset(s,i)}return  false}isSubset(e,t){for(let i of e)if(!t.has(i))return  false;return  true}areSetsEqual(e,t){if(e===t)return  true;if(!e||!t||e.size!==t.size)return  false;for(let i of e)if(!t.has(i))return  false;return  true}};export{F as FilterEngine};
+import { n as e, t } from "../chunk-BTXXf5A-.mjs";
+//#region src/indexer.ts
+var n = class {
+	constructor(e = {
+		indexes: /* @__PURE__ */ new Map(),
+		itemPositions: /* @__PURE__ */ new Map()
+	}) {
+		this.storage = e;
+	}
+	addItems(e) {
+		if (!(e.length === 0 || this.storage.indexes.size === 0)) for (let t = 0; t < e.length; t++) this.addItem(e[t]);
+	}
+	buildIndex(e, t) {
+		let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
+		for (let i = 0, a = e.length; i < a; i++) {
+			let a = e[i], o = a[t];
+			if (o == null) continue;
+			let s = n.get(o);
+			if (s) s.push(a), r.get(o).set(a, s.length - 1);
+			else {
+				n.set(o, [a]);
+				let e = /* @__PURE__ */ new WeakMap();
+				e.set(a, 0), r.set(o, e);
+			}
+		}
+		this.storage.indexes.set(t, n), this.storage.itemPositions.set(t, r);
+	}
+	getByValue(e, t) {
+		let n = this.storage.indexes.get(e);
+		return n ? n.get(t) ?? [] : [];
+	}
+	getByValues(e, t) {
+		let n = this.storage.indexes.get(e);
+		if (!n) return [];
+		if (t.length === 1) return n.get(t[0]) ?? [];
+		if (t.length === 2) {
+			let e = n.get(t[0]), r = n.get(t[1]);
+			return e ? r ? e.concat(r) : e : r ?? [];
+		}
+		let r = [];
+		for (let e = 0; e < t.length; e++) {
+			let i = n.get(t[e]);
+			if (i !== void 0) for (let e = 0; e < i.length; e++) r.push(i[e]);
+		}
+		return r;
+	}
+	hasIndex(e) {
+		return this.storage.indexes.has(e);
+	}
+	addItem(e) {
+		for (let t of this.storage.indexes.keys()) this.addItemToField(t, e);
+	}
+	updateItem(e, t) {
+		for (let n of this.storage.indexes.keys()) this.updateItemInField(n, e, t);
+	}
+	removeItem(e) {
+		for (let t of this.storage.indexes.keys()) this.removeItemFromField(t, e);
+	}
+	clear() {
+		this.storage.indexes.clear(), this.storage.itemPositions.clear();
+	}
+	getIndexMap(e) {
+		return this.storage.indexes.get(e);
+	}
+	removeItemFromField(e, t) {
+		let n = t[e];
+		if (n == null) return;
+		let r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e), a = r?.get(n), o = i?.get(n), s = o?.get(t);
+		if (!r || !i || !a || !o || s === void 0) return;
+		let c = a.length - 1, l = a[c];
+		s !== c && (a[s] = l, o.set(l, s)), a.pop(), o.delete(t), a.length === 0 && (r.delete(n), i.delete(n));
+	}
+	updateItemInField(e, t, n) {
+		let r = t[e];
+		if (r === n[e]) {
+			if (r == null) return;
+			this.replaceItemReferenceInField(e, r, t, n);
+			return;
+		}
+		this.removeItemFromField(e, t), this.addItemToField(e, n);
+	}
+	replaceItemReferenceInField(e, t, n, r) {
+		let i = this.storage.indexes.get(e), a = this.storage.itemPositions.get(e), o = i?.get(t), s = a?.get(t), c = s?.get(n);
+		!o || !s || c === void 0 || (o[c] = r, s.delete(n), s.set(r, c));
+	}
+	addItemToField(e, t) {
+		let n = t[e];
+		if (n == null) return;
+		let r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e);
+		if (!r || !i) return;
+		let a = r.get(n), o = i.get(n);
+		if (a && o) {
+			a.push(t), o.set(t, a.length - 1);
+			return;
+		}
+		r.set(n, [t]);
+		let s = /* @__PURE__ */ new WeakMap();
+		s.set(t, 0), i.set(n, s);
+	}
+}, r = () => ({
+	indexedFields: /* @__PURE__ */ new Set(),
+	indexerStorage: {
+		indexes: /* @__PURE__ */ new Map(),
+		itemPositions: /* @__PURE__ */ new Map()
+	},
+	nestedStorage: {
+		indexes: /* @__PURE__ */ new Map(),
+		itemPositions: /* @__PURE__ */ new Map()
+	},
+	deferredMutationVersion: null,
+	mutableExclude: {
+		datasetPositions: /* @__PURE__ */ new Map(),
+		valueCounts: /* @__PURE__ */ new Map(),
+		duplicateValueCount: 0,
+		hasDuplicateValues: !1
+	},
+	sequentialCache: {
+		previousResult: null,
+		previousCriteria: null,
+		previousCriteriaKey: null,
+		previousBaseData: null,
+		previousResultsByCriteria: /* @__PURE__ */ new Map(),
+		previousResultSet: null
+	}
+});
+function i(e) {
+	return {
+		value: e,
+		enumerable: !1,
+		configurable: !0,
+		writable: !0
+	};
+}
+//#endregion
+//#region src/filter/chain.ts
+var a = class {
+	constructor(e) {
+		this.callbacks = e;
+	}
+	create(e) {
+		let t = e;
+		return Object.defineProperties(t, {
+			filter: i((t, n) => n === void 0 ? this.callbacks.filter(e, t) : this.callbacks.filter(t, n)),
+			add: i((e) => this.callbacks.add(e)),
+			update: i((e) => this.callbacks.update(e)),
+			clearIndexes: i(() => this.callbacks.clearIndexes()),
+			data: i((e) => this.callbacks.data(e)),
+			getOriginData: i(() => this.callbacks.getOriginData()),
+			clearData: i(() => this.callbacks.clearData()),
+			resetFilterState: i(() => this.callbacks.resetFilterState())
+		}), t;
+	}
+}, o = class e extends Error {
+	constructor(e) {
+		super(e), this.name = "FilterEngineError";
+	}
+	static missingDatasetForBuildIndex() {
+		return new e("FilterEngine: no dataset in memory. Call data() or add() before buildIndex().");
+	}
+	static missingDatasetForFilter() {
+		return new e("FilterEngine: no dataset in memory. Call data() or add() before filter().");
+	}
+	static duplicateMutableExcludeField(t) {
+		return new e(`FilterEngine: cannot use mutable exclude on field \`${t}\` because it contains duplicate values.`);
+	}
+};
+//#endregion
+//#region src/filter/criterion.ts
+function s(e) {
+	let t = /* @__PURE__ */ new Map();
+	for (let n = 0; n < e.length; n++) {
+		let r = e[n], i = Array.isArray(r.values), a = u(r.exclude), o = a !== null, s = i ? d(r.values, a) : null;
+		if (!i && !o) continue;
+		let c = r.field, l = t.get(c);
+		if (!l) {
+			t.set(c, {
+				field: r.field,
+				values: [],
+				exclude: [],
+				hasValues: i,
+				hasExclude: o,
+				includedValues: s ? new Set(s) : null,
+				excludedValues: a ? new Set(a) : null,
+				cacheKeySegment: ""
+			});
+			continue;
+		}
+		if (i) if (!l.hasValues) l.hasValues = !0, l.includedValues = new Set(s);
+		else for (let e of l.includedValues) s.has(e) || l.includedValues.delete(e);
+		if (o) if (!l.hasExclude) l.hasExclude = !0, l.excludedValues = new Set(a);
+		else for (let e of a) l.excludedValues.add(e);
+	}
+	let n = [...t.values()].sort((e, t) => e.field.localeCompare(t.field));
+	for (let e = 0; e < n.length; e++) f(n[e]);
+	return n;
+}
+function c(e, t) {
+	return !(e.hasValues && !e.includedValues.has(t) || e.hasExclude && e.excludedValues.has(t));
+}
+function l(e) {
+	return e.hasValues && e.values.length === 0;
+}
+function u(e) {
+	return !Array.isArray(e) || e.length === 0 ? null : new Set(e);
+}
+function d(e, t) {
+	let n = /* @__PURE__ */ new Set();
+	for (let r = 0; r < e.length; r++) {
+		let i = e[r];
+		t?.has(i) || n.add(i);
+	}
+	return n;
+}
+function f(e) {
+	if (e.hasValues && e.hasExclude) for (let t of e.excludedValues) e.includedValues.delete(t);
+	e.values = e.includedValues ? [...e.includedValues] : [], e.exclude = e.excludedValues ? [...e.excludedValues] : [], e.cacheKeySegment = p(e);
+}
+function p(e) {
+	let t = e.field;
+	return t += `|hv:${e.hasValues ? "1" : "0"}|v:`, e.hasValues && (t += m(e.values)), t += `|hx:${e.hasExclude ? "1" : "0"}|x:`, e.hasExclude && (t += m(e.exclude)), t;
+}
+function m(e) {
+	return e.length === 0 ? "" : e.map((e) => h(e)).sort().join(",");
+}
+function h(e) {
+	if (e === null) return "null:null";
+	let t = typeof e;
+	return t === "object" ? `object:${JSON.stringify(e)}` : `${t}:${String(e)}`;
+}
+//#endregion
+//#region src/filter/constants.ts
+var g = "deferFilterMutationIndexUpdates", _ = class {
+	constructor(e = {
+		indexes: /* @__PURE__ */ new Map(),
+		itemPositions: /* @__PURE__ */ new Map()
+	}) {
+		this.storage = e, this.registeredFields = /* @__PURE__ */ new Set(), this.fieldDescriptors = /* @__PURE__ */ new Map();
+	}
+	registerFields(e) {
+		if (e?.length) for (let t = 0; t < e.length; t++) this.registerField(e[t]);
+	}
+	hasRegisteredFields() {
+		return this.registeredFields.size > 0;
+	}
+	hasField(e) {
+		return this.registeredFields.has(e);
+	}
+	clearIndexes() {
+		this.storage.indexes.clear(), this.storage.itemPositions.clear();
+	}
+	buildIndexes(e) {
+		this.storage.indexes.clear(), this.storage.itemPositions.clear();
+		for (let t of this.registeredFields) this.buildIndex(e, t);
+	}
+	addItems(e) {
+		if (!(e.length === 0 || this.storage.indexes.size === 0)) for (let t = 0; t < e.length; t++) this.addItem(e[t]);
+	}
+	removeItem(e) {
+		for (let t of this.storage.indexes.keys()) this.removeItemFromIndex(t, e);
+	}
+	updateItem(e, t) {
+		for (let n of this.storage.indexes.keys()) this.updateItemInIndex(n, e, t);
+	}
+	filter(e, t, n) {
+		let r = this.resolveCriteria(t);
+		if (e.length === 0 || r.length === 0) return e;
+		let i = [], a = [];
+		for (let e = 0; e < r.length; e++) {
+			let t = r[e];
+			if (this.storage.indexes.has(t.field)) {
+				i.push(t);
+				continue;
+			}
+			a.push(t);
+		}
+		let o = e;
+		if (i.length > 0 && (o = this.filterByIndexes(i, e, n), o.length === 0)) return o;
+		for (let e = 0; e < a.length; e++) if (o = this.filterLinearly(o, a[e]), o.length === 0) return o;
+		return o;
+	}
+	resolveCriteria(e) {
+		if (e.length === 0) return [];
+		let t = e[0];
+		return "hasValues" in t && "hasExclude" in t && "includedValues" in t ? e : s(e);
+	}
+	registerField(e) {
+		let t = this.createDescriptor(e);
+		t && (this.registeredFields.add(e), this.fieldDescriptors.set(e, t));
+	}
+	createDescriptor(e) {
+		let t = e.indexOf(".");
+		return t === -1 ? null : {
+			collectionKey: e.substring(0, t),
+			nestedKey: e.substring(t + 1)
+		};
+	}
+	buildIndex(e, t) {
+		let n = this.fieldDescriptors.get(t);
+		if (!n) return;
+		let { collectionKey: r, nestedKey: i } = n, a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
+		for (let t = 0, n = e.length; t < n; t++) {
+			let n = e[t], s = n[r];
+			if (Array.isArray(s)) for (let e = 0; e < s.length; e++) {
+				let t = s[e][i];
+				if (t == null) continue;
+				let r = a.get(t);
+				if (r) {
+					r[r.length - 1] !== n && (r.push(n), o.get(t).set(n, r.length - 1));
+					continue;
+				}
+				a.set(t, [n]);
+				let c = /* @__PURE__ */ new WeakMap();
+				c.set(n, 0), o.set(t, c);
+			}
+		}
+		this.storage.indexes.set(t, a), this.storage.itemPositions.set(t, o);
+	}
+	removeItemFromIndex(e, t) {
+		let n = this.fieldDescriptors.get(e), r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e);
+		if (!n || !r || !i) return;
+		let { collectionKey: a, nestedKey: o } = n, s = t[a];
+		if (!Array.isArray(s) || s.length === 0) return;
+		let c = /* @__PURE__ */ new Set();
+		for (let e = 0; e < s.length; e++) {
+			let t = s[e][o];
+			t != null && c.add(t);
+		}
+		for (let e of c) {
+			let n = r.get(e), a = i.get(e), o = a?.get(t);
+			if (!n || !a || o === void 0) continue;
+			let s = n.length - 1, c = n[s];
+			o !== s && (n[o] = c, a.set(c, o)), n.pop(), a.delete(t), n.length === 0 && (r.delete(e), i.delete(e));
+		}
+	}
+	addItem(e) {
+		for (let t of this.storage.indexes.keys()) this.addItemToIndex(t, e);
+	}
+	addItemToIndex(e, t) {
+		let n = this.fieldDescriptors.get(e), r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e);
+		if (!n || !r || !i) return;
+		let { collectionKey: a, nestedKey: o } = n, s = t[a];
+		if (!Array.isArray(s) || s.length === 0) return;
+		let c = /* @__PURE__ */ new Set();
+		for (let e = 0; e < s.length; e++) {
+			let t = s[e][o];
+			t != null && c.add(t);
+		}
+		for (let e of c) {
+			let n = r.get(e), a = i.get(e);
+			if (n && a) {
+				n.push(t), a.set(t, n.length - 1);
+				continue;
+			}
+			r.set(e, [t]);
+			let o = /* @__PURE__ */ new WeakMap();
+			o.set(t, 0), i.set(e, o);
+		}
+	}
+	updateItemInIndex(e, t, n) {
+		let r = this.fieldDescriptors.get(e), i = this.storage.indexes.get(e), a = this.storage.itemPositions.get(e);
+		if (!r || !i || !a) return;
+		let o = this.collectUniqueValues(n, r), s = this.collectUniqueValues(t, r);
+		if (this.areValueSetsEqual(o, s)) {
+			for (let e of o) {
+				let r = i.get(e), o = a.get(e), s = o?.get(n);
+				!r || !o || s === void 0 || (r[s] = t, o.delete(n), o.set(t, s));
+			}
+			return;
+		}
+		this.removeItemFromIndex(e, n), this.addItemToIndex(e, t);
+	}
+	collectUniqueValues(e, t) {
+		let { collectionKey: n, nestedKey: r } = t, i = e[n], a = /* @__PURE__ */ new Set();
+		if (!Array.isArray(i) || i.length === 0) return a;
+		for (let e = 0; e < i.length; e++) {
+			let t = i[e][r];
+			t != null && a.add(t);
+		}
+		return a;
+	}
+	areValueSetsEqual(e, t) {
+		if (e.size !== t.size) return !1;
+		for (let n of e) if (!t.has(n)) return !1;
+		return !0;
+	}
+	filterByIndexes(e, t, n) {
+		let r = e.filter((e) => e.hasValues), i = e.filter((e) => e.hasExclude), a = t === n ? null : new Set(t);
+		if (r.length === 0) return this.applyIndexedExclusions(t, i);
+		if (r.length === 1) {
+			let e = this.storage.indexes.get(r[0].field);
+			if (!e) return [];
+			let t = this.getItemsByValues(e, r[0].values);
+			if (t.length === 0) return [];
+			let n = [];
+			for (let e = 0; e < t.length; e++) {
+				let r = t[e];
+				a && !a.has(r) || n.push(r);
+			}
+			return this.applyIndexedExclusions(n, i);
+		}
+		let o = r.map((e) => ({
+			criterion: e,
+			size: this.estimateIndexSize(e)
+		})).sort((e, t) => e.size - t.size), s = a, c = [];
+		for (let e = 0; e < o.length; e++) {
+			let { criterion: t } = o[e], n = this.storage.indexes.get(t.field);
+			if (!n) return [];
+			let r = this.getItemsByValues(n, t.values);
+			if (r.length === 0) return [];
+			if (s === null) c = r;
+			else {
+				c = [];
+				for (let e = 0; e < r.length; e++) {
+					let t = r[e];
+					s.has(t) && c.push(t);
+				}
+			}
+			if (c.length === 0) return [];
+			s = new Set(c);
+		}
+		return this.applyIndexedExclusions(c, i);
+	}
+	getItemsByValues(e, t) {
+		if (t.length === 1) return e.get(t[0]) ?? [];
+		let n = /* @__PURE__ */ new Set(), r = [];
+		for (let i = 0; i < t.length; i++) {
+			let a = e.get(t[i]);
+			if (a) for (let e = 0; e < a.length; e++) {
+				let t = a[e];
+				n.has(t) || (n.add(t), r.push(t));
+			}
+		}
+		return r;
+	}
+	estimateIndexSize(e) {
+		let t = this.storage.indexes.get(e.field);
+		return t ? e.values.reduce((e, n) => {
+			let r = t.get(n);
+			return r ? e + r.length : e;
+		}, 0) : Infinity;
+	}
+	filterLinearly(e, t) {
+		let n = this.fieldDescriptors.get(t.field);
+		if (!n) return e;
+		let { collectionKey: r, nestedKey: i } = n, a = [];
+		for (let n = 0; n < e.length; n++) {
+			let o = e[n], s = o[r];
+			if (!Array.isArray(s)) continue;
+			let c = !t.hasValues, l = !1;
+			for (let e = 0; e < s.length; e++) {
+				let n = s[e][i];
+				if (t.hasExclude && t.excludedValues.has(n)) {
+					l = !0;
+					break;
+				}
+				t.hasValues && t.includedValues.has(n) && (c = !0);
+			}
+			!l && c && a.push(o);
+		}
+		return a;
+	}
+	applyIndexedExclusions(e, t) {
+		if (t.length === 0 || e.length === 0) return e;
+		let n = /* @__PURE__ */ new Set();
+		for (let e = 0; e < t.length; e++) {
+			let r = t[e], i = this.storage.indexes.get(r.field);
+			if (!i) continue;
+			let a = this.getItemsByValues(i, r.exclude);
+			for (let e = 0; e < a.length; e++) n.add(a[e]);
+		}
+		if (n.size === 0) return e;
+		let r = [];
+		for (let t = 0; t < e.length; t++) {
+			let i = e[t];
+			n.has(i) || r.push(i);
+		}
+		return r;
+	}
+}, v = class {
+	constructor(t = {}) {
+		this.chainBuilder = new a({
+			filter: (e, t) => t === void 0 ? this.filter(e) : this.filter(e, t),
+			getOriginData: () => this.getOriginData(),
+			add: (e) => this.add(e),
+			update: (e) => this.update(e),
+			data: (e) => this.data(e),
+			clearIndexes: () => this.clearIndexes(),
+			clearData: () => this.clearData(),
+			resetFilterState: () => this.resetFilterState()
+		}), this.mutableExcludeField = t.mutableExcludeField ?? null, this.state = t.state ?? new e(t.data ?? [], { filterByPreviousResult: t.filterByPreviousResult ?? !1 }), t.state && t.filterByPreviousResult && this.state.setFilterByPreviousResult(!0), this.filterByPreviousResult = this.state.isFilterByPreviousResultEnabled(), this.namespace = this.state.createNamespace("filter"), this.indexer = new n(this.runtime.indexerStorage), this.nestedCollection = new _(this.runtime.nestedStorage), this.nestedCollection.registerFields(t.nestedFields), this.state.subscribe((e) => this.handleStateMutation(e)), this.rebuildMutableExcludeState();
+		let r = t.fields?.length, i = this.nestedCollection.hasRegisteredFields();
+		if (r) for (let e of t.fields) this.indexedFields.add(e);
+		this.dataset.length > 0 && (r || i) && this.rebuildConfiguredIndexes();
+	}
+	get dataset() {
+		return this.state.getOriginData();
+	}
+	get runtime() {
+		return this.state.getOrCreateScopedValue(this.namespace, "runtime", r);
+	}
+	get mutableExcludeState() {
+		return this.runtime.mutableExclude;
+	}
+	get indexedFields() {
+		return this.runtime.indexedFields;
+	}
+	get sequentialCache() {
+		return this.runtime.sequentialCache;
+	}
+	shouldDeferMutationIndexUpdates() {
+		return this.state.getScopedValue(t, g) === !0;
+	}
+	markDeferredMutationState() {
+		this.runtime.deferredMutationVersion = this.state.getMutationVersion(), this.indexer.clear(), this.nestedCollection.clearIndexes(), this.clearMutableExcludeState(), this.resetFilterState();
+	}
+	ensureRuntimeReady() {
+		this.runtime.deferredMutationVersion !== null && (this.runtime.deferredMutationVersion = null, this.rebuildMutableExcludeState(), this.dataset.length > 0 && (this.indexedFields.size > 0 || this.nestedCollection.hasRegisteredFields()) && this.rebuildConfiguredIndexes());
+	}
+	rebuildConfiguredIndexes() {
+		this.indexer.clear(), this.nestedCollection.clearIndexes();
+		for (let e of this.indexedFields) this.buildIndex(this.dataset, e);
+		this.nestedCollection.hasRegisteredFields() && this.nestedCollection.buildIndexes(this.dataset);
+	}
+	buildIndex(e, t) {
+		if (!Array.isArray(e)) {
+			if (!this.dataset.length) throw o.missingDatasetForBuildIndex();
+			return this.indexer.buildIndex(this.dataset, e), this;
+		}
+		return this.resetFilterState(), this.rebuildMutableExcludeState(), this.indexer.buildIndex(e, t), this;
+	}
+	clearIndexes() {
+		return this.indexer.clear(), this.nestedCollection.clearIndexes(), this;
+	}
+	resetFilterState() {
+		return this.sequentialCache.previousResult = null, this.sequentialCache.previousCriteria = null, this.sequentialCache.previousCriteriaKey = null, this.sequentialCache.previousBaseData = null, this.sequentialCache.previousResultsByCriteria.clear(), this.sequentialCache.previousResultSet = null, this.state.clearPreviousResult(), this;
+	}
+	clearData() {
+		return this.state.clearData(), this;
+	}
+	data(e) {
+		return this.state.data(e), this;
+	}
+	add(e) {
+		return this.state.add(e), this;
+	}
+	update(e) {
+		return this.state.update(e), this;
+	}
+	applyAddedItems(e, t) {
+		return e.length === 0 ? this : (this.updateMutableExcludeStateForAddedItems(e, t), this.resetFilterState(), this.indexer.addItems(e), this.nestedCollection.addItems(e), this);
+	}
+	getOriginData() {
+		return this.state.getOriginData();
+	}
+	filter(e, t) {
+		return t === void 0 ? this.withChain(this.rawFilter(e)) : this.withChain(this.rawFilter(e, t));
+	}
+	rawFilter(e, t) {
+		this.ensureRuntimeReady();
+		let n = t === void 0;
+		if (n && !this.dataset.length) throw o.missingDatasetForFilter();
+		let r = s(n ? e : t), i = n ? this.dataset : e;
+		if (n) {
+			let e = this.applyMutableExclude(r);
+			if (e !== void 0) return e;
+		}
+		let a = i, c = r;
+		if (this.filterByPreviousResult) {
+			let e = this.resolveWithSequentialCache(i, n, r);
+			if (e.isFromCache) return e.result;
+			a = e.sourceData, c = e.executionCriteria;
+		}
+		if (r.length === 0) return this.filterByPreviousResult && this.resetFilterState(), i;
+		for (let e = 0; e < c.length; e++) if (l(c[e])) return this.createEmptyResult(n, i, r);
+		let u = [], d = [];
+		for (let e = 0; e < c.length; e++) {
+			let t = c[e];
+			this.nestedCollection.hasField(t.field) ? u.push(t) : d.push(t);
+		}
+		if (u.length > 0 && (a = this.nestedCollection.filter(a, u, this.dataset), a.length === 0)) return this.createEmptyResult(n, i, r);
+		if (d.length === 0) return this.storePreviousResult(a, n, i, r), a;
+		let f = [], p = [];
+		for (let e = 0; e < d.length; e++) {
+			let t = d[e];
+			this.indexer.hasIndex(t.field) ? f.push(t) : p.push(t);
+		}
+		let m;
+		if (f.length > 0 && p.length === 0) return m = this.filterViaIndex(f, a), this.storePreviousResult(m, n, i, r), m;
+		if (f.length > 0 && p.length > 0) {
+			let e = this.filterViaIndex(f, a);
+			return m = this.linearFilter(e, p), this.storePreviousResult(m, n, i, r), m;
+		}
+		return m = this.linearFilter(a, d), this.storePreviousResult(m, n, i, r), m;
+	}
+	resolveWithSequentialCache(e, t, n) {
+		let { previousResult: r, previousCriteria: i, previousCriteriaKey: a, previousBaseData: o, previousResultsByCriteria: s } = this.sequentialCache;
+		if (r === null || i === null || o !== e) return {
+			isFromCache: !1,
+			sourceData: e,
+			executionCriteria: n
+		};
+		let c = this.createCriteriaCacheKey(n), l = s.get(c);
+		if (c === a) return {
+			isFromCache: !0,
+			result: r
+		};
+		if (l !== void 0) return this.storePreviousResult(l.result, t, e, n, c, l.resultSet), {
+			isFromCache: !0,
+			result: l.result
+		};
+		let u = this.hasCriteriaBacktrack(i, n) || r.length === 0 && !this.canApplySequentiallyToEmptyResult(i, n);
+		return {
+			isFromCache: !1,
+			sourceData: u ? e : r,
+			executionCriteria: u ? n : this.createSequentialExecutionCriteria(i, n)
+		};
+	}
+	withChain(e) {
+		return this.chainBuilder.create(e);
+	}
+	handleStateMutation(e) {
+		if (this.shouldDeferMutationIndexUpdates() && (e.type === "add" || e.type === "update")) {
+			this.markDeferredMutationState();
+			return;
+		}
+		switch (e.type) {
+			case "add":
+				this.applyAddedItems(e.items, e.startIndex);
+				return;
+			case "update":
+				this.applyUpdatedItem(e.index, e.previousItem, e.nextItem);
+				return;
+			case "data":
+				this.runtime.deferredMutationVersion = null, this.rebuildMutableExcludeState(), this.resetFilterState(), this.rebuildConfiguredIndexes();
+				return;
+			case "clearData":
+				this.runtime.deferredMutationVersion = null, this.clearMutableExcludeState(), this.indexer.clear(), this.nestedCollection.clearIndexes(), this.resetFilterState();
+				return;
+			case "remove":
+				this.applyRemovedItem(e.field, e.value, e.removedItem, e.removedIndex, e.movedItem);
+				return;
+			case "removeMany":
+				this.applyRemovedItems(e.field, e.entries);
+				return;
+		}
+	}
+	rebuildMutableExcludeState() {
+		if (this.clearMutableExcludeState(), this.mutableExcludeField !== null) for (let e = 0; e < this.dataset.length; e++) {
+			let t = this.dataset[e][this.mutableExcludeField];
+			t != null && this.registerMutableExcludeValue(t, e);
+		}
+	}
+	updateMutableExcludeStateForAddedItems(e, t) {
+		if (this.mutableExcludeField !== null) for (let n = 0; n < e.length; n++) {
+			let r = e[n][this.mutableExcludeField];
+			r != null && this.registerMutableExcludeValue(r, t + n);
+		}
+	}
+	applyMutableExclude(e) {
+		if (this.mutableExcludeField === null || e.length !== 1) return;
+		let t = e[0];
+		if (!(t.field !== this.mutableExcludeField || t.hasValues || !t.hasExclude)) {
+			if (this.mutableExcludeState.hasDuplicateValues) throw o.duplicateMutableExcludeField(this.mutableExcludeField);
+			return this.state.removeByFieldValues(this.mutableExcludeField, t.exclude), this.resetFilterState(), this.dataset;
+		}
+	}
+	applyUpdatedItem(e, t, n) {
+		this.updateMutableExcludeStateForUpdatedItem(e, t, n), this.resetFilterState(), this.indexer.updateItem(t, n), this.nestedCollection.updateItem(n, t);
+	}
+	applyRemovedItem(e, t, n, r, i) {
+		if (e === this.mutableExcludeField && (this.unregisterMutableExcludeValue(t), this.mutableExcludeState.datasetPositions.delete(t), i !== null && this.mutableExcludeField !== null)) {
+			let e = i[this.mutableExcludeField];
+			e != null && this.mutableExcludeState.datasetPositions.set(e, r);
+		}
+		this.resetFilterState(), this.indexer.removeItem(n), this.nestedCollection.removeItem(n);
+	}
+	applyRemovedItems(e, t) {
+		for (let n = 0; n < t.length; n++) {
+			let r = t[n];
+			if (e === this.mutableExcludeField && (this.unregisterMutableExcludeValue(r.value), this.mutableExcludeState.datasetPositions.delete(r.value), r.movedItem !== null && this.mutableExcludeField !== null)) {
+				let e = r.movedItem[this.mutableExcludeField];
+				e != null && this.mutableExcludeState.datasetPositions.set(e, r.removedIndex);
+			}
+			this.indexer.removeItem(r.removedItem), this.nestedCollection.removeItem(r.removedItem);
+		}
+		this.resetFilterState();
+	}
+	updateMutableExcludeStateForUpdatedItem(e, t, n) {
+		if (this.mutableExcludeField === null) return;
+		let r = t[this.mutableExcludeField], i = n[this.mutableExcludeField];
+		if (r === i) {
+			i != null && this.mutableExcludeState.datasetPositions.set(i, e);
+			return;
+		}
+		r != null && (this.unregisterMutableExcludeValue(r), this.mutableExcludeState.datasetPositions.get(r) === e && this.mutableExcludeState.datasetPositions.delete(r)), i != null && this.registerMutableExcludeValue(i, e);
+	}
+	clearMutableExcludeState() {
+		this.mutableExcludeState.datasetPositions.clear(), this.mutableExcludeState.valueCounts.clear(), this.mutableExcludeState.duplicateValueCount = 0, this.mutableExcludeState.hasDuplicateValues = !1;
+	}
+	registerMutableExcludeValue(e, t) {
+		let n = (this.mutableExcludeState.valueCounts.get(e) ?? 0) + 1;
+		n === 2 && this.mutableExcludeState.duplicateValueCount++, this.mutableExcludeState.valueCounts.set(e, n), this.mutableExcludeState.datasetPositions.set(e, t), this.mutableExcludeState.hasDuplicateValues = this.mutableExcludeState.duplicateValueCount > 0;
+	}
+	unregisterMutableExcludeValue(e) {
+		let t = this.mutableExcludeState.valueCounts.get(e);
+		t !== void 0 && (t === 2 && this.mutableExcludeState.duplicateValueCount--, t <= 1 ? this.mutableExcludeState.valueCounts.delete(e) : this.mutableExcludeState.valueCounts.set(e, t - 1), this.mutableExcludeState.hasDuplicateValues = this.mutableExcludeState.duplicateValueCount > 0);
+	}
+	linearFilter(e, t) {
+		let n = [];
+		for (let r = 0; r < e.length; r++) {
+			let i = e[r], a = !0;
+			for (let e = 0; e < t.length; e++) {
+				let n = t[e];
+				if (!c(n, i[n.field])) {
+					a = !1;
+					break;
+				}
+			}
+			a && n.push(i);
+		}
+		return n;
+	}
+	filterViaIndex(e, t) {
+		let n = t !== this.dataset, r = null;
+		if (n) {
+			if (t === this.sequentialCache.previousResult && this.sequentialCache.previousResultSet !== null) r = this.sequentialCache.previousResultSet;
+			else if (r = new Set(t), t === this.sequentialCache.previousResult) {
+				this.sequentialCache.previousResultSet = r;
+				let e = this.sequentialCache.previousCriteriaKey;
+				if (e !== null) {
+					let t = this.sequentialCache.previousResultsByCriteria.get(e);
+					t && (t.resultSet = r);
+				}
+			}
+		}
+		let i = [], a = [];
+		for (let t = 0; t < e.length; t++) {
+			let n = e[t];
+			n.hasValues && i.push(n), n.hasExclude && a.push(n);
+		}
+		if (i.length === 0) return this.applyIndexedExclusions(t, a);
+		if (i.length === 1) {
+			let e = i[0], t = !1;
+			for (let n = 0; n < a.length; n++) if (a[n].field !== e.field) {
+				t = !0;
+				break;
+			}
+			if (r === null && !t) return e.values.length === 1 ? this.indexer.getByValue(e.field, e.values[0]).slice() : this.indexer.getByValues(e.field, e.values);
+			let n = this.indexer.getByValues(e.field, e.values), o = [];
+			for (let e = 0; e < n.length; e++) {
+				let t = n[e];
+				r && !r.has(t) || o.push(t);
+			}
+			return this.applyIndexedExclusions(o, a);
+		}
+		let o = i[0], s = this.estimateIndexSize(o);
+		for (let e = 1; e < i.length; e++) {
+			let t = i[e], n = this.estimateIndexSize(t);
+			n < s && (o = t, s = n);
+		}
+		let l = this.indexer.getByValues(o.field, o.values);
+		if (l.length === 0) return [];
+		let u = [];
+		for (let e = 0; e < l.length; e++) {
+			let t = l[e], n = !0;
+			if (!(r && !r.has(t))) {
+				for (let e = 0; e < i.length; e++) {
+					let r = i[e];
+					if (r !== o && !c(r, t[r.field])) {
+						n = !1;
+						break;
+					}
+				}
+				n && u.push(t);
+			}
+		}
+		return this.applyIndexedExclusions(u, a);
+	}
+	estimateIndexSize(e) {
+		let t = this.indexer.getIndexMap(e.field);
+		if (!t) return Infinity;
+		let n = 0;
+		for (let r = 0; r < e.values.length; r++) {
+			let i = t.get(e.values[r]);
+			i && (n += i.length);
+		}
+		return n;
+	}
+	applyIndexedExclusions(e, t) {
+		if (t.length === 0 || e.length === 0) return e;
+		let n = /* @__PURE__ */ new Set();
+		for (let e = 0; e < t.length; e++) {
+			let r = t[e], i = this.indexer.getIndexMap(r.field);
+			if (i) for (let e = 0; e < r.exclude.length; e++) {
+				let t = i.get(r.exclude[e]);
+				if (t) for (let e = 0; e < t.length; e++) n.add(t[e]);
+			}
+		}
+		if (n.size === 0) return e;
+		let r = [];
+		for (let t = 0; t < e.length; t++) {
+			let i = e[t];
+			n.has(i) || r.push(i);
+		}
+		return r;
+	}
+	createEmptyResult(e, t, n) {
+		let r = [];
+		return this.storePreviousResult(r, e, t, n), r;
+	}
+	storePreviousResult(e, t, n, r, i = this.createCriteriaCacheKey(r), a) {
+		if (!this.filterByPreviousResult) return;
+		let o = a === void 0 ? null : a;
+		this.sequentialCache.previousResult = e, this.sequentialCache.previousCriteria = r, this.sequentialCache.previousCriteriaKey = i, this.sequentialCache.previousBaseData = t ? this.dataset : n, this.sequentialCache.previousResultSet = o, this.state.setPreviousResult(e, t ? this.dataset : n), this.sequentialCache.previousResultsByCriteria.set(i, this.createSequentialCacheEntry(e, o));
+	}
+	createCriteriaCacheKey(e) {
+		let t = "";
+		for (let n = 0; n < e.length; n++) t += e[n].cacheKeySegment, t += ";";
+		return t;
+	}
+	createSequentialCacheEntry(e, t) {
+		return {
+			result: e,
+			resultSet: t
+		};
+	}
+	createSequentialExecutionCriteria(e, t) {
+		let n = /* @__PURE__ */ new Map();
+		for (let t = 0; t < e.length; t++) {
+			let r = e[t];
+			n.set(r.field, r);
+		}
+		return t.map((e) => {
+			let t = n.get(e.field);
+			if (!t || !t.hasValues || !e.hasValues || t.hasExclude || e.hasExclude || e.includedValues.size <= t.includedValues.size) return e;
+			for (let n of t.includedValues) if (!e.includedValues.has(n)) return e;
+			let r = [];
+			for (let n of e.includedValues) t.includedValues.has(n) || r.push(n);
+			return r.length === 0 ? e : {
+				...e,
+				values: r,
+				includedValues: new Set(r)
+			};
+		});
+	}
+	hasCriteriaBacktrack(e, t) {
+		let n = this.createCriteriaStateMap(e), r = this.createCriteriaStateMap(t);
+		for (let [e, t] of n) {
+			let n = r.get(e);
+			if (!n || this.isCriterionBacktracked(t, n)) return !0;
+		}
+		return !1;
+	}
+	canApplySequentiallyToEmptyResult(e, t) {
+		let n = this.createCriteriaStateMap(e), r = this.createCriteriaStateMap(t);
+		for (let [e, t] of r) {
+			let r = n.get(e);
+			if (r) {
+				if (r.hasValues !== t.hasValues && (r.hasValues || !t.hasValues)) return !1;
+				if (r.hasValues && t.hasValues) {
+					let e = r.includedValues, n = t.includedValues;
+					if (!this.areSetsEqual(e, n) && !this.isSubset(e, n)) return !1;
+				}
+				if (r.hasExclude !== t.hasExclude && (r.hasExclude || !t.hasExclude)) return !1;
+				if (r.hasExclude && t.hasExclude) {
+					let e = r.excludedValues, n = t.excludedValues;
+					if (!this.areSetsEqual(e, n) && !this.isSubset(e, n)) return !1;
+				}
+			}
+		}
+		return !0;
+	}
+	createCriteriaStateMap(e) {
+		let t = /* @__PURE__ */ new Map();
+		for (let n = 0; n < e.length; n++) {
+			let r = e[n];
+			t.set(r.field, r);
+		}
+		return t;
+	}
+	isCriterionBacktracked(e, t) {
+		if (e.hasValues && !t.hasValues) return !0;
+		if (e.hasValues && t.hasValues) {
+			let n = e.includedValues, r = t.includedValues;
+			if (!this.areSetsEqual(n, r)) return this.isSubset(r, n);
+		}
+		if (!e.hasValues && t.hasValues) return !1;
+		if (e.hasExclude && !t.hasExclude) return !0;
+		if (!e.hasExclude && t.hasExclude) return !1;
+		if (e.hasExclude && t.hasExclude) {
+			let n = e.excludedValues, r = t.excludedValues;
+			if (!this.areSetsEqual(n, r)) return this.isSubset(r, n);
+		}
+		return !1;
+	}
+	isSubset(e, t) {
+		for (let n of e) if (!t.has(n)) return !1;
+		return !0;
+	}
+	areSetsEqual(e, t) {
+		if (e === t) return !0;
+		if (!e || !t || e.size !== t.size) return !1;
+		for (let n of e) if (!t.has(n)) return !1;
+		return !0;
+	}
+};
+//#endregion
+export { v as FilterEngine };