@stamhoofd/structures 2.119.0 → 2.120.1

package/dist/src/helpers/MemberPlatformMembershipHelper.d.ts

@@ -1,12 +0,0 @@
-import { MemberPlatformMembership } from '../members/MemberPlatformMembership.js';
-import { ContinuousMembershipStatus, MembershipStatus } from '../members/MembershipStatus.js';
-export declare class MemberPlatformMembershipHelper {
-    static getStatus(memberships: MemberPlatformMembership[]): MembershipStatus;
-    static getContinuousMembershipStatus({ memberships, start, end }: {
-        memberships: MemberPlatformMembership[];
-        start: Date;
-        end: Date;
-    }): ContinuousMembershipStatus;
-    static hasFutureMembership(memberships: MemberPlatformMembership[]): boolean;
-}
-//# sourceMappingURL=MemberPlatformMembershipHelper.d.ts.map

package/dist/src/helpers/MemberPlatformMembershipHelper.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemberPlatformMembershipHelper.d.ts","sourceRoot":"","sources":["../../../src/helpers/MemberPlatformMembershipHelper.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,wBAAwB,EAAE,MAAM,wCAAwC,CAAC;AAClF,OAAO,EAAE,0BAA0B,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAE9F,qBAAa,8BAA8B;IACvC,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,wBAAwB,EAAE;IAyCxD,MAAM,CAAC,6BAA6B,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;QAAE,WAAW,EAAE,wBAAwB,EAAE,CAAC;QAAC,KAAK,EAAE,IAAI,CAAC;QAAC,GAAG,EAAE,IAAI,CAAA;KAAE,GAAG,0BAA0B;IAkClK,MAAM,CAAC,mBAAmB,CAAC,WAAW,EAAE,wBAAwB,EAAE,GAAG,OAAO;CAI/E"}

package/dist/src/helpers/MemberPlatformMembershipHelper.js

@@ -1,74 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MemberPlatformMembershipHelper = void 0;
-const MembershipStatus_js_1 = require("../members/MembershipStatus.js");
-class MemberPlatformMembershipHelper {
-    static getStatus(memberships) {
-        let status = MembershipStatus_js_1.MembershipStatus.Inactive;
-        const now = new Date();
-        for (const membership of memberships) {
-            if (membership.endDate && membership.endDate < now) {
-                continue;
-            }
-            if (membership.startDate > now) {
-                continue;
-            }
-            if (membership.expireDate && membership.expireDate < now) {
-                if (status === MembershipStatus_js_1.MembershipStatus.Inactive) {
-                    status = MembershipStatus_js_1.MembershipStatus.Expiring;
-                }
-                continue;
-            }
-            const isTemporary = membership.endDate.getTime() - membership.startDate.getTime() < 1000 * 60 * 60 * 24 * 31;
-            if (status === MembershipStatus_js_1.MembershipStatus.Inactive || ((status === MembershipStatus_js_1.MembershipStatus.Expiring || status === MembershipStatus_js_1.MembershipStatus.Temporary) && !isTemporary)) {
-                if (isTemporary) {
-                    status = MembershipStatus_js_1.MembershipStatus.Temporary;
-                }
-                else {
-                    if (membership.trialUntil && membership.trialUntil > now) {
-                        status = MembershipStatus_js_1.MembershipStatus.Trial;
-                    }
-                    else {
-                        status = MembershipStatus_js_1.MembershipStatus.Active;
-                        break;
-                    }
-                }
-            }
-        }
-        return status;
-    }
-    static getContinuousMembershipStatus({ memberships, start, end }) {
-        const sorted = memberships
-            // filter memberships in period
-            .filter(m => m.endDate > start && m.startDate < end)
-            // sort by start date (earliest first)
-            .sort((a, b) => a.startDate.getTime() - b.startDate.getTime());
-        // date until when there is a membership
-        let coveredDate = start;
-        for (const t of sorted) {
-            if (t.startDate <= coveredDate) {
-                if (t.endDate > coveredDate) {
-                    coveredDate = t.endDate;
-                }
-            }
-            // there is a gap -> partially covered
-            else {
-                return MembershipStatus_js_1.ContinuousMembershipStatus.Partial;
-            }
-        }
-        if (coveredDate >= end) {
-            return MembershipStatus_js_1.ContinuousMembershipStatus.Full;
-        }
-        // if there is at least one membership in the period
-        if (sorted.length > 0) {
-            return MembershipStatus_js_1.ContinuousMembershipStatus.Partial;
-        }
-        return MembershipStatus_js_1.ContinuousMembershipStatus.None;
-    }
-    static hasFutureMembership(memberships) {
-        const now = new Date();
-        return memberships.some(m => m.startDate > now);
-    }
-}
-exports.MemberPlatformMembershipHelper = MemberPlatformMembershipHelper;
-//# sourceMappingURL=MemberPlatformMembershipHelper.js.map

