npm - @mhmo91/schmancy - Versions diffs - 0.2.144 → 0.2.145 - Mend

@mhmo91/schmancy 0.2.144 → 0.2.145

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 (13) hide show

package/dist/index.cjs +1 -1
package/dist/index.js +1 -1
package/dist/selector-hook-BjCCf3SV.cjs +2 -0
package/dist/selector-hook-BjCCf3SV.cjs.map +1 -0
package/dist/{selector-hook-D_HTD-GV.js → selector-hook-DHPU6Z2H.js} +111 -105
package/dist/selector-hook-DHPU6Z2H.js.map +1 -0
package/dist/store.cjs +1 -1
package/dist/store.js +1 -1
package/package.json +1 -1
package/types/src/store/selectors.d.ts +2 -11
package/dist/selector-hook-Bvne--oy.cjs +0 -2
package/dist/selector-hook-Bvne--oy.cjs.map +0 -1
package/dist/selector-hook-D_HTD-GV.js.map +0 -1

package/dist/index.cjs CHANGED Viewed

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"}),require("./animated-text-UjA34w-f.cjs");const c=require("./area.component-BEDtgjNb.cjs");require("./autocomplete-CtqM8VN6.cjs"),require("./spinner-D46_Vbxf.cjs");const l=require("./icon-button-B3LSOKYP.cjs"),r=require("./teleport.component-Cgtrv4bU.cjs"),g=require("./checkbox-CGAbsupz.cjs");require("./chips-FOChglMy.cjs");const f=require("./payment-card-form-DmHX_20B.cjs");require("./date-range-CCBukS6w.cjs");const h=require("./delay-DoQ_jIcq.cjs"),i=require("./ripple-C2BHbhcS.cjs");require("./divider-Wh-OY6OR.cjs");const u=require("./timezone-2Eb26kSx.cjs");require("./form-B0CyaQwH.cjs"),require("./icon-BqQnZfcC.cjs"),require("./input-A8mZ7r9Z.cjs");const a=require("./flex-BaRE9ffF.cjs"),S=require("./list-4_krEg2r.cjs");require("./menu-fEUIZGXJ.cjs");const y=require("./notification-container-DdUjZ0bi.cjs"),b=require("./notification-service-DXXrRCmK.cjs");require("./option-CpmK20dy.cjs");const C=require("./radio-group-DOpJu0Pc.cjs"),O=require("./rxjs-utils.cjs");require("rxjs"),require("./index-DyJ0oDpR.cjs");const q=require("./select-0NLmJErW.cjs"),n=require("./sheet-BwsspKto.cjs"),s=require("./slider-9zdabbA2.cjs"),o=require("./schmancy-steps-container-B5UOYQG8.cjs"),t=require("./context-object-CP7HbDFQ.cjs"),e=require("./selector-hook-Bvne--oy.cjs"),p=require("./surface-DFXFQBBC.cjs"),d=require("./table-BG1_ofOE.cjs");require("./tabs-group-BVsNqqN1.cjs"),require("./textarea-D1nov2H8.cjs");const m=require("./theme.component-C61DdKLT.cjs"),D=require("./theme.interface-Xg5Zi46a.cjs");require("./theme-button-C-g9a2ZF.cjs");const P=require("./tree-CsKV00BK.cjs"),j=require("./types.cjs"),w=require("./typewriter-BTKJ8mPR.cjs"),M=require("./typography-BJzp77zk.cjs"),T=require("./intersection-CVvaDv96.cjs");exports.FINDING_MORTIES=c.FINDING_MORTIES,exports.HERE_RICKY=c.HERE_RICKY,exports.HISTORY_STRATEGY=c.HISTORY_STRATEGY,Object.defineProperty(exports,"SchmancyArea",{enumerable:!0,get:()=>c.SchmancyArea}),exports.area=c.area,exports.routerHistory=c.routerHistory,Object.defineProperty(exports,"SchmancyButton",{enumerable:!0,get:()=>l.SchmancyButton}),Object.defineProperty(exports,"SchmnacyIconButton",{enumerable:!0,get:()=>l.SchmnacyIconButton}),exports.$drawer=r.$drawer,exports.HereMorty=r.HereMorty,Object.defineProperty(exports,"SchmancyContentDrawer",{enumerable:!0,get:()=>r.SchmancyContentDrawer}),exports.SchmancyContentDrawerID=r.SchmancyContentDrawerID,Object.defineProperty(exports,"SchmancyContentDrawerMain",{enumerable:!0,get:()=>r.SchmancyContentDrawerMain}),exports.SchmancyContentDrawerMaxHeight=r.SchmancyContentDrawerMaxHeight,exports.SchmancyContentDrawerMinWidth=r.SchmancyContentDrawerMinWidth,Object.defineProperty(exports,"SchmancyContentDrawerSheet",{enumerable:!0,get:()=>r.SchmancyContentDrawerSheet}),exports.SchmancyContentDrawerSheetMode=r.SchmancyContentDrawerSheetMode,exports.SchmancyContentDrawerSheetState=r.SchmancyContentDrawerSheetState,Object.defineProperty(exports,"SchmancyDrawerAppbar",{enumerable:!0,get:()=>r.SchmancyDrawerAppbar}),exports.SchmancyDrawerNavbarMode=r.SchmancyDrawerNavbarMode,exports.SchmancyDrawerNavbarState=r.SchmancyDrawerNavbarState,Object.defineProperty(exports,"SchmancyNavigationDrawer",{enumerable:!0,get:()=>r.SchmancyNavigationDrawer}),Object.defineProperty(exports,"SchmancyNavigationDrawerContent",{enumerable:!0,get:()=>r.SchmancyNavigationDrawerContent}),Object.defineProperty(exports,"SchmancyNavigationDrawerSidebar",{enumerable:!0,get:()=>r.SchmancyNavigationDrawerSidebar}),Object.defineProperty(exports,"SchmancyTeleportation",{enumerable:!0,get:()=>r.SchmancyTeleportation}),exports.WhereAreYouRicky=r.WhereAreYouRicky,exports.schmancyContentDrawer=r.schmancyContentDrawer,exports.schmancyNavDrawer=r.schmancyNavDrawer,exports.teleport=r.teleport,Object.defineProperty(exports,"SchmancyCheckbox",{enumerable:!0,get:()=>g.SchmancyCheckbox}),Object.defineProperty(exports,"SchmancyPaymentCardForm",{enumerable:!0,get:()=>f.SchmancyPaymentCardForm}),Object.defineProperty(exports,"SchmancyDelay",{enumerable:!0,get:()=>h.SchmancyDelay}),exports.delayContext=h.delayContext,exports.color=i.color,exports.fullHeight=i.fullHeight,exports.ripple=i.ripple,Object.defineProperty(exports,"SchmancyCountriesSelect",{enumerable:!0,get:()=>u.SchmancyCountriesSelect}),Object.defineProperty(exports,"SchmancyTimezonesSelect",{enumerable:!0,get:()=>u.SchmancyTimezonesSelect}),Object.defineProperty(exports,"SchmancyFlex",{enumerable:!0,get:()=>a.SchmancyFlex}),Object.defineProperty(exports,"SchmancyFlexV2",{enumerable:!0,get:()=>a.SchmancyFlexV2}),Object.defineProperty(exports,"SchmancyGrid",{enumerable:!0,get:()=>a.SchmancyGrid}),Object.defineProperty(exports,"SchmancyScroll",{enumerable:!0,get:()=>a.SchmancyScroll}),Object.defineProperty(exports,"List",{enumerable:!0,get:()=>S.List}),Object.defineProperty(exports,"SchmancyListItem",{enumerable:!0,get:()=>S.SchmancyListItem}),exports.SchmancyListTypeContext=S.SchmancyListTypeContext,exports.NotificationAudioService=y.NotificationAudioService,Object.defineProperty(exports,"SchmancyNotification",{enumerable:!0,get:()=>y.SchmancyNotification}),Object.defineProperty(exports,"SchmancyNotificationContainer",{enumerable:!0,get:()=>y.SchmancyNotificationContainer}),exports.$notify=b.$notify,exports.NotificationService=b.NotificationService,Object.defineProperty(exports,"RadioGroup",{enumerable:!0,get:()=>C.RadioGroup}),exports.mutationObserver=O.mutationObserver,Object.defineProperty(exports,"SchmancySelect",{enumerable:!0,get:()=>q.SchmancySelect}),exports.SchmancySheetPosition=n.SchmancySheetPosition,exports.SheetHereMorty=n.SheetHereMorty,exports.SheetWhereAreYouRicky=n.SheetWhereAreYouRicky,exports.sheet=n.sheet,Object.defineProperty(exports,"SchmancySlide",{enumerable:!0,get:()=>s.SchmancySlide}),Object.defineProperty(exports,"SchmancySlider",{enumerable:!0,get:()=>s.SchmancySlider}),Object.defineProperty(exports,"SchmancyStep",{enumerable:!0,get:()=>o.SchmancyStep}),Object.defineProperty(exports,"SchmancyStepsContainer",{enumerable:!0,get:()=>o.SchmancyStepsContainer}),exports.StepsController=o.StepsController,exports.stepsContext=o.stepsContext,exports.BaseStore=t.BaseStore,exports.IndexedDBStorageManager=t.IndexedDBStorageManager,exports.LocalStorageManager=t.LocalStorageManager,exports.MemoryStorageManager=t.MemoryStorageManager,exports.SchmancyArrayStore=t.SchmancyArrayStore,exports.SchmancyStoreObject=t.SchmancyStoreObject,exports.SessionStorageManager=t.SessionStorageManager,exports.StoreError=t.StoreError,exports.createStorageManager=t.createStorageManager,exports.compareValues=e.compareValues,exports.createArrayContext=e.createArrayContext,exports.createCollectionSelector=e.createCollectionSelector,exports.createCompoundSelector=e.createCompoundSelector,exports.createContext=e.createContext,exports.createCountSelector=e.createCountSelector,exports.createEntriesSelector=e.createEntriesSelector,exports.createFilterSelector=e.createFilterSelector,exports.createFindSelector=e.createFindSelector,exports.createItemSelector=e.createItemSelector,exports.createItemsSelector=e.createItemsSelector,exports.createKeysSelector=e.createKeysSelector,exports.createMapSelector=e.createMapSelector,exports.createOptimizedSelector=e.createOptimizedSelector,exports.createSelector=e.createSelector,exports.createSortSelector=e.createSortSelector,exports.createTestArrayContext=e.createTestArrayContext,exports.filterArray=e.filterArray,exports.filterArrayItems=e.filterArrayItems,exports.filterMap=e.filterMap,exports.filterMapItems=e.filterMapItems,exports.getFieldValue=e.getFieldValue,exports.isArray=e.isArray,exports.isDate=e.isDate,exports.isIterable=e.isIterable,exports.isMap=e.isMap,exports.isNil=e.isNil,exports.isNumber=e.isNumber,exports.isPlainObject=e.isPlainObject,exports.isSet=e.isSet,exports.isString=e.isString,exports.select=e.select,exports.selectItem=e.selectItem,Object.defineProperty(exports,"SchmancySurface",{enumerable:!0,get:()=>p.SchmancySurface}),exports.SchmancySurfaceTypeContext=p.SchmancySurfaceTypeContext,Object.defineProperty(exports,"SchmancyDataTable",{enumerable:!0,get:()=>d.SchmancyDataTable}),Object.defineProperty(exports,"SchmancyTableRow",{enumerable:!0,get:()=>d.SchmancyTableRow}),Object.defineProperty(exports,"SchmancyThemeComponent",{enumerable:!0,get:()=>m.SchmancyThemeComponent}),exports.formateTheme=m.formateTheme,exports.tailwindStyles=m.tailwindStyles,exports.SchmancyTheme=D.SchmancyTheme,Object.defineProperty(exports,"SchmancyTree",{enumerable:!0,get:()=>P.SchmancyTree}),exports.SchmancyEvents=j.SchmancyEvents,Object.defineProperty(exports,"TypewriterElement",{enumerable:!0,get:()=>w.TypewriterElement}),Object.defineProperty(exports,"SchmancyTypography",{enumerable:!0,get:()=>M.SchmancyTypography}),exports.intersection$=T.intersection$;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"}),require("./animated-text-UjA34w-f.cjs");const c=require("./area.component-BEDtgjNb.cjs");require("./autocomplete-CtqM8VN6.cjs"),require("./spinner-D46_Vbxf.cjs");const l=require("./icon-button-B3LSOKYP.cjs"),r=require("./teleport.component-Cgtrv4bU.cjs"),g=require("./checkbox-CGAbsupz.cjs");require("./chips-FOChglMy.cjs");const f=require("./payment-card-form-DmHX_20B.cjs");require("./date-range-CCBukS6w.cjs");const h=require("./delay-DoQ_jIcq.cjs"),i=require("./ripple-C2BHbhcS.cjs");require("./divider-Wh-OY6OR.cjs");const u=require("./timezone-2Eb26kSx.cjs");require("./form-B0CyaQwH.cjs"),require("./icon-BqQnZfcC.cjs"),require("./input-A8mZ7r9Z.cjs");const a=require("./flex-BaRE9ffF.cjs"),S=require("./list-4_krEg2r.cjs");require("./menu-fEUIZGXJ.cjs");const y=require("./notification-container-DdUjZ0bi.cjs"),b=require("./notification-service-DXXrRCmK.cjs");require("./option-CpmK20dy.cjs");const C=require("./radio-group-DOpJu0Pc.cjs"),O=require("./rxjs-utils.cjs");require("rxjs"),require("./index-DyJ0oDpR.cjs");const q=require("./select-0NLmJErW.cjs"),n=require("./sheet-BwsspKto.cjs"),s=require("./slider-9zdabbA2.cjs"),o=require("./schmancy-steps-container-B5UOYQG8.cjs"),t=require("./context-object-CP7HbDFQ.cjs"),e=require("./selector-hook-BjCCf3SV.cjs"),p=require("./surface-DFXFQBBC.cjs"),d=require("./table-BG1_ofOE.cjs");require("./tabs-group-BVsNqqN1.cjs"),require("./textarea-D1nov2H8.cjs");const m=require("./theme.component-C61DdKLT.cjs"),D=require("./theme.interface-Xg5Zi46a.cjs");require("./theme-button-C-g9a2ZF.cjs");const P=require("./tree-CsKV00BK.cjs"),j=require("./types.cjs"),w=require("./typewriter-BTKJ8mPR.cjs"),M=require("./typography-BJzp77zk.cjs"),T=require("./intersection-CVvaDv96.cjs");exports.FINDING_MORTIES=c.FINDING_MORTIES,exports.HERE_RICKY=c.HERE_RICKY,exports.HISTORY_STRATEGY=c.HISTORY_STRATEGY,Object.defineProperty(exports,"SchmancyArea",{enumerable:!0,get:()=>c.SchmancyArea}),exports.area=c.area,exports.routerHistory=c.routerHistory,Object.defineProperty(exports,"SchmancyButton",{enumerable:!0,get:()=>l.SchmancyButton}),Object.defineProperty(exports,"SchmnacyIconButton",{enumerable:!0,get:()=>l.SchmnacyIconButton}),exports.$drawer=r.$drawer,exports.HereMorty=r.HereMorty,Object.defineProperty(exports,"SchmancyContentDrawer",{enumerable:!0,get:()=>r.SchmancyContentDrawer}),exports.SchmancyContentDrawerID=r.SchmancyContentDrawerID,Object.defineProperty(exports,"SchmancyContentDrawerMain",{enumerable:!0,get:()=>r.SchmancyContentDrawerMain}),exports.SchmancyContentDrawerMaxHeight=r.SchmancyContentDrawerMaxHeight,exports.SchmancyContentDrawerMinWidth=r.SchmancyContentDrawerMinWidth,Object.defineProperty(exports,"SchmancyContentDrawerSheet",{enumerable:!0,get:()=>r.SchmancyContentDrawerSheet}),exports.SchmancyContentDrawerSheetMode=r.SchmancyContentDrawerSheetMode,exports.SchmancyContentDrawerSheetState=r.SchmancyContentDrawerSheetState,Object.defineProperty(exports,"SchmancyDrawerAppbar",{enumerable:!0,get:()=>r.SchmancyDrawerAppbar}),exports.SchmancyDrawerNavbarMode=r.SchmancyDrawerNavbarMode,exports.SchmancyDrawerNavbarState=r.SchmancyDrawerNavbarState,Object.defineProperty(exports,"SchmancyNavigationDrawer",{enumerable:!0,get:()=>r.SchmancyNavigationDrawer}),Object.defineProperty(exports,"SchmancyNavigationDrawerContent",{enumerable:!0,get:()=>r.SchmancyNavigationDrawerContent}),Object.defineProperty(exports,"SchmancyNavigationDrawerSidebar",{enumerable:!0,get:()=>r.SchmancyNavigationDrawerSidebar}),Object.defineProperty(exports,"SchmancyTeleportation",{enumerable:!0,get:()=>r.SchmancyTeleportation}),exports.WhereAreYouRicky=r.WhereAreYouRicky,exports.schmancyContentDrawer=r.schmancyContentDrawer,exports.schmancyNavDrawer=r.schmancyNavDrawer,exports.teleport=r.teleport,Object.defineProperty(exports,"SchmancyCheckbox",{enumerable:!0,get:()=>g.SchmancyCheckbox}),Object.defineProperty(exports,"SchmancyPaymentCardForm",{enumerable:!0,get:()=>f.SchmancyPaymentCardForm}),Object.defineProperty(exports,"SchmancyDelay",{enumerable:!0,get:()=>h.SchmancyDelay}),exports.delayContext=h.delayContext,exports.color=i.color,exports.fullHeight=i.fullHeight,exports.ripple=i.ripple,Object.defineProperty(exports,"SchmancyCountriesSelect",{enumerable:!0,get:()=>u.SchmancyCountriesSelect}),Object.defineProperty(exports,"SchmancyTimezonesSelect",{enumerable:!0,get:()=>u.SchmancyTimezonesSelect}),Object.defineProperty(exports,"SchmancyFlex",{enumerable:!0,get:()=>a.SchmancyFlex}),Object.defineProperty(exports,"SchmancyFlexV2",{enumerable:!0,get:()=>a.SchmancyFlexV2}),Object.defineProperty(exports,"SchmancyGrid",{enumerable:!0,get:()=>a.SchmancyGrid}),Object.defineProperty(exports,"SchmancyScroll",{enumerable:!0,get:()=>a.SchmancyScroll}),Object.defineProperty(exports,"List",{enumerable:!0,get:()=>S.List}),Object.defineProperty(exports,"SchmancyListItem",{enumerable:!0,get:()=>S.SchmancyListItem}),exports.SchmancyListTypeContext=S.SchmancyListTypeContext,exports.NotificationAudioService=y.NotificationAudioService,Object.defineProperty(exports,"SchmancyNotification",{enumerable:!0,get:()=>y.SchmancyNotification}),Object.defineProperty(exports,"SchmancyNotificationContainer",{enumerable:!0,get:()=>y.SchmancyNotificationContainer}),exports.$notify=b.$notify,exports.NotificationService=b.NotificationService,Object.defineProperty(exports,"RadioGroup",{enumerable:!0,get:()=>C.RadioGroup}),exports.mutationObserver=O.mutationObserver,Object.defineProperty(exports,"SchmancySelect",{enumerable:!0,get:()=>q.SchmancySelect}),exports.SchmancySheetPosition=n.SchmancySheetPosition,exports.SheetHereMorty=n.SheetHereMorty,exports.SheetWhereAreYouRicky=n.SheetWhereAreYouRicky,exports.sheet=n.sheet,Object.defineProperty(exports,"SchmancySlide",{enumerable:!0,get:()=>s.SchmancySlide}),Object.defineProperty(exports,"SchmancySlider",{enumerable:!0,get:()=>s.SchmancySlider}),Object.defineProperty(exports,"SchmancyStep",{enumerable:!0,get:()=>o.SchmancyStep}),Object.defineProperty(exports,"SchmancyStepsContainer",{enumerable:!0,get:()=>o.SchmancyStepsContainer}),exports.StepsController=o.StepsController,exports.stepsContext=o.stepsContext,exports.BaseStore=t.BaseStore,exports.IndexedDBStorageManager=t.IndexedDBStorageManager,exports.LocalStorageManager=t.LocalStorageManager,exports.MemoryStorageManager=t.MemoryStorageManager,exports.SchmancyArrayStore=t.SchmancyArrayStore,exports.SchmancyStoreObject=t.SchmancyStoreObject,exports.SessionStorageManager=t.SessionStorageManager,exports.StoreError=t.StoreError,exports.createStorageManager=t.createStorageManager,exports.compareValues=e.compareValues,exports.createArrayContext=e.createArrayContext,exports.createCollectionSelector=e.createCollectionSelector,exports.createCompoundSelector=e.createCompoundSelector,exports.createContext=e.createContext,exports.createCountSelector=e.createCountSelector,exports.createEntriesSelector=e.createEntriesSelector,exports.createFilterSelector=e.createFilterSelector,exports.createFindSelector=e.createFindSelector,exports.createItemSelector=e.createItemSelector,exports.createItemsSelector=e.createItemsSelector,exports.createKeysSelector=e.createKeysSelector,exports.createMapSelector=e.createMapSelector,exports.createOptimizedSelector=e.createOptimizedSelector,exports.createSelector=e.createSelector,exports.createSortSelector=e.createSortSelector,exports.createTestArrayContext=e.createTestArrayContext,exports.filterArray=e.filterArray,exports.filterArrayItems=e.filterArrayItems,exports.filterMap=e.filterMap,exports.filterMapItems=e.filterMapItems,exports.getFieldValue=e.getFieldValue,exports.isArray=e.isArray,exports.isDate=e.isDate,exports.isIterable=e.isIterable,exports.isMap=e.isMap,exports.isNil=e.isNil,exports.isNumber=e.isNumber,exports.isPlainObject=e.isPlainObject,exports.isSet=e.isSet,exports.isString=e.isString,exports.select=e.select,exports.selectItem=e.selectItem,Object.defineProperty(exports,"SchmancySurface",{enumerable:!0,get:()=>p.SchmancySurface}),exports.SchmancySurfaceTypeContext=p.SchmancySurfaceTypeContext,Object.defineProperty(exports,"SchmancyDataTable",{enumerable:!0,get:()=>d.SchmancyDataTable}),Object.defineProperty(exports,"SchmancyTableRow",{enumerable:!0,get:()=>d.SchmancyTableRow}),Object.defineProperty(exports,"SchmancyThemeComponent",{enumerable:!0,get:()=>m.SchmancyThemeComponent}),exports.formateTheme=m.formateTheme,exports.tailwindStyles=m.tailwindStyles,exports.SchmancyTheme=D.SchmancyTheme,Object.defineProperty(exports,"SchmancyTree",{enumerable:!0,get:()=>P.SchmancyTree}),exports.SchmancyEvents=j.SchmancyEvents,Object.defineProperty(exports,"TypewriterElement",{enumerable:!0,get:()=>w.TypewriterElement}),Object.defineProperty(exports,"SchmancyTypography",{enumerable:!0,get:()=>M.SchmancyTypography}),exports.intersection$=T.intersection$;
 //# sourceMappingURL=index.cjs.map

package/dist/index.js CHANGED Viewed

@@ -30,7 +30,7 @@ import { S as Fa, b as Ha, a as Ba, s as La } from "./sheet-Bl64wfBe.js";
 import { S as ka, a as Ga } from "./slider-nyTR0hyw.js";
 import { S as $a, a as ja, b as Wa, s as za } from "./schmancy-steps-container-srToeIjV.js";
 import { B as Va, I as _a, L as Ka, M as qa, S as Ja, a as Qa, b as Ua, d as Xa, c as Za } from "./context-object-CISes2bD.js";
-import { p as ee, a as re, v as te, y as oe, c as ce, F as se, A as ne, D as Se, C as me, x as ie, w as ye, z as pe, E as he, G as le, u as fe, B as xe, b as Ce, r as de, d as De, q as we, f as ge, g as be, i as Me, j as ue, k as Te, l as Ie, o as Ne, h as Ae, n as ve, m as Re, e as Ee, s as Fe, t as He } from "./selector-hook-D_HTD-GV.js";
+import { p as ee, a as re, v as te, y as oe, c as ce, F as se, A as ne, D as Se, C as me, x as ie, w as ye, z as pe, E as he, G as le, u as fe, B as xe, b as Ce, r as de, d as De, q as we, f as ge, g as be, i as Me, j as ue, k as Te, l as Ie, o as Ne, h as Ae, n as ve, m as Re, e as Ee, s as Fe, t as He } from "./selector-hook-DHPU6Z2H.js";
 import { a as Le, S as Oe } from "./surface-RtVWZEdq.js";
 import { a as Ge, S as Ye } from "./table-CGdNPIeN.js";
 import "./tabs-group-CvHe90C_.js";

package/dist/selector-hook-BjCCf3SV.cjs ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";const O=require("./context-object-CP7HbDFQ.cjs"),B=require("lit/decorators.js"),m=require("rxjs"),K=require("rxjs/operators");function E(n,e,t){try{e==="indexeddb"&&(e="local"),((o=n)===null\|\|typeof o!="object"\|\|Array.isArray(o)\|\|o instanceof Map\|\|o instanceof Set\|\|o instanceof Date\|\|o instanceof RegExp\|\|Object.getPrototypeOf(o)!==Object.prototype)&&(n={...n});const a=O.SchmancyStoreObject.getInstance(e,t,n);return typeof(r=a.value)=="object"&&r!==null&&Object.keys(r).length===0&&a.set({...n}),a}catch{return O.SchmancyStoreObject.getInstance("memory",`${t}-fallback`,n)}var r,o}function q(n,e,t){try{const r=O.SchmancyArrayStore.getInstance(e,t,n);return r.value.length\|\|r.replace([...n]),r}catch{return O.SchmancyArrayStore.getInstance("memory",`${t}-fallback`,[...n])}}function $(n,e,t){try{return n==null&&(n=t.includes("collection")\|\|t.includes("map")?new Map:t.includes("array")\|\|t.includes("list")?[]:{}),n instanceof Map?function(r,o,a){try{const u=O.SchmancyCollectionStore.getInstance(o,a,r);return u.value.size\|\|u.replace(new Map(r)),u}catch{return O.SchmancyCollectionStore.getInstance("memory",`${a}-fallback`,new Map(r))}}(n,e,t):function(r){return Array.isArray(r)}(n)?q(n,e,t):E(typeof n=="object"?n:{value:n},e,t)}catch{return E(typeof n=="object"&&n!==null?{...n}:{value:n},"memory",`emergency-fallback-${t}`)}}const P=(n,e)=>{if(!e)return n;const t=e.split(".");let r=n;for(const o of t){if(r==null)return;r=r[o]}return r},R=n=>{if(!n\|\|n.length<2)return[];const e=[];for(let t=0;t<n.length-1;t++)e.push(n.substring(t,t+2).toLowerCase());return e},W=(n,e)=>{if(!n\|\|!e)return 0;const t=n.toLowerCase().trim(),r=e.toLowerCase().trim();if(t===r)return 1;const o=t.includes(r)?1:0,a=((l,y)=>{if(!l)return!0;if(!y)return!1;let s=0,i=0;for(;s<l.length&&i<y.length;)l[s].toLowerCase()===y[i].toLowerCase()&&s++,i++;return s===l.length})(r,t)?.8:0,u=((l,y)=>{if(!l)return!0;if(!y)return!1;const s=j=>j.toLowerCase().split("").reduce((I,A)=>(I[A]=(I[A]\|\|0)+1,I),{}),i=s(l),h=s(y);return Object.keys(i).every(j=>(h[j]\|\|0)>=i[j])})(r,t)?.7:0,f=((l,y)=>{if(!l\|\|!y\|\|l.length<2\|\|y.length<2)return 0;const s=R(l),i=R(y);if(s.length===0\|\|i.length===0)return 0;let h=0;const j=new Array(i.length).fill(!1);for(const I of s)for(let A=0;A<i.length;A++)if(!j[A]&&i[A]===I){h++,j[A]=!0;break}return 2*h/(s.length+i.length)})(t,r),c=Math.max(t.length,r.length),g=c?1-((l,y)=>{if(l===y)return 0;const s=Array(y.length+1).fill(null).map((i,h)=>[h]);for(let i=0;i<=l.length;i++)s[0][i]=i;for(let i=1;i<=y.length;i++)for(let h=1;h<=l.length;h++)y.charAt(i-1)===l.charAt(h-1)?s[i][h]=s[i-1][h-1]:s[i][h]=Math.min(s[i-1][h]+1,s[i][h-1]+1,s[i-1][h-1]+1);return s[y.length][l.length]})(t,r)/c:0;return Math.max(o,a,u,f,g)},D=n=>n==null?"":String(n);function Z(n,e,t=.3){let r,o,a,u=!1;if(Array.isArray(e)?[r,o,a,u=!1]=e:(r=e.key,o=e.operator,a=e.value,u=e.strict\|\|!1),!u&&(a===""\|\|a==null\|\|k(a)&&a.length===0))return{valid:!0,score:1};const f=P(n,r);if(u){if(o==="any"){if(typeof f!="string"\|\|typeof a!="string")return{valid:!1,score:0};const c=W(f,a);return{valid:c>=t,score:c>=t?c:0}}{const c=z(o,f,a);return{valid:c,score:c?1:0}}}if(o==="any"){if(typeof f!="string"\|\|typeof a!="string")return{valid:!1,score:0};const c=W(f,a);return c<t?{valid:!1,score:0}:{valid:!0,score:c}}{const c=z(o,f,a);return{valid:c,score:c?1:0}}}function U(n,e=[],t=.3){if(!e.length)return Array.from(n.values());const r=[];for(const[o,a]of n.entries()){let u=0,f=0,c=!0;for(const g of e){const l=Z(a,g,t);if(!l.valid){c=!1;break}u+=l.score,f++}c&&r.push({item:a,score:f>0?u/f:1})}return r.sort((o,a)=>a.score-o.score),r.map(o=>o.item)}function V(n,e=[],t=.3){const r=new Map;return n.forEach((o,a)=>r.set(String(a),o)),U(r,e,t)}function k(n){return Array.isArray(n)}function p(n){return typeof n=="string"}function C(n){return typeof n=="number"&&!isNaN(n)}function v(n){return n instanceof Date&&!isNaN(n.getTime())}function L(n){return n instanceof Map}function x(n){return n instanceof Set}function T(n){return n==null}function z(n,e,t){if(T(e)&&T(t))return!0;if(T(e)\|\|T(t))return n==="=="?e===t:n==="!="&&e!==t;switch(n){case"==":return e===t;case"!=":return e!==t;case">":return C(e)&&C(t)?e>t:v(e)&&v(t)?e.getTime()>t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)>0;case"<":return C(e)&&C(t)?e<t:v(e)&&v(t)?e.getTime()<t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)<0;case">=":return C(e)&&C(t)?e>=t:v(e)&&v(t)?e.getTime()>=t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)>=0;case"<=":return C(e)&&C(t)?e<=t:v(e)&&v(t)?e.getTime()<=t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)<=0;case"includes":return p(e)?e.toLowerCase().includes(D(t).toLowerCase()):k(e)?e.includes(t):x(e)?e.has(t):!!L(e)&&Array.from(e.values()).includes(t);case"notIncludes":return p(e)?!e.toLowerCase().includes(D(t).toLowerCase()):k(e)?!e.includes(t):x(e)?!e.has(t):!L(e)\|\|!Array.from(e.values()).includes(t);case"startsWith":return!(!p(e)\|\|!p(t))&&e.toLowerCase().startsWith(t.toLowerCase());case"endsWith":return!(!p(e)\|\|!p(t))&&e.toLowerCase().endsWith(t.toLowerCase());case"in":return k(t)?t.includes(e):x(t)?t.has(e):!!L(t)&&(t.has(e)\|\|Array.from(t.values()).includes(e));case"notIn":return k(t)?!t.includes(e):x(t)?!t.has(e):!L(t)\|\|!t.has(e)&&!Array.from(t.values()).includes(e);default:return!1}}const G=U,H=V;function M(n,e){if(n===e)return!0;if(n instanceof Map&&e instanceof Map){if(n.size!==e.size)return!1;for(const[t,r]of n)if(!e.has(t)\|\|!M(r,e.get(t)))return!1;return!0}if(n instanceof Set&&e instanceof Set){if(n.size!==e.size)return!1;for(const t of n)if(!e.has(t))return!1;return!0}if(typeof n=="object"&&n!==null&&typeof e=="object"&&e!==null){const t=Object.keys(n),r=Object.keys(e);if(t.length!==r.length)return!1;for(const o of t)if(!M(n[o],e[o]))return!1;return!0}return!1}function N(n,e){return n.$.pipe(m.map(e),m.distinctUntilChanged(M),m.shareReplay(1))}function d(n,e){return n.$.pipe(m.map(e),m.distinctUntilChanged(M),m.shareReplay(1))}const w=Symbol("selectorCleanup"),b=Symbol("selectorSubscriptions"),S=Symbol("selectorInitialized");function F(n,e=r=>r,t={}){return function(r,o,a){B.property({attribute:!1,type:Object})(r,o);const u=r.connectedCallback,f=r.disconnectedCallback;r.connectedCallback=function(){var y;var c;(c=this)[w]&&!c[w].closed\|\|(c[w]=new m.Subject),c[b]\|\|(c[b]=new Map),c[S]\|\|(c[S]=new Set);const g=function(s){return"set"in s&&typeof s.set=="function"&&s.value instanceof Map}(n)?d(n,e):N(n,e);t.required\|\|this[S].has(o)\|\|(u==null\|\|u.call(this),this[S].add(o)),this[b].has(o)&&((y=this[b].get(o))==null\|\|y.unsubscribe(),this[b].delete(o)),t.debug;const l=g.pipe(K.takeUntil(this[w])).subscribe({next:s=>{var h;const i=t.deepClone?structuredClone(s):s;t.debug,t.updateOnly\|\|(this[o]=i),(h=this.requestUpdate)==null\|\|h.call(this),t.required&&!this[S].has(o)&&i!=null&&(t.debug,u==null\|\|u.call(this),this[S].add(o))},error:s=>{this.isConnected&&setTimeout(()=>{var i;this.isConnected&&(t.debug,(i=this.connectedCallback)==null\|\|i.call(this))},1e3)}});this[b].set(o,l)},r.disconnectedCallback=function(){var c;f==null\|\|f.call(this),t.debug,(c=this)[w]&&(c[w].next(),c[w].complete(),c[w]=void 0),c[b]&&(c[b].forEach(g=>g.unsubscribe()),c[b].clear(),c[b]=void 0),c[S]&&(c[S].clear(),c[S]=void 0)}}}exports.compareValues=z,exports.createArrayContext=function(n=[],e,t="local"){try{return $(n,t,e)}catch{return q(n,"memory",`${e}-fallback`)}},exports.createCollectionSelector=d,exports.createCompoundSelector=function(n,e,t){const r=n.map((c,g)=>{const l=e[g];return"set"in c&&typeof c.set=="function"&&c.value instanceof Map?d(c,l):N(c,l)}),o=m.combineLatest(r).pipe(m.map(c=>t(...c)),m.distinctUntilChanged(M),m.shareReplay(1)),a=n.map((c,g)=>e[g](c.value)),u=t(...a),f=new m.BehaviorSubject(u);return o.subscribe(c=>f.next(c)),{$:f,get value(){return f.getValue()},ready:!0}},exports.createContext=$,exports.createCountSelector=function(n,e){return d(n,t=>e?Array.from(t.entries()).filter(([r,o])=>e(o,r)).length:t.size)},exports.createEntriesSelector=function(n){return d(n,e=>Array.from(e.entries()))},exports.createFilterSelector=function(n,e){return d(n,t=>Array.from(t.entries()).filter(([r,o])=>e(o,r)).map(([r,o])=>o))},exports.createFindSelector=function(n,e){return d(n,t=>{for(const[r,o]of t.entries())if(e(o,r))return o})},exports.createItemSelector=function(n,e){return d(n,t=>t.get(e))},exports.createItemsSelector=function(n){return d(n,e=>Array.from(e.values()))},exports.createKeysSelector=function(n){return d(n,e=>Array.from(e.keys()))},exports.createMapSelector=function(n,e){return d(n,t=>Array.from(t.entries()).map(([r,o])=>e(o,r)))},exports.createOptimizedSelector=function(n,e){return n.$.pipe(m.map(e),m.distinctUntilChanged(M),m.share({resetOnRefCountZero:!0,resetOnError:!1,resetOnComplete:!1}))},exports.createSelector=N,exports.createSortSelector=function(n,e){return d(n,t=>Array.from(t.values()).sort(e))},exports.createTestArrayContext=function(n=[],e="test-array"){try{return $(n,"memory",e)}catch{return q(n,"memory",`${e}-emergency-fallback`)}},exports.filterArray=H,exports.filterArrayItems=V,exports.filterMap=G,exports.filterMapItems=U,exports.getFieldValue=P,exports.isArray=k,exports.isDate=v,exports.isIterable=function(n){return n!=null&&typeof n=="object"&&Symbol.iterator in Object(n)&&typeof n[Symbol.iterator]=="function"},exports.isMap=L,exports.isNil=T,exports.isNumber=C,exports.isPlainObject=function(n){if(n===null\|\|typeof n!="object")return!1;const e=Object.getPrototypeOf(n);return e===Object.prototype\|\|e===null},exports.isSet=x,exports.isString=p,exports.select=F,exports.selectItem=function(n,e,t={}){return function(r,o,a){F(n,function(u){const f=e(this);return f?u.get(f):void 0},t)(r,o)}};
2	+ //# sourceMappingURL=selector-hook-BjCCf3SV.cjs.map

package/dist/selector-hook-BjCCf3SV.cjs.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"selector-hook-BjCCf3SV.cjs","sources":["../src/store/context-create.ts","../src/store/filter-directive.ts","../src/store/selectors.ts","../src/store/selector-hook.ts"],"sourcesContent":["// src/store/context-create.ts - Fixed version\n\nimport { SchmancyArrayStore } from './context-array'\nimport SchmancyCollectionStore from './context-collection'\nimport { SchmancyStoreObject } from './context-object'\nimport { IArrayStore, ICollectionStore, IStore, StorageType } from './types'\n\n/**\n * Type guard to check if an object is empty\n */\nfunction isEmptyObject(obj: unknown): boolean {\n\tif (typeof obj !== 'object' || obj === null) {\n\t\treturn false\n\t}\n\treturn Object.keys(obj).length === 0\n}\n\n/**\n * Type guard for Map objects\n */\nfunction isMap<K, V>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for Array objects\n */\nfunction isArray<T>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for plain objects (not arrays, maps, null, etc.)\n */\nfunction isPlainObject(value: unknown): boolean {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!Array.isArray(value) &&\n\t\t!(value instanceof Map) &&\n\t\t!(value instanceof Set) &&\n\t\t!(value instanceof Date) &&\n\t\t!(value instanceof RegExp) &&\n\t\tObject.getPrototypeOf(value) === Object.prototype\n\t)\n}\n\n/**\n * Creates a regular object store with better typing and error handling\n */\nfunction createObjectStore<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T> {\n\ttry {\n\t\t// Validate storage type\n\t\tif (storage === 'indexeddb') {\n\t\t\tconsole.warn(`IndexedDB storage is not optimal for plain objects. Using 'local' instead for key: ${key}`)\n\t\t\tstorage = 'local'\n\t\t}\n\n\t\t// Ensure initialData is a plain object\n\t\tif (!isPlainObject(initialData)) {\n\t\t\tconsole.warn(`Initial data is not a plain object. Converting to object for key: ${key}`)\n\t\t\tinitialData = { ...initialData } as T\n\t\t}\n\n\t\t// Create the store instance\n\t\tconst store = SchmancyStoreObject.getInstance<T>(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (isEmptyObject(store.value)) {\n\t\t\tstore.set({ ...initialData }) // Use spread to create a copy\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create object store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyStoreObject.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tinitialData,\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates a collection store with better typing and error handling\n */\nfunction createCollectionStore<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyCollectionStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.size) {\n\t\t\t// Create a new Map instance to avoid modifying the input\n\t\t\tstore.replace(new Map(initialData))\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create collection store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyCollectionStore.getInstance<V>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tnew Map(initialData),\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates an array store with better typing and error handling\n */\nfunction createArrayStore<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyArrayStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.length) {\n\t\t\t// Create a new array instance to avoid modifying the input\n\t\t\tstore.replace([...initialData])\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyArrayStore.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\t[...initialData],\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n// Function overloads for better type inference\n/**\n * Creates a context for managing object state\n * @param initialData The initial object data\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A store instance for the object\n */\nexport function createContext<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T>\n\n/**\n * Creates a context for managing collection state\n * @param initialData The initial Map collection\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A collection store instance\n */\nexport function createContext<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V>\n\n/**\n * Creates a context for managing array state\n * @param initialData The initial array\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns An array store instance\n */\nexport function createContext<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T>\n\n/**\n * Implementation of the createContext function with complete type checking\n * and robust error handling\n */\nexport function createContext<T extends Record<string, any> | Map<string, any> | any[]>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n):\n\t| (IStore<T> & SchmancyStoreObject<T>)\n\t| (ICollectionStore<any> & SchmancyCollectionStore<any>)\n\t| (IArrayStore<any> & SchmancyArrayStore<any>) {\n\ttry {\n\t\t// Validate input\n\t\tif (initialData === null || initialData === undefined) {\n\t\t\tconsole.error('Initial data cannot be null or undefined')\n\t\t\t// Provide a sensible default based on type expected\n\t\t\tif (key.includes('collection') || key.includes('map')) {\n\t\t\t\tinitialData = new Map() as unknown as T\n\t\t\t} else if (key.includes('array') || key.includes('list')) {\n\t\t\t\tinitialData = [] as unknown as T\n\t\t\t} else {\n\t\t\t\tinitialData = {} as T\n\t\t\t}\n\t\t}\n\n\t\t// Determine store type based on input data with improved type checking\n\t\tif (isMap<string, any>(initialData)) {\n\t\t\treturn createCollectionStore<any>(initialData, storage, key)\n\t\t} else if (isArray<any>(initialData)) {\n\t\t\treturn createArrayStore<any>(initialData, storage, key)\n\t\t} else if (typeof initialData === 'object') {\n\t\t\treturn createObjectStore<any>(initialData as Record<string, any>, storage, key)\n\t\t} else {\n\t\t\t// Handle non-object data by wrapping it\n\t\t\tconsole.warn(`Initial data must be an object, array, or Map. Got ${typeof initialData}. Creating object wrapper.`)\n\t\t\treturn createObjectStore<any>({ value: initialData } as Record<string, any>, storage, key)\n\t\t}\n\t} catch (error) {\n\t\t// Last-resort error handling\n\t\tconsole.error(`Fatal error creating context for ${key}:`, error)\n\n\t\t// Create an emergency fallback store that won't throw\n\t\treturn createObjectStore<any>(\n\t\t\ttypeof initialData === 'object' && initialData !== null ? { ...initialData } : { value: initialData },\n\t\t\t'memory',\n\t\t\t`emergency-fallback-${key}`,\n\t\t)\n\t}\n}\n\n/**\n * Creates an array context with simplified API and type inference\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @param storage Storage type to use (defaults to 'local')\n * @returns An array store instance\n */\nexport function createArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string,\n\tstorage: StorageType = 'local',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, storage, key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array context for key: ${key}`, err)\n\t\t// Return a fallback store\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-fallback`)\n\t}\n}\n\n/**\n * Creates a testable array context\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @returns An array store that uses memory storage\n */\nexport function createTestArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string = 'test-array',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, 'memory', key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create test array context for key: ${key}`, err)\n\t\t// Return a fallback store with a different key\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-emergency-fallback`)\n\t}\n}\n","// src/store/filter-directive.ts\n\n/** Supported comparison operators with TypeScript literal types */\nexport type ComparisonOperator =\n\t| '=='\n\t| '!='\n\t| '>'\n\t| '<'\n\t| '>='\n\t| '<='\n\t| 'includes'\n\t| 'notIncludes'\n\t| 'startsWith'\n\t| 'endsWith'\n\t| 'in'\n\t| 'notIn'\n\t| 'any' // fuzzy search operator\n\n/**\n * Type-safe condition tuple\n */\nexport type ConditionTuple = [field: string, op: ComparisonOperator, expected: unknown, strict?: boolean]\n\n/**\n * Type-safe condition object\n */\nexport interface ConditionObject {\n\tkey: string\n\toperator: ComparisonOperator\n\tvalue: unknown\n\tstrict?: boolean\n}\n\n/**\n * Unified query condition type\n */\nexport type QueryCondition = ConditionTuple | ConditionObject\n\n/**\n * Filter result with item and score\n */\nexport interface ScoredItem<T> {\n\titem: T\n\tscore: number\n}\n\n/**\n * Get a nested value from an object using a dot-separated path.\n * Checks explicitly for null/undefined so falsy values like 0 or false are preserved.\n */\nexport const getFieldValue = <T = any>(item: Record<string, any>, path: string): T => {\n\tif (!path) return item as unknown as T\n\n\tconst parts = path.split('.')\n\tlet value: any = item\n\n\tfor (const part of parts) {\n\t\tif (value == null) return undefined as unknown as T\n\t\tvalue = value[part]\n\t}\n\n\treturn value as T\n}\n\n/**\n * Compute the Levenshtein distance between two strings.\n */\nconst levenshtein = (a: string, b: string): number => {\n\tif (a === b) return 0\n\n\tconst matrix: number[][] = Array(b.length + 1)\n\t\t.fill(null)\n\t\t.map((_, i) => [i])\n\n\t// initialize the first row\n\tfor (let j = 0; j <= a.length; j++) {\n\t\tmatrix[0][j] = j\n\t}\n\n\tfor (let i = 1; i <= b.length; i++) {\n\t\tfor (let j = 1; j <= a.length; j++) {\n\t\t\tif (b.charAt(i - 1) === a.charAt(j - 1)) {\n\t\t\t\tmatrix[i][j] = matrix[i - 1][j - 1]\n\t\t\t} else {\n\t\t\t\tmatrix[i][j] = Math.min(\n\t\t\t\t\tmatrix[i - 1][j] + 1, // deletion\n\t\t\t\t\tmatrix[i][j - 1] + 1, // insertion\n\t\t\t\t\tmatrix[i - 1][j - 1] + 1, // substitution\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n\treturn matrix[b.length][a.length]\n}\n\n/**\n * Check if string `sub` is a subsequence of string `str`.\n * All characters in `sub` must appear in order in `str` (they need not be contiguous).\n */\nconst isSubsequence = (sub: string, str: string): boolean => {\n\tif (!sub) return true\n\tif (!str) return false\n\n\tlet i = 0,\n\t\tj = 0\n\twhile (i < sub.length && j < str.length) {\n\t\tif (sub[i].toLowerCase() === str[j].toLowerCase()) i++\n\t\tj++\n\t}\n\treturn i === sub.length\n}\n\n/**\n * Check if every character (with frequency) in the query exists in the target.\n * For example, \"aovc\" matches \"avocados\".\n */\nconst anagramMatch = (query: string, target: string): boolean => {\n\tif (!query) return true\n\tif (!target) return false\n\n\tconst countChars = (s: string): Record<string, number> =>\n\t\ts\n\t\t\t.toLowerCase()\n\t\t\t.split('')\n\t\t\t.reduce(\n\t\t\t\t(acc, char) => {\n\t\t\t\t\tacc[char] = (acc[char] || 0) + 1\n\t\t\t\t\treturn acc\n\t\t\t\t},\n\t\t\t\t{} as Record<string, number>,\n\t\t\t)\n\n\tconst queryCount = countChars(query)\n\tconst targetCount = countChars(target)\n\treturn Object.keys(queryCount).every(char => (targetCount[char] || 0) >= queryCount[char])\n}\n\n/**\n * Generate bigrams for a string.\n */\nconst getBigrams = (s: string): string[] => {\n\tif (!s || s.length < 2) return []\n\n\tconst bigrams: string[] = []\n\tfor (let i = 0; i < s.length - 1; i++) {\n\t\tbigrams.push(s.substring(i, i + 2).toLowerCase())\n\t}\n\treturn bigrams\n}\n\n/**\n * Compute Dice's coefficient for two strings based on bigrams.\n * Returns a value between 0 (no similarity) and 1 (perfect match).\n */\nconst diceCoefficient = (s1: string, s2: string): number => {\n\tif (!s1 || !s2 || s1.length < 2 || s2.length < 2) return 0\n\n\tconst bigrams1 = getBigrams(s1)\n\tconst bigrams2 = getBigrams(s2)\n\n\tif (bigrams1.length === 0 || bigrams2.length === 0) return 0\n\n\tlet intersection = 0\n\tconst used = new Array(bigrams2.length).fill(false)\n\n\tfor (const bigram of bigrams1) {\n\t\tfor (let i = 0; i < bigrams2.length; i++) {\n\t\t\tif (!used[i] && bigrams2[i] === bigram) {\n\t\t\t\tintersection++\n\t\t\t\tused[i] = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (2 * intersection) / (bigrams1.length + bigrams2.length)\n}\n\n/**\n * Compute a fuzzy similarity score between two strings.\n * The score is computed by taking the maximum of several methods:\n * - Direct substring match (score 1)\n * - Subsequence check (score 0.8)\n * - Anagram subset match (score 0.7)\n * - Dice coefficient\n * - Normalized Levenshtein similarity\n */\nconst computeFuzzyScore = (actual: string, expected: string): number => {\n\tif (!actual || !expected) return 0\n\n\tconst a = actual.toLowerCase().trim()\n\tconst b = expected.toLowerCase().trim()\n\n\tif (a === b) return 1\n\n\tconst substringScore = a.includes(b) ? 1 : 0\n\tconst subsequenceScore = isSubsequence(b, a) ? 0.8 : 0\n\tconst anagramScore = anagramMatch(b, a) ? 0.7 : 0\n\tconst diceScore = diceCoefficient(a, b)\n\n\tconst maxLen = Math.max(a.length, b.length)\n\tconst levenshteinScore = maxLen ? 1 - levenshtein(a, b) / maxLen : 0\n\n\treturn Math.max(substringScore, subsequenceScore, anagramScore, diceScore, levenshteinScore)\n}\n\n/**\n * Safely coerce value to string if possible, or return empty string\n */\nconst safeString = (value: unknown): string => {\n\tif (value == null) return ''\n\treturn String(value)\n}\n\n/**\n * Apply a query condition to an item and return score\n */\nfunction applyQueryCondition<T extends Record<string, any>>(\n\titem: T,\n\tquery: QueryCondition,\n\tfuzzyThreshold: number = 0.3,\n): { valid: boolean; score: number } {\n\tlet field: string,\n\t\top: ComparisonOperator,\n\t\texpected: unknown,\n\t\tstrict = false\n\n\tif (Array.isArray(query)) {\n\t\t;[field, op, expected, strict = false] = query\n\t} else {\n\t\tfield = query.key\n\t\top = query.operator\n\t\texpected = query.value\n\t\tstrict = query.strict || false\n\t}\n\n\t// Skip empty filters for non-strict queries\n\tif (!strict && (expected === '' || expected == null || (isArray(expected) && expected.length === 0))) {\n\t\treturn { valid: true, score: 1 }\n\t}\n\n\tconst actual = getFieldValue(item, field)\n\n\t// FIXED: Properly handle strict mode\n\tif (strict) {\n\t\t// For strict mode, use exact equality comparison for all operators except 'any'\n\t\tif (op === 'any') {\n\t\t\t// Fuzzy search still applies with strict mode\n\t\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\t\treturn { valid: false, score: 0 }\n\t\t\t}\n\n\t\t\tconst score = computeFuzzyScore(actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: score >= fuzzyThreshold,\n\t\t\t\tscore: score >= fuzzyThreshold ? score : 0,\n\t\t\t}\n\t\t} else {\n\t\t\t// For all other operators in strict mode,\n\t\t\t// delegate to compareValues function but return precise scores\n\t\t\tconst matches = compareValues(op, actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: matches,\n\t\t\t\tscore: matches ? 1 : 0,\n\t\t\t}\n\t\t}\n\t} else if (op === 'any') {\n\t\t// Fuzzy search requires both values to be strings\n\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\tconst score = computeFuzzyScore(actual, expected)\n\t\tif (score < fuzzyThreshold) {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\treturn { valid: true, score }\n\t} else {\n\t\t// For non-fuzzy operators, check condition\n\t\tconst matches = compareValues(op, actual, expected)\n\t\treturn {\n\t\t\tvalid: matches,\n\t\t\tscore: matches ? 1 : 0,\n\t\t}\n\t}\n}\n\n/**\n * Filter a Map of items given an array of query conditions.\n * For each query condition:\n * - If the expected value is empty/null/undefined, it is treated as a match.\n * - For non-fuzzy operators, the condition must strictly match.\n * - For the \"any\" operator, a fuzzy similarity score is computed.\n * Items with a fuzzy score below a given threshold (e.g., 0.3) are excluded.\n *\n * The overall item score is the average of the scores from all conditions.\n * The results are sorted in descending order of relevance.\n *\n * @param items - A Map containing items to filter.\n * @param queries - An array of query conditions to apply.\n * @param fuzzyThreshold - Minimum score required for fuzzy matches (default: 0.3)\n * @returns An array of items that match all query conditions, sorted by relevance.\n */\nexport function filterMapItems<T extends Record<string, any>>(\n\titems: Map<string, T>,\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// If no queries, return all items unsorted\n\tif (!queries.length) {\n\t\treturn Array.from(items.values())\n\t}\n\n\t// Score and filter each item\n\tconst scoredItems: ScoredItem<T>[] = []\n\n\tfor (const [_, item] of items.entries()) {\n\t\tlet totalScore = 0\n\t\tlet matchCount = 0\n\t\tlet valid = true\n\n\t\tfor (const query of queries) {\n\t\t\tconst result = applyQueryCondition(item, query, fuzzyThreshold)\n\n\t\t\tif (!result.valid) {\n\t\t\t\tvalid = false\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\ttotalScore += result.score\n\t\t\tmatchCount++\n\t\t}\n\n\t\tif (valid) {\n\t\t\tscoredItems.push({\n\t\t\t\titem,\n\t\t\t\tscore: matchCount > 0 ? totalScore / matchCount : 1,\n\t\t\t})\n\t\t}\n\t}\n\n\t// Sort by descending score\n\tscoredItems.sort((a, b) => b.score - a.score)\n\n\treturn scoredItems.map(x => x.item)\n}\n\n/**\n * Filter an array of items using query conditions\n */\nexport function filterArrayItems<T extends Record<string, any>>(\n\titems: T[],\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// Create temporary map with numeric indices as keys\n\tconst map = new Map<string, T>()\n\titems.forEach((item, index) => map.set(String(index), item))\n\n\treturn filterMapItems(map, queries, fuzzyThreshold)\n}\n\n// Improved type guards for filter-directive.ts\n\n/**\n * Type guard for checking if a value is an array with better type inference\n * @param value Value to check\n * @returns True if the value is an array\n */\nexport function isArray<T = unknown>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for checking if a value is a string\n * @param value Value to check\n * @returns True if the value is a string\n */\nexport function isString(value: unknown): value is string {\n\treturn typeof value === 'string'\n}\n\n/**\n * Type guard for checking if a value is a number\n * @param value Value to check\n * @returns True if the value is a number and not NaN\n */\nexport function isNumber(value: unknown): value is number {\n\treturn typeof value === 'number' && !isNaN(value)\n}\n\n/**\n * Type guard for checking if a value is a date\n * @param value Value to check\n * @returns True if the value is a valid Date object\n */\nexport function isDate(value: unknown): value is Date {\n\treturn value instanceof Date && !isNaN(value.getTime())\n}\n\n/**\n * Type guard for checking if a value is an iterable collection\n * @param value Value to check\n * @returns True if the value implements the iterable protocol\n */\nexport function isIterable<T = unknown>(value: unknown): value is Iterable<T> {\n\t// Must be non-null and of type 'object'\n\tif (value == null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\t// Check for Symbol.iterator method\n\treturn Symbol.iterator in Object(value) && typeof (value as any)[Symbol.iterator] === 'function'\n}\n\n/**\n * Type guard for checking if a value is a Map\n * @param value Value to check\n * @returns True if the value is a Map\n */\nexport function isMap<K = unknown, V = unknown>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for checking if a value is a Set\n * @param value Value to check\n * @returns True if the value is a Set\n */\nexport function isSet<T = unknown>(value: unknown): value is Set<T> {\n\treturn value instanceof Set\n}\n\n/**\n * Type guard for checking if a value is a plain object (not an array, Map, etc.)\n * @param value Value to check\n * @returns True if the value is a plain object\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n\tif (value === null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\tconst proto = Object.getPrototypeOf(value)\n\treturn proto === Object.prototype || proto === null\n}\n\n/**\n * Type guard for checking if a value is undefined or null\n * @param value Value to check\n * @returns True if the value is undefined or null\n */\nexport function isNil(value: unknown): value is undefined | null {\n\treturn value === undefined || value === null\n}\n\n/**\n * Improved type-safe comparison function that uses appropriate type guards\n * @param op Comparison operator\n * @param actual Actual value\n * @param expected Expected value\n * @returns Result of the comparison\n */\nexport function compareValues(op: ComparisonOperator, actual: unknown, expected: unknown): boolean {\n\t// Handle null/undefined cases\n\tif (isNil(actual) && isNil(expected)) return true\n\tif (isNil(actual) || isNil(expected)) {\n\t\t// For equality operators, null == null but null != non-null\n\t\tif (op === '==') return actual === expected\n\t\tif (op === '!=') return actual !== expected\n\t\t// Other operators should return false for null/undefined values\n\t\treturn false\n\t}\n\n\tswitch (op) {\n\t\tcase '==':\n\t\t\treturn actual === expected\n\t\tcase '!=':\n\t\t\treturn actual !== expected\n\t\tcase '>':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual > expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() > expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) > 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual < expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() < expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) < 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '>=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual >= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() >= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) >= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual <= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() <= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) <= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase 'includes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIncludes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn !actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn !actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn !actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn !Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tcase 'startsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().startsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'endsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().endsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'in': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn expected.has(actual as any) || Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIn': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn !expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn !expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn !expected.has(actual as any) && !Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tdefault: {\n\t\t\tconsole.warn(`Operator \"${op}\" is not supported in comparison.`)\n\t\t\treturn false\n\t\t}\n\t}\n}\n\n// Export a simpler alias for filterMapItems\nexport const filterMap = filterMapItems\n\n// Export an alias for filterArrayItems\nexport const filterArray = filterArrayItems\n","// src/store/selectors.ts\nimport { BehaviorSubject, Observable, combineLatest, distinctUntilChanged, map, share, shareReplay } from 'rxjs'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Deep equality comparison for maps and complex objects\n * More efficient than JSON.stringify for large objects\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true\n\n\tif (a instanceof Map && b instanceof Map) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const [key, value] of a) {\n\t\t\tif (!b.has(key) || !deepEqual(value, b.get(key))) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Set && b instanceof Set) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const item of a) {\n\t\t\tif (!b.has(item)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null) {\n\t\tconst keysA = Object.keys(a)\n\t\tconst keysB = Object.keys(b)\n\n\t\tif (keysA.length !== keysB.length) return false\n\n\t\tfor (const key of keysA) {\n\t\t\t// @ts-ignore: Index signature\n\t\t\tif (!deepEqual(a[key], b[key])) return false\n\t\t}\n\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n/**\n * Creates a selector that derives a value from store state\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector for collection stores that derives a value from the collection\n *\n * @param store The collection store to observe\n * @param selectorFn Function that transforms the collection\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createCollectionSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tselectorFn: (state: Map<string, T>) => R,\n): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector that returns all items from a collection as an array\n *\n * @param store The collection store\n * @returns An observable of all items as an array\n */\nexport function createItemsSelector<T>(store: ICollectionStore<T>): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.values()))\n}\n\n/**\n * Creates a selector that retrieves a single item from a collection\n *\n * @param store The collection store\n * @param itemKey The key of the item to select\n * @returns An observable of the selected item that emits when the item changes\n */\nexport function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => collection.get(itemKey))\n}\n\nexport function createCompoundSelector<R>(\n\tstores: Array<IStore<any> | ICollectionStore<any>>,\n\tselectorFns: Array<(state: any) => any>,\n\tcombinerFn: (...values: any[]) => R,\n): Partial<IStore<R>> {\n\t// Create observables for each store\n\tconst observables = stores.map((store, index) => {\n\t\tconst selectorFn = selectorFns[index]\n\n\t\t// Check if it's a collection store\n\t\tif ('set' in store && typeof store.set === 'function' && store.value instanceof Map) {\n\t\t\treturn createCollectionSelector(store as ICollectionStore<any>, selectorFn)\n\t\t} else {\n\t\t\treturn createSelector(store as IStore<any>, selectorFn)\n\t\t}\n\t})\n\n\t// Combine the observables\n\tconst observable = combineLatest(observables).pipe(\n\t\tmap(values => combinerFn(...values)),\n\t\tdistinctUntilChanged(deepEqual),\n\t\tshareReplay(1),\n\t)\n\n\t// Compute initial value from source stores\n\tconst initialValues = stores.map((store, index) => selectorFns[index](store.value))\n\n\tconst initialValue = combinerFn(...initialValues)\n\n\t// Create BehaviorSubject with initial value\n\tconst behaviorSubject = new BehaviorSubject<R>(initialValue)\n\n\t// Subscribe to updates\n\tobservable.subscribe(value => behaviorSubject.next(value as R))\n\n\t// Return minimal store-compatible object\n\treturn {\n\t\t$: behaviorSubject,\n\t\tget value() {\n\t\t\treturn behaviorSubject.getValue()\n\t\t},\n\t\tready: true,\n\t}\n}\n/**\n * Creates a selector that returns all keys from a collection\n */\nexport function createKeysSelector<T>(store: ICollectionStore<T>): Observable<string[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.keys()))\n}\n\n/**\n * Creates a selector that returns entries (key-value pairs) from a collection\n */\nexport function createEntriesSelector<T>(store: ICollectionStore<T>): Observable<[string, T][]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.entries()))\n}\n\n/**\n * Creates a selector that sorts collection items\n */\nexport function createSortSelector<T>(store: ICollectionStore<T>, compareFn: (a: T, b: T) => number): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => {\n\t\treturn Array.from(collection.values()).sort(compareFn)\n\t})\n}\n\n/**\n * Creates a selector that finds the first item matching a predicate\n */\nexport function createFindSelector<T>(\n\tstore: ICollectionStore<T>,\n\tpredicate: (item: T, key: string) => boolean,\n): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => {\n\t\tfor (const [key, item] of collection.entries()) {\n\t\t\tif (predicate(item, key)) {\n\t\t\t\treturn item\n\t\t\t}\n\t\t}\n\t\treturn undefined\n\t})\n}\n\n/**\n * Creates a selector that filters items from a collection - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Function that returns true for items to include\n * @returns An observable of filtered items as an array\n */\nexport function createFilterSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn: (item: T, key: string) => boolean,\n): Observable<T[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries())\n\t\t\t.filter(([key, item]) => filterFn(item, key))\n\t\t\t.map(([_, item]) => item),\n\t)\n}\n\n/**\n * Creates a selector that maps collection values through a transform function - OPTIMIZED\n */\nexport function createMapSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tmapFn: (item: T, key: string) => R,\n): Observable<R[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries()).map(([key, item]) => mapFn(item, key)),\n\t)\n}\n\n/**\n * Creates a selector that counts items in a collection, optionally filtered - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Optional function to filter which items to count\n * @returns An observable of the count\n */\nexport function createCountSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn?: (item: T, key: string) => boolean,\n): Observable<number> {\n\treturn createCollectionSelector(store, collection => {\n\t\tif (!filterFn) return collection.size\n\n\t\treturn Array.from(collection.entries()).filter(([key, item]) => filterFn(item, key)).length\n\t})\n}\n\n/**\n * Optimized RxJS Pipeline - use share with reset on refCount zero for better memory management\n * in scenarios where selector subscriptions come and go\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state with improved memory management\n */\nexport function createOptimizedSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(\n\t\tmap(selectorFn),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshare({\n\t\t\tresetOnRefCountZero: true,\n\t\t\tresetOnError: false,\n\t\t\tresetOnComplete: false,\n\t\t}),\n\t)\n}\n","// src/store/selector-hook.ts - Improved memory management\nimport { property as litProperty } from 'lit/decorators.js'\nimport { Observable, Subject, Subscription } from 'rxjs'\nimport { takeUntil } from 'rxjs/operators'\nimport { createCollectionSelector, createSelector } from './selectors'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Symbol used for storing cleanup resources\n * Using a Symbol prevents name collisions with component properties\n */\nconst CLEANUP_SUBJECT = Symbol('selectorCleanup')\nconst SUBSCRIPTIONS = Symbol('selectorSubscriptions')\nconst INITIALIZED = Symbol('selectorInitialized')\n\n/**\n * Component lifecycle interface\n */\ninterface ComponentWithLifecycle {\n\t// Lifecycle hooks\n\tisConnected: boolean\n\tdisconnectedCallback?: () => void\n\tconnectedCallback?: () => void\n\trequestUpdate?: () => void\n\n\t// Internal properties using symbols to avoid name collisions\n\t[CLEANUP_SUBJECT]?: Subject<void>\n\t[SUBSCRIPTIONS]?: Map<string, Subscription>\n\t[INITIALIZED]?: Set<string>\n\n\t// Value storage\n\t[key: string]: any\n}\n\n/**\n * Property descriptor interface\n */\ntype PropertyDescriptor<T> = {\n\tget?: () => T\n\tset?: (value: T) => void\n\tvalue?: T\n\tconfigurable?: boolean\n\tenumerable?: boolean\n\twritable?: boolean\n}\n\n/**\n * Options for selecting from a store\n */\ninterface SelectOptions {\n\t/** If true, will wait for selector to emit a non-null value before calling connectedCallback */\n\trequired?: boolean\n\n\t/** If true, will only update the component and not set the property value */\n\tupdateOnly?: boolean\n\n\t/** If true, will use structuredClone to deeply clone values (prevents mutations) */\n\tdeepClone?: boolean\n\n\t/** Custom equality function to determine when to update */\n\tequals?: (a: any, b: any) => boolean\n\n\t/** Debug mode - logs selector activity */\n\tdebug?: boolean\n}\n\n/**\n * Type guard to check if a store is a collection store\n */\nfunction isCollectionStore<T>(store: IStore<any> | ICollectionStore<T>): store is ICollectionStore<T> {\n\treturn 'set' in store && typeof store.set === 'function' && store.value instanceof Map\n}\n\n/**\n * Ensures the cleanup resources exist on the component\n */\nfunction ensureCleanupResources(component: ComponentWithLifecycle): void {\n\tif (!component[CLEANUP_SUBJECT] || component[CLEANUP_SUBJECT].closed) {\n\t\tcomponent[CLEANUP_SUBJECT] = new Subject<void>()\n\t}\n\n\tif (!component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS] = new Map()\n\t}\n\n\tif (!component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED] = new Set()\n\t}\n}\n\n/**\n * Cleans up all selector resources\n */\nfunction cleanupSelectorResources(component: ComponentWithLifecycle): void {\n\tif (component[CLEANUP_SUBJECT]) {\n\t\tcomponent[CLEANUP_SUBJECT].next()\n\t\tcomponent[CLEANUP_SUBJECT].complete()\n\t\tcomponent[CLEANUP_SUBJECT] = undefined\n\t}\n\n\tif (component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS].forEach(sub => sub.unsubscribe())\n\t\tcomponent[SUBSCRIPTIONS].clear()\n\t\tcomponent[SUBSCRIPTIONS] = undefined\n\t}\n\n\tif (component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED].clear()\n\t\tcomponent[INITIALIZED] = undefined\n\t}\n}\n\n/**\n * Selector decorator that connects a component property to a store selector\n * with improved memory management\n *\n * @param store The store to select from\n * @param selectorFn Optional function to transform the store state\n * @param options Additional options for the selector\n */\nexport function select<T, R>(\n\tstore: IStore<T> | ICollectionStore<T>,\n\tselectorFn: (state: any) => R = (state: R) => state,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<R>) {\n\t\t// Register as a Lit property\n\t\tlitProperty({ attribute: false, type: Object })(proto, propName)\n\n\t\t// Store original lifecycle methods\n\t\tconst originalConnectedCallback = proto.connectedCallback\n\t\tconst originalDisconnectedCallback = proto.disconnectedCallback\n\n\t\t// Override connectedCallback to set up subscription\n\t\tproto.connectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Initialize cleanup resources\n\t\t\tensureCleanupResources(this)\n\n\t\t\t// Create the appropriate selector\n\t\t\tconst selector: Observable<R> = isCollectionStore(store)\n\t\t\t\t? createCollectionSelector(store, selectorFn)\n\t\t\t\t: createSelector(store as IStore<T>, selectorFn)\n\n\t\t\t// Call original connectedCallback immediately if not waiting for data\n\t\t\tif (!options.required && !this[INITIALIZED]!.has(propName)) {\n\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t}\n\n\t\t\t// Clean up any existing subscription\n\t\t\tif (this[SUBSCRIPTIONS]!.has(propName)) {\n\t\t\t\tthis[SUBSCRIPTIONS]!.get(propName)?.unsubscribe()\n\t\t\t\tthis[SUBSCRIPTIONS]!.delete(propName)\n\t\t\t}\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Setting up subscription for ${propName}`)\n\t\t\t}\n\n\t\t\t// Create new subscription with better error handling\n\t\t\tconst subscription = selector.pipe(takeUntil(this[CLEANUP_SUBJECT]!)).subscribe({\n\t\t\t\tnext: (value: R) => {\n\t\t\t\t\t// Handle value updates\n\t\t\t\t\tconst newValue = options.deepClone ? structuredClone(value) : value\n\n\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\tconsole.debug(`[select] New value for ${propName}:`, newValue)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!options.updateOnly) {\n\t\t\t\t\t\tthis[propName] = newValue\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.requestUpdate?.()\n\n\t\t\t\t\t// If required and not initialized, call connectedCallback when we get a value\n\t\t\t\t\tif (options.required && !this[INITIALIZED]!.has(propName) && newValue !== null && newValue !== undefined) {\n\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\tconsole.debug(`[select] Calling delayed connectedCallback for ${propName}`)\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\terror: (err: Error) => {\n\t\t\t\t\tconsole.error(`Error in selector subscription for ${propName}:`, err)\n\t\t\t\t\t// Resubscribe on error to prevent component from becoming unresponsive\n\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t// Small delay to prevent immediate resubscription\n\t\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\t\tconsole.debug(`[select] Resubscribing after error for ${propName}`)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tthis.connectedCallback?.()\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}, 1000)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\n\t\t\t// Store the subscription for cleanup\n\t\t\tthis[SUBSCRIPTIONS]!.set(propName, subscription)\n\t\t}\n\n\t\t// Override disconnectedCallback to clean up subscriptions\n\t\tproto.disconnectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Call original disconnectedCallback\n\t\t\toriginalDisconnectedCallback?.call(this)\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Cleaning up resources in disconnectedCallback`)\n\t\t\t}\n\n\t\t\t// Clean up all subscription resources\n\t\t\tcleanupSelectorResources(this)\n\t\t}\n\t}\n}\n\n/**\n * Creates a selector decorator that selects a specific item from a collection store\n * with improved memory management\n *\n * @param store The collection store\n * @param keyGetter Function that returns the key to select\n * @param options Additional options\n */\nexport function selectItem<T>(\n\tstore: ICollectionStore<T>,\n\tkeyGetter: (component: any) => string,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<T | undefined>) {\n\t\tselect(\n\t\t\tstore,\n\t\t\tfunction (state) {\n\t\t\t\t// This will be evaluated during subscription, when 'this' is available\n\t\t\t\tconst itemKey = keyGetter(this)\n\t\t\t\treturn itemKey ? state.get(itemKey) : undefined\n\t\t\t},\n\t\t\toptions,\n\t\t)(proto, propName)\n\t}\n}\n"],"names":["createObjectStore","initialData","storage","key","value","Array","isArray","Map","Set","Date","RegExp","Object","getPrototypeOf","prototype","store","SchmancyStoreObject","getInstance","obj","keys","length","set","createArrayStore","SchmancyArrayStore","replace","err","createContext","includes","SchmancyCollectionStore","size","error","getFieldValue","item","path","parts","split","part","getBigrams","s","bigrams","i","push","substring","toLowerCase","computeFuzzyScore","actual","expected","a","trim","b","substringScore","subsequenceScore","sub","str","j","anagramScore","query","target","countChars","reduce","acc","char","queryCount","targetCount","every","diceScore","s1","s2","bigrams1","bigrams2","intersection","used","fill","bigram","maxLen","Math","max","levenshteinScore","matrix","map","_","charAt","min","safeString","String","applyQueryCondition","fuzzyThreshold","field","op","strict","operator","valid","score","matches","compareValues","filterMapItems","items","queries","from","values","scoredItems","entries","totalScore","matchCount","result","sort","x","filterArrayItems","forEach","index","isString","isNumber","isNaN","isDate","getTime","isMap","isSet","isNil","t","localeCompare","has","startsWith","endsWith","filterMap","filterArray","deepEqual","get","keysA","keysB","createSelector","selectorFn","$","pipe","distinctUntilChanged","shareReplay","createCollectionSelector","CLEANUP_SUBJECT","Symbol","SUBSCRIPTIONS","INITIALIZED","select","state","options","proto","propName","_descriptor","litProperty","attribute","type","originalConnectedCallback","connectedCallback","originalDisconnectedCallback","disconnectedCallback","component","this","closed","Subject","selector","required","call","add","unsubscribe","delete","debug","subscription","takeUntil","subscribe","next","newValue","deepClone","structuredClone","updateOnly","requestUpdate","isConnected","setTimeout","complete","clear","stores","selectorFns","combinerFn","observables","observable","combineLatest","initialValues","initialValue","behaviorSubject","BehaviorSubject","getValue","ready","filterFn","collection","filter","predicate","itemKey","mapFn","share","resetOnRefCountZero","resetOnError","resetOnComplete","compareFn","iterator","keyGetter"],"mappings":"yIAkDA,EAAA,SAASA,EACRC,EACAC,EACAC,EAAAA,CAEI,GAEa,CAAZD,IAAY,cAELA,EAAA,WAzBUE,EA6BFH,KA3BT,MACHG,OAAAA,GAAU,UAChBC,MAAMC,QAAQF,CACbA,GAAAA,aAAiBG,KACjBH,aAAiBI,KACjBJ,aAAiBK,MACjBL,aAAiBM,QACnBC,OAAOC,eAAeR,CAAAA,IAAWO,OAAOE,aAsBzBZ,EAAA,CAAA,GAAKA,CAIpB,GAAA,MAAMa,EAAQC,EAAAA,oBAAoBC,YAAed,EAASC,EAAKF,CAOxD,EAAA,OAlEcgB,OAAAA,EA8DHH,EAAMV,QA7DN,UAAYa,IAAQ,MAGhCN,OAAOO,KAAKD,CAAAA,EAAKE,SAAW,GA2DjCL,EAAMM,IAAI,CAAA,GAAKnB,CAGTa,CAAAA,EAAAA,OAUA,CAAA,OANeC,EAAAA,oBAAoBC,YACzC,SACA,GAAGb,CAAAA,YACHF,CAGM,CAAA,CA5ET,IAAuBgB,EAwBAb,CAsDvB,CAqCA,SAASiB,EACRpB,EACAC,EACAC,EAEI,CAAA,GAAA,CAEH,MAAMW,EAAQQ,EAAAA,mBAAmBN,YAAYd,EAASC,EAAKF,CAAAA,EAQpD,OALFa,EAAMV,MAAMe,QAEhBL,EAAMS,QAAQ,CAAItB,GAAAA,CAAAA,CAAAA,EAGZa,OACCU,CASD,OANeF,EAAAA,mBAAmBN,YACxC,SACA,GAAGb,CACH,YAAA,CAAA,GAAIF,CAGE,CAAA,CAAA,CAET,CA8CgB,SAAAwB,EACfxB,EACAC,EACAC,EAAAA,CAKI,GAeC,CAAA,OATFF,GAJEA,OAIFA,EADGE,EAAIuB,SAAS,YAAiBvB,GAAAA,EAAIuB,SAAS,KAAA,MAC5BnB,IACRJ,EAAIuB,SAAS,OAAYvB,GAAAA,EAAIuB,SAAS,MAAA,EAClC,CAEA,EAAA,CAAC,GAKMzB,aAxMAM,IAwEzB,SACCN,EACAC,EACAC,EAEI,CAAA,GAAA,CAEH,MAAMW,EAAQa,EAAAA,wBAAwBX,YAAYd,EAASC,EAAKF,CAAAA,EAQzD,OALFa,EAAMV,MAAMwB,MAEhBd,EAAMS,QAAQ,IAAIhB,IAAIN,CAGhBa,CAAAA,EAAAA,OAUA,CAAA,OANea,EAAAA,wBAAwBX,YAC7C,SACA,GAAGb,CAAAA,YACH,IAAII,IAAIN,CAGF,CAAA,CAAA,CAET,EAsGqCA,EAAaC,EAASC,CAnM3D,EAAA,SAAoBC,EACZ,CAAA,OAAAC,MAAMC,QAAQF,CACtB,CAAA,EAkM0BH,CAAAA,EAChBoB,EAAsBpB,EAAaC,EAASC,CAAAA,EAE5CH,EAD0B,OAAhBC,GAAgB,SACHA,EAIA,CAAEG,MAAOH,CAJ2BC,EAAAA,EAASC,QAMpE0B,CAKD,OAAA7B,EACCC,OAAAA,GAAgB,UAAYA,IAAgB,KAAO,CAAKA,GAAAA,CAAAA,EAAgB,CAAEG,MAAOH,CACxF,EAAA,SACA,sBAAsBE,CAAAA,EAAAA,CACvB,CAEF,CCjMa,MAAA2B,EAAgB,CAAUC,EAA2BC,IAC7D,CAAA,GAAA,CAACA,EAAa,OAAAD,EAEZ,MAAAE,EAAQD,EAAKE,MAAM,GAAA,EACzB,IAAI9B,EAAa2B,EAEjB,UAAWI,KAAQF,EAAO,CACrB,GAAA7B,GAAS,KAAa,OAC1BA,EAAQA,EAAM+B,CAAAA,CAAI,CAGZ,OAAA/B,CAAA,EA+EFgC,EAAcC,GAAAA,CACnB,GAAKA,CAAAA,GAAKA,EAAElB,OAAS,QAAU,CAE/B,EAAA,MAAMmB,EAAoB,CAAA,EAC1B,QAASC,EAAI,EAAGA,EAAIF,EAAElB,OAAS,EAAGoB,IACzBD,EAAAE,KAAKH,EAAEI,UAAUF,EAAGA,EAAI,CAAA,EAAGG,YAE7B,CAAA,EAAA,OAAAJ,CAAA,EAwCFK,EAAoB,CAACC,EAAgBC,IAAAA,CAC1C,GAAKD,CAAAA,GAAAA,CAAWC,EAAiB,MAAA,GAEjC,MAAMC,EAAIF,EAAOF,YAAcK,EAAAA,KAAAA,EACzBC,EAAIH,EAASH,YAAcK,EAAAA,KAAAA,EAE7B,GAAAD,IAAME,EAAU,MAAA,GAEpB,MAAMC,EAAiBH,EAAEpB,SAASsB,CAAAA,EAAK,EAAI,EACrCE,GAjGe,CAACC,EAAaC,IAAAA,CAC/B,GAACD,CAAAA,EAAY,MAAA,GACb,GAACC,CAAAA,EAAY,MAAA,GAEb,IAAAb,EAAI,EACPc,EAAI,EACL,KAAOd,EAAIY,EAAIhC,QAAUkC,EAAID,EAAIjC,QAC5BgC,EAAIZ,CAAAA,EAAGG,YAAkBU,IAAAA,EAAIC,CAAGX,EAAAA,YAAAA,GAAeH,IACnDc,IAED,OAAOd,IAAMY,EAAIhC,MAAA,GAuFsB6B,EAAGF,CAAAA,EAAK,GAAM,EAC/CQ,GAjFc,CAACC,EAAeC,IAAAA,CAChC,GAACD,CAAAA,EAAc,MAAA,GACf,IAACC,EAAe,MAAA,GAEd,MAAAC,EAAcpB,GACnBA,EACEK,YAAAA,EACAR,MAAM,EAAA,EACNwB,OACA,CAACC,EAAKC,KACLD,EAAIC,CAAAA,GAASD,EAAIC,CAAAA,GAAS,GAAK,EACxBD,GAER,CAAA,CAGGE,EAAAA,EAAaJ,EAAWF,CAAAA,EACxBO,EAAcL,EAAWD,CAC/B,EAAA,OAAO7C,OAAOO,KAAK2C,CAAYE,EAAAA,MAAMH,IAASE,EAAYF,CAAS,GAAA,IAAMC,EAAWD,CAAAA,CAAAA,CAAK,GA+DvDZ,EAAGF,CAAAA,EAAK,GAAM,EAC1CkB,GA5CiB,CAACC,EAAYC,IAAAA,CAChC,GAACD,CAAAA,GAAAA,CAAOC,GAAMD,EAAG9C,OAAS,GAAK+C,EAAG/C,OAAS,EAAU,MAAA,GAEnD,MAAAgD,EAAW/B,EAAW6B,CACtBG,EAAAA,EAAWhC,EAAW8B,CAAAA,EAE5B,GAAIC,EAAShD,SAAW,GAAKiD,EAASjD,SAAW,EAAU,MAAA,GAE3D,IAAIkD,EAAe,EACnB,MAAMC,EAAO,IAAIjE,MAAM+D,EAASjD,MAAAA,EAAQoD,KAAK,EAAA,EAE7C,UAAWC,KAAUL,EACpB,QAAS5B,EAAI,EAAGA,EAAI6B,EAASjD,OAAQoB,IACpC,GAAK+B,CAAAA,EAAK/B,CAAM6B,GAAAA,EAAS7B,CAAOiC,IAAAA,EAAQ,CACvCH,IACAC,EAAK/B,CAAAA,EAAAA,GACL,KAAA,CAKH,MAAQ,GAAI8B,GAAiBF,EAAShD,OAASiD,EAASjD,OAAA,GAuBtB2B,EAAGE,CAAAA,EAE/ByB,EAASC,KAAKC,IAAI7B,EAAE3B,OAAQ6B,EAAE7B,MAAAA,EAC9ByD,EAAmBH,EAAS,GAtIf,CAAC3B,EAAWE,IAAAA,CAC3B,GAAAF,IAAME,EAAU,MAAA,GAEpB,MAAM6B,EAAqBxE,MAAM2C,EAAE7B,OAAS,CAC1CoD,EAAAA,KAAK,IACLO,EAAAA,IAAI,CAACC,EAAGxC,IAAM,CAACA,CAGjB,CAAA,EAAA,QAASc,EAAI,EAAGA,GAAKP,EAAE3B,OAAQkC,IACvBwB,EAAA,CAAGxB,EAAAA,CAAAA,EAAKA,EAGhB,QAASd,EAAI,EAAGA,GAAKS,EAAE7B,OAAQoB,IAC9B,QAASc,EAAI,EAAGA,GAAKP,EAAE3B,OAAQkC,IAC1BL,EAAEgC,OAAOzC,EAAI,CAAOO,IAAAA,EAAEkC,OAAO3B,EAAI,CAC7BwB,EAAAA,EAAAtC,CAAGc,EAAAA,CAAAA,EAAKwB,EAAOtC,EAAI,CAAGc,EAAAA,EAAI,CAEjCwB,EAAAA,EAAOtC,CAAGc,EAAAA,CAAAA,EAAKqB,KAAKO,IACnBJ,EAAOtC,EAAI,CAAGc,EAAAA,CAAAA,EAAK,EACnBwB,EAAOtC,CAAGc,EAAAA,EAAI,CAAK,EAAA,EACnBwB,EAAOtC,EAAI,CAAGc,EAAAA,EAAI,CAAK,EAAA,CAAA,EAK3B,OAAOwB,EAAO7B,EAAE7B,MAAAA,EAAQ2B,EAAE3B,MAAAA,CAAM,GA6GkB2B,EAAGE,CAAAA,EAAKyB,EAAS,EAEnE,OAAOC,KAAKC,IAAI1B,EAAgBC,EAAkBI,EAAcU,EAAWY,CAAAA,CAAgB,EAMtFM,EAAc9E,GACfA,GAAS,KAAa,GACnB+E,OAAO/E,CAAAA,EAMf,SAASgF,EACRrD,EACAwB,EACA8B,EAAyB,GAAA,CAErB,IAAAC,EACHC,EACA1C,EACA2C,EAAS,GAYN,GAVAnF,MAAMC,QAAQiD,CAAAA,EAAAA,CACf+B,EAAOC,EAAI1C,EAAU2C,EAAAA,EAAkBjC,EAAAA,GAEzC+B,EAAQ/B,EAAMpD,IACdoF,EAAKhC,EAAMkC,SACX5C,EAAWU,EAAMnD,MACjBoF,EAASjC,EAAMiC,QAAAA,IAIXA,CAAAA,IAAW3C,IAAa,IAAMA,GAAY,MAASvC,EAAQuC,CAAAA,GAAaA,EAAS1B,SAAW,GAChG,MAAO,CAAEuE,MAAAA,GAAaC,MAAO,CAGxB,EAAA,MAAA/C,EAASd,EAAcC,EAAMuD,CAAAA,EAGnC,GAAIE,EAAQ,CAEX,GAAID,IAAO,MAAO,CAEjB,GAAW3C,OAAAA,GAAW,UAAmBC,OAAAA,GAAa,SACrD,MAAO,CAAE6C,MAAO,GAAOC,MAAO,CAAA,EAGzB,MAAAA,EAAQhD,EAAkBC,EAAQC,CACjC,EAAA,MAAA,CACN6C,MAAOC,GAASN,EAChBM,MAAOA,GAASN,EAAiBM,EAAQ,CAC1C,CAAA,CACM,CAGN,MAAMC,EAAUC,EAAcN,EAAI3C,EAAQC,CACnC,EAAA,MAAA,CACN6C,MAAOE,EACPD,MAAOC,EAAU,EAAI,CACtB,CAAA,CACD,CACD,GAAWL,IAAO,MAAO,CAExB,GAAW3C,OAAAA,GAAW,UAAmBC,OAAAA,GAAa,SACrD,MAAO,CAAE6C,MAAO,GAAOC,MAAO,CAAA,EAGzB,MAAAA,EAAQhD,EAAkBC,EAAQC,CACxC,EAAA,OAAI8C,EAAQN,EACJ,CAAEK,MAAAA,GAAcC,MAAO,CAGxB,EAAA,CAAED,SAAaC,MAAAA,CAAAA,CAAM,CACtB,CAEN,MAAMC,EAAUC,EAAcN,EAAI3C,EAAQC,CAAAA,EACnC,MAAA,CACN6C,MAAOE,EACPD,MAAOC,EAAU,EAAI,CAAA,CACtB,CAEF,CAkBO,SAASE,EACfC,EACAC,EAA4B,CAC5BX,EAAAA,EAAyB,GAGrB,CAAA,GAAA,CAACW,EAAQ7E,OACZ,OAAOd,MAAM4F,KAAKF,EAAMG,OAIzB,CAAA,EAAA,MAAMC,EAA+B,CAAA,EAErC,SAAA,CAAYpB,EAAGhD,CAAAA,IAASgE,EAAMK,QAAAA,EAAW,CACxC,IAAIC,EAAa,EACbC,EAAa,EACbZ,EAAQ,GAEZ,UAAWnC,KAASyC,EAAS,CAC5B,MAAMO,EAASnB,EAAoBrD,EAAMwB,EAAO8B,CAE5C,EAAA,GAAA,CAACkB,EAAOb,MAAO,CACVA,EAAAA,GACR,KAAA,CAGDW,GAAcE,EAAOZ,MACrBW,GAAA,CAGGZ,GACHS,EAAY3D,KAAK,CAChBT,KACA4D,EAAAA,MAAOW,EAAa,EAAID,EAAaC,EAAa,CAEpD,CAAA,CAAA,CAMD,OAFAH,EAAYK,KAAK,CAAC1D,EAAGE,IAAMA,EAAE2C,MAAQ7C,EAAE6C,KAAAA,EAEhCQ,EAAYrB,IAAS2B,GAAAA,EAAE1E,IAC/B,CAAA,CAKO,SAAS2E,EACfX,EACAC,EAA4B,CAC5BX,EAAAA,EAAyB,GAGnB,CAAA,MAAAP,MAAUvE,IAGT,OAFDwF,EAAAY,QAAQ,CAAC5E,EAAM6E,IAAU9B,EAAI1D,IAAI+D,OAAOyB,CAAQ7E,EAAAA,CAAAA,CAAAA,EAE/C+D,EAAehB,EAAKkB,EAASX,CACrC,CAAA,CASO,SAAS/E,EAAqBF,EAC7B,CAAA,OAAAC,MAAMC,QAAQF,CACtB,CAAA,CAOO,SAASyG,EAASzG,EACxB,CAAA,OAAcA,OAAAA,GAAU,QACzB,CAOO,SAAS0G,EAAS1G,EAAAA,CACxB,OAAwB,OAAVA,GAAU,UAAa2G,CAAAA,MAAM3G,CAC5C,CAAA,CAOO,SAAS4G,EAAO5G,EACtB,CAAA,OAAOA,aAAiBK,MAAAA,CAASsG,MAAM3G,EAAM6G,QAC9C,CAAA,CAAA,CAsBO,SAASC,EAAgC9G,EAC/C,CAAA,OAAOA,aAAiBG,GACzB,CAOO,SAAS4G,EAAmB/G,EAAAA,CAClC,OAAOA,aAAiBI,GACzB,CAqBO,SAAS4G,EAAMhH,EACd,CAAA,OACRiH,GADQjH,IACR,CASgB,SAAAyF,EAAcN,EAAwB3C,EAAiBC,EAEtE,CAAA,GAAIuE,EAAMxE,CAAAA,GAAWwE,EAAMvE,CAAAA,EAAkB,MAAA,GAC7C,GAAIuE,EAAMxE,CAAWwE,GAAAA,EAAMvE,CAEtB,EAAA,OAAA0C,IAAO,KAAa3C,IAAWC,EAC/B0C,IAAO,MAAa3C,IAAWC,EAKpC,OAAQ0C,EAAAA,CACP,IAAK,KACJ,OAAO3C,IAAWC,EACnB,IAAK,KACJ,OAAOD,IAAWC,EACnB,IAAK,IACJ,OAAIiE,EAASlE,CAAWkE,GAAAA,EAASjE,CACzBD,EAAAA,EAASC,EAEbmE,EAAOpE,CAAWoE,GAAAA,EAAOnE,CACrBD,EAAAA,EAAOqE,QAAYpE,EAAAA,EAASoE,QAEhCJ,EAAAA,EAAAA,CAAAA,EAASjE,CAAWiE,GAAAA,CAAAA,EAAShE,CACzBD,IAAAA,EAAO0E,cAAczE,CAAAA,EAAY,EAG1C,IAAK,IACJ,OAAIiE,EAASlE,CAAAA,GAAWkE,EAASjE,CAAAA,EACzBD,EAASC,EAEbmE,EAAOpE,CAAWoE,GAAAA,EAAOnE,CACrBD,EAAAA,EAAOqE,QAAYpE,EAAAA,EAASoE,QAEhCJ,EAAAA,EAAAA,CAAAA,EAASjE,CAAWiE,GAAAA,CAAAA,EAAShE,CACzBD,IAAAA,EAAO0E,cAAczE,CAAAA,EAAY,EAG1C,IAAK,KACJ,OAAIiE,EAASlE,CAAAA,GAAWkE,EAASjE,CAAAA,EACzBD,GAAUC,EAEdmE,EAAOpE,CAAAA,GAAWoE,EAAOnE,CAAAA,EACrBD,EAAOqE,QAAAA,GAAapE,EAASoE,QAAAA,EAAAA,EAAAA,CAEjCJ,EAASjE,CAAAA,GAAAA,CAAWiE,EAAShE,CAAAA,IACzBD,EAAO0E,cAAczE,CAAa,GAAA,EAG3C,IAAK,KACJ,OAAIiE,EAASlE,CAAWkE,GAAAA,EAASjE,CACzBD,EAAAA,GAAUC,EAEdmE,EAAOpE,CAAWoE,GAAAA,EAAOnE,CACrBD,EAAAA,EAAOqE,QAAapE,GAAAA,EAASoE,QAEjCJ,EAAAA,EAAAA,CAAAA,EAASjE,CAAWiE,GAAAA,CAAAA,EAAShE,CACzBD,IAAAA,EAAO0E,cAAczE,CAAAA,GAAa,EAG3C,IAAK,WACA,OAAAgE,EAASjE,CAAAA,EACLA,EAAOF,YAAAA,EAAchB,SAASwD,EAAWrC,CAAUH,EAAAA,YAAAA,CAAAA,EAEvDpC,EAAQsC,CAAAA,EACJA,EAAOlB,SAASmB,CAEpBsE,EAAAA,EAAMvE,CACFA,EAAAA,EAAO2E,IAAI1E,CAAAA,EAAAA,CAAAA,CAEfqE,EAAMtE,CAAAA,GACFvC,MAAM4F,KAAKrD,EAAOsD,OAAAA,CAAAA,EAAUxE,SAASmB,CAAAA,EAI9C,IAAK,cACA,OAAAgE,EAASjE,CACJA,EAAAA,CAAAA,EAAOF,YAAchB,EAAAA,SAASwD,EAAWrC,CAAAA,EAAUH,YAExDpC,CAAAA,EAAAA,EAAQsC,CACHA,EAAAA,CAAAA,EAAOlB,SAASmB,CAAAA,EAErBsE,EAAMvE,CAAAA,EAAAA,CACDA,EAAO2E,IAAI1E,CAEhBqE,EAAAA,CAAAA,EAAMtE,CACDvC,GAAAA,CAAAA,MAAM4F,KAAKrD,EAAOsD,OAAUxE,CAAAA,EAAAA,SAASmB,CAI/C,EAAA,IAAK,aACJ,MAAA,EAAA,CAAIgE,EAASjE,CAAAA,GAAAA,CAAWiE,EAAShE,CAAAA,IACzBD,EAAOF,YAAAA,EAAc8E,WAAW3E,EAASH,YAIlD,CAAA,EAAA,IAAK,WACJ,MAAA,EAAA,CAAImE,EAASjE,CAAAA,GAAAA,CAAWiE,EAAShE,CAAAA,IACzBD,EAAOF,YAAAA,EAAc+E,SAAS5E,EAASH,YAIhD,CAAA,EAAA,IAAK,KACA,OAAApC,EAAQuC,CAAAA,EACJA,EAASnB,SAASkB,CAEtBuE,EAAAA,EAAMtE,CACFA,EAAAA,EAAS0E,IAAI3E,CAAAA,EAAAA,CAAAA,CAEjBsE,EAAMrE,CAAAA,IACFA,EAAS0E,IAAI3E,CAAkBvC,GAAAA,MAAM4F,KAAKpD,EAASqD,OAAUxE,CAAAA,EAAAA,SAASkB,CAI/E,GAAA,IAAK,QACA,OAAAtC,EAAQuC,CAAAA,EAAAA,CACHA,EAASnB,SAASkB,CAEvBuE,EAAAA,EAAMtE,CACDA,EAAAA,CAAAA,EAAS0E,IAAI3E,CAAAA,EAAAA,CAElBsE,EAAMrE,CAAAA,GAAAA,CACDA,EAAS0E,IAAI3E,CAAmBvC,GAAAA,CAAAA,MAAM4F,KAAKpD,EAASqD,OAAUxE,CAAAA,EAAAA,SAASkB,CAIjF,EAAA,QAEQ,MAAA,EAAA,CAGV,CAGO,MAAM8E,EAAY5B,EAGZ6B,EAAcjB,ECjlB3B,SAASkB,EAAU9E,EAAYE,EAAAA,CAC1B,GAAAF,IAAME,EAAU,MAAA,GAEhB,GAAAF,aAAavC,KAAOyC,aAAazC,IAAK,CACzC,GAAIuC,EAAElB,OAASoB,EAAEpB,KAAa,MAAA,GAC9B,SAAA,CAAYzB,EAAKC,CAAAA,IAAU0C,EAC1B,GAAA,CAAKE,EAAEuE,IAAIpH,CAASyH,GAAAA,CAAAA,EAAUxH,EAAO4C,EAAE6E,IAAI1H,CAAAA,CAAAA,EAAc,MAAA,GAEnD,MAAA,EAAA,CAGJ,GAAA2C,aAAatC,KAAOwC,aAAaxC,IAAK,CACzC,GAAIsC,EAAElB,OAASoB,EAAEpB,KAAa,SAC9B,UAAWG,KAAQe,EAClB,GAAA,CAAKE,EAAEuE,IAAIxF,CAAc,EAAA,MAAA,GAEnB,MAAA,EAAA,CAGJ,GAAa,OAANe,GAAM,UAAYA,IAAM,MAAqB,OAANE,GAAM,UAAYA,IAAM,KAAM,CACzE,MAAA8E,EAAQnH,OAAOO,KAAK4B,CACpBiF,EAAAA,EAAQpH,OAAOO,KAAK8B,CAE1B,EAAA,GAAI8E,EAAM3G,SAAW4G,EAAM5G,OAAe,MAAA,GAE1C,UAAWhB,KAAO2H,EAEb,GAACF,CAAAA,EAAU9E,EAAE3C,CAAAA,EAAM6C,EAAE7C,CAAAA,CAAAA,EAAc,MAAA,GAGjC,MAAA,EAAA,CAGD,MAAA,EACR,CASgB,SAAA6H,EAAqBlH,EAAkBmH,EAAAA,CAC/C,OAAAnH,EAAMoH,EAAEC,KAAKrD,MAAImD,CAAaG,EAAAA,EAAAA,qBAAwBR,CAAAA,EAAYS,EAAYA,YAAA,CACtF,CAAA,CAAA,CASgB,SAAAC,EACfxH,EACAmH,EAAAA,CAEO,OAAAnH,EAAMoH,EAAEC,KAAKrD,MAAImD,CAAaG,EAAAA,EAAAA,qBAAwBR,CAAAA,EAAYS,EAAYA,YAAA,CACtF,CAAA,CAAA,CCxDA,MAAME,EAAkBC,OAAO,iBAAA,EACzBC,EAAgBD,OAAO,uBACvBE,EAAAA,EAAcF,OAAO,qBAAA,EA2GX,SAAAG,EACf7H,EACAmH,EAAiCW,GAAaA,EAC9CC,EAAyB,GAElB,CAAA,OAAA,SAAUC,EAA4BC,EAAkBC,EAAAA,CAElDC,WAAA,CAAEC,UAAAA,GAAkBC,KAAMxI,MAA1BsI,CAAAA,EAAoCH,EAAOC,CAAAA,EAGvD,MAAMK,EAA4BN,EAAMO,kBAClCC,EAA+BR,EAAMS,qBAG3CT,EAAMO,kBAAoB,UA1D5B,OAAA,IAAgCG,GA4DNC,EAAAA,MA3DVlB,CAAoBiB,GAAAA,CAAAA,EAAUjB,CAAiBmB,EAAAA,SACnDF,EAAAjB,CAAAA,EAAmB,IAAIoB,WAG7BH,EAAUf,CACJe,IAAAA,EAAAf,CAAiB,EAAA,IAAIlI,KAG3BiJ,EAAUd,CACJc,IAAAA,EAAAd,CAAe,EAAA,IAAIlI,KAqDtB,MAAAoJ,EAtET,SAA8B9I,EAC7B,CAAA,MAAO,QAASA,GAAgBA,OAAAA,EAAMM,KAAQ,YAAcN,EAAMV,iBAAiBG,GACpF,EAoEqDO,CAC/CwH,EAAAA,EAAyBxH,EAAOmH,CAAAA,EAChCD,EAAelH,EAAoBmH,CAGjCY,EAAAA,EAAQgB,UAAaJ,KAAKf,CAAcnB,EAAAA,IAAIwB,CAChDK,IAAAA,GAAAA,MAAAA,EAA2BU,KAAKL,MAC3BA,KAAAf,CAAAA,EAAcqB,IAAIhB,CAAAA,GAIpBU,KAAKhB,CAAAA,EAAgBlB,IAAIwB,CAAAA,KAC5BU,EAAAA,KAAKhB,CAAAA,EAAgBZ,IAAIkB,CAAAA,IAAzBU,MAAAA,EAAoCO,cAC/BP,KAAAhB,CAAgBwB,EAAAA,OAAOlB,CAIzBF,GAAAA,EAAQqB,MAKN,MAAAC,EAAeP,EAASzB,KAAKiC,EAAAA,UAAUX,KAAKlB,CAAoB8B,CAAAA,CAAAA,EAAAA,UAAU,CAC/EC,KAAOlK,GAEN,OAAA,MAAMmK,EAAW1B,EAAQ2B,UAAYC,gBAAgBrK,CAASA,EAAAA,EAE1DyI,EAAQqB,MAIPrB,EAAQ6B,aACZjB,KAAKV,CAAAA,EAAYwB,IAGlBd,EAAAA,KAAKkB,gBAALlB,MAAAA,EAAAA,WAGIZ,EAAQgB,UAAaJ,CAAAA,KAAKf,CAAcnB,EAAAA,IAAIwB,CAA5CF,GAAyD0B,GAAzD1B,OACCA,EAAQqB,MAIZd,GAAAA,MAAAA,EAA2BU,KAAKL,MAC3BA,KAAAf,CAAAA,EAAcqB,IAAIhB,CAAAA,EAAQ,EAGjClH,MAAQL,GAAAA,CAGHiI,KAAKmB,aAERC,WAAW,IAAA,OACNpB,KAAKmB,cACJ/B,EAAQqB,OAGZT,EAAAA,KAAKJ,oBAALI,MAAAA,EAAAA,WAAyB,EAExB,GAAA,CAAI,CAMVA,CAAAA,EAAAA,KAAKhB,CAAgBrH,EAAAA,IAAI2H,EAAUoB,CAAAA,CACpC,EAGArB,EAAMS,qBAAuB,UAAA,CAnH/B,IAAkCC,EAqH/BF,GAAAA,MAAAA,EAA8BQ,KAAKL,MAG/BZ,EAAQqB,OAxHmBV,EA6HNC,MA5HblB,CAAAA,IACHiB,EAAAjB,CAAAA,EAAiB+B,KACjBd,EAAAA,EAAAjB,CAAiBuC,EAAAA,SAAAA,EAC3BtB,EAAUjB,CAAAA,EAAAA,QAGPiB,EAAUf,CACbe,IAAAA,EAAUf,CAAe9B,EAAAA,QAAexD,GAAAA,EAAI6G,YAClCR,CAAAA,EAAAA,EAAAf,CAAesC,EAAAA,MAAAA,EACzBvB,EAAUf,CAAAA,EAAAA,QAGPe,EAAUd,CACHc,IAAAA,EAAAd,CAAaqC,EAAAA,MAAAA,EACvBvB,EAAUd,CAAAA,EAAAA,OA+GV,CACD,CACD,oDH+BO,SACNzI,EAAmB,CAAA,EACnBE,EACAD,EAAuB,QAEnB,CAAA,GAAA,CACI,OAAAuB,EAAiBxB,EAAaC,EAASC,QACtCqB,CAGR,OAAOH,EAAoBpB,EAAa,SAAU,GAAGE,CAAAA,WAAAA,CAAc,CAErE,oEE9KgB,SACf6K,EACAC,EACAC,EAGA,CAAA,MAAMC,EAAcH,EAAOlG,IAAI,CAAChE,EAAO8F,IAAAA,CAChC,MAAAqB,EAAagD,EAAYrE,CAAAA,EAG3B,MAAA,QAAS9F,GAA8B,OAAdA,EAAMM,KAAQ,YAAcN,EAAMV,iBAAiBG,IACxE+H,EAAyBxH,EAAgCmH,CAAAA,EAEzDD,EAAelH,EAAsBmH,CAAU,CAAA,CAAA,EAKlDmD,EAAaC,EAAAA,cAAcF,CAAAA,EAAahD,KAC7CrD,EAAAA,IAAIoB,GAAUgF,EAAchF,GAAAA,CAAAA,CAAAA,EAC5BkC,EAAAA,qBAAqBR,CACrBS,EAAAA,EAAAA,YAAY,CAAA,CAAA,EAIPiD,EAAgBN,EAAOlG,IAAI,CAAChE,EAAO8F,IAAUqE,EAAYrE,CAAAA,EAAO9F,EAAMV,KAAAA,CAAAA,EAEtEmL,EAAeL,EAAAA,GAAcI,CAG7BE,EAAAA,EAAkB,IAAIC,EAAAA,gBAAmBF,CAAAA,EAMxC,OAHPH,EAAWf,UAAUjK,GAASoL,EAAgBlB,KAAKlK,CAG5C,CAAA,EAAA,CACN8H,EAAGsD,EACH,IAAIpL,OAAAA,CACH,OAAOoL,EAAgBE,SACxB,CAAA,EACAC,MAAO,EAAA,CAET,sDA8EgB,SACf7K,EACA8K,EAEO,CAAA,OAAAtD,EAAyBxH,EAAqB+K,GAC/CD,EAEEvL,MAAM4F,KAAK4F,EAAWzF,QAAAA,CAAAA,EAAW0F,OAAO,CAAA,CAAE3L,EAAK4B,CAAAA,IAAU6J,EAAS7J,EAAM5B,CAAMgB,CAAAA,EAAAA,OAF/D0K,EAAWjK,IAAAA,CAInC,gCA5EO,SAAkCd,EACjC,CAAA,OAAAwH,EAAyBxH,EAAqB+K,GAAAxL,MAAM4F,KAAK4F,EAAWzF,QAC5E,CAAA,CAAA,CAAA,+BAmCgB,SACftF,EACA8K,EAEO,CAAA,OAAAtD,EAAyBxH,EAAO+K,GACtCxL,MAAM4F,KAAK4F,EAAWzF,QACpB0F,CAAAA,EAAAA,OAAO,CAAE3L,CAAAA,EAAK4B,CAAU6J,IAAAA,EAAS7J,EAAM5B,CAAAA,CAAAA,EACvC2E,IAAI,CAAA,CAAEC,EAAGhD,CAAAA,IAAUA,CAEvB,CAAA,CAAA,6BA9BgB,SACfjB,EACAiL,GAEO,OAAAzD,EAAyBxH,EAAqB+K,GAAAA,CACpD,SAAA,CAAY1L,EAAK4B,CAAAA,IAAS8J,EAAWzF,QAAAA,EAChC,GAAA2F,EAAUhK,EAAM5B,CAAAA,EACZ,OAAA4B,CAGF,CAET,CAAA,6BAtFgB,SAAsBjB,EAA4BkL,EACjE,CAAA,OAAO1D,EAAyBxH,EAAO+K,GAAcA,EAAWhE,IAAImE,CAAAA,CAAAA,CACrE,8BAbO,SAAgClL,EAC/B,CAAA,OAAAwH,EAAyBxH,EAAqB+K,GAAAxL,MAAM4F,KAAK4F,EAAW3F,OAC5E,CAAA,CAAA,CAAA,6BA4DO,SAA+BpF,EAAAA,CAC9B,OAAAwH,EAAyBxH,EAAqB+K,GAAAxL,MAAM4F,KAAK4F,EAAW3K,KAAAA,CAAAA,CAAAA,CAC5E,4BAwDgB,SACfJ,EACAmL,EAAAA,CAEO,OAAA3D,EAAyBxH,KAC/BT,MAAM4F,KAAK4F,EAAWzF,QAAAA,CAAAA,EAAWtB,IAAI,CAAA,CAAE3E,EAAK4B,CAAAA,IAAUkK,EAAMlK,EAAM5B,CAEpE,CAAA,CAAA,CAAA,kCA4BgB,SAA8BW,EAAkBmH,EAC/D,CAAA,OAAOnH,EAAMoH,EAAEC,KACdrD,EAAAA,IAAImD,CAAAA,EACJG,EAAAA,qBAAwBR,CACxBsE,EAAAA,QAAM,CACLC,oBAAqB,GACrBC,aAAc,GACdC,gBAAiB,EAAA,CAAA,CAAA,CAGpB,sDAzFgB,SAAsBvL,EAA4BwL,EAC1D,CAAA,OAAAhE,EAAyBxH,EAAqB+K,GAC7CxL,MAAM4F,KAAK4F,EAAW3F,OAAUM,CAAAA,EAAAA,KAAK8F,CAE9C,CAAA,CAAA,iCFqHO,SACNrM,EAAmB,CACnBE,EAAAA,EAAc,cAEV,GACI,CAAA,OAAAsB,EAAiBxB,EAAa,SAAUE,CAAAA,OAI/C,CAAA,OAAOkB,EAAoBpB,EAAa,SAAU,GAAGE,CAAwB,qBAAA,CAAA,CAE/E,8KC2HO,SAAiCC,EAAAA,CAEvC,OAAIA,GAAS,MAAyB,OAAVA,GAAU,UAK/BoI,OAAO+D,YAAY5L,OAAOP,CAAqD,GAAA,OAAnCA,EAAcoI,OAAO+D,QACzE,GADuF,UACvF,2EAyBO,SAAuBnM,EAC7B,CAAA,GAAIA,IAAU,MAAeA,OAAAA,GAAU,SAC/B,MAAA,GAGF,MAAA0I,EAAQnI,OAAOC,eAAeR,CAC7B,EAAA,OAAA0I,IAAUnI,OAAOE,WAAaiI,IAAU,IAChD,yEEvNO,SACNhI,EACA0L,EACA3D,EAAyB,CAAA,EAElB,CAAA,OAAA,SAAUC,EAA4BC,EAAkBC,EAAAA,CAC9DL,EACC7H,EACA,SAAU8H,EAAAA,CAEH,MAAAoD,EAAUQ,EAAU/C,IAAAA,EAC1B,OAAOuC,EAAUpD,EAAMf,IAAImE,CAAW,EAAA,MACvC,EACAnD,CAAAA,EACCC,EAAOC,EACV,CACD"}

package/dist/{selector-hook-D_HTD-GV.js → selector-hook-DHPU6Z2H.js} RENAMED Viewed

@@ -1,7 +1,7 @@
 import { e as E, S as q, a as N } from "./context-object-CISes2bD.js";
-import { property as G } from "lit/decorators.js";
-import { map as I, distinctUntilChanged as $, shareReplay as x, combineLatest as Z, share as H, Subject as J } from "rxjs";
-import { takeUntil as K } from "rxjs/operators";
+import { property as V } from "lit/decorators.js";
+import { map as $, distinctUntilChanged as x, shareReplay as I, combineLatest as Z, BehaviorSubject as H, share as J, Subject as K } from "rxjs";
+import { takeUntil as Q } from "rxjs/operators";
 function W(n, e, t) {
   try {
     e === "indexeddb" && (e = "local"), ((o = n) === null || typeof o != "object" || Array.isArray(o) || o instanceof Map || o instanceof Set || o instanceof Date || o instanceof RegExp || Object.getPrototypeOf(o) !== Object.prototype) && (n = { ...n });
@@ -20,7 +20,7 @@ function z(n, e, t) {
     return q.getInstance("memory", `${t}-fallback`, [...n]);
   }
 }
-function B(n, e, t) {
+function P(n, e, t) {
   try {
     return n == null && (n = t.includes("collection") || t.includes("map") ? /* @__PURE__ */ new Map() : t.includes("array") || t.includes("list") ? [] : {}), n instanceof Map ? function(r, o, c) {
       try {
@@ -36,21 +36,21 @@ function B(n, e, t) {
     return W(typeof n == "object" && n !== null ? { ...n } : { value: n }, "memory", `emergency-fallback-${t}`);
   }
 }
-function oe(n = [], e, t = "local") {
+function se(n = [], e, t = "local") {
   try {
-    return B(n, t, e);
+    return P(n, t, e);
   } catch {
     return z(n, "memory", `${e}-fallback`);
   }
 }
-function se(n = [], e = "test-array") {
+function ae(n = [], e = "test-array") {
   try {
-    return B(n, "memory", e);
+    return P(n, "memory", e);
   } catch {
     return z(n, "memory", `${e}-emergency-fallback`);
   }
 }
-const Q = (n, e) => {
+const X = (n, e) => {
   if (!e) return n;
   const t = e.split(".");
   let r = n;
@@ -77,32 +77,32 @@ const Q = (n, e) => {
   })(r, t) ? 0.8 : 0, u = ((l, h) => {
     if (!l) return !0;
     if (!h) return !1;
-    const i = (k) => k.toLowerCase().split("").reduce((O, b) => (O[b] = (O[b] || 0) + 1, O), {}), a = i(l), p = i(h);
-    return Object.keys(a).every((k) => (p[k] || 0) >= a[k]);
+    const i = (j) => j.toLowerCase().split("").reduce((O, v) => (O[v] = (O[v] || 0) + 1, O), {}), a = i(l), p = i(h);
+    return Object.keys(a).every((j) => (p[j] || 0) >= a[j]);
   })(r, t) ? 0.7 : 0, f = ((l, h) => {
     if (!l || !h || l.length < 2 || h.length < 2) return 0;
     const i = D(l), a = D(h);
     if (i.length === 0 || a.length === 0) return 0;
     let p = 0;
-    const k = new Array(a.length).fill(!1);
-    for (const O of i) for (let b = 0; b < a.length; b++) if (!k[b] && a[b] === O) {
-      p++, k[b] = !0;
+    const j = new Array(a.length).fill(!1);
+    for (const O of i) for (let v = 0; v < a.length; v++) if (!j[v] && a[v] === O) {
+      p++, j[v] = !0;
       break;
     }
     return 2 * p / (i.length + a.length);
-  })(t, r), s = Math.max(t.length, r.length), w = s ? 1 - ((l, h) => {
+  })(t, r), s = Math.max(t.length, r.length), m = s ? 1 - ((l, h) => {
     if (l === h) return 0;
     const i = Array(h.length + 1).fill(null).map((a, p) => [p]);
     for (let a = 0; a <= l.length; a++) i[0][a] = a;
     for (let a = 1; a <= h.length; a++) for (let p = 1; p <= l.length; p++) h.charAt(a - 1) === l.charAt(p - 1) ? i[a][p] = i[a - 1][p - 1] : i[a][p] = Math.min(i[a - 1][p] + 1, i[a][p - 1] + 1, i[a - 1][p - 1] + 1);
     return i[h.length][l.length];
   })(t, r) / s : 0;
-  return Math.max(o, c, u, f, w);
+  return Math.max(o, c, u, f, m);
 }, U = (n) => n == null ? "" : String(n);
-function V(n, e, t = 0.3) {
+function Y(n, e, t = 0.3) {
   let r, o, c, u = !1;
-  if (Array.isArray(e) ? [r, o, c, u = !1] = e : (r = e.key, o = e.operator, c = e.value, u = e.strict || !1), !u && (c === "" || c == null || L(c) && c.length === 0)) return { valid: !0, score: 1 };
-  const f = Q(n, r);
+  if (Array.isArray(e) ? [r, o, c, u = !1] = e : (r = e.key, o = e.operator, c = e.value, u = e.strict || !1), !u && (c === "" || c == null || S(c) && c.length === 0)) return { valid: !0, score: 1 };
+  const f = X(n, r);
   if (u) {
     if (o === "any") {
       if (typeof f != "string" || typeof c != "string") return { valid: !1, score: 0 };
@@ -110,7 +110,7 @@ function V(n, e, t = 0.3) {
       return { valid: s >= t, score: s >= t ? s : 0 };
     }
     {
-      const s = P(o, f, c);
+      const s = B(o, f, c);
       return { valid: s, score: s ? 1 : 0 };
     }
   }
@@ -120,7 +120,7 @@ function V(n, e, t = 0.3) {
     return s < t ? { valid: !1, score: 0 } : { valid: !0, score: s };
   }
   {
-    const s = P(o, f, c);
+    const s = B(o, f, c);
     return { valid: s, score: s ? 1 : 0 };
   }
 }
@@ -129,8 +129,8 @@ function F(n, e = [], t = 0.3) {
   const r = [];
   for (const [o, c] of n.entries()) {
     let u = 0, f = 0, s = !0;
-    for (const w of e) {
-      const l = V(c, w, t);
+    for (const m of e) {
+      const l = Y(c, m, t);
       if (!l.valid) {
         s = !1;
         break;
@@ -141,32 +141,32 @@ function F(n, e = [], t = 0.3) {
   }
   return r.sort((o, c) => c.score - o.score), r.map((o) => o.item);
 }
-function X(n, e = [], t = 0.3) {
+function _(n, e = [], t = 0.3) {
   const r = /* @__PURE__ */ new Map();
   return n.forEach((o, c) => r.set(String(c), o)), F(r, e, t);
 }
-function L(n) {
+function S(n) {
   return Array.isArray(n);
 }
 function y(n) {
   return typeof n == "string";
 }
-function v(n) {
+function C(n) {
   return typeof n == "number" && !isNaN(n);
 }
-function C(n) {
+function w(n) {
   return n instanceof Date && !isNaN(n.getTime());
 }
-function ae(n) {
+function ce(n) {
   return n != null && typeof n == "object" && Symbol.iterator in Object(n) && typeof n[Symbol.iterator] == "function";
 }
-function S(n) {
+function L(n) {
   return n instanceof Map;
 }
 function M(n) {
   return n instanceof Set;
 }
-function ce(n) {
+function ie(n) {
   if (n === null || typeof n != "object") return !1;
   const e = Object.getPrototypeOf(n);
   return e === Object.prototype || e === null;
@@ -174,7 +174,7 @@ function ce(n) {
 function T(n) {
   return n == null;
 }
-function P(n, e, t) {
+function B(n, e, t) {
   if (T(e) && T(t)) return !0;
   if (T(e) || T(t)) return n === "==" ? e === t : n === "!=" && e !== t;
   switch (n) {
@@ -183,35 +183,35 @@ function P(n, e, t) {
     case "!=":
       return e !== t;
     case ">":
-      return v(e) && v(t) ? e > t : C(e) && C(t) ? e.getTime() > t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) > 0;
+      return C(e) && C(t) ? e > t : w(e) && w(t) ? e.getTime() > t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) > 0;
     case "<":
-      return v(e) && v(t) ? e < t : C(e) && C(t) ? e.getTime() < t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) < 0;
+      return C(e) && C(t) ? e < t : w(e) && w(t) ? e.getTime() < t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) < 0;
     case ">=":
-      return v(e) && v(t) ? e >= t : C(e) && C(t) ? e.getTime() >= t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) >= 0;
+      return C(e) && C(t) ? e >= t : w(e) && w(t) ? e.getTime() >= t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) >= 0;
     case "<=":
-      return v(e) && v(t) ? e <= t : C(e) && C(t) ? e.getTime() <= t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) <= 0;
+      return C(e) && C(t) ? e <= t : w(e) && w(t) ? e.getTime() <= t.getTime() : !(!y(e) || !y(t)) && e.localeCompare(t) <= 0;
     case "includes":
-      return y(e) ? e.toLowerCase().includes(U(t).toLowerCase()) : L(e) ? e.includes(t) : M(e) ? e.has(t) : !!S(e) && Array.from(e.values()).includes(t);
+      return y(e) ? e.toLowerCase().includes(U(t).toLowerCase()) : S(e) ? e.includes(t) : M(e) ? e.has(t) : !!L(e) && Array.from(e.values()).includes(t);
     case "notIncludes":
-      return y(e) ? !e.toLowerCase().includes(U(t).toLowerCase()) : L(e) ? !e.includes(t) : M(e) ? !e.has(t) : !S(e) || !Array.from(e.values()).includes(t);
+      return y(e) ? !e.toLowerCase().includes(U(t).toLowerCase()) : S(e) ? !e.includes(t) : M(e) ? !e.has(t) : !L(e) || !Array.from(e.values()).includes(t);
     case "startsWith":
       return !(!y(e) || !y(t)) && e.toLowerCase().startsWith(t.toLowerCase());
     case "endsWith":
       return !(!y(e) || !y(t)) && e.toLowerCase().endsWith(t.toLowerCase());
     case "in":
-      return L(t) ? t.includes(e) : M(t) ? t.has(e) : !!S(t) && (t.has(e) || Array.from(t.values()).includes(e));
+      return S(t) ? t.includes(e) : M(t) ? t.has(e) : !!L(t) && (t.has(e) || Array.from(t.values()).includes(e));
     case "notIn":
-      return L(t) ? !t.includes(e) : M(t) ? !t.has(e) : !S(t) || !t.has(e) && !Array.from(t.values()).includes(e);
+      return S(t) ? !t.includes(e) : M(t) ? !t.has(e) : !L(t) || !t.has(e) && !Array.from(t.values()).includes(e);
     default:
       return !1;
   }
 }
-const ie = F, ue = X;
-function j(n, e) {
+const ue = F, le = _;
+function k(n, e) {
   if (n === e) return !0;
   if (n instanceof Map && e instanceof Map) {
     if (n.size !== e.size) return !1;
-    for (const [t, r] of n) if (!e.has(t) || !j(r, e.get(t))) return !1;
+    for (const [t, r] of n) if (!e.has(t) || !k(r, e.get(t))) return !1;
     return !0;
   }
   if (n instanceof Set && e instanceof Set) {
@@ -222,123 +222,129 @@ function j(n, e) {
   if (typeof n == "object" && n !== null && typeof e == "object" && e !== null) {
     const t = Object.keys(n), r = Object.keys(e);
     if (t.length !== r.length) return !1;
-    for (const o of t) if (!j(n[o], e[o])) return !1;
+    for (const o of t) if (!k(n[o], e[o])) return !1;
     return !0;
   }
   return !1;
 }
-function Y(n, e) {
-  return n.$.pipe(I(e), $(j), x(1));
+function G(n, e) {
+  return n.$.pipe($(e), x(k), I(1));
 }
-function d(n, e) {
-  return n.$.pipe(I(e), $(j), x(1));
+function g(n, e) {
+  return n.$.pipe($(e), x(k), I(1));
 }
-function le(n) {
-  return d(n, (e) => Array.from(e.values()));
-}
-function fe(n, e) {
-  return d(n, (t) => t.get(e));
+function fe(n) {
+  return g(n, (e) => Array.from(e.values()));
 }
 function he(n, e) {
-  return Z(n).pipe(I((t) => e(...t)), $(j), x(1));
+  return g(n, (t) => t.get(e));
 }
-function pe(n) {
-  return d(n, (e) => Array.from(e.keys()));
+function pe(n, e, t) {
+  const r = n.map((s, m) => {
+    const l = e[m];
+    return "set" in s && typeof s.set == "function" && s.value instanceof Map ? g(s, l) : G(s, l);
+  }), o = Z(r).pipe($((s) => t(...s)), x(k), I(1)), c = n.map((s, m) => e[m](s.value)), u = t(...c), f = new H(u);
+  return o.subscribe((s) => f.next(s)), { $: f, get value() {
+    return f.getValue();
+  }, ready: !0 };
 }
 function ye(n) {
-  return d(n, (e) => Array.from(e.entries()));
+  return g(n, (e) => Array.from(e.keys()));
 }
-function me(n, e) {
-  return d(n, (t) => Array.from(t.values()).sort(e));
+function me(n) {
+  return g(n, (e) => Array.from(e.entries()));
+}
+function ge(n, e) {
+  return g(n, (t) => Array.from(t.values()).sort(e));
 }
 function de(n, e) {
-  return d(n, (t) => {
+  return g(n, (t) => {
     for (const [r, o] of t.entries()) if (e(o, r)) return o;
   });
 }
-function ge(n, e) {
-  return d(n, (t) => Array.from(t.entries()).filter(([r, o]) => e(o, r)).map(([r, o]) => o));
-}
 function be(n, e) {
-  return d(n, (t) => Array.from(t.entries()).map(([r, o]) => e(o, r)));
+  return g(n, (t) => Array.from(t.entries()).filter(([r, o]) => e(o, r)).map(([r, o]) => o));
 }
 function ve(n, e) {
-  return d(n, (t) => e ? Array.from(t.entries()).filter(([r, o]) => e(o, r)).length : t.size);
+  return g(n, (t) => Array.from(t.entries()).map(([r, o]) => e(o, r)));
 }
 function Ce(n, e) {
-  return n.$.pipe(I(e), $(j), H({ resetOnRefCountZero: !0, resetOnError: !1, resetOnComplete: !1 }));
+  return g(n, (t) => e ? Array.from(t.entries()).filter(([r, o]) => e(o, r)).length : t.size);
+}
+function we(n, e) {
+  return n.$.pipe($(e), x(k), J({ resetOnRefCountZero: !0, resetOnError: !1, resetOnComplete: !1 }));
 }
-const A = Symbol("selectorCleanup"), m = Symbol("selectorSubscriptions"), g = Symbol("selectorInitialized");
-function _(n, e = (r) => r, t = {}) {
+const A = Symbol("selectorCleanup"), d = Symbol("selectorSubscriptions"), b = Symbol("selectorInitialized");
+function ee(n, e = (r) => r, t = {}) {
   return function(r, o, c) {
-    G({ attribute: !1, type: Object })(r, o);
+    V({ attribute: !1, type: Object })(r, o);
     const u = r.connectedCallback, f = r.disconnectedCallback;
     r.connectedCallback = function() {
       var h;
       var s;
-      (s = this)[A] && !s[A].closed || (s[A] = new J()), s[m] || (s[m] = /* @__PURE__ */ new Map()), s[g] || (s[g] = /* @__PURE__ */ new Set());
-      const w = function(i) {
+      (s = this)[A] && !s[A].closed || (s[A] = new K()), s[d] || (s[d] = /* @__PURE__ */ new Map()), s[b] || (s[b] = /* @__PURE__ */ new Set());
+      const m = function(i) {
         return "set" in i && typeof i.set == "function" && i.value instanceof Map;
-      }(n) ? d(n, e) : Y(n, e);
-      t.required || this[g].has(o) || (u == null || u.call(this), this[g].add(o)), this[m].has(o) && ((h = this[m].get(o)) == null || h.unsubscribe(), this[m].delete(o)), t.debug;
-      const l = w.pipe(K(this[A])).subscribe({ next: (i) => {
+      }(n) ? g(n, e) : G(n, e);
+      t.required || this[b].has(o) || (u == null || u.call(this), this[b].add(o)), this[d].has(o) && ((h = this[d].get(o)) == null || h.unsubscribe(), this[d].delete(o)), t.debug;
+      const l = m.pipe(Q(this[A])).subscribe({ next: (i) => {
         var p;
         const a = t.deepClone ? structuredClone(i) : i;
-        t.debug, t.updateOnly || (this[o] = a), (p = this.requestUpdate) == null || p.call(this), t.required && !this[g].has(o) && a != null && (t.debug, u == null || u.call(this), this[g].add(o));
+        t.debug, t.updateOnly || (this[o] = a), (p = this.requestUpdate) == null || p.call(this), t.required && !this[b].has(o) && a != null && (t.debug, u == null || u.call(this), this[b].add(o));
       }, error: (i) => {
         this.isConnected && setTimeout(() => {
           var a;
           this.isConnected && (t.debug, (a = this.connectedCallback) == null || a.call(this));
         }, 1e3);
       } });
-      this[m].set(o, l);
+      this[d].set(o, l);
     }, r.disconnectedCallback = function() {
       var s;
-      f == null || f.call(this), t.debug, (s = this)[A] && (s[A].next(), s[A].complete(), s[A] = void 0), s[m] && (s[m].forEach((w) => w.unsubscribe()), s[m].clear(), s[m] = void 0), s[g] && (s[g].clear(), s[g] = void 0);
+      f == null || f.call(this), t.debug, (s = this)[A] && (s[A].next(), s[A].complete(), s[A] = void 0), s[d] && (s[d].forEach((m) => m.unsubscribe()), s[d].clear(), s[d] = void 0), s[b] && (s[b].clear(), s[b] = void 0);
     };
   };
 }
 function Ae(n, e, t = {}) {
   return function(r, o, c) {
-    _(n, function(u) {
+    ee(n, function(u) {
       const f = e(this);
       return f ? u.get(f) : void 0;
     }, t)(r, o);
   };
 }
 export {
-  ye as A,
-  me as B,
+  me as A,
+  ge as B,
   de as C,
-  ge as D,
-  be as E,
-  ve as F,
-  Ce as G,
-  oe as a,
-  se as b,
-  B as c,
-  X as d,
+  be as D,
+  ve as E,
+  Ce as F,
+  we as G,
+  se as a,
+  ae as b,
+  P as c,
+  _ as d,
   y as e,
   F as f,
-  Q as g,
-  v as h,
-  L as i,
-  C as j,
-  ae as k,
-  S as l,
+  X as g,
+  C as h,
+  S as i,
+  w as j,
+  ce as k,
+  L as l,
   M as m,
-  ce as n,
+  ie as n,
   T as o,
-  P as p,
-  ie as q,
-  ue as r,
-  _ as s,
+  B as p,
+  ue as q,
+  le as r,
+  ee as s,
   Ae as t,
-  Y as u,
-  d as v,
-  le as w,
-  fe as x,
-  he as y,
-  pe as z
+  G as u,
+  g as v,
+  fe as w,
+  he as x,
+  pe as y,
+  ye as z
 };
-//# sourceMappingURL=selector-hook-D_HTD-GV.js.map
+//# sourceMappingURL=selector-hook-DHPU6Z2H.js.map

package/dist/selector-hook-DHPU6Z2H.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"selector-hook-DHPU6Z2H.js","sources":["../src/store/context-create.ts","../src/store/filter-directive.ts","../src/store/selectors.ts","../src/store/selector-hook.ts"],"sourcesContent":["// src/store/context-create.ts - Fixed version\n\nimport { SchmancyArrayStore } from './context-array'\nimport SchmancyCollectionStore from './context-collection'\nimport { SchmancyStoreObject } from './context-object'\nimport { IArrayStore, ICollectionStore, IStore, StorageType } from './types'\n\n/**\n * Type guard to check if an object is empty\n */\nfunction isEmptyObject(obj: unknown): boolean {\n\tif (typeof obj !== 'object' || obj === null) {\n\t\treturn false\n\t}\n\treturn Object.keys(obj).length === 0\n}\n\n/**\n * Type guard for Map objects\n */\nfunction isMap<K, V>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for Array objects\n */\nfunction isArray<T>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for plain objects (not arrays, maps, null, etc.)\n */\nfunction isPlainObject(value: unknown): boolean {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!Array.isArray(value) &&\n\t\t!(value instanceof Map) &&\n\t\t!(value instanceof Set) &&\n\t\t!(value instanceof Date) &&\n\t\t!(value instanceof RegExp) &&\n\t\tObject.getPrototypeOf(value) === Object.prototype\n\t)\n}\n\n/**\n * Creates a regular object store with better typing and error handling\n */\nfunction createObjectStore<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T> {\n\ttry {\n\t\t// Validate storage type\n\t\tif (storage === 'indexeddb') {\n\t\t\tconsole.warn(`IndexedDB storage is not optimal for plain objects. Using 'local' instead for key: ${key}`)\n\t\t\tstorage = 'local'\n\t\t}\n\n\t\t// Ensure initialData is a plain object\n\t\tif (!isPlainObject(initialData)) {\n\t\t\tconsole.warn(`Initial data is not a plain object. Converting to object for key: ${key}`)\n\t\t\tinitialData = { ...initialData } as T\n\t\t}\n\n\t\t// Create the store instance\n\t\tconst store = SchmancyStoreObject.getInstance<T>(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (isEmptyObject(store.value)) {\n\t\t\tstore.set({ ...initialData }) // Use spread to create a copy\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create object store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyStoreObject.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tinitialData,\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates a collection store with better typing and error handling\n */\nfunction createCollectionStore<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyCollectionStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.size) {\n\t\t\t// Create a new Map instance to avoid modifying the input\n\t\t\tstore.replace(new Map(initialData))\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create collection store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyCollectionStore.getInstance<V>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tnew Map(initialData),\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates an array store with better typing and error handling\n */\nfunction createArrayStore<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyArrayStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.length) {\n\t\t\t// Create a new array instance to avoid modifying the input\n\t\t\tstore.replace([...initialData])\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyArrayStore.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\t[...initialData],\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n// Function overloads for better type inference\n/**\n * Creates a context for managing object state\n * @param initialData The initial object data\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A store instance for the object\n */\nexport function createContext<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T>\n\n/**\n * Creates a context for managing collection state\n * @param initialData The initial Map collection\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A collection store instance\n */\nexport function createContext<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V>\n\n/**\n * Creates a context for managing array state\n * @param initialData The initial array\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns An array store instance\n */\nexport function createContext<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T>\n\n/**\n * Implementation of the createContext function with complete type checking\n * and robust error handling\n */\nexport function createContext<T extends Record<string, any> | Map<string, any> | any[]>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n):\n\t| (IStore<T> & SchmancyStoreObject<T>)\n\t| (ICollectionStore<any> & SchmancyCollectionStore<any>)\n\t| (IArrayStore<any> & SchmancyArrayStore<any>) {\n\ttry {\n\t\t// Validate input\n\t\tif (initialData === null || initialData === undefined) {\n\t\t\tconsole.error('Initial data cannot be null or undefined')\n\t\t\t// Provide a sensible default based on type expected\n\t\t\tif (key.includes('collection') || key.includes('map')) {\n\t\t\t\tinitialData = new Map() as unknown as T\n\t\t\t} else if (key.includes('array') || key.includes('list')) {\n\t\t\t\tinitialData = [] as unknown as T\n\t\t\t} else {\n\t\t\t\tinitialData = {} as T\n\t\t\t}\n\t\t}\n\n\t\t// Determine store type based on input data with improved type checking\n\t\tif (isMap<string, any>(initialData)) {\n\t\t\treturn createCollectionStore<any>(initialData, storage, key)\n\t\t} else if (isArray<any>(initialData)) {\n\t\t\treturn createArrayStore<any>(initialData, storage, key)\n\t\t} else if (typeof initialData === 'object') {\n\t\t\treturn createObjectStore<any>(initialData as Record<string, any>, storage, key)\n\t\t} else {\n\t\t\t// Handle non-object data by wrapping it\n\t\t\tconsole.warn(`Initial data must be an object, array, or Map. Got ${typeof initialData}. Creating object wrapper.`)\n\t\t\treturn createObjectStore<any>({ value: initialData } as Record<string, any>, storage, key)\n\t\t}\n\t} catch (error) {\n\t\t// Last-resort error handling\n\t\tconsole.error(`Fatal error creating context for ${key}:`, error)\n\n\t\t// Create an emergency fallback store that won't throw\n\t\treturn createObjectStore<any>(\n\t\t\ttypeof initialData === 'object' && initialData !== null ? { ...initialData } : { value: initialData },\n\t\t\t'memory',\n\t\t\t`emergency-fallback-${key}`,\n\t\t)\n\t}\n}\n\n/**\n * Creates an array context with simplified API and type inference\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @param storage Storage type to use (defaults to 'local')\n * @returns An array store instance\n */\nexport function createArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string,\n\tstorage: StorageType = 'local',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, storage, key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array context for key: ${key}`, err)\n\t\t// Return a fallback store\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-fallback`)\n\t}\n}\n\n/**\n * Creates a testable array context\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @returns An array store that uses memory storage\n */\nexport function createTestArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string = 'test-array',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, 'memory', key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create test array context for key: ${key}`, err)\n\t\t// Return a fallback store with a different key\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-emergency-fallback`)\n\t}\n}\n","// src/store/filter-directive.ts\n\n/** Supported comparison operators with TypeScript literal types */\nexport type ComparisonOperator =\n\t| '=='\n\t| '!='\n\t| '>'\n\t| '<'\n\t| '>='\n\t| '<='\n\t| 'includes'\n\t| 'notIncludes'\n\t| 'startsWith'\n\t| 'endsWith'\n\t| 'in'\n\t| 'notIn'\n\t| 'any' // fuzzy search operator\n\n/**\n * Type-safe condition tuple\n */\nexport type ConditionTuple = [field: string, op: ComparisonOperator, expected: unknown, strict?: boolean]\n\n/**\n * Type-safe condition object\n */\nexport interface ConditionObject {\n\tkey: string\n\toperator: ComparisonOperator\n\tvalue: unknown\n\tstrict?: boolean\n}\n\n/**\n * Unified query condition type\n */\nexport type QueryCondition = ConditionTuple | ConditionObject\n\n/**\n * Filter result with item and score\n */\nexport interface ScoredItem<T> {\n\titem: T\n\tscore: number\n}\n\n/**\n * Get a nested value from an object using a dot-separated path.\n * Checks explicitly for null/undefined so falsy values like 0 or false are preserved.\n */\nexport const getFieldValue = <T = any>(item: Record<string, any>, path: string): T => {\n\tif (!path) return item as unknown as T\n\n\tconst parts = path.split('.')\n\tlet value: any = item\n\n\tfor (const part of parts) {\n\t\tif (value == null) return undefined as unknown as T\n\t\tvalue = value[part]\n\t}\n\n\treturn value as T\n}\n\n/**\n * Compute the Levenshtein distance between two strings.\n */\nconst levenshtein = (a: string, b: string): number => {\n\tif (a === b) return 0\n\n\tconst matrix: number[][] = Array(b.length + 1)\n\t\t.fill(null)\n\t\t.map((_, i) => [i])\n\n\t// initialize the first row\n\tfor (let j = 0; j <= a.length; j++) {\n\t\tmatrix[0][j] = j\n\t}\n\n\tfor (let i = 1; i <= b.length; i++) {\n\t\tfor (let j = 1; j <= a.length; j++) {\n\t\t\tif (b.charAt(i - 1) === a.charAt(j - 1)) {\n\t\t\t\tmatrix[i][j] = matrix[i - 1][j - 1]\n\t\t\t} else {\n\t\t\t\tmatrix[i][j] = Math.min(\n\t\t\t\t\tmatrix[i - 1][j] + 1, // deletion\n\t\t\t\t\tmatrix[i][j - 1] + 1, // insertion\n\t\t\t\t\tmatrix[i - 1][j - 1] + 1, // substitution\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n\treturn matrix[b.length][a.length]\n}\n\n/**\n * Check if string `sub` is a subsequence of string `str`.\n * All characters in `sub` must appear in order in `str` (they need not be contiguous).\n */\nconst isSubsequence = (sub: string, str: string): boolean => {\n\tif (!sub) return true\n\tif (!str) return false\n\n\tlet i = 0,\n\t\tj = 0\n\twhile (i < sub.length && j < str.length) {\n\t\tif (sub[i].toLowerCase() === str[j].toLowerCase()) i++\n\t\tj++\n\t}\n\treturn i === sub.length\n}\n\n/**\n * Check if every character (with frequency) in the query exists in the target.\n * For example, \"aovc\" matches \"avocados\".\n */\nconst anagramMatch = (query: string, target: string): boolean => {\n\tif (!query) return true\n\tif (!target) return false\n\n\tconst countChars = (s: string): Record<string, number> =>\n\t\ts\n\t\t\t.toLowerCase()\n\t\t\t.split('')\n\t\t\t.reduce(\n\t\t\t\t(acc, char) => {\n\t\t\t\t\tacc[char] = (acc[char] || 0) + 1\n\t\t\t\t\treturn acc\n\t\t\t\t},\n\t\t\t\t{} as Record<string, number>,\n\t\t\t)\n\n\tconst queryCount = countChars(query)\n\tconst targetCount = countChars(target)\n\treturn Object.keys(queryCount).every(char => (targetCount[char] || 0) >= queryCount[char])\n}\n\n/**\n * Generate bigrams for a string.\n */\nconst getBigrams = (s: string): string[] => {\n\tif (!s || s.length < 2) return []\n\n\tconst bigrams: string[] = []\n\tfor (let i = 0; i < s.length - 1; i++) {\n\t\tbigrams.push(s.substring(i, i + 2).toLowerCase())\n\t}\n\treturn bigrams\n}\n\n/**\n * Compute Dice's coefficient for two strings based on bigrams.\n * Returns a value between 0 (no similarity) and 1 (perfect match).\n */\nconst diceCoefficient = (s1: string, s2: string): number => {\n\tif (!s1 || !s2 || s1.length < 2 || s2.length < 2) return 0\n\n\tconst bigrams1 = getBigrams(s1)\n\tconst bigrams2 = getBigrams(s2)\n\n\tif (bigrams1.length === 0 || bigrams2.length === 0) return 0\n\n\tlet intersection = 0\n\tconst used = new Array(bigrams2.length).fill(false)\n\n\tfor (const bigram of bigrams1) {\n\t\tfor (let i = 0; i < bigrams2.length; i++) {\n\t\t\tif (!used[i] && bigrams2[i] === bigram) {\n\t\t\t\tintersection++\n\t\t\t\tused[i] = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (2 * intersection) / (bigrams1.length + bigrams2.length)\n}\n\n/**\n * Compute a fuzzy similarity score between two strings.\n * The score is computed by taking the maximum of several methods:\n * - Direct substring match (score 1)\n * - Subsequence check (score 0.8)\n * - Anagram subset match (score 0.7)\n * - Dice coefficient\n * - Normalized Levenshtein similarity\n */\nconst computeFuzzyScore = (actual: string, expected: string): number => {\n\tif (!actual || !expected) return 0\n\n\tconst a = actual.toLowerCase().trim()\n\tconst b = expected.toLowerCase().trim()\n\n\tif (a === b) return 1\n\n\tconst substringScore = a.includes(b) ? 1 : 0\n\tconst subsequenceScore = isSubsequence(b, a) ? 0.8 : 0\n\tconst anagramScore = anagramMatch(b, a) ? 0.7 : 0\n\tconst diceScore = diceCoefficient(a, b)\n\n\tconst maxLen = Math.max(a.length, b.length)\n\tconst levenshteinScore = maxLen ? 1 - levenshtein(a, b) / maxLen : 0\n\n\treturn Math.max(substringScore, subsequenceScore, anagramScore, diceScore, levenshteinScore)\n}\n\n/**\n * Safely coerce value to string if possible, or return empty string\n */\nconst safeString = (value: unknown): string => {\n\tif (value == null) return ''\n\treturn String(value)\n}\n\n/**\n * Apply a query condition to an item and return score\n */\nfunction applyQueryCondition<T extends Record<string, any>>(\n\titem: T,\n\tquery: QueryCondition,\n\tfuzzyThreshold: number = 0.3,\n): { valid: boolean; score: number } {\n\tlet field: string,\n\t\top: ComparisonOperator,\n\t\texpected: unknown,\n\t\tstrict = false\n\n\tif (Array.isArray(query)) {\n\t\t;[field, op, expected, strict = false] = query\n\t} else {\n\t\tfield = query.key\n\t\top = query.operator\n\t\texpected = query.value\n\t\tstrict = query.strict || false\n\t}\n\n\t// Skip empty filters for non-strict queries\n\tif (!strict && (expected === '' || expected == null || (isArray(expected) && expected.length === 0))) {\n\t\treturn { valid: true, score: 1 }\n\t}\n\n\tconst actual = getFieldValue(item, field)\n\n\t// FIXED: Properly handle strict mode\n\tif (strict) {\n\t\t// For strict mode, use exact equality comparison for all operators except 'any'\n\t\tif (op === 'any') {\n\t\t\t// Fuzzy search still applies with strict mode\n\t\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\t\treturn { valid: false, score: 0 }\n\t\t\t}\n\n\t\t\tconst score = computeFuzzyScore(actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: score >= fuzzyThreshold,\n\t\t\t\tscore: score >= fuzzyThreshold ? score : 0,\n\t\t\t}\n\t\t} else {\n\t\t\t// For all other operators in strict mode,\n\t\t\t// delegate to compareValues function but return precise scores\n\t\t\tconst matches = compareValues(op, actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: matches,\n\t\t\t\tscore: matches ? 1 : 0,\n\t\t\t}\n\t\t}\n\t} else if (op === 'any') {\n\t\t// Fuzzy search requires both values to be strings\n\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\tconst score = computeFuzzyScore(actual, expected)\n\t\tif (score < fuzzyThreshold) {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\treturn { valid: true, score }\n\t} else {\n\t\t// For non-fuzzy operators, check condition\n\t\tconst matches = compareValues(op, actual, expected)\n\t\treturn {\n\t\t\tvalid: matches,\n\t\t\tscore: matches ? 1 : 0,\n\t\t}\n\t}\n}\n\n/**\n * Filter a Map of items given an array of query conditions.\n * For each query condition:\n * - If the expected value is empty/null/undefined, it is treated as a match.\n * - For non-fuzzy operators, the condition must strictly match.\n * - For the \"any\" operator, a fuzzy similarity score is computed.\n * Items with a fuzzy score below a given threshold (e.g., 0.3) are excluded.\n *\n * The overall item score is the average of the scores from all conditions.\n * The results are sorted in descending order of relevance.\n *\n * @param items - A Map containing items to filter.\n * @param queries - An array of query conditions to apply.\n * @param fuzzyThreshold - Minimum score required for fuzzy matches (default: 0.3)\n * @returns An array of items that match all query conditions, sorted by relevance.\n */\nexport function filterMapItems<T extends Record<string, any>>(\n\titems: Map<string, T>,\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// If no queries, return all items unsorted\n\tif (!queries.length) {\n\t\treturn Array.from(items.values())\n\t}\n\n\t// Score and filter each item\n\tconst scoredItems: ScoredItem<T>[] = []\n\n\tfor (const [_, item] of items.entries()) {\n\t\tlet totalScore = 0\n\t\tlet matchCount = 0\n\t\tlet valid = true\n\n\t\tfor (const query of queries) {\n\t\t\tconst result = applyQueryCondition(item, query, fuzzyThreshold)\n\n\t\t\tif (!result.valid) {\n\t\t\t\tvalid = false\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\ttotalScore += result.score\n\t\t\tmatchCount++\n\t\t}\n\n\t\tif (valid) {\n\t\t\tscoredItems.push({\n\t\t\t\titem,\n\t\t\t\tscore: matchCount > 0 ? totalScore / matchCount : 1,\n\t\t\t})\n\t\t}\n\t}\n\n\t// Sort by descending score\n\tscoredItems.sort((a, b) => b.score - a.score)\n\n\treturn scoredItems.map(x => x.item)\n}\n\n/**\n * Filter an array of items using query conditions\n */\nexport function filterArrayItems<T extends Record<string, any>>(\n\titems: T[],\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// Create temporary map with numeric indices as keys\n\tconst map = new Map<string, T>()\n\titems.forEach((item, index) => map.set(String(index), item))\n\n\treturn filterMapItems(map, queries, fuzzyThreshold)\n}\n\n// Improved type guards for filter-directive.ts\n\n/**\n * Type guard for checking if a value is an array with better type inference\n * @param value Value to check\n * @returns True if the value is an array\n */\nexport function isArray<T = unknown>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for checking if a value is a string\n * @param value Value to check\n * @returns True if the value is a string\n */\nexport function isString(value: unknown): value is string {\n\treturn typeof value === 'string'\n}\n\n/**\n * Type guard for checking if a value is a number\n * @param value Value to check\n * @returns True if the value is a number and not NaN\n */\nexport function isNumber(value: unknown): value is number {\n\treturn typeof value === 'number' && !isNaN(value)\n}\n\n/**\n * Type guard for checking if a value is a date\n * @param value Value to check\n * @returns True if the value is a valid Date object\n */\nexport function isDate(value: unknown): value is Date {\n\treturn value instanceof Date && !isNaN(value.getTime())\n}\n\n/**\n * Type guard for checking if a value is an iterable collection\n * @param value Value to check\n * @returns True if the value implements the iterable protocol\n */\nexport function isIterable<T = unknown>(value: unknown): value is Iterable<T> {\n\t// Must be non-null and of type 'object'\n\tif (value == null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\t// Check for Symbol.iterator method\n\treturn Symbol.iterator in Object(value) && typeof (value as any)[Symbol.iterator] === 'function'\n}\n\n/**\n * Type guard for checking if a value is a Map\n * @param value Value to check\n * @returns True if the value is a Map\n */\nexport function isMap<K = unknown, V = unknown>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for checking if a value is a Set\n * @param value Value to check\n * @returns True if the value is a Set\n */\nexport function isSet<T = unknown>(value: unknown): value is Set<T> {\n\treturn value instanceof Set\n}\n\n/**\n * Type guard for checking if a value is a plain object (not an array, Map, etc.)\n * @param value Value to check\n * @returns True if the value is a plain object\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n\tif (value === null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\tconst proto = Object.getPrototypeOf(value)\n\treturn proto === Object.prototype || proto === null\n}\n\n/**\n * Type guard for checking if a value is undefined or null\n * @param value Value to check\n * @returns True if the value is undefined or null\n */\nexport function isNil(value: unknown): value is undefined | null {\n\treturn value === undefined || value === null\n}\n\n/**\n * Improved type-safe comparison function that uses appropriate type guards\n * @param op Comparison operator\n * @param actual Actual value\n * @param expected Expected value\n * @returns Result of the comparison\n */\nexport function compareValues(op: ComparisonOperator, actual: unknown, expected: unknown): boolean {\n\t// Handle null/undefined cases\n\tif (isNil(actual) && isNil(expected)) return true\n\tif (isNil(actual) || isNil(expected)) {\n\t\t// For equality operators, null == null but null != non-null\n\t\tif (op === '==') return actual === expected\n\t\tif (op === '!=') return actual !== expected\n\t\t// Other operators should return false for null/undefined values\n\t\treturn false\n\t}\n\n\tswitch (op) {\n\t\tcase '==':\n\t\t\treturn actual === expected\n\t\tcase '!=':\n\t\t\treturn actual !== expected\n\t\tcase '>':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual > expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() > expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) > 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual < expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() < expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) < 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '>=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual >= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() >= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) >= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual <= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() <= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) <= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase 'includes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIncludes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn !actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn !actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn !actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn !Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tcase 'startsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().startsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'endsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().endsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'in': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn expected.has(actual as any) || Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIn': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn !expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn !expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn !expected.has(actual as any) && !Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tdefault: {\n\t\t\tconsole.warn(`Operator \"${op}\" is not supported in comparison.`)\n\t\t\treturn false\n\t\t}\n\t}\n}\n\n// Export a simpler alias for filterMapItems\nexport const filterMap = filterMapItems\n\n// Export an alias for filterArrayItems\nexport const filterArray = filterArrayItems\n","// src/store/selectors.ts\nimport { BehaviorSubject, Observable, combineLatest, distinctUntilChanged, map, share, shareReplay } from 'rxjs'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Deep equality comparison for maps and complex objects\n * More efficient than JSON.stringify for large objects\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true\n\n\tif (a instanceof Map && b instanceof Map) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const [key, value] of a) {\n\t\t\tif (!b.has(key) || !deepEqual(value, b.get(key))) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Set && b instanceof Set) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const item of a) {\n\t\t\tif (!b.has(item)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null) {\n\t\tconst keysA = Object.keys(a)\n\t\tconst keysB = Object.keys(b)\n\n\t\tif (keysA.length !== keysB.length) return false\n\n\t\tfor (const key of keysA) {\n\t\t\t// @ts-ignore: Index signature\n\t\t\tif (!deepEqual(a[key], b[key])) return false\n\t\t}\n\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n/**\n * Creates a selector that derives a value from store state\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector for collection stores that derives a value from the collection\n *\n * @param store The collection store to observe\n * @param selectorFn Function that transforms the collection\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createCollectionSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tselectorFn: (state: Map<string, T>) => R,\n): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector that returns all items from a collection as an array\n *\n * @param store The collection store\n * @returns An observable of all items as an array\n */\nexport function createItemsSelector<T>(store: ICollectionStore<T>): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.values()))\n}\n\n/**\n * Creates a selector that retrieves a single item from a collection\n *\n * @param store The collection store\n * @param itemKey The key of the item to select\n * @returns An observable of the selected item that emits when the item changes\n */\nexport function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => collection.get(itemKey))\n}\n\nexport function createCompoundSelector<R>(\n\tstores: Array<IStore<any> | ICollectionStore<any>>,\n\tselectorFns: Array<(state: any) => any>,\n\tcombinerFn: (...values: any[]) => R,\n): Partial<IStore<R>> {\n\t// Create observables for each store\n\tconst observables = stores.map((store, index) => {\n\t\tconst selectorFn = selectorFns[index]\n\n\t\t// Check if it's a collection store\n\t\tif ('set' in store && typeof store.set === 'function' && store.value instanceof Map) {\n\t\t\treturn createCollectionSelector(store as ICollectionStore<any>, selectorFn)\n\t\t} else {\n\t\t\treturn createSelector(store as IStore<any>, selectorFn)\n\t\t}\n\t})\n\n\t// Combine the observables\n\tconst observable = combineLatest(observables).pipe(\n\t\tmap(values => combinerFn(...values)),\n\t\tdistinctUntilChanged(deepEqual),\n\t\tshareReplay(1),\n\t)\n\n\t// Compute initial value from source stores\n\tconst initialValues = stores.map((store, index) => selectorFns[index](store.value))\n\n\tconst initialValue = combinerFn(...initialValues)\n\n\t// Create BehaviorSubject with initial value\n\tconst behaviorSubject = new BehaviorSubject<R>(initialValue)\n\n\t// Subscribe to updates\n\tobservable.subscribe(value => behaviorSubject.next(value as R))\n\n\t// Return minimal store-compatible object\n\treturn {\n\t\t$: behaviorSubject,\n\t\tget value() {\n\t\t\treturn behaviorSubject.getValue()\n\t\t},\n\t\tready: true,\n\t}\n}\n/**\n * Creates a selector that returns all keys from a collection\n */\nexport function createKeysSelector<T>(store: ICollectionStore<T>): Observable<string[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.keys()))\n}\n\n/**\n * Creates a selector that returns entries (key-value pairs) from a collection\n */\nexport function createEntriesSelector<T>(store: ICollectionStore<T>): Observable<[string, T][]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.entries()))\n}\n\n/**\n * Creates a selector that sorts collection items\n */\nexport function createSortSelector<T>(store: ICollectionStore<T>, compareFn: (a: T, b: T) => number): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => {\n\t\treturn Array.from(collection.values()).sort(compareFn)\n\t})\n}\n\n/**\n * Creates a selector that finds the first item matching a predicate\n */\nexport function createFindSelector<T>(\n\tstore: ICollectionStore<T>,\n\tpredicate: (item: T, key: string) => boolean,\n): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => {\n\t\tfor (const [key, item] of collection.entries()) {\n\t\t\tif (predicate(item, key)) {\n\t\t\t\treturn item\n\t\t\t}\n\t\t}\n\t\treturn undefined\n\t})\n}\n\n/**\n * Creates a selector that filters items from a collection - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Function that returns true for items to include\n * @returns An observable of filtered items as an array\n */\nexport function createFilterSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn: (item: T, key: string) => boolean,\n): Observable<T[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries())\n\t\t\t.filter(([key, item]) => filterFn(item, key))\n\t\t\t.map(([_, item]) => item),\n\t)\n}\n\n/**\n * Creates a selector that maps collection values through a transform function - OPTIMIZED\n */\nexport function createMapSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tmapFn: (item: T, key: string) => R,\n): Observable<R[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries()).map(([key, item]) => mapFn(item, key)),\n\t)\n}\n\n/**\n * Creates a selector that counts items in a collection, optionally filtered - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Optional function to filter which items to count\n * @returns An observable of the count\n */\nexport function createCountSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn?: (item: T, key: string) => boolean,\n): Observable<number> {\n\treturn createCollectionSelector(store, collection => {\n\t\tif (!filterFn) return collection.size\n\n\t\treturn Array.from(collection.entries()).filter(([key, item]) => filterFn(item, key)).length\n\t})\n}\n\n/**\n * Optimized RxJS Pipeline - use share with reset on refCount zero for better memory management\n * in scenarios where selector subscriptions come and go\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state with improved memory management\n */\nexport function createOptimizedSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(\n\t\tmap(selectorFn),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshare({\n\t\t\tresetOnRefCountZero: true,\n\t\t\tresetOnError: false,\n\t\t\tresetOnComplete: false,\n\t\t}),\n\t)\n}\n","// src/store/selector-hook.ts - Improved memory management\nimport { property as litProperty } from 'lit/decorators.js'\nimport { Observable, Subject, Subscription } from 'rxjs'\nimport { takeUntil } from 'rxjs/operators'\nimport { createCollectionSelector, createSelector } from './selectors'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Symbol used for storing cleanup resources\n * Using a Symbol prevents name collisions with component properties\n */\nconst CLEANUP_SUBJECT = Symbol('selectorCleanup')\nconst SUBSCRIPTIONS = Symbol('selectorSubscriptions')\nconst INITIALIZED = Symbol('selectorInitialized')\n\n/**\n * Component lifecycle interface\n */\ninterface ComponentWithLifecycle {\n\t// Lifecycle hooks\n\tisConnected: boolean\n\tdisconnectedCallback?: () => void\n\tconnectedCallback?: () => void\n\trequestUpdate?: () => void\n\n\t// Internal properties using symbols to avoid name collisions\n\t[CLEANUP_SUBJECT]?: Subject<void>\n\t[SUBSCRIPTIONS]?: Map<string, Subscription>\n\t[INITIALIZED]?: Set<string>\n\n\t// Value storage\n\t[key: string]: any\n}\n\n/**\n * Property descriptor interface\n */\ntype PropertyDescriptor<T> = {\n\tget?: () => T\n\tset?: (value: T) => void\n\tvalue?: T\n\tconfigurable?: boolean\n\tenumerable?: boolean\n\twritable?: boolean\n}\n\n/**\n * Options for selecting from a store\n */\ninterface SelectOptions {\n\t/** If true, will wait for selector to emit a non-null value before calling connectedCallback */\n\trequired?: boolean\n\n\t/** If true, will only update the component and not set the property value */\n\tupdateOnly?: boolean\n\n\t/** If true, will use structuredClone to deeply clone values (prevents mutations) */\n\tdeepClone?: boolean\n\n\t/** Custom equality function to determine when to update */\n\tequals?: (a: any, b: any) => boolean\n\n\t/** Debug mode - logs selector activity */\n\tdebug?: boolean\n}\n\n/**\n * Type guard to check if a store is a collection store\n */\nfunction isCollectionStore<T>(store: IStore<any> | ICollectionStore<T>): store is ICollectionStore<T> {\n\treturn 'set' in store && typeof store.set === 'function' && store.value instanceof Map\n}\n\n/**\n * Ensures the cleanup resources exist on the component\n */\nfunction ensureCleanupResources(component: ComponentWithLifecycle): void {\n\tif (!component[CLEANUP_SUBJECT] || component[CLEANUP_SUBJECT].closed) {\n\t\tcomponent[CLEANUP_SUBJECT] = new Subject<void>()\n\t}\n\n\tif (!component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS] = new Map()\n\t}\n\n\tif (!component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED] = new Set()\n\t}\n}\n\n/**\n * Cleans up all selector resources\n */\nfunction cleanupSelectorResources(component: ComponentWithLifecycle): void {\n\tif (component[CLEANUP_SUBJECT]) {\n\t\tcomponent[CLEANUP_SUBJECT].next()\n\t\tcomponent[CLEANUP_SUBJECT].complete()\n\t\tcomponent[CLEANUP_SUBJECT] = undefined\n\t}\n\n\tif (component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS].forEach(sub => sub.unsubscribe())\n\t\tcomponent[SUBSCRIPTIONS].clear()\n\t\tcomponent[SUBSCRIPTIONS] = undefined\n\t}\n\n\tif (component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED].clear()\n\t\tcomponent[INITIALIZED] = undefined\n\t}\n}\n\n/**\n * Selector decorator that connects a component property to a store selector\n * with improved memory management\n *\n * @param store The store to select from\n * @param selectorFn Optional function to transform the store state\n * @param options Additional options for the selector\n */\nexport function select<T, R>(\n\tstore: IStore<T> | ICollectionStore<T>,\n\tselectorFn: (state: any) => R = (state: R) => state,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<R>) {\n\t\t// Register as a Lit property\n\t\tlitProperty({ attribute: false, type: Object })(proto, propName)\n\n\t\t// Store original lifecycle methods\n\t\tconst originalConnectedCallback = proto.connectedCallback\n\t\tconst originalDisconnectedCallback = proto.disconnectedCallback\n\n\t\t// Override connectedCallback to set up subscription\n\t\tproto.connectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Initialize cleanup resources\n\t\t\tensureCleanupResources(this)\n\n\t\t\t// Create the appropriate selector\n\t\t\tconst selector: Observable<R> = isCollectionStore(store)\n\t\t\t\t? createCollectionSelector(store, selectorFn)\n\t\t\t\t: createSelector(store as IStore<T>, selectorFn)\n\n\t\t\t// Call original connectedCallback immediately if not waiting for data\n\t\t\tif (!options.required && !this[INITIALIZED]!.has(propName)) {\n\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t}\n\n\t\t\t// Clean up any existing subscription\n\t\t\tif (this[SUBSCRIPTIONS]!.has(propName)) {\n\t\t\t\tthis[SUBSCRIPTIONS]!.get(propName)?.unsubscribe()\n\t\t\t\tthis[SUBSCRIPTIONS]!.delete(propName)\n\t\t\t}\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Setting up subscription for ${propName}`)\n\t\t\t}\n\n\t\t\t// Create new subscription with better error handling\n\t\t\tconst subscription = selector.pipe(takeUntil(this[CLEANUP_SUBJECT]!)).subscribe({\n\t\t\t\tnext: (value: R) => {\n\t\t\t\t\t// Handle value updates\n\t\t\t\t\tconst newValue = options.deepClone ? structuredClone(value) : value\n\n\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\tconsole.debug(`[select] New value for ${propName}:`, newValue)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!options.updateOnly) {\n\t\t\t\t\t\tthis[propName] = newValue\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.requestUpdate?.()\n\n\t\t\t\t\t// If required and not initialized, call connectedCallback when we get a value\n\t\t\t\t\tif (options.required && !this[INITIALIZED]!.has(propName) && newValue !== null && newValue !== undefined) {\n\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\tconsole.debug(`[select] Calling delayed connectedCallback for ${propName}`)\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\terror: (err: Error) => {\n\t\t\t\t\tconsole.error(`Error in selector subscription for ${propName}:`, err)\n\t\t\t\t\t// Resubscribe on error to prevent component from becoming unresponsive\n\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t// Small delay to prevent immediate resubscription\n\t\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\t\tconsole.debug(`[select] Resubscribing after error for ${propName}`)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tthis.connectedCallback?.()\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}, 1000)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\n\t\t\t// Store the subscription for cleanup\n\t\t\tthis[SUBSCRIPTIONS]!.set(propName, subscription)\n\t\t}\n\n\t\t// Override disconnectedCallback to clean up subscriptions\n\t\tproto.disconnectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Call original disconnectedCallback\n\t\t\toriginalDisconnectedCallback?.call(this)\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Cleaning up resources in disconnectedCallback`)\n\t\t\t}\n\n\t\t\t// Clean up all subscription resources\n\t\t\tcleanupSelectorResources(this)\n\t\t}\n\t}\n}\n\n/**\n * Creates a selector decorator that selects a specific item from a collection store\n * with improved memory management\n *\n * @param store The collection store\n * @param keyGetter Function that returns the key to select\n * @param options Additional options\n */\nexport function selectItem<T>(\n\tstore: ICollectionStore<T>,\n\tkeyGetter: (component: any) => string,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<T | undefined>) {\n\t\tselect(\n\t\t\tstore,\n\t\t\tfunction (state) {\n\t\t\t\t// This will be evaluated during subscription, when 'this' is available\n\t\t\t\tconst itemKey = keyGetter(this)\n\t\t\t\treturn itemKey ? state.get(itemKey) : undefined\n\t\t\t},\n\t\t\toptions,\n\t\t)(proto, propName)\n\t}\n}\n"],"names":["createObjectStore","initialData","storage","key","value","Array","isArray","Map","Set","Date","RegExp","Object","getPrototypeOf","prototype","store","SchmancyStoreObject","getInstance","obj","keys","length","set","createArrayStore","SchmancyArrayStore","replace","err","createContext","includes","SchmancyCollectionStore","size","error","createArrayContext","createTestArrayContext","getFieldValue","item","path","parts","split","part","getBigrams","s","bigrams","i","push","substring","toLowerCase","computeFuzzyScore","actual","expected","a","trim","b","substringScore","subsequenceScore","sub","str","j","anagramScore","query","target","countChars","reduce","acc","char","queryCount","targetCount","every","diceScore","s1","s2","bigrams1","bigrams2","intersection","used","fill","bigram","maxLen","Math","max","levenshteinScore","matrix","map","_","charAt","min","safeString","String","applyQueryCondition","fuzzyThreshold","field","op","strict","operator","valid","score","matches","compareValues","t","filterMapItems","items","queries","from","values","scoredItems","entries","totalScore","matchCount","result","sort","x","filterArrayItems","forEach","index","isString","isNumber","isNaN","isDate","getTime","isIterable","Symbol","iterator","isMap","isSet","isPlainObject","proto","isNil","localeCompare","has","startsWith","endsWith","filterMap","filterArray","deepEqual","get","keysA","keysB","createSelector","selectorFn","$","pipe","distinctUntilChanged","shareReplay","createCollectionSelector","createItemsSelector","collection","createItemSelector","itemKey","createCompoundSelector","stores","selectorFns","combinerFn","observables","observable","combineLatest","initialValues","initialValue","behaviorSubject","BehaviorSubject","subscribe","next","getValue","ready","createKeysSelector","createEntriesSelector","createSortSelector","compareFn","createFindSelector","predicate","createFilterSelector","filterFn","filter","createMapSelector","mapFn","createCountSelector","createOptimizedSelector","share","resetOnRefCountZero","resetOnError","resetOnComplete","CLEANUP_SUBJECT","SUBSCRIPTIONS","INITIALIZED","select","state","options","propName","_descriptor","litProperty","attribute","type","originalConnectedCallback","connectedCallback","originalDisconnectedCallback","disconnectedCallback","component","this","closed","Subject","selector","required","call","add","unsubscribe","delete","debug","subscription","takeUntil","newValue","deepClone","structuredClone","updateOnly","requestUpdate","isConnected","setTimeout","complete","clear","selectItem","keyGetter"],"mappings":";;;;AAkDA,SAASA,EACRC,GACAC,GACAC,GAEI;AAAA,MAAA;AAEa,IAAZD,MAAY,gBAELA,IAAA,YAzBUE,IA6BFH,OA3BT,QACO,OAAVG,KAAU,YAChBC,MAAMC,QAAQF,CACbA,KAAAA,aAAiBG,OACjBH,aAAiBI,OACjBJ,aAAiBK,QACjBL,aAAiBM,UACnBC,OAAOC,eAAeR,CAAAA,MAAWO,OAAOE,eAsBzBZ,IAAA,EAAA,GAAKA,EAIpB;AAAA,UAAMa,IAAQC,EAAoBC,YAAed,GAASC,GAAKF,CAAAA;AAOxD,WAjEW,QADGgB,IA8DHH,EAAMV,UA7DN,YAAYa,MAAQ,QAGhCN,OAAOO,KAAKD,CAAAA,EAAKE,WAAW,KA2DjCL,EAAMM,IAAI,EAAA,GAAKnB,EAGTa,CAAAA,GAAAA;AAAAA,UAUA;AAAA,WANeC,EAAoBC,YACzC,UACA,GAAGb,CACHF,aAAAA,CAAAA;AAAAA,EAGM;AA5ET,MAAuBgB,GAwBAb;AAsDvB;AAqCA,SAASiB,EACRpB,GACAC,GACAC,GAAAA;AAEI,MAEH;AAAA,UAAMW,IAAQQ,EAAmBN,YAAYd,GAASC,GAAKF,CAAAA;AAQpD,WALFa,EAAMV,MAAMe,UAEhBL,EAAMS,QAAQ,CAAItB,GAAAA,CAAAA,CAAAA,GAGZa;AAAAA,UACCU;AASD,WANeF,EAAmBN,YACxC,UACA,GAAGb,CAAAA,aACH,CAAIF,GAAAA,CAAAA,CAAAA;AAAAA,EAGE;AAET;AA8CgB,SAAAwB,EACfxB,GACAC,GACAC,GAAAA;AAKI,MAeC;AAAA,WATFF,KAJEA,SAIFA,IADGE,EAAIuB,SAAS,YAAiBvB,KAAAA,EAAIuB,SAAS,KAAA,wBAC5BnB,QACRJ,EAAIuB,SAAS,OAAYvB,KAAAA,EAAIuB,SAAS,MAAA,IAClC,CAEA,IAAA,CAAC,IAKMzB,aAxMAM,MAwEzB,SACCN,GACAC,GACAC;AAEI,UAEH;AAAA,cAAMW,IAAQa,EAAwBX,YAAYd,GAASC,GAAKF,CAAAA;AAQzD,eALFa,EAAMV,MAAMwB,QAEhBd,EAAMS,QAAQ,IAAIhB,IAAIN,CAGhBa,CAAAA,GAAAA;AAAAA,cAUA;AAAA,eANea,EAAwBX,YAC7C,UACA,GAAGb,CACH,aAAA,IAAII,IAAIN,CAAAA,CAAAA;AAAAA,MAGF;AAAA,IAET,EAsGqCA,GAAaC,GAASC,CAnM3D,IAAA,SAAoBC,GACZ;AAAA,aAAAC,MAAMC,QAAQF,CACtB;AAAA,IAAA,EAkM0BH,CAAAA,IAChBoB,EAAsBpB,GAAaC,GAASC,CAAAA,IAE5CH,EAD0B,OAAhBC,KAAgB,WACHA,IAIA,EAAEG,OAAOH,EAJ2BC,GAAAA,GAASC;UAMpE0B;AAKD,WAAA7B,EACCC,OAAAA,KAAgB,YAAYA,MAAgB,OAAO,EAAKA,GAAAA,EAAAA,IAAgB,EAAEG,OAAOH,EACxF,GAAA,UACA,sBAAsBE,CAAAA,EAAAA;AAAAA,EACvB;AAEF;AASO,SAAS2B,GACf7B,IAAmB,CAAA,GACnBE,GACAD,IAAuB,SAEnB;AAAA,MAAA;AACI,WAAAuB,EAAiBxB,GAAaC,GAASC;UACtCqB;AAGR,WAAOH,EAAoBpB,GAAa,UAAU,GAAGE,CAAc,WAAA;AAAA,EAAA;AAErE;AAQO,SAAS4B,GACf9B,IAAmB,CACnBE,GAAAA,IAAc,cAEV;AAAA,MAAA;AACI,WAAAsB,EAAiBxB,GAAa,UAAUE;UACvCqB;AAGR,WAAOH,EAAoBpB,GAAa,UAAU,GAAGE,CAAAA,qBAAAA;AAAAA,EAAwB;AAE/E;ACzOa,MAAA6B,IAAgB,CAAUC,GAA2BC,MAAAA;AAC7D,MAACA,CAAAA,EAAa,QAAAD;AAEZ,QAAAE,IAAQD,EAAKE,MAAM,GACzB;AAAA,MAAIhC,IAAa6B;AAEjB,aAAWI,KAAQF,GAAO;AACrB,QAAA/B,KAAS,KAAa;AAC1BA,IAAAA,IAAQA,EAAMiC,CAAAA;AAAAA,EAAI;AAGZ,SAAAjC;AAAA,GA+EFkC,IAAcC,CAAAA,MACnB;AAAA,MAAA,CAAKA,KAAKA,EAAEpB,SAAS,UAAU,CAAA;AAE/B,QAAMqB,IAAoB,CAC1B;AAAA,WAASC,IAAI,GAAGA,IAAIF,EAAEpB,SAAS,GAAGsB,IACzBD,CAAAA,EAAAE,KAAKH,EAAEI,UAAUF,GAAGA,IAAI,CAAGG,EAAAA,YAAAA,CAAAA;AAE7B,SAAAJ;AAAA,GAwCFK,IAAoB,CAACC,GAAgBC,MAC1C;AAAA,MAAA,CAAKD,KAAWC,CAAAA,EAAiB,QAAA;AAEjC,QAAMC,IAAIF,EAAOF,YAAAA,EAAcK,KACzBC,GAAAA,IAAIH,EAASH,YAAAA,EAAcK,KAE7B;AAAA,MAAAD,MAAME,EAAU,QAAA;AAEpB,QAAMC,IAAiBH,EAAEtB,SAASwB,CAAK,IAAA,IAAI,GACrCE,KAjGe,CAACC,GAAaC,MAAAA;AAC/B,QAACD,CAAAA,EAAY,QAAA;AACb,QAACC,CAAAA,EAAY,QAAA;AAEb,QAAAb,IAAI,GACPc,IAAI;AACL,WAAOd,IAAIY,EAAIlC,UAAUoC,IAAID,EAAInC,SAC5BkC,CAAAA,EAAIZ,CAAAA,EAAGG,YAAkBU,MAAAA,EAAIC,CAAGX,EAAAA,YAAAA,KAAeH,KACnDc;AAED,WAAOd,MAAMY,EAAIlC;AAAAA,EAAA,GAuFsB+B,GAAGF,CAAAA,IAAK,MAAM,GAC/CQ,KAjFc,CAACC,GAAeC,MAAAA;AAChC,QAACD,CAAAA,EAAc,QAAA;AACf,QAACC,CAAAA,EAAe,QAAA;AAEd,UAAAC,IAAcpB,CAAAA,MACnBA,EACEK,YACAR,EAAAA,MAAM,EACNwB,EAAAA,OACA,CAACC,GAAKC,OACLD,EAAIC,CAAAA,KAASD,EAAIC,CAAAA,KAAS,KAAK,GACxBD,IAER,CAAA,CAGGE,GAAAA,IAAaJ,EAAWF,CAAAA,GACxBO,IAAcL,EAAWD,CAC/B;AAAA,WAAO/C,OAAOO,KAAK6C,CAAYE,EAAAA,MAAMH,CAAAA,OAASE,EAAYF,CAAS,KAAA,MAAMC,EAAWD,CAAAA,CAAAA;AAAAA,EAAK,GA+DvDZ,GAAGF,CAAAA,IAAK,MAAM,GAC1CkB,KA5CiB,CAACC,GAAYC,MAAAA;AAChC,QAACD,CAAAA,KAAAA,CAAOC,KAAMD,EAAGhD,SAAS,KAAKiD,EAAGjD,SAAS,EAAU,QAAA;AAEnD,UAAAkD,IAAW/B,EAAW6B,CACtBG,GAAAA,IAAWhC,EAAW8B,CAAAA;AAE5B,QAAIC,EAASlD,WAAW,KAAKmD,EAASnD,WAAW,EAAU,QAAA;AAE3D,QAAIoD,IAAe;AACnB,UAAMC,IAAO,IAAInE,MAAMiE,EAASnD,MAAQsD,EAAAA,KAAAA,EAExC;AAAA,eAAWC,KAAUL,EACpB,UAAS5B,IAAI,GAAGA,IAAI6B,EAASnD,QAAQsB,IACpC,KAAA,CAAK+B,EAAK/B,CAAAA,KAAM6B,EAAS7B,CAAAA,MAAOiC,GAAQ;AACvCH,MAAAA,KACAC,EAAK/B,CAAAA,IAAAA;AACL;AAAA,IAAA;AAKH,WAAQ,IAAI8B,KAAiBF,EAASlD,SAASmD,EAASnD;AAAAA,EAAA,GAuBtB6B,GAAGE,CAAAA,GAE/ByB,IAASC,KAAKC,IAAI7B,EAAE7B,QAAQ+B,EAAE/B,MAC9B2D,GAAAA,IAAmBH,IAAS,KAtId3B,CAAAA,GAAWE;AAC3B,QAAAF,MAAME,EAAU,QAAA;AAEpB,UAAM6B,IAAqB1E,MAAM6C,EAAE/B,SAAS,CAC1CsD,EAAAA,KAAK,IACLO,EAAAA,IAAI,CAACC,GAAGxC,MAAM,CAACA,CAGjB,CAAA;AAAA,aAASc,IAAI,GAAGA,KAAKP,EAAE7B,QAAQoC,IACvBwB,CAAAA,EAAA,CAAGxB,EAAAA,CAAAA,IAAKA;AAGhB,aAASd,IAAI,GAAGA,KAAKS,EAAE/B,QAAQsB,IAC9B,UAASc,IAAI,GAAGA,KAAKP,EAAE7B,QAAQoC,IAC1BL,CAAAA,EAAEgC,OAAOzC,IAAI,CAAOO,MAAAA,EAAEkC,OAAO3B,IAAI,CAC7BwB,IAAAA,EAAAtC,CAAGc,EAAAA,CAAAA,IAAKwB,EAAOtC,IAAI,CAAGc,EAAAA,IAAI,KAEjCwB,EAAOtC,CAAAA,EAAGc,CAAKqB,IAAAA,KAAKO,IACnBJ,EAAOtC,IAAI,CAAA,EAAGc,CAAK,IAAA,GACnBwB,EAAOtC,CAAAA,EAAGc,IAAI,CAAA,IAAK,GACnBwB,EAAOtC,IAAI,CAAA,EAAGc,IAAI,CAAA,IAAK,CAK3B;AAAA,WAAOwB,EAAO7B,EAAE/B,MAAQ6B,EAAAA,EAAE7B,MAAM;AAAA,EAAA,GA6GkB6B,GAAGE,KAAKyB,IAAS;AAEnE,SAAOC,KAAKC,IAAI1B,GAAgBC,GAAkBI,GAAcU,GAAWY,CAAAA;AAAgB,GAMtFM,IAAchF,CAAAA,MACfA,KAAS,OAAa,KACnBiF,OAAOjF,CAAAA;AAMf,SAASkF,EACRrD,GACAwB,GACA8B,IAAyB,KAAA;AAErB,MAAAC,GACHC,GACA1C,GACA2C,IAAS;AAYN,MAVArF,MAAMC,QAAQmD,CACf+B,IAAAA,CAAAA,GAAOC,GAAI1C,GAAU2C,IAAS,EAAA,IAASjC,KAEzC+B,IAAQ/B,EAAMtD,KACdsF,IAAKhC,EAAMkC,UACX5C,IAAWU,EAAMrD,OACjBsF,IAASjC,EAAMiC,UAAU,KAAA,CAIrBA,MAAW3C,MAAa,MAAMA,KAAY,QAASzC,EAAQyC,CAAiC,KAApBA,EAAS5B,WAAW,GAChG,QAAO,EAAEyE,OAAO,IAAMC,OAAO,EAAA;AAGxB,QAAA/C,IAASd,EAAcC,GAAMuD,CAGnC;AAAA,MAAIE,GAAQ;AAEX,QAAID,MAAO,OAAO;AAEjB,UAAsB,OAAX3C,KAAW,YAAgC,OAAbC,KAAa,SACrD,QAAO,EAAE6C,OAAAA,IAAcC,OAAO,EAGzB;AAAA,YAAAA,IAAQhD,EAAkBC,GAAQC,CACjC;AAAA,aAAA,EACN6C,OAAOC,KAASN,GAChBM,OAAOA,KAASN,IAAiBM,IAAQ,EAC1C;AAAA,IAAA;AACM;AAGN,YAAMC,IAAUC,EAAcN,GAAI3C,GAAQC,CACnC;AAAA,aAAA,EACN6C,OAAOE,GACPD,OAAOC,IAAU,IAAI,EACtB;AAAA,IAAA;AAAA,EACD;AACD,MAAWL,MAAO,OAAO;AAExB,QAAsB,OAAX3C,KAAW,YAAgC,OAAbC,KAAa,SACrD,QAAO,EAAE6C,OAAAA,IAAcC,OAAO,EAGzB;AAAA,UAAAA,IAAQhD,EAAkBC,GAAQC,CAAAA;AACxC,WAAI8C,IAAQN,IACJ,EAAEK,OAAO,IAAOC,OAAO,EAAA,IAGxB,EAAED,OAAAA,IAAaC,OAAMG,EAAA;AAAA,EAAA;AACtB;AAEN,UAAMF,IAAUC,EAAcN,GAAI3C,GAAQC,CACnC;AAAA,WAAA,EACN6C,OAAOE,GACPD,OAAOC,IAAU,IAAI,EACtB;AAAA,EAAA;AAEF;AAkBO,SAASG,EACfC,GACAC,IAA4B,CAAA,GAC5BZ,IAAyB,KAAA;AAGrB,MAACY,CAAAA,EAAQhF,OACZ,QAAOd,MAAM+F,KAAKF,EAAMG,OAAAA,CAAAA;AAIzB,QAAMC,IAA+B,CAErC;AAAA,aAAYrB,CAAAA,GAAGhD,CAASiE,KAAAA,EAAMK,QAAW,GAAA;AACxC,QAAIC,IAAa,GACbC,IAAa,GACbb,IAAAA;AAEJ,eAAWnC,KAAS0C,GAAS;AAC5B,YAAMO,IAASpB,EAAoBrD,GAAMwB,GAAO8B,CAAAA;AAE5C,WAACmB,EAAOd,OAAO;AACVA,QAAAA,IAAAA;AACR;AAAA,MAAA;AAGDY,MAAAA,KAAcE,EAAOb,OACrBY;AAAAA,IAAA;AAGGb,IAAAA,KACHU,EAAY5D,KAAK,EAChBT,MACA4D,GAAAA,OAAOY,IAAa,IAAID,IAAaC,IAAa,EAEpD,CAAA;AAAA,EAAA;AAMD,SAFAH,EAAYK,KAAK,CAAC3D,GAAGE,MAAMA,EAAE2C,QAAQ7C,EAAE6C,KAAAA,GAEhCS,EAAYtB,IAAS4B,CAAAA,MAAAA,EAAE3E,IAC/B;AAAA;AAKO,SAAS4E,EACfX,GACAC,IAA4B,CAC5BZ,GAAAA,IAAyB,KAGnB;AAAA,QAAAP,wBAAUzE;AAGT,SAFD2F,EAAAY,QAAQ,CAAC7E,GAAM8E,MAAU/B,EAAI5D,IAAIiE,OAAO0B,CAAQ9E,GAAAA,CAAAA,CAAAA,GAE/CgE,EAAejB,GAAKmB,GAASZ,CACrC;AAAA;AASO,SAASjF,EAAqBF,GAC7B;AAAA,SAAAC,MAAMC,QAAQF,CACtB;AAAA;AAOO,SAAS4G,EAAS5G,GACxB;AAAA,SAAcA,OAAAA,KAAU;AACzB;AAOO,SAAS6G,EAAS7G,GAAAA;AACxB,SAAwB,OAAVA,KAAU,YAAa8G,CAAAA,MAAM9G,CAC5C;AAAA;AAOO,SAAS+G,EAAO/G,GACtB;AAAA,SAAOA,aAAiBK,QAAAA,CAASyG,MAAM9G,EAAMgH,QAC9C,CAAA;AAAA;AAOO,SAASC,GAAwBjH,GAEvC;AAAA,SAAIA,KAAS,QAAeA,OAAAA,KAAU,YAK/BkH,OAAOC,YAAY5G,OAAOP,CAAAA,KAAkBA,OAAAA,EAAckH,OAAOC,QAAAA,KAAc;AACvF;AAOO,SAASC,EAAgCpH,GAAAA;AAC/C,SAAOA,aAAiBG;AACzB;AAOO,SAASkH,EAAmBrH,GAAAA;AAClC,SAAOA,aAAiBI;AACzB;AAOO,SAASkH,GAActH,GAC7B;AAAA,MAAIA,MAAU,QAAeA,OAAAA,KAAU,SAC/B,QAAA;AAGF,QAAAuH,IAAQhH,OAAOC,eAAeR,CAC7B;AAAA,SAAAuH,MAAUhH,OAAOE,aAAa8G,MAAU;AAChD;AAOO,SAASC,EAAMxH;AACd,SAAAA,KAAAA;AACR;AASgB,SAAA2F,EAAcN,GAAwB3C,GAAiBC,GAAAA;AAEtE,MAAI6E,EAAM9E,CAAW8E,KAAAA,EAAM7E,CAAkB,EAAA,QAAA;AAC7C,MAAI6E,EAAM9E,CAAAA,KAAW8E,EAAM7E,CAAAA,EAEtB,QAAA0C,MAAO,OAAa3C,MAAWC,IAC/B0C,MAAO,QAAa3C,MAAWC;AAKpC,UAAQ0C;IACP,KAAK;AACJ,aAAO3C,MAAWC;AAAAA,IACnB,KAAK;AACJ,aAAOD,MAAWC;AAAAA,IACnB,KAAK;AACJ,aAAIkE,EAASnE,CAAWmE,KAAAA,EAASlE,CACzBD,IAAAA,IAASC,IAEboE,EAAOrE,CAAWqE,KAAAA,EAAOpE,CACrBD,IAAAA,EAAOsE,QAAYrE,IAAAA,EAASqE,QAEhCJ,IAAAA,EAAAA,CAAAA,EAASlE,CAAWkE,KAAAA,CAAAA,EAASjE,CACzBD,MAAAA,EAAO+E,cAAc9E,CAAAA,IAAY;AAAA,IAG1C,KAAK;AACJ,aAAIkE,EAASnE,CAAAA,KAAWmE,EAASlE,CAAAA,IACzBD,IAASC,IAEboE,EAAOrE,CAAAA,KAAWqE,EAAOpE,CAAAA,IACrBD,EAAOsE,QAAAA,IAAYrE,EAASqE,QAAAA,IAAAA,EAAAA,CAEhCJ,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAO+E,cAAc9E,CAAY,IAAA;AAAA,IAG1C,KAAK;AACJ,aAAIkE,EAASnE,CAAAA,KAAWmE,EAASlE,CAAAA,IACzBD,KAAUC,IAEdoE,EAAOrE,CAAAA,KAAWqE,EAAOpE,CAAAA,IACrBD,EAAOsE,QAAAA,KAAarE,EAASqE,QAAAA,IAAAA,EAAAA,CAEjCJ,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAO+E,cAAc9E,CAAa,KAAA;AAAA,IAG3C,KAAK;AACJ,aAAIkE,EAASnE,CAAWmE,KAAAA,EAASlE,CACzBD,IAAAA,KAAUC,IAEdoE,EAAOrE,CAAAA,KAAWqE,EAAOpE,CAAAA,IACrBD,EAAOsE,QAAAA,KAAarE,EAASqE,QAAAA,IAAAA,EAAAA,CAEjCJ,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAO+E,cAAc9E,CAAa,KAAA;AAAA,IAG3C,KAAK;AACA,aAAAiE,EAASlE,CACLA,IAAAA,EAAOF,YAAclB,EAAAA,SAAS0D,EAAWrC,CAAAA,EAAUH,YAEvDtC,CAAAA,IAAAA,EAAQwC,CACJA,IAAAA,EAAOpB,SAASqB,CAEpB0E,IAAAA,EAAM3E,CACFA,IAAAA,EAAOgF,IAAI/E,CAAAA,IAAAA,CAAAA,CAEfyE,EAAM1E,CAAAA,KACFzC,MAAM+F,KAAKtD,EAAOuD,OAAAA,CAAAA,EAAU3E,SAASqB,CAAAA;AAAAA,IAI9C,KAAK;AACA,aAAAiE,EAASlE,CACJA,IAAAA,CAAAA,EAAOF,YAAclB,EAAAA,SAAS0D,EAAWrC,CAAAA,EAAUH,YAExDtC,CAAAA,IAAAA,EAAQwC,CACHA,IAAAA,CAAAA,EAAOpB,SAASqB,CAAAA,IAErB0E,EAAM3E,CAAAA,IAAAA,CACDA,EAAOgF,IAAI/E,CAEhByE,IAAAA,CAAAA,EAAM1E,CACDzC,KAAAA,CAAAA,MAAM+F,KAAKtD,EAAOuD,OAAU3E,CAAAA,EAAAA,SAASqB,CAI/C;AAAA,IAAA,KAAK;AACJ,aAAA,EAAA,CAAIiE,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAOF,YAAAA,EAAcmF,WAAWhF,EAASH,YAIlD,CAAA;AAAA,IAAA,KAAK;AACJ,aAAA,EAAA,CAAIoE,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAOF,YAAcoF,EAAAA,SAASjF,EAASH,YAAAA,CAAAA;AAAAA,IAIhD,KAAK;AACA,aAAAtC,EAAQyC,CACJA,IAAAA,EAASrB,SAASoB,CAAAA,IAEtB2E,EAAM1E,CAAAA,IACFA,EAAS+E,IAAIhF,CAEjB0E,IAAAA,CAAAA,CAAAA,EAAMzE,CACFA,MAAAA,EAAS+E,IAAIhF,CAAAA,KAAkBzC,MAAM+F,KAAKrD,EAASsD,OAAAA,CAAAA,EAAU3E,SAASoB,CAAAA;AAAAA,IAI/E,KAAK;AACA,aAAAxC,EAAQyC,CAAAA,IAAAA,CACHA,EAASrB,SAASoB,CAEvB2E,IAAAA,EAAM1E,CACDA,IAAAA,CAAAA,EAAS+E,IAAIhF,CAAAA,IAAAA,CAElB0E,EAAMzE,CAAAA,KAAAA,CACDA,EAAS+E,IAAIhF,CAAmBzC,KAAAA,CAAAA,MAAM+F,KAAKrD,EAASsD,OAAU3E,CAAAA,EAAAA,SAASoB,CAIjF;AAAA,IAAA;AAEQ,aAAA;AAAA,EAAA;AAGV;AAGO,MAAMmF,KAAYhC,GAGZiC,KAAcrB;ACjlB3B,SAASsB,EAAUnF,GAAYE,GAC1B;AAAA,MAAAF,MAAME,EAAU,QAAA;AAEhB,MAAAF,aAAazC,OAAO2C,aAAa3C,KAAK;AACzC,QAAIyC,EAAEpB,SAASsB,EAAEtB,KAAa,QAAA;AAC9B,eAAYzB,CAAAA,GAAKC,CAAU4C,KAAAA,EAC1B,KAAKE,CAAAA,EAAE4E,IAAI3H,CAAAA,KAAAA,CAASgI,EAAU/H,GAAO8C,EAAEkF,IAAIjI,CAAc,CAAA,EAAA,QAAA;AAEnD,WAAA;AAAA,EAAA;AAGJ,MAAA6C,aAAaxC,OAAO0C,aAAa1C,KAAK;AACzC,QAAIwC,EAAEpB,SAASsB,EAAEtB,KAAa,QAAA;AAC9B,eAAWK,KAAQe,EAClB,KAAA,CAAKE,EAAE4E,IAAI7F,CAAc,EAAA,QAAA;AAEnB,WAAA;AAAA,EAAA;AAGJ,MAAOe,OAAAA,KAAM,YAAYA,MAAM,QAAeE,OAAAA,KAAM,YAAYA,MAAM,MAAM;AACzE,UAAAmF,IAAQ1H,OAAOO,KAAK8B,CAAAA,GACpBsF,IAAQ3H,OAAOO,KAAKgC,CAAAA;AAE1B,QAAImF,EAAMlH,WAAWmH,EAAMnH,OAAe,QAAA;AAE1C,eAAWhB,KAAOkI,EAEb,KAAA,CAACF,EAAUnF,EAAE7C,CAAM+C,GAAAA,EAAE/C,CAAc,CAAA,EAAA,QAAA;AAGjC,WAAA;AAAA,EAAA;AAGD,SAAA;AACR;AASgB,SAAAoI,EAAqBzH,GAAkB0H,GAC/C;AAAA,SAAA1H,EAAM2H,EAAEC,KAAK1D,EAAIwD,CAAaG,GAAAA,EAAwBR,CAAYS,GAAAA,EAAY,CACtF,CAAA;AAAA;AASgB,SAAAC,EACf/H,GACA0H,GAEO;AAAA,SAAA1H,EAAM2H,EAAEC,KAAK1D,EAAIwD,CAAaG,GAAAA,EAAwBR,CAAYS,GAAAA,EAAY,CACtF,CAAA;AAAA;AAQO,SAASE,GAAuBhI,GAC/B;AAAA,SAAA+H,EAAyB/H,GAAqBiI,CAAAA,MAAA1I,MAAM+F,KAAK2C,EAAW1C,OAC5E,CAAA,CAAA;AAAA;AASgB,SAAA2C,GAAsBlI,GAA4BmI,GAAAA;AACjE,SAAOJ,EAAyB/H,GAAOiI,OAAcA,EAAWX,IAAIa,CACrE,CAAA;AAAA;AAEgB,SAAAC,GACfC,GACAC,GACAC,GAGA;AAAA,QAAMC,IAAcH,EAAOnE,IAAI,CAAClE,GAAOiG,MAAAA;AAChC,UAAAyB,IAAaY,EAAYrC,CAAAA;AAG3B,WAAA,SAASjG,KAA8B,OAAdA,EAAMM,OAAQ,cAAcN,EAAMV,iBAAiBG,MACxEsI,EAAyB/H,GAAgC0H,CAEzDD,IAAAA,EAAezH,GAAsB0H,CAAAA;AAAAA,EAAU,CAKlDe,GAAAA,IAAaC,EAAcF,CAAAA,EAAaZ,KAC7C1D,EAAIqB,CAAAA,MAAUgD,EAAAA,GAAchD,CAC5BsC,CAAAA,GAAAA,EAAqBR,CACrBS,GAAAA,EAAY,CAIPa,CAAAA,GAAAA,IAAgBN,EAAOnE,IAAI,CAAClE,GAAOiG,MAAUqC,EAAYrC,CAAOjG,EAAAA,EAAMV,KAEtEsJ,CAAAA,GAAAA,IAAeL,KAAcI,CAG7BE,GAAAA,IAAkB,IAAIC,EAAmBF,CAMxC;AAAA,SAHPH,EAAWM,UAAUzJ,CAAAA,MAASuJ,EAAgBG,KAAK1J,CAAAA,CAAAA,GAG5C,EACNqI,GAAGkB,GACH,IAAA,QACC;AAAA,WAAOA,EAAgBI,SAAAA;AAAAA,EACxB,GACAC,OAAAA,GAEF;AAAA;AAIO,SAASC,GAAsBnJ,GAC9B;AAAA,SAAA+H,EAAyB/H,GAAqBiI,CAAAA,MAAA1I,MAAM+F,KAAK2C,EAAW7H,KAAAA,CAAAA,CAAAA;AAC5E;AAKO,SAASgJ,GAAyBpJ,GAAAA;AACjC,SAAA+H,EAAyB/H,GAAqBiI,CAAAA,MAAA1I,MAAM+F,KAAK2C,EAAWxC,QAAAA,CAAAA,CAAAA;AAC5E;AAKgB,SAAA4D,GAAsBrJ,GAA4BsJ,GAC1D;AAAA,SAAAvB,EAAyB/H,GAAqBiI,OAC7C1I,MAAM+F,KAAK2C,EAAW1C,OAAUM,CAAAA,EAAAA,KAAKyD,CAE9C,CAAA;AAAA;AAKgB,SAAAC,GACfvJ,GACAwJ,GAAAA;AAEO,SAAAzB,EAAyB/H,GAAqBiI,OAAAA;AACpD,eAAA,CAAY5I,GAAK8B,CAAAA,KAAS8G,EAAWxC,QAAAA,EAChC,KAAA+D,EAAUrI,GAAM9B,CAAAA,EACZ,QAAA8B;AAAAA,EAGF,CAET;AAAA;AASgB,SAAAsI,GACfzJ,GACA0J,GAAAA;AAEO,SAAA3B,EAAyB/H,GAAOiI,OACtC1I,MAAM+F,KAAK2C,EAAWxC,QACpBkE,CAAAA,EAAAA,OAAO,CAAEtK,CAAAA,GAAK8B,CAAUuI,MAAAA,EAASvI,GAAM9B,CAAAA,CAAAA,EACvC6E,IAAI,CAAA,CAAEC,GAAGhD,CAAAA,MAAUA,CAEvB,CAAA;AAAA;AAKgB,SAAAyI,GACf5J,GACA6J,GAAAA;AAEO,SAAA9B,EAAyB/H,UAC/BT,MAAM+F,KAAK2C,EAAWxC,QAAAA,CAAAA,EAAWvB,IAAI,CAAA,CAAE7E,GAAK8B,CAAAA,MAAU0I,EAAM1I,GAAM9B,CAEpE,CAAA,CAAA;AAAA;AASgB,SAAAyK,GACf9J,GACA0J,GAAAA;AAEO,SAAA3B,EAAyB/H,GAAqBiI,OAC/CyB,IAEEnK,MAAM+F,KAAK2C,EAAWxC,QAAWkE,CAAAA,EAAAA,OAAO,CAAEtK,CAAAA,GAAK8B,CAAUuI,MAAAA,EAASvI,GAAM9B,CAAAA,CAAAA,EAAMgB,SAF/D4H,EAAWnH,IAInC;AAAA;AAUgB,SAAAiJ,GAA8B/J,GAAkB0H,GAC/D;AAAA,SAAO1H,EAAM2H,EAAEC,KACd1D,EAAIwD,CACJG,GAAAA,EAAwBR,CACxB2C,GAAAA,EAAM,EACLC,qBAAAA,IACAC,cAAAA,IACAC,iBAAAA,GAGH,CAAA,CAAA;AAAA;ACrOA,MAAMC,IAAkB5D,OAAO,iBAAA,GACzB6D,IAAgB7D,OAAO,uBACvB8D,GAAAA,IAAc9D,OAAO,qBAAA;AA2GX,SAAA+D,GACfvK,GACA0H,IAAiC8C,CAAAA,MAAaA,GAC9CC,IAAyB,IAElB;AAAA,SAAA,SAAU5D,GAA4B6D,GAAkBC,GAAAA;AAElDC,IAAAA,EAAA,EAAEC,WAAW,IAAOC,MAAMjL,OAAAA,CAAAA,EAAUgH,GAAO6D,CAGvD;AAAA,UAAMK,IAA4BlE,EAAMmE,mBAClCC,IAA+BpE,EAAMqE;AAG3CrE,IAAAA,EAAMmE,oBAAoB,WA1D5B;;AAAA,UAAgCG;WA4DNC,MA3DVhB,CAAAA,KAAAA,CAAoBe,EAAUf,CAAAA,EAAiBiB,WACnDF,EAAAf,CAAmB,IAAA,IAAIkB,MAG7BH,EAAUd,CACJc,MAAAA,EAAAd,CAAiB,IAAA,oBAAI5K,QAG3B0L,EAAUb,CACJa,MAAAA,EAAAb,CAAe,IAAA,oBAAI5K;AAqDtB,YAAA6L,IAtET,SAA8BvL,GAC7B;AAAA,eAAO,SAASA,KAAgBA,OAAAA,EAAMM,OAAQ,cAAcN,EAAMV,iBAAiBG;AAAAA,MACpF,EAoEqDO,CAAAA,IAC/C+H,EAAyB/H,GAAO0H,CAChCD,IAAAA,EAAezH,GAAoB0H,CAAAA;AAGjC+C,MAAAA,EAAQe,YAAaJ,KAAKd,CAAAA,EAActD,IAAI0D,CAAAA,MAChDK,KAAAA,QAAAA,EAA2BU,KAAKL,OAC3BA,KAAAd,CAAcoB,EAAAA,IAAIhB,CAIpBU,IAAAA,KAAKf,CAAgBrD,EAAAA,IAAI0D,CAC5BU,OAAAA,IAAAA,KAAKf,GAAgB/C,IAAIoD,CAAAA,MAAzBU,QAAAA,EAAoCO,eAC/BP,KAAAf,CAAgBuB,EAAAA,OAAOlB,CAIzBD,IAAAA,EAAQoB;AAKN,YAAAC,IAAeP,EAAS3D,KAAKmE,EAAUX,KAAKhB,CAAAA,CAAAA,CAAAA,EAAoBrB,UAAU,EAC/EC,MAAO1J,CAAAA,MAAAA;;AAEN,cAAM0M,IAAWvB,EAAQwB,YAAYC,gBAAgB5M,CAAAA,IAASA;AAE1DmL,QAAAA,EAAQoB,OAIPpB,EAAQ0B,eACZf,KAAKV,CAAYsB,IAAAA,KAGlBZ,IAAAA,KAAKgB,kBAALhB,QAAAA,EAAAA,YAGIX,EAAQe,YAAAA,CAAaJ,KAAKd,CAAAA,EAActD,IAAI0D,CAAAA,KAAasB,KAAzDvB,SACCA,EAAQoB,OAIZd,KAAAA,QAAAA,EAA2BU,KAAKL,OAC3BA,KAAAd,CAAcoB,EAAAA,IAAIhB,CAAQ;AAAA,MAAA,GAGjC3J,OAAQL,CAAAA,MAAAA;AAGH0K,aAAKiB,eAERC,WAAW,MAAA;;AACNlB,eAAKiB,gBACJ5B,EAAQoB,QAGZT,IAAAA,KAAKJ,sBAALI,QAAAA,EAAAA;AAAAA,QAAyB,GAExB,GAAI;AAAA,MAAA,EAAA,CAAA;AAMVA,WAAKf,CAAAA,EAAgB/J,IAAIoK,GAAUoB,CACpC;AAAA,IAAA,GAGAjF,EAAMqE,uBAAuB,WAnH/B;AAAA,UAAkCC;AAqH/BF,MAAAA,KAAAA,QAAAA,EAA8BQ,KAAKL,OAG/BX,EAAQoB,QAxHmBV,IA6HNC,MA5HbhB,CACHe,MAAAA,EAAAf,CAAiBpB,EAAAA,KAAAA,GACjBmC,EAAAf,CAAAA,EAAiBmC,SAC3BpB,GAAAA,EAAUf,CAAmB,IAAA,SAG1Be,EAAUd,CAAAA,MACbc,EAAUd,CAAAA,EAAerE,QAAezD,CAAAA,MAAAA,EAAIoJ,YAAAA,CAAAA,GAClCR,EAAAd,CAAAA,EAAemC,MACzBrB,GAAAA,EAAUd,CAAiB,IAAA,SAGxBc,EAAUb,CAAAA,MACHa,EAAAb,CAAAA,EAAakC,MACvBrB,GAAAA,EAAUb,CAAe,IAAA;AAAA,IA+GzB;AAAA,EACD;AACD;AAUO,SAASmC,GACfzM,GACA0M,GACAjC,IAAyB,CAAA,GAElB;AAAA,SAAA,SAAU5D,GAA4B6D,GAAkBC,GAAAA;AAC9DJ,IAAAA,GACCvK,GACA,SAAUwK,GAAAA;AAEH,YAAArC,IAAUuE,EAAUtB,IAAAA;AAC1B,aAAOjD,IAAUqC,EAAMlD,IAAIa,CAAW,IAAA;AAAA,IACvC,GACAsC,CAAAA,EACC5D,GAAO6D,CACV;AAAA,EAAA;AACD;"}

package/dist/store.cjs CHANGED Viewed

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./context-object-CP7HbDFQ.cjs"),e=require("./selector-hook-Bvne--oy.cjs");exports.BaseStore=r.BaseStore,exports.IndexedDBStorageManager=r.IndexedDBStorageManager,exports.LocalStorageManager=r.LocalStorageManager,exports.MemoryStorageManager=r.MemoryStorageManager,exports.SchmancyArrayStore=r.SchmancyArrayStore,exports.SchmancyStoreObject=r.SchmancyStoreObject,exports.SessionStorageManager=r.SessionStorageManager,exports.StoreError=r.StoreError,exports.createStorageManager=r.createStorageManager,exports.compareValues=e.compareValues,exports.createArrayContext=e.createArrayContext,exports.createCollectionSelector=e.createCollectionSelector,exports.createCompoundSelector=e.createCompoundSelector,exports.createContext=e.createContext,exports.createCountSelector=e.createCountSelector,exports.createEntriesSelector=e.createEntriesSelector,exports.createFilterSelector=e.createFilterSelector,exports.createFindSelector=e.createFindSelector,exports.createItemSelector=e.createItemSelector,exports.createItemsSelector=e.createItemsSelector,exports.createKeysSelector=e.createKeysSelector,exports.createMapSelector=e.createMapSelector,exports.createOptimizedSelector=e.createOptimizedSelector,exports.createSelector=e.createSelector,exports.createSortSelector=e.createSortSelector,exports.createTestArrayContext=e.createTestArrayContext,exports.filterArray=e.filterArray,exports.filterArrayItems=e.filterArrayItems,exports.filterMap=e.filterMap,exports.filterMapItems=e.filterMapItems,exports.getFieldValue=e.getFieldValue,exports.isArray=e.isArray,exports.isDate=e.isDate,exports.isIterable=e.isIterable,exports.isMap=e.isMap,exports.isNil=e.isNil,exports.isNumber=e.isNumber,exports.isPlainObject=e.isPlainObject,exports.isSet=e.isSet,exports.isString=e.isString,exports.select=e.select,exports.selectItem=e.selectItem;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./context-object-CP7HbDFQ.cjs"),e=require("./selector-hook-BjCCf3SV.cjs");exports.BaseStore=r.BaseStore,exports.IndexedDBStorageManager=r.IndexedDBStorageManager,exports.LocalStorageManager=r.LocalStorageManager,exports.MemoryStorageManager=r.MemoryStorageManager,exports.SchmancyArrayStore=r.SchmancyArrayStore,exports.SchmancyStoreObject=r.SchmancyStoreObject,exports.SessionStorageManager=r.SessionStorageManager,exports.StoreError=r.StoreError,exports.createStorageManager=r.createStorageManager,exports.compareValues=e.compareValues,exports.createArrayContext=e.createArrayContext,exports.createCollectionSelector=e.createCollectionSelector,exports.createCompoundSelector=e.createCompoundSelector,exports.createContext=e.createContext,exports.createCountSelector=e.createCountSelector,exports.createEntriesSelector=e.createEntriesSelector,exports.createFilterSelector=e.createFilterSelector,exports.createFindSelector=e.createFindSelector,exports.createItemSelector=e.createItemSelector,exports.createItemsSelector=e.createItemsSelector,exports.createKeysSelector=e.createKeysSelector,exports.createMapSelector=e.createMapSelector,exports.createOptimizedSelector=e.createOptimizedSelector,exports.createSelector=e.createSelector,exports.createSortSelector=e.createSortSelector,exports.createTestArrayContext=e.createTestArrayContext,exports.filterArray=e.filterArray,exports.filterArrayItems=e.filterArrayItems,exports.filterMap=e.filterMap,exports.filterMapItems=e.filterMapItems,exports.getFieldValue=e.getFieldValue,exports.isArray=e.isArray,exports.isDate=e.isDate,exports.isIterable=e.isIterable,exports.isMap=e.isMap,exports.isNil=e.isNil,exports.isNumber=e.isNumber,exports.isPlainObject=e.isPlainObject,exports.isSet=e.isSet,exports.isString=e.isString,exports.select=e.select,exports.selectItem=e.selectItem;
 //# sourceMappingURL=store.cjs.map

package/dist/store.js CHANGED Viewed

@@ -1,5 +1,5 @@
 import { B as r, I as t, L as s, M as c, S as o, a as l, b as S, d as i, c as n } from "./context-object-CISes2bD.js";
-import { p as g, a as y, v as M, y as p, c as d, F as I, A as f, D as x, C as A, x as C, w as b, z as u, E as B, G as F, u as h, B as j, b as D, r as E, d as O, q as z, f as L, g as N, i as V, j as k, k as q, l as v, o as w, h as G, n as K, m as P, e as T, s as H, t as J } from "./selector-hook-D_HTD-GV.js";
+import { p as g, a as y, v as M, y as p, c as d, F as I, A as f, D as x, C as A, x as C, w as b, z as u, E as B, G as F, u as h, B as j, b as D, r as E, d as O, q as z, f as L, g as N, i as V, j as k, k as q, l as v, o as w, h as G, n as K, m as P, e as T, s as H, t as J } from "./selector-hook-DHPU6Z2H.js";
 export {
   r as BaseStore,
   t as IndexedDBStorageManager,

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
 	"name": "@mhmo91/schmancy",
-	"version": "0.2.144",
+	"version": "0.2.145",
 	"description": "UI library build with web components",
 	"main": "./dist/index.js",
 	"packageManager": "yarn@4.6.0",

package/types/src/store/selectors.d.ts CHANGED Viewed

@@ -1,5 +1,5 @@
 import { Observable } from 'rxjs';
-import { IStore, ICollectionStore } from './types';
+import { ICollectionStore, IStore } from './types';
 /**
  * Creates a selector that derives a value from store state
  *
@@ -31,16 +31,7 @@ export declare function createItemsSelector<T>(store: ICollectionStore<T>): Obse
  * @returns An observable of the selected item that emits when the item changes
  */
 export declare function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined>;
-/**
- * Creates a compound selector that depends on multiple other selectors
- *
- * @param selectors Array of source selectors
- * @param combinerFn Function that combines all selector results
- * @returns An observable of the combined result
- */
-export declare function createCompoundSelector<T extends unknown[], R>(selectors: {
-    [K in keyof T]: Observable<T[K]>;
-}, combinerFn: (...values: T) => R): Observable<R>;
+export declare function createCompoundSelector<R>(stores: Array<IStore<any> | ICollectionStore<any>>, selectorFns: Array<(state: any) => any>, combinerFn: (...values: any[]) => R): Partial<IStore<R>>;
 /**
  * Creates a selector that returns all keys from a collection
  */

package/dist/selector-hook-Bvne--oy.cjs DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";const O=require("./context-object-CP7HbDFQ.cjs"),K=require("lit/decorators.js"),m=require("rxjs"),Z=require("rxjs/operators");function U(n,e,t){try{e==="indexeddb"&&(e="local"),((o=n)===null\|\|typeof o!="object"\|\|Array.isArray(o)\|\|o instanceof Map\|\|o instanceof Set\|\|o instanceof Date\|\|o instanceof RegExp\|\|Object.getPrototypeOf(o)!==Object.prototype)&&(n={...n});const a=O.SchmancyStoreObject.getInstance(e,t,n);return typeof(r=a.value)=="object"&&r!==null&&Object.keys(r).length===0&&a.set({...n}),a}catch{return O.SchmancyStoreObject.getInstance("memory",`${t}-fallback`,n)}var r,o}function q(n,e,t){try{const r=O.SchmancyArrayStore.getInstance(e,t,n);return r.value.length\|\|r.replace([...n]),r}catch{return O.SchmancyArrayStore.getInstance("memory",`${t}-fallback`,[...n])}}function $(n,e,t){try{return n==null&&(n=t.includes("collection")\|\|t.includes("map")?new Map:t.includes("array")\|\|t.includes("list")?[]:{}),n instanceof Map?function(r,o,a){try{const u=O.SchmancyCollectionStore.getInstance(o,a,r);return u.value.size\|\|u.replace(new Map(r)),u}catch{return O.SchmancyCollectionStore.getInstance("memory",`${a}-fallback`,new Map(r))}}(n,e,t):function(r){return Array.isArray(r)}(n)?q(n,e,t):U(typeof n=="object"?n:{value:n},e,t)}catch{return U(typeof n=="object"&&n!==null?{...n}:{value:n},"memory",`emergency-fallback-${t}`)}}const F=(n,e)=>{if(!e)return n;const t=e.split(".");let r=n;for(const o of t){if(r==null)return;r=r[o]}return r},E=n=>{if(!n\|\|n.length<2)return[];const e=[];for(let t=0;t<n.length-1;t++)e.push(n.substring(t,t+2).toLowerCase());return e},R=(n,e)=>{if(!n\|\|!e)return 0;const t=n.toLowerCase().trim(),r=e.toLowerCase().trim();if(t===r)return 1;const o=t.includes(r)?1:0,a=((l,h)=>{if(!l)return!0;if(!h)return!1;let s=0,i=0;for(;s<l.length&&i<h.length;)l[s].toLowerCase()===h[i].toLowerCase()&&s++,i++;return s===l.length})(r,t)?.8:0,u=((l,h)=>{if(!l)return!0;if(!h)return!1;const s=j=>j.toLowerCase().split("").reduce((I,v)=>(I[v]=(I[v]\|\|0)+1,I),{}),i=s(l),y=s(h);return Object.keys(i).every(j=>(y[j]\|\|0)>=i[j])})(r,t)?.7:0,f=((l,h)=>{if(!l\|\|!h\|\|l.length<2\|\|h.length<2)return 0;const s=E(l),i=E(h);if(s.length===0\|\|i.length===0)return 0;let y=0;const j=new Array(i.length).fill(!1);for(const I of s)for(let v=0;v<i.length;v++)if(!j[v]&&i[v]===I){y++,j[v]=!0;break}return 2*y/(s.length+i.length)})(t,r),c=Math.max(t.length,r.length),w=c?1-((l,h)=>{if(l===h)return 0;const s=Array(h.length+1).fill(null).map((i,y)=>[y]);for(let i=0;i<=l.length;i++)s[0][i]=i;for(let i=1;i<=h.length;i++)for(let y=1;y<=l.length;y++)h.charAt(i-1)===l.charAt(y-1)?s[i][y]=s[i-1][y-1]:s[i][y]=Math.min(s[i-1][y]+1,s[i][y-1]+1,s[i-1][y-1]+1);return s[h.length][l.length]})(t,r)/c:0;return Math.max(o,a,u,f,w)},W=n=>n==null?"":String(n);function B(n,e,t=.3){let r,o,a,u=!1;if(Array.isArray(e)?[r,o,a,u=!1]=e:(r=e.key,o=e.operator,a=e.value,u=e.strict\|\|!1),!u&&(a===""\|\|a==null\|\|k(a)&&a.length===0))return{valid:!0,score:1};const f=F(n,r);if(u){if(o==="any"){if(typeof f!="string"\|\|typeof a!="string")return{valid:!1,score:0};const c=R(f,a);return{valid:c>=t,score:c>=t?c:0}}{const c=z(o,f,a);return{valid:c,score:c?1:0}}}if(o==="any"){if(typeof f!="string"\|\|typeof a!="string")return{valid:!1,score:0};const c=R(f,a);return c<t?{valid:!1,score:0}:{valid:!0,score:c}}{const c=z(o,f,a);return{valid:c,score:c?1:0}}}function N(n,e=[],t=.3){if(!e.length)return Array.from(n.values());const r=[];for(const[o,a]of n.entries()){let u=0,f=0,c=!0;for(const w of e){const l=B(a,w,t);if(!l.valid){c=!1;break}u+=l.score,f++}c&&r.push({item:a,score:f>0?u/f:1})}return r.sort((o,a)=>a.score-o.score),r.map(o=>o.item)}function P(n,e=[],t=.3){const r=new Map;return n.forEach((o,a)=>r.set(String(a),o)),N(r,e,t)}function k(n){return Array.isArray(n)}function p(n){return typeof n=="string"}function C(n){return typeof n=="number"&&!isNaN(n)}function S(n){return n instanceof Date&&!isNaN(n.getTime())}function L(n){return n instanceof Map}function T(n){return n instanceof Set}function x(n){return n==null}function z(n,e,t){if(x(e)&&x(t))return!0;if(x(e)\|\|x(t))return n==="=="?e===t:n==="!="&&e!==t;switch(n){case"==":return e===t;case"!=":return e!==t;case">":return C(e)&&C(t)?e>t:S(e)&&S(t)?e.getTime()>t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)>0;case"<":return C(e)&&C(t)?e<t:S(e)&&S(t)?e.getTime()<t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)<0;case">=":return C(e)&&C(t)?e>=t:S(e)&&S(t)?e.getTime()>=t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)>=0;case"<=":return C(e)&&C(t)?e<=t:S(e)&&S(t)?e.getTime()<=t.getTime():!(!p(e)\|\|!p(t))&&e.localeCompare(t)<=0;case"includes":return p(e)?e.toLowerCase().includes(W(t).toLowerCase()):k(e)?e.includes(t):T(e)?e.has(t):!!L(e)&&Array.from(e.values()).includes(t);case"notIncludes":return p(e)?!e.toLowerCase().includes(W(t).toLowerCase()):k(e)?!e.includes(t):T(e)?!e.has(t):!L(e)\|\|!Array.from(e.values()).includes(t);case"startsWith":return!(!p(e)\|\|!p(t))&&e.toLowerCase().startsWith(t.toLowerCase());case"endsWith":return!(!p(e)\|\|!p(t))&&e.toLowerCase().endsWith(t.toLowerCase());case"in":return k(t)?t.includes(e):T(t)?t.has(e):!!L(t)&&(t.has(e)\|\|Array.from(t.values()).includes(e));case"notIn":return k(t)?!t.includes(e):T(t)?!t.has(e):!L(t)\|\|!t.has(e)&&!Array.from(t.values()).includes(e);default:return!1}}const G=N,H=P;function M(n,e){if(n===e)return!0;if(n instanceof Map&&e instanceof Map){if(n.size!==e.size)return!1;for(const[t,r]of n)if(!e.has(t)\|\|!M(r,e.get(t)))return!1;return!0}if(n instanceof Set&&e instanceof Set){if(n.size!==e.size)return!1;for(const t of n)if(!e.has(t))return!1;return!0}if(typeof n=="object"&&n!==null&&typeof e=="object"&&e!==null){const t=Object.keys(n),r=Object.keys(e);if(t.length!==r.length)return!1;for(const o of t)if(!M(n[o],e[o]))return!1;return!0}return!1}function V(n,e){return n.$.pipe(m.map(e),m.distinctUntilChanged(M),m.shareReplay(1))}function d(n,e){return n.$.pipe(m.map(e),m.distinctUntilChanged(M),m.shareReplay(1))}const A=Symbol("selectorCleanup"),g=Symbol("selectorSubscriptions"),b=Symbol("selectorInitialized");function D(n,e=r=>r,t={}){return function(r,o,a){K.property({attribute:!1,type:Object})(r,o);const u=r.connectedCallback,f=r.disconnectedCallback;r.connectedCallback=function(){var h;var c;(c=this)[A]&&!c[A].closed\|\|(c[A]=new m.Subject),c[g]\|\|(c[g]=new Map),c[b]\|\|(c[b]=new Set);const w=function(s){return"set"in s&&typeof s.set=="function"&&s.value instanceof Map}(n)?d(n,e):V(n,e);t.required\|\|this[b].has(o)\|\|(u==null\|\|u.call(this),this[b].add(o)),this[g].has(o)&&((h=this[g].get(o))==null\|\|h.unsubscribe(),this[g].delete(o)),t.debug;const l=w.pipe(Z.takeUntil(this[A])).subscribe({next:s=>{var y;const i=t.deepClone?structuredClone(s):s;t.debug,t.updateOnly\|\|(this[o]=i),(y=this.requestUpdate)==null\|\|y.call(this),t.required&&!this[b].has(o)&&i!=null&&(t.debug,u==null\|\|u.call(this),this[b].add(o))},error:s=>{this.isConnected&&setTimeout(()=>{var i;this.isConnected&&(t.debug,(i=this.connectedCallback)==null\|\|i.call(this))},1e3)}});this[g].set(o,l)},r.disconnectedCallback=function(){var c;f==null\|\|f.call(this),t.debug,(c=this)[A]&&(c[A].next(),c[A].complete(),c[A]=void 0),c[g]&&(c[g].forEach(w=>w.unsubscribe()),c[g].clear(),c[g]=void 0),c[b]&&(c[b].clear(),c[b]=void 0)}}}exports.compareValues=z,exports.createArrayContext=function(n=[],e,t="local"){try{return $(n,t,e)}catch{return q(n,"memory",`${e}-fallback`)}},exports.createCollectionSelector=d,exports.createCompoundSelector=function(n,e){return m.combineLatest(n).pipe(m.map(t=>e(...t)),m.distinctUntilChanged(M),m.shareReplay(1))},exports.createContext=$,exports.createCountSelector=function(n,e){return d(n,t=>e?Array.from(t.entries()).filter(([r,o])=>e(o,r)).length:t.size)},exports.createEntriesSelector=function(n){return d(n,e=>Array.from(e.entries()))},exports.createFilterSelector=function(n,e){return d(n,t=>Array.from(t.entries()).filter(([r,o])=>e(o,r)).map(([r,o])=>o))},exports.createFindSelector=function(n,e){return d(n,t=>{for(const[r,o]of t.entries())if(e(o,r))return o})},exports.createItemSelector=function(n,e){return d(n,t=>t.get(e))},exports.createItemsSelector=function(n){return d(n,e=>Array.from(e.values()))},exports.createKeysSelector=function(n){return d(n,e=>Array.from(e.keys()))},exports.createMapSelector=function(n,e){return d(n,t=>Array.from(t.entries()).map(([r,o])=>e(o,r)))},exports.createOptimizedSelector=function(n,e){return n.$.pipe(m.map(e),m.distinctUntilChanged(M),m.share({resetOnRefCountZero:!0,resetOnError:!1,resetOnComplete:!1}))},exports.createSelector=V,exports.createSortSelector=function(n,e){return d(n,t=>Array.from(t.values()).sort(e))},exports.createTestArrayContext=function(n=[],e="test-array"){try{return $(n,"memory",e)}catch{return q(n,"memory",`${e}-emergency-fallback`)}},exports.filterArray=H,exports.filterArrayItems=P,exports.filterMap=G,exports.filterMapItems=N,exports.getFieldValue=F,exports.isArray=k,exports.isDate=S,exports.isIterable=function(n){return n!=null&&typeof n=="object"&&Symbol.iterator in Object(n)&&typeof n[Symbol.iterator]=="function"},exports.isMap=L,exports.isNil=x,exports.isNumber=C,exports.isPlainObject=function(n){if(n===null\|\|typeof n!="object")return!1;const e=Object.getPrototypeOf(n);return e===Object.prototype\|\|e===null},exports.isSet=T,exports.isString=p,exports.select=D,exports.selectItem=function(n,e,t={}){return function(r,o,a){D(n,function(u){const f=e(this);return f?u.get(f):void 0},t)(r,o)}};
2	- //# sourceMappingURL=selector-hook-Bvne--oy.cjs.map

package/dist/selector-hook-Bvne--oy.cjs.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"selector-hook-Bvne--oy.cjs","sources":["../src/store/context-create.ts","../src/store/filter-directive.ts","../src/store/selectors.ts","../src/store/selector-hook.ts"],"sourcesContent":["// src/store/context-create.ts - Fixed version\n\nimport { SchmancyArrayStore } from './context-array'\nimport SchmancyCollectionStore from './context-collection'\nimport { SchmancyStoreObject } from './context-object'\nimport { IArrayStore, ICollectionStore, IStore, StorageType } from './types'\n\n/**\n * Type guard to check if an object is empty\n */\nfunction isEmptyObject(obj: unknown): boolean {\n\tif (typeof obj !== 'object' || obj === null) {\n\t\treturn false\n\t}\n\treturn Object.keys(obj).length === 0\n}\n\n/**\n * Type guard for Map objects\n */\nfunction isMap<K, V>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for Array objects\n */\nfunction isArray<T>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for plain objects (not arrays, maps, null, etc.)\n */\nfunction isPlainObject(value: unknown): boolean {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!Array.isArray(value) &&\n\t\t!(value instanceof Map) &&\n\t\t!(value instanceof Set) &&\n\t\t!(value instanceof Date) &&\n\t\t!(value instanceof RegExp) &&\n\t\tObject.getPrototypeOf(value) === Object.prototype\n\t)\n}\n\n/**\n * Creates a regular object store with better typing and error handling\n */\nfunction createObjectStore<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T> {\n\ttry {\n\t\t// Validate storage type\n\t\tif (storage === 'indexeddb') {\n\t\t\tconsole.warn(`IndexedDB storage is not optimal for plain objects. Using 'local' instead for key: ${key}`)\n\t\t\tstorage = 'local'\n\t\t}\n\n\t\t// Ensure initialData is a plain object\n\t\tif (!isPlainObject(initialData)) {\n\t\t\tconsole.warn(`Initial data is not a plain object. Converting to object for key: ${key}`)\n\t\t\tinitialData = { ...initialData } as T\n\t\t}\n\n\t\t// Create the store instance\n\t\tconst store = SchmancyStoreObject.getInstance<T>(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (isEmptyObject(store.value)) {\n\t\t\tstore.set({ ...initialData }) // Use spread to create a copy\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create object store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyStoreObject.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tinitialData,\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates a collection store with better typing and error handling\n */\nfunction createCollectionStore<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyCollectionStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.size) {\n\t\t\t// Create a new Map instance to avoid modifying the input\n\t\t\tstore.replace(new Map(initialData))\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create collection store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyCollectionStore.getInstance<V>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tnew Map(initialData),\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates an array store with better typing and error handling\n */\nfunction createArrayStore<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyArrayStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.length) {\n\t\t\t// Create a new array instance to avoid modifying the input\n\t\t\tstore.replace([...initialData])\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyArrayStore.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\t[...initialData],\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n// Function overloads for better type inference\n/**\n * Creates a context for managing object state\n * @param initialData The initial object data\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A store instance for the object\n */\nexport function createContext<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T>\n\n/**\n * Creates a context for managing collection state\n * @param initialData The initial Map collection\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A collection store instance\n */\nexport function createContext<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V>\n\n/**\n * Creates a context for managing array state\n * @param initialData The initial array\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns An array store instance\n */\nexport function createContext<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T>\n\n/**\n * Implementation of the createContext function with complete type checking\n * and robust error handling\n */\nexport function createContext<T extends Record<string, any> | Map<string, any> | any[]>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n):\n\t| (IStore<T> & SchmancyStoreObject<T>)\n\t| (ICollectionStore<any> & SchmancyCollectionStore<any>)\n\t| (IArrayStore<any> & SchmancyArrayStore<any>) {\n\ttry {\n\t\t// Validate input\n\t\tif (initialData === null || initialData === undefined) {\n\t\t\tconsole.error('Initial data cannot be null or undefined')\n\t\t\t// Provide a sensible default based on type expected\n\t\t\tif (key.includes('collection') || key.includes('map')) {\n\t\t\t\tinitialData = new Map() as unknown as T\n\t\t\t} else if (key.includes('array') || key.includes('list')) {\n\t\t\t\tinitialData = [] as unknown as T\n\t\t\t} else {\n\t\t\t\tinitialData = {} as T\n\t\t\t}\n\t\t}\n\n\t\t// Determine store type based on input data with improved type checking\n\t\tif (isMap<string, any>(initialData)) {\n\t\t\treturn createCollectionStore<any>(initialData, storage, key)\n\t\t} else if (isArray<any>(initialData)) {\n\t\t\treturn createArrayStore<any>(initialData, storage, key)\n\t\t} else if (typeof initialData === 'object') {\n\t\t\treturn createObjectStore<any>(initialData as Record<string, any>, storage, key)\n\t\t} else {\n\t\t\t// Handle non-object data by wrapping it\n\t\t\tconsole.warn(`Initial data must be an object, array, or Map. Got ${typeof initialData}. Creating object wrapper.`)\n\t\t\treturn createObjectStore<any>({ value: initialData } as Record<string, any>, storage, key)\n\t\t}\n\t} catch (error) {\n\t\t// Last-resort error handling\n\t\tconsole.error(`Fatal error creating context for ${key}:`, error)\n\n\t\t// Create an emergency fallback store that won't throw\n\t\treturn createObjectStore<any>(\n\t\t\ttypeof initialData === 'object' && initialData !== null ? { ...initialData } : { value: initialData },\n\t\t\t'memory',\n\t\t\t`emergency-fallback-${key}`,\n\t\t)\n\t}\n}\n\n/**\n * Creates an array context with simplified API and type inference\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @param storage Storage type to use (defaults to 'local')\n * @returns An array store instance\n */\nexport function createArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string,\n\tstorage: StorageType = 'local',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, storage, key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array context for key: ${key}`, err)\n\t\t// Return a fallback store\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-fallback`)\n\t}\n}\n\n/**\n * Creates a testable array context\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @returns An array store that uses memory storage\n */\nexport function createTestArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string = 'test-array',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, 'memory', key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create test array context for key: ${key}`, err)\n\t\t// Return a fallback store with a different key\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-emergency-fallback`)\n\t}\n}\n","// src/store/filter-directive.ts\n\n/** Supported comparison operators with TypeScript literal types */\nexport type ComparisonOperator =\n\t| '=='\n\t| '!='\n\t| '>'\n\t| '<'\n\t| '>='\n\t| '<='\n\t| 'includes'\n\t| 'notIncludes'\n\t| 'startsWith'\n\t| 'endsWith'\n\t| 'in'\n\t| 'notIn'\n\t| 'any' // fuzzy search operator\n\n/**\n * Type-safe condition tuple\n */\nexport type ConditionTuple = [field: string, op: ComparisonOperator, expected: unknown, strict?: boolean]\n\n/**\n * Type-safe condition object\n */\nexport interface ConditionObject {\n\tkey: string\n\toperator: ComparisonOperator\n\tvalue: unknown\n\tstrict?: boolean\n}\n\n/**\n * Unified query condition type\n */\nexport type QueryCondition = ConditionTuple | ConditionObject\n\n/**\n * Filter result with item and score\n */\nexport interface ScoredItem<T> {\n\titem: T\n\tscore: number\n}\n\n/**\n * Get a nested value from an object using a dot-separated path.\n * Checks explicitly for null/undefined so falsy values like 0 or false are preserved.\n */\nexport const getFieldValue = <T = any>(item: Record<string, any>, path: string): T => {\n\tif (!path) return item as unknown as T\n\n\tconst parts = path.split('.')\n\tlet value: any = item\n\n\tfor (const part of parts) {\n\t\tif (value == null) return undefined as unknown as T\n\t\tvalue = value[part]\n\t}\n\n\treturn value as T\n}\n\n/**\n * Compute the Levenshtein distance between two strings.\n */\nconst levenshtein = (a: string, b: string): number => {\n\tif (a === b) return 0\n\n\tconst matrix: number[][] = Array(b.length + 1)\n\t\t.fill(null)\n\t\t.map((_, i) => [i])\n\n\t// initialize the first row\n\tfor (let j = 0; j <= a.length; j++) {\n\t\tmatrix[0][j] = j\n\t}\n\n\tfor (let i = 1; i <= b.length; i++) {\n\t\tfor (let j = 1; j <= a.length; j++) {\n\t\t\tif (b.charAt(i - 1) === a.charAt(j - 1)) {\n\t\t\t\tmatrix[i][j] = matrix[i - 1][j - 1]\n\t\t\t} else {\n\t\t\t\tmatrix[i][j] = Math.min(\n\t\t\t\t\tmatrix[i - 1][j] + 1, // deletion\n\t\t\t\t\tmatrix[i][j - 1] + 1, // insertion\n\t\t\t\t\tmatrix[i - 1][j - 1] + 1, // substitution\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n\treturn matrix[b.length][a.length]\n}\n\n/**\n * Check if string `sub` is a subsequence of string `str`.\n * All characters in `sub` must appear in order in `str` (they need not be contiguous).\n */\nconst isSubsequence = (sub: string, str: string): boolean => {\n\tif (!sub) return true\n\tif (!str) return false\n\n\tlet i = 0,\n\t\tj = 0\n\twhile (i < sub.length && j < str.length) {\n\t\tif (sub[i].toLowerCase() === str[j].toLowerCase()) i++\n\t\tj++\n\t}\n\treturn i === sub.length\n}\n\n/**\n * Check if every character (with frequency) in the query exists in the target.\n * For example, \"aovc\" matches \"avocados\".\n */\nconst anagramMatch = (query: string, target: string): boolean => {\n\tif (!query) return true\n\tif (!target) return false\n\n\tconst countChars = (s: string): Record<string, number> =>\n\t\ts\n\t\t\t.toLowerCase()\n\t\t\t.split('')\n\t\t\t.reduce(\n\t\t\t\t(acc, char) => {\n\t\t\t\t\tacc[char] = (acc[char] || 0) + 1\n\t\t\t\t\treturn acc\n\t\t\t\t},\n\t\t\t\t{} as Record<string, number>,\n\t\t\t)\n\n\tconst queryCount = countChars(query)\n\tconst targetCount = countChars(target)\n\treturn Object.keys(queryCount).every(char => (targetCount[char] || 0) >= queryCount[char])\n}\n\n/**\n * Generate bigrams for a string.\n */\nconst getBigrams = (s: string): string[] => {\n\tif (!s || s.length < 2) return []\n\n\tconst bigrams: string[] = []\n\tfor (let i = 0; i < s.length - 1; i++) {\n\t\tbigrams.push(s.substring(i, i + 2).toLowerCase())\n\t}\n\treturn bigrams\n}\n\n/**\n * Compute Dice's coefficient for two strings based on bigrams.\n * Returns a value between 0 (no similarity) and 1 (perfect match).\n */\nconst diceCoefficient = (s1: string, s2: string): number => {\n\tif (!s1 || !s2 || s1.length < 2 || s2.length < 2) return 0\n\n\tconst bigrams1 = getBigrams(s1)\n\tconst bigrams2 = getBigrams(s2)\n\n\tif (bigrams1.length === 0 || bigrams2.length === 0) return 0\n\n\tlet intersection = 0\n\tconst used = new Array(bigrams2.length).fill(false)\n\n\tfor (const bigram of bigrams1) {\n\t\tfor (let i = 0; i < bigrams2.length; i++) {\n\t\t\tif (!used[i] && bigrams2[i] === bigram) {\n\t\t\t\tintersection++\n\t\t\t\tused[i] = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (2 * intersection) / (bigrams1.length + bigrams2.length)\n}\n\n/**\n * Compute a fuzzy similarity score between two strings.\n * The score is computed by taking the maximum of several methods:\n * - Direct substring match (score 1)\n * - Subsequence check (score 0.8)\n * - Anagram subset match (score 0.7)\n * - Dice coefficient\n * - Normalized Levenshtein similarity\n */\nconst computeFuzzyScore = (actual: string, expected: string): number => {\n\tif (!actual || !expected) return 0\n\n\tconst a = actual.toLowerCase().trim()\n\tconst b = expected.toLowerCase().trim()\n\n\tif (a === b) return 1\n\n\tconst substringScore = a.includes(b) ? 1 : 0\n\tconst subsequenceScore = isSubsequence(b, a) ? 0.8 : 0\n\tconst anagramScore = anagramMatch(b, a) ? 0.7 : 0\n\tconst diceScore = diceCoefficient(a, b)\n\n\tconst maxLen = Math.max(a.length, b.length)\n\tconst levenshteinScore = maxLen ? 1 - levenshtein(a, b) / maxLen : 0\n\n\treturn Math.max(substringScore, subsequenceScore, anagramScore, diceScore, levenshteinScore)\n}\n\n/**\n * Safely coerce value to string if possible, or return empty string\n */\nconst safeString = (value: unknown): string => {\n\tif (value == null) return ''\n\treturn String(value)\n}\n\n/**\n * Apply a query condition to an item and return score\n */\nfunction applyQueryCondition<T extends Record<string, any>>(\n\titem: T,\n\tquery: QueryCondition,\n\tfuzzyThreshold: number = 0.3,\n): { valid: boolean; score: number } {\n\tlet field: string,\n\t\top: ComparisonOperator,\n\t\texpected: unknown,\n\t\tstrict = false\n\n\tif (Array.isArray(query)) {\n\t\t;[field, op, expected, strict = false] = query\n\t} else {\n\t\tfield = query.key\n\t\top = query.operator\n\t\texpected = query.value\n\t\tstrict = query.strict || false\n\t}\n\n\t// Skip empty filters for non-strict queries\n\tif (!strict && (expected === '' || expected == null || (isArray(expected) && expected.length === 0))) {\n\t\treturn { valid: true, score: 1 }\n\t}\n\n\tconst actual = getFieldValue(item, field)\n\n\t// FIXED: Properly handle strict mode\n\tif (strict) {\n\t\t// For strict mode, use exact equality comparison for all operators except 'any'\n\t\tif (op === 'any') {\n\t\t\t// Fuzzy search still applies with strict mode\n\t\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\t\treturn { valid: false, score: 0 }\n\t\t\t}\n\n\t\t\tconst score = computeFuzzyScore(actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: score >= fuzzyThreshold,\n\t\t\t\tscore: score >= fuzzyThreshold ? score : 0,\n\t\t\t}\n\t\t} else {\n\t\t\t// For all other operators in strict mode,\n\t\t\t// delegate to compareValues function but return precise scores\n\t\t\tconst matches = compareValues(op, actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: matches,\n\t\t\t\tscore: matches ? 1 : 0,\n\t\t\t}\n\t\t}\n\t} else if (op === 'any') {\n\t\t// Fuzzy search requires both values to be strings\n\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\tconst score = computeFuzzyScore(actual, expected)\n\t\tif (score < fuzzyThreshold) {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\treturn { valid: true, score }\n\t} else {\n\t\t// For non-fuzzy operators, check condition\n\t\tconst matches = compareValues(op, actual, expected)\n\t\treturn {\n\t\t\tvalid: matches,\n\t\t\tscore: matches ? 1 : 0,\n\t\t}\n\t}\n}\n\n/**\n * Filter a Map of items given an array of query conditions.\n * For each query condition:\n * - If the expected value is empty/null/undefined, it is treated as a match.\n * - For non-fuzzy operators, the condition must strictly match.\n * - For the \"any\" operator, a fuzzy similarity score is computed.\n * Items with a fuzzy score below a given threshold (e.g., 0.3) are excluded.\n *\n * The overall item score is the average of the scores from all conditions.\n * The results are sorted in descending order of relevance.\n *\n * @param items - A Map containing items to filter.\n * @param queries - An array of query conditions to apply.\n * @param fuzzyThreshold - Minimum score required for fuzzy matches (default: 0.3)\n * @returns An array of items that match all query conditions, sorted by relevance.\n */\nexport function filterMapItems<T extends Record<string, any>>(\n\titems: Map<string, T>,\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// If no queries, return all items unsorted\n\tif (!queries.length) {\n\t\treturn Array.from(items.values())\n\t}\n\n\t// Score and filter each item\n\tconst scoredItems: ScoredItem<T>[] = []\n\n\tfor (const [_, item] of items.entries()) {\n\t\tlet totalScore = 0\n\t\tlet matchCount = 0\n\t\tlet valid = true\n\n\t\tfor (const query of queries) {\n\t\t\tconst result = applyQueryCondition(item, query, fuzzyThreshold)\n\n\t\t\tif (!result.valid) {\n\t\t\t\tvalid = false\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\ttotalScore += result.score\n\t\t\tmatchCount++\n\t\t}\n\n\t\tif (valid) {\n\t\t\tscoredItems.push({\n\t\t\t\titem,\n\t\t\t\tscore: matchCount > 0 ? totalScore / matchCount : 1,\n\t\t\t})\n\t\t}\n\t}\n\n\t// Sort by descending score\n\tscoredItems.sort((a, b) => b.score - a.score)\n\n\treturn scoredItems.map(x => x.item)\n}\n\n/**\n * Filter an array of items using query conditions\n */\nexport function filterArrayItems<T extends Record<string, any>>(\n\titems: T[],\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// Create temporary map with numeric indices as keys\n\tconst map = new Map<string, T>()\n\titems.forEach((item, index) => map.set(String(index), item))\n\n\treturn filterMapItems(map, queries, fuzzyThreshold)\n}\n\n// Improved type guards for filter-directive.ts\n\n/**\n * Type guard for checking if a value is an array with better type inference\n * @param value Value to check\n * @returns True if the value is an array\n */\nexport function isArray<T = unknown>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for checking if a value is a string\n * @param value Value to check\n * @returns True if the value is a string\n */\nexport function isString(value: unknown): value is string {\n\treturn typeof value === 'string'\n}\n\n/**\n * Type guard for checking if a value is a number\n * @param value Value to check\n * @returns True if the value is a number and not NaN\n */\nexport function isNumber(value: unknown): value is number {\n\treturn typeof value === 'number' && !isNaN(value)\n}\n\n/**\n * Type guard for checking if a value is a date\n * @param value Value to check\n * @returns True if the value is a valid Date object\n */\nexport function isDate(value: unknown): value is Date {\n\treturn value instanceof Date && !isNaN(value.getTime())\n}\n\n/**\n * Type guard for checking if a value is an iterable collection\n * @param value Value to check\n * @returns True if the value implements the iterable protocol\n */\nexport function isIterable<T = unknown>(value: unknown): value is Iterable<T> {\n\t// Must be non-null and of type 'object'\n\tif (value == null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\t// Check for Symbol.iterator method\n\treturn Symbol.iterator in Object(value) && typeof (value as any)[Symbol.iterator] === 'function'\n}\n\n/**\n * Type guard for checking if a value is a Map\n * @param value Value to check\n * @returns True if the value is a Map\n */\nexport function isMap<K = unknown, V = unknown>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for checking if a value is a Set\n * @param value Value to check\n * @returns True if the value is a Set\n */\nexport function isSet<T = unknown>(value: unknown): value is Set<T> {\n\treturn value instanceof Set\n}\n\n/**\n * Type guard for checking if a value is a plain object (not an array, Map, etc.)\n * @param value Value to check\n * @returns True if the value is a plain object\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n\tif (value === null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\tconst proto = Object.getPrototypeOf(value)\n\treturn proto === Object.prototype || proto === null\n}\n\n/**\n * Type guard for checking if a value is undefined or null\n * @param value Value to check\n * @returns True if the value is undefined or null\n */\nexport function isNil(value: unknown): value is undefined | null {\n\treturn value === undefined || value === null\n}\n\n/**\n * Improved type-safe comparison function that uses appropriate type guards\n * @param op Comparison operator\n * @param actual Actual value\n * @param expected Expected value\n * @returns Result of the comparison\n */\nexport function compareValues(op: ComparisonOperator, actual: unknown, expected: unknown): boolean {\n\t// Handle null/undefined cases\n\tif (isNil(actual) && isNil(expected)) return true\n\tif (isNil(actual) || isNil(expected)) {\n\t\t// For equality operators, null == null but null != non-null\n\t\tif (op === '==') return actual === expected\n\t\tif (op === '!=') return actual !== expected\n\t\t// Other operators should return false for null/undefined values\n\t\treturn false\n\t}\n\n\tswitch (op) {\n\t\tcase '==':\n\t\t\treturn actual === expected\n\t\tcase '!=':\n\t\t\treturn actual !== expected\n\t\tcase '>':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual > expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() > expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) > 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual < expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() < expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) < 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '>=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual >= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() >= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) >= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual <= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() <= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) <= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase 'includes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIncludes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn !actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn !actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn !actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn !Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tcase 'startsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().startsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'endsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().endsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'in': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn expected.has(actual as any) || Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIn': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn !expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn !expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn !expected.has(actual as any) && !Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tdefault: {\n\t\t\tconsole.warn(`Operator \"${op}\" is not supported in comparison.`)\n\t\t\treturn false\n\t\t}\n\t}\n}\n\n// Export a simpler alias for filterMapItems\nexport const filterMap = filterMapItems\n\n// Export an alias for filterArrayItems\nexport const filterArray = filterArrayItems\n","// src/store/selectors.ts\nimport { Observable, combineLatest, distinctUntilChanged, map, share, shareReplay } from 'rxjs'\nimport { IStore, ICollectionStore } from './types'\n\n/**\n * Deep equality comparison for maps and complex objects\n * More efficient than JSON.stringify for large objects\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true\n\n\tif (a instanceof Map && b instanceof Map) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const [key, value] of a) {\n\t\t\tif (!b.has(key) || !deepEqual(value, b.get(key))) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Set && b instanceof Set) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const item of a) {\n\t\t\tif (!b.has(item)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null) {\n\t\tconst keysA = Object.keys(a)\n\t\tconst keysB = Object.keys(b)\n\n\t\tif (keysA.length !== keysB.length) return false\n\n\t\tfor (const key of keysA) {\n\t\t\t// @ts-ignore: Index signature\n\t\t\tif (!deepEqual(a[key], b[key])) return false\n\t\t}\n\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n/**\n * Creates a selector that derives a value from store state\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector for collection stores that derives a value from the collection\n *\n * @param store The collection store to observe\n * @param selectorFn Function that transforms the collection\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createCollectionSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tselectorFn: (state: Map<string, T>) => R,\n): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector that returns all items from a collection as an array\n *\n * @param store The collection store\n * @returns An observable of all items as an array\n */\nexport function createItemsSelector<T>(store: ICollectionStore<T>): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.values()))\n}\n\n/**\n * Creates a selector that retrieves a single item from a collection\n *\n * @param store The collection store\n * @param itemKey The key of the item to select\n * @returns An observable of the selected item that emits when the item changes\n */\nexport function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => collection.get(itemKey))\n}\n\n/**\n * Creates a compound selector that depends on multiple other selectors\n *\n * @param selectors Array of source selectors\n * @param combinerFn Function that combines all selector results\n * @returns An observable of the combined result\n */\nexport function createCompoundSelector<T extends unknown[], R>(\n\tselectors: { [K in keyof T]: Observable<T[K]> },\n\tcombinerFn: (...values: T) => R,\n): Observable<R> {\n\treturn combineLatest(selectors).pipe(\n\t\tmap(values => combinerFn(...(values as T))),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshareReplay(1),\n\t)\n}\n\n/**\n * Creates a selector that returns all keys from a collection\n */\nexport function createKeysSelector<T>(store: ICollectionStore<T>): Observable<string[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.keys()))\n}\n\n/**\n * Creates a selector that returns entries (key-value pairs) from a collection\n */\nexport function createEntriesSelector<T>(store: ICollectionStore<T>): Observable<[string, T][]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.entries()))\n}\n\n/**\n * Creates a selector that sorts collection items\n */\nexport function createSortSelector<T>(store: ICollectionStore<T>, compareFn: (a: T, b: T) => number): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => {\n\t\treturn Array.from(collection.values()).sort(compareFn)\n\t})\n}\n\n/**\n * Creates a selector that finds the first item matching a predicate\n */\nexport function createFindSelector<T>(\n\tstore: ICollectionStore<T>,\n\tpredicate: (item: T, key: string) => boolean,\n): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => {\n\t\tfor (const [key, item] of collection.entries()) {\n\t\t\tif (predicate(item, key)) {\n\t\t\t\treturn item\n\t\t\t}\n\t\t}\n\t\treturn undefined\n\t})\n}\n\n/**\n * Creates a selector that filters items from a collection - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Function that returns true for items to include\n * @returns An observable of filtered items as an array\n */\nexport function createFilterSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn: (item: T, key: string) => boolean,\n): Observable<T[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries())\n\t\t\t.filter(([key, item]) => filterFn(item, key))\n\t\t\t.map(([_, item]) => item),\n\t)\n}\n\n/**\n * Creates a selector that maps collection values through a transform function - OPTIMIZED\n */\nexport function createMapSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tmapFn: (item: T, key: string) => R,\n): Observable<R[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries()).map(([key, item]) => mapFn(item, key)),\n\t)\n}\n\n/**\n * Creates a selector that counts items in a collection, optionally filtered - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Optional function to filter which items to count\n * @returns An observable of the count\n */\nexport function createCountSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn?: (item: T, key: string) => boolean,\n): Observable<number> {\n\treturn createCollectionSelector(store, collection => {\n\t\tif (!filterFn) return collection.size\n\n\t\treturn Array.from(collection.entries()).filter(([key, item]) => filterFn(item, key)).length\n\t})\n}\n\n/**\n * Optimized RxJS Pipeline - use share with reset on refCount zero for better memory management\n * in scenarios where selector subscriptions come and go\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state with improved memory management\n */\nexport function createOptimizedSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(\n\t\tmap(selectorFn),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshare({\n\t\t\tresetOnRefCountZero: true,\n\t\t\tresetOnError: false,\n\t\t\tresetOnComplete: false,\n\t\t}),\n\t)\n}\n","// src/store/selector-hook.ts - Improved memory management\nimport { property as litProperty } from 'lit/decorators.js'\nimport { Observable, Subject, Subscription } from 'rxjs'\nimport { takeUntil } from 'rxjs/operators'\nimport { createCollectionSelector, createSelector } from './selectors'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Symbol used for storing cleanup resources\n * Using a Symbol prevents name collisions with component properties\n */\nconst CLEANUP_SUBJECT = Symbol('selectorCleanup')\nconst SUBSCRIPTIONS = Symbol('selectorSubscriptions')\nconst INITIALIZED = Symbol('selectorInitialized')\n\n/**\n * Component lifecycle interface\n */\ninterface ComponentWithLifecycle {\n\t// Lifecycle hooks\n\tisConnected: boolean\n\tdisconnectedCallback?: () => void\n\tconnectedCallback?: () => void\n\trequestUpdate?: () => void\n\n\t// Internal properties using symbols to avoid name collisions\n\t[CLEANUP_SUBJECT]?: Subject<void>\n\t[SUBSCRIPTIONS]?: Map<string, Subscription>\n\t[INITIALIZED]?: Set<string>\n\n\t// Value storage\n\t[key: string]: any\n}\n\n/**\n * Property descriptor interface\n */\ntype PropertyDescriptor<T> = {\n\tget?: () => T\n\tset?: (value: T) => void\n\tvalue?: T\n\tconfigurable?: boolean\n\tenumerable?: boolean\n\twritable?: boolean\n}\n\n/**\n * Options for selecting from a store\n */\ninterface SelectOptions {\n\t/** If true, will wait for selector to emit a non-null value before calling connectedCallback */\n\trequired?: boolean\n\n\t/** If true, will only update the component and not set the property value */\n\tupdateOnly?: boolean\n\n\t/** If true, will use structuredClone to deeply clone values (prevents mutations) */\n\tdeepClone?: boolean\n\n\t/** Custom equality function to determine when to update */\n\tequals?: (a: any, b: any) => boolean\n\n\t/** Debug mode - logs selector activity */\n\tdebug?: boolean\n}\n\n/**\n * Type guard to check if a store is a collection store\n */\nfunction isCollectionStore<T>(store: IStore<any> | ICollectionStore<T>): store is ICollectionStore<T> {\n\treturn 'set' in store && typeof store.set === 'function' && store.value instanceof Map\n}\n\n/**\n * Ensures the cleanup resources exist on the component\n */\nfunction ensureCleanupResources(component: ComponentWithLifecycle): void {\n\tif (!component[CLEANUP_SUBJECT] || component[CLEANUP_SUBJECT].closed) {\n\t\tcomponent[CLEANUP_SUBJECT] = new Subject<void>()\n\t}\n\n\tif (!component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS] = new Map()\n\t}\n\n\tif (!component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED] = new Set()\n\t}\n}\n\n/**\n * Cleans up all selector resources\n */\nfunction cleanupSelectorResources(component: ComponentWithLifecycle): void {\n\tif (component[CLEANUP_SUBJECT]) {\n\t\tcomponent[CLEANUP_SUBJECT].next()\n\t\tcomponent[CLEANUP_SUBJECT].complete()\n\t\tcomponent[CLEANUP_SUBJECT] = undefined\n\t}\n\n\tif (component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS].forEach(sub => sub.unsubscribe())\n\t\tcomponent[SUBSCRIPTIONS].clear()\n\t\tcomponent[SUBSCRIPTIONS] = undefined\n\t}\n\n\tif (component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED].clear()\n\t\tcomponent[INITIALIZED] = undefined\n\t}\n}\n\n/**\n * Selector decorator that connects a component property to a store selector\n * with improved memory management\n *\n * @param store The store to select from\n * @param selectorFn Optional function to transform the store state\n * @param options Additional options for the selector\n */\nexport function select<T, R>(\n\tstore: IStore<T> | ICollectionStore<T>,\n\tselectorFn: (state: any) => R = (state: R) => state,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<R>) {\n\t\t// Register as a Lit property\n\t\tlitProperty({ attribute: false, type: Object })(proto, propName)\n\n\t\t// Store original lifecycle methods\n\t\tconst originalConnectedCallback = proto.connectedCallback\n\t\tconst originalDisconnectedCallback = proto.disconnectedCallback\n\n\t\t// Override connectedCallback to set up subscription\n\t\tproto.connectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Initialize cleanup resources\n\t\t\tensureCleanupResources(this)\n\n\t\t\t// Create the appropriate selector\n\t\t\tconst selector: Observable<R> = isCollectionStore(store)\n\t\t\t\t? createCollectionSelector(store, selectorFn)\n\t\t\t\t: createSelector(store as IStore<T>, selectorFn)\n\n\t\t\t// Call original connectedCallback immediately if not waiting for data\n\t\t\tif (!options.required && !this[INITIALIZED]!.has(propName)) {\n\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t}\n\n\t\t\t// Clean up any existing subscription\n\t\t\tif (this[SUBSCRIPTIONS]!.has(propName)) {\n\t\t\t\tthis[SUBSCRIPTIONS]!.get(propName)?.unsubscribe()\n\t\t\t\tthis[SUBSCRIPTIONS]!.delete(propName)\n\t\t\t}\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Setting up subscription for ${propName}`)\n\t\t\t}\n\n\t\t\t// Create new subscription with better error handling\n\t\t\tconst subscription = selector.pipe(takeUntil(this[CLEANUP_SUBJECT]!)).subscribe({\n\t\t\t\tnext: (value: R) => {\n\t\t\t\t\t// Handle value updates\n\t\t\t\t\tconst newValue = options.deepClone ? structuredClone(value) : value\n\n\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\tconsole.debug(`[select] New value for ${propName}:`, newValue)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!options.updateOnly) {\n\t\t\t\t\t\tthis[propName] = newValue\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.requestUpdate?.()\n\n\t\t\t\t\t// If required and not initialized, call connectedCallback when we get a value\n\t\t\t\t\tif (options.required && !this[INITIALIZED]!.has(propName) && newValue !== null && newValue !== undefined) {\n\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\tconsole.debug(`[select] Calling delayed connectedCallback for ${propName}`)\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\terror: (err: Error) => {\n\t\t\t\t\tconsole.error(`Error in selector subscription for ${propName}:`, err)\n\t\t\t\t\t// Resubscribe on error to prevent component from becoming unresponsive\n\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t// Small delay to prevent immediate resubscription\n\t\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\t\tconsole.debug(`[select] Resubscribing after error for ${propName}`)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tthis.connectedCallback?.()\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}, 1000)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\n\t\t\t// Store the subscription for cleanup\n\t\t\tthis[SUBSCRIPTIONS]!.set(propName, subscription)\n\t\t}\n\n\t\t// Override disconnectedCallback to clean up subscriptions\n\t\tproto.disconnectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Call original disconnectedCallback\n\t\t\toriginalDisconnectedCallback?.call(this)\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Cleaning up resources in disconnectedCallback`)\n\t\t\t}\n\n\t\t\t// Clean up all subscription resources\n\t\t\tcleanupSelectorResources(this)\n\t\t}\n\t}\n}\n\n/**\n * Creates a selector decorator that selects a specific item from a collection store\n * with improved memory management\n *\n * @param store The collection store\n * @param keyGetter Function that returns the key to select\n * @param options Additional options\n */\nexport function selectItem<T>(\n\tstore: ICollectionStore<T>,\n\tkeyGetter: (component: any) => string,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<T | undefined>) {\n\t\tselect(\n\t\t\tstore,\n\t\t\tfunction (state) {\n\t\t\t\t// This will be evaluated during subscription, when 'this' is available\n\t\t\t\tconst itemKey = keyGetter(this)\n\t\t\t\treturn itemKey ? state.get(itemKey) : undefined\n\t\t\t},\n\t\t\toptions,\n\t\t)(proto, propName)\n\t}\n}\n"],"names":["createObjectStore","initialData","storage","key","value","Array","isArray","Map","Set","Date","RegExp","Object","getPrototypeOf","prototype","store","SchmancyStoreObject","getInstance","obj","keys","length","set","err","createArrayStore","SchmancyArrayStore","replace","createContext","includes","SchmancyCollectionStore","size","getFieldValue","item","path","parts","split","part","getBigrams","s","bigrams","i","push","substring","toLowerCase","computeFuzzyScore","actual","expected","a","trim","b","substringScore","subsequenceScore","sub","str","j","anagramScore","query","target","countChars","reduce","acc","char","queryCount","targetCount","every","diceScore","s1","s2","bigrams1","bigrams2","intersection","used","fill","bigram","maxLen","Math","max","levenshteinScore","matrix","map","_","charAt","min","safeString","String","applyQueryCondition","fuzzyThreshold","field","op","strict","operator","valid","score","matches","compareValues","t","filterMapItems","items","queries","from","values","scoredItems","entries","totalScore","matchCount","result","sort","x","filterArrayItems","forEach","index","isString","isNumber","isNaN","isDate","getTime","isMap","isSet","isNil","localeCompare","has","startsWith","endsWith","filterMap","filterArray","deepEqual","get","keysA","keysB","createSelector","selectorFn","$","pipe","distinctUntilChanged","shareReplay","createCollectionSelector","CLEANUP_SUBJECT","Symbol","SUBSCRIPTIONS","INITIALIZED","select","state","options","proto","propName","_descriptor","litProperty","attribute","type","originalConnectedCallback","connectedCallback","originalDisconnectedCallback","disconnectedCallback","component","this","closed","Subject","selector","required","call","add","unsubscribe","delete","debug","subscription","takeUntil","subscribe","next","newValue","deepClone","structuredClone","updateOnly","requestUpdate","error","isConnected","setTimeout","complete","clear","selectors","combinerFn","combineLatest","filterFn","collection","filter","predicate","itemKey","mapFn","share","resetOnRefCountZero","resetOnError","resetOnComplete","compareFn","iterator","keyGetter"],"mappings":"2IAkDA,SAASA,EACRC,EACAC,EACAC,EAEI,CAAA,GAAA,CAECD,IAAY,cAELA,EAAA,WAzBUE,EA6BFH,KA3BT,MACO,OAAVG,GAAU,UAChBC,MAAMC,QAAQF,CACbA,GAAAA,aAAiBG,KACjBH,aAAiBI,KACjBJ,aAAiBK,MACjBL,aAAiBM,QACnBC,OAAOC,eAAeR,CAAAA,IAAWO,OAAOE,aAsBzBZ,EAAA,CAAA,GAAKA,CAIpB,GAAA,MAAMa,EAAQC,EAAAA,oBAAoBC,YAAed,EAASC,EAAKF,CAOxD,EAAA,OAlEcgB,OAAAA,EA8DHH,EAAMV,QA7DN,UAAYa,IAAQ,MAGhCN,OAAOO,KAAKD,CAAKE,EAAAA,SAAW,GA2DjCL,EAAMM,IAAI,CAAKnB,GAAAA,CAAAA,CAAAA,EAGTa,OACCO,CASD,OANeN,EAAAA,oBAAoBC,YACzC,SACA,GAAGb,CACHF,YAAAA,CAAAA,CAGM,CA5ET,IAAuBgB,EAwBAb,CAsDvB,CAqCA,SAASkB,EACRrB,EACAC,EACAC,EAEI,CAAA,GAAA,CAEH,MAAMW,EAAQS,EAAAA,mBAAmBP,YAAYd,EAASC,EAAKF,CAAAA,EAQpD,OALFa,EAAMV,MAAMe,QAEhBL,EAAMU,QAAQ,CAAIvB,GAAAA,CAAAA,CAAAA,EAGZa,OACCO,CASD,OANeE,EAAAA,mBAAmBP,YACxC,SACA,GAAGb,CACH,YAAA,CAAA,GAAIF,GAGE,CAET,CA8CgB,SAAAwB,EACfxB,EACAC,EACAC,EAKI,CAAA,GAAA,CAeC,OAbAF,GAAAA,OAIFA,EADGE,EAAIuB,SAAS,YAAA,GAAiBvB,EAAIuB,SAAS,WAC5BnB,IACRJ,EAAIuB,SAAS,OAAA,GAAYvB,EAAIuB,SAAS,MAClC,EAAA,CAAA,EAEA,CAAC,GAKMzB,aAxMAM,IAwEzB,SACCN,EACAC,EACAC,EAEI,CAAA,GAAA,CAEH,MAAMW,EAAQa,EAAAA,wBAAwBX,YAAYd,EAASC,EAAKF,CAAAA,EAQzD,OALFa,EAAMV,MAAMwB,MAEhBd,EAAMU,QAAQ,IAAIjB,IAAIN,CAGhBa,CAAAA,EAAAA,OAUA,CAAA,OANea,EAAAA,wBAAwBX,YAC7C,SACA,GAAGb,CACH,YAAA,IAAII,IAAIN,CAAAA,CAAAA,CAGF,CAET,EAsGqCA,EAAaC,EAASC,CAAAA,EAnM3D,SAAoBC,EAAAA,CACZ,OAAAC,MAAMC,QAAQF,CAAAA,CACtB,EAkM0BH,CAChBqB,EAAAA,EAAsBrB,EAAaC,EAASC,CAE5CH,EAAAA,EADUC,OAAAA,GAAgB,SACHA,EAIA,CAAEG,MAAOH,CAAAA,EAJ2BC,EAASC,CAAAA,OAWrE,CAAA,OAAAH,EACiB,OAAhBC,GAAgB,UAAYA,IAAgB,KAAO,CAAA,GAAKA,CAAgB,EAAA,CAAEG,MAAOH,CAAAA,EACxF,SACA,sBAAsBE,CACvB,EAAA,CAAA,CAEF,CCjMa,MAAA0B,EAAgB,CAAUC,EAA2BC,IAAAA,CAC7D,GAACA,CAAAA,EAAa,OAAAD,EAEZ,MAAAE,EAAQD,EAAKE,MAAM,GAAA,EACzB,IAAI7B,EAAa0B,EAEjB,UAAWI,KAAQF,EAAO,CACrB,GAAA5B,GAAS,KAAa,OAC1BA,EAAQA,EAAM8B,CAAI,CAAA,CAGZ,OAAA9B,CAAA,EA+EF+B,EAAcC,GACnB,CAAA,GAAA,CAAKA,GAAKA,EAAEjB,OAAS,QAAU,CAAA,EAE/B,MAAMkB,EAAoB,CAAA,EAC1B,QAASC,EAAI,EAAGA,EAAIF,EAAEjB,OAAS,EAAGmB,IACzBD,EAAAE,KAAKH,EAAEI,UAAUF,EAAGA,EAAI,CAAA,EAAGG,YAE7B,CAAA,EAAA,OAAAJ,CAAA,EAwCFK,EAAoB,CAACC,EAAgBC,IAAAA,CAC1C,GAAKD,CAAAA,GAAAA,CAAWC,EAAiB,MAAA,GAEjC,MAAMC,EAAIF,EAAOF,YAAAA,EAAcK,KACzBC,EAAAA,EAAIH,EAASH,YAAAA,EAAcK,KAE7B,EAAA,GAAAD,IAAME,EAAU,MAAA,GAEpB,MAAMC,EAAiBH,EAAEnB,SAASqB,CAAK,EAAA,EAAI,EACrCE,GAjGgBC,CAAAA,EAAaC,IAC/B,CAAA,GAAA,CAACD,EAAY,MAAA,GACb,GAAA,CAACC,EAAY,MAAA,GAEb,IAAAb,EAAI,EACPc,EAAI,EACL,KAAOd,EAAIY,EAAI/B,QAAUiC,EAAID,EAAIhC,QAC5B+B,EAAIZ,CAAGG,EAAAA,YAAAA,IAAkBU,EAAIC,CAAAA,EAAGX,YAAeH,GAAAA,IACnDc,IAED,OAAOd,IAAMY,EAAI/B,MAAA,GAuFsB4B,EAAGF,CAAK,EAAA,GAAM,EAC/CQ,GAjFc,CAACC,EAAeC,IAAAA,CAChC,GAACD,CAAAA,EAAc,MAAA,GACf,GAACC,CAAAA,EAAe,MAAA,GAEd,MAAAC,EAAcpB,GACnBA,EACEK,YACAR,EAAAA,MAAM,EACNwB,EAAAA,OACA,CAACC,EAAKC,KACLD,EAAIC,CAASD,GAAAA,EAAIC,CAAS,GAAA,GAAK,EACxBD,GAER,CAAA,CAGGE,EAAAA,EAAaJ,EAAWF,CAAAA,EACxBO,EAAcL,EAAWD,CAC/B,EAAA,OAAO5C,OAAOO,KAAK0C,CAAYE,EAAAA,MAAMH,IAASE,EAAYF,CAAS,GAAA,IAAMC,EAAWD,CAAAA,CAAAA,CAAK,GA+DvDZ,EAAGF,CAAAA,EAAK,GAAM,EAC1CkB,GA5CiB,CAACC,EAAYC,IAAAA,CAChC,GAACD,CAAAA,GAAAA,CAAOC,GAAMD,EAAG7C,OAAS,GAAK8C,EAAG9C,OAAS,EAAU,MAAA,GAEnD,MAAA+C,EAAW/B,EAAW6B,CAAAA,EACtBG,EAAWhC,EAAW8B,CAE5B,EAAA,GAAIC,EAAS/C,SAAW,GAAKgD,EAAShD,SAAW,EAAU,MAAA,GAE3D,IAAIiD,EAAe,EACnB,MAAMC,EAAO,IAAIhE,MAAM8D,EAAShD,MAAQmD,EAAAA,KAAAA,EAExC,EAAA,UAAWC,KAAUL,EACpB,QAAS5B,EAAI,EAAGA,EAAI6B,EAAShD,OAAQmB,IACpC,GAAA,CAAK+B,EAAK/B,CAAAA,GAAM6B,EAAS7B,CAAAA,IAAOiC,EAAQ,CACvCH,IACAC,EAAK/B,CAAK,EAAA,GACV,KAAA,CAKH,MAAQ,GAAI8B,GAAiBF,EAAS/C,OAASgD,EAAShD,OAAA,GAuBtB0B,EAAGE,CAAAA,EAE/ByB,EAASC,KAAKC,IAAI7B,EAAE1B,OAAQ4B,EAAE5B,MAC9BwD,EAAAA,EAAmBH,EAAS,GAtId3B,CAAAA,EAAWE,IAC3B,CAAA,GAAAF,IAAME,EAAU,MAAA,GAEpB,MAAM6B,EAAqBvE,MAAM0C,EAAE5B,OAAS,CAC1CmD,EAAAA,KAAK,IACLO,EAAAA,IAAI,CAACC,EAAGxC,IAAM,CAACA,CAGjB,CAAA,EAAA,QAASc,EAAI,EAAGA,GAAKP,EAAE1B,OAAQiC,IACvBwB,EAAA,CAAGxB,EAAAA,CAAAA,EAAKA,EAGhB,QAASd,EAAI,EAAGA,GAAKS,EAAE5B,OAAQmB,IAC9B,QAASc,EAAI,EAAGA,GAAKP,EAAE1B,OAAQiC,IAC1BL,EAAEgC,OAAOzC,EAAI,CAAA,IAAOO,EAAEkC,OAAO3B,EAAI,CAAA,EAC7BwB,EAAAtC,CAAAA,EAAGc,CAAKwB,EAAAA,EAAOtC,EAAI,CAAA,EAAGc,EAAI,CAAA,EAEjCwB,EAAOtC,CAAAA,EAAGc,CAAKqB,EAAAA,KAAKO,IACnBJ,EAAOtC,EAAI,CAAA,EAAGc,GAAK,EACnBwB,EAAOtC,CAAGc,EAAAA,EAAI,CAAK,EAAA,EACnBwB,EAAOtC,EAAI,CAAGc,EAAAA,EAAI,CAAK,EAAA,CAAA,EAK3B,OAAOwB,EAAO7B,EAAE5B,MAAAA,EAAQ0B,EAAE1B,MAAAA,CAAM,GA6GkB0B,EAAGE,CAAAA,EAAKyB,EAAS,EAEnE,OAAOC,KAAKC,IAAI1B,EAAgBC,EAAkBI,EAAcU,EAAWY,CAAgB,CAAA,EAMtFM,EAAc7E,GACfA,GAAS,KAAa,GACnB8E,OAAO9E,CAMf,EAAA,SAAS+E,EACRrD,EACAwB,EACA8B,EAAyB,GAErB,CAAA,IAAAC,EACHC,EACA1C,EACA2C,EAAAA,GAYG,GAVAlF,MAAMC,QAAQgD,CACf+B,EAAAA,CAAAA,EAAOC,EAAI1C,EAAU2C,EAAS,EAAA,EAASjC,GAEzC+B,EAAQ/B,EAAMnD,IACdmF,EAAKhC,EAAMkC,SACX5C,EAAWU,EAAMlD,MACjBmF,EAASjC,EAAMiC,QAAAA,IAIXA,CAAAA,IAAW3C,IAAa,IAAMA,GAAY,MAAStC,EAAQsC,CAAAA,GAAaA,EAASzB,SAAW,GAChG,MAAO,CAAEsE,MAAAA,GAAaC,MAAO,CAGxB,EAAA,MAAA/C,EAASd,EAAcC,EAAMuD,CAGnC,EAAA,GAAIE,EAAQ,CAEX,GAAID,IAAO,MAAO,CAEjB,GAAsB,OAAX3C,GAAW,UAAgC,OAAbC,GAAa,SACrD,MAAO,CAAE6C,MAAAA,GAAcC,MAAO,CAGzB,EAAA,MAAAA,EAAQhD,EAAkBC,EAAQC,CAAAA,EACjC,MAAA,CACN6C,MAAOC,GAASN,EAChBM,MAAOA,GAASN,EAAiBM,EAAQ,CAAA,CAC1C,CACM,CAGN,MAAMC,EAAUC,EAAcN,EAAI3C,EAAQC,CAAAA,EACnC,MAAA,CACN6C,MAAOE,EACPD,MAAOC,EAAU,EAAI,CAAA,CACtB,CACD,CACD,GAAWL,IAAO,MAAO,CAExB,GAAsB,OAAX3C,GAAW,UAAgC,OAAbC,GAAa,SACrD,MAAO,CAAE6C,MAAO,GAAOC,MAAO,CAAA,EAGzB,MAAAA,EAAQhD,EAAkBC,EAAQC,CACxC,EAAA,OAAI8C,EAAQN,EACJ,CAAEK,MAAAA,GAAcC,MAAO,CAGxB,EAAA,CAAED,MAAO,GAAMC,MAAMG,CAAA,CAAA,CACtB,CAEN,MAAMF,EAAUC,EAAcN,EAAI3C,EAAQC,GACnC,MAAA,CACN6C,MAAOE,EACPD,MAAOC,EAAU,EAAI,CAAA,CACtB,CAEF,CAkBO,SAASG,EACfC,EACAC,EAA4B,CAC5BZ,EAAAA,EAAyB,GAGrB,CAAA,GAAA,CAACY,EAAQ7E,OACZ,OAAOd,MAAM4F,KAAKF,EAAMG,OAIzB,CAAA,EAAA,MAAMC,EAA+B,CAAA,EAErC,SAAA,CAAYrB,EAAGhD,CAASiE,IAAAA,EAAMK,QAAW,EAAA,CACxC,IAAIC,EAAa,EACbC,EAAa,EACbb,EAAAA,GAEJ,UAAWnC,KAAS0C,EAAS,CAC5B,MAAMO,EAASpB,EAAoBrD,EAAMwB,EAAO8B,CAAAA,EAE5C,GAACmB,CAAAA,EAAOd,MAAO,CACVA,EAAA,GACR,KAAA,CAGDY,GAAcE,EAAOb,MACrBY,GAAA,CAGGb,GACHU,EAAY5D,KAAK,CAChBT,KAAAA,EACA4D,MAAOY,EAAa,EAAID,EAAaC,EAAa,CAAA,CAAA,CAEpD,CAMD,OAFAH,EAAYK,KAAK,CAAC3D,EAAGE,IAAMA,EAAE2C,MAAQ7C,EAAE6C,KAEhCS,EAAAA,EAAYtB,IAAS4B,GAAAA,EAAE3E,IAAAA,CAC/B,CAKO,SAAS4E,EACfX,EACAC,EAA4B,CAC5BZ,EAAAA,EAAyB,GAGnB,CAAA,MAAAP,MAAUtE,IAGT,OAFDwF,EAAAY,QAAQ,CAAC7E,EAAM8E,IAAU/B,EAAIzD,IAAI8D,OAAO0B,CAAQ9E,EAAAA,CAAAA,CAAAA,EAE/CgE,EAAejB,EAAKmB,EAASZ,CAAAA,CACrC,CASO,SAAS9E,EAAqBF,EAAAA,CAC7B,OAAAC,MAAMC,QAAQF,CACtB,CAAA,CAOO,SAASyG,EAASzG,EACxB,CAAA,OAAcA,OAAAA,GAAU,QACzB,CAOO,SAAS0G,EAAS1G,EAAAA,CACxB,OAAwB,OAAVA,GAAU,UAAa2G,CAAAA,MAAM3G,CAC5C,CAAA,CAOO,SAAS4G,EAAO5G,EACtB,CAAA,OAAOA,aAAiBK,MAAAA,CAASsG,MAAM3G,EAAM6G,QAC9C,CAAA,CAAA,CAsBO,SAASC,EAAgC9G,EAAAA,CAC/C,OAAOA,aAAiBG,GACzB,CAOO,SAAS4G,EAAmB/G,EAClC,CAAA,OAAOA,aAAiBI,GACzB,CAqBO,SAAS4G,EAAMhH,EAAAA,CACd,OAAAA,GAAAA,IACR,CASgB,SAAAwF,EAAcN,EAAwB3C,EAAiBC,EAAAA,CAEtE,GAAIwE,EAAMzE,CAAWyE,GAAAA,EAAMxE,CAAkB,EAAA,MAAA,GAC7C,GAAIwE,EAAMzE,CAAAA,GAAWyE,EAAMxE,CAAAA,EAEtB,OAAA0C,IAAO,KAAa3C,IAAWC,EAC/B0C,IAAO,MAAa3C,IAAWC,EAKpC,OAAQ0C,EACP,CAAA,IAAK,KACJ,OAAO3C,IAAWC,EACnB,IAAK,KACJ,OAAOD,IAAWC,EACnB,IAAK,IACJ,OAAIkE,EAASnE,CAAAA,GAAWmE,EAASlE,CACzBD,EAAAA,EAASC,EAEboE,EAAOrE,CAAWqE,GAAAA,EAAOpE,CACrBD,EAAAA,EAAOsE,QAAYrE,EAAAA,EAASqE,QAEhCJ,EAAAA,EAAAA,CAAAA,EAASlE,CAAWkE,GAAAA,CAAAA,EAASjE,CACzBD,IAAAA,EAAO0E,cAAczE,CAAAA,EAAY,EAG1C,IAAK,IACJ,OAAIkE,EAASnE,CAAAA,GAAWmE,EAASlE,CAAAA,EACzBD,EAASC,EAEboE,EAAOrE,CAAAA,GAAWqE,EAAOpE,CACrBD,EAAAA,EAAOsE,QAAYrE,EAAAA,EAASqE,QAEhCJ,EAAAA,EAAAA,CAAAA,EAASlE,CAAWkE,GAAAA,CAAAA,EAASjE,CACzBD,IAAAA,EAAO0E,cAAczE,CAAAA,EAAY,EAG1C,IAAK,KACJ,OAAIkE,EAASnE,CAAAA,GAAWmE,EAASlE,CAAAA,EACzBD,GAAUC,EAEdoE,EAAOrE,CAAAA,GAAWqE,EAAOpE,CAAAA,EACrBD,EAAOsE,QAAAA,GAAarE,EAASqE,QAAAA,EAAAA,EAAAA,CAEjCJ,EAASlE,CAAWkE,GAAAA,CAAAA,EAASjE,CACzBD,IAAAA,EAAO0E,cAAczE,CAAAA,GAAa,EAG3C,IAAK,KACJ,OAAIkE,EAASnE,CAAAA,GAAWmE,EAASlE,CAAAA,EACzBD,GAAUC,EAEdoE,EAAOrE,CAAAA,GAAWqE,EAAOpE,CAAAA,EACrBD,EAAOsE,QAAAA,GAAarE,EAASqE,QAAAA,EAAAA,EAAAA,CAEjCJ,EAASlE,CAAAA,GAAAA,CAAWkE,EAASjE,CAAAA,IACzBD,EAAO0E,cAAczE,IAAa,EAG3C,IAAK,WACA,OAAAiE,EAASlE,CAAAA,EACLA,EAAOF,YAAAA,EAAcf,SAASuD,EAAWrC,CAAUH,EAAAA,YAAAA,CAAAA,EAEvDnC,EAAQqC,CAAAA,EACJA,EAAOjB,SAASkB,CAEpBuE,EAAAA,EAAMxE,CACFA,EAAAA,EAAO2E,IAAI1E,CAAAA,EAAAA,CAAAA,CAEfsE,EAAMvE,CAAAA,GACFtC,MAAM4F,KAAKtD,EAAOuD,OAAAA,CAAAA,EAAUxE,SAASkB,CAAAA,EAI9C,IAAK,cACA,OAAAiE,EAASlE,CAAAA,EAAAA,CACJA,EAAOF,YAAAA,EAAcf,SAASuD,EAAWrC,CAAUH,EAAAA,YAAAA,CAAAA,EAExDnC,EAAQqC,CAAAA,EAAAA,CACHA,EAAOjB,SAASkB,CAErBuE,EAAAA,EAAMxE,CACDA,EAAAA,CAAAA,EAAO2E,IAAI1E,CAAAA,EAAAA,CAEhBsE,EAAMvE,CAAAA,GAAAA,CACDtC,MAAM4F,KAAKtD,EAAOuD,OAAAA,CAAAA,EAAUxE,SAASkB,CAAAA,EAI/C,IAAK,aACJ,SAAIiE,EAASlE,CAAAA,GAAAA,CAAWkE,EAASjE,CAAAA,IACzBD,EAAOF,YAAAA,EAAc8E,WAAW3E,EAASH,YAIlD,CAAA,EAAA,IAAK,WACJ,MAAA,EAAA,CAAIoE,EAASlE,CAAAA,GAAAA,CAAWkE,EAASjE,CAAAA,IACzBD,EAAOF,YAAAA,EAAc+E,SAAS5E,EAASH,YAIhD,CAAA,EAAA,IAAK,KACA,OAAAnC,EAAQsC,CAAAA,EACJA,EAASlB,SAASiB,CAEtBwE,EAAAA,EAAMvE,GACFA,EAAS0E,IAAI3E,CAEjBuE,EAAAA,CAAAA,CAAAA,EAAMtE,CACFA,IAAAA,EAAS0E,IAAI3E,CAAAA,GAAkBtC,MAAM4F,KAAKrD,EAASsD,OAAAA,CAAAA,EAAUxE,SAASiB,CAAAA,GAI/E,IAAK,QACA,OAAArC,EAAQsC,CACHA,EAAAA,CAAAA,EAASlB,SAASiB,CAAAA,EAEvBwE,EAAMvE,CAAAA,EAAAA,CACDA,EAAS0E,IAAI3E,CAElBuE,EAAAA,CAAAA,EAAMtE,CACDA,GAAAA,CAAAA,EAAS0E,IAAI3E,CAAAA,GAAAA,CAAmBtC,MAAM4F,KAAKrD,EAASsD,OAAAA,CAAAA,EAAUxE,SAASiB,CAAAA,EAIjF,QAEQ,MAAA,EAGV,CAAA,CAGO,MAAM8E,EAAY3B,EAGZ4B,EAAchB,ECjlB3B,SAASiB,EAAU9E,EAAYE,EAC1B,CAAA,GAAAF,IAAME,EAAU,MAAA,GAEhB,GAAAF,aAAatC,KAAOwC,aAAaxC,IAAK,CACzC,GAAIsC,EAAEjB,OAASmB,EAAEnB,KAAa,MAAA,GAC9B,SAAA,CAAYzB,EAAKC,CAAAA,IAAUyC,EAC1B,GAAA,CAAKE,EAAEuE,IAAInH,CAASwH,GAAAA,CAAAA,EAAUvH,EAAO2C,EAAE6E,IAAIzH,CAAAA,CAAAA,EAAc,MAAA,GAEnD,MAAA,EAAA,CAGJ,GAAA0C,aAAarC,KAAOuC,aAAavC,IAAK,CACzC,GAAIqC,EAAEjB,OAASmB,EAAEnB,KAAa,MAAA,GAC9B,UAAWE,KAAQe,EAClB,GAAA,CAAKE,EAAEuE,IAAIxF,CAAc,EAAA,MAAA,GAEnB,MAAA,EAAA,CAGJ,GAAa,OAANe,GAAM,UAAYA,IAAM,MAAqB,OAANE,GAAM,UAAYA,IAAM,KAAM,CACzE,MAAA8E,EAAQlH,OAAOO,KAAK2B,CAAAA,EACpBiF,EAAQnH,OAAOO,KAAK6B,CAAAA,EAE1B,GAAI8E,EAAM1G,SAAW2G,EAAM3G,OAAe,MAAA,GAE1C,UAAWhB,KAAO0H,EAEb,GAAA,CAACF,EAAU9E,EAAE1C,CAAM4C,EAAAA,EAAE5C,CAAc,CAAA,EAAA,MAAA,GAGjC,MAAA,EAAA,CAGD,MAAA,EACR,CASgB,SAAA4H,EAAqBjH,EAAkBkH,EAC/C,CAAA,OAAAlH,EAAMmH,EAAEC,KAAKrD,MAAImD,CAAAA,EAAaG,EAAAA,qBAAwBR,CAAYS,EAAAA,EAAYA,YAAA,CAAA,CAAA,CACtF,CASgB,SAAAC,EACfvH,EACAkH,EAEO,CAAA,OAAAlH,EAAMmH,EAAEC,KAAKrD,MAAImD,CAAAA,EAAaG,EAAAA,qBAAwBR,CAAAA,EAAYS,EAAYA,YAAA,CACtF,CAAA,CAAA,CCxDA,MAAME,EAAkBC,OAAO,iBAAA,EACzBC,EAAgBD,OAAO,uBACvBE,EAAAA,EAAcF,OAAO,qBAAA,EA2GX,SAAAG,EACf5H,EACAkH,EAAiCW,GAAaA,EAC9CC,EAAyB,GAElB,CAAA,OAAA,SAAUC,EAA4BC,EAAkBC,EAAAA,CAElDC,WAAA,CAAEC,UAAW,GAAOC,KAAMvI,MAAAA,CAAAA,EAAUkI,EAAOC,CAGvD,EAAA,MAAMK,EAA4BN,EAAMO,kBAClCC,EAA+BR,EAAMS,qBAG3CT,EAAMO,kBAAoB,UA1D5B,OAAA,IAAgCG,GA4DNC,EAAAA,MA3DVlB,CAAoBiB,GAAAA,CAAAA,EAAUjB,CAAiBmB,EAAAA,SACnDF,EAAAjB,CAAAA,EAAmB,IAAIoB,WAG7BH,EAAUf,CAAAA,IACJe,EAAAf,CAAAA,EAAiB,IAAIjI,KAG3BgJ,EAAUd,CAAAA,IACJc,EAAAd,CAAAA,EAAe,IAAIjI,KAqDtB,MAAAmJ,EAtET,SAA8B7I,EAAAA,CAC7B,MAAO,QAASA,GAA8B,OAAdA,EAAMM,KAAQ,YAAcN,EAAMV,iBAAiBG,GACpF,EAoEqDO,CAAAA,EAC/CuH,EAAyBvH,EAAOkH,CAChCD,EAAAA,EAAejH,EAAoBkH,CAAAA,EAGjCY,EAAQgB,UAAaJ,KAAKf,CAAAA,EAAcnB,IAAIwB,CAAAA,IAChDK,GAAAA,MAAAA,EAA2BU,KAAKL,MAC3BA,KAAAf,CAAcqB,EAAAA,IAAIhB,CAIpBU,GAAAA,KAAKhB,CAAgBlB,EAAAA,IAAIwB,CAC5BU,KAAAA,EAAAA,KAAKhB,CAAgBZ,EAAAA,IAAIkB,CAAWiB,IAApCP,MAAAA,EAAoCO,cAC/BP,KAAAhB,CAAAA,EAAgBwB,OAAOlB,CAAAA,GAIzBF,EAAQqB,MAKN,MAAAC,EAAeP,EAASzB,KAAKiC,EAAAA,UAAUX,KAAKlB,CAAoB8B,CAAAA,CAAAA,EAAAA,UAAU,CAC/EC,KAAOjK,GAEN,OAAA,MAAMkK,EAAW1B,EAAQ2B,UAAYC,gBAAgBpK,CAASA,EAAAA,EAE1DwI,EAAQqB,MAIPrB,EAAQ6B,aACZjB,KAAKV,CAAAA,EAAYwB,IAGlBd,EAAAA,KAAKkB,gBAALlB,MAAAA,EAAAA,WAGIZ,EAAQgB,UAAaJ,CAAAA,KAAKf,GAAcnB,IAAIwB,CAAAA,GAAawB,GAAzD1B,OACCA,EAAQqB,MAIZd,GAAAA,MAAAA,EAA2BU,KAAKL,MAC3BA,KAAAf,CAAcqB,EAAAA,IAAIhB,CAAQ,EAAA,EAGjC6B,MAAQtJ,GAAAA,CAGHmI,KAAKoB,aAERC,WAAW,IAAA,OACNrB,KAAKoB,cACJhC,EAAQqB,OAGZT,EAAAA,KAAKJ,oBAALI,MAAAA,EAAAA,WAAyB,EAExB,GAAA,CAAI,CAMVA,CAAAA,EAAAA,KAAKhB,GAAgBpH,IAAI0H,EAAUoB,CACpC,CAAA,EAGArB,EAAMS,qBAAuB,UAnH/B,CAAA,IAAkCC,EAqH/BF,GAAAA,MAAAA,EAA8BQ,KAAKL,MAG/BZ,EAAQqB,OAxHmBV,EA6HNC,MA5HblB,CACHiB,IAAAA,EAAAjB,CAAiB+B,EAAAA,KAAAA,EACjBd,EAAAjB,CAAAA,EAAiBwC,SAC3BvB,EAAAA,EAAUjB,CAAmB,EAAA,QAG1BiB,EAAUf,CAAAA,IACbe,EAAUf,CAAAA,EAAe7B,QAAezD,GAAAA,EAAI6G,YAClCR,CAAAA,EAAAA,EAAAf,CAAeuC,EAAAA,MAAAA,EACzBxB,EAAUf,CAAAA,EAAAA,QAGPe,EAAUd,CACHc,IAAAA,EAAAd,CAAasC,EAAAA,MAAAA,EACvBxB,EAAUd,CAAAA,EAAAA,OA+GV,CACD,CACD,oDH+BO,SACNxI,EAAmB,CAAA,EACnBE,EACAD,EAAuB,SAEnB,GACI,CAAA,OAAAuB,EAAiBxB,EAAaC,EAASC,CAAAA,OAI9C,CAAA,OAAOmB,EAAoBrB,EAAa,SAAU,GAAGE,CAAc,WAAA,CAAA,CAErE,oEEvKgB,SACf6K,EACAC,EAEO,CAAA,OAAAC,EAAAA,cAAcF,CAAW9C,EAAAA,KAC/BrD,EAAAA,IAAIqB,GAAU+E,EAAe/E,GAAAA,CAAAA,CAAAA,EAC7BiC,EAAAA,qBAAwBR,CACxBS,EAAAA,EAAAA,YAAY,CAAA,CAAA,CAEd,sDA+EgB,SACftH,EACAqK,EAEO,CAAA,OAAA9C,EAAyBvH,EAAqBsK,GAC/CD,EAEE9K,MAAM4F,KAAKmF,EAAWhF,QAAAA,CAAAA,EAAWiF,OAAO,CAAA,CAAElL,EAAK2B,CAAUqJ,IAAAA,EAASrJ,EAAM3B,CAAAA,CAAAA,EAAMgB,OAF/DiK,EAAWxJ,IAInC,CAAA,gCA5EO,SAAkCd,EAAAA,CACjC,OAAAuH,EAAyBvH,EAAqBsK,GAAA/K,MAAM4F,KAAKmF,EAAWhF,QAAAA,CAAAA,CAAAA,CAC5E,+BAmCgB,SACftF,EACAqK,EAAAA,CAEO,OAAA9C,EAAyBvH,EAAOsK,GACtC/K,MAAM4F,KAAKmF,EAAWhF,QAAAA,CAAAA,EACpBiF,OAAO,CAAA,CAAElL,EAAK2B,CAAAA,IAAUqJ,EAASrJ,EAAM3B,CACvC0E,CAAAA,EAAAA,IAAI,CAAEC,CAAAA,EAAGhD,CAAUA,IAAAA,CAAAA,CAAAA,CAEvB,6BA9BgB,SACfhB,EACAwK,EAAAA,CAEO,OAAAjD,EAAyBvH,EAAqBsK,GAAAA,CACpD,SAAA,CAAYjL,EAAK2B,CAAAA,IAASsJ,EAAWhF,QAAAA,EAChC,GAAAkF,EAAUxJ,EAAM3B,CACZ,EAAA,OAAA2B,CAGF,CAAA,CAET,6BA5DgB,SAAsBhB,EAA4ByK,EAAAA,CACjE,OAAOlD,EAAyBvH,EAAOsK,GAAcA,EAAWxD,IAAI2D,CACrE,CAAA,CAAA,8BAbO,SAAgCzK,EAAAA,CAC/B,OAAAuH,EAAyBvH,EAAqBsK,GAAA/K,MAAM4F,KAAKmF,EAAWlF,OAC5E,CAAA,CAAA,CAAA,6BAkCO,SAA+BpF,EAAAA,CAC9B,OAAAuH,EAAyBvH,EAAqBsK,GAAA/K,MAAM4F,KAAKmF,EAAWlK,KAAAA,CAAAA,CAAAA,CAC5E,4BAwDgB,SACfJ,EACA0K,EAAAA,CAEO,OAAAnD,EAAyBvH,KAC/BT,MAAM4F,KAAKmF,EAAWhF,QAAAA,CAAAA,EAAWvB,IAAI,CAAA,CAAE1E,EAAK2B,CAAU0J,IAAAA,EAAM1J,EAAM3B,CAAAA,CAAAA,CAAAA,CAEpE,kCA4BgB,SAA8BW,EAAkBkH,EAAAA,CAC/D,OAAOlH,EAAMmH,EAAEC,KACdrD,EAAAA,IAAImD,CACJG,EAAAA,EAAAA,qBAAwBR,CAAAA,EACxB8D,QAAM,CACLC,oBAAAA,GACAC,aAAAA,GACAC,gBAAAA,EAGH,CAAA,CAAA,CAAA,sDAzFgB,SAAsB9K,EAA4B+K,EAAAA,CAC1D,OAAAxD,EAAyBvH,EAAqBsK,GAC7C/K,MAAM4F,KAAKmF,EAAWlF,OAAAA,CAAAA,EAAUM,KAAKqF,CAAAA,CAAAA,CAE9C,iCF+IO,SACN5L,EAAmB,CAAA,EACnBE,EAAc,aAAA,CAEV,GACI,CAAA,OAAAsB,EAAiBxB,EAAa,SAAUE,CAAAA,OACvCkB,CAGR,OAAOC,EAAoBrB,EAAa,SAAU,GAAGE,CAAAA,qBAAAA,CAAwB,CAE/E,8KC2HO,SAAiCC,EAAAA,CAEvC,OAAIA,GAAS,MAAyB,OAAVA,GAAU,UAK/BmI,OAAOuD,YAAYnL,OAAOP,CAAqD,GAAA,OAAnCA,EAAcmI,OAAOuD,QACzE,GADuF,UACvF,2EAyBO,SAAuB1L,GAC7B,GAAIA,IAAU,MAAyB,OAAVA,GAAU,SAC/B,MAAA,GAGF,MAAAyI,EAAQlI,OAAOC,eAAeR,CAAAA,EAC7B,OAAAyI,IAAUlI,OAAOE,WAAagI,IAAU,IAChD,yEEvNO,SACN/H,EACAiL,EACAnD,EAAyB,CAAA,EAAA,CAElB,OAAA,SAAUC,EAA4BC,EAAkBC,EAC9DL,CAAAA,EACC5H,EACA,SAAU6H,EAEH,CAAA,MAAA4C,EAAUQ,EAAUvC,IAC1B,EAAA,OAAO+B,EAAU5C,EAAMf,IAAI2D,CAAAA,EAAAA,MAC5B,EACA3C,CAPDF,EAQEG,EAAOC,CAAAA,CACV,CACD"}

package/dist/selector-hook-D_HTD-GV.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"selector-hook-D_HTD-GV.js","sources":["../src/store/context-create.ts","../src/store/filter-directive.ts","../src/store/selectors.ts","../src/store/selector-hook.ts"],"sourcesContent":["// src/store/context-create.ts - Fixed version\n\nimport { SchmancyArrayStore } from './context-array'\nimport SchmancyCollectionStore from './context-collection'\nimport { SchmancyStoreObject } from './context-object'\nimport { IArrayStore, ICollectionStore, IStore, StorageType } from './types'\n\n/**\n * Type guard to check if an object is empty\n */\nfunction isEmptyObject(obj: unknown): boolean {\n\tif (typeof obj !== 'object' || obj === null) {\n\t\treturn false\n\t}\n\treturn Object.keys(obj).length === 0\n}\n\n/**\n * Type guard for Map objects\n */\nfunction isMap<K, V>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for Array objects\n */\nfunction isArray<T>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for plain objects (not arrays, maps, null, etc.)\n */\nfunction isPlainObject(value: unknown): boolean {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!Array.isArray(value) &&\n\t\t!(value instanceof Map) &&\n\t\t!(value instanceof Set) &&\n\t\t!(value instanceof Date) &&\n\t\t!(value instanceof RegExp) &&\n\t\tObject.getPrototypeOf(value) === Object.prototype\n\t)\n}\n\n/**\n * Creates a regular object store with better typing and error handling\n */\nfunction createObjectStore<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T> {\n\ttry {\n\t\t// Validate storage type\n\t\tif (storage === 'indexeddb') {\n\t\t\tconsole.warn(`IndexedDB storage is not optimal for plain objects. Using 'local' instead for key: ${key}`)\n\t\t\tstorage = 'local'\n\t\t}\n\n\t\t// Ensure initialData is a plain object\n\t\tif (!isPlainObject(initialData)) {\n\t\t\tconsole.warn(`Initial data is not a plain object. Converting to object for key: ${key}`)\n\t\t\tinitialData = { ...initialData } as T\n\t\t}\n\n\t\t// Create the store instance\n\t\tconst store = SchmancyStoreObject.getInstance<T>(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (isEmptyObject(store.value)) {\n\t\t\tstore.set({ ...initialData }) // Use spread to create a copy\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create object store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyStoreObject.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tinitialData,\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates a collection store with better typing and error handling\n */\nfunction createCollectionStore<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyCollectionStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.size) {\n\t\t\t// Create a new Map instance to avoid modifying the input\n\t\t\tstore.replace(new Map(initialData))\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create collection store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyCollectionStore.getInstance<V>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\tnew Map(initialData),\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n/**\n * Creates an array store with better typing and error handling\n */\nfunction createArrayStore<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\t// Create the store instance\n\t\tconst store = SchmancyArrayStore.getInstance(storage, key, initialData)\n\n\t\t// Initialize with provided data if store is empty\n\t\tif (!store.value.length) {\n\t\t\t// Create a new array instance to avoid modifying the input\n\t\t\tstore.replace([...initialData])\n\t\t}\n\n\t\treturn store\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array store for key: ${key}`, err)\n\t\t// Fall back to a basic implementation that won't throw\n\t\tconst fallbackStore = SchmancyArrayStore.getInstance<T>(\n\t\t\t'memory', // Fallback to memory storage\n\t\t\t`${key}-fallback`,\n\t\t\t[...initialData],\n\t\t)\n\t\tconsole.warn(`Using fallback memory store for key: ${key}`)\n\t\treturn fallbackStore\n\t}\n}\n\n// Function overloads for better type inference\n/**\n * Creates a context for managing object state\n * @param initialData The initial object data\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A store instance for the object\n */\nexport function createContext<T extends Record<string, any>>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n): IStore<T> & SchmancyStoreObject<T>\n\n/**\n * Creates a context for managing collection state\n * @param initialData The initial Map collection\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns A collection store instance\n */\nexport function createContext<V>(\n\tinitialData: Map<string, V>,\n\tstorage: StorageType,\n\tkey: string,\n): ICollectionStore<V> & SchmancyCollectionStore<V>\n\n/**\n * Creates a context for managing array state\n * @param initialData The initial array\n * @param storage Storage type to use\n * @param key Unique key for the store\n * @returns An array store instance\n */\nexport function createContext<T>(\n\tinitialData: T[],\n\tstorage: StorageType,\n\tkey: string,\n): IArrayStore<T> & SchmancyArrayStore<T>\n\n/**\n * Implementation of the createContext function with complete type checking\n * and robust error handling\n */\nexport function createContext<T extends Record<string, any> | Map<string, any> | any[]>(\n\tinitialData: T,\n\tstorage: StorageType,\n\tkey: string,\n):\n\t| (IStore<T> & SchmancyStoreObject<T>)\n\t| (ICollectionStore<any> & SchmancyCollectionStore<any>)\n\t| (IArrayStore<any> & SchmancyArrayStore<any>) {\n\ttry {\n\t\t// Validate input\n\t\tif (initialData === null || initialData === undefined) {\n\t\t\tconsole.error('Initial data cannot be null or undefined')\n\t\t\t// Provide a sensible default based on type expected\n\t\t\tif (key.includes('collection') || key.includes('map')) {\n\t\t\t\tinitialData = new Map() as unknown as T\n\t\t\t} else if (key.includes('array') || key.includes('list')) {\n\t\t\t\tinitialData = [] as unknown as T\n\t\t\t} else {\n\t\t\t\tinitialData = {} as T\n\t\t\t}\n\t\t}\n\n\t\t// Determine store type based on input data with improved type checking\n\t\tif (isMap<string, any>(initialData)) {\n\t\t\treturn createCollectionStore<any>(initialData, storage, key)\n\t\t} else if (isArray<any>(initialData)) {\n\t\t\treturn createArrayStore<any>(initialData, storage, key)\n\t\t} else if (typeof initialData === 'object') {\n\t\t\treturn createObjectStore<any>(initialData as Record<string, any>, storage, key)\n\t\t} else {\n\t\t\t// Handle non-object data by wrapping it\n\t\t\tconsole.warn(`Initial data must be an object, array, or Map. Got ${typeof initialData}. Creating object wrapper.`)\n\t\t\treturn createObjectStore<any>({ value: initialData } as Record<string, any>, storage, key)\n\t\t}\n\t} catch (error) {\n\t\t// Last-resort error handling\n\t\tconsole.error(`Fatal error creating context for ${key}:`, error)\n\n\t\t// Create an emergency fallback store that won't throw\n\t\treturn createObjectStore<any>(\n\t\t\ttypeof initialData === 'object' && initialData !== null ? { ...initialData } : { value: initialData },\n\t\t\t'memory',\n\t\t\t`emergency-fallback-${key}`,\n\t\t)\n\t}\n}\n\n/**\n * Creates an array context with simplified API and type inference\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @param storage Storage type to use (defaults to 'local')\n * @returns An array store instance\n */\nexport function createArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string,\n\tstorage: StorageType = 'local',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, storage, key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create array context for key: ${key}`, err)\n\t\t// Return a fallback store\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-fallback`)\n\t}\n}\n\n/**\n * Creates a testable array context\n * @param initialData The initial array data\n * @param key Unique key for the store\n * @returns An array store that uses memory storage\n */\nexport function createTestArrayContext<T>(\n\tinitialData: T[] = [],\n\tkey: string = 'test-array',\n): IArrayStore<T> & SchmancyArrayStore<T> {\n\ttry {\n\t\treturn createContext<T>(initialData, 'memory', key)\n\t} catch (err) {\n\t\tconsole.error(`Failed to create test array context for key: ${key}`, err)\n\t\t// Return a fallback store with a different key\n\t\treturn createArrayStore<T>(initialData, 'memory', `${key}-emergency-fallback`)\n\t}\n}\n","// src/store/filter-directive.ts\n\n/** Supported comparison operators with TypeScript literal types */\nexport type ComparisonOperator =\n\t| '=='\n\t| '!='\n\t| '>'\n\t| '<'\n\t| '>='\n\t| '<='\n\t| 'includes'\n\t| 'notIncludes'\n\t| 'startsWith'\n\t| 'endsWith'\n\t| 'in'\n\t| 'notIn'\n\t| 'any' // fuzzy search operator\n\n/**\n * Type-safe condition tuple\n */\nexport type ConditionTuple = [field: string, op: ComparisonOperator, expected: unknown, strict?: boolean]\n\n/**\n * Type-safe condition object\n */\nexport interface ConditionObject {\n\tkey: string\n\toperator: ComparisonOperator\n\tvalue: unknown\n\tstrict?: boolean\n}\n\n/**\n * Unified query condition type\n */\nexport type QueryCondition = ConditionTuple | ConditionObject\n\n/**\n * Filter result with item and score\n */\nexport interface ScoredItem<T> {\n\titem: T\n\tscore: number\n}\n\n/**\n * Get a nested value from an object using a dot-separated path.\n * Checks explicitly for null/undefined so falsy values like 0 or false are preserved.\n */\nexport const getFieldValue = <T = any>(item: Record<string, any>, path: string): T => {\n\tif (!path) return item as unknown as T\n\n\tconst parts = path.split('.')\n\tlet value: any = item\n\n\tfor (const part of parts) {\n\t\tif (value == null) return undefined as unknown as T\n\t\tvalue = value[part]\n\t}\n\n\treturn value as T\n}\n\n/**\n * Compute the Levenshtein distance between two strings.\n */\nconst levenshtein = (a: string, b: string): number => {\n\tif (a === b) return 0\n\n\tconst matrix: number[][] = Array(b.length + 1)\n\t\t.fill(null)\n\t\t.map((_, i) => [i])\n\n\t// initialize the first row\n\tfor (let j = 0; j <= a.length; j++) {\n\t\tmatrix[0][j] = j\n\t}\n\n\tfor (let i = 1; i <= b.length; i++) {\n\t\tfor (let j = 1; j <= a.length; j++) {\n\t\t\tif (b.charAt(i - 1) === a.charAt(j - 1)) {\n\t\t\t\tmatrix[i][j] = matrix[i - 1][j - 1]\n\t\t\t} else {\n\t\t\t\tmatrix[i][j] = Math.min(\n\t\t\t\t\tmatrix[i - 1][j] + 1, // deletion\n\t\t\t\t\tmatrix[i][j - 1] + 1, // insertion\n\t\t\t\t\tmatrix[i - 1][j - 1] + 1, // substitution\n\t\t\t\t)\n\t\t\t}\n\t\t}\n\t}\n\treturn matrix[b.length][a.length]\n}\n\n/**\n * Check if string `sub` is a subsequence of string `str`.\n * All characters in `sub` must appear in order in `str` (they need not be contiguous).\n */\nconst isSubsequence = (sub: string, str: string): boolean => {\n\tif (!sub) return true\n\tif (!str) return false\n\n\tlet i = 0,\n\t\tj = 0\n\twhile (i < sub.length && j < str.length) {\n\t\tif (sub[i].toLowerCase() === str[j].toLowerCase()) i++\n\t\tj++\n\t}\n\treturn i === sub.length\n}\n\n/**\n * Check if every character (with frequency) in the query exists in the target.\n * For example, \"aovc\" matches \"avocados\".\n */\nconst anagramMatch = (query: string, target: string): boolean => {\n\tif (!query) return true\n\tif (!target) return false\n\n\tconst countChars = (s: string): Record<string, number> =>\n\t\ts\n\t\t\t.toLowerCase()\n\t\t\t.split('')\n\t\t\t.reduce(\n\t\t\t\t(acc, char) => {\n\t\t\t\t\tacc[char] = (acc[char] || 0) + 1\n\t\t\t\t\treturn acc\n\t\t\t\t},\n\t\t\t\t{} as Record<string, number>,\n\t\t\t)\n\n\tconst queryCount = countChars(query)\n\tconst targetCount = countChars(target)\n\treturn Object.keys(queryCount).every(char => (targetCount[char] || 0) >= queryCount[char])\n}\n\n/**\n * Generate bigrams for a string.\n */\nconst getBigrams = (s: string): string[] => {\n\tif (!s || s.length < 2) return []\n\n\tconst bigrams: string[] = []\n\tfor (let i = 0; i < s.length - 1; i++) {\n\t\tbigrams.push(s.substring(i, i + 2).toLowerCase())\n\t}\n\treturn bigrams\n}\n\n/**\n * Compute Dice's coefficient for two strings based on bigrams.\n * Returns a value between 0 (no similarity) and 1 (perfect match).\n */\nconst diceCoefficient = (s1: string, s2: string): number => {\n\tif (!s1 || !s2 || s1.length < 2 || s2.length < 2) return 0\n\n\tconst bigrams1 = getBigrams(s1)\n\tconst bigrams2 = getBigrams(s2)\n\n\tif (bigrams1.length === 0 || bigrams2.length === 0) return 0\n\n\tlet intersection = 0\n\tconst used = new Array(bigrams2.length).fill(false)\n\n\tfor (const bigram of bigrams1) {\n\t\tfor (let i = 0; i < bigrams2.length; i++) {\n\t\t\tif (!used[i] && bigrams2[i] === bigram) {\n\t\t\t\tintersection++\n\t\t\t\tused[i] = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (2 * intersection) / (bigrams1.length + bigrams2.length)\n}\n\n/**\n * Compute a fuzzy similarity score between two strings.\n * The score is computed by taking the maximum of several methods:\n * - Direct substring match (score 1)\n * - Subsequence check (score 0.8)\n * - Anagram subset match (score 0.7)\n * - Dice coefficient\n * - Normalized Levenshtein similarity\n */\nconst computeFuzzyScore = (actual: string, expected: string): number => {\n\tif (!actual || !expected) return 0\n\n\tconst a = actual.toLowerCase().trim()\n\tconst b = expected.toLowerCase().trim()\n\n\tif (a === b) return 1\n\n\tconst substringScore = a.includes(b) ? 1 : 0\n\tconst subsequenceScore = isSubsequence(b, a) ? 0.8 : 0\n\tconst anagramScore = anagramMatch(b, a) ? 0.7 : 0\n\tconst diceScore = diceCoefficient(a, b)\n\n\tconst maxLen = Math.max(a.length, b.length)\n\tconst levenshteinScore = maxLen ? 1 - levenshtein(a, b) / maxLen : 0\n\n\treturn Math.max(substringScore, subsequenceScore, anagramScore, diceScore, levenshteinScore)\n}\n\n/**\n * Safely coerce value to string if possible, or return empty string\n */\nconst safeString = (value: unknown): string => {\n\tif (value == null) return ''\n\treturn String(value)\n}\n\n/**\n * Apply a query condition to an item and return score\n */\nfunction applyQueryCondition<T extends Record<string, any>>(\n\titem: T,\n\tquery: QueryCondition,\n\tfuzzyThreshold: number = 0.3,\n): { valid: boolean; score: number } {\n\tlet field: string,\n\t\top: ComparisonOperator,\n\t\texpected: unknown,\n\t\tstrict = false\n\n\tif (Array.isArray(query)) {\n\t\t;[field, op, expected, strict = false] = query\n\t} else {\n\t\tfield = query.key\n\t\top = query.operator\n\t\texpected = query.value\n\t\tstrict = query.strict || false\n\t}\n\n\t// Skip empty filters for non-strict queries\n\tif (!strict && (expected === '' || expected == null || (isArray(expected) && expected.length === 0))) {\n\t\treturn { valid: true, score: 1 }\n\t}\n\n\tconst actual = getFieldValue(item, field)\n\n\t// FIXED: Properly handle strict mode\n\tif (strict) {\n\t\t// For strict mode, use exact equality comparison for all operators except 'any'\n\t\tif (op === 'any') {\n\t\t\t// Fuzzy search still applies with strict mode\n\t\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\t\treturn { valid: false, score: 0 }\n\t\t\t}\n\n\t\t\tconst score = computeFuzzyScore(actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: score >= fuzzyThreshold,\n\t\t\t\tscore: score >= fuzzyThreshold ? score : 0,\n\t\t\t}\n\t\t} else {\n\t\t\t// For all other operators in strict mode,\n\t\t\t// delegate to compareValues function but return precise scores\n\t\t\tconst matches = compareValues(op, actual, expected)\n\t\t\treturn {\n\t\t\t\tvalid: matches,\n\t\t\t\tscore: matches ? 1 : 0,\n\t\t\t}\n\t\t}\n\t} else if (op === 'any') {\n\t\t// Fuzzy search requires both values to be strings\n\t\tif (typeof actual !== 'string' || typeof expected !== 'string') {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\tconst score = computeFuzzyScore(actual, expected)\n\t\tif (score < fuzzyThreshold) {\n\t\t\treturn { valid: false, score: 0 }\n\t\t}\n\n\t\treturn { valid: true, score }\n\t} else {\n\t\t// For non-fuzzy operators, check condition\n\t\tconst matches = compareValues(op, actual, expected)\n\t\treturn {\n\t\t\tvalid: matches,\n\t\t\tscore: matches ? 1 : 0,\n\t\t}\n\t}\n}\n\n/**\n * Filter a Map of items given an array of query conditions.\n * For each query condition:\n * - If the expected value is empty/null/undefined, it is treated as a match.\n * - For non-fuzzy operators, the condition must strictly match.\n * - For the \"any\" operator, a fuzzy similarity score is computed.\n * Items with a fuzzy score below a given threshold (e.g., 0.3) are excluded.\n *\n * The overall item score is the average of the scores from all conditions.\n * The results are sorted in descending order of relevance.\n *\n * @param items - A Map containing items to filter.\n * @param queries - An array of query conditions to apply.\n * @param fuzzyThreshold - Minimum score required for fuzzy matches (default: 0.3)\n * @returns An array of items that match all query conditions, sorted by relevance.\n */\nexport function filterMapItems<T extends Record<string, any>>(\n\titems: Map<string, T>,\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// If no queries, return all items unsorted\n\tif (!queries.length) {\n\t\treturn Array.from(items.values())\n\t}\n\n\t// Score and filter each item\n\tconst scoredItems: ScoredItem<T>[] = []\n\n\tfor (const [_, item] of items.entries()) {\n\t\tlet totalScore = 0\n\t\tlet matchCount = 0\n\t\tlet valid = true\n\n\t\tfor (const query of queries) {\n\t\t\tconst result = applyQueryCondition(item, query, fuzzyThreshold)\n\n\t\t\tif (!result.valid) {\n\t\t\t\tvalid = false\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\ttotalScore += result.score\n\t\t\tmatchCount++\n\t\t}\n\n\t\tif (valid) {\n\t\t\tscoredItems.push({\n\t\t\t\titem,\n\t\t\t\tscore: matchCount > 0 ? totalScore / matchCount : 1,\n\t\t\t})\n\t\t}\n\t}\n\n\t// Sort by descending score\n\tscoredItems.sort((a, b) => b.score - a.score)\n\n\treturn scoredItems.map(x => x.item)\n}\n\n/**\n * Filter an array of items using query conditions\n */\nexport function filterArrayItems<T extends Record<string, any>>(\n\titems: T[],\n\tqueries: QueryCondition[] = [],\n\tfuzzyThreshold: number = 0.3,\n): T[] {\n\t// Create temporary map with numeric indices as keys\n\tconst map = new Map<string, T>()\n\titems.forEach((item, index) => map.set(String(index), item))\n\n\treturn filterMapItems(map, queries, fuzzyThreshold)\n}\n\n// Improved type guards for filter-directive.ts\n\n/**\n * Type guard for checking if a value is an array with better type inference\n * @param value Value to check\n * @returns True if the value is an array\n */\nexport function isArray<T = unknown>(value: unknown): value is Array<T> {\n\treturn Array.isArray(value)\n}\n\n/**\n * Type guard for checking if a value is a string\n * @param value Value to check\n * @returns True if the value is a string\n */\nexport function isString(value: unknown): value is string {\n\treturn typeof value === 'string'\n}\n\n/**\n * Type guard for checking if a value is a number\n * @param value Value to check\n * @returns True if the value is a number and not NaN\n */\nexport function isNumber(value: unknown): value is number {\n\treturn typeof value === 'number' && !isNaN(value)\n}\n\n/**\n * Type guard for checking if a value is a date\n * @param value Value to check\n * @returns True if the value is a valid Date object\n */\nexport function isDate(value: unknown): value is Date {\n\treturn value instanceof Date && !isNaN(value.getTime())\n}\n\n/**\n * Type guard for checking if a value is an iterable collection\n * @param value Value to check\n * @returns True if the value implements the iterable protocol\n */\nexport function isIterable<T = unknown>(value: unknown): value is Iterable<T> {\n\t// Must be non-null and of type 'object'\n\tif (value == null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\t// Check for Symbol.iterator method\n\treturn Symbol.iterator in Object(value) && typeof (value as any)[Symbol.iterator] === 'function'\n}\n\n/**\n * Type guard for checking if a value is a Map\n * @param value Value to check\n * @returns True if the value is a Map\n */\nexport function isMap<K = unknown, V = unknown>(value: unknown): value is Map<K, V> {\n\treturn value instanceof Map\n}\n\n/**\n * Type guard for checking if a value is a Set\n * @param value Value to check\n * @returns True if the value is a Set\n */\nexport function isSet<T = unknown>(value: unknown): value is Set<T> {\n\treturn value instanceof Set\n}\n\n/**\n * Type guard for checking if a value is a plain object (not an array, Map, etc.)\n * @param value Value to check\n * @returns True if the value is a plain object\n */\nexport function isPlainObject(value: unknown): value is Record<string, unknown> {\n\tif (value === null || typeof value !== 'object') {\n\t\treturn false\n\t}\n\n\tconst proto = Object.getPrototypeOf(value)\n\treturn proto === Object.prototype || proto === null\n}\n\n/**\n * Type guard for checking if a value is undefined or null\n * @param value Value to check\n * @returns True if the value is undefined or null\n */\nexport function isNil(value: unknown): value is undefined | null {\n\treturn value === undefined || value === null\n}\n\n/**\n * Improved type-safe comparison function that uses appropriate type guards\n * @param op Comparison operator\n * @param actual Actual value\n * @param expected Expected value\n * @returns Result of the comparison\n */\nexport function compareValues(op: ComparisonOperator, actual: unknown, expected: unknown): boolean {\n\t// Handle null/undefined cases\n\tif (isNil(actual) && isNil(expected)) return true\n\tif (isNil(actual) || isNil(expected)) {\n\t\t// For equality operators, null == null but null != non-null\n\t\tif (op === '==') return actual === expected\n\t\tif (op === '!=') return actual !== expected\n\t\t// Other operators should return false for null/undefined values\n\t\treturn false\n\t}\n\n\tswitch (op) {\n\t\tcase '==':\n\t\t\treturn actual === expected\n\t\tcase '!=':\n\t\t\treturn actual !== expected\n\t\tcase '>':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual > expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() > expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) > 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual < expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() < expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) < 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '>=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual >= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() >= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) >= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase '<=':\n\t\t\tif (isNumber(actual) && isNumber(expected)) {\n\t\t\t\treturn actual <= expected\n\t\t\t}\n\t\t\tif (isDate(actual) && isDate(expected)) {\n\t\t\t\treturn actual.getTime() <= expected.getTime()\n\t\t\t}\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.localeCompare(expected) <= 0\n\t\t\t}\n\t\t\treturn false\n\t\tcase 'includes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIncludes': {\n\t\t\tif (isString(actual)) {\n\t\t\t\treturn !actual.toLowerCase().includes(safeString(expected).toLowerCase())\n\t\t\t}\n\t\t\tif (isArray(actual)) {\n\t\t\t\treturn !actual.includes(expected as any)\n\t\t\t}\n\t\t\tif (isSet(actual)) {\n\t\t\t\treturn !actual.has(expected as any)\n\t\t\t}\n\t\t\tif (isMap(actual)) {\n\t\t\t\treturn !Array.from(actual.values()).includes(expected as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tcase 'startsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().startsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'endsWith': {\n\t\t\tif (isString(actual) && isString(expected)) {\n\t\t\t\treturn actual.toLowerCase().endsWith(expected.toLowerCase())\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'in': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn expected.has(actual as any) || Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn false\n\t\t}\n\t\tcase 'notIn': {\n\t\t\tif (isArray(expected)) {\n\t\t\t\treturn !expected.includes(actual as any)\n\t\t\t}\n\t\t\tif (isSet(expected)) {\n\t\t\t\treturn !expected.has(actual as any)\n\t\t\t}\n\t\t\tif (isMap(expected)) {\n\t\t\t\treturn !expected.has(actual as any) && !Array.from(expected.values()).includes(actual as any)\n\t\t\t}\n\t\t\treturn true\n\t\t}\n\t\tdefault: {\n\t\t\tconsole.warn(`Operator \"${op}\" is not supported in comparison.`)\n\t\t\treturn false\n\t\t}\n\t}\n}\n\n// Export a simpler alias for filterMapItems\nexport const filterMap = filterMapItems\n\n// Export an alias for filterArrayItems\nexport const filterArray = filterArrayItems\n","// src/store/selectors.ts\nimport { Observable, combineLatest, distinctUntilChanged, map, share, shareReplay } from 'rxjs'\nimport { IStore, ICollectionStore } from './types'\n\n/**\n * Deep equality comparison for maps and complex objects\n * More efficient than JSON.stringify for large objects\n */\nfunction deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true\n\n\tif (a instanceof Map && b instanceof Map) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const [key, value] of a) {\n\t\t\tif (!b.has(key) || !deepEqual(value, b.get(key))) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (a instanceof Set && b instanceof Set) {\n\t\tif (a.size !== b.size) return false\n\t\tfor (const item of a) {\n\t\t\tif (!b.has(item)) return false\n\t\t}\n\t\treturn true\n\t}\n\n\tif (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null) {\n\t\tconst keysA = Object.keys(a)\n\t\tconst keysB = Object.keys(b)\n\n\t\tif (keysA.length !== keysB.length) return false\n\n\t\tfor (const key of keysA) {\n\t\t\t// @ts-ignore: Index signature\n\t\t\tif (!deepEqual(a[key], b[key])) return false\n\t\t}\n\n\t\treturn true\n\t}\n\n\treturn false\n}\n\n/**\n * Creates a selector that derives a value from store state\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector for collection stores that derives a value from the collection\n *\n * @param store The collection store to observe\n * @param selectorFn Function that transforms the collection\n * @returns An observable of the selected state that only emits when the derived value changes\n */\nexport function createCollectionSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tselectorFn: (state: Map<string, T>) => R,\n): Observable<R> {\n\treturn store.$.pipe(map(selectorFn), distinctUntilChanged<R>(deepEqual), shareReplay(1))\n}\n\n/**\n * Creates a selector that returns all items from a collection as an array\n *\n * @param store The collection store\n * @returns An observable of all items as an array\n */\nexport function createItemsSelector<T>(store: ICollectionStore<T>): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.values()))\n}\n\n/**\n * Creates a selector that retrieves a single item from a collection\n *\n * @param store The collection store\n * @param itemKey The key of the item to select\n * @returns An observable of the selected item that emits when the item changes\n */\nexport function createItemSelector<T>(store: ICollectionStore<T>, itemKey: string): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => collection.get(itemKey))\n}\n\n/**\n * Creates a compound selector that depends on multiple other selectors\n *\n * @param selectors Array of source selectors\n * @param combinerFn Function that combines all selector results\n * @returns An observable of the combined result\n */\nexport function createCompoundSelector<T extends unknown[], R>(\n\tselectors: { [K in keyof T]: Observable<T[K]> },\n\tcombinerFn: (...values: T) => R,\n): Observable<R> {\n\treturn combineLatest(selectors).pipe(\n\t\tmap(values => combinerFn(...(values as T))),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshareReplay(1),\n\t)\n}\n\n/**\n * Creates a selector that returns all keys from a collection\n */\nexport function createKeysSelector<T>(store: ICollectionStore<T>): Observable<string[]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.keys()))\n}\n\n/**\n * Creates a selector that returns entries (key-value pairs) from a collection\n */\nexport function createEntriesSelector<T>(store: ICollectionStore<T>): Observable<[string, T][]> {\n\treturn createCollectionSelector(store, collection => Array.from(collection.entries()))\n}\n\n/**\n * Creates a selector that sorts collection items\n */\nexport function createSortSelector<T>(store: ICollectionStore<T>, compareFn: (a: T, b: T) => number): Observable<T[]> {\n\treturn createCollectionSelector(store, collection => {\n\t\treturn Array.from(collection.values()).sort(compareFn)\n\t})\n}\n\n/**\n * Creates a selector that finds the first item matching a predicate\n */\nexport function createFindSelector<T>(\n\tstore: ICollectionStore<T>,\n\tpredicate: (item: T, key: string) => boolean,\n): Observable<T | undefined> {\n\treturn createCollectionSelector(store, collection => {\n\t\tfor (const [key, item] of collection.entries()) {\n\t\t\tif (predicate(item, key)) {\n\t\t\t\treturn item\n\t\t\t}\n\t\t}\n\t\treturn undefined\n\t})\n}\n\n/**\n * Creates a selector that filters items from a collection - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Function that returns true for items to include\n * @returns An observable of filtered items as an array\n */\nexport function createFilterSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn: (item: T, key: string) => boolean,\n): Observable<T[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries())\n\t\t\t.filter(([key, item]) => filterFn(item, key))\n\t\t\t.map(([_, item]) => item),\n\t)\n}\n\n/**\n * Creates a selector that maps collection values through a transform function - OPTIMIZED\n */\nexport function createMapSelector<T, R>(\n\tstore: ICollectionStore<T>,\n\tmapFn: (item: T, key: string) => R,\n): Observable<R[]> {\n\treturn createCollectionSelector(store, collection =>\n\t\tArray.from(collection.entries()).map(([key, item]) => mapFn(item, key)),\n\t)\n}\n\n/**\n * Creates a selector that counts items in a collection, optionally filtered - OPTIMIZED\n *\n * @param store The collection store\n * @param filterFn Optional function to filter which items to count\n * @returns An observable of the count\n */\nexport function createCountSelector<T>(\n\tstore: ICollectionStore<T>,\n\tfilterFn?: (item: T, key: string) => boolean,\n): Observable<number> {\n\treturn createCollectionSelector(store, collection => {\n\t\tif (!filterFn) return collection.size\n\n\t\treturn Array.from(collection.entries()).filter(([key, item]) => filterFn(item, key)).length\n\t})\n}\n\n/**\n * Optimized RxJS Pipeline - use share with reset on refCount zero for better memory management\n * in scenarios where selector subscriptions come and go\n *\n * @param store The store to observe\n * @param selectorFn Function that transforms the state\n * @returns An observable of the selected state with improved memory management\n */\nexport function createOptimizedSelector<T, R>(store: IStore<T>, selectorFn: (state: T) => R): Observable<R> {\n\treturn store.$.pipe(\n\t\tmap(selectorFn),\n\t\tdistinctUntilChanged<R>(deepEqual),\n\t\tshare({\n\t\t\tresetOnRefCountZero: true,\n\t\t\tresetOnError: false,\n\t\t\tresetOnComplete: false,\n\t\t}),\n\t)\n}\n","// src/store/selector-hook.ts - Improved memory management\nimport { property as litProperty } from 'lit/decorators.js'\nimport { Observable, Subject, Subscription } from 'rxjs'\nimport { takeUntil } from 'rxjs/operators'\nimport { createCollectionSelector, createSelector } from './selectors'\nimport { ICollectionStore, IStore } from './types'\n\n/**\n * Symbol used for storing cleanup resources\n * Using a Symbol prevents name collisions with component properties\n */\nconst CLEANUP_SUBJECT = Symbol('selectorCleanup')\nconst SUBSCRIPTIONS = Symbol('selectorSubscriptions')\nconst INITIALIZED = Symbol('selectorInitialized')\n\n/**\n * Component lifecycle interface\n */\ninterface ComponentWithLifecycle {\n\t// Lifecycle hooks\n\tisConnected: boolean\n\tdisconnectedCallback?: () => void\n\tconnectedCallback?: () => void\n\trequestUpdate?: () => void\n\n\t// Internal properties using symbols to avoid name collisions\n\t[CLEANUP_SUBJECT]?: Subject<void>\n\t[SUBSCRIPTIONS]?: Map<string, Subscription>\n\t[INITIALIZED]?: Set<string>\n\n\t// Value storage\n\t[key: string]: any\n}\n\n/**\n * Property descriptor interface\n */\ntype PropertyDescriptor<T> = {\n\tget?: () => T\n\tset?: (value: T) => void\n\tvalue?: T\n\tconfigurable?: boolean\n\tenumerable?: boolean\n\twritable?: boolean\n}\n\n/**\n * Options for selecting from a store\n */\ninterface SelectOptions {\n\t/** If true, will wait for selector to emit a non-null value before calling connectedCallback */\n\trequired?: boolean\n\n\t/** If true, will only update the component and not set the property value */\n\tupdateOnly?: boolean\n\n\t/** If true, will use structuredClone to deeply clone values (prevents mutations) */\n\tdeepClone?: boolean\n\n\t/** Custom equality function to determine when to update */\n\tequals?: (a: any, b: any) => boolean\n\n\t/** Debug mode - logs selector activity */\n\tdebug?: boolean\n}\n\n/**\n * Type guard to check if a store is a collection store\n */\nfunction isCollectionStore<T>(store: IStore<any> | ICollectionStore<T>): store is ICollectionStore<T> {\n\treturn 'set' in store && typeof store.set === 'function' && store.value instanceof Map\n}\n\n/**\n * Ensures the cleanup resources exist on the component\n */\nfunction ensureCleanupResources(component: ComponentWithLifecycle): void {\n\tif (!component[CLEANUP_SUBJECT] || component[CLEANUP_SUBJECT].closed) {\n\t\tcomponent[CLEANUP_SUBJECT] = new Subject<void>()\n\t}\n\n\tif (!component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS] = new Map()\n\t}\n\n\tif (!component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED] = new Set()\n\t}\n}\n\n/**\n * Cleans up all selector resources\n */\nfunction cleanupSelectorResources(component: ComponentWithLifecycle): void {\n\tif (component[CLEANUP_SUBJECT]) {\n\t\tcomponent[CLEANUP_SUBJECT].next()\n\t\tcomponent[CLEANUP_SUBJECT].complete()\n\t\tcomponent[CLEANUP_SUBJECT] = undefined\n\t}\n\n\tif (component[SUBSCRIPTIONS]) {\n\t\tcomponent[SUBSCRIPTIONS].forEach(sub => sub.unsubscribe())\n\t\tcomponent[SUBSCRIPTIONS].clear()\n\t\tcomponent[SUBSCRIPTIONS] = undefined\n\t}\n\n\tif (component[INITIALIZED]) {\n\t\tcomponent[INITIALIZED].clear()\n\t\tcomponent[INITIALIZED] = undefined\n\t}\n}\n\n/**\n * Selector decorator that connects a component property to a store selector\n * with improved memory management\n *\n * @param store The store to select from\n * @param selectorFn Optional function to transform the store state\n * @param options Additional options for the selector\n */\nexport function select<T, R>(\n\tstore: IStore<T> | ICollectionStore<T>,\n\tselectorFn: (state: any) => R = (state: R) => state,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<R>) {\n\t\t// Register as a Lit property\n\t\tlitProperty({ attribute: false, type: Object })(proto, propName)\n\n\t\t// Store original lifecycle methods\n\t\tconst originalConnectedCallback = proto.connectedCallback\n\t\tconst originalDisconnectedCallback = proto.disconnectedCallback\n\n\t\t// Override connectedCallback to set up subscription\n\t\tproto.connectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Initialize cleanup resources\n\t\t\tensureCleanupResources(this)\n\n\t\t\t// Create the appropriate selector\n\t\t\tconst selector: Observable<R> = isCollectionStore(store)\n\t\t\t\t? createCollectionSelector(store, selectorFn)\n\t\t\t\t: createSelector(store as IStore<T>, selectorFn)\n\n\t\t\t// Call original connectedCallback immediately if not waiting for data\n\t\t\tif (!options.required && !this[INITIALIZED]!.has(propName)) {\n\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t}\n\n\t\t\t// Clean up any existing subscription\n\t\t\tif (this[SUBSCRIPTIONS]!.has(propName)) {\n\t\t\t\tthis[SUBSCRIPTIONS]!.get(propName)?.unsubscribe()\n\t\t\t\tthis[SUBSCRIPTIONS]!.delete(propName)\n\t\t\t}\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Setting up subscription for ${propName}`)\n\t\t\t}\n\n\t\t\t// Create new subscription with better error handling\n\t\t\tconst subscription = selector.pipe(takeUntil(this[CLEANUP_SUBJECT]!)).subscribe({\n\t\t\t\tnext: (value: R) => {\n\t\t\t\t\t// Handle value updates\n\t\t\t\t\tconst newValue = options.deepClone ? structuredClone(value) : value\n\n\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\tconsole.debug(`[select] New value for ${propName}:`, newValue)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (!options.updateOnly) {\n\t\t\t\t\t\tthis[propName] = newValue\n\t\t\t\t\t}\n\n\t\t\t\t\tthis.requestUpdate?.()\n\n\t\t\t\t\t// If required and not initialized, call connectedCallback when we get a value\n\t\t\t\t\tif (options.required && !this[INITIALIZED]!.has(propName) && newValue !== null && newValue !== undefined) {\n\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\tconsole.debug(`[select] Calling delayed connectedCallback for ${propName}`)\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\toriginalConnectedCallback?.call(this)\n\t\t\t\t\t\tthis[INITIALIZED]!.add(propName)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\terror: (err: Error) => {\n\t\t\t\t\tconsole.error(`Error in selector subscription for ${propName}:`, err)\n\t\t\t\t\t// Resubscribe on error to prevent component from becoming unresponsive\n\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t// Small delay to prevent immediate resubscription\n\t\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\t\tif (this.isConnected) {\n\t\t\t\t\t\t\t\tif (options.debug) {\n\t\t\t\t\t\t\t\t\tconsole.debug(`[select] Resubscribing after error for ${propName}`)\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tthis.connectedCallback?.()\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}, 1000)\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t})\n\n\t\t\t// Store the subscription for cleanup\n\t\t\tthis[SUBSCRIPTIONS]!.set(propName, subscription)\n\t\t}\n\n\t\t// Override disconnectedCallback to clean up subscriptions\n\t\tproto.disconnectedCallback = function (this: ComponentWithLifecycle) {\n\t\t\t// Call original disconnectedCallback\n\t\t\toriginalDisconnectedCallback?.call(this)\n\n\t\t\t// Debug log if needed\n\t\t\tif (options.debug) {\n\t\t\t\tconsole.debug(`[select] Cleaning up resources in disconnectedCallback`)\n\t\t\t}\n\n\t\t\t// Clean up all subscription resources\n\t\t\tcleanupSelectorResources(this)\n\t\t}\n\t}\n}\n\n/**\n * Creates a selector decorator that selects a specific item from a collection store\n * with improved memory management\n *\n * @param store The collection store\n * @param keyGetter Function that returns the key to select\n * @param options Additional options\n */\nexport function selectItem<T>(\n\tstore: ICollectionStore<T>,\n\tkeyGetter: (component: any) => string,\n\toptions: SelectOptions = {},\n) {\n\treturn function (proto: Record<string, any>, propName: string, _descriptor?: PropertyDescriptor<T | undefined>) {\n\t\tselect(\n\t\t\tstore,\n\t\t\tfunction (state) {\n\t\t\t\t// This will be evaluated during subscription, when 'this' is available\n\t\t\t\tconst itemKey = keyGetter(this)\n\t\t\t\treturn itemKey ? state.get(itemKey) : undefined\n\t\t\t},\n\t\t\toptions,\n\t\t)(proto, propName)\n\t}\n}\n"],"names":["createObjectStore","initialData","storage","key","value","Array","isArray","Map","Set","Date","RegExp","Object","getPrototypeOf","prototype","store","SchmancyStoreObject","getInstance","obj","keys","length","set","createArrayStore","SchmancyArrayStore","replace","createContext","includes","SchmancyCollectionStore","size","err","createArrayContext","createTestArrayContext","getFieldValue","item","path","parts","split","part","getBigrams","s","bigrams","i","push","substring","toLowerCase","computeFuzzyScore","actual","expected","a","trim","b","substringScore","subsequenceScore","sub","str","j","anagramScore","query","target","countChars","reduce","acc","char","queryCount","targetCount","every","diceScore","s1","s2","bigrams1","bigrams2","intersection","used","fill","bigram","maxLen","Math","max","levenshteinScore","matrix","map","_","charAt","min","safeString","String","applyQueryCondition","fuzzyThreshold","field","op","strict","operator","valid","score","matches","compareValues","t","filterMapItems","items","queries","from","values","scoredItems","entries","totalScore","matchCount","result","sort","x","filterArrayItems","forEach","index","isString","isNumber","isNaN","isDate","getTime","isIterable","Symbol","iterator","isMap","isSet","isPlainObject","proto","isNil","localeCompare","has","startsWith","endsWith","filterMap","filterArray","deepEqual","get","keysA","keysB","createSelector","selectorFn","$","pipe","distinctUntilChanged","shareReplay","createCollectionSelector","createItemsSelector","collection","createItemSelector","itemKey","createCompoundSelector","selectors","combinerFn","combineLatest","createKeysSelector","createEntriesSelector","createSortSelector","compareFn","createFindSelector","predicate","createFilterSelector","filterFn","filter","createMapSelector","mapFn","createCountSelector","createOptimizedSelector","share","resetOnRefCountZero","resetOnError","resetOnComplete","CLEANUP_SUBJECT","SUBSCRIPTIONS","INITIALIZED","select","state","options","propName","_descriptor","litProperty","attribute","type","originalConnectedCallback","connectedCallback","originalDisconnectedCallback","disconnectedCallback","component","this","closed","Subject","selector","required","call","add","unsubscribe","delete","debug","subscription","takeUntil","subscribe","next","newValue","deepClone","structuredClone","updateOnly","requestUpdate","error","isConnected","setTimeout","complete","clear","selectItem","keyGetter"],"mappings":";;;;AAkDA,SAASA,EACRC,GACAC,GACAC,GAEI;AAAA,MAAA;AAEa,IAAZD,MAAY,gBAELA,IAAA,YAzBUE,IA6BFH,OA3BT,QACO,OAAVG,KAAU,YAChBC,MAAMC,QAAQF,CACbA,KAAAA,aAAiBG,OACjBH,aAAiBI,OACjBJ,aAAiBK,QACjBL,aAAiBM,UACnBC,OAAOC,eAAeR,CAAAA,MAAWO,OAAOE,eAsBzBZ,IAAA,EAAKA,GAAAA,EAAAA;AAIpB,UAAMa,IAAQC,EAAoBC,YAAed,GAASC,GAAKF,CAOxD;AAAA,WAlEcgB,QAAAA,IA8DHH,EAAMV,UA7DN,YAAYa,MAAQ,QAGhCN,OAAOO,KAAKD,CAAKE,EAAAA,WAAW,KA2DjCL,EAAMM,IAAI,EAAKnB,GAAAA,EAAAA,CAAAA,GAGTa;AAAAA,UAUA;AAAA,WANeC,EAAoBC,YACzC,UACA,GAAGb,CACHF,aAAAA,CAAAA;AAAAA,EAGM;AA5ET,MAAuBgB,GAwBAb;AAsDvB;AAqCA,SAASiB,EACRpB,GACAC,GACAC,GAEI;AAAA,MAAA;AAEH,UAAMW,IAAQQ,EAAmBN,YAAYd,GAASC,GAAKF,CAQpD;AAAA,WALFa,EAAMV,MAAMe,UAEhBL,EAAMS,QAAQ,CAAA,GAAItB,CAGZa,CAAAA,GAAAA;AAAAA,UAUA;AAAA,WANeQ,EAAmBN,YACxC,UACA,GAAGb,CACH,aAAA,CAAA,GAAIF;EAGE;AAET;AA8CgB,SAAAuB,EACfvB,GACAC,GACAC,GAKI;AAAA,MAAA;AAeC,WAbAF,KAAAA,SAIFA,IADGE,EAAIsB,SAAS,YAAA,KAAiBtB,EAAIsB,SAAS,KAAA,wBAC5BlB,QACRJ,EAAIsB,SAAS,OAAYtB,KAAAA,EAAIsB,SAAS,MAAA,IAClC,CAEA,IAAA,CAAC,IAKMxB,aAxMAM,MAwEzB,SACCN,GACAC,GACAC,GAAAA;AAEI,UAEH;AAAA,cAAMW,IAAQY,EAAwBV,YAAYd,GAASC,GAAKF,CAAAA;AAQzD,eALFa,EAAMV,MAAMuB,QAEhBb,EAAMS,QAAQ,IAAIhB,IAAIN,CAAAA,CAAAA,GAGhBa;AAAAA,cACCc;AASD,eANeF,EAAwBV,YAC7C,UACA,GAAGb,CACH,aAAA,IAAII,IAAIN,CAAAA,CAAAA;AAAAA,MAGF;AAAA,IAET,EAsGqCA,GAAaC,GAASC,CAAAA,IAnM3D,SAAoBC,GAAAA;AACZ,aAAAC,MAAMC,QAAQF,CACtB;AAAA,IAAA,EAkM0BH,CAAAA,IAChBoB,EAAsBpB,GAAaC,GAASC,CAAAA,IAE5CH,EAD0B,OAAhBC,KAAgB,WACHA,IAIA,EAAEG,OAAOH,KAJ2BC,GAASC,CAAAA;AAAAA,UAWrE;AAAA,WAAAH,EACiB,OAAhBC,KAAgB,YAAYA,MAAgB,OAAO,EAAA,GAAKA,EAAgB,IAAA,EAAEG,OAAOH,EAAAA,GACxF,UACA,sBAAsBE,CACvB,EAAA;AAAA,EAAA;AAEF;AASO,SAAS0B,GACf5B,IAAmB,CACnBE,GAAAA,GACAD,IAAuB,SAAA;AAEnB,MACI;AAAA,WAAAsB,EAAiBvB,GAAaC,GAASC;UACtCyB;AAGR,WAAOP,EAAoBpB,GAAa,UAAU,GAAGE,CAAAA,WAAAA;AAAAA,EAAc;AAErE;AAQO,SAAS2B,GACf7B,IAAmB,CACnBE,GAAAA,IAAc,cAEV;AAAA,MAAA;AACI,WAAAqB,EAAiBvB,GAAa,UAAUE;UACvCyB;AAGR,WAAOP,EAAoBpB,GAAa,UAAU,GAAGE,CAAwB,qBAAA;AAAA,EAAA;AAE/E;ACzOa,MAAA4B,IAAgB,CAAUC,GAA2BC,MAAAA;AAC7D,MAACA,CAAAA,EAAa,QAAAD;AAEZ,QAAAE,IAAQD,EAAKE,MAAM,GAAA;AACzB,MAAI/B,IAAa4B;AAEjB,aAAWI,KAAQF,GAAO;AACrB,QAAA9B,KAAS,KAAa;AAC1BA,IAAAA,IAAQA,EAAMgC,CAAAA;AAAAA,EAAI;AAGZ,SAAAhC;AAAA,GA+EFiC,IAAcC,CAAAA,MAAAA;AACnB,MAAKA,CAAAA,KAAKA,EAAEnB,SAAS,UAAU,CAAA;AAE/B,QAAMoB,IAAoB,CAC1B;AAAA,WAASC,IAAI,GAAGA,IAAIF,EAAEnB,SAAS,GAAGqB,IACzBD,CAAAA,EAAAE,KAAKH,EAAEI,UAAUF,GAAGA,IAAI,CAAA,EAAGG,YAE7B,CAAA;AAAA,SAAAJ;AAAA,GAwCFK,IAAoB,CAACC,GAAgBC,MAAAA;AAC1C,MAAKD,CAAAA,KAAAA,CAAWC,EAAiB,QAAA;AAEjC,QAAMC,IAAIF,EAAOF,YAAcK,EAAAA,KAAAA,GACzBC,IAAIH,EAASH,YAAcK,EAAAA,KAAAA;AAE7B,MAAAD,MAAME,EAAU,QAAA;AAEpB,QAAMC,IAAiBH,EAAEtB,SAASwB,CAAK,IAAA,IAAI,GACrCE,KAjGgBC,CAAAA,GAAaC;AAC/B,QAACD,CAAAA,EAAY,QAAA;AACb,QAACC,CAAAA,EAAY,QAAA;AAEb,QAAAb,IAAI,GACPc,IAAI;AACL,WAAOd,IAAIY,EAAIjC,UAAUmC,IAAID,EAAIlC,SAC5BiC,CAAAA,EAAIZ,CAAGG,EAAAA,YAAAA,MAAkBU,EAAIC,CAAAA,EAAGX,YAAeH,KAAAA,KACnDc;AAED,WAAOd,MAAMY,EAAIjC;AAAAA,EAAA,GAuFsB8B,GAAGF,CAAK,IAAA,MAAM,GAC/CQ,KAjFeC,CAAAA,GAAeC,MAChC;AAAA,QAAA,CAACD,EAAc,QAAA;AACf,QAACC,CAAAA,EAAe,QAAA;AAEd,UAAAC,IAAcpB,CAAAA,MACnBA,EACEK,YACAR,EAAAA,MAAM,EACNwB,EAAAA,OACA,CAACC,GAAKC,OACLD,EAAIC,CAAAA,KAASD,EAAIC,CAAAA,KAAS,KAAK,GACxBD,IAER,CAAA,CAGGE,GAAAA,IAAaJ,EAAWF,CAAAA,GACxBO,IAAcL,EAAWD;AAC/B,WAAO9C,OAAOO,KAAK4C,CAAAA,EAAYE,MAAMH,CAAAA,OAASE,EAAYF,CAAAA,KAAS,MAAMC,EAAWD,CAAK,CAAA;AAAA,EAAA,GA+DvDZ,GAAGF,CAAK,IAAA,MAAM,GAC1CkB,KA5CkBC,CAAAA,GAAYC,MAChC;AAAA,QAAA,CAACD,KAAOC,CAAAA,KAAMD,EAAG/C,SAAS,KAAKgD,EAAGhD,SAAS,EAAU,QAAA;AAEnD,UAAAiD,IAAW/B,EAAW6B,CACtBG,GAAAA,IAAWhC,EAAW8B,CAAAA;AAE5B,QAAIC,EAASjD,WAAW,KAAKkD,EAASlD,WAAW,EAAU,QAAA;AAE3D,QAAImD,IAAe;AACnB,UAAMC,IAAO,IAAIlE,MAAMgE,EAASlD,MAAQqD,EAAAA,KAAAA,EAExC;AAAA,eAAWC,KAAUL,EACpB,UAAS5B,IAAI,GAAGA,IAAI6B,EAASlD,QAAQqB,IACpC,KAAK+B,CAAAA,EAAK/B,CAAM6B,KAAAA,EAAS7B,OAAOiC,GAAQ;AACvCH,MAAAA,KACAC,EAAK/B,CAAK,IAAA;AACV;AAAA,IAAA;AAKH,WAAQ,IAAI8B,KAAiBF,EAASjD,SAASkD,EAASlD;AAAAA,EAAA,GAuBtB4B,GAAGE,CAAAA,GAE/ByB,IAASC,KAAKC,IAAI7B,EAAE5B,QAAQ8B,EAAE9B,MAC9B0D,GAAAA,IAAmBH,IAAS,MAtId3B,GAAWE,MAAAA;AAC3B,QAAAF,MAAME,EAAU,QAAA;AAEpB,UAAM6B,IAAqBzE,MAAM4C,EAAE9B,SAAS,CAC1CqD,EAAAA,KAAK,MACLO,IAAI,CAACC,GAAGxC,MAAM,CAACA,CAAAA,CAAAA;AAGjB,aAASc,IAAI,GAAGA,KAAKP,EAAE5B,QAAQmC,IACvBwB,CAAAA,EAAA,CAAA,EAAGxB,CAAKA,IAAAA;AAGhB,aAASd,IAAI,GAAGA,KAAKS,EAAE9B,QAAQqB,IAC9B,UAASc,IAAI,GAAGA,KAAKP,EAAE5B,QAAQmC,IAC1BL,CAAAA,EAAEgC,OAAOzC,IAAI,CAAOO,MAAAA,EAAEkC,OAAO3B,IAAI,CAC7BwB,IAAAA,EAAAtC,CAAGc,EAAAA,CAAAA,IAAKwB,EAAOtC,IAAI,CAAA,EAAGc,IAAI,CAAA,IAEjCwB,EAAOtC,CAAAA,EAAGc,CAAKqB,IAAAA,KAAKO,IACnBJ,EAAOtC,IAAI,CAAA,EAAGc,CAAK,IAAA,GACnBwB,EAAOtC,CAAGc,EAAAA,IAAI,CAAK,IAAA,GACnBwB,EAAOtC,IAAI,CAAGc,EAAAA,IAAI,CAAK,IAAA,CAAA;AAK3B,WAAOwB,EAAO7B,EAAE9B,MAAAA,EAAQ4B,EAAE5B,MAAM;AAAA,EAAA,GA6GkB4B,GAAGE,CAAKyB,IAAAA,IAAS;AAEnE,SAAOC,KAAKC,IAAI1B,GAAgBC,GAAkBI,GAAcU,GAAWY;AAAgB,GAMtFM,IAAc/E,CAAAA,MACfA,KAAS,OAAa,KACnBgF,OAAOhF,CAAAA;AAMf,SAASiF,EACRrD,GACAwB,GACA8B,IAAyB,KAAA;AAErB,MAAAC,GACHC,GACA1C,GACA2C,IAAAA;AAYG,MAVApF,MAAMC,QAAQkD,CACf+B,IAAAA,CAAAA,GAAOC,GAAI1C,GAAU2C,IAAS,EAAA,IAASjC,KAEzC+B,IAAQ/B,EAAMrD,KACdqF,IAAKhC,EAAMkC,UACX5C,IAAWU,EAAMpD,OACjBqF,IAASjC,EAAMiC,UAAAA,KAIXA,CAAAA,MAAW3C,MAAa,MAAMA,KAAY,QAASxC,EAAQwC,CAAAA,KAAaA,EAAS3B,WAAW,GAChG,QAAO,EAAEwE,OAAAA,IAAaC,OAAO,EAGxB;AAAA,QAAA/C,IAASd,EAAcC,GAAMuD,CAGnC;AAAA,MAAIE,GAAQ;AAEX,QAAID,MAAO,OAAO;AAEjB,UAAsB,OAAX3C,KAAW,YAAgC,OAAbC,KAAa,SACrD,QAAO,EAAE6C,OAAO,IAAOC,OAAO,EAAA;AAGzB,YAAAA,IAAQhD,EAAkBC,GAAQC,CACjC;AAAA,aAAA,EACN6C,OAAOC,KAASN,GAChBM,OAAOA,KAASN,IAAiBM,IAAQ,EAAA;AAAA,IAC1C;AACM;AAGN,YAAMC,IAAUC,EAAcN,GAAI3C,GAAQC,CAAAA;AACnC,aAAA,EACN6C,OAAOE,GACPD,OAAOC,IAAU,IAAI,EACtB;AAAA,IAAA;AAAA,EACD;AACD,MAAWL,MAAO,OAAO;AAExB,eAAW3C,KAAW,YAAgC,OAAbC,KAAa,SACrD,QAAO,EAAE6C,OAAAA,IAAcC,OAAO,EAGzB;AAAA,UAAAA,IAAQhD,EAAkBC,GAAQC,CAAAA;AACxC,WAAI8C,IAAQN,IACJ,EAAEK,OAAAA,IAAcC,OAAO,EAGxB,IAAA,EAAED,OAAO,IAAMC,OAAMG,EAAA;AAAA,EAAA;AACtB;AAEN,UAAMF,IAAUC,EAAcN,GAAI3C,GAAQC,CAAAA;AACnC,WAAA,EACN6C,OAAOE,GACPD,OAAOC,IAAU,IAAI,EAAA;AAAA,EACtB;AAEF;AAkBO,SAASG,EACfC,GACAC,IAA4B,CAC5BZ,GAAAA,IAAyB,KAGrB;AAAA,MAAA,CAACY,EAAQ/E,OACZ,QAAOd,MAAM8F,KAAKF,EAAMG,OAIzB,CAAA;AAAA,QAAMC,IAA+B,CAErC;AAAA,aAAYrB,CAAAA,GAAGhD,CAASiE,KAAAA,EAAMK,QAAW,GAAA;AACxC,QAAIC,IAAa,GACbC,IAAa,GACbb,IAAAA;AAEJ,eAAWnC,KAAS0C,GAAS;AAC5B,YAAMO,IAASpB,EAAoBrD,GAAMwB,GAAO8B,CAE5C;AAAA,UAAA,CAACmB,EAAOd,OAAO;AACVA,QAAAA,IAAA;AACR;AAAA,MAAA;AAGDY,MAAAA,KAAcE,EAAOb,OACrBY;AAAAA,IAAA;AAGGb,IAAAA,KACHU,EAAY5D,KAAK,EAChBT,MAAAA,GACA4D,OAAOY,IAAa,IAAID,IAAaC,IAAa,EAAA,CAAA;AAAA,EAEpD;AAMD,SAFAH,EAAYK,KAAK,CAAC3D,GAAGE,MAAMA,EAAE2C,QAAQ7C,EAAE6C,QAEhCS,EAAYtB,IAAS4B,CAAAA,MAAAA,EAAE3E,IAC/B;AAAA;AAKO,SAAS4E,EACfX,GACAC,IAA4B,CAC5BZ,GAAAA,IAAyB,KAGnB;AAAA,QAAAP,wBAAUxE;AAGT,SAFD0F,EAAAY,QAAQ,CAAC7E,GAAM8E,MAAU/B,EAAI3D,IAAIgE,OAAO0B,CAAAA,GAAQ9E,CAE/CgE,CAAAA,GAAAA,EAAejB,GAAKmB,GAASZ,CAAAA;AACrC;AASO,SAAShF,EAAqBF,GAAAA;AAC7B,SAAAC,MAAMC,QAAQF,CAAAA;AACtB;AAOO,SAAS2G,EAAS3G,GAAAA;AACxB,SAAwB,OAAVA,KAAU;AACzB;AAOO,SAAS4G,EAAS5G,GACxB;AAAA,SAAcA,OAAAA,KAAU,YAAVA,CAAuB6G,MAAM7G,CAAAA;AAC5C;AAOO,SAAS8G,EAAO9G,GAAAA;AACtB,SAAOA,aAAiBK,QAAAA,CAASwG,MAAM7G,EAAM+G,QAC9C,CAAA;AAAA;AAOO,SAASC,GAAwBhH,GAEvC;AAAA,SAAIA,KAAS,QAAeA,OAAAA,KAAU,YAK/BiH,OAAOC,YAAY3G,OAAOP,CAAqD,KAAA,OAAnCA,EAAciH,OAAOC,QACzE,KADuF;AACvF;AAOO,SAASC,EAAgCnH,GAC/C;AAAA,SAAOA,aAAiBG;AACzB;AAOO,SAASiH,EAAmBpH,GAClC;AAAA,SAAOA,aAAiBI;AACzB;AAOO,SAASiH,GAAcrH,GAAAA;AAC7B,MAAIA,MAAU,QAAyB,OAAVA,KAAU,SAC/B,QAAA;AAGF,QAAAsH,IAAQ/G,OAAOC,eAAeR,CAC7B;AAAA,SAAAsH,MAAU/G,OAAOE,aAAa6G,MAAU;AAChD;AAOO,SAASC,EAAMvH,GAAAA;AACd,SAAAA,KAAAA;AACR;AASgB,SAAA0F,EAAcN,GAAwB3C,GAAiBC,GAAAA;AAEtE,MAAI6E,EAAM9E,CAAW8E,KAAAA,EAAM7E,GAAkB,QAAA;AAC7C,MAAI6E,EAAM9E,CAAW8E,KAAAA,EAAM7E,CAEtB,EAAA,QAAA0C,MAAO,OAAa3C,MAAWC,IAC/B0C,MAAO,QAAa3C,MAAWC;AAKpC,UAAQ0C,GACP;AAAA,IAAA,KAAK;AACJ,aAAO3C,MAAWC;AAAAA,IACnB,KAAK;AACJ,aAAOD,MAAWC;AAAAA,IACnB,KAAK;AACJ,aAAIkE,EAASnE,CAAAA,KAAWmE,EAASlE,CAAAA,IACzBD,IAASC,IAEboE,EAAOrE,CAAAA,KAAWqE,EAAOpE,CAAAA,IACrBD,EAAOsE,QAAAA,IAAYrE,EAASqE,QAAAA,IAAAA,EAAAA,CAEhCJ,EAASlE,CAAWkE,KAAAA,CAAAA,EAASjE,CACzBD,MAAAA,EAAO+E,cAAc9E,CAAAA,IAAY;AAAA,IAG1C,KAAK;AACJ,aAAIkE,EAASnE,CAAAA,KAAWmE,EAASlE,CAAAA,IACzBD,IAASC,IAEboE,EAAOrE,CAAWqE,KAAAA,EAAOpE,CACrBD,IAAAA,EAAOsE,QAAYrE,IAAAA,EAASqE,QAEhCJ,IAAAA,EAAAA,CAAAA,EAASlE,CAAWkE,KAAAA,CAAAA,EAASjE,CACzBD,MAAAA,EAAO+E,cAAc9E,CAAY,IAAA;AAAA,IAG1C,KAAK;AACJ,aAAIkE,EAASnE,CAAWmE,KAAAA,EAASlE,CACzBD,IAAAA,KAAUC,IAEdoE,EAAOrE,CAAWqE,KAAAA,EAAOpE,KACrBD,EAAOsE,QAAAA,KAAarE,EAASqE,QAAAA,IAAAA,EAAAA,CAEjCJ,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAO+E,cAAc9E,CAAa,KAAA;AAAA,IAG3C,KAAK;AACJ,aAAIkE,EAASnE,CAAAA,KAAWmE,EAASlE,CAAAA,IACzBD,KAAUC,IAEdoE,EAAOrE,CAAAA,KAAWqE,EAAOpE,CAAAA,IACrBD,EAAOsE,QAAAA,KAAarE,EAASqE,QAAAA,IAAAA,EAAAA,CAEjCJ,EAASlE,CAAWkE,KAAAA,CAAAA,EAASjE,CACzBD,MAAAA,EAAO+E,cAAc9E,CAAAA,KAAa;AAAA,IAG3C,KAAK;AACA,aAAAiE,EAASlE,CAAAA,IACLA,EAAOF,YAAAA,EAAclB,SAAS0D,EAAWrC,CAAAA,EAAUH,YAEvDrC,CAAAA,IAAAA,EAAQuC,CACJA,IAAAA,EAAOpB,SAASqB,CAAAA,IAEpB0E,EAAM3E,CAAAA,IACFA,EAAOgF,IAAI/E,CAEfyE,IAAAA,CAAAA,CAAAA,EAAM1E,CACFxC,KAAAA,MAAM8F,KAAKtD,EAAOuD,OAAU3E,CAAAA,EAAAA,SAASqB,CAI9C;AAAA,IAAA,KAAK;AACA,aAAAiE,EAASlE,CAAAA,IAAAA,CACJA,EAAOF,YAAAA,EAAclB,SAAS0D,EAAWrC,GAAUH,YAExDrC,CAAAA,IAAAA,EAAQuC,CACHA,IAAAA,CAAAA,EAAOpB,SAASqB,CAAAA,IAErB0E,EAAM3E,CAAAA,IAAAA,CACDA,EAAOgF,IAAI/E,CAEhByE,IAAAA,CAAAA,EAAM1E,CACDxC,KAAAA,CAAAA,MAAM8F,KAAKtD,EAAOuD,OAAAA,CAAAA,EAAU3E,SAASqB,CAAAA;AAAAA,IAI/C,KAAK;AACJ,aAAIiE,EAAAA,CAAAA,EAASlE,CAAWkE,KAAAA,CAAAA,EAASjE,CACzBD,MAAAA,EAAOF,YAAcmF,EAAAA,WAAWhF,EAASH,YAIlD,CAAA;AAAA,IAAA,KAAK;AACJ,aAAA,EAAA,CAAIoE,EAASlE,CAAAA,KAAAA,CAAWkE,EAASjE,CAAAA,MACzBD,EAAOF,YAAAA,EAAcoF,SAASjF,EAASH,YAIhD,CAAA;AAAA,IAAA,KAAK;AACA,aAAArC,EAAQwC,CACJA,IAAAA,EAASrB,SAASoB,CAAAA,IAEtB2E,EAAM1E,CAAAA,IACFA,EAAS+E,IAAIhF,CAEjB0E,IAAAA,CAAAA,CAAAA,EAAMzE,CACFA,MAAAA,EAAS+E,IAAIhF,CAAkBxC,KAAAA,MAAM8F,KAAKrD,EAASsD,OAAU3E,CAAAA,EAAAA,SAASoB,CAI/E;AAAA,IAAA,KAAK;AACA,aAAAvC,EAAQwC,CAAAA,IAAAA,CACHA,EAASrB,SAASoB,KAEvB2E,EAAM1E,CAAAA,IAAAA,CACDA,EAAS+E,IAAIhF,CAElB0E,IAAAA,CAAAA,EAAMzE,CACDA,KAAAA,CAAAA,EAAS+E,IAAIhF,CAAAA,KAAAA,CAAmBxC,MAAM8F,KAAKrD,EAASsD,OAAAA,CAAAA,EAAU3E,SAASoB,CAIjF;AAAA,IAAA;AAEQ,aAAA;AAAA,EAAA;AAGV;AAGO,MAAMmF,KAAYhC,GAGZiC,KAAcrB;ACjlB3B,SAASsB,EAAUnF,GAAYE,GAAAA;AAC1B,MAAAF,MAAME,EAAU,QAAA;AAEhB,MAAAF,aAAaxC,OAAO0C,aAAa1C,KAAK;AACzC,QAAIwC,EAAEpB,SAASsB,EAAEtB,KAAa;AAC9B,eAAYxB,CAAAA,GAAKC,CAAU2C,KAAAA,EAC1B,KAAKE,CAAAA,EAAE4E,IAAI1H,CAAAA,KAAAA,CAAS+H,EAAU9H,GAAO6C,EAAEkF,IAAIhI,IAAc,QAAA;AAEnD,WAAA;AAAA,EAAA;AAGJ,MAAA4C,aAAavC,OAAOyC,aAAazC,KAAK;AACzC,QAAIuC,EAAEpB,SAASsB,EAAEtB,KAAa,QAAA;AAC9B,eAAWK,KAAQe,EAClB,KAAA,CAAKE,EAAE4E,IAAI7F,CAAc,EAAA,QAAA;AAEnB,WAAA;AAAA,EAAA;AAGJ,MAAa,OAANe,KAAM,YAAYA,MAAM,QAAqB,OAANE,KAAM,YAAYA,MAAM,MAAM;AACzE,UAAAmF,IAAQzH,OAAOO,KAAK6B,IACpBsF,IAAQ1H,OAAOO,KAAK+B,CAAAA;AAE1B,QAAImF,EAAMjH,WAAWkH,EAAMlH,OAAe,QAAA;AAE1C,eAAWhB,KAAOiI,EAEb,KAACF,CAAAA,EAAUnF,EAAE5C,CAAAA,GAAM8C,EAAE9C,CAAAA,CAAAA,EAAc,QAAA;AAGjC,WAAA;AAAA,EAAA;AAGD,SAAA;AACR;AASgB,SAAAmI,EAAqBxH,GAAkByH,GAC/C;AAAA,SAAAzH,EAAM0H,EAAEC,KAAK1D,EAAIwD,CAAaG,GAAAA,EAAwBR,CAAYS,GAAAA,EAAY,CACtF,CAAA;AAAA;AASgB,SAAAC,EACf9H,GACAyH,GAAAA;AAEO,SAAAzH,EAAM0H,EAAEC,KAAK1D,EAAIwD,CAAAA,GAAaG,EAAwBR,CAAAA,GAAYS,EAAY,CAAA,CAAA;AACtF;AAQO,SAASE,GAAuB/H,GAC/B;AAAA,SAAA8H,EAAyB9H,GAAqBgI,CAAAA,MAAAzI,MAAM8F,KAAK2C,EAAW1C,OAC5E,CAAA,CAAA;AAAA;AASgB,SAAA2C,GAAsBjI,GAA4BkI,GAAAA;AACjE,SAAOJ,EAAyB9H,GAAOgI,OAAcA,EAAWX,IAAIa,CAAAA,CAAAA;AACrE;AASgB,SAAAC,GACfC,GACAC,GAEO;AAAA,SAAAC,EAAcF,CAAAA,EAAWT,KAC/B1D,EAAIqB,OAAU+C,EAAe/C,GAAAA,CAAAA,CAAAA,GAC7BsC,EAAwBR,CAAAA,GACxBS,EAAY,CAAA,CAAA;AAEd;AAKO,SAASU,GAAsBvI,GAAAA;AAC9B,SAAA8H,EAAyB9H,GAAqBgI,CAAAA,MAAAzI,MAAM8F,KAAK2C,EAAW5H,KAC5E,CAAA,CAAA;AAAA;AAKO,SAASoI,GAAyBxI,GACjC;AAAA,SAAA8H,EAAyB9H,GAAqBgI,CAAAA,MAAAzI,MAAM8F,KAAK2C,EAAWxC,QAAAA,CAAAA,CAAAA;AAC5E;AAKgB,SAAAiD,GAAsBzI,GAA4B0I,GAC1D;AAAA,SAAAZ,EAAyB9H,GAAqBgI,OAC7CzI,MAAM8F,KAAK2C,EAAW1C,UAAUM,KAAK8C,CAAAA,CAAAA;AAE9C;AAKgB,SAAAC,GACf3I,GACA4I,GAEO;AAAA,SAAAd,EAAyB9H,GAAqBgI,OACpD;AAAA,eAAY3I,CAAAA,GAAK6B,MAAS8G,EAAWxC,QAAAA,EAChC,KAAAoD,EAAU1H,GAAM7B,CAAAA,EACZ,QAAA6B;AAAAA,EAGF,CAET;AAAA;AASgB,SAAA2H,GACf7I,GACA8I,GAAAA;AAEO,SAAAhB,EAAyB9H,GAAOgI,OACtCzI,MAAM8F,KAAK2C,EAAWxC,QAAAA,CAAAA,EACpBuD,OAAO,CAAA,CAAE1J,GAAK6B,CAAAA,MAAU4H,EAAS5H,GAAM7B,CACvC4E,CAAAA,EAAAA,IAAI,EAAEC,GAAGhD,CAAAA,MAAUA,CAEvB,CAAA;AAAA;AAKgB,SAAA8H,GACfhJ,GACAiJ,GAAAA;AAEO,SAAAnB,EAAyB9H,UAC/BT,MAAM8F,KAAK2C,EAAWxC,QAAWvB,CAAAA,EAAAA,IAAI,CAAE5E,CAAAA,GAAK6B,CAAU+H,MAAAA,EAAM/H,GAAM7B,CAAAA,CAAAA,CAAAA;AAEpE;AASgB,SAAA6J,GACflJ,GACA8I,GAEO;AAAA,SAAAhB,EAAyB9H,GAAqBgI,OAC/Cc,IAEEvJ,MAAM8F,KAAK2C,EAAWxC,QAAWuD,CAAAA,EAAAA,OAAO,CAAE1J,CAAAA,GAAK6B,CAAU4H,MAAAA,EAAS5H,GAAM7B,CAAAA,CAAAA,EAAMgB,SAF/D2H,EAAWnH,IAInC;AAAA;AAUgB,SAAAsI,GAA8BnJ,GAAkByH,GAAAA;AAC/D,SAAOzH,EAAM0H,EAAEC,KACd1D,EAAIwD,CAAAA,GACJG,EAAwBR,CAAAA,GACxBgC,EAAM,EACLC,qBAAAA,IACAC,cAAAA,IACAC,iBAAAA,GAGH,CAAA,CAAA;AAAA;AC3MA,MAAMC,IAAkBjD,OAAO,iBAAA,GACzBkD,IAAgBlD,OAAO,0BACvBmD,IAAcnD,OAAO,qBA2GX;AAAA,SAAAoD,EACf3J,GACAyH,IAAiCmC,CAAAA,MAAaA,GAC9CC,IAAyB;AAElB,SAAA,SAAUjD,GAA4BkD,GAAkBC,GAAAA;AAElDC,IAAAA,EAAA,EAAEC,WAAW,IAAOC,MAAMrK,OAAAA,CAAAA,EAAU+G,GAAOkD,CAGvD;AAAA,UAAMK,IAA4BvD,EAAMwD,mBAClCC,IAA+BzD,EAAM0D;AAG3C1D,IAAAA,EAAMwD,oBAAoB,WA1D5B;;AAAA,UAAgCG;AA4DNC,OAAAA,IAAAA,MA3DVhB,CAAoBe,KAAAA,CAAAA,EAAUf,CAAiBiB,EAAAA,WACnDF,EAAAf,CAAAA,IAAmB,IAAIkB,MAG7BH,EAAUd,CACJc,MAAAA,EAAAd,CAAiB,IAAA,oBAAIhK,QAG3B8K,EAAUb,CACJa,MAAAA,EAAAb,CAAe,IAAA,oBAAIhK;AAqDtB,YAAAiL,IAtET,SAA8B3K,GAAAA;AAC7B,eAAO,SAASA,KAA8B,OAAdA,EAAMM,OAAQ,cAAcN,EAAMV,iBAAiBG;AAAAA,MACpF,EAoEqDO,CAAAA,IAC/C8H,EAAyB9H,GAAOyH,CAAAA,IAChCD,EAAexH,GAAoByH,CAGjCoC;AAAAA,MAAAA,EAAQe,YAAaJ,KAAKd,CAAc3C,EAAAA,IAAI+C,CAChDK,MAAAA,KAAAA,QAAAA,EAA2BU,KAAKL,OAC3BA,KAAAd,CAAcoB,EAAAA,IAAIhB,CAIpBU,IAAAA,KAAKf,CAAgB1C,EAAAA,IAAI+C,CAC5BU,OAAAA,IAAAA,KAAKf,CAAgBpC,EAAAA,IAAIyC,CAAWiB,MAApCP,QAAAA,EAAoCO,eAC/BP,KAAAf,CAAAA,EAAgBuB,OAAOlB,CAIzBD,IAAAA,EAAQoB;AAKN,YAAAC,IAAeP,EAAShD,KAAKwD,EAAUX,KAAKhB,CAAAA,CAAAA,CAAAA,EAAoB4B,UAAU,EAC/EC,MAAO/L,CAAAA,MAAAA;;AAEN,cAAMgM,IAAWzB,EAAQ0B,YAAYC,gBAAgBlM,CAASA,IAAAA;AAE1DuK,QAAAA,EAAQoB,OAIPpB,EAAQ4B,eACZjB,KAAKV,CAAAA,IAAYwB,KAGlBd,IAAAA,KAAKkB,kBAALlB,QAAAA,EAAAA,YAGIX,EAAQe,YAAAA,CAAaJ,KAAKd,CAAAA,EAAc3C,IAAI+C,CAAAA,KAAawB,KAAzDzB,SACCA,EAAQoB,OAIZd,KAAAA,QAAAA,EAA2BU,KAAKL,OAC3BA,KAAAd,CAAcoB,EAAAA,IAAIhB,CAAQ;AAAA,MAAA,GAGjC6B,OAAQ7K,CAAAA,MAAAA;AAGH0J,aAAKoB,eAERC,WAAW,MAAA;;AACNrB,eAAKoB,gBACJ/B,EAAQoB,QAGZT,IAAAA,KAAKJ,sBAALI,QAAAA,EAAAA;AAAAA,QAAyB,GAExB,GAAI;AAAA,MAAA,EAAA,CAAA;AAMVA,WAAKf,CAAAA,EAAgBnJ,IAAIwJ,GAAUoB,CACpC;AAAA,IAAA,GAGAtE,EAAM0D,uBAAuB,WAnH/B;AAAA,UAAkCC;AAqH/BF,MAAAA,KAAAA,QAAAA,EAA8BQ,KAAKL,OAG/BX,EAAQoB,QAxHmBV,IA6HNC,MA5HbhB,CAAAA,MACHe,EAAAf,CAAAA,EAAiB6B,KACjBd,GAAAA,EAAAf,CAAiBsC,EAAAA,SAAAA,GAC3BvB,EAAUf,CAAAA,IAAAA,SAGPe,EAAUd,CAAAA,MACbc,EAAUd,CAAAA,EAAe1D,QAAezD,CAAAA,MAAAA,EAAIyI,YAAAA,CAAAA,GAClCR,EAAAd,CAAAA,EAAesC,MACzBxB,GAAAA,EAAUd,CAAiB,IAAA,SAGxBc,EAAUb,CAAAA,MACHa,EAAAb,CAAAA,EAAaqC,MACvBxB,GAAAA,EAAUb,CAAe,IAAA;AAAA,IA+GzB;AAAA,EACD;AACD;AAUO,SAASsC,GACfhM,GACAiM,GACApC,IAAyB,CAAA,GAElB;AAAA,SAAA,SAAUjD,GAA4BkD,GAAkBC,GAAAA;AAC9DJ,IAAAA,EACC3J,GACA,SAAU4J,GAAAA;AAEH,YAAA1B,IAAU+D,EAAUzB,IAAAA;AAC1B,aAAOtC,IAAU0B,EAAMvC,IAAIa,CAAAA,IAAAA;AAAAA,IAC5B,GACA2B,CAPDF,EAQE/C,GAAOkD,CAAAA;AAAAA,EACV;AACD;"}