npm - @player-ui/partial-match-registry - Versions diffs - 1.0.1 → 1.0.2--canary.890.38467 - Mend

@player-ui/partial-match-registry 1.0.1 → 1.0.2--canary.890.38467

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

package/dist/Registry.native.js.map +1 -1
package/package.json +1 -1

package/dist/Registry.native.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["/home/circleci/.cache/bazel/_bazel_circleci/e8362d362e14c7d23506d1dfa3aea8b8/sandbox/processwrapper-sandbox/2395/execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/dist/index.global.js","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/fast-sort@3.4.1/node_modules/fast-sort/dist/sort.mjs","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/dlv@1.1.3/node_modules/dlv/index.js","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/deep-partial-matcher.ts","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/index.ts"],"names":["Registry","createNewSortInstance","opts","comparer","castComparer","arrayToSort","ctx","Array","isArray","inPlaceSorting","slice","asc","sortBy","sortArray","desc","by","dlv_es_default","obj","key","def","p","undef","split","length","createObjectMatcher","partialObj","pairs","traverseObj","matchFunction","searchObj","from","entry","path","value","count","size","createBasicMatcher","seed","matcher","match","__defProp","Object","defineProperty","__getOwnPropDesc","getOwnPropertyDescriptor","__getOwnPropNames","getOwnPropertyNames","__hasOwnProp","prototype","hasOwnProperty","__export","target","all","name","get","enumerable","__copyProps","to","except","call","__toCommonJS","mod","src_exports","a","b","order","throwInvalidConfigErrorIfTrue","condition","context","Error","unpackObjectSorter","sortByObj","_a","multiPropertySorterProvider","defaultComparer","multiPropertySorter","sortByArr","depth","valA","valB","objectSorterConfig","equality","getSortStrategy","includes","multiPropSorter_1","sort","inPlaceSort","object","Map","keys","val","nestedPath","set","initialSet","logger","store","forEach","existingIndex","findIndex","splice","debug","push","query","callbackfn","clear","isRegistryEmpty"],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,IAAIA,WAAW,AAAC;QC2EPC,wBAAT,SAASA,sBAAsBC,IAAA;QAC3B,IAAIC,WAAWC,aAAaF,KAAKC,QAAQ;QACzC,OAAO,SAAUE,WAAA;YACb,IAAIC,MAAMC,MAAMC,OAAA,CAAQH,gBAAgB,CAACH,KAAKO,cAAA,GACxCJ,YAAYK,KAAA,KACZL;YACN,OAAO;gBACHM,KAAK,SAALA,IAAeC,MAAA;oBACX,OAAOC,UAAU,GAAGP,KAAKM,QAAQT;gBACrC;gBACAW,MAAM,SAANA,KAAgBF,MAAA;oBACZ,OAAOC,UAAU,CAAA,GAAIP,KAAKM,QAAQT;gBACtC;gBACAY,IAAI,SAAJA,GAAcH,MAAA;oBACV,OAAOC,UAAU,GAAGP,KAAKM,QAAQT;gBACrC;YACJ;QACJ;IACJ;QC9Fea,iBF8Ib,kJAAkJ;IE9IrI,SAAAA,eAAaC,CAAAA,EAAKC,CAAAA,EAAKC,CAAAA,EAAKC,CAAAA,EAAGC,CAAAA;QAAAA,IAC7CH,IAAMA,EAAII,KAAAA,GAAQJ,EAAII,KAAAA,CAAM,OAAOJ,GAC9BE,IAAI,GAAGA,IAAIF,EAAIK,MAAAA,EAAQH,IAC3BH,IAAMA,IAAMA,CAAAA,CAAIC,CAAAA,CAAIE,EAAAA,CAAAA,GAAMC;QAAAA,OAEpBJ,MAAQI,IAAQF,IAAMF;IAAAA;QCkCdO,sBAAT,SAASA,oBAAoBC,UAAA;QAElC,IAAMC,QAAQC,YAAYF;QAG1B,IAAMG,gBAAgB,SAACC;gBACrB,kCAAA,2BAAA;;gBAAA,QAAA,YAAoBtB,MAAMuB,IAAA,CAAKJ,2BAA/B,SAAA,6BAAA,QAAA,yBAAA,iCAAuC;oBAAvC,IAAWK,QAAX;oBACE,IAAsBA,0BAAAA,WAAfC,OAAeD,WAATE,QAASF;oBAEtB,IAAIf,eAAIa,WAAWG,UAAUC,OAAO;wBAClC,OAAO;oBACT;gBACF;;gBANA;gBAAA;;;yBAAA,6BAAA;wBAAA;;;wBAAA;8BAAA;;;;YAQA,OAAO;QACT;QAGAL,cAAcM,KAAA,GAAQR,MAAMS,IAAA;QAE5B,OAAOP;IACT;QChDSQ,qBJqKP,mHAAmH;IIrKrH,SAASA,mBAAmBC,IAAA;QAE1B,IAAMC,UAAU,SAACC;mBAAeF,SAASE;;QACzCD,QAAQJ,KAAA,GAAQ;QAEhB,OAAOI;IACT;IJhBE,IAAIE,YAAYC,OAAOC,cAAc;IACrC,IAAIC,mBAAmBF,OAAOG,wBAAwB;IACtD,IAAIC,oBAAoBJ,OAAOK,mBAAmB;IAClD,IAAIC,eAAeN,OAAOO,SAAS,CAACC,cAAc;IAClD,IAAIC,WAAW,SAACC,QAAQC;QACtB,IAAK,IAAIC,QAAQD,IACfZ,UAAUW,QAAQE,MAAM;YAAEC,KAAKF,GAAG,CAACC,KAAK;YAAEE,YAAY;QAAK;IAC/D;IACA,IAAIC,cAAc,SAACC,IAAI3B,MAAM4B,QAAQ5C;QACnC,IAAIgB,QAAQ,CAAA,OAAOA,qCAAP,SAAOA,KAAG,MAAM,YAAY,OAAOA,SAAS,YAAY;gBAC7D,kCAAA,2BAAA;;;oBAAA,IAAIZ,MAAJ;oBACH,IAAI,CAAC6B,aAAaY,IAAI,CAACF,IAAIvC,QAAQA,QAAQwC,QACzClB,UAAUiB,IAAIvC,KAAK;wBAAEoC,KAAK;mCAAMxB,IAAI,CAACZ,IAAI;;wBAAEqC,YAAY,CAAEzC,CAAAA,OAAO6B,iBAAiBb,MAAMZ,IAAG,KAAMJ,KAAKyC,UAAU;oBAAC;;gBAFpH,QAAK,YAAWV,kBAAkBf,0BAA7B,SAAA,6BAAA,QAAA,yBAAA;;gBAAA;gBAAA;;;yBAAA,6BAAA;wBAAA;;;wBAAA;8BAAA;;;;QAGP;QACA,OAAO2B;IACT;IACA,IAAIG,eAAe,SAACC;eAAQL,YAAYhB,UAAU,CAAC,GAAG,cAAc;YAAEP,OAAO;QAAK,IAAI4B;;IAEtF,mHAAmH;IIpBrH,IAAAC,cAAA,CAAA;IAAAZ,SAAAY,aAAA;QAAA9D,UAAA;mBAAAA;;QAAAwB,qBAAA;mBAAAA;;IAAA;IJ2BE,6JAA6J;ICzB/J,IAAIpB,eAAe,sBAAUD,QAAA;QAAY,OAAO,SAAU4D,CAAA,EAAGC,CAAA,EAAGC,KAAA;YAAS,OAAO9D,SAAS4D,GAAGC,GAAGC,SAASA;QAAO;IAAG;IAClH,IAAIC,gCAAgC,uCAAUC,SAAA,EAAWC,OAAA;QACrD,IAAID,WACA,MAAME,MAAM,0BAA0BD;IAC9C;IACA,IAAIE,qBAAqB,4BAAUC,SAAA;QAC/B,IAAIC,KAAKD,aAAa,CAAC,GAAG5D,MAAM6D,GAAG7D,GAAA,EAAKG,OAAO0D,GAAG1D,IAAA;QAClD,IAAImD,QAAQtD,MAAM,IAAI,CAAA;QACtB,IAAIC,SAAUD,OAAOG;QAErBoD,8BAA8B,CAACtD,QAAQ;QACvCsD,8BAA8BvD,OAAOG,MAAM;QAC3C,IAAIX,WAAWoE,UAAUpE,QAAA,IAAYC,aAAamE,UAAUpE,QAAQ;QACpE,OAAO;YAAE8D,OAAAA;YAAcrD,QAAAA;YAAgBT,UAAAA;QAAmB;IAC9D;IAEA,IAAIsE,8BAA8B,qCAAUC,gBAAAA;QACxC,OAAO,SAASC,oBAAoB/D,MAAA,EAAQgE,SAAA,EAAWC,KAAA,EAAOZ,KAAA,EAAO9D,QAAA,EAAU4D,CAAA,EAAGC,CAAA;YAC9E,IAAIc;YACJ,IAAIC;YACJ,IAAI,OAAOnE,WAAW,UAAU;gBAC5BkE,OAAOf,CAAA,CAAEnD,OAAM;gBACfmE,OAAOf,CAAA,CAAEpD,OAAM;YACnB,OAAA,IACS,OAAOA,WAAW,YAAY;gBACnCkE,OAAOlE,OAAOmD;gBACdgB,OAAOnE,OAAOoD;YAClB,OACK;gBACD,IAAIgB,qBAAqBV,mBAAmB1D;gBAC5C,OAAO+D,oBAAoBK,mBAAmBpE,MAAA,EAAQgE,WAAWC,OAAOG,mBAAmBf,KAAA,EAAOe,mBAAmB7E,QAAA,IAAYuE,kBAAiBX,GAAGC;YACzJ;YACA,IAAIiB,WAAW9E,SAAS2E,MAAMC,MAAMd;YACpC,IAAA,AAAKgB,CAAAA,aAAa,KAAMH,QAAQ,QAAQC,QAAQ,IAAA,KAC5CH,UAAUrD,MAAA,GAASsD,OAAO;gBAC1B,OAAOF,oBAAoBC,SAAA,CAAUC,MAAK,EAAGD,WAAWC,QAAQ,GAAGZ,OAAO9D,UAAU4D,GAAGC;YAC3F;YACA,OAAOiB;QACX;IACJ;IACA,SAASC,gBAAgBtE,MAAA,EAAQT,QAAA,EAAU8D,KAAA;QAEvC,IAAIrD,WAAW,KAAA,KAAaA,WAAW,MAAM;YACzC,OAAO,SAAUmD,CAAA,EAAGC,CAAA;gBAAK,OAAO7D,SAAS4D,GAAGC,GAAGC;YAAQ;QAC3D;QAEA,IAAI,OAAOrD,WAAW,UAAU;YAC5BsD,8BAA8BtD,OAAOuE,QAAA,CAAS,MAAM;YACpD,OAAO,SAAUpB,CAAA,EAAGC,CAAA;gBAAK,OAAO7D,SAAS4D,CAAA,CAAEnD,OAAM,EAAGoD,CAAA,CAAEpD,OAAM,EAAGqD;YAAQ;QAC3E;QAEA,IAAI,OAAOrD,WAAW,YAAY;YAC9B,OAAO,SAAUmD,CAAA,EAAGC,CAAA;gBAAK,OAAO7D,SAASS,OAAOmD,IAAInD,OAAOoD,IAAIC;YAAQ;QAC3E;QAEA,IAAI1D,MAAMC,OAAA,CAAQI,SAAS;YACvB,IAAIwE,oBAAoBX,4BAA4BtE;YACpD,OAAO,SAAU4D,CAAA,EAAGC,CAAA;gBAAK,OAAOoB,kBAAkBxE,MAAA,CAAO,EAAC,EAAGA,QAAQ,GAAGqD,OAAO9D,UAAU4D,GAAGC;YAAI;QACpG;QAEA,IAAIgB,qBAAqBV,mBAAmB1D;QAC5C,OAAOsE,gBAAgBF,mBAAmBpE,MAAA,EAAQoE,mBAAmB7E,QAAA,IAAYA,UAAU6E,mBAAmBf,KAAK;IACvH;IACA,IAAIpD,YAAY,mBAAUoD,KAAA,EAAO3D,GAAA,EAAKM,MAAA,EAAQT,QAAA;QAC1C,IAAIqE;QACJ,IAAI,CAACjE,MAAMC,OAAA,CAAQF,MAAM;YACrB,OAAOA;QACX;QAEA,IAAIC,MAAMC,OAAA,CAAQI,WAAWA,OAAOW,MAAA,GAAS,GAAG;YAC5CiD,KAAK5D,QAAQA,SAAS4D,EAAA,CAAG,EAAC;QAC9B;QACA,OAAOlE,IAAI+E,IAAA,CAAKH,gBAAgBtE,QAAQT,UAAU8D;IACtD;IAoBA,IAAIS,kBAAkB,yBAAUX,CAAA,EAAGC,CAAA,EAAGC,KAAA;QAClC,IAAIF,KAAK,MACL,OAAOE;QACX,IAAID,KAAK,MACL,OAAO,CAACC;QACZ,IAAI,CAAA,OAAOF,kCAAP,SAAOA,EAAAA,MAAM,CAAA,OAAOC,kCAAP,SAAOA,EAAAA,GAAG;YACvB,OAAO,CAAA,OAAOD,kCAAP,SAAOA,EAAAA,IAAI,CAAA,OAAOC,kCAAP,SAAOA,EAAAA,IAAI,CAAA,IAAK;QACtC;QACA,IAAID,IAAIC,GACJ,OAAO,CAAA;QACX,IAAID,IAAIC,GACJ,OAAO;QACX,OAAO;IACX;IACA,IAAIqB,OAAOpF,sBAAsB;QAC7BE,UAAUuE;IACd;IACA,IAAIY,cAAcrF,sBAAsB;QACpCE,UAAUuE;QACVjE,gBAAgB;IACpB;IDkCE,kIAAkI;IG5IpI,SAASkB,YACP4D,MAAA;YACAvD,OAAAA,iEAAiB,EAAC,EAClBN,QAAAA,iEAA4B,aAAA,GAAA,IAAI8D;YAEhC,kCAAA,2BAAA;;YAAA,QAAA,YAAkB/C,OAAOgD,IAAA,CAAKF,4BAA9B,SAAA,6BAAA,QAAA,yBAAA,iCAAuC;gBAAvC,IAAWrE,MAAX;gBACE,IAAMwE,MAAWH,MAAA,CAAOrE,IAAG;gBAC3B,IAAMyE,aAAa,AAAC,qBAAG3D,aAAJ;oBAAUd;iBAAG;gBAQhC,IAAI,CAAA,OAAOwE,oCAAP,SAAOA,IAAA,MAAQ,YAAYA,QAAQ,MAAM;oBAC3C/D,YAAY+D,KAAKC,YAAYjE;gBAC/B,OAAO;oBACLA,MAAMkE,GAAA,CAAID,YAAYD;gBACxB;YACF;;YAfA;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;QAiBA,OAAOhE;IACT;ICGO,IAAM1B,yBAAN;iBAAMA,SAUC6F,UAAA,EAA8BC,MAAA;;oCAV/B9F;YACX,IAAA,CAAQ+F,KAAA,GAAiC,EAAC;YAUxC,IAAA,CAAKD,MAAA,GAASA;YACdD,uBAAAA,iCAAAA,WAAYG,OAAA,CAAQ;yDAAEzD,mBAAON;gBAC3B,MAAK2D,GAAA,CAAIrD,OAAON;YAClB;;;;gBACF;;;;;;;;KAAA,GAWA2D,KAAAA;uBAAAA,SAAAA,IAAIrD,KAAA,EAAYN,KAAA;oBACd,IAAMK,UACJ,CAAA,OAAOC,sCAAP,SAAOA,MAAA,MAAU,WACbf,oBAAoBe,SACpBH,mBAAmBG;oBAIzB,IAAM0D,gBAAgB,IAAA,CAAKF,KAAA,CAAMG,SAAA,CAC/B,SAACnE;+BAAUA,MAAMO,OAAA,CAAQC,UAAUD,QAAQP,MAAMb,GAAG;;oBAEtD,IAAI+E,kBAAkB,CAAA,GAAI;4BAExB,oBAAA;wBADA,IAAA,CAAKF,KAAA,CAAMI,MAAA,CAAOF,eAAe;yBACjC,eAAA,IAAA,CAAKH,MAAA,cAAL,oCAAA,qBAAA,aAAaM,KAAA,cAAb,yCAAA,wBAAA,cACE,+CACA7D;oBAEJ;oBAEA,IAAA,CAAKwD,KAAA,CAAMM,IAAA,CAAK;wBACdnF,KAAKqB;wBACLN,OAAAA;wBACAK,SAAAA;oBACF;oBAGA,IAAA,CAAKyD,KAAA,GAAQV,KAAK,IAAA,CAAKU,KAAK,EAAEjF,IAAA,CAAK,SAACiB;+BAAUA,MAAMO,OAAA,CAAQJ,KAAK;;gBACnE;;;gBAAA;;;;;;;;;KAAA,GAYAoB,KAAAA;uBAAAA,SAAAA,IAAIgD,KAAA;wBAEF,kCAAA,2BAAA;;wBAAA,QAAA,YAAoB,IAAA,CAAKP,KAAA,qBAAzB,SAAA,6BAAA,QAAA,yBAAA,iCAAgC;4BAAhC,IAAWhE,QAAX;4BACE,IAAIA,MAAMO,OAAA,CAAQgE,QAAQ;gCACxB,OAAOvE,MAAME,KAAA;4BACf;wBACF;;wBAJA;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAKA,OAAO,KAAA;gBACT;;;gBAAA,2CAAA,GAGA+D,KAAAA;uBAAAA,SAAAA,QAAQO,UAAA;wBACN,kCAAA,2BAAA;;wBAAA,QAAA,YAAoB,IAAA,CAAKR,KAAA,qBAAzB,SAAA,6BAAA,QAAA,yBAAA,iCAAgC;4BAAhC,IAAWhE,QAAX;4BACEwE,WAAWxE;wBACb;;wBAFA;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;gBAGF;;;gBAAA,oCAAA,GAGAyE,KAAAA;uBAAAA,SAAAA;oBACE,IAAA,CAAKT,KAAA,GAAQ,EAAC;gBAChB;;;gBAAA,kCAAA,GAGAU,KAAAA;uBAAAA,SAAAA;oBACE,OAAO,IAAA,CAAKV,KAAA,CAAMxE,MAAA,KAAW;gBAC/B;;;;;IJqIA,OAAOqC,aAAaE;AACtB","sourcesContent":["\"use strict\";\nvar Registry = (() => {\n var __defProp = Object.defineProperty;\n var __getOwnPropDesc = Object.getOwnPropertyDescriptor;\n var __getOwnPropNames = Object.getOwnPropertyNames;\n var __hasOwnProp = Object.prototype.hasOwnProperty;\n var __export = (target, all) => {\n for (var name in all)\n __defProp(target, name, { get: all[name], enumerable: true });\n };\n var __copyProps = (to, from, except, desc) => {\n if (from && typeof from === \"object\" \|\| typeof from === \"function\") {\n for (let key of __getOwnPropNames(from))\n if (!__hasOwnProp.call(to, key) && key !== except)\n __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) \|\| desc.enumerable });\n }\n return to;\n };\n var __toCommonJS = (mod) => __copyProps(__defProp({}, \"__esModule\", { value: true }), mod);\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/index.ts\n var src_exports = {};\n __export(src_exports, {\n Registry: () => Registry,\n createObjectMatcher: () => createObjectMatcher\n });\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/fast-sort@3.4.1/node_modules/fast-sort/dist/sort.mjs\n var castComparer = function(comparer) {\n return function(a, b, order) {\n return comparer(a, b, order) * order;\n };\n };\n var throwInvalidConfigErrorIfTrue = function(condition, context) {\n if (condition)\n throw Error(\"Invalid sort config: \" + context);\n };\n var unpackObjectSorter = function(sortByObj) {\n var _a = sortByObj \|\| {}, asc = _a.asc, desc = _a.desc;\n var order = asc ? 1 : -1;\n var sortBy = asc \|\| desc;\n throwInvalidConfigErrorIfTrue(!sortBy, \"Expected `asc` or `desc` property\");\n throwInvalidConfigErrorIfTrue(asc && desc, \"Ambiguous object with `asc` and `desc` config properties\");\n var comparer = sortByObj.comparer && castComparer(sortByObj.comparer);\n return { order, sortBy, comparer };\n };\n var multiPropertySorterProvider = function(defaultComparer2) {\n return function multiPropertySorter(sortBy, sortByArr, depth, order, comparer, a, b) {\n var valA;\n var valB;\n if (typeof sortBy === \"string\") {\n valA = a[sortBy];\n valB = b[sortBy];\n } else if (typeof sortBy === \"function\") {\n valA = sortBy(a);\n valB = sortBy(b);\n } else {\n var objectSorterConfig = unpackObjectSorter(sortBy);\n return multiPropertySorter(objectSorterConfig.sortBy, sortByArr, depth, objectSorterConfig.order, objectSorterConfig.comparer \|\| defaultComparer2, a, b);\n }\n var equality = comparer(valA, valB, order);\n if ((equality === 0 \|\| valA == null && valB == null) && sortByArr.length > depth) {\n return multiPropertySorter(sortByArr[depth], sortByArr, depth + 1, order, comparer, a, b);\n }\n return equality;\n };\n };\n function getSortStrategy(sortBy, comparer, order) {\n if (sortBy === void 0 \|\| sortBy === true) {\n return function(a, b) {\n return comparer(a, b, order);\n };\n }\n if (typeof sortBy === \"string\") {\n throwInvalidConfigErrorIfTrue(sortBy.includes(\".\"), \"String syntax not allowed for nested properties.\");\n return function(a, b) {\n return comparer(a[sortBy], b[sortBy], order);\n };\n }\n if (typeof sortBy === \"function\") {\n return function(a, b) {\n return comparer(sortBy(a), sortBy(b), order);\n };\n }\n if (Array.isArray(sortBy)) {\n var multiPropSorter_1 = multiPropertySorterProvider(comparer);\n return function(a, b) {\n return multiPropSorter_1(sortBy[0], sortBy, 1, order, comparer, a, b);\n };\n }\n var objectSorterConfig = unpackObjectSorter(sortBy);\n return getSortStrategy(objectSorterConfig.sortBy, objectSorterConfig.comparer \|\| comparer, objectSorterConfig.order);\n }\n var sortArray = function(order, ctx, sortBy, comparer) {\n var _a;\n if (!Array.isArray(ctx)) {\n return ctx;\n }\n if (Array.isArray(sortBy) && sortBy.length < 2) {\n _a = sortBy, sortBy = _a[0];\n }\n return ctx.sort(getSortStrategy(sortBy, comparer, order));\n };\n function createNewSortInstance(opts) {\n var comparer = castComparer(opts.comparer);\n return function(arrayToSort) {\n var ctx = Array.isArray(arrayToSort) && !opts.inPlaceSorting ? arrayToSort.slice() : arrayToSort;\n return {\n asc: function(sortBy) {\n return sortArray(1, ctx, sortBy, comparer);\n },\n desc: function(sortBy) {\n return sortArray(-1, ctx, sortBy, comparer);\n },\n by: function(sortBy) {\n return sortArray(1, ctx, sortBy, comparer);\n }\n };\n };\n }\n var defaultComparer = function(a, b, order) {\n if (a == null)\n return order;\n if (b == null)\n return -order;\n if (typeof a !== typeof b) {\n return typeof a < typeof b ? -1 : 1;\n }\n if (a < b)\n return -1;\n if (a > b)\n return 1;\n return 0;\n };\n var sort = createNewSortInstance({\n comparer: defaultComparer\n });\n var inPlaceSort = createNewSortInstance({\n comparer: defaultComparer,\n inPlaceSorting: true\n });\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/dlv@1.1.3/node_modules/dlv/dist/dlv.es.js\n function dlv_es_default(t, e, l, n, r) {\n for (e = e.split ? e.split(\".\") : e, n = 0; n < e.length; n++)\n t = t ? t[e[n]] : r;\n return t === r ? l : t;\n }\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/deep-partial-matcher.ts\n function traverseObj(object, path = [], pairs = /* @__PURE__ / new Map()) {\n for (const key of Object.keys(object)) {\n const val = object[key];\n const nestedPath = [...path, key];\n if (typeof val === \"object\" && val !== null) {\n traverseObj(val, nestedPath, pairs);\n } else {\n pairs.set(nestedPath, val);\n }\n }\n return pairs;\n }\n function createObjectMatcher(partialObj) {\n const pairs = traverseObj(partialObj);\n const matchFunction = (searchObj) => {\n for (const entry of Array.from(pairs)) {\n const [path, value] = entry;\n if (dlv_es_default(searchObj, path) !== value) {\n return false;\n }\n }\n return true;\n };\n matchFunction.count = pairs.size;\n return matchFunction;\n }\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/index.ts\n function createBasicMatcher(seed) {\n const matcher = (match) => seed === match;\n matcher.count = 1;\n return matcher;\n }\n var Registry = class {\n /\n Creates a new Registry instance\n \n @param initialSet - Optional array of [key, value] tuples to populate the registry\n * @param logger - Optional logger instance for debug logging (e.g., when entries are replaced)\n /\n constructor(initialSet, logger) {\n this.store = [];\n this.logger = logger;\n initialSet?.forEach(([match, value]) => {\n this.set(match, value);\n });\n }\n /\n Add match -> value mapping to the registry\n \n If an entry with the same specificity and matching key already exists, it will be replaced\n * and a debug log will be emitted (if a logger is configured).\n \n @param match - The key to match against (can be a primitive or object)\n * @param value - The value to associate with this key\n /\n set(match, value) {\n const matcher = typeof match === \"object\" ? createObjectMatcher(match) : createBasicMatcher(match);\n const existingIndex = this.store.findIndex(\n (entry) => entry.matcher(match) && matcher(entry.key)\n );\n if (existingIndex !== -1) {\n this.store.splice(existingIndex, 1);\n this.logger?.debug?.(\n \"Registry: Replacing existing entry for key \",\n match\n );\n }\n this.store.push({\n key: match,\n value,\n matcher\n });\n this.store = sort(this.store).desc((entry) => entry.matcher.count);\n }\n /\n Fetch the best match in the registry\n \n Searches for the most specific entry that matches the given query.\n * The registry is sorted by specificity (matcher.count) in descending order,\n * so we iterate forward to find the highest specificity match first.\n \n @param query - The query object to match against registered keys\n * @returns The value associated with the best matching key, or undefined if no match found\n /\n get(query) {\n for (const entry of this.store) {\n if (entry.matcher(query)) {\n return entry.value;\n }\n }\n return void 0;\n }\n /* Loop over all entries and run callback /\n forEach(callbackfn) {\n for (const entry of this.store) {\n callbackfn(entry);\n }\n }\n /* Reset the items in the registry /\n clear() {\n this.store = [];\n }\n /* Check if the registry is empty/\n isRegistryEmpty() {\n return this.store.length === 0;\n }\n };\n return __toCommonJS(src_exports);\n})();\n","// >>> INTERFACES <<<\r\n// >>> HELPERS <<<\r\nvar castComparer = function (comparer) { return function (a, b, order) { return comparer(a, b, order) order; }; };\r\nvar throwInvalidConfigErrorIfTrue = function (condition, context) {\r\n if (condition)\r\n throw Error(\"Invalid sort config: \" + context);\r\n};\r\nvar unpackObjectSorter = function (sortByObj) {\r\n var _a = sortByObj \|\| {}, asc = _a.asc, desc = _a.desc;\r\n var order = asc ? 1 : -1;\r\n var sortBy = (asc \|\| desc);\r\n // Validate object config\r\n throwInvalidConfigErrorIfTrue(!sortBy, 'Expected `asc` or `desc` property');\r\n throwInvalidConfigErrorIfTrue(asc && desc, 'Ambiguous object with `asc` and `desc` config properties');\r\n var comparer = sortByObj.comparer && castComparer(sortByObj.comparer);\r\n return { order: order, sortBy: sortBy, comparer: comparer };\r\n};\r\n// >>> SORTERS <<<\r\nvar multiPropertySorterProvider = function (defaultComparer) {\r\n return function multiPropertySorter(sortBy, sortByArr, depth, order, comparer, a, b) {\r\n var valA;\r\n var valB;\r\n if (typeof sortBy === 'string') {\r\n valA = a[sortBy];\r\n valB = b[sortBy];\r\n }\r\n else if (typeof sortBy === 'function') {\r\n valA = sortBy(a);\r\n valB = sortBy(b);\r\n }\r\n else {\r\n var objectSorterConfig = unpackObjectSorter(sortBy);\r\n return multiPropertySorter(objectSorterConfig.sortBy, sortByArr, depth, objectSorterConfig.order, objectSorterConfig.comparer \|\| defaultComparer, a, b);\r\n }\r\n var equality = comparer(valA, valB, order);\r\n if ((equality === 0 \|\| (valA == null && valB == null)) &&\r\n sortByArr.length > depth) {\r\n return multiPropertySorter(sortByArr[depth], sortByArr, depth + 1, order, comparer, a, b);\r\n }\r\n return equality;\r\n };\r\n};\r\nfunction getSortStrategy(sortBy, comparer, order) {\r\n // Flat array sorter\r\n if (sortBy === undefined \|\| sortBy === true) {\r\n return function (a, b) { return comparer(a, b, order); };\r\n }\r\n // Sort list of objects by single object key\r\n if (typeof sortBy === 'string') {\r\n throwInvalidConfigErrorIfTrue(sortBy.includes('.'), 'String syntax not allowed for nested properties.');\r\n return function (a, b) { return comparer(a[sortBy], b[sortBy], order); };\r\n }\r\n // Sort list of objects by single function sorter\r\n if (typeof sortBy === 'function') {\r\n return function (a, b) { return comparer(sortBy(a), sortBy(b), order); };\r\n }\r\n // Sort by multiple properties\r\n if (Array.isArray(sortBy)) {\r\n var multiPropSorter_1 = multiPropertySorterProvider(comparer);\r\n return function (a, b) { return multiPropSorter_1(sortBy[0], sortBy, 1, order, comparer, a, b); };\r\n }\r\n // Unpack object config to get actual sorter strategy\r\n var objectSorterConfig = unpackObjectSorter(sortBy);\r\n return getSortStrategy(objectSorterConfig.sortBy, objectSorterConfig.comparer \|\| comparer, objectSorterConfig.order);\r\n}\r\nvar sortArray = function (order, ctx, sortBy, comparer) {\r\n var _a;\r\n if (!Array.isArray(ctx)) {\r\n return ctx;\r\n }\r\n // Unwrap sortBy if array with only 1 value to get faster sort strategy\r\n if (Array.isArray(sortBy) && sortBy.length < 2) {\r\n _a = sortBy, sortBy = _a[0];\r\n }\r\n return ctx.sort(getSortStrategy(sortBy, comparer, order));\r\n};\r\nfunction createNewSortInstance(opts) {\r\n var comparer = castComparer(opts.comparer);\r\n return function (arrayToSort) {\r\n var ctx = Array.isArray(arrayToSort) && !opts.inPlaceSorting\r\n ? arrayToSort.slice()\r\n : arrayToSort;\r\n return {\r\n asc: function (sortBy) {\r\n return sortArray(1, ctx, sortBy, comparer);\r\n },\r\n desc: function (sortBy) {\r\n return sortArray(-1, ctx, sortBy, comparer);\r\n },\r\n by: function (sortBy) {\r\n return sortArray(1, ctx, sortBy, comparer);\r\n },\r\n };\r\n };\r\n}\r\nvar defaultComparer = function (a, b, order) {\r\n if (a == null)\r\n return order;\r\n if (b == null)\r\n return -order;\r\n if (typeof a !== typeof b) {\r\n return typeof a < typeof b ? -1 : 1;\r\n }\r\n if (a < b)\r\n return -1;\r\n if (a > b)\r\n return 1;\r\n return 0;\r\n};\r\nvar sort = createNewSortInstance({\r\n comparer: defaultComparer,\r\n});\r\nvar inPlaceSort = createNewSortInstance({\r\n comparer: defaultComparer,\r\n inPlaceSorting: true,\r\n});\n\nexport { createNewSortInstance, defaultComparer, inPlaceSort, sort };\n","export default function dlv(obj, key, def, p, undef) {\n\tkey = key.split ? key.split('.') : key;\n\tfor (p = 0; p < key.length; p++) {\n\t\tobj = obj ? obj[key[p]] : undef;\n\t}\n\treturn obj === undef ? def : obj;\n}\n","import dlv from \"dlv\";\n\n/** A function that checks overlapping properties against a reference value /\nexport type Matcher = ((searchObj: object) => boolean) & {\n /* The count represents the specificity of this matcher /\n count: number;\n};\n\n/* Traverse an object and collect any key/value pairs including nested keys /\nfunction traverseObj(\n object: Record<any, any>,\n path: string[] = [],\n pairs: Map<string[], any> = new Map(),\n): Map<string[], any> {\n for (const key of Object.keys(object)) {\n const val: any = object[key];\n const nestedPath = [...path, key];\n\n / Explicitly avoid traversing null values.\n JavaScript's typeof null === \"object\" would otherwise cause the function to traverse null as an object\n and throw an error. \n \n Ref: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof#typeof_null\n /\n if (typeof val === \"object\" && val !== null) {\n traverseObj(val, nestedPath, pairs);\n } else {\n pairs.set(nestedPath, val);\n }\n }\n\n return pairs;\n}\n\n/\n Given a partial object, create a matcher function that checks if another object matches the specified properties\n * @param partialObj The partial object to match against\n * @returns A matcher function that checks if an object matches the partial object\n /\nexport function createObjectMatcher(partialObj: object): Matcher {\n // Convert the partial object into a list of [key, value] pairs;\n const pairs = traverseObj(partialObj);\n\n /* Generate a function to match against all of the properties we care about /\n const matchFunction = (searchObj: object) => {\n for (const entry of Array.from(pairs)) {\n const [path, value] = entry;\n\n if (dlv(searchObj, path) !== value) {\n return false;\n }\n }\n\n return true;\n };\n\n // Keep track of the specificity of the comparator\n matchFunction.count = pairs.size;\n\n return matchFunction;\n}\n","import { sort } from \"fast-sort\";\nimport type { Matcher } from \"./deep-partial-matcher\";\nimport { createObjectMatcher } from \"./deep-partial-matcher\";\n\nexport { createObjectMatcher } from \"./deep-partial-matcher\";\n\n/* Minimal logger interface for registry operations /\ninterface Logger {\n debug?: (...args: Array<any>) => void;\n}\n\n/* create a matcher function that matches exactly /\nfunction createBasicMatcher(seed: any): Matcher {\n /* a simple matcher function that only matches itself /\n const matcher = (match: any) => seed === match;\n matcher.count = 1;\n\n return matcher;\n}\n\ninterface RegistryIndex<V> {\n /* The original object we wanted to match on /\n key: object;\n\n /* The value to return /\n value: V;\n\n /* The matcher function for this entry /\n matcher: Matcher;\n}\n\n/\n A partial match registry is a map that uses an object to \"match\" against keys.\n * More specific matches take precedence over less specific ones.\n /\nexport class Registry<V> {\n private store: Array<RegistryIndex<V>> = [];\n private logger?: Logger;\n\n /\n Creates a new Registry instance\n \n @param initialSet - Optional array of [key, value] tuples to populate the registry\n * @param logger - Optional logger instance for debug logging (e.g., when entries are replaced)\n /\n constructor(initialSet?: Array<[any, V]>, logger?: Logger) {\n this.logger = logger;\n initialSet?.forEach(([match, value]) => {\n this.set(match, value);\n });\n }\n\n /\n Add match -> value mapping to the registry\n \n If an entry with the same specificity and matching key already exists, it will be replaced\n * and a debug log will be emitted (if a logger is configured).\n \n @param match - The key to match against (can be a primitive or object)\n * @param value - The value to associate with this key\n /\n set(match: any, value: V): void {\n const matcher =\n typeof match === \"object\"\n ? createObjectMatcher(match)\n : createBasicMatcher(match);\n\n // Find and remove any existing entry that matches this key\n // Use matcher to check for matching keys (handles deep equality)\n const existingIndex = this.store.findIndex(\n (entry) => entry.matcher(match) && matcher(entry.key),\n );\n if (existingIndex !== -1) {\n this.store.splice(existingIndex, 1);\n this.logger?.debug?.(\n \"Registry: Replacing existing entry for key \",\n match,\n );\n }\n\n this.store.push({\n key: match,\n value,\n matcher,\n });\n\n // Sort in descending order by matcher.count (highest specificity first)\n this.store = sort(this.store).desc((entry) => entry.matcher.count);\n }\n\n /\n Fetch the best match in the registry\n \n Searches for the most specific entry that matches the given query.\n * The registry is sorted by specificity (matcher.count) in descending order,\n * so we iterate forward to find the highest specificity match first.\n \n @param query - The query object to match against registered keys\n * @returns The value associated with the best matching key, or undefined if no match found\n /\n get(query: any): V \| undefined {\n // Store is sorted by matcher.count (descending), so iterate forward\n for (const entry of this.store) {\n if (entry.matcher(query)) {\n return entry.value;\n }\n }\n return undefined;\n }\n\n /* Loop over all entries and run callback /\n forEach(callbackfn: (value: RegistryIndex<V>) => void): void {\n for (const entry of this.store) {\n callbackfn(entry);\n }\n }\n\n /* Reset the items in the registry /\n clear(): void {\n this.store = [];\n }\n\n /* Check if the registry is empty*/\n isRegistryEmpty(): boolean {\n return this.store.length === 0;\n }\n}\n"]}
1	+ {"version":3,"sources":["/home/circleci/.cache/bazel/_bazel_circleci/e8362d362e14c7d23506d1dfa3aea8b8/sandbox/processwrapper-sandbox/2389/execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/dist/index.global.js","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/fast-sort@3.4.1/node_modules/fast-sort/dist/sort.mjs","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/dlv@1.1.3/node_modules/dlv/index.js","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/deep-partial-matcher.ts","../../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/index.ts"],"names":["Registry","createNewSortInstance","opts","comparer","castComparer","arrayToSort","ctx","Array","isArray","inPlaceSorting","slice","asc","sortBy","sortArray","desc","by","dlv_es_default","obj","key","def","p","undef","split","length","createObjectMatcher","partialObj","pairs","traverseObj","matchFunction","searchObj","from","entry","path","value","count","size","createBasicMatcher","seed","matcher","match","__defProp","Object","defineProperty","__getOwnPropDesc","getOwnPropertyDescriptor","__getOwnPropNames","getOwnPropertyNames","__hasOwnProp","prototype","hasOwnProperty","__export","target","all","name","get","enumerable","__copyProps","to","except","call","__toCommonJS","mod","src_exports","a","b","order","throwInvalidConfigErrorIfTrue","condition","context","Error","unpackObjectSorter","sortByObj","_a","multiPropertySorterProvider","defaultComparer","multiPropertySorter","sortByArr","depth","valA","valB","objectSorterConfig","equality","getSortStrategy","includes","multiPropSorter_1","sort","inPlaceSort","object","Map","keys","val","nestedPath","set","initialSet","logger","store","forEach","existingIndex","findIndex","splice","debug","push","query","callbackfn","clear","isRegistryEmpty"],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,IAAIA,WAAW,AAAC;QC2EPC,wBAAT,SAASA,sBAAsBC,IAAA;QAC3B,IAAIC,WAAWC,aAAaF,KAAKC,QAAQ;QACzC,OAAO,SAAUE,WAAA;YACb,IAAIC,MAAMC,MAAMC,OAAA,CAAQH,gBAAgB,CAACH,KAAKO,cAAA,GACxCJ,YAAYK,KAAA,KACZL;YACN,OAAO;gBACHM,KAAK,SAALA,IAAeC,MAAA;oBACX,OAAOC,UAAU,GAAGP,KAAKM,QAAQT;gBACrC;gBACAW,MAAM,SAANA,KAAgBF,MAAA;oBACZ,OAAOC,UAAU,CAAA,GAAIP,KAAKM,QAAQT;gBACtC;gBACAY,IAAI,SAAJA,GAAcH,MAAA;oBACV,OAAOC,UAAU,GAAGP,KAAKM,QAAQT;gBACrC;YACJ;QACJ;IACJ;QC9Fea,iBF8Ib,kJAAkJ;IE9IrI,SAAAA,eAAaC,CAAAA,EAAKC,CAAAA,EAAKC,CAAAA,EAAKC,CAAAA,EAAGC,CAAAA;QAAAA,IAC7CH,IAAMA,EAAII,KAAAA,GAAQJ,EAAII,KAAAA,CAAM,OAAOJ,GAC9BE,IAAI,GAAGA,IAAIF,EAAIK,MAAAA,EAAQH,IAC3BH,IAAMA,IAAMA,CAAAA,CAAIC,CAAAA,CAAIE,EAAAA,CAAAA,GAAMC;QAAAA,OAEpBJ,MAAQI,IAAQF,IAAMF;IAAAA;QCkCdO,sBAAT,SAASA,oBAAoBC,UAAA;QAElC,IAAMC,QAAQC,YAAYF;QAG1B,IAAMG,gBAAgB,SAACC;gBACrB,kCAAA,2BAAA;;gBAAA,QAAA,YAAoBtB,MAAMuB,IAAA,CAAKJ,2BAA/B,SAAA,6BAAA,QAAA,yBAAA,iCAAuC;oBAAvC,IAAWK,QAAX;oBACE,IAAsBA,0BAAAA,WAAfC,OAAeD,WAATE,QAASF;oBAEtB,IAAIf,eAAIa,WAAWG,UAAUC,OAAO;wBAClC,OAAO;oBACT;gBACF;;gBANA;gBAAA;;;yBAAA,6BAAA;wBAAA;;;wBAAA;8BAAA;;;;YAQA,OAAO;QACT;QAGAL,cAAcM,KAAA,GAAQR,MAAMS,IAAA;QAE5B,OAAOP;IACT;QChDSQ,qBJqKP,mHAAmH;IIrKrH,SAASA,mBAAmBC,IAAA;QAE1B,IAAMC,UAAU,SAACC;mBAAeF,SAASE;;QACzCD,QAAQJ,KAAA,GAAQ;QAEhB,OAAOI;IACT;IJhBE,IAAIE,YAAYC,OAAOC,cAAc;IACrC,IAAIC,mBAAmBF,OAAOG,wBAAwB;IACtD,IAAIC,oBAAoBJ,OAAOK,mBAAmB;IAClD,IAAIC,eAAeN,OAAOO,SAAS,CAACC,cAAc;IAClD,IAAIC,WAAW,SAACC,QAAQC;QACtB,IAAK,IAAIC,QAAQD,IACfZ,UAAUW,QAAQE,MAAM;YAAEC,KAAKF,GAAG,CAACC,KAAK;YAAEE,YAAY;QAAK;IAC/D;IACA,IAAIC,cAAc,SAACC,IAAI3B,MAAM4B,QAAQ5C;QACnC,IAAIgB,QAAQ,CAAA,OAAOA,qCAAP,SAAOA,KAAG,MAAM,YAAY,OAAOA,SAAS,YAAY;gBAC7D,kCAAA,2BAAA;;;oBAAA,IAAIZ,MAAJ;oBACH,IAAI,CAAC6B,aAAaY,IAAI,CAACF,IAAIvC,QAAQA,QAAQwC,QACzClB,UAAUiB,IAAIvC,KAAK;wBAAEoC,KAAK;mCAAMxB,IAAI,CAACZ,IAAI;;wBAAEqC,YAAY,CAAEzC,CAAAA,OAAO6B,iBAAiBb,MAAMZ,IAAG,KAAMJ,KAAKyC,UAAU;oBAAC;;gBAFpH,QAAK,YAAWV,kBAAkBf,0BAA7B,SAAA,6BAAA,QAAA,yBAAA;;gBAAA;gBAAA;;;yBAAA,6BAAA;wBAAA;;;wBAAA;8BAAA;;;;QAGP;QACA,OAAO2B;IACT;IACA,IAAIG,eAAe,SAACC;eAAQL,YAAYhB,UAAU,CAAC,GAAG,cAAc;YAAEP,OAAO;QAAK,IAAI4B;;IAEtF,mHAAmH;IIpBrH,IAAAC,cAAA,CAAA;IAAAZ,SAAAY,aAAA;QAAA9D,UAAA;mBAAAA;;QAAAwB,qBAAA;mBAAAA;;IAAA;IJ2BE,6JAA6J;ICzB/J,IAAIpB,eAAe,sBAAUD,QAAA;QAAY,OAAO,SAAU4D,CAAA,EAAGC,CAAA,EAAGC,KAAA;YAAS,OAAO9D,SAAS4D,GAAGC,GAAGC,SAASA;QAAO;IAAG;IAClH,IAAIC,gCAAgC,uCAAUC,SAAA,EAAWC,OAAA;QACrD,IAAID,WACA,MAAME,MAAM,0BAA0BD;IAC9C;IACA,IAAIE,qBAAqB,4BAAUC,SAAA;QAC/B,IAAIC,KAAKD,aAAa,CAAC,GAAG5D,MAAM6D,GAAG7D,GAAA,EAAKG,OAAO0D,GAAG1D,IAAA;QAClD,IAAImD,QAAQtD,MAAM,IAAI,CAAA;QACtB,IAAIC,SAAUD,OAAOG;QAErBoD,8BAA8B,CAACtD,QAAQ;QACvCsD,8BAA8BvD,OAAOG,MAAM;QAC3C,IAAIX,WAAWoE,UAAUpE,QAAA,IAAYC,aAAamE,UAAUpE,QAAQ;QACpE,OAAO;YAAE8D,OAAAA;YAAcrD,QAAAA;YAAgBT,UAAAA;QAAmB;IAC9D;IAEA,IAAIsE,8BAA8B,qCAAUC,gBAAAA;QACxC,OAAO,SAASC,oBAAoB/D,MAAA,EAAQgE,SAAA,EAAWC,KAAA,EAAOZ,KAAA,EAAO9D,QAAA,EAAU4D,CAAA,EAAGC,CAAA;YAC9E,IAAIc;YACJ,IAAIC;YACJ,IAAI,OAAOnE,WAAW,UAAU;gBAC5BkE,OAAOf,CAAA,CAAEnD,OAAM;gBACfmE,OAAOf,CAAA,CAAEpD,OAAM;YACnB,OAAA,IACS,OAAOA,WAAW,YAAY;gBACnCkE,OAAOlE,OAAOmD;gBACdgB,OAAOnE,OAAOoD;YAClB,OACK;gBACD,IAAIgB,qBAAqBV,mBAAmB1D;gBAC5C,OAAO+D,oBAAoBK,mBAAmBpE,MAAA,EAAQgE,WAAWC,OAAOG,mBAAmBf,KAAA,EAAOe,mBAAmB7E,QAAA,IAAYuE,kBAAiBX,GAAGC;YACzJ;YACA,IAAIiB,WAAW9E,SAAS2E,MAAMC,MAAMd;YACpC,IAAA,AAAKgB,CAAAA,aAAa,KAAMH,QAAQ,QAAQC,QAAQ,IAAA,KAC5CH,UAAUrD,MAAA,GAASsD,OAAO;gBAC1B,OAAOF,oBAAoBC,SAAA,CAAUC,MAAK,EAAGD,WAAWC,QAAQ,GAAGZ,OAAO9D,UAAU4D,GAAGC;YAC3F;YACA,OAAOiB;QACX;IACJ;IACA,SAASC,gBAAgBtE,MAAA,EAAQT,QAAA,EAAU8D,KAAA;QAEvC,IAAIrD,WAAW,KAAA,KAAaA,WAAW,MAAM;YACzC,OAAO,SAAUmD,CAAA,EAAGC,CAAA;gBAAK,OAAO7D,SAAS4D,GAAGC,GAAGC;YAAQ;QAC3D;QAEA,IAAI,OAAOrD,WAAW,UAAU;YAC5BsD,8BAA8BtD,OAAOuE,QAAA,CAAS,MAAM;YACpD,OAAO,SAAUpB,CAAA,EAAGC,CAAA;gBAAK,OAAO7D,SAAS4D,CAAA,CAAEnD,OAAM,EAAGoD,CAAA,CAAEpD,OAAM,EAAGqD;YAAQ;QAC3E;QAEA,IAAI,OAAOrD,WAAW,YAAY;YAC9B,OAAO,SAAUmD,CAAA,EAAGC,CAAA;gBAAK,OAAO7D,SAASS,OAAOmD,IAAInD,OAAOoD,IAAIC;YAAQ;QAC3E;QAEA,IAAI1D,MAAMC,OAAA,CAAQI,SAAS;YACvB,IAAIwE,oBAAoBX,4BAA4BtE;YACpD,OAAO,SAAU4D,CAAA,EAAGC,CAAA;gBAAK,OAAOoB,kBAAkBxE,MAAA,CAAO,EAAC,EAAGA,QAAQ,GAAGqD,OAAO9D,UAAU4D,GAAGC;YAAI;QACpG;QAEA,IAAIgB,qBAAqBV,mBAAmB1D;QAC5C,OAAOsE,gBAAgBF,mBAAmBpE,MAAA,EAAQoE,mBAAmB7E,QAAA,IAAYA,UAAU6E,mBAAmBf,KAAK;IACvH;IACA,IAAIpD,YAAY,mBAAUoD,KAAA,EAAO3D,GAAA,EAAKM,MAAA,EAAQT,QAAA;QAC1C,IAAIqE;QACJ,IAAI,CAACjE,MAAMC,OAAA,CAAQF,MAAM;YACrB,OAAOA;QACX;QAEA,IAAIC,MAAMC,OAAA,CAAQI,WAAWA,OAAOW,MAAA,GAAS,GAAG;YAC5CiD,KAAK5D,QAAQA,SAAS4D,EAAA,CAAG,EAAC;QAC9B;QACA,OAAOlE,IAAI+E,IAAA,CAAKH,gBAAgBtE,QAAQT,UAAU8D;IACtD;IAoBA,IAAIS,kBAAkB,yBAAUX,CAAA,EAAGC,CAAA,EAAGC,KAAA;QAClC,IAAIF,KAAK,MACL,OAAOE;QACX,IAAID,KAAK,MACL,OAAO,CAACC;QACZ,IAAI,CAAA,OAAOF,kCAAP,SAAOA,EAAAA,MAAM,CAAA,OAAOC,kCAAP,SAAOA,EAAAA,GAAG;YACvB,OAAO,CAAA,OAAOD,kCAAP,SAAOA,EAAAA,IAAI,CAAA,OAAOC,kCAAP,SAAOA,EAAAA,IAAI,CAAA,IAAK;QACtC;QACA,IAAID,IAAIC,GACJ,OAAO,CAAA;QACX,IAAID,IAAIC,GACJ,OAAO;QACX,OAAO;IACX;IACA,IAAIqB,OAAOpF,sBAAsB;QAC7BE,UAAUuE;IACd;IACA,IAAIY,cAAcrF,sBAAsB;QACpCE,UAAUuE;QACVjE,gBAAgB;IACpB;IDkCE,kIAAkI;IG5IpI,SAASkB,YACP4D,MAAA;YACAvD,OAAAA,iEAAiB,EAAC,EAClBN,QAAAA,iEAA4B,aAAA,GAAA,IAAI8D;YAEhC,kCAAA,2BAAA;;YAAA,QAAA,YAAkB/C,OAAOgD,IAAA,CAAKF,4BAA9B,SAAA,6BAAA,QAAA,yBAAA,iCAAuC;gBAAvC,IAAWrE,MAAX;gBACE,IAAMwE,MAAWH,MAAA,CAAOrE,IAAG;gBAC3B,IAAMyE,aAAa,AAAC,qBAAG3D,aAAJ;oBAAUd;iBAAG;gBAQhC,IAAI,CAAA,OAAOwE,oCAAP,SAAOA,IAAA,MAAQ,YAAYA,QAAQ,MAAM;oBAC3C/D,YAAY+D,KAAKC,YAAYjE;gBAC/B,OAAO;oBACLA,MAAMkE,GAAA,CAAID,YAAYD;gBACxB;YACF;;YAfA;YAAA;;;qBAAA,6BAAA;oBAAA;;;oBAAA;0BAAA;;;;QAiBA,OAAOhE;IACT;ICGO,IAAM1B,yBAAN;iBAAMA,SAUC6F,UAAA,EAA8BC,MAAA;;oCAV/B9F;YACX,IAAA,CAAQ+F,KAAA,GAAiC,EAAC;YAUxC,IAAA,CAAKD,MAAA,GAASA;YACdD,uBAAAA,iCAAAA,WAAYG,OAAA,CAAQ;yDAAEzD,mBAAON;gBAC3B,MAAK2D,GAAA,CAAIrD,OAAON;YAClB;;;;gBACF;;;;;;;;KAAA,GAWA2D,KAAAA;uBAAAA,SAAAA,IAAIrD,KAAA,EAAYN,KAAA;oBACd,IAAMK,UACJ,CAAA,OAAOC,sCAAP,SAAOA,MAAA,MAAU,WACbf,oBAAoBe,SACpBH,mBAAmBG;oBAIzB,IAAM0D,gBAAgB,IAAA,CAAKF,KAAA,CAAMG,SAAA,CAC/B,SAACnE;+BAAUA,MAAMO,OAAA,CAAQC,UAAUD,QAAQP,MAAMb,GAAG;;oBAEtD,IAAI+E,kBAAkB,CAAA,GAAI;4BAExB,oBAAA;wBADA,IAAA,CAAKF,KAAA,CAAMI,MAAA,CAAOF,eAAe;yBACjC,eAAA,IAAA,CAAKH,MAAA,cAAL,oCAAA,qBAAA,aAAaM,KAAA,cAAb,yCAAA,wBAAA,cACE,+CACA7D;oBAEJ;oBAEA,IAAA,CAAKwD,KAAA,CAAMM,IAAA,CAAK;wBACdnF,KAAKqB;wBACLN,OAAAA;wBACAK,SAAAA;oBACF;oBAGA,IAAA,CAAKyD,KAAA,GAAQV,KAAK,IAAA,CAAKU,KAAK,EAAEjF,IAAA,CAAK,SAACiB;+BAAUA,MAAMO,OAAA,CAAQJ,KAAK;;gBACnE;;;gBAAA;;;;;;;;;KAAA,GAYAoB,KAAAA;uBAAAA,SAAAA,IAAIgD,KAAA;wBAEF,kCAAA,2BAAA;;wBAAA,QAAA,YAAoB,IAAA,CAAKP,KAAA,qBAAzB,SAAA,6BAAA,QAAA,yBAAA,iCAAgC;4BAAhC,IAAWhE,QAAX;4BACE,IAAIA,MAAMO,OAAA,CAAQgE,QAAQ;gCACxB,OAAOvE,MAAME,KAAA;4BACf;wBACF;;wBAJA;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAKA,OAAO,KAAA;gBACT;;;gBAAA,2CAAA,GAGA+D,KAAAA;uBAAAA,SAAAA,QAAQO,UAAA;wBACN,kCAAA,2BAAA;;wBAAA,QAAA,YAAoB,IAAA,CAAKR,KAAA,qBAAzB,SAAA,6BAAA,QAAA,yBAAA,iCAAgC;4BAAhC,IAAWhE,QAAX;4BACEwE,WAAWxE;wBACb;;wBAFA;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;gBAGF;;;gBAAA,oCAAA,GAGAyE,KAAAA;uBAAAA,SAAAA;oBACE,IAAA,CAAKT,KAAA,GAAQ,EAAC;gBAChB;;;gBAAA,kCAAA,GAGAU,KAAAA;uBAAAA,SAAAA;oBACE,OAAO,IAAA,CAAKV,KAAA,CAAMxE,MAAA,KAAW;gBAC/B;;;;;IJqIA,OAAOqC,aAAaE;AACtB","sourcesContent":["\"use strict\";\nvar Registry = (() => {\n var __defProp = Object.defineProperty;\n var __getOwnPropDesc = Object.getOwnPropertyDescriptor;\n var __getOwnPropNames = Object.getOwnPropertyNames;\n var __hasOwnProp = Object.prototype.hasOwnProperty;\n var __export = (target, all) => {\n for (var name in all)\n __defProp(target, name, { get: all[name], enumerable: true });\n };\n var __copyProps = (to, from, except, desc) => {\n if (from && typeof from === \"object\" \|\| typeof from === \"function\") {\n for (let key of __getOwnPropNames(from))\n if (!__hasOwnProp.call(to, key) && key !== except)\n __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) \|\| desc.enumerable });\n }\n return to;\n };\n var __toCommonJS = (mod) => __copyProps(__defProp({}, \"__esModule\", { value: true }), mod);\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/index.ts\n var src_exports = {};\n __export(src_exports, {\n Registry: () => Registry,\n createObjectMatcher: () => createObjectMatcher\n });\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/fast-sort@3.4.1/node_modules/fast-sort/dist/sort.mjs\n var castComparer = function(comparer) {\n return function(a, b, order) {\n return comparer(a, b, order) * order;\n };\n };\n var throwInvalidConfigErrorIfTrue = function(condition, context) {\n if (condition)\n throw Error(\"Invalid sort config: \" + context);\n };\n var unpackObjectSorter = function(sortByObj) {\n var _a = sortByObj \|\| {}, asc = _a.asc, desc = _a.desc;\n var order = asc ? 1 : -1;\n var sortBy = asc \|\| desc;\n throwInvalidConfigErrorIfTrue(!sortBy, \"Expected `asc` or `desc` property\");\n throwInvalidConfigErrorIfTrue(asc && desc, \"Ambiguous object with `asc` and `desc` config properties\");\n var comparer = sortByObj.comparer && castComparer(sortByObj.comparer);\n return { order, sortBy, comparer };\n };\n var multiPropertySorterProvider = function(defaultComparer2) {\n return function multiPropertySorter(sortBy, sortByArr, depth, order, comparer, a, b) {\n var valA;\n var valB;\n if (typeof sortBy === \"string\") {\n valA = a[sortBy];\n valB = b[sortBy];\n } else if (typeof sortBy === \"function\") {\n valA = sortBy(a);\n valB = sortBy(b);\n } else {\n var objectSorterConfig = unpackObjectSorter(sortBy);\n return multiPropertySorter(objectSorterConfig.sortBy, sortByArr, depth, objectSorterConfig.order, objectSorterConfig.comparer \|\| defaultComparer2, a, b);\n }\n var equality = comparer(valA, valB, order);\n if ((equality === 0 \|\| valA == null && valB == null) && sortByArr.length > depth) {\n return multiPropertySorter(sortByArr[depth], sortByArr, depth + 1, order, comparer, a, b);\n }\n return equality;\n };\n };\n function getSortStrategy(sortBy, comparer, order) {\n if (sortBy === void 0 \|\| sortBy === true) {\n return function(a, b) {\n return comparer(a, b, order);\n };\n }\n if (typeof sortBy === \"string\") {\n throwInvalidConfigErrorIfTrue(sortBy.includes(\".\"), \"String syntax not allowed for nested properties.\");\n return function(a, b) {\n return comparer(a[sortBy], b[sortBy], order);\n };\n }\n if (typeof sortBy === \"function\") {\n return function(a, b) {\n return comparer(sortBy(a), sortBy(b), order);\n };\n }\n if (Array.isArray(sortBy)) {\n var multiPropSorter_1 = multiPropertySorterProvider(comparer);\n return function(a, b) {\n return multiPropSorter_1(sortBy[0], sortBy, 1, order, comparer, a, b);\n };\n }\n var objectSorterConfig = unpackObjectSorter(sortBy);\n return getSortStrategy(objectSorterConfig.sortBy, objectSorterConfig.comparer \|\| comparer, objectSorterConfig.order);\n }\n var sortArray = function(order, ctx, sortBy, comparer) {\n var _a;\n if (!Array.isArray(ctx)) {\n return ctx;\n }\n if (Array.isArray(sortBy) && sortBy.length < 2) {\n _a = sortBy, sortBy = _a[0];\n }\n return ctx.sort(getSortStrategy(sortBy, comparer, order));\n };\n function createNewSortInstance(opts) {\n var comparer = castComparer(opts.comparer);\n return function(arrayToSort) {\n var ctx = Array.isArray(arrayToSort) && !opts.inPlaceSorting ? arrayToSort.slice() : arrayToSort;\n return {\n asc: function(sortBy) {\n return sortArray(1, ctx, sortBy, comparer);\n },\n desc: function(sortBy) {\n return sortArray(-1, ctx, sortBy, comparer);\n },\n by: function(sortBy) {\n return sortArray(1, ctx, sortBy, comparer);\n }\n };\n };\n }\n var defaultComparer = function(a, b, order) {\n if (a == null)\n return order;\n if (b == null)\n return -order;\n if (typeof a !== typeof b) {\n return typeof a < typeof b ? -1 : 1;\n }\n if (a < b)\n return -1;\n if (a > b)\n return 1;\n return 0;\n };\n var sort = createNewSortInstance({\n comparer: defaultComparer\n });\n var inPlaceSort = createNewSortInstance({\n comparer: defaultComparer,\n inPlaceSorting: true\n });\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/node_modules/.aspect_rules_js/dlv@1.1.3/node_modules/dlv/dist/dlv.es.js\n function dlv_es_default(t, e, l, n, r) {\n for (e = e.split ? e.split(\".\") : e, n = 0; n < e.length; n++)\n t = t ? t[e[n]] : r;\n return t === r ? l : t;\n }\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/deep-partial-matcher.ts\n function traverseObj(object, path = [], pairs = /* @__PURE__ / new Map()) {\n for (const key of Object.keys(object)) {\n const val = object[key];\n const nestedPath = [...path, key];\n if (typeof val === \"object\" && val !== null) {\n traverseObj(val, nestedPath, pairs);\n } else {\n pairs.set(nestedPath, val);\n }\n }\n return pairs;\n }\n function createObjectMatcher(partialObj) {\n const pairs = traverseObj(partialObj);\n const matchFunction = (searchObj) => {\n for (const entry of Array.from(pairs)) {\n const [path, value] = entry;\n if (dlv_es_default(searchObj, path) !== value) {\n return false;\n }\n }\n return true;\n };\n matchFunction.count = pairs.size;\n return matchFunction;\n }\n\n // ../../../../../../../../../../execroot/_main/bazel-out/k8-fastbuild/bin/core/partial-match-registry/src/index.ts\n function createBasicMatcher(seed) {\n const matcher = (match) => seed === match;\n matcher.count = 1;\n return matcher;\n }\n var Registry = class {\n /\n Creates a new Registry instance\n \n @param initialSet - Optional array of [key, value] tuples to populate the registry\n * @param logger - Optional logger instance for debug logging (e.g., when entries are replaced)\n /\n constructor(initialSet, logger) {\n this.store = [];\n this.logger = logger;\n initialSet?.forEach(([match, value]) => {\n this.set(match, value);\n });\n }\n /\n Add match -> value mapping to the registry\n \n If an entry with the same specificity and matching key already exists, it will be replaced\n * and a debug log will be emitted (if a logger is configured).\n \n @param match - The key to match against (can be a primitive or object)\n * @param value - The value to associate with this key\n /\n set(match, value) {\n const matcher = typeof match === \"object\" ? createObjectMatcher(match) : createBasicMatcher(match);\n const existingIndex = this.store.findIndex(\n (entry) => entry.matcher(match) && matcher(entry.key)\n );\n if (existingIndex !== -1) {\n this.store.splice(existingIndex, 1);\n this.logger?.debug?.(\n \"Registry: Replacing existing entry for key \",\n match\n );\n }\n this.store.push({\n key: match,\n value,\n matcher\n });\n this.store = sort(this.store).desc((entry) => entry.matcher.count);\n }\n /\n Fetch the best match in the registry\n \n Searches for the most specific entry that matches the given query.\n * The registry is sorted by specificity (matcher.count) in descending order,\n * so we iterate forward to find the highest specificity match first.\n \n @param query - The query object to match against registered keys\n * @returns The value associated with the best matching key, or undefined if no match found\n /\n get(query) {\n for (const entry of this.store) {\n if (entry.matcher(query)) {\n return entry.value;\n }\n }\n return void 0;\n }\n /* Loop over all entries and run callback /\n forEach(callbackfn) {\n for (const entry of this.store) {\n callbackfn(entry);\n }\n }\n /* Reset the items in the registry /\n clear() {\n this.store = [];\n }\n /* Check if the registry is empty/\n isRegistryEmpty() {\n return this.store.length === 0;\n }\n };\n return __toCommonJS(src_exports);\n})();\n","// >>> INTERFACES <<<\r\n// >>> HELPERS <<<\r\nvar castComparer = function (comparer) { return function (a, b, order) { return comparer(a, b, order) order; }; };\r\nvar throwInvalidConfigErrorIfTrue = function (condition, context) {\r\n if (condition)\r\n throw Error(\"Invalid sort config: \" + context);\r\n};\r\nvar unpackObjectSorter = function (sortByObj) {\r\n var _a = sortByObj \|\| {}, asc = _a.asc, desc = _a.desc;\r\n var order = asc ? 1 : -1;\r\n var sortBy = (asc \|\| desc);\r\n // Validate object config\r\n throwInvalidConfigErrorIfTrue(!sortBy, 'Expected `asc` or `desc` property');\r\n throwInvalidConfigErrorIfTrue(asc && desc, 'Ambiguous object with `asc` and `desc` config properties');\r\n var comparer = sortByObj.comparer && castComparer(sortByObj.comparer);\r\n return { order: order, sortBy: sortBy, comparer: comparer };\r\n};\r\n// >>> SORTERS <<<\r\nvar multiPropertySorterProvider = function (defaultComparer) {\r\n return function multiPropertySorter(sortBy, sortByArr, depth, order, comparer, a, b) {\r\n var valA;\r\n var valB;\r\n if (typeof sortBy === 'string') {\r\n valA = a[sortBy];\r\n valB = b[sortBy];\r\n }\r\n else if (typeof sortBy === 'function') {\r\n valA = sortBy(a);\r\n valB = sortBy(b);\r\n }\r\n else {\r\n var objectSorterConfig = unpackObjectSorter(sortBy);\r\n return multiPropertySorter(objectSorterConfig.sortBy, sortByArr, depth, objectSorterConfig.order, objectSorterConfig.comparer \|\| defaultComparer, a, b);\r\n }\r\n var equality = comparer(valA, valB, order);\r\n if ((equality === 0 \|\| (valA == null && valB == null)) &&\r\n sortByArr.length > depth) {\r\n return multiPropertySorter(sortByArr[depth], sortByArr, depth + 1, order, comparer, a, b);\r\n }\r\n return equality;\r\n };\r\n};\r\nfunction getSortStrategy(sortBy, comparer, order) {\r\n // Flat array sorter\r\n if (sortBy === undefined \|\| sortBy === true) {\r\n return function (a, b) { return comparer(a, b, order); };\r\n }\r\n // Sort list of objects by single object key\r\n if (typeof sortBy === 'string') {\r\n throwInvalidConfigErrorIfTrue(sortBy.includes('.'), 'String syntax not allowed for nested properties.');\r\n return function (a, b) { return comparer(a[sortBy], b[sortBy], order); };\r\n }\r\n // Sort list of objects by single function sorter\r\n if (typeof sortBy === 'function') {\r\n return function (a, b) { return comparer(sortBy(a), sortBy(b), order); };\r\n }\r\n // Sort by multiple properties\r\n if (Array.isArray(sortBy)) {\r\n var multiPropSorter_1 = multiPropertySorterProvider(comparer);\r\n return function (a, b) { return multiPropSorter_1(sortBy[0], sortBy, 1, order, comparer, a, b); };\r\n }\r\n // Unpack object config to get actual sorter strategy\r\n var objectSorterConfig = unpackObjectSorter(sortBy);\r\n return getSortStrategy(objectSorterConfig.sortBy, objectSorterConfig.comparer \|\| comparer, objectSorterConfig.order);\r\n}\r\nvar sortArray = function (order, ctx, sortBy, comparer) {\r\n var _a;\r\n if (!Array.isArray(ctx)) {\r\n return ctx;\r\n }\r\n // Unwrap sortBy if array with only 1 value to get faster sort strategy\r\n if (Array.isArray(sortBy) && sortBy.length < 2) {\r\n _a = sortBy, sortBy = _a[0];\r\n }\r\n return ctx.sort(getSortStrategy(sortBy, comparer, order));\r\n};\r\nfunction createNewSortInstance(opts) {\r\n var comparer = castComparer(opts.comparer);\r\n return function (arrayToSort) {\r\n var ctx = Array.isArray(arrayToSort) && !opts.inPlaceSorting\r\n ? arrayToSort.slice()\r\n : arrayToSort;\r\n return {\r\n asc: function (sortBy) {\r\n return sortArray(1, ctx, sortBy, comparer);\r\n },\r\n desc: function (sortBy) {\r\n return sortArray(-1, ctx, sortBy, comparer);\r\n },\r\n by: function (sortBy) {\r\n return sortArray(1, ctx, sortBy, comparer);\r\n },\r\n };\r\n };\r\n}\r\nvar defaultComparer = function (a, b, order) {\r\n if (a == null)\r\n return order;\r\n if (b == null)\r\n return -order;\r\n if (typeof a !== typeof b) {\r\n return typeof a < typeof b ? -1 : 1;\r\n }\r\n if (a < b)\r\n return -1;\r\n if (a > b)\r\n return 1;\r\n return 0;\r\n};\r\nvar sort = createNewSortInstance({\r\n comparer: defaultComparer,\r\n});\r\nvar inPlaceSort = createNewSortInstance({\r\n comparer: defaultComparer,\r\n inPlaceSorting: true,\r\n});\n\nexport { createNewSortInstance, defaultComparer, inPlaceSort, sort };\n","export default function dlv(obj, key, def, p, undef) {\n\tkey = key.split ? key.split('.') : key;\n\tfor (p = 0; p < key.length; p++) {\n\t\tobj = obj ? obj[key[p]] : undef;\n\t}\n\treturn obj === undef ? def : obj;\n}\n","import dlv from \"dlv\";\n\n/** A function that checks overlapping properties against a reference value /\nexport type Matcher = ((searchObj: object) => boolean) & {\n /* The count represents the specificity of this matcher /\n count: number;\n};\n\n/* Traverse an object and collect any key/value pairs including nested keys /\nfunction traverseObj(\n object: Record<any, any>,\n path: string[] = [],\n pairs: Map<string[], any> = new Map(),\n): Map<string[], any> {\n for (const key of Object.keys(object)) {\n const val: any = object[key];\n const nestedPath = [...path, key];\n\n / Explicitly avoid traversing null values.\n JavaScript's typeof null === \"object\" would otherwise cause the function to traverse null as an object\n and throw an error. \n \n Ref: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof#typeof_null\n /\n if (typeof val === \"object\" && val !== null) {\n traverseObj(val, nestedPath, pairs);\n } else {\n pairs.set(nestedPath, val);\n }\n }\n\n return pairs;\n}\n\n/\n Given a partial object, create a matcher function that checks if another object matches the specified properties\n * @param partialObj The partial object to match against\n * @returns A matcher function that checks if an object matches the partial object\n /\nexport function createObjectMatcher(partialObj: object): Matcher {\n // Convert the partial object into a list of [key, value] pairs;\n const pairs = traverseObj(partialObj);\n\n /* Generate a function to match against all of the properties we care about /\n const matchFunction = (searchObj: object) => {\n for (const entry of Array.from(pairs)) {\n const [path, value] = entry;\n\n if (dlv(searchObj, path) !== value) {\n return false;\n }\n }\n\n return true;\n };\n\n // Keep track of the specificity of the comparator\n matchFunction.count = pairs.size;\n\n return matchFunction;\n}\n","import { sort } from \"fast-sort\";\nimport type { Matcher } from \"./deep-partial-matcher\";\nimport { createObjectMatcher } from \"./deep-partial-matcher\";\n\nexport { createObjectMatcher } from \"./deep-partial-matcher\";\n\n/* Minimal logger interface for registry operations /\ninterface Logger {\n debug?: (...args: Array<any>) => void;\n}\n\n/* create a matcher function that matches exactly /\nfunction createBasicMatcher(seed: any): Matcher {\n /* a simple matcher function that only matches itself /\n const matcher = (match: any) => seed === match;\n matcher.count = 1;\n\n return matcher;\n}\n\ninterface RegistryIndex<V> {\n /* The original object we wanted to match on /\n key: object;\n\n /* The value to return /\n value: V;\n\n /* The matcher function for this entry /\n matcher: Matcher;\n}\n\n/\n A partial match registry is a map that uses an object to \"match\" against keys.\n * More specific matches take precedence over less specific ones.\n /\nexport class Registry<V> {\n private store: Array<RegistryIndex<V>> = [];\n private logger?: Logger;\n\n /\n Creates a new Registry instance\n \n @param initialSet - Optional array of [key, value] tuples to populate the registry\n * @param logger - Optional logger instance for debug logging (e.g., when entries are replaced)\n /\n constructor(initialSet?: Array<[any, V]>, logger?: Logger) {\n this.logger = logger;\n initialSet?.forEach(([match, value]) => {\n this.set(match, value);\n });\n }\n\n /\n Add match -> value mapping to the registry\n \n If an entry with the same specificity and matching key already exists, it will be replaced\n * and a debug log will be emitted (if a logger is configured).\n \n @param match - The key to match against (can be a primitive or object)\n * @param value - The value to associate with this key\n /\n set(match: any, value: V): void {\n const matcher =\n typeof match === \"object\"\n ? createObjectMatcher(match)\n : createBasicMatcher(match);\n\n // Find and remove any existing entry that matches this key\n // Use matcher to check for matching keys (handles deep equality)\n const existingIndex = this.store.findIndex(\n (entry) => entry.matcher(match) && matcher(entry.key),\n );\n if (existingIndex !== -1) {\n this.store.splice(existingIndex, 1);\n this.logger?.debug?.(\n \"Registry: Replacing existing entry for key \",\n match,\n );\n }\n\n this.store.push({\n key: match,\n value,\n matcher,\n });\n\n // Sort in descending order by matcher.count (highest specificity first)\n this.store = sort(this.store).desc((entry) => entry.matcher.count);\n }\n\n /\n Fetch the best match in the registry\n \n Searches for the most specific entry that matches the given query.\n * The registry is sorted by specificity (matcher.count) in descending order,\n * so we iterate forward to find the highest specificity match first.\n \n @param query - The query object to match against registered keys\n * @returns The value associated with the best matching key, or undefined if no match found\n /\n get(query: any): V \| undefined {\n // Store is sorted by matcher.count (descending), so iterate forward\n for (const entry of this.store) {\n if (entry.matcher(query)) {\n return entry.value;\n }\n }\n return undefined;\n }\n\n /* Loop over all entries and run callback /\n forEach(callbackfn: (value: RegistryIndex<V>) => void): void {\n for (const entry of this.store) {\n callbackfn(entry);\n }\n }\n\n /* Reset the items in the registry /\n clear(): void {\n this.store = [];\n }\n\n /* Check if the registry is empty*/\n isRegistryEmpty(): boolean {\n return this.store.length === 0;\n }\n}\n"]}

package/package.json CHANGED Viewed

@@ -6,7 +6,7 @@
     "types"
   ],
   "name": "@player-ui/partial-match-registry",
-  "version": "1.0.1",
+  "version": "1.0.2--canary.890.38467",
   "main": "dist/cjs/index.cjs",
   "module": "dist/index.legacy-esm.js",
   "types": "types/index.d.ts",