package/dist/src/helpers/MemberPlatformMembershipHelper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemberPlatformMembershipHelper.js","sourceRoot":"","sources":["../../../src/helpers/MemberPlatformMembershipHelper.ts"],"names":[],"mappings":";;;AACA,wEAA8F;AAE9F,MAAa,8BAA8B;IACvC,MAAM,CAAC,SAAS,CAAC,WAAuC;QACpD,IAAI,MAAM,GAAG,sCAAgB,CAAC,QAAQ,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACnC,IAAI,UAAU,CAAC,OAAO,IAAI,UAAU,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;gBACjD,SAAS;YACb,CAAC;YAED,IAAI,UAAU,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC;gBAC7B,SAAS;YACb,CAAC;YAED,IAAI,UAAU,CAAC,UAAU,IAAI,UAAU,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBACvD,IAAI,MAAM,KAAK,sCAAgB,CAAC,QAAQ,EAAE,CAAC;oBACvC,MAAM,GAAG,sCAAgB,CAAC,QAAQ,CAAC;gBACvC,CAAC;gBACD,SAAS;YACb,CAAC;YAED,MAAM,WAAW,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAE7G,IAAI,MAAM,KAAK,sCAAgB,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,sCAAgB,CAAC,QAAQ,IAAI,MAAM,KAAK,sCAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC5I,IAAI,WAAW,EAAE,CAAC;oBACd,MAAM,GAAG,sCAAgB,CAAC,SAAS,CAAC;gBACxC,CAAC;qBACI,CAAC;oBACF,IAAI,UAAU,CAAC,UAAU,IAAI,UAAU,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;wBACvD,MAAM,GAAG,sCAAgB,CAAC,KAAK,CAAC;oBACpC,CAAC;yBACI,CAAC;wBACF,MAAM,GAAG,sCAAgB,CAAC,MAAM,CAAC;wBACjC,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,MAAM,CAAC,6BAA6B,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAuE;QACjI,MAAM,MAAM,GAAG,WAAW;YACtB,+BAA+B;aAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC;YACpD,sCAAsC;aACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;QAEnE,wCAAwC;QACxC,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,SAAS,IAAI,WAAW,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,OAAO,GAAG,WAAW,EAAE,CAAC;oBAC1B,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC;gBAC5B,CAAC;YACL,CAAC;YACD,sCAAsC;iBACjC,CAAC;gBACF,OAAO,gDAA0B,CAAC,OAAO,CAAC;YAC9C,CAAC;QACL,CAAC;QAED,IAAI,WAAW,IAAI,GAAG,EAAE,CAAC;YACrB,OAAO,gDAA0B,CAAC,IAAI,CAAC;QAC3C,CAAC;QAED,oDAAoD;QACpD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,gDAA0B,CAAC,OAAO,CAAC;QAC9C,CAAC;QAED,OAAO,gDAA0B,CAAC,IAAI,CAAC;IAC3C,CAAC;IAED,MAAM,CAAC,mBAAmB,CAAC,WAAuC;QAC9D,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;IACpD,CAAC;CACJ;AAhFD,wEAgFC"}

package/dist/src/helpers/TagHelper.d.ts

@@ -1,22 +0,0 @@
-import { OrganizationTag } from '../Platform.js';
-export declare class TagHelper {
-    /**
-     * Get the root tags from the tags array.
-     * A root tag is a tag that is not a child of another tag in the array.
-     * @param tags
-     */
-    static getRootTags(tags: OrganizationTag[]): OrganizationTag[];
-    /**
-     * Checks if a tag with the provided id contains the tag with the id to search recursively.
-     * @param tagId id of the tag to search into
-     * @param tagIdToSearch id of the tag to search inside the tag
-     * @param tagMap a map of all the tags
-     * @returns true if the tag contains the tag to search recursively or false otherwise
-     */
-    static containsDeep(tagId: string, tagIdToSearch: string, tags: {
-        allTags: OrganizationTag[];
-    } | {
-        tagMap: Map<string, OrganizationTag>;
-    }): boolean;
-}
-//# sourceMappingURL=TagHelper.d.ts.map

package/dist/src/helpers/TagHelper.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TagHelper.d.ts","sourceRoot":"","sources":["../../../src/helpers/TagHelper.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAEjD,qBAAa,SAAS;IAClB;;;;OAIG;IACH,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,eAAe,EAAE;IA0B1C;;;;;;OAMG;IACH,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,IAAI,EAAE;QAAE,OAAO,EAAE,eAAe,EAAE,CAAA;KAAE,GAAG;QAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAA;KAAE,GAAG,OAAO;CAyBtJ"}

package/dist/src/helpers/TagHelper.js

@@ -1,60 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TagHelper = void 0;
-class TagHelper {
-    /**
-     * Get the root tags from the tags array.
-     * A root tag is a tag that is not a child of another tag in the array.
-     * @param tags
-     */
-    static getRootTags(tags) {
-        const result = [];
-        for (const tag of tags) {
-            const tagId = tag.id;
-            let isRootTag = true;
-            for (const otherTag of tags) {
-                const otherTagId = otherTag.id;
-                if (tagId === otherTagId) {
-                    continue;
-                }
-                if (otherTag.childTags.includes(tagId)) {
-                    isRootTag = false;
-                    break;
-                }
-            }
-            if (isRootTag) {
-                result.push(tag);
-            }
-        }
-        return result;
-    }
-    /**
-     * Checks if a tag with the provided id contains the tag with the id to search recursively.
-     * @param tagId id of the tag to search into
-     * @param tagIdToSearch id of the tag to search inside the tag
-     * @param tagMap a map of all the tags
-     * @returns true if the tag contains the tag to search recursively or false otherwise
-     */
-    static containsDeep(tagId, tagIdToSearch, tags) {
-        const tagMap = 'tagMap' in tags ? tags.tagMap : new Map(tags.allTags.map(tag => [tag.id, tag]));
-        const tag = tagMap.get(tagId);
-        if (!tag) {
-            // should not happen
-            return false;
-        }
-        if (tag.childTags.length === 0) {
-            return false;
-        }
-        if (tag.childTags.includes(tagIdToSearch)) {
-            return true;
-        }
-        for (const childTagId of tag.childTags) {
-            if (this.containsDeep(childTagId, tagIdToSearch, { tagMap })) {
-                return true;
-            }
-        }
-        return false;
-    }
-}
-exports.TagHelper = TagHelper;
-//# sourceMappingURL=TagHelper.js.map

package/dist/src/helpers/TagHelper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TagHelper.js","sourceRoot":"","sources":["../../../src/helpers/TagHelper.ts"],"names":[],"mappings":";;;AAEA,MAAa,SAAS;IAClB;;;;OAIG;IACH,MAAM,CAAC,WAAW,CAAC,IAAuB;QACtC,MAAM,MAAM,GAAsB,EAAE,CAAC;QAErC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,SAAS,GAAG,IAAI,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE,CAAC;gBAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC,EAAE,CAAC;gBAC/B,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;oBACvB,SAAS;gBACb,CAAC;gBAED,IAAI,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrC,SAAS,GAAG,KAAK,CAAC;oBAClB,MAAM;gBACV,CAAC;YACL,CAAC;YAED,IAAI,SAAS,EAAE,CAAC;gBACZ,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,YAAY,CAAC,KAAa,EAAE,aAAqB,EAAE,IAA+E;QACrI,MAAM,MAAM,GAAG,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAEhG,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,EAAE,CAAC;YACP,oBAAoB;YACpB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,aAAa,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;gBAC3D,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AAhED,8BAgEC"}

package/dist/src/helpers/calculateHungarianAlgorithm.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateHungarianAlgorithm.d.ts","sourceRoot":"","sources":["../../../src/helpers/calculateHungarianAlgorithm.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,2BAA2B,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAyF7E"}

package/dist/src/helpers/calculateHungarianAlgorithm.js

@@ -1,85 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.calculateHungarianAlgorithm = calculateHungarianAlgorithm;
-/**
- * Optimized algorithm to maximize the total discount
- * Returns an array where each index corresponds to the nth discount for each item
- * @param priceMatrix A 2D array where priceMatrix[i][j] represents the discount amount for the ith item at the jth position
- */
-function calculateHungarianAlgorithm(priceMatrix) {
-    // No items to process
-    if (priceMatrix.length === 0) {
-        return [];
-    }
-    if (priceMatrix.length > 500) {
-        throw new Error('Too many items to process. Maximum is 500.');
-    }
-    // Convert to cost minimization problem by negating values (since we want to maximize discount)
-    const C = priceMatrix.map(row => row.map(val => -val));
-    const J = C.length; // height of the cost matrix
-    const W = C[0].length; // width of the cost matrix
-    if (J > W) {
-        throw new Error('Number of items cannot exceed number of positions');
-    }
-    // job[w] = job assigned to w-th worker, or -1 if no job assigned
-    // note: a W-th worker was added for convenience
-    const job = new Array(W + 1).fill(-1);
-    const ys = new Array(J).fill(0);
-    const yt = new Array(W + 1).fill(0); // potentials
-    const inf = Number.MAX_SAFE_INTEGER;
-    for (let jCur = 0; jCur < J; ++jCur) { // assign jCur-th job
-        let wCur = W;
-        job[wCur] = jCur;
-        // min reduced cost over edges from Z to worker w
-        const minTo = new Array(W + 1).fill(inf);
-        const prev = new Array(W + 1).fill(-1); // previous worker on alternating path
-        const inZ = new Array(W + 1).fill(false); // whether worker is in Z
-        while (job[wCur] !== -1) { // runs at most jCur + 1 times
-            inZ[wCur] = true;
-            const j = job[wCur];
-            let delta = inf;
-            let wNext = 0;
-            for (let w = 0; w < W; ++w) {
-                if (!inZ[w]) {
-                    const q = C[j][w] - ys[j] - yt[w];
-                    if (q < minTo[w]) {
-                        minTo[w] = q;
-                        prev[w] = wCur;
-                    }
-                    if (minTo[w] < delta) {
-                        delta = minTo[w];
-                        wNext = w;
-                    }
-                }
-            }
-            // delta will always be nonnegative,
-            // except possibly during the first time this loop runs
-            // if any entries of C[jCur] are negative
-            for (let w = 0; w <= W; ++w) {
-                if (inZ[w]) {
-                    ys[job[w]] += delta;
-                    yt[w] -= delta;
-                }
-                else {
-                    minTo[w] -= delta;
-                }
-            }
-            wCur = wNext;
-        }
-        // update assignments along alternating path
-        let w;
-        for (; wCur !== W; wCur = w) {
-            w = prev[wCur];
-            job[wCur] = job[w];
-        }
-    }
-    // Extract assignment indices for each job
-    const result = new Array(J);
-    for (let w = 0; w < W; ++w) {
-        if (job[w] !== -1) {
-            result[job[w]] = w;
-        }
-    }
-    return result;
-}
-//# sourceMappingURL=calculateHungarianAlgorithm.js.map

package/dist/src/helpers/calculateHungarianAlgorithm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateHungarianAlgorithm.js","sourceRoot":"","sources":["../../../src/helpers/calculateHungarianAlgorithm.ts"],"names":[],"mappings":";;AAKA,kEAyFC;AA9FD;;;;GAIG;AACH,SAAgB,2BAA2B,CAAC,WAAuB;IAC/D,sBAAsB;IACtB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAClE,CAAC;IAED,+FAA+F;IAC/F,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEvD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,4BAA4B;IAChD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,2BAA2B;IAElD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACR,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;IACzE,CAAC;IAED,iEAAiE;IACjE,gDAAgD;IAChD,MAAM,GAAG,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,EAAE,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;IAE5D,MAAM,GAAG,GAAG,MAAM,CAAC,gBAAgB,CAAC;IAEpC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,qBAAqB;QACxD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QAEjB,iDAAiD;QACjD,MAAM,KAAK,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnD,MAAM,IAAI,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,sCAAsC;QACxF,MAAM,GAAG,GAAc,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,yBAAyB;QAE9E,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,8BAA8B;YACrD,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACjB,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,IAAI,KAAK,GAAG,GAAG,CAAC;YAChB,IAAI,KAAK,GAAG,CAAC,CAAC;YAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACV,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;oBAClC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;wBACf,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACb,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;oBACnB,CAAC;oBACD,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC;wBACnB,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACjB,KAAK,GAAG,CAAC,CAAC;oBACd,CAAC;gBACL,CAAC;YACL,CAAC;YAED,oCAAoC;YACpC,uDAAuD;YACvD,yCAAyC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC1B,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACT,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;oBACpB,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;gBACnB,CAAC;qBACI,CAAC;oBACF,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;gBACtB,CAAC;YACL,CAAC;YACD,IAAI,GAAG,KAAK,CAAC;QACjB,CAAC;QAED,4CAA4C;QAC5C,IAAI,CAAS,CAAC;QACd,OAAO,IAAI,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC;YAC1B,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IAED,0CAA0C;IAC1C,MAAM,MAAM,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/src/helpers/calculateHungarianAlgorithm.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=calculateHungarianAlgorithm.test.d.ts.map

package/dist/src/helpers/calculateHungarianAlgorithm.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateHungarianAlgorithm.test.d.ts","sourceRoot":"","sources":["../../../src/helpers/calculateHungarianAlgorithm.test.ts"],"names":[],"mappings":""}

package/dist/src/helpers/calculateHungarianAlgorithm.test.js

@@ -1,291 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const calculateHungarianAlgorithm_js_1 = require("./calculateHungarianAlgorithm.js");
-function test(matrix, expectedIndexes) {
-    const result = (0, calculateHungarianAlgorithm_js_1.calculateHungarianAlgorithm)(matrix);
-    expect(result).toEqual(expectedIndexes);
-}
-function testOptimalSum(matrix) {
-    const result = (0, calculateHungarianAlgorithm_js_1.calculateHungarianAlgorithm)(matrix);
-    // Verify result has correct length
-    expect(result).toHaveLength(matrix.length);
-    // Verify each index is used exactly once
-    const uniqueIndexes = new Set(result);
-    expect(uniqueIndexes.size).toBe(result.length);
-    // Verify all indexes are valid
-    result.forEach((colIndex, rowIndex) => {
-        expect(colIndex).toBeGreaterThanOrEqual(0);
-        expect(colIndex).toBeLessThan(matrix[rowIndex].length);
-    });
-    // Calculate sum for this assignment
-    const sum = result.reduce((total, colIndex, rowIndex) => {
-        return total + matrix[rowIndex][colIndex];
-    }, 0);
-    // Verify this is indeed optimal by checking all possible permutations for small matrices
-    if (matrix.length <= 10) {
-        const allPermutations = generatePermutations(Array.from({ length: Math.min(matrix.length, matrix[0].length) }, (_, i) => i));
-        let maxSum = -Infinity;
-        for (const perm of allPermutations) {
-            if (perm.length === matrix.length) {
-                const permSum = perm.reduce((total, colIndex, rowIndex) => {
-                    return total + matrix[rowIndex][colIndex];
-                }, 0);
-                maxSum = Math.max(maxSum, permSum);
-            }
-        }
-        expect(sum).toBe(maxSum);
-    }
-    return { result, sum };
-}
-function generatePermutations(arr) {
-    if (arr.length <= 1)
-        return [arr];
-    const result = [];
-    for (let i = 0; i < arr.length; i++) {
-        const rest = [...arr.slice(0, i), ...arr.slice(i + 1)];
-        const perms = generatePermutations(rest);
-        for (const perm of perms) {
-            result.push([arr[i], ...perm]);
-        }
-    }
-    return result;
-}
-describe('calculateHungarianAlgorithm', () => {
-    it('should returns the highest possible combination', () => {
-        test([
-            [0, 10, 20],
-            [0, 30, 45],
-            [0, 50, 60],
-        ], [0, 2, 1]); // 45 + 50 = 95, which is the highest possible combination
-    });
-    describe('Handling indeterminate cases', () => {
-        it('when there are two equal options, it returns the lowest indexes', () => {
-            test([
-                [0, 10, 20],
-                [0, 30, 40],
-                [0, 50, 60],
-            ], [0, 1, 2]); // not 0, 2, 1
-            test([
-                [0, 10, 20],
-                [0, 50, 60],
-                [0, 30, 40],
-            ], [0, 1, 2]);
-        });
-        it('Last one in the list of indeterminate cases receives no discount 3x3', () => {
-            test([
-                [0, 10, 10],
-                [0, 10, 10],
-                [0, 10, 10],
-            ], [1, 2, 0]);
-        });
-        it('Last one in the list of indeterminate cases receives no discount 4x4', () => {
-            test([
-                [0, 10, 10, 10],
-                [0, 10, 10, 10],
-                [0, 10, 10, 10],
-                [0, 10, 10, 10],
-            ], [1, 2, 3, 0]);
-        });
-        it('Last two in the list of indeterminate cases receives no discount 4x4', () => {
-            test([
-                [0, 10, 10, 0],
-                [0, 10, 10, 0],
-                [0, 10, 10, 0],
-                [0, 10, 10, 0],
-            ], [1, 2, 0, 3]);
-        });
-        it('Last three in the list of indeterminate cases receives no discount 5x5', () => {
-            test([
-                [0, 10, 10, 0, 0],
-                [0, 10, 10, 0, 0],
-                [0, 10, 10, 0, 0],
-                [0, 10, 10, 0, 0],
-                [0, 10, 10, 0, 0],
-            ], [1, 2, 0, 3, 4]);
-        });
-    });
-    describe('Edge cases', () => {
-        it('should handle 1x1 matrix', () => {
-            test([[42]], [0]);
-        });
-        it('should handle 2x2 matrix', () => {
-            test([
-                [10, 5],
-                [3, 8],
-            ], [0, 1]);
-        });
-        it('should handle matrices with all zeros', () => {
-            test([
-                [0, 0, 0],
-                [0, 0, 0],
-                [0, 0, 0],
-            ], [0, 1, 2]); // always prefer the lowest indexes for first items
-        });
-        it('should handle matrices with negative values', () => {
-            test([
-                [-10, -5, -1],
-                [-3, -8, -2],
-                [-6, -4, -9],
-            ], [2, 0, 1]); // -1 + (-3) + (-4) = -8 is the maximum (least negative)
-        });
-        it('should handle matrices with mixed positive and negative values', () => {
-            testOptimalSum([
-                [10, -5, 3],
-                [-2, 8, 1],
-                [4, -1, 6],
-            ]);
-        });
-    });
-    describe('Larger matrices', () => {
-        it('should handle 4x4 matrix', () => {
-            testOptimalSum([
-                [82, 83, 69, 92],
-                [77, 37, 49, 92],
-                [11, 69, 5, 86],
-                [8, 9, 98, 23],
-            ]);
-        });
-        it('should handle 5x5 matrix', () => {
-            testOptimalSum([
-                [12, 7, 9, 15, 3],
-                [8, 14, 6, 11, 18],
-                [13, 5, 16, 2, 10],
-                [4, 17, 1, 8, 12],
-                [19, 3, 11, 7, 14],
-            ]);
-        });
-        it('should handle 6x6 matrix', () => {
-            testOptimalSum([
-                [23, 17, 31, 12, 8, 45],
-                [19, 28, 14, 33, 22, 11],
-                [36, 9, 25, 18, 41, 7],
-                [15, 34, 6, 29, 13, 38],
-                [42, 21, 39, 4, 27, 16],
-                [10, 35, 20, 46, 1, 32],
-            ]);
-        });
-    });
-    describe('Special patterns', () => {
-        it('should handle identity-like matrices (diagonal has highest values)', () => {
-            test([
-                [100, 1, 1],
-                [1, 100, 1],
-                [1, 1, 100],
-            ], [0, 1, 2]); // Should pick the diagonal
-        });
-        it('should handle anti-diagonal pattern', () => {
-            test([
-                [1, 1, 100],
-                [1, 100, 1],
-                [100, 1, 1],
-            ], [2, 1, 0]); // Should pick the anti-diagonal
-        });
-        it('should handle matrices with duplicate maximum values', () => {
-            testOptimalSum([
-                [50, 50, 10],
-                [10, 50, 50],
-                [50, 10, 50],
-            ]);
-        });
-        it('should handle increasing sequences', () => {
-            testOptimalSum([
-                [1, 2, 3, 4],
-                [2, 3, 4, 5],
-                [3, 4, 5, 6],
-                [4, 5, 6, 7],
-            ]);
-        });
-        it('should handle decreasing sequences', () => {
-            testOptimalSum([
-                [7, 6, 5, 4],
-                [6, 5, 4, 3],
-                [5, 4, 3, 2],
-                [4, 3, 2, 1],
-            ]);
-        });
-    });
-    describe('Performance and stress tests', () => {
-        it('should handle larger matrices correctly', () => {
-            const size = 10;
-            const matrix = Array.from({ length: size }, (_, i) => Array.from({ length: size }, (_, j) => Math.floor(Math.random() * 1000)));
-            testOptimalSum(matrix); // because it is 10x10 the result will still be checked against all permutations
-        }, 1000);
-        it('should handle larger matrices efficiently', () => {
-            const size = 500;
-            const matrix = Array.from({ length: size }, (_, i) => Array.from({ length: size }, (_, j) => Math.floor(Math.random() * 1000)));
-            testOptimalSum(matrix);
-        }, 1000);
-        it('throws at 501 matrix', () => {
-            const size = 501;
-            const matrix = Array.from({ length: size }, (_, i) => Array.from({ length: size }, (_, j) => Math.floor(Math.random() * 1000)));
-            expect(() => (0, calculateHungarianAlgorithm_js_1.calculateHungarianAlgorithm)(matrix)).toThrow('Too many items to process. Maximum is 500.');
-        }, 1000);
-        it('should be deterministic (same input produces same output)', () => {
-            const matrix = [
-                [15, 23, 7, 31],
-                [12, 8, 25, 19],
-                [28, 16, 4, 22],
-                [9, 33, 18, 5],
-            ];
-            const result1 = (0, calculateHungarianAlgorithm_js_1.calculateHungarianAlgorithm)(matrix);
-            const result2 = (0, calculateHungarianAlgorithm_js_1.calculateHungarianAlgorithm)(matrix);
-            const result3 = (0, calculateHungarianAlgorithm_js_1.calculateHungarianAlgorithm)(matrix);
-            expect(result1).toEqual(result2);
-            expect(result2).toEqual(result3);
-        });
-    });
-    describe('Real-world scenarios', () => {
-        it('should handle cost minimization by negating values', () => {
-            // Original cost matrix (we want to minimize cost)
-            const costMatrix = [
-                [4, 6, 8],
-                [2, 9, 1],
-                [7, 3, 5],
-            ];
-            // Convert to maximization problem by negating
-            const maxMatrix = costMatrix.map(row => row.map(val => -val));
-            // Verify this gives minimum cost assignment
-            test(maxMatrix, [
-                0,
-                2,
-                1,
-            ]);
-        });
-        it('should handle worker-task assignment scenario', () => {
-            // Productivity scores for workers assigned to tasks
-            const productivityMatrix = [
-                [85, 92, 78, 88], // Worker 1's productivity on tasks 1-4
-                [90, 76, 85, 82], // Worker 2's productivity on tasks 1-4
-                [78, 88, 92, 85], // Worker 3's productivity on tasks 1-4
-                [88, 85, 80, 90], // Worker 4's productivity on tasks 1-4
-            ];
-            testOptimalSum(productivityMatrix);
-        });
-    });
-    describe('Boundary value testing', () => {
-        it('should handle very large values', () => {
-            testOptimalSum([
-                [1000000, 999999, 1000001],
-                [999998, 1000002, 999997],
-                [1000003, 999996, 1000000],
-            ]);
-        });
-        it('should handle small values', () => {
-            testOptimalSum([
-                [1, 2, 3],
-                [2, 1, 4],
-                [3, 4, 1],
-            ]);
-        });
-        it('should handle zero and one combinations', () => {
-            test([
-                [0, 1, 0],
-                [1, 0, 1],
-                [0, 1, 0],
-            ], [
-                1, 0, 2, // Last one doesn't receive a discount (least priority)
-            ]);
-        });
-    });
-});
-//# sourceMappingURL=calculateHungarianAlgorithm.test.js.map

package/dist/src/helpers/calculateHungarianAlgorithm.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateHungarianAlgorithm.test.js","sourceRoot":"","sources":["../../../src/helpers/calculateHungarianAlgorithm.test.ts"],"names":[],"mappings":";;AAAA,qFAA+E;AAE/E,SAAS,IAAI,CAAC,MAAkB,EAAE,eAAyB;IACvD,MAAM,MAAM,GAAG,IAAA,4DAA2B,EAAC,MAAM,CAAC,CAAC;IACnD,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;AAC5C,CAAC;AAED,SAAS,cAAc,CAAC,MAAkB;IACtC,MAAM,MAAM,GAAG,IAAA,4DAA2B,EAAC,MAAM,CAAC,CAAC;IAEnD,mCAAmC;IACnC,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE3C,yCAAyC;IACzC,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE/C,+BAA+B;IAC/B,MAAM,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;QAClC,MAAM,CAAC,QAAQ,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,oCAAoC;IACpC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE;QACpD,OAAO,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC,EAAE,CAAC,CAAC,CAAC;IAEN,yFAAyF;IACzF,IAAI,MAAM,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;QACtB,MAAM,eAAe,GAAG,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7H,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;QAEvB,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE;oBACtD,OAAO,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC;gBAC9C,CAAC,EAAE,CAAC,CAAC,CAAC;gBACN,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACvC,CAAC;QACL,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,oBAAoB,CAAI,GAAQ;IACrC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IACzC,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACvD,IAAI,CAAC;YACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;SACd,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,0DAA0D;IAC7E,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC1C,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YACvE,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;aACd,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;YAE7B,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;aACd,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC5E,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACX,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;aACd,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC5E,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACf,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACf,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACf,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;aAClB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC5E,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACd,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACd,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACd,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;aACjB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;YAC9E,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;aACpB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,IAAI,CAAC;gBACD,CAAC,EAAE,EAAE,CAAC,CAAC;gBACP,CAAC,CAAC,EAAE,CAAC,CAAC;aACT,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACZ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,mDAAmD;QACtE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACZ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACf,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,wDAAwD;QAC3E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;YACtE,cAAc,CAAC;gBACX,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACV,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;aACb,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC7B,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,cAAc,CAAC;gBACX,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBAChB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBAChB,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACf,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;aACjB,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,cAAc,CAAC;gBACX,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBAClB,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjB,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;aACrB,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,cAAc,CAAC;gBACX,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACxB,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACtB,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACvB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACvB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;aAC1B,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;YAC1E,IAAI,CAAC;gBACD,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC;aACd,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,2BAA2B;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC;gBACX,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACX,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;aACd,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,gCAAgC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC5D,cAAc,CAAC;gBACX,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACZ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;gBACZ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;aACf,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,cAAc,CAAC;gBACX,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACf,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,cAAc,CAAC;gBACX,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACf,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC1C,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,IAAI,GAAG,EAAE,CAAC;YAChB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAC3E,CAAC;YAEF,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,gFAAgF;QAC5G,CAAC,EAAE,IAAK,CAAC,CAAC;QAEV,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,IAAI,GAAG,GAAG,CAAC;YACjB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAC3E,CAAC;YAEF,cAAc,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC,EAAE,IAAK,CAAC,CAAC;QAEV,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC5B,MAAM,IAAI,GAAG,GAAG,CAAC;YACjB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAC3E,CAAC;YAEF,MAAM,CAAC,GAAG,EAAE,CAAC,IAAA,4DAA2B,EAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC;QAC5G,CAAC,EAAE,IAAK,CAAC,CAAC;QAEV,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACjE,MAAM,MAAM,GAAG;gBACX,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACf,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;gBACf,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBACf,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;aACjB,CAAC;YAEF,MAAM,OAAO,GAAG,IAAA,4DAA2B,EAAC,MAAM,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,IAAA,4DAA2B,EAAC,MAAM,CAAC,CAAC;YACpD,MAAM,OAAO,GAAG,IAAA,4DAA2B,EAAC,MAAM,CAAC,CAAC;YAEpD,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACjC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC1D,kDAAkD;YAClD,MAAM,UAAU,GAAG;gBACf,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACZ,CAAC;YAEF,8CAA8C;YAC9C,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAE9D,4CAA4C;YAC5C,IAAI,CAAC,SAAS,EAAE;gBACZ,CAAC;gBACD,CAAC;gBACD,CAAC;aACJ,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,oDAAoD;YACpD,MAAM,kBAAkB,GAAG;gBACvB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,uCAAuC;gBACzD,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,uCAAuC;gBACzD,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,uCAAuC;gBACzD,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,uCAAuC;aAC5D,CAAC;YAEF,cAAc,CAAC,kBAAkB,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACvC,cAAc,CAAC;gBACX,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC;gBAC1B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC;gBACzB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC;aAC7B,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YAClC,cAAc,CAAC;gBACX,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACZ,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,IAAI,CAAC;gBACD,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aACZ,EAAE;gBACC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,uDAAuD;aACnE,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/src/helpers/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/helpers/index.ts"],"names":[],"mappings":"AAAA,cAAc,6BAA6B,CAAC;AAC5C,cAAc,gBAAgB,CAAC"}

package/dist/src/helpers/index.js

@@ -1,6 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const tslib_1 = require("tslib");
-tslib_1.__exportStar(require("./EventPermissionChecker.js"), exports);
-tslib_1.__exportStar(require("./TagHelper.js"), exports);
-//# sourceMappingURL=index.js.map

package/dist/src/helpers/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/helpers/index.ts"],"names":[],"mappings":";;;AAAA,sEAA4C;AAC5C,yDAA+B"}

package/dist/src/helpers/uuidToName.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"uuidToName.d.ts","sourceRoot":"","sources":["../../../src/helpers/uuidToName.ts"],"names":[],"mappings":"AAEA,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,iBAuBtC"